On the Error-Free Realization of a Scaled DCT Algorithm and Its VLSI Implementation
This brief is concerned with the efficient and error-free implementation of the order-8 Linzer-Feig (L-F) scaled discrete cosine transform (sDCT). We present a novel 3-D algebraic integer encoding scheme which maps the transform basis functions (transcendental functions such as cosine and tangent) w...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on circuits and systems. 2, Analog and digital signal processing Analog and digital signal processing, 2007-08, Vol.54 (8), p.700-704 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This brief is concerned with the efficient and error-free implementation of the order-8 Linzer-Feig (L-F) scaled discrete cosine transform (sDCT). We present a novel 3-D algebraic integer encoding scheme which maps the transform basis functions (transcendental functions such as cosine and tangent) with integer values, so that the quantization errors can be minimized and the cross-multiplications (in the signal path) can be avoided. This scheme also allows the separable computation of a 2-D DCT in multiplication-free, fast, and efficient architectures with a process rate of 80 mega-samples/sec. The proposed scheme also reduces the latency and the power consumption compared to previously employed designs for DCT implementations. |
---|---|
ISSN: | 1549-7747 1057-7130 1558-3791 |
DOI: | 10.1109/TCSII.2007.898891 |