Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/LSP.2015.2389899 | IEEE Signal Process. Lett. |
Keywords | DocType | Volume |
approximation algorithms | Journal | 22 |
Issue | ISSN | Citations |
8 | 1070-9908 | 6 |
PageRank | References | Authors |
0.48 | 20 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Paulo A. M. Oliveira | 1 | 14 | 1.37 |
Renato J. Cintra | 2 | 218 | 26.82 |
Fábio M. Bayer | 3 | 126 | 12.89 |
Sunera Kulasekera | 4 | 40 | 4.63 |
Arjuna Madanayake | 5 | 242 | 53.31 |