Digit pipelined processors

Digit serial data transmission can be used to an advantage in the design of special purpose processors where communication issues dominate and where digit pipelining can be used to maintain high data rates. VLSI signal processing applications are one such problem domain. We have developed a family of VLSI components that have digit serial transmission and that can be pipelined at the digit level. These components can be used to construct VLSI processors that are especially suited to signal processing applications. One such particularly attractive processor is a structure we call the arithmetic cube. The arithmetic cube can be programmed to solve linear transformations such as convolutions and DFTs, and has nearest neighbor interconnects, regular layout, simple control, and a limited number of interconnections. Regular layout and simple control derive naturally from the algorithms on which the processor is based. Long wires are eliminated by the nearest neighbor interconnect. High throughput can be achieved by pipelining the processor at the digit level. The arithmetic cube is programmable in the problem size n; once implemented for a certain size N, smaller problems can be solved on the same implementation without a loss in performance. In addition, the architecture extends to larger N in a regular and automatic fashion.

[1]  N. Ahmed,et al.  FAST TRANSFORMS, algorithms, analysis, applications , 1983, Proceedings of the IEEE.

[2]  Mary Jane Irwin,et al.  The Arithmetic Cube , 1987, IEEE Transactions on Computers.

[3]  Kishor S. Trivedi,et al.  On-line algorithms for division and multiplication , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[4]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[5]  Charles M. Rader,et al.  Fast transforms: Algorithms, analyses, applications , 1984 .

[6]  S. Lawson,et al.  VLSI Signal Processing: a Bit-Serial Approach , 1986 .

[7]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Mary Jane Irwin,et al.  Fully Digit On-Line Networks , 1983, IEEE Transactions on Computers.

[9]  Irving John Good,et al.  The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[10]  Tomás Lang,et al.  On-the-Fly Conversion of Redundant into Conventional Representations , 1987, IEEE Transactions on Computers.

[11]  J. Cooley,et al.  New algorithms for digital convolution , 1977 .

[12]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

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

[14]  Robert Michael Owens,et al.  A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform , 1986, IEEE Trans. Acoust. Speech Signal Process..

[15]  Milos D. Ercegovac,et al.  On-Line Arithmetic: An Overview , 1984, Optics & Photonics.

[16]  Mary Jane Irwin,et al.  A System for Designing, Simulating, and Testing High Performance VLSI Signal Processors , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  S. Winograd.  On the multiplicative complexity of the Discrete Fourier Transform , 1979 .

[18]  H. T. Kung.  Let's Design Algorithms for VLSI Systems , 1979 .

[19]  T. Parks,et al.  A prime factor FFT algorithm using high-speed convolution , 1977 .

[20]  Daniel E. Atkins,et al.  Introduction to the Role of Redundancy in Computer Arithmetic , 1975, Computer.

[21]  Catherine Yuk-Fun Chow.  A variable precision processor module , 1980 .