2015/02/01 by H. M. de Oliveira, de Oliveira, H. M., Renato J. Cintra +3
Computer Science · #Digital Filter Design and Implementation #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Control Systems and Analysis #Methodology (stat.ME) #Numerical Analysis (math.NA) #Numerical Methods and Algorithms
paper · pdf · doi:10.48550/arxiv.1502.01038
openalex publication_date 2015/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient fast transforms. In this paper some fast algorithms are derived. The theoretical lower bound on the multiplicative complexity for the DFT/DHT are achieved. The approach is based on the factorization of DHT matrices. Algorithms for short blocklengths such as N ∈ \3, 5, 6, 12, 24 \ are presented.