A Fast 4 × 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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2007-10, Vol.14 (10), p.684
Main Authors: Nakagaki, K, Mukundan, R
Format: Article
Language:English
Subjects:
Algorithms
Compressing
Computation
Image analysis
Multiplication
Recursive
Signal processing
Transforms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2007.898331