Fast generalized DFT and DHT algorithms

DOI10.1016/S0165-1684(97)00234-XzbMATH Open0901.65103OpenAlexW1977842954MaRDI QIDQ1129082FDOQ1129082

Authors: Guoan Bi, Yanqiu Chen 

Publication date: 13 August 1998

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-1684(97)00234-x

Recommendations

• Fast DFT algorithms for length \(N=q*2^m\)
• Fast DHT algorithms for length \(N=q*2^m\)
• The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
• Fast computation of the discrete Hartley transform
• Generalized discrete Hartley transforms

zbMATH Keywords

discrete Fourier transformfast Fourier transformdiscrete cosine transformdiscrete Hartley transformsplit-radix algorithm

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (7)

• Fast DFT algorithms for length \(N=q*2^m\)
• The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
• Title not available (Why is that?)
• Unscrambling for fast DFT algorithms
• Generalized discrete Hartley transforms
• A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
• The design of optimal DFT algorithms using dynamic programming

This page was built for publication: Fast generalized DFT and DHT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129082)