Abstract
An exploration is made of roundoff and quantization errors in pipelined high-speed recursive filters, implemented using look-ahead computation and a two's complement number system. These errors are theoretically estimated for a first-order recursive filter, for both decomposed and nondecomposed implementations. The maximum total roundoff error in decomposed scattered look-ahead filters is shown to be less than that in the nondecomposed scattered look-ahead filters. Further, the quantization error in decomposed filters is less when poles are closer to origin (as compared with nondecomposed ones). Experimental results are presented for a sixth-order Butterworth and a fourth-order Chebyshev low-pass filter. High speed can also be obtained by using redundant arithmetic in standard filter structures. These filters may suffer from reduced dynamic range and degraded finite word-length effects. Experimental results for such implementations are presented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1743-1746 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 3 |
| State | Published - Dec 1 1990 |
Fingerprint
Cite this
Quantization effects in high-speed pipelined recursive filters. / Parhi, Keshab K; Munson, Gregory S.; Pham, Lai Q.
In: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, Vol. 3, 01.12.1990, p. 1743-1746.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Quantization effects in high-speed pipelined recursive filters
AU - Parhi, Keshab K
AU - Munson, Gregory S.
AU - Pham, Lai Q.
PY - 1990/12/1
Y1 - 1990/12/1
N2 - An exploration is made of roundoff and quantization errors in pipelined high-speed recursive filters, implemented using look-ahead computation and a two's complement number system. These errors are theoretically estimated for a first-order recursive filter, for both decomposed and nondecomposed implementations. The maximum total roundoff error in decomposed scattered look-ahead filters is shown to be less than that in the nondecomposed scattered look-ahead filters. Further, the quantization error in decomposed filters is less when poles are closer to origin (as compared with nondecomposed ones). Experimental results are presented for a sixth-order Butterworth and a fourth-order Chebyshev low-pass filter. High speed can also be obtained by using redundant arithmetic in standard filter structures. These filters may suffer from reduced dynamic range and degraded finite word-length effects. Experimental results for such implementations are presented.
AB - An exploration is made of roundoff and quantization errors in pipelined high-speed recursive filters, implemented using look-ahead computation and a two's complement number system. These errors are theoretically estimated for a first-order recursive filter, for both decomposed and nondecomposed implementations. The maximum total roundoff error in decomposed scattered look-ahead filters is shown to be less than that in the nondecomposed scattered look-ahead filters. Further, the quantization error in decomposed filters is less when poles are closer to origin (as compared with nondecomposed ones). Experimental results are presented for a sixth-order Butterworth and a fourth-order Chebyshev low-pass filter. High speed can also be obtained by using redundant arithmetic in standard filter structures. These filters may suffer from reduced dynamic range and degraded finite word-length effects. Experimental results for such implementations are presented.
UR - http://www.scopus.com/inward/record.url?scp=0025661535&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025661535&partnerID=8YFLogxK
M3 - Article
VL - 3
SP - 1743
EP - 1746
JO - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
JF - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
SN - 0736-7791
ER -