This Article 
 Bibliographic References 
 Add to: 
A New Approach to Fixed-Coefficient Inner Product Computation Over Finite Rings
December 1996 (vol. 45 no. 12)
pp. 1345-1355

Abstract—Inherently parallel arithmetic based on the residue number system (RNS) lends itself very well to implementation of high-speed digital signal processing (DSP) hardware. In most cases, DSP computations can be decomposed to the inner product form $Y=\sum\nolimits_{i=0}^{N-1} {C_iX_i}$. Therefore, implementation of the inner product computation over finite rings is of paramount importance for RNS-based DSP hardware.

Recently, periodic properties of residues of powers of 2 have been found useful in designing residue arithmetic circuits. This paper presents a deeper insight to the periodicity concepts by applying abstract algebra and number theory methods. Advantage is taken of the fact that the set ${\bf Z}_m^+=\{1,\,\,2,\,\,\ldots ,m-1\}$ splits completely, with respect to some $g\in {\bf Z}_m^+$, into sets which are closed under multiplication by g modulo m. Properties of such a decomposition of ${\bf Z}_m^+$ are investigated and the theory is applied to develop new fixed-coefficient inner product circuits for finite-ring arithmetic. The new designs are almost exclusively composed of full adders and they can easily be pipelined to achieve very high throughput. A VLSI implementation study of the new inner product circuits is presented. It shows that, compared with the best method known to date, both smaller area requirements and higher throughput are achieved.

[1] F.J. Taylor, "Residue Arithmetic: A Tutorial with Examples," Computer, vol. 17, no. 5, pp. 50-62, May 1984.
[2] M.A. Soderstrand,W.K. Jenkins,G.A. Jullien,, and F.J. Taylor,Residue Number System Arithmetic: Modern Applicationsin Digital Signal Processing. IEEE Press, 1986.
[3] S.R. Barraclough, M. Sotheran, K. Burgin et al., , "The Design and Implementation of the IMS A110 Image and Signal Processor," Proc. IEEE Custom Integrated Circuits Conf., pp. 24.5.1-24.5.4,San Diego, May15-18, 1989.
[4] W.K. Jenkins and B.J. Leon, "The Use of Residue Number Systems in the Design of Finite Impulse Response Digital Filters," IEEE Trans. Circuits and Systems, vol. 24, pp. 191-201, Apr. 1977.
[5] M.A. Bayoumi, G.A. Jullien, and W.C. Miller, "Hybrid VLSI Architecture FIR Filters Using Residue Number Systems," Electronics Letters, vol. 21, pp. 358-359, Apr. 1985.
[6] T. Stouraitis, S.W. Kim, and A. Skavantzos, "Full Adder-Based Arithmetic Units for Finite Integer Rings," IEEE Trans. Circuits and Systems—II, vol. 40, pp. 740-745, Nov. 1993.
[7] C-L. Wang, "New Bit-Serial VLSI Implementation of RNS FIR Digital Filters," IEEE Trans. Circuits and Systems—II, vol. 41, pp. 768-772, Nov. 1994.
[8] M. Taheri, G.A. Jullien, and W.C. Miller, "High-Speed Signal Processing Using Systolic Arrays Over Finite Rings," IEEE J. Selected Areas of Comm., vol. 6, pp. 504-512, Apr. 1988.
[9] G.A. Jullien, P.D. Bird, J.T. Carr et al., "An Efficient Bit-Level Systolic Cell Design for Finite Ring Digital Signal Processing Applications," J. VLSI Signal Processing, vol. 1, pp. 189-207, 1989.
[10] G.A. Jullien, and W.C. Miller, "Improved Cellular Structures for Bit-Steered ROM Finite Ring Systolic Arrays," Proc. IEEE Int'l Symp. Circuits and Systems, pp. 1,415-1,417,New Orleans, May1-3, 1990.
[11] D. Schaffer, Z. Zuo, S. Greenberg, L. Bartram, J. Dill, S. Dubs, and M. Roseman, “Navigating Hierarchically Clustered Networks Through Fisheye and Full-Zoom Methods,” ACM Trans. Computer–Human Interaction, vol. 3, no. 2, pp. 162–188, 1996.
[12] S.J. Piestrak, "Design of Residue Generators and Multioperand Modular Adders Using Carry-Save Adders," IEEE Trans. Computers, vol. 43, no. 1, pp. 68-77, Jan. 1994.
[13] A. Wrzyszcz, D. Caban, and E.L. Dagless, "Design of a Discrete Cosine Transform Circuit Using the Residue Number System," Proc. European Conf. Design Automation, pp. 584-588,Paris, Feb.22-25, 1993.
[14] A. Wrzyszcz and D. Milford, "A New Modulo 2a+ 1 Multiplier," Proc. IEEE Int'l Conf. Computer Design, pp. 614-617,Cambridge, Mass., Oct.3-6, 1993.
[15] E. Weiss, First Course in Algebra and Number Theory.New York: Academic Press, 1971.
[16] A. Wrzyszcz, "A New Approach to Modular Inner Product Computation," MSc thesis, Dept. of Electrical and Electronic Eng., Univ. of Bristol, June 1994.
[17] E. Codd,“Missing information (applicable and inapplicable) in relational databases,” ACM SIGMOD Record, vol. 15, no. 4, pp. 53-78, 1986.
[18] G.A. Jullien, W.C. Miller, R. Grondin et al., "Dynamic Computational Blocks for Bit-Level Systolic Arrays," IEEE J. Solid-State Circuits, vol. 29, pp. 14-22, Jan. 1994.
[19] G.A. Jullien, B. Erickson, and W.C. Miller, "RAM-JET: Towards the Removal of Multiplicative Complexity in Digital Signal Processing VLSI Architectures," Proc. Asilomar Conf. Signals, Systems, and Computers, pp. 748-752,Pacific Grove, Calif., Oct.31- Nov.2, 1988.

Index Terms:
Computer arithmetic, digital signal processing, inner product computation, residue number system, VLSI design.
Artur Wrzyszcz, David Milford, Erik L. Dagless, "A New Approach to Fixed-Coefficient Inner Product Computation Over Finite Rings," IEEE Transactions on Computers, vol. 45, no. 12, pp. 1345-1355, Dec. 1996, doi:10.1109/12.545965
Usage of this product signifies your acceptance of the Terms of Use.