Abstract
An approach is introduced for analysing the effects of finite word length and testing the stability in digital filters. Based on the analysis of both the quantisation errors of filter coefficients and the computational roundoff errors of multiplications and additions, a sufficient stability condition is introduced to give an insight into the hardware/cost tradeoff for word-length design choices under the effects of finite word length. The Bellman-Gronwall lemma in discrete form is employed to tackle this problem. In addition, some numerical examples are presented to illustrate the results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
