Computational structures for the fast Fourier transform analyzer

Details Computational structures for the fast Fourier transform analyzer Computational structures for the fast Fourier transform analyzer

1992-12-24

1994-12-06

Malzahn, David H.

Boots, shoes, and leggings

G06F 15332

Patent

active

053716965

ABSTRACT:
Since the invention of the radix-2 structure for the computation of the discrete Fourier transform (DFT) by Cooley and Tukey in 1965, the DFT has been widely used for the frequency-domain analysis and design of signals and systems in communications, digital signal processing, and in other areas of science and engineering. While the Cooley-Tukey structure is simpler, regular, and efficient, it has some drawbacks such as more complex multiplications than required by higher-radix structures, and the overhead operations of bit-reversal and data-swapping. The present invention provides a large family of radix-2 structures for the computation of the DFT of a discrete signal of N samples. A member of this set of structures is characterized by two parameters, u and v, where u (u=2.sup.r, r=1,2, . . . , (log.sub.2 N)-1) specifies the size of each data vector applied at the two input nodes of a butterfly and v represents the number of consecutive stages of the structure whose multiplication operations are merged partially or fully. It is shown that the nature of the problem of computing the DFT is such that the sub-family of the structures with u=2 suits best for achieving its solution. These structures have the features that eliminate or reduce the drawbacks of the Cooley-Tukey structure while retaining its simplicity and regularity. A comprehensive description of the two most useful structures from this sub-family along with their hardware implementations is presented.

REFERENCES:
patent: 4275452 (1981-06-01), White
patent: 4344151 (1982-08-01), White
patent: 4689762 (1987-08-01), Thibodeau, Jr.

Affiliated with

Also associated with

Rating

Computational structures for the fast Fourier transform analyzer does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computational structures for the fast Fourier transform analyzer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational structures for the fast Fourier transform analyzer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-219464