Proposed Title :
A Novel Method of Reversible Logic using Majority Logic Gate Full Adder and Compressor 4:2 for Wallace Tree Multiplier
Improvement of this project :
To design a Majority Logic Gate using Reversible Technique with using Feynman and Toffoli Gate.
To design a Reversible Majority Logic Gate Full Adder and Reversible Majority Logic Gate Compressor 4:2 and proved comparisons with Conventional Majority Logic Gate Full Adder and Conventional 4:2 Compressor.
To design a 8×8 Reversible Majority Logic Wallace Tree Multiplier using Conventional and Reversible Method with 16-bit Ladner Fischer Parallel Prefix Adder.
Software implementation:
- Modelsim
- Xilinx
Proposed System:
The latency of arithmetic adders and subsequently multipliers that are implemented as a succession of such Boolean operations grows significantly increases with bit-width and memory logic. In this study, we address the excessive latency by using the Wallace Tree multiplier architecture and enhancing the addition operation in each step of the Wallace Tree. This allows us to reduce the latency, memory logic and power significantly. Because this architecture was developed with majority logic gate using reversible technique, the majority logic primitive was used for the addition and 4:2 compressor to reduce number of partial product stage addition in Wallace Tree multiplier. In addition, a high degree of parallelism at the gate level is used at the array level by running several majority gates in each column of the array. In addition, the multiplier that has been presented may be implemented in a conventional transistor accessed memory array without the need for significant alterations to the peripheral circuitry of the array, and it uses a minimal amount of power. The proposed work of this paper to design a Majority Logic Gate using Reversible Technique with using Feynman and Toffoli Gate. And design a Reversible Majority Logic Gate Full Adder and Reversible Majority Logic Gate Compressor 4:2 and proved comparisons with Conventional Majority Logic Gate Full Adder and Conventional 4:2 Compressor. Thus the final design of 8×8 Reversible Majority Logic Wallace Tree Multiplier using Conventional and Reversible Method with 16-bit Ladner Fischer Parallel Prefix Adder. Finally this work was developed using Verilog HDL and synthesized using Xilinx Vertex-5 FPGA and compared all the parameters in terms of area, delay and power.
” Thanks for Visit this project Pages – Buy It Soon “
A Novel In-Memory Wallace Tree Multiplier Architecture Using Majority Logic
Terms & Conditions:
- Customer are advice to watch the project video file output, before the payment to test the requirement, correction will be applicable.
- After payment, if any correction in the Project is accepted, but requirement changes is applicable with updated charges based upon the requirement.
- After payment the student having doubts, correction, software error, hardware errors, coding doubts are accepted.
- Online support will not be given more than 3 times.
- On first time explanations we can provide completely with video file support, other 2 we can provide doubt clarifications only.
- If any Issue on Software license / System Error we can support and rectify that within end of the day.
- Extra Charges For duplicate bill copy. Bill must be paid in full, No part payment will be accepted.
- After payment, to must send the payment receipt to our email id.
- Powered by NXFEE INNOVATION, Pondicherry.
Payment Method :
- Pay Add to Cart Method on this Page
- Deposit Cash/Cheque on our a/c.
- Pay Google Pay/Phone Pay : +91 9789443203
- Send Cheque through courier
- Visit our office directly
- Pay using Paypal : Click here to get NXFEE-PayPal link
Bank Accounts
HDFC BANK ACCOUNT:
- NXFEE INNOVATION,
HDFC BANK, MAIN BRANCH, PONDICHERRY-605004.
INDIA,
ACC NO. 50200013195971,
IFSC CODE: HDFC0000407.