The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Designing combinational circuits with list homomorphisms
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
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.
How it got here
How it got here
agent via openalex
Added
2026-10-25 20:23 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{dosch2005designing,
title = {Designing combinational circuits with list homomorphisms},
author = {Walter Dosch},
year = {2005},
volume = {1546},
pages = {288--297},
doi = {10.1109/sera.2005.35},
}