RNS Digital Filtering Structures for Wafer-Scale Integration

Wafer-scale integration (WSI) compresses a large amount of microelectronics representing a complete digital system onto a single intact wafer. This approach is desirable for applications requiring extensive computational capabilities but only limited input and output connections. Its primary advantage is an improvement in total system density. However, such designs must have built-in fault tolerance. Parallel architectures are ideal for WSI. Thus, digital filtering implemented via the residue number system (RNS) is an application that naturally fits the requirements and advantages of WSI. A finite impulse response (FIR) filter readily lends itself to RNS implementation, and a system architecture employing both RNS and WSI is proposed. Means of introducing inherent fault tolerance using the RNS are briefly covered. After a tutorial introduction to the residue number system, methods of performing addition and multiplication operations in the RNS are explored on the basis of reducing area for a custom VLSI design. Modulo addition implemented with two conventional binary adders provides a compact design that may be externally programmed for the modulus that it operates in. Realization of mod multiplication via index addition is shown to be more effective than implementing the mod multiplication truth table directly. Conversions from binary to the RNS representation and vice versa are major bottlenecks in RNS design. Techniques for conversion into the RNS and out of the RNS based on a sequential division algorithm and the mixed-radix system expansion, respectively, are presented.

[1]  Thu V. Vu.  Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding , 1985, IEEE Trans. Computers.

[2]  Arthur Gill,et al.  Decomposition of linear sequential circuits over residue class rings , 1972 .

[3]  J. F. McDonald,et al.  The trials of wafer-scale integration: Although major technical problems have been overcome since WSI was first tried in the 1960s, commercial companies can't yet make it fly , 1984, IEEE Spectrum.

[4]  Graham A. Jullien,et al.  Quantization error and limit cycles analysis in residue number system coded recursive filters , 1982, ICASSP.

[5]  Meghanad D. Wagh,et al.  A new structured design method for convolutions over finite fields, Part I , 1983, IEEE Trans. Inf. Theory.

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

[7]  M. Soderstrand.  A high-speed low-cost recursive digital filter using residue number arithmetic , 1977, Proceedings of the IEEE.

[8]  Fred J. Taylor,et al.  Analysis of errors in residue number system (RNS) based IIR digital filters , 1982, ICASSP.

[9]  Fred J. Taylor,et al.  An efficient residue-to-decimal converter , 1981 .

[10]  G. Robert Redinbo,et al.  Finite Field Fault-Tolerant Digital Filtering Architectures , 1987, IEEE Transactions on Computers.

[11]  Lennart Johnsson,et al.  Residue Arithmetic and VLSI , 1983 .

[12]  W. Kenneth Jenkins,et al.  The Design of Error Checkers for Self-Checking Residue Number Arithmetic , 1983, IEEE Transactions on Computers.

[13]  Charles M. Rader,et al.  Digital processing of signals , 1983 .

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

[15]  Graham A. Jullien,et al.  Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms , 1980, IEEE Transactions on Computers.

[16]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[17]  Frederic J. Mowle,et al.  A systematic approach to digital logic design , 1976 .