Woodchuck: a low-level synthesizer for dynamic pipelined DSP arithmetic logic blocks

A synthesizer for building complex logic blocks for either pipelined or Domino/NORA dynamic logic is discussed. The block is built by programming a ROM, built from a binary tree of n-channel transistors, followed by a simple minimization procedure using only two graph minimization rules. This is in contrast to the usual techniques, which map minimized Boolean functions directly to transistor configurations. Merged trees have been successfully fabricated, up to six high, and these complex blocks are shown to have advantages in pipelined arrays for high-performance (DSP) arithmetic The synthesizer produces the trees directly from arithmetic specifications; the trees can be scaled, within the synthesizer, using closed-form approximate discharge formulas.<<ETX>>

[1]  Christer Svensson,et al.  High-speed CMOS circuit technique , 1989 .

[2]  David L. Pulfrey,et al.  Design procedures for differential cascode voltage switch circuits , 1986 .

[3]  M. Shoji FFT scaling in Domino CMOS gates , 1985 .

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  Graham A. Jullien,et al.  Array processing on finite polynomial rings , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.

[6]  Hee Yong Youn,et al.  On Implementing Large Binary Tree Architectures in VLSI and WSI , 1989, IEEE Trans. Computers.

[7]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.