An Integer Approximation Method for Discrete Sinusoidal Transforms
This work addresses the need for efficient discrete transform approximations in signal processing, but it is incremental as it builds on existing approximation methods.
The paper tackles the problem of evaluating discrete transforms by proposing a class of integer transforms for DFT, DHT, and DCT using dyadic rational approximations, resulting in transforms that are competitive with existing methods and applicable to multiple block-lengths.
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT), based on simple dyadic rational approximation methods. The introduced method is general, applicable to several block-lengths, whereas existing approaches are usually dedicated to specific transform sizes. The suggested approximate transforms enjoy low multiplicative complexity and the orthogonality property is achievable via matrix polar decomposition. We show that the obtained transforms are competitive with archived methods in literature. New 8-point square wave approximate transforms for the DFT, DHT, and DCT are also introduced as particular cases of the introduced methodology.