An integer approximation method for discrete sinusoidal transforms
From MaRDI portal
Abstract: 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.
Recommendations
- The integer transforms analogous to discrete trigonometric transforms
- The differential Fourier transform method
- scientific article; zbMATH DE number 3924072
- A global method for invertible integer DCT and integer wavelet algorithms
- Systolic implementation of real-valued discrete transforms via algebraic integer quantization
Cites work
- scientific article; zbMATH DE number 2128362 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 3983811 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 193953 (Why is no real title available?)
- scientific article; zbMATH DE number 1082200 (Why is no real title available?)
- scientific article; zbMATH DE number 771803 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A VLSI architecture for simplified arithmetic Fourier transform algorithm
- A new square wave transform based on the DCT
- Adaptive filtering. Algorithms and practical implementation
- Computing the Polar Decomposition—with Applications
- Condition numbers and their condition numbers
- Design of an FFT/IFFT Processor for MIMO OFDM Systems
- Efficient hybrid DCT-domain algorithm for video spatial downscaling
- Eight-point discrete Hartley transform as an edge operator and its interpretation in the frequency domain
- Hamming weight pyramid -- a new insight into canonical signed digit representation and its applications
- Integer fast Fourier transform
- Nonorthogonal Joint Diagonalization/Zero Diagonalization for Source Separation Based on Time-Frequency Distributions
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- On the multiplicative complexity of discrete cosine transforms
- Stability of Methods for Matrix Inversion
- The Arithmetic Cosine Transform: Exact and Approximate Algorithms
- The Discrete Cosine Transform
Cited in
(10)- scientific article; zbMATH DE number 4034998 (Why is no real title available?)
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
- Signal approximations based on nonlinear and optimal piecewise affine functions
- An orthogonal 16-point approximate DCT for image and video compression
- Avoidance of Singular Point in Integer Orthonormal Transform for Lossless Coding
- scientific article; zbMATH DE number 3924072 (Why is no real title available?)
- The integer transforms analogous to discrete trigonometric transforms
- Optimal nonlinear signal approximations based on piecewise constant functions
- Systolic implementation of real-valued discrete transforms via algebraic integer quantization
- A prime-factor decomposed algorithm for the discrete sine transform
This page was built for publication: An integer approximation method for discrete sinusoidal transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411197)
