High-speed hybrid parallel-prefix carry-select adder using ling's algorithm

[No Value] Lakshmanan, Ali Meaamar, Masuri Othman

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)

    Abstract

    Parallel-prefix adders offer high efficiency solution in terms of area, speed, power and regularity to the binary addition problem and are well suited for VLSI implementation. In this paper, a novel technique of implementing a hybrid parallel-prefix ling adder is presented. Experimental results show that the proposed adder has an improvement of 63% in speed and about 13% reduction in power consumption compared to Carry Lookahead adder (CLA).

    Original languageEnglish
    Title of host publicationIEEE International Conference on Semiconductor Electronics, Proceedings, ICSE
    Pages598-602
    Number of pages5
    DOIs
    Publication statusPublished - 2006
    Event2006 IEEE International Conference on Semiconductor Electronics, ICSE 2006 - Kuala Lumpur
    Duration: 29 Nov 20061 Dec 2006

    Other

    Other2006 IEEE International Conference on Semiconductor Electronics, ICSE 2006
    CityKuala Lumpur
    Period29/11/061/12/06

    Fingerprint

    Adders
    Electric power utilization

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Lakshmanan, N. V., Meaamar, A., & Othman, M. (2006). High-speed hybrid parallel-prefix carry-select adder using ling's algorithm. In IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE (pp. 598-602). [4266685] https://doi.org/10.1109/SMELEC.2006.380702

    High-speed hybrid parallel-prefix carry-select adder using ling's algorithm. / Lakshmanan, [No Value]; Meaamar, Ali; Othman, Masuri.

    IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE. 2006. p. 598-602 4266685.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Lakshmanan, NV, Meaamar, A & Othman, M 2006, High-speed hybrid parallel-prefix carry-select adder using ling's algorithm. in IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE., 4266685, pp. 598-602, 2006 IEEE International Conference on Semiconductor Electronics, ICSE 2006, Kuala Lumpur, 29/11/06. https://doi.org/10.1109/SMELEC.2006.380702
    Lakshmanan NV, Meaamar A, Othman M. High-speed hybrid parallel-prefix carry-select adder using ling's algorithm. In IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE. 2006. p. 598-602. 4266685 https://doi.org/10.1109/SMELEC.2006.380702
    Lakshmanan, [No Value] ; Meaamar, Ali ; Othman, Masuri. / High-speed hybrid parallel-prefix carry-select adder using ling's algorithm. IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE. 2006. pp. 598-602
    @inproceedings{8d809c1278574dd488d1c799c561e660,
    title = "High-speed hybrid parallel-prefix carry-select adder using ling's algorithm",
    abstract = "Parallel-prefix adders offer high efficiency solution in terms of area, speed, power and regularity to the binary addition problem and are well suited for VLSI implementation. In this paper, a novel technique of implementing a hybrid parallel-prefix ling adder is presented. Experimental results show that the proposed adder has an improvement of 63{\%} in speed and about 13{\%} reduction in power consumption compared to Carry Lookahead adder (CLA).",
    author = "Lakshmanan, {[No Value]} and Ali Meaamar and Masuri Othman",
    year = "2006",
    doi = "10.1109/SMELEC.2006.380702",
    language = "English",
    isbn = "0780397312",
    pages = "598--602",
    booktitle = "IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE",

    }

    TY - GEN

    T1 - High-speed hybrid parallel-prefix carry-select adder using ling's algorithm

    AU - Lakshmanan, [No Value]

    AU - Meaamar, Ali

    AU - Othman, Masuri

    PY - 2006

    Y1 - 2006

    N2 - Parallel-prefix adders offer high efficiency solution in terms of area, speed, power and regularity to the binary addition problem and are well suited for VLSI implementation. In this paper, a novel technique of implementing a hybrid parallel-prefix ling adder is presented. Experimental results show that the proposed adder has an improvement of 63% in speed and about 13% reduction in power consumption compared to Carry Lookahead adder (CLA).

    AB - Parallel-prefix adders offer high efficiency solution in terms of area, speed, power and regularity to the binary addition problem and are well suited for VLSI implementation. In this paper, a novel technique of implementing a hybrid parallel-prefix ling adder is presented. Experimental results show that the proposed adder has an improvement of 63% in speed and about 13% reduction in power consumption compared to Carry Lookahead adder (CLA).

    UR - http://www.scopus.com/inward/record.url?scp=35148823704&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=35148823704&partnerID=8YFLogxK

    U2 - 10.1109/SMELEC.2006.380702

    DO - 10.1109/SMELEC.2006.380702

    M3 - Conference contribution

    AN - SCOPUS:35148823704

    SN - 0780397312

    SN - 9780780397316

    SP - 598

    EP - 602

    BT - IEEE International Conference on Semiconductor Electronics, Proceedings, ICSE

    ER -