Direct N-point DCT computation from three adjacent N/3-point DCT coefficients

Direct N-point DCT computation from three adjacent N/3-point DCT coefficients

An efficient method for computing a length-N Discrete Cosine Transform (DCT) from three consecutive length-N/3 DCTs is proposed. This method differs from previous ones in that it reduces considerable 31-38% arithmetic operations and uses only length-N/3 DCTs instead of length-N DCTs. We also find it...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters 2005-02, Vol.12 (2), p.89-92
Hauptverfasser: Soo-Chang Pei, Meng-Ping Kao
Format: Artikel
Sprache:eng
Schlagworte:
Arithmetic
Digital signal processing
Direct DCT domain computation
Discrete cosine transforms
Displays
fast DCT
HDTV
Interpolation
radix-3 DCT
Signal processing algorithms
Transform coding
Video compression
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An efficient method for computing a length-N Discrete Cosine Transform (DCT) from three consecutive length-N/3 DCTs is proposed. This method differs from previous ones in that it reduces considerable 31-38% arithmetic operations and uses only length-N/3 DCTs instead of length-N DCTs. We also find its great applications in fractional scaling of a block DCT-based image by the factor of 1/2/sup /spl alpha//3/sup /spl beta//. This would be very useful in high-definition television (HDTV) standard, whose display size is usually 16:9. The comparison with conventional methods is provided.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2004.840868