Patent ID: 6985919

Claim:
A method for efficiently processing an Inverse Fast Fourier Transformation for a 2N point original input data sequence X(k), wherein said original input data sequence includes a real part X r (k) and an imaginary part X i (k) (k=0, . . . , N−1), comprising the steps of: identifying a first modification pattern; modifying said real part of original input data sequence based on said first modification pattern to form a modified real part X r ′(k); identifying a second modification pattern; modifying said imaginary part of original input data sequence based on said second modification pattern to form a modified imaginary part X i ′(k); combing said modified real part X r ′(k) and modified imaginary part X i ′(k) together to form a modified input data X′(k); and inputting said modified input data X′(k) to an Inverse Fast Fourier transformation (IFFT) module to generate an output sequence.