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
Improved algorithms for efficient symbolic support set minimization
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1995 (English)In: Proceedings / International Workshop on Logic and Architecture Synthesis: organized by IFIP TC10 WG10.5, Institut National Polytechnique de Grenoble , 1995, 38-44 p.Conference paper, Published paper (Refereed)
Abstract [en]

We propose an improved algorithm for computing support sets for icompletely specified boolean functions. The problem to compute a compatible function with minimal support set, with respect to various criteria, arises in many applications, for example FPGA synthesis. By incorporating new lookup techniques together with lazy evaluation, we are able to prune the search space for possible mappings of the don't care set. We also suggest a new approach to the problem of support set minimization. The new algorithm computes the least specified compatible functions for all possible support sets up to 20 times faster than previous algorithms.

Place, publisher, year, edition, pages
Institut National Polytechnique de Grenoble , 1995. 38-44 p.
National Category
Embedded Systems
Research subject
Embedded System
Identifiers
URN: urn:nbn:se:ltu:diva-37445Local ID: b79884c0-12a6-11dd-ada4-000ea68e967bOAI: oai:DiVA.org:ltu-37445DiVA: diva2:1010943
Conference
International Workshop on Logic and Architecture Synthesis : 18/12/1995 - 19/12/1995
Note
Godkänd; 1995; 20080425 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-10-19Bibliographically approved

Open Access in DiVA

fulltext(177 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 177 kBChecksum SHA-512
f27012998883236c6dd25996f7a4d1631640036338eab13c384c95c60d78c2a34d61a74d3590b7002d6ba1d512e237e053b48b39326dfea13096d359bd4185e5
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Lindgren, PerSundström, Mikael
By organisation
Embedded Internet Systems LabComputer Science
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 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

Total: 8 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