DocumentCode
2040751
Title
Coding FIR Filter Coefficients in Power-of-Two Format
Author
Izydorczyk, Jacek
Author_Institution
Silesian Univ. of Technol., Gliwice, Poland
fYear
2007
fDate
24-27 Nov. 2007
Firstpage
261
Lastpage
264
Abstract
The paper presents an algorithm for optimal vector quantization of an FIR filter´s coefficients using SPT format. The measure of quality of quantization is the Euclidean distance between of the set of coefficients and its approximations. Because of the Parseval theorem minimization of the Euclidean distance between two sets of coefficients of the FIR filter is equivalent to minimization of the mean square distance between frequency characteristic of filters. The idea of the quantization algorithm is very similar to the idea of the Huffman coding. The algorithm was tested with the mini-max error based designs of FIR filter obtained by the means of the Parks-McClellan methodology.
Keywords
FIR filters; Huffman codes; least mean squares methods; vector quantisation; Euclidean distance; FIR filter coefficients coding; Huffman coding; Parks-McClellan methodology; Parseval theorem minimization; SPT format; mean square error distance minimization; mini-max error; optimal vector quantization; power-of-two format; Digital filters; Equations; Euclidean distance; Finite impulse response filter; Frequency; Logic circuits; Minimization; Paper technology; Signal processing algorithms; Vector quantization; FIR digital filters; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing and Communications, 2007. ICSPC 2007. IEEE International Conference on
Conference_Location
Dubai
Print_ISBN
978-1-4244-1235-8
Electronic_ISBN
978-1-4244-1236-5
Type
conf
DOI
10.1109/ICSPC.2007.4728305
Filename
4728305
Link To Document