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.

Original languageEnglish
Title of host publicationThird ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)
Number of pages10
PublisherIEEE
Publication date01.12.2005
Pages288-297
Article number1563175
ISBN (Print)0-7695-2297-1, 978-076952297-5
DOIs
Publication statusPublished - 01.12.2005
Event3rd ACIS International Conference on Software Engineering Research, Management and Applications - Mount Pleasant, United States
Duration: 11.08.200513.08.2005
Conference number: 68867

Fingerprint

Dive into the research topics of 'Designing combinational circuits with list homomorphisms'. Together they form a unique fingerprint.

Cite this