Designing combinational circuits with list homomorphisms

Walter Dosch

doi:10.1109/SERA.2005.35

Designing combinational circuits with list homomorphisms

Walter Dosch

Institute of Software Engineering and Programming Languages

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 language	English
Title of host publication	Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)
Number of pages	10
Publisher	IEEE
Publication date	01.12.2005
Pages	288-297
Article number	1563175
ISBN (Print)	0-7695-2297-1, 978-076952297-5
DOIs	https://doi.org/10.1109/SERA.2005.35
Publication status	Published - 01.12.2005
Event	3rd ACIS International Conference on Software Engineering Research, Management and Applications - Mount Pleasant, United States Duration: 11.08.2005 → 13.08.2005 Conference number: 68867

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/SERA.2005.35

Cite this

@inproceedings{2bdd5673a3de4596a4e916b39680992d,

title = "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.",

author = "Walter Dosch",

year = "2005",

month = dec,

day = "1",

doi = "10.1109/SERA.2005.35",

language = "English",

isbn = "0-7695-2297-1",

series = "IEEE Proceedings",

publisher = "IEEE",

pages = "288--297",

booktitle = "Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)",

note = "3rd ACIS International Conference on Software Engineering Research, Management and Applications, SERA 2005 ; Conference date: 11-08-2005 Through 13-08-2005",

}

Dosch, W 2005, Designing combinational circuits with list homomorphisms. in Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)., 1563175, IEEE Proceedings, IEEE, pp. 288-297, 3rd ACIS International Conference on Software Engineering Research, Management and Applications, Mount Pleasant, Michigan, United States, 11.08.05. https://doi.org/10.1109/SERA.2005.35

TY - GEN

T1 - Designing combinational circuits with list homomorphisms

AU - Dosch, Walter

N1 - Conference code: 68867

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-33845970882&origin=inward&txGid=899d0110e1590836aa140048bf66511c

U2 - 10.1109/SERA.2005.35

DO - 10.1109/SERA.2005.35

M3 - Conference contribution

SN - 0-7695-2297-1

SN - 978-076952297-5

T3 - IEEE Proceedings

SP - 288

EP - 297

BT - Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)

PB - IEEE

T2 - 3rd ACIS International Conference on Software Engineering Research, Management and Applications

Y2 - 11 August 2005 through 13 August 2005

ER -

Designing combinational circuits with list homomorphisms

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this