VERIFICATION OF CARRY LOOK AHEAD ADDER USING CONSTRAINED RANDOMIZED LAYERED TEST BENCH
DOI:
https://doi.org/10.29121/ijetmr.v6.i6.2019.392Keywords:
VLSI Design, Propagation Delay, Carry Generator, Carry Propagator, Ripple Carry AdderAbstract
In processors and in digital circuit designs, adder is an important component. As a result, adder is the main area of research in VLSI system design for improving the performance of a digital system. The performance depends on power consumption and delay. Adders are not only used for arithmetic operations, but also for calculating addresses and indices. In digital design we have half adder and full adder, by using these adders we can implement ripple carry adder (RCA). RCA is used to perform any number of additions. In this RCA is serial adder and it has propagation delay problem. With increase in hard & fast circuits, delay also increases simultaneously. That’s the reason these Carry look ahead adders (CLA) are used. The carry look ahead adder speeds up the addition by reducing the amount of time required to determine carry bits. It uses two blocks, carry generator (Gi) and carry propagator (Pi) which finds the carry bit in advance for each bit position from the nearest LSB, if the carry is 1 then that position is going to propagate a carry to next adder.
Downloads
References
Y.Choi, “Parallel Prefix Adder Design” Proc. 17th IEEE Symposium on Computer Arithmetic, pp 90-98, 27th June 2005.
A. Beaumont-Smith, C.C. Lim: Parallel Prefix Adder Design, 15th Symposium on Computer Arithmetic, p.218-225, 200.
G. Yang, S.-O. Jung, K.-H. Baek, S.H. Kim, S. Kim, S.-M. Kang, “A 32-bit Carry Lookahead Adder using Dual-path all-N logic,” IEEE Trans. VLSI Systems, vol. 13, no. 8, pp. 992-996, 2005. DOI: https://doi.org/10.1109/TVLSI.2005.853605
P. Kogge and H. Stone, - A Parallel Algorithm for the Efficient Solution of a General class of Recurrence Relation, IEEE Transactions on computers, vol, C-22, no.8, pp.786-793, Aug1973 DOI: https://doi.org/10.1109/TC.1973.5009159
Swaroop Ghosh, Patrick Ndai, Kaushik Roy. “A Novel Low Overhead Fault Tolerant Kogge-Stone Adder using Adaptive Clocking”, date 2008. DOI: https://doi.org/10.1109/DATE.2008.4484707
Jin-Fa Lin, Yin- Tsung Hwang and Ming – Hwa Sheu, -, “Low Power 10-Transistor Full adder Design Based on Degenerate pass Transistor Logic.” IEEE Trans. VLSI Systems, vol. 13, No.6, pp.686-695, Jun 2012.
Pakkiraiah Chakali, Madhu Kumar Patnala, “Design of High speed Kogge-Stone based Carry Select Adder,”International Journal of Emerging Science and Engineering (IJESE), Volume-1, Issue-4, February 2013
Chakali, Pakkiraiah, and Madhu Kumar Patnala. "Design of High Speed Kogge-Stone Based Carry Select Adder." International Journal of Emerging Science and Engineering (IJESE), vol. 1, no. 4,pp. 34-37, Feb. 2013.
Mala, T. Ratna, R. Vinay Kumar, and T. Chandra Kala. "Design and Verification of Area Efficient High-Speed Carry Select Adder." IJRCCT, vol. 1, no. 6, pp. 345-349, Nov. 2012.
Sunil M, Ankit R D, Manjunatha G D and Premananda B S “Design And Implementation of Fast Parallel Prefix Kogge Stone Adder.” In International Journal of Electrical and Electronics Engineering & Telecommunications, vol. 3, no. 1, January 2014. DOI: https://doi.org/10.18479/ijeedc/2015/v3i7/48267
Begum, Mohammed Haseena, and V. Vamsi Mohana Krishna. "Design and Verification Of Low Power And Area Efficient Kogge-Stone Carry Select Adder." In International Journal of Engineering Research and Technology, ESRSA Publications, vol. 2, no. 8, pp. 462-467, Aug 2013.
B. Ramkumar, Harish M Kittur, “Low –Power and Area-Efficient Carry Select Adder”, IEEE transaction on very large scale integration (VLSI) systems, vol.20, no.2, pp.371-375, Feb 2012. DOI: https://doi.org/10.1109/TVLSI.2010.2101621
Adilakshmi Siliveru, M.Bharathi, “Design of Kogge-Stone and Brent-Kung adders using Degenerate Pass Transistor Logic.” IJESE, ISSN: 2319–6378, Volume-1, Issue-4, February 2013.
K-H.Cheng, W-S. Lee and Y-C.Huang, “ A 1.2 V 500 MHZ 32-bit Carry Lookahead Adder,” 8th IEEE International Conference on Electronics, Circuits and Systems, Vol 2, September 2-5, 2001, pp. 765-768.
Y. Kim and L-S Kim, ’64-bit Carry-Select Adder with Reduced Area,” Electronics letters, Vol. 37, Issue 10, May 10, 2001, pp. 614-615 DOI: https://doi.org/10.1049/el:20010430
Downloads
Published
How to Cite
Issue
Section
License
License and Copyright Agreement
In submitting the manuscript to the journal, the authors certify that:
- They are authorized by their co-authors to enter into these arrangements.
- The work described has not been formally published before, except in the form of an abstract or as part of a published lecture, review, thesis, or overlay journal.
- That it is not under consideration for publication elsewhere.
- That its release has been approved by all the author(s) and by the responsible authorities – tacitly or explicitly – of the institutes where the work has been carried out.
- They secure the right to reproduce any material that has already been published or copyrighted elsewhere.
- They agree to the following license and copyright agreement.
Copyright
Authors who publish with International Journal of Engineering Technologies and Management Research agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or edit it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
For More info, please visit CopyRight Section
