2015/02/07 by H. M. de Oliveira, de Oliveira, H. M., R. J. Cintra +4
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Data Structures and Algorithms (cs.DS) #Digital Filter Design and Implementation #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #PAPR reduction in OFDM #cs.DM #cs.DS
paper · pdf · doi:10.48550/arxiv.1502.02168
Fixed several typos. 7 pages, 5 figures, XVIII Simpósio Brasileiro de Telecomunicações, 2000, Gramado, RS, Brazil
openalex publication_date 2015/02/07 · arxiv created 2015/08/26 · arxiv updated 2015/08/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the so-called fast transforms. In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of the DFT/DHT. The approach is based on a decomposition of the DHT into layers of Walsh-Hadamard transforms. In particular, fast algorithms for short block lengths such as N ∈ \4, 8, 12, 24\ are presented.