Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Synthesis of pseudo Kronecker lattice diagrams
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
Institute of Computer Science, Albert-Ludwigs-University.
Institute of Computer Science, Albert-Ludwigs-University.
1999 (English)In: Proceedings: International Conference on Computer Design (ICCD '99) : 10 - 13 October 1999, Austin, Te, Los Alamitos, Calif: IEEE Communications Society, 1999, 307-310 p.Conference paper, Published paper (Refereed)
Abstract [en]

The design process of digital circuits is often carried out in individual steps, like logic minimization, mapping and routing. This leads to quality loss, e.g. in cases where highly optimized netlists fit badly onto the target architecture. Lattice diagrams have been proposed as one possible solution. They offer a regular two dimensional structure, thus overcoming the routing problem. However elegant, presented methods have only been shown to find practical lattice representations for small functions. We present heuristic synthesis methods for Pseudo-Symmetric Pseudo Kronecker Decision Diagrams (PSP-KDDs) applicable to incompletely specified multiple output functions. The lattice structure maps directly to both ASICs and fine grain FPGAs. Our method (combining logic minimization, mapping and routing) seeks to minimize area and delay by heuristic methods. Experimental results on a set of MCNC benchmarks show superior quality to previous methods and in many cases even optimal depth results for unfolded lattices

Place, publisher, year, edition, pages
Los Alamitos, Calif: IEEE Communications Society, 1999. 307-310 p.
National Category
Embedded Systems
Research subject
Embedded System
Identifiers
URN: urn:nbn:se:ltu:diva-39995DOI: 10.1109/ICCD.1999.808556Local ID: ef542e20-1209-11dd-ada4-000ea68e967bISBN: 0-7695-0406-X (print)OAI: oai:DiVA.org:ltu-39995DiVA: diva2:1013515
Conference
International Conference on Computer Design : 10/10/1999 - 13/10/1999
Note
Godkänd; 1999; 20080424 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-10-19Bibliographically approved

Open Access in DiVA

fulltext(74 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 74 kBChecksum SHA-512
97a3533557ade245dc9fa7a043b6c883811dd3597dab7b00978220bc4820667ee3345afc8950be840cf46707b05c10a097bb7969bf4606262100cac7cbdd6e7b
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Lindgren, Per
By organisation
Embedded Internet Systems Lab
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf