Diminished-One Modulo 2n+1 Adder Design

This paper presents two new design methodologies for modulo 2/sup n/+1 addition in the diminished-one number system. The first design methodology leads to carry look-ahead, whereas the second to parallel-prefix adder implementations. VLSI realizations of the proposed circuits in a standard-cell technology are utilized for quantitative comparisons against the existing solutions. Our results indicate that the proposed carry look-ahead adders are area and time efficient for small values of n, while for the rest values of n the proposed parallel-prefix adders are considerably faster than any other already known in the open literature.

[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]  Yutai Ma.  A Slimplified Architecture for Modulo (2n + 1) Multiplication , 1998, IEEE Trans. Computers.

[3]  Akhilesh Tyagi,et al.  A Reduced-Area Scheme for Carry-Select Adders , 1993, IEEE Trans. Computers.

[4]  M. Etzel,et al.  The design of specialized residue classes for efficient recursive digital filter realization , 1982 .

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

[6]  L. Leibowitz.  A simplified binary arithmetic for the Fermat number transform , 1976 .

[7]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[8]  Andreas Curiger.  VLSI architectures for computations in finite rings and fields , 1993 .

[9]  Michael A. Soderstrand,et al.  Residue number system arithmetic: modern applications in digital signal processing , 1986 .

[10]  Vassilis Paliouras,et al.  Novel high-radix residue number system multipliers and adders , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[11]  W. Kenneth Jenkins,et al.  The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[12]  Wolfgang Fichtner,et al.  A 177 Mb/s VLSI implementation of the International Data Encryption Algorithm , 1994 .

[13]  Graham A. Jullien,et al.  A look-up table VLSI design methodology for RNS structures used in DSP applications , 1987 .

[14]  Costas Efstathiou,et al.  Area-time efficient modulo 2/sup n/-1 adder design , 1994 .

[15]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[16]  Reto Zimmermann,et al.  Binary adder architectures for cell-based VLSI and their synthesis , 1997 .

[17]  Xuejia Lai,et al.  A Proposal for a New Block Encryption Standard , 1991, EUROCRYPT.

[18]  K. Elleithy,et al.  Fast and flexible architectures for RNS arithmetic decoding , 1992 .

[19]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[20]  Haridimos T. Vergos,et al.  High-Speed Parallel-Prefix Modulo 2n-1 Adders , 2000, IEEE Trans. Computers.

[21]  Simon Knowles,et al.  A family of adders , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[22]  W K Jenkins.  Recent advances in residue number techniques for recursive digital filtering , 1979 .