A Fast 4 x 4 Forward Discrete Tchebichef Transform Algorithm
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 multiplicatio...
Saved in:
| Published in | IEEE signal processing letters Vol. 14; no. 10; pp. 684 - 687 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
01.10.2007
|
| Online Access | Get full text |
| ISSN | 1070-9908 |
| DOI | 10.1109/LSP.2007.898331 |
Cover
| Summary: | 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. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1070-9908 |
| DOI: | 10.1109/LSP.2007.898331 |