Fast fourier transform using balanced coefficients

Details Fast fourier transform using balanced coefficients Fast fourier transform using balanced coefficients

1993-01-13

1994-11-15

Nguyen, Long T.

Boots, shoes, and leggings

G06F 738

Patent

active

053654692

ABSTRACT:
A method and apparatus for processing a digital signal by a fast Fourier transformation using balanced coefficients. The balanced coefficient method reduces the number of coefficients required to process an FFT of size 2.sup.p from a total of 2.sup.p coefficients to p times the square root of 2.sup.p. The new system employs a reduced number of coefficients in a unique addressing scheme to produce a cheaper, lighter, smaller, cooler FFT processor which uses less power and is more reliable.

REFERENCES:
patent: 3584781 (1971-06-01), Edson
patent: 3584782 (1971-06-01), Bergland
patent: 3777131 (1973-12-01), Llewellyn
Tran Thong, "FFT with Reduced Coefficient Storage Requirement", IEEE Symposium on Circuit and System, vol. 2/4, pp. 1537-1540, 1990.
Tokoro et al., "Fast Fourier Transform by Hardware", Systems & Computers & Controls, vol. 58-D, No. 9, pp. 578-585, 1975.
Gentlemen et al., "Fast Fourier Transform--for Fun and Profit", Proceeding-Fall Joint Computer Conference, pp. 563-578, 1966.

Affiliated with

Also associated with

Rating

Fast fourier transform using balanced coefficients does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast fourier transform using balanced coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast fourier transform using balanced coefficients will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1102870