A radix 4 delay commutator for fast Fourier transform processor implementation
- 1 October 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 19 (5) , 702-709
- https://doi.org/10.1109/jssc.1984.1052211
Abstract
The development is described of a semicustom delay commutator circuit to support the implementation of high-speed fast Fourier transform processors based on the radix 4 pipeline FFT algorithm of J.H. McClellan and R.J. Purdy (1978). The delay commutator is a 108000-transistor circuit comprising 12288 shift register stages and approximately 2000 gates of random logic realized with 2.5-micrometer design rule CMOS standard cell technology. It operates at a 10-MHz clock rate, which processes data at a 40-MHz rate. The delay commutator is suitable for implementing processors that compute transforms of 16, 64, 256, 1024, and 4096 (complex) points. It is implemented as a 4-bit-wide data slice to facilitate cocatenation to accommodate common data word sizes and to use a standard 48-pin dual-in-line package.Keywords
This publication has 10 references indexed in Scilit:
- A 32 point monolithic FFT processor chipPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast transform processor implementationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A floating point format for signal processingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Digital signal processing with VLSI technologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A 256-point discrete Fourier transform processor fabricated in a 2 /spl mu/m NMOS technologyIEEE Journal of Solid-State Circuits, 1983
- Solid state: VHSIC: A status report: The first two years of the program's lifespan is viewed by some as gestation and others as incubation. When will the baby walk?IEEE Spectrum, 1982
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A Pipeline Fast Fourier TransformIEEE Transactions on Computers, 1970
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965