DocumentCode :
2392560
Title :
Minimum state requirement of a digital filter
Author :
Tan, Eng-Chong
Author_Institution :
Div. of Comput. Eng., Nanyang Technol. Univ., Singapore
fYear :
1994
fDate :
22-26 Aug 1994
Firstpage :
642
Abstract :
By modelling a digital filter as a finite state machine, the minimum number of states can be used as a measure of the internal memory required. The memory efficiency of a first order digital filter subject to rounding or truncation is investigated. Specifically, we look at situations in which the input magnitude is normalised to unity, but the multiplier coefficient is allowed to vary
Keywords :
digital filters; finite state machines; memory architecture; digital filter; finite state machine; first order filter; input magnitude; internal memory; memory efficiency; minimum state requirement; multiplier coefficient; Adaptive filters; Digital filters; Equations; Floors; Steady-state; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994
Print_ISBN :
0-7803-1862-5
Type :
conf
DOI :
10.1109/TENCON.1994.369226
Filename :
369226
Link To Document :
بازگشت