Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2005-08-30
2005-08-30
Malzahn, D. H. (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
06938064
ABSTRACT:
A method of calculating the fast Fourier transform or the inverse fast Fourier transform of a series of N real samples x(n), with N power of two, operating according to a time interleaving algorithm and providing the sample series X(n) in ascending order to index n and using limited calculating storage means. A method of calculating the fast Fourier transform or the inverse fast Fourier transform of a series of N conjugated complex samples X(n), with N power of two, operating according to a frequency interleaving algorithm.
REFERENCES:
patent: 3584781 (1971-06-01), Edson
patent: 3584782 (1971-06-01), Bergland
patent: 4051357 (1977-09-01), Bonnerot
patent: 4612626 (1986-09-01), Marchant
patent: 5270953 (1993-12-01), White
patent: 6401162 (2002-06-01), Nasserbakht
An Algorithm for the Machine Calculation of Complex Fouier Series, J.W. Cooley, J.W. Tukey, pp. 297-301, Apr. 1965.
Software Implementation of 2D FFT on DSP 96002 Digital Signal Processor,S.C. Chan et al., pp. 1525-1528, Aug. 1992.
Cooley-Tukey FFT on the Connection Machine, S. Lennart Johnsson et al., pp. 1201-1221, Nov. 1992.
Jalali Ali
Lacroix Dominique
Leray Pierre
France Telecom (SA)
Malzahn D. H.
Patterson Thuente Skaar & Christensen P.A.
Telediffusion de France (SA)
LandOfFree
Method for computing fast Fourier transform and inverse fast... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for computing fast Fourier transform and inverse fast..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for computing fast Fourier transform and inverse fast... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3470052