Implementation of Efficient Ladner-Fischer Adder Using Binary Logic
Abstract
Full Text:
PDFReferences
Das S, Khatri SP. A novel hybrid parallel-prefix adder architecture with efficient timing-area characteristic. IEEE Trans Very Large Scale Integr Syst. 2008; 16(3): 326–331p.
Lm YC, Su CY. Faster optimal parallel prefix circuit: new algorithm construction. J Parall Distrib Comput. 2005; 65(1): 1585–1595p.
Choi Y, Swatzlandr Jr. EE. Parallel prefix adder design with matrix representation. In: Proceedings of17th IEEE Symposium Computer Arithmetic. 2005, pp. 90–98.
Brent RP, Kung HT. A regular layout for parallel adders. IEEE Trans Comput. 1982; 31(3): 260–264pp.
Kogge PM, Stone HS. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans Comput. 1973; C-22(8): 783–791p.
Ladner RE, Fischer MI. Parallel prefix computation. J ACM. 1930; 27(4): 831–838p.
Jadhav P, Zode PP. Design and implementation of high speed parallel prefix Lmg adder. ISSN(PRINT):2320-8945.
Knowles S. A family of adders. In: Proceedings of 14th IEEE Symposium on Computer Arithmetic. 1999, April, pp. 30–34.
Dimitrakopoulos G, Nikolas D. High speed parallel prefix VLSI ling adders. IEEE Trans Comput. 2005; 54(2).
Refbacks
- There are currently no refbacks.