Tradeoff between roundoff and overflow errors in digital filter realizations

This paper is concerned with a linked analysis of overflow and roundoff errors in fixed-point digital filter realizations. Upper bounds for the overflow error power are obtained, having considered the saturation quantizer characteristics. Also, upper bounds for the overflow probability are given in...

Full description

Saved in:
Bibliographic Details
Published in:1997 IEEE International Conference on Acoustics, Speech, and Signal Processing Vol. 3; pp. 2189 - 2192 vol.3
Main Author: Sanz-Gonzalez, J.L.
Format: Conference Proceeding
Language:English
Published: Washington DC IEEE 1997
IEEE Computer Society Press
Subjects:
Applied sciences
Arithmetic
Computer errors
Computer simulation
Delay
Detection, estimation, filtering, equalization, prediction
Digital filters
Dynamic range
Exact sciences and technology
Flow graphs
Information, signal and communications theory
Roundoff errors
Signal and communications theory
Signal, noise
Telecommunication standards
Telecommunications and information theory
Upper bound
Overflow(computer arithmetics)
Upper bound
Digital filter
Rounding error
Signal processing
State space method
Tchebychev polynomial
ISBN:0818679190, 9780818679193
ISSN:1520-6149
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper is concerned with a linked analysis of overflow and roundoff errors in fixed-point digital filter realizations. Upper bounds for the overflow error power are obtained, having considered the saturation quantizer characteristics. Also, upper bounds for the overflow probability are given in order that the overflow power is lower than the roundoff noise power. Finally, computer simulation results support the theoretical ones, and some of these results are presented in curves for the optimal state-space digital realizations of Butterworth, Chebyshev and elliptic filters.
ISBN:0818679190
9780818679193
ISSN:1520-6149
DOI:10.1109/ICASSP.1997.599484