A High Performance Modulo 2n+1 Squarer Design Based on Carbon Nanotube Technology

被引:0
|
作者
Li, Weifu [1 ]
Kim, Yong-Bin [1 ]
机构
[1] Northeastern Univ, Dept Elect & Comp Engn, Boston, MA 02115 USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, a design of high performance modulo 2(n)+1 squarer is proposed. The primary improvement comes from the algorithm, circuit implementation, and implementation technology. For the algorithm, the partial product matrix reconstruction is optimized to achieve a larger range of input and fewer operation steps. The modified Wallace tree is employed to compress the partial product in each column. For circuit implementation, full adders in traditional structure are replaced by 3: 2 compressors. The sparse-tree based inverted End-Carry-Around (ECA) modulo 2(n) adder is utilized to implement the final addition stage. The proposed design is demonstrated a much better performance in terms of delay, power, and area comparing with existing design. To assess the advantage of CNT device, the same circuit is designed using CNT technology. The proposed design shows that the critical path delay and rise time of modulo 2(8)+1 squarer on CNT technology is 13.6 times and 9.3 times better than that of CMOS technology, respectively. The power consumption is improved about 4 times with much better tolerance against the process, voltage, and temperature (PVT) variation compared with the CMOS counterpart.
引用
收藏
页码:429 / 432
页数:4
相关论文
共 50 条
  • [41] Novel Optimized Designs of Modulo 2n+1 Adder for Quantum Computing
    Gaur, Bhaskar
    Thapliyal, Himanshu
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2024, 32 (09) : 1759 - 1763
  • [42] A Modulo 2n+1 Multiplier with Double-LSB Encoding of residues
    Jaberipur, G.
    Alavi, H.
    15TH CSI INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SYSTEMS (CADS 2010), 2010, : 147 - 150
  • [43] Design and Simulation of Diminished-One Modulo 2n+1 Adder Using Circular Carry Selection
    Singh, Ruchi
    Mishra, R. A.
    WORLD CONGRESS ON ENGINEERING, WCE 2011, VOL II, 2011, : 1515 - 1518
  • [44] Handling zero in diminished-one modulo 2n+1 adders
    Efstathiou, C
    Vergos, HT
    Nikolos, D
    INTERNATIONAL JOURNAL OF ELECTRONICS, 2003, 90 (02) : 133 - 144
  • [45] VLSI design of diminished-one modulo 2n+1 adder using circular carry selection
    Lin, Su-Hon
    Sheu, Ming-Hwa
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2008, 55 (09) : 897 - 901
  • [46] Improved Area-Efficient Weighted Modulo 2n+1 Adder Design With Simple Correction Schemes
    Juang, Tso-Bing
    Chiu, Chin-Chieh
    Tsai, Ming-Yu
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2010, 57 (03) : 198 - 202
  • [47] Fast hard multiple generators for radix-8 Booth encoded modulo 2n-1 and modulo 2n+1 multipliers
    Muralidharan, Ramya
    Chang, Chip-Hong
    2010 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, 2010, : 717 - 720
  • [48] High speed parallel-prefix modulo 2n+1 adders for diminished-one operands
    Vergos, HT
    Efstathiou, C
    Nikolos, D
    ARITH-15 2001: 15TH SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2001, : 211 - 217
  • [49] On the Use of Diminished-1 Adders for Weighted Modulo 2n+1 Arithmetic Components
    Vergos, H. T.
    Bakalis, D.
    11TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN - ARCHITECTURES, METHODS AND TOOLS : DSD 2008, PROCEEDINGS, 2008, : 752 - +
  • [50] Fast modulo 2n-1 and 2n+1 adder using carry-chain on FPGA
    Didier, Laurent-Stephane
    Jaulmes, Luc
    2013 ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2013, : 1155 - 1159