Being Stingy with Multipliers

It is shown that from an implementation point of view it is often the case that the chip area occupied by a VLSI signal processor is dominated and, therefore, largely determined by the area which must be devoted to multipliers. Therefore, signal processors which have high multiplier utilization (i.e. attain a higher throughput for a given number of multipliers) are of interest because it is possible for them to also attain good VLSI area utilization. Several signal processing architectures which have optimal multiplier utilization, are presented. These architectures are compared to several more conventional alternatives. It is also shown how the architectures achieve better multiplier utilization and, hence VLSI area utilization without suffering a degradation in utilization of other sources (e.g. adders and interconnect). >

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

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

[3]  S. Winograd.  On the number of multiplications necessary to compute certain functions , 1970 .

[4]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

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

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

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

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

[9]  Robert Michael Owens,et al.  New VLSI Architectures with Reduced Hardware , 1983 .

[10]  Robert Michael Owens,et al.  An architecture for a VLSI FFT processor , 1983, Integr..

[11]  Franco P. Preparata,et al.  A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers , 1983, IEEE Transactions on Computers.

[12]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

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

[14]  Peter B. Denyer,et al.  VLSI Signal Processing: A Bit-Serial Approach , 1985 .

[15]  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..

[16]  Mary Jane Irwin,et al.  Digit-Pipelined Arnthmetic as Illustrated by the Paste-Up System: A Tutorial , 1987, Computer.

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

[18]  Mary Jane Irwin,et al.  Implementing algorithms for convolution on arrays of adders , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[19]  Harvey F. Silverman.  Programming the WFTA for two-dimensional data , 1989, IEEE Trans. Acoust. Speech Signal Process..

[20]  Mary Jane Irwin,et al.  A case for digit serial VLSI signal processors , 1990, J. VLSI Signal Process..