Large Dynamic Range Computations over Small Finite Rings

Presents a new multivariate mapping strategy for the recently introduced Modulus Replication Residue Number System (MRRNS). This mapping allows computation over a large dynamic range using replications of extremely small rings. The technique maintains the useful features of the MRRNS, namely: ease of input coding; absence of a Chinese Remainder Theorem inverse mapping across the full dynamic range; replication of identical rings; and natural integration of complex data processing. The concepts are illustrated by a specific example of complex inner product processing associated with a radix-4 decimation in time fast Fourier transform algorithm. A complete quantization analysis is performed and an efficient scaling strategy chosen based on the analysis. The example processor uses replications of three rings: modulo-3, -5, and -7; the effective dynamic range is in excess of 32 b. The paper also includes very-large-scale-integration implementation strategies for the processor architecture that consists of arrays of massively parallel linear bit-level pipelines. >

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

[2]  W.C. Miller,et al.  Woodchuck: a low-level synthesizer for dynamic pipelined DSP arithmetic logic blocks , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.

[3]  Allan O. Steinhardt,et al.  Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.

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

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

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

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

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

[9]  Earl E. Swartzlander,et al.  Arithmetic for digital neural networks , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[10]  S. Bandyopadhyay,et al.  A low-overhead scheme for testing a bit-level finite ring systolic array , 1990, J. VLSI Signal Process..

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

[12]  Graham A. Jullien,et al.  Implementation of FFT Structures Using the Residue Number System , 1979, IEEE Transactions on Computers.