The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2011 vol.60)
pp: 1354-1365
Wonhak Hong , Ulsan College, Ulsan
Rajashekhar Modugu , Missouri University of Science & Technology, Rolla
Minsu Choi , Missouri University of Science & Technology, Rolla
ABSTRACT
Modulo 2^n+1 multiplier is one of the critical components in the area of data security applications such as International Data Encryption Algorithm (IDEA), digital signal processing, and fault-tolerant systems that demand high reliability and fault tolerance. Transient faults caused by electrical noise or external interference are resulting in soft errors which should be detected online. The effectiveness of the residue codes in the self-checking implementation of the modulo multipliers has been rarely explored. In this paper, an efficient hardware implementation of the self-checking modulo 2^n+1 multiplier is proposed based on the residue codes. Different check bases in the form 2^c-1 or 2^c+1 (c \in N) are selected for various values of the input operands. In the implementation of the modulo generators and modulo multipliers, novel multiplexor-based compressors are applied for efficient modulo 2^n+1 multipliers with less area and lower power consumption. In the final addition stage of the modulo multipliers and modulo generators, efficient sparse-tree-based inverted end around carry adders are used. The proposed architecture is capable of online detecting errors caused by faults on a single gate at a time. The experimental results show that the proposed self-checking modulo 2^n+1 multipliers have less area overhead and low performance penalty.
INDEX TERMS
Modulo 2^n+1 multiplier, residue arithmetic, arithmetic circuit design, compressor, online self-checking, international data encryption algorithm (IDEA).
CITATION
Wonhak Hong, Rajashekhar Modugu, Minsu Choi, "Efficient Online Self-Checking Modulo 2^n+1 Multiplier Design", IEEE Transactions on Computers, vol.60, no. 9, pp. 1354-1365, September 2011, doi:10.1109/TC.2010.49
REFERENCES
[1] Modern Applications of Residue Number System Arithmetic to Digital Signal Processing, M.A. Soderstrand, W.K. Jenkins, G.A. Jullien, and F.J. Taylor, eds. IEEE Press, 1986.
[2] P.E. Beckmann and B.R. Musicus, “Fast Fault-Tolerant Digital Convolution Using a Polynomial Residue Number System,” IEEE Trans. Signal Processing, vol. 41, no. 7, pp. 2300-2313, July 1993.
[3] R. Modugu, N. Park, and M. Choi, “A Fast Low-Power Modulo $2^n+1$ Multiplier Design,” Proc. 2009 IEEE Int'l Instrumentation and Measurement Technology Conf., pp. 951-956, May 2009.
[4] R. Modugu and M. Choi, “Efficient High Speed and Low-Power Modulo $2^n+1$ Multiplier,” internal technical report, Missouri Univ. of Science and Tech nology.
[5] R. Modugu, N. Park, Y.-B. Kim, and M. Choi, “Efficient On-Line Self-Checking Modulo $2^n+1$ Multiplier Design,” Proc. 24th IEEE Int'l Symp. Defect and Fault Tolerance in VLSI Systems, Oct. 2009.
[6] R. Zimmermann and W. Fichtner, “Low-Power Logic Styles: CMOS versus Pass-Transistor Logic,” IEEE J. Solid-State Circuits, vol. 32, no. 7, pp. 1079-1090, July 1997.
[7] S. Veeramachaneni, L. Avinash, R.M. Rajashekhar, and M.B. Srinivas, “Efficient Modulo $(2^k\pm 1)$ Binary to Residue Converters,” Proc. Sixth Int'l Workshop System-on-Chip for Real-Time Applications, pp. 195-200, Dec. 2006.
[8] C-H. Chang, J. Gu, and M. Zhang, “Ultra Low-Voltage Lowpower CMOS 4-2 and 5-2 Compressors for Fast Arithmetic Circuits,” IEEE J. Circuits and Systems I, vol. 51, no. 10, pp. 1985-1997, Oct. 2004.
[9] M. Rouholamini, O. Kavehie, A.-P. Mirbaha, S.J. Jasbi, and K. Navi, “A New Design for 7:2 Compressors,” Proc. IEEE/ACS Int'l Conf. Computer Systems and Applications 2007 (AICCSA '07), pp. 474-478, May 2007.
[10] A. Curiger et al., “VINCI: VLSI Implementation of the New Secret-keyBlock Cipher IDEA,” Proc. Custom Integrated Circuits Conf., May 1993.
[11] R. Zimmermann, A. Curiger, H. Bonnenberg, H. Kaeslin, N. Felber, and W. Fichtner, “A 177 Mb/s VLSI Implementation of the International Data Encryption Algorithm,” IEEE J. Solid-State Circuits, vol. 29, no. 3, pp. 303-307, Mar. 1994.
[12] L.M. Leibowitz, “A Simplified Binary Arithmetic for the Fermat Number Transform,” IEEE Trans. Acoustics Speech and Signal Processing, vol. ASSP-24, no. 5, pp. 356-359, Oct. 1976.
[13] D.P. Vasudevan and P.K. Lala, “A Technique for Modular Design of Self-Checking Carry-Select Adder,” Proc. 20th IEEE Int'l Symp. Defect and Fault Tolerance in VLSI Systems (DFT '05), pp. 325-333, Oct. 2005.
[14] U. Sparmann and S.M. Reddy, “On the Effectiveness of Residue Code Checking for Parallel Two's Complement Multipliers,” Proc. 24th Int'l Symp. Fault-Tolerant Computing (FTCS-24), pp. 219-228, June 1994.
[15] D. Marienfeld, E.S. Sogomonyan, V. Ocheretnij, and M. Gossel, “New Self-Checking Output-Duplicated Booth Multiplier with High Fault Coverage for Soft Errors,” Proc. 14th Asian Test Symp. '05, pp. 76-81, Dec. 2005.
[16] M. Hunger and D. Marienfeld, “New Self-Checking Booth Multipliers,” Int'l J. Applied Math. and Computer Science, vol. 18, no. 3, pp. 319-328, 2008.
[17] M. Goessel and F. Graf, Error Detection Circuits. McGraw-Hill, 1993.
[18] I.A. Noufal and M. Nicolaidis, “A CAD Framework for Generating Self-Checking Multipliers Based on Residue Codes,” Proc. Design, Automation and Test in Europe Conf. and Exhibition '99, pp. 122-129, 1999.
[19] O. Garcia and T. Rao, “On the Method of Checking Logical Operations,” Proc. Second Ann. Princeton Conf. Information Science System, pp. 89-95, 1968.
[20] U. Sparmann, “On the Check Base Selection Problem for Fast Adders,” Proc. IEEE 11th Ann. VLSI Test Symp., pp. 62-65, Apr. 1993.
[21] F.F. Sellers, M.Y. Hsiao, and L.W. Bearnson, Error Detecting Logic for Digital Computers. McGraw-Hill, 1968.
[22] W. Peterson, “On Checking an Adder,” IBM J. Research and Development, vol. 2, pp. 166-168, Apr. 1958.
[23] E. Fujiwara and K. Haruta, “Fault-Tolerant Arithmetic Logic Unit Using Parity Based Codes,” Trans. ECE of Japan, vol. E64, pp. 653-660, Oct. 1981.
[24] D. Marienfeld, E.S. Sogomonyan, V. Ocheretnij, and M. Gossel, “A New Self-Checking Multiplier by Use of a Code Disjoint Sum-Bit Duplicated Adder,” Proc. Ninth IEEE European Test Symp. (ETS '04), pp. 30-35, May 2004.
[25] W.H. Debany, A.R. Macera, D.E. Daskiewich, M.J. Gorniak, K.A. Kwiat, and H.B. Dussault, “Effective Concurrent Test for a Parallel-Input Multiplier Using Modulo 3,” Proc. IEEE VLSI Test Symp. “10th Anniversary Design, Test and Application: ASICs and Systems-on-a-Chip,” pp. 280-285, Apr. 1992.
[26] T.J. Slegel and R.J. Veracca, “Design and Performance of the IBM Enterprise System/9000 Type 9121 Vector Facility,” IBM J. Research and Development, vol. 35, pp. 367-381, May 1991.
[27] M. Nicolaidis, “Efficient Implementations of Self-Checking Adders and ALUs,” Proc. 23rd Int'l Symp. Fault-Tolerant Computing (FTCS-23), pp. 586-595, June 1993.
[28] S. Kundu and S.M. Reddy, “Embedded Totally Self-Checking Checkers: A Practical Design,” IEEE Design and Test of Computers, vol. 7, no. 4, pp. 5-12, Aug. 1990.
[29] B. Kiran Kumar and P.K. Lala, “On-Line Detection of Faults in Carry-Select Adders,” Proc. Int'l Test Conf. 2003 (ITC '03), 2003.
[30] D.P. Vasudevan, P.K. Lala, and J.P. Parkerson, “Self-Checking Carry-Select Adder Design Based on Two-Rail Encoding,” IEEE Trans. Circuits and Systems I: Regular Papers, vol. 54, no. 12, pp. 2696-2705, Dec. 2007.
[31] B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs. Oxford Univ. Press, 2000.
[32] S. Mathew, M. Anders, R.K. Krishnamurthy, and S. Borkar, “A 4-GHz 130-nm Address Generation Unit with 32-Bit Sparse-Tree Adder Core,” IEEE J. Solid-State Circuits, vol. 38, no. 5, pp. 689-695, May 2003.
[33] J. Grad and J.E. Stine, “A Multi-Mode Low-Energy Binary Adder,” Proc. 40th Asilomar Conf. Signals, Systems and Computers, pp. 2065-2068, Oct./Nov. 2006.
[34] A. Tyagi, “A Reduced-Area Scheme for Carry-Select Adders,” IEEE Trans. Computers, vol. 42, no. 10, pp. 1163-1170, Oct. 1993.
[35] P. Shivakumar, S.W. Keckler, M. Kistler, D. Burger, and L. Alvisi, “Modeling the Effect of Technology Trends on the Soft Error Rate of Combinatorial Logic,” Proc. Int'l Conf. Dependable Systems and Networks, pp. 389-398, 2002.
[36] P. Kogge and H.S. Stone, “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations,” IEEE Trans. Computers, vol. 22, no. 8, pp. 786-793, Aug. 1973.
[37] H.T. Vergos, C. Efstathiou, and D. Nikolos, “Diminished-One Modulo 2n+1 Adder Design,” IEEE Trans. Computers, vol. 51, no. 12, pp. 1389-1399, Dec. 2002.
[38] H.T. Vergos and C. Efstathiou, “Design of Efficient Modulo $2^n+1$ Multipliers,” IET Computers and Digital Techniques, vol. 1, no. 1, pp. 49-57, 2007.
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool