Designing combinational circuits with list homomorphisms

Abstract

We present a framework for the unifying high-level synthesis of tree-structured and iterative combinational networks. Based on the theory of list homomorphisms, we develop a standard implementation for tree-structured modules processing the input digits in parallel. The design is systematically specialized to iterative networks processing the input sequentially from the least resp. from the highest significant positions. Throughout the paper, we explicate functional methods for the transformational design of combinational circuits. We illustrate the approach with a parity generator module, a comparator module, and a priority resolution module.

OriginalspracheEnglisch
TitelThird ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)
Seitenumfang10
Herausgeber (Verlag)IEEE
Erscheinungsdatum01.12.2005
Seiten288-297
Aufsatznummer1563175
ISBN (Print)0-7695-2297-1, 978-076952297-5
DOIs
PublikationsstatusVeröffentlicht - 01.12.2005
Veranstaltung3rd ACIS International Conference on Software Engineering Research, Management and Applications - Mount Pleasant, USA / Vereinigte Staaten
Dauer: 11.08.200513.08.2005
Konferenznummer: 68867

Fingerprint

Untersuchen Sie die Forschungsthemen von „Designing combinational circuits with list homomorphisms“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren