Probabilistic Error Free Design of Long Fixed-Point Polynomial FIR Predictors

Author

Tanskanen, Jarno M A ; Hyttinen, Jari A K ; Dimitrov, Vassil S.

Author_Institution

Ragnar Granit Inst., Tampere Univ. of Technol.

fYear

2006

fDate

7-9 June 2006

Firstpage

22

Lastpage

25

Abstract

In this paper, a method for designing long fixed-point polynomial FIR predictors (FPFPs) is proposed. Our method yields filters that perform exact prediction even with short coefficient word lengths. Under ordinary coefficient quantization, prediction capabilities degrade, or may be totally lost. Here, the filters are designed so that the prediction properties are exactly preserved in fixed-point implementations. The algorithm is derived for second degree polynomial prediction using any filter length and integer prediction step. Also some non-integer prediction steps are possible

Keywords

FIR filters; fixed point arithmetic; prediction theory; quantisation (signal); FPFP; coefficient quantization; finite impulse response; fixed-point polynomial FIR predictor design; prediction filter; second degree polynomial prediction; Closed-form solution; Degradation; Design methodology; Equations; Filtering theory; Finite impulse response filter; Nonlinear filters; Polynomials; Quantization; Uniform resource locators;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Symposium, 2006. NORSIG 2006. Proceedings of the 7th Nordic

Conference_Location

Rejkjavik

Print_ISBN

1-4244-0412-6

Electronic_ISBN

1-4244-0413-4

Type

conf

DOI

10.1109/NORSIG.2006.275266

Filename

4052261