A high speed low power modulo 2n+1 multiplier design using carbon-nanotube technology

Modulo 2n+1 multiplier is one of the critical components in the area of digital signal processing, residue arithmetic, and data encryption that demand high-speed and low-power operation. In this paper, a new circuit implementation of a high-speed low-power modulo 2n+1 multiplier is proposed. It has three major stages: partial product generation stage, partial product reduction stage, and the final adder stage. The proposed structure introduces a new MUX-based compressor in the partial product reduction stage to reduce power and increase speed, and in the final adder stage, the Sparse-tree-based inverted end-around-carry adder reduces the number of critical path circuit blocks, also avoids wire interconnection problem. The proposed multiplier is implemented using both 32nm CNTFET (Carbon-Nanotube FET) and bulk CMOS technology for performance comparison. The CNTFET-based design dramatically decreases the PDP (Power Delay Product) of the circuit. The simulation results demonstrate that the power consumption of CNTFET-based multiplier is at average 5.72 times less than its CMOS counterpart, while the PDP of CNTFET is 94 times less than the CMOS one.

[1]  Reto Zimmermann,et al.  Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[2]  Chip-Hong Chang,et al.  Ultra low-voltage low-power CMOS 4-2 and 5-2 compressors for fast arithmetic circuits , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  M. Theunissen.  The other , 1984 .

[4]  Nicolas Sklavos,et al.  Asynchronous low power VLSI implementation of the International Data Encryption Algorithm , 2001, ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483).

[5]  Haridimos T. Vergos,et al.  Diminished-One Modulo 2n+1 Adder Design , 2002, IEEE Trans. Computers.

[6]  M.N.S. Swamy,et al.  Residue to binary number converters for three moduli set , 1998, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems (Cat. No.98CH36187).

[7]  M.N.S. Swamy,et al.  Residue-to-binary number converters for three moduli sets , 1999 .

[8]  Yutai Ma.  A Slimplified Architecture for Modulo (2n + 1) Multiplication , 1998, IEEE Trans. Computers.

[9]  Shuguo Li,et al.  A new high compression compressor for large multiplier , 2008, 2008 9th International Conference on Solid-State and Integrated-Circuit Technology.

[10]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[11]  Lingamneni Avinash,et al.  Novel Architectures for High-Speed and Low-Power 3-2, 4-2 and 5-2 Compressors , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[12]  William J. Bowhill,et al.  Design of High-Performance Microprocessor Circuits , 2001 .

[13]  R. Krishnamurthy,et al.  A 4 GHz 130 nm address generation unit with 32-bit sparse-tree adder core , 2002, 2002 Symposium on VLSI Circuits. Digest of Technical Papers (Cat. No.02CH37302).

[14]  Hubert Kaeslin,et al.  Regular VLSI architectures for multiplication modulo (2/sup n/+1) , 1991 .

[15]  Yong-bin Kim,et al.  Integrated Circuit Design Based on Carbon Nanotube Field Effect Transistor , 2011 .

[16]  Minsu Choi,et al.  A fast low-power modulo 2n+1 multiplier design , 2009, 2009 IEEE Instrumentation and Measurement Technology Conference.

[17]  F. Petry,et al.  The digit parallel method for fast RNS to weighted number system conversion for specific moduli (2/sup k/-1,2/sup k/,2/sup k/+1) , 1997 .

[18]  A. Hiasat,et al.  New memoryless, mod (2n±1) residue multiplier , 1992 .

[19]  Haridimos T. Vergos,et al.  Design of efficient modulo 2n+1 multipliers , 2007, IET Comput. Digit. Tech..

[20]  Graham A. Jullien,et al.  An efficient tree architecture for modulo 2n+1 multiplication , 1996, J. VLSI Signal Process..