DocumentCode
1035619
Title
Dynamic computational blocks for bit-level systolic arrays
Author
Jullien, Graham A. ; Miller, William C. ; Grondin, Roger ; Pup, Lino Del ; Bizzan, Sami S. ; Zhang, Dapeng
Author_Institution
VLSI Res. Group, Windsor Univ., Ont., Canada
Volume
29
Issue
1
fYear
1994
fDate
1/1/1994 12:00:00 AM
Firstpage
14
Lastpage
22
Abstract
Integrated dynamic logic trees with latches provide cost effective circuit techniques for building massively pipelined, systolic, computational blocks operating at the bit level. Recent results have demonstrated that dynamic pipelines are capable of very high switching speeds with appropriate circuit design techniques. In this paper we trade some of this speed for much higher functionality of each logic block. The resulting throughput rate remains sufficiently high for useful applications, but results in substantial area and power savings. Design techniques for the individual logic trees (switching trees) are based on simple graph theoretic rules. Examples are shown to support the technique
Keywords
CMOS integrated circuits; adders; digital arithmetic; integrated logic circuits; minimisation of switching nets; pipeline processing; systolic arrays; trees (mathematics); CMOS technologies; area saving; arithmetic arrays; bit-level systolic arrays; circuit design; dynamic computational blocks; dynamic pipelines; full binary tree; graph theoretic rules; high switching speeds; integrated dynamic logic trees; latches; logic block functionality; massively pipelined systolic computational blocks; minimization; pipelined adder cell; power saving; switching trees; throughput rate; Buildings; Circuit synthesis; Costs; Latches; Logic circuits; Pipelines; Switching circuits; Systolic arrays; Throughput; Tree graphs;
fLanguage
English
Journal_Title
Solid-State Circuits, IEEE Journal of
Publisher
ieee
ISSN
0018-9200
Type
jour
DOI
10.1109/4.272090
Filename
272090
Link To Document