Efficient implementation of large size FFT

Multiplex communications – Generalized orthogonal or special mathematical techniques – Fourier transform

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S344000, C370S488000, C370S497000

Reexamination Certificate

active

09942628

ABSTRACT:
A system and method of implementing a Fast Fourier Transform (FFT) function in a high data rate communication network. The communication network, employing technology such as VDSL and DMT or FDM, frequently implements a FFT at a transmitter to transfer frequency domain modulated signals into time domain signals. An IFFT is implemented at the receiver to obtain the original signal. The present system divides the channel bandwidth into sub-bands and performs the FFT function with multiple FFTs in order to reduce chip size and computation time.

REFERENCES:
patent: 4720674 (1988-01-01), Takeuchi et al.
patent: 5528581 (1996-06-01), De Bot
patent: 5587939 (1996-12-01), Soleymani et al.
patent: 5699363 (1997-12-01), Wishart et al.
patent: 5867479 (1999-02-01), Butash
patent: 6091704 (2000-07-01), Butash
patent: 6317409 (2001-11-01), Murakami
patent: 6442195 (2002-08-01), Liu et al.
patent: 6456657 (2002-09-01), Yeap et al.
patent: 6473467 (2002-10-01), Wallace et al.
patent: 6690717 (2004-02-01), Kim et al.
patent: 2 317 537 (1998-03-01), None

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Efficient implementation of large size FFT does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient implementation of large size FFT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient implementation of large size FFT will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3858766

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.