A Discrete Tchebichef Transform Approximation for Image and Video Coding

In this letter, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT). The proposed forward and inverse transforms are multiplication-free and require a reduced number of additions and bit-shifting operations. Numerical compression simulations demonstrate the effici...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE signal processing letters Ročník 22; číslo 8; s. 1137 - 1141
Hlavní autoři: Oliveira, Paulo A. M., Cintra, Renato J., Bayer, Fábio M., Kulasekera, Sunera, Madanayake, Arjuna
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.08.2015
Témata:
Approximate DTT
Approximation algorithms
Approximation methods
Complexity theory
Discrete cosine transforms
fast algorithms
image and video coding
Image coding
Signal processing algorithms
ISSN:1070-9908, 1558-2361
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this letter, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT). The proposed forward and inverse transforms are multiplication-free and require a reduced number of additions and bit-shifting operations. Numerical compression simulations demonstrate the efficiency of the proposed transform for image and video coding. Furthermore, Xilinx Virtex-6 FPGA based hardware realization shows 44.9% reduction in dynamic power consumption and 64.7% lower area when compared to the literature.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2015.2389899