Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Design space exploration for field programmable compressor trees
KTH, Skolan för informations- och kommunikationsteknik (ICT), Elektroniksystem.ORCID-id: 0000-0002-2171-1528
Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland.
Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland.
Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland.
Visa övriga samt affilieringar
2008 (Engelska)Ingår i: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems, New York: ACM Press, 2008, s. 207-216Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

The Field Programmable Compressor Tree (FPCT) is a programmable compressor tree (e.g., a Wallace or Dadda Tree) intended for integration in an FPGA or other reconfigurable device. This paper presents a design space exploration (DSE) method that can be used to identify the best FPCT architecture for a given set of arithmetic benchmark circuits; in practice, an FPGA vendor can use the design space exploration to tailor the FPCT to meet the needs of the most important benchmark circuits of the vendor’s largest-volume clients. One novel feature of the DSE is the introduction of a metric called I/O utilization; we found that I/O utilization has a strong correlation with both the critical path delay and area of the benchmark circuits under study. Pruning the search space using I/O utilization allowed us to reduce significantly the number of FPCTs that must be synthesized and evaluated during the DSE, while giving high confidence that the best architectures are still explored. The DSE was applied to seven small-to-medium range benchmark circuits; one FPCT architecture was found that was 30% faster than the second best in terms of critical path delay, and only 3.34% larger than the smallest.

Ort, förlag, år, upplaga, sidor
New York: ACM Press, 2008. s. 207-216
Serie
CASES ’08
Nyckelord [en]
design space exploration (dse), field programmable compressor tree (fpct)
Nationell ämneskategori
Inbäddad systemteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-62161DOI: 10.1145/1450095.1450126Scopus ID: 2-s2.0-63349107951OAI: oai:DiVA.org:kth-62161DiVA, id: diva2:479902
Konferens
Embedded Systems Week 2008 - 2008 International Conference on Compilers, Architecture and Synthesis for Embedded Systems, CASES'08;Atlanta, GA;19 October 2008 through 24 October 2008
Anmärkning
Qc 20120201Tillgänglig från: 2012-02-01 Skapad: 2012-01-18 Senast uppdaterad: 2012-03-22Bibliografiskt granskad

Open Access i DiVA

fulltext(384 kB)163 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 384 kBChecksumma SHA-512
b026a525ada531fbe79ece848bcb69361c655e3d9316941a2c4d6165515131f534510032e3d4f152642a744cda9aeabd909ff2e9a96cb299b60f1a37ff7cd7be
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Attarzadeh Niaki, Seyed Hosein

Sök vidare i DiVA

Av författaren/redaktören
Attarzadeh Niaki, Seyed Hosein
Av organisationen
Elektroniksystem
Inbäddad systemteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 163 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 438 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf