An Integer Approximation Method for Discrete Sinusoidal Transforms
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Fast Data-independent KLT Approximations Based on Integer Functions
The Karhunen-Lo\`eve transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. Its ability to condense energy compression i…
Dimensionality ReductionImage CompressionVideo CompressionUnderstanding Sinusoidal Neural Networks
In this work, we investigate the structure and representation capacity of sinusoidal MLPs - multilayer perceptron networks that use sine as the activation function. These neural networks (known as neural fields) have bec…
Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
This report elaborates on approximations for the discrete Fourier transform by means of replacing the exact Cooley-Tukey algorithm twiddle-factors by low-complexity integers, such as $0, \pm \frac{1}{2}, \pm 1$.
A Multiparametric Class of Low-complexity Transforms for Image and Video Coding
Discrete transforms play an important role in many signal processing applications, and low-complexity alternatives for classical transforms became popular in recent years. Particularly, the discrete cosine transform (DCT…
Data CompressionImage CompressionImplicit Neural Representation of Tileable Material Textures
We explore sinusoidal neural networks to represent periodic tileable textures. Our approach leverages the Fourier series by initializing the first layer of a sinusoidal neural network with integer frequencies with a peri…