首页>
外国专利>
COMPUTATIONALLY EFFICIENT ANALYSIS AND SYNTHESIS OF REAL SIGNALS USING DISCRETE FOURIER TRANSFORMS AND INVERSE DISCRETE FOURIER TRANSFORMS
COMPUTATIONALLY EFFICIENT ANALYSIS AND SYNTHESIS OF REAL SIGNALS USING DISCRETE FOURIER TRANSFORMS AND INVERSE DISCRETE FOURIER TRANSFORMS
展开▼
机译：利用离散傅里叶变换和逆离散傅里叶变换进行实信号的计算效率分析和综合
展开▼
页面导航
摘要
著录项
相似文献
摘要
The present invention significantly reduces the number of complex computations that must be performed to compute a DFT or IDFT when a pattern is identified in an original input data sequence and is used to modify the data sequence in order to reduce the size of the sequence to be transformed. A DFT (IDFT) is performed on the modified input data sequence to generate a transformed sequence. The transformed data sequence is then manipulated to generate an output sequence that corresponds to the DFT (IDFT) of the original input data sequence without having actually calculated the DFT (IDFT) of the entire, original input data sequence. Three symmetrical patterns are used in the invention to simplify and render more efficient DFT and IDFT computations: Hermite symmetry, index-reversed, complex-conjugate symmetry, and mirror symmetry. As a result, the number of complex multiplications required to perform the DFT (or IDFT) is considerably less than the number of complex multiplications required to calculate the DFT (or IDFT) of the original input data sequence. The computational reduction increases signal processing speed and decreases power consumption, both attributes are highly desirable in virtually every DFT/IDFT application.
展开▼
