VLSI implementations of number theoretic concepts with applications in signal processing

This paper explores novel techniques involving number theoretic concepts to perform real-time digital signal processing for high bandwidth data stream applications in digital signal processing. Often the arithmetic manipulations are simple in form (cascades of additions and multiplications in a well defined structure) but the numbers of operations that have to be computed every second can be large. This paper discusses ways in which new number theoretic mapping techniques can be used to perform DSP operations by both reducing the amount of hardware involved in the circuitry and by allowing the construction of very benign architectures down to the individual cells. Such architectures can be used in aggressive VLSI/ULSI implementations. We restrict ourselves to the computation of linear filter and transform algorithms, with the inner product form, which probably account for the vast majority of digital signal processing functions implemented commercially.

[1]  Bede Liu,et al.  A new hardware realization of digital filters , 1974 .

[2]  David L. Pulfrey,et al.  Design procedures for differential cascode voltage switch circuits , 1986 .

[3]  Christer Svensson,et al.  High-speed CMOS circuit technique , 1989 .

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

[5]  Mehdi Hatamian,et al.  High speed signal processing, pipelining, and VLSI , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  John V. McCanny,et al.  Implementation of signal processing functions using 1-bit systolic arrays , 1982 .

[7]  M. Taheri,et al.  An efficient bit-level systolic cell design for finite ring digital signal processing applications , 1989, J. VLSI Signal Process..

[8]  Hee Yong Youn,et al.  On Implementing Large Binary Tree Architectures in VLSI and WSI , 1989, IEEE Trans. Computers.

[9]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[10]  Graham A. Jullien,et al.  On Modulus Replication for Residue Arithmetic Computations of Complex Inner Products , 1990, IEEE Trans. Computers.

[11]  Otto F. G. Schilling,et al.  Basic Abstract Algebra , 1975 .

[12]  I. Niven,et al.  An introduction to the theory of numbers , 1961 .

[13]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[15]  Graham A. Jullien,et al.  Residue Number Scaling and Other Operations Using ROM Arrays , 1978, IEEE Transactions on Computers.

[16]  Graham A. Jullien,et al.  High-speed signal processing using systolic arrays over finite rings , 1988, IEEE J. Sel. Areas Commun..

[17]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[18]  M. Shoji.  FFT scaling in Domino CMOS gates , 1985 .

[19]  Graham A. Jullien,et al.  A VLSI implementation of residue adders , 1987 .