Designing combinational circuits with list homomorphisms

  • Authors:
  • Walter Dosch

  • Affiliations:
  • Institute of Software Technology and Programming Languages, University of Läbeck, Ratzeburger Allee 160, D-23538 Läbeck, Germany. E-mail: dosch@isp.uni-luebeck.de

  • Venue:
  • Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.