Design of Wallace Tree Multiplier using Modified Carry Save Adder
R. Varatharajan, “Low power BISTTPG for high fault converage”, International Journal of Information Engineering and Electronic Buisness, Vol 4.no.2, August 2012.
David Harris, “A Taxonomy of Parallel prefix networks”, 37th conference on Signals, Systems & Computers, 2003.
Kostas Vitoroulis “Parallel prefix adders: notes” Concordia university, 2006.
Nuno Roma, Tiago Dias & Leonel Sousa “Fast adder architectures :modelling & experimental evaluation” IST/INESC-ID, Lisbon, Portugal ,project under Portuguese foundation for science and technology
Ron S. Waters, Earl E.Swartzlander “A Reduced Complexity Wallace multiplier reduction” in IEEE transactions on Computers, Aug. 2010.
Taeko Matsunaga and Yuske Matsunaga “Timing constrained Area minimization algorithm for Parallel prefix adders”, IEICE transaction fundamentals, Vol.E90-A, No.12, Dec. 2007.
Wallace C.S. “A Suggestion for a fast multiplier” in IEEE transactions on Electronics & Computers, 1964.
Whitney J. Townsend, Earl E.Swartzlander, Jacob A. Abraham “A comparison of Dadda and Wallace multiplier delays” University of Texas at Austin, work under National Science foundation graduate research fellowship.
V. G. Oklobdzija, “High-Speed VLSI Arithmetic Units: Adders and Multipliers”, in “Design of High-Performance Microprocessor Circuits”, Book edited by A.Chandrakasan,IEEE Press,2000
O. J. Bedrij, “Carry-Select Adder”, IRE Transactions on Electronic Computers, p.340-344, 1962
R. P. Brent and H. T. Kung, “A Regular Layout for Parallel Adders”, IEEE Transaction on computers, Vol. C-31, No.3, p.260-264, March, 1982.
Paul F.Stelling, “Design strategies for optimal hybrid final adders in parallel multiplier”,Journal of VLSI signal processing, vol 14,pp,321-331,1996.
L. Dadda, “Some schemes for parallel multipliers,” Alta Frequenza, vol.34,pp.349-356,1965
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.