A Fast 4 × 4 Forward Discrete Tchebichef Transform Algorithm

Author

Nakagaki, Kiyoyuki ; Mukundan, Ramakrishnan

Author_Institution

Univ. of Canterbury, Christchurch

Volume

14

Issue

10

fYear

2007

Firstpage

684

Lastpage

687

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. This letter introduces a new fast 4 x 4 forward DTT algorithm. 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 96 additions. The proposed method could be used as the base case for recursive computation of transform coefficients. Experimental results showing performance improvement over existing techniques are presented.

Keywords

data compression; image coding; polynomials; transforms; discrete orthogonal Tchebichef polynomials; fast 4 times 4 forward discrete Tchebichef transform algorithm; image analysis; image compression; transform coefficients; Compaction; Discrete cosine transforms; Discrete transforms; Image analysis; Image coding; Image processing; Kernel; Polynomials; Signal processing algorithms; Transform coding; Algorithms; discrete Tchebichef transform; discrete cosine transforms; image coding; signal processing;

fLanguage

English

Journal_Title

Signal Processing Letters, IEEE

Publisher

ieee

ISSN

1070-9908

Type

jour

DOI

10.1109/LSP.2007.898331

Filename

4303077