Fast Fourier transform method and inverse fast Fourier...

Details Fast Fourier transform method and inverse fast Fourier... Fast Fourier transform method and inverse fast Fourier...

2005-02-22

2005-02-22

Malzahn, David H. (Department: 2124)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

Reexamination Certificate

active

06859816

ABSTRACT:
First, at step S1, i=0 is set. At step S2, data comprising M samples is fetched. At step S3, an M-point DFT is applied to the data fetched at step S2above. At step S4, an obtained y(k) is multiplied by a twist coefficient w(i, k). The result is placed in y(k). At step S5, the value in y(k) is overwritten to an array x which contains original data. The above processing is repeated N/M times through steps S6and S7until all the input data is processed. At step S9, an FFT with N/M (=2n) points is performed within the range of 0≦k<M. Finally, at step S12, a sort is performed.

REFERENCES:
patent: 4245325 (1981-01-01), Kikuchi et al.
patent: 6115728 (2000-09-01), Nakai et al.
patent: 6230176 (2001-05-01), Mizutani
patent: 6247034 (2001-06-01), Nakai et al.

Affiliated with

Also associated with

Rating

Fast Fourier transform method and inverse fast Fourier... 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 method and inverse fast Fourier..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Fourier transform method and inverse fast Fourier... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3472750