Two different CMOS implementations of the Manchester carry-skip adder are analyzed using the RC timing model, which provides a unified way of analyzing both CMOS circuits and interconnect. Based on the RC timing model, the authors develop efficient polynomial algorithms to determine near-optimal (in latency) as well as optimal block sizes for the one-level manchester adder with variable carry-skip. An analysis shows that the carry-skip delay in a Manchester adder block is linearly proportional to the block size. The approach provides a general paradigm for analysis and design, applicable to different models of ripple-propagation and carry skip
Published in:
Computers, IEEE Transactions on
(Volume:39
,
Issue:
8
)
Date of Publication:
Aug 1990
- Page(s):
-
983
-
992
- ISSN :
-
0018-9340
- INSPEC Accession Number:
-
3758297
- Digital Object Identifier :
-
10.1109/12.57038
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 August 2002
- Issue Date :
-
Aug 1990
- Sponsored by :
-
IEEE Computer Society