Abstract: The discrete Tchebichef transform (DTT) is a transform method based on discrete orthogonal Tchebichef polynomials, which have applications recently found in image analysis and compression.
Sep 17, 2007
In this letter, a new fast 4. 4 forward discrete Tchebichef transform is proposed. The proposed algorithm will be useful for the computation of base case for a ...
The new algorithm requires only 32 multiplications and 66 additions, while the best-known method using two properties of the DTT requires 64 multiplications and ...
This letter introduces a new fast 4 x 4 forward DTT algorithm that requires only 32 multiplications and 66 additions, while the best-known method using two ...
The new algorithm requires only 32 multiplications and 66 additions, while the best-known method using two properties of the DTT requires 64 multiplications and ...
The use of DTT in place of ICT for transform coding in the H.264/AVC looks promising and it is shown that the fast DTT is easily derived, has low complexity ...
Nakagaki, K. and Mukundan, R. (2007) A Fast 4 × 4 Forward Discrete Tchebichef Transform Algorithm. IEEE Signal Processing Letters, 14, 684-687.
TL;DR: This letter introduces a new fast 4 x 4 forward DTT algorithm that requires only 32 multiplications and 66 additions, while the best-known method using ...
The new algorithm requires only 32 multiplications and 66 additions, while the best-known method using two properties of the DTT requires 64 multiplications and ...
A fast algorithm is further proposed for multiplier-free computation of DTT. The image compression performance of the 4- point DTT is found to be superior to ...