Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{155674,
        author = {M.Bhavani and L.Jahnavi and K.Vasanthi and K.Kavitha Rani and M.Sandhya Rani and K.Krissi Praneetha},
        title = {DESIGN AND IMPLEMENTATION OF WALLACE TREE MULTIPLIER USING PARALLEL PREFIX ADDERS},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {1},
        pages = {1445-1450},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=155674},
        abstract = {Delays have become increasingly crucial in modern VLSI technology. In order to design the circuit, an efficient ALU is required. All logical computations, such as addition and multiplication, are handled by the ALU. Multiplication is used to reduce the number of partial products while increasing the speed of the operation. An adder is the fundamental building block of every digital design. Any adder should be able to satisfy in terms of speed and area. The area (number of LUTs), delay (ns), and number of bonded IOBs of the 16-bit Wallace tree multiplier and 16-bit Parallel prefix adders (Carry look-ahead adder, Kogge stone adder, and Brent Kung adder) are compared in this project. VLSI and simulation were used to design these, and Xilinx was used to synthesis them (ISE) 14.7.},
        keywords = {Arithmetic Logic Unit (ALU), Brent Kung adder (BKA), Carry look-ahead adder (CLA), Kogge stone adder (KSA), Parallel prefix adders (PPAs), Wallace tree multiplier},
        month = {},
        }