Realization of block floating-point digital filters and application to block implementations

Author

Ralev, Kamen R. ; Bauer, Peter H.

Author_Institution

KenCast Inc., Stamford, CT, USA

Volume

47

Issue

4

fYear

1999

fDate

4/1/1999 12:00:00 AM

Firstpage

1076

Lastpage

1086

Abstract

Realization issues of block floating-point (BFP) filters such as complexity, roundoff noise, and absence of limit cycles are analyzed. Several new results are established. Under certain conditions, BFP filters perform better than fixed-point filters at the expense of a slight increase in complexity; convex programming can be used to minimize the roundoff noise; limit cycles will not be present if the underlying fixed-point system is free of quantization limit cycles. It is shown that BFP arithmetic can be efficiently combined with block implementations to further improve the roundoff noise and stability of the implementation and reduce the complexity of processing BFP data

Keywords

computational complexity; digital filters; filtering theory; floating point arithmetic; noise; quantisation (signal); roundoff errors; BFP arithmetic; block floating-point digital filters; block implementations; complexity; convex programming; data processing; fixed-point filters; limit cycles; roundoff noise; stability; Digital filters; Dynamic range; Fixed-point arithmetic; Floating-point arithmetic; Limit-cycles; Linear systems; Noise reduction; Nonlinear filters; Quantization; Stability;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.752605

Filename

752605