Odd type DCT/DST for video coding: Relationships and low-complexity implementations
Authors:
- 1 October 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
In this paper, we show a class of relationships which link Discrete Cosine Transforms (DCT) and Discrete Sine Transforms (DST) of types V, VI, VII and VIII, which have been recently considered for inclusion in the future video coding technology. In particular, the proposed relationships allow to compute the DCT-V and the DCT-VIII as functions of the DCT-VI and the DST-VII respectively, plus simple reordering and sign-inversion. Moreover, this paper exploits the proposed relationships and the Winograd factorization of the Discrete Fourier Transform to construct low-complexity factorizations for computing the DCT-V and the DCT-VIII of length 4 and 8. Finally, the proposed signal-flow-graphs have been implemented using an FPGA technology, thus showing reduced hardware utilization with respect to the direct implementation of the matrix-vector multiplication algorithm.Keywords
This publication has 20 references indexed in Scilit:
- Relationship between DCT-II, DCT-VI, and DST-VII transforms2013
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operationsSignal Processing, 2008
- Computation of an odd-length DCT from a real-valued DFT of the same lengthIEEE Transactions on Signal Processing, 1992
- A fast recursive algorithm for computing the discrete cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- A new algorithm to compute the discrete cosine TransformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- An in-place, in-order prime factor FFT algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- On Computing the Discrete Fourier TransformMathematics of Computation, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977