Abstract
In this transactions brief, we propose new fixed-coefficient recursive structures for computing discrete cosine transforms with the power-of-two length. The fixed-coefficient recursive structures are developed by exploring the periodicity embedded in transform bases, whose indices can form a complete residue system or a complete odd residue system. After simple data manipulation, the proposed filtering structures requiring fixed-coefficient multipliers are better than the previous recursive methods which need general multipliers in filter realization. In particular, we found that the properly selected fixed-coefficient filters achieve lower roundoff errors than the nominal variable-coefficient ones for computing DCT's in finite-word-length machines.
| Original language | English |
|---|---|
| Pages (from-to) | 211-216 |
| Number of pages | 6 |
| Journal | IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing |
| Volume | 46 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1999 Feb 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
Cite this
}
Recursive discrete cosine transforms with selectable fixed-coefficient filters. / Yang, Jar-Ferr; Fan, Chih Peng.
In: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, Vol. 46, No. 2, 01.02.1999, p. 211-216.Research output: Contribution to journal › Article
TY - JOUR
T1 - Recursive discrete cosine transforms with selectable fixed-coefficient filters
AU - Yang, Jar-Ferr
AU - Fan, Chih Peng
PY - 1999/2/1
Y1 - 1999/2/1
N2 - In this transactions brief, we propose new fixed-coefficient recursive structures for computing discrete cosine transforms with the power-of-two length. The fixed-coefficient recursive structures are developed by exploring the periodicity embedded in transform bases, whose indices can form a complete residue system or a complete odd residue system. After simple data manipulation, the proposed filtering structures requiring fixed-coefficient multipliers are better than the previous recursive methods which need general multipliers in filter realization. In particular, we found that the properly selected fixed-coefficient filters achieve lower roundoff errors than the nominal variable-coefficient ones for computing DCT's in finite-word-length machines.
AB - In this transactions brief, we propose new fixed-coefficient recursive structures for computing discrete cosine transforms with the power-of-two length. The fixed-coefficient recursive structures are developed by exploring the periodicity embedded in transform bases, whose indices can form a complete residue system or a complete odd residue system. After simple data manipulation, the proposed filtering structures requiring fixed-coefficient multipliers are better than the previous recursive methods which need general multipliers in filter realization. In particular, we found that the properly selected fixed-coefficient filters achieve lower roundoff errors than the nominal variable-coefficient ones for computing DCT's in finite-word-length machines.
UR - http://www.scopus.com/inward/record.url?scp=0033077069&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033077069&partnerID=8YFLogxK
U2 - 10.1109/82.752956
DO - 10.1109/82.752956
M3 - Article
VL - 46
SP - 211
EP - 216
JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
SN - 1057-7130
IS - 2
ER -