Fast Radix- q and Mixed-Radix Algorithms for Type-IV DCT

Fast Radix- q and Mixed-Radix Algorithms for Type-IV DCT

This letter proposes a fast radix-q algorithm to compute type-IV discrete cosine transform (DCT) of the length q lambda , where q is an odd positive integer. The proposed fast radix-q algorithm has merits in computational complexity, parallelism, and numerical stability over existing algorithms. Fur...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters 2008, Vol.15, p.910-913
Hauptverfasser: Hsu, Han-Wen, Liu, Chi-Min
Format: Artikel
Sprache:eng
Schlagworte:
Arithmetic
Computational complexity
Computer science
Concurrent computing
Costs
Councils
Dynamic range
Equations
Fast mixed-radix DCT algorithm
fast radix- q DCT algorithm
Numerical stability
Parallel processing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This letter proposes a fast radix-q algorithm to compute type-IV discrete cosine transform (DCT) of the length q lambda , where q is an odd positive integer. The proposed fast radix-q algorithm has merits in computational complexity, parallelism, and numerical stability over existing algorithms. Furthermore, the fast radix-q algorithm is used to develop the fast mixed-radix type-II/ type-IV DCT algorithm for composite lengths.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2008.2005441