Invention Grant
US08015226B2 Methods and apparatus for performing reduced complexity discrete fourier transforms using interpolation
有权
使用插值执行复杂度降低的离散傅里叶变换的方法和装置
- Patent Title: Methods and apparatus for performing reduced complexity discrete fourier transforms using interpolation
- Patent Title (中): 使用插值执行复杂度降低的离散傅里叶变换的方法和装置
-
Application No.: US11859437Application Date: 2007-09-21
-
Publication No.: US08015226B2Publication Date: 2011-09-06
- Inventor: Kameran Azadet , Samer Hijazi , Sunitha Kopparthi , Albert Molina , Ramon Sanchez
- Applicant: Kameran Azadet , Samer Hijazi , Sunitha Kopparthi , Albert Molina , Ramon Sanchez
- Applicant Address: US PA Allentown
- Assignee: Agere Systems Inc.
- Current Assignee: Agere Systems Inc.
- Current Assignee Address: US PA Allentown
- Agency: Ryan, Mason & Lewis, LLP
- Main IPC: G06F17/14
- IPC: G06F17/14

Abstract:
Methods and apparatus are provided for performing reduced complexity discrete Fourier transforms using interpolation An input sequence of length N is transformed by extending the input sequence to an extended input sequence of length M, where M is greater than N (a power of two greater than N); performing a discrete Fourier Transform (DFT), such as a power-of-two DFT, on the extended input sequence to obtain an interpolated sequence; and applying a conversion matrix to the interpolated sequence to obtain a DFT output for the input sequence of length N. The input sequence of length N can be extended to an extended input sequence of length M, for example, by employing a zero padding technique, a cyclic extension technique, a windowing of a cyclic extended sequence technique or a resampling-based interpolation technique to extend the input sequence. The conversion matrix is substantially a sparse matrix.
Public/Granted literature
- US20090083352A1 METHODS AND APPARATUS FOR PERFORMING REDUCED COMPLEXITY DISCRETE FOURIER TRANSFORMS USING INTERPOLATION Public/Granted day:2009-03-26
Information query