Skip to main navigation Skip to search Skip to main content

Coding FIR filter coefficients in power-of-two format

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications
Pages261-264
Number of pages4
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007 - Dubai, United Arab Emirates
Duration: 14 Nov 200727 Nov 2007

Publication series

NameICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

Conference

Conference2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007
Country/TerritoryUnited Arab Emirates
CityDubai
Period14/11/0727/11/07

Keywords

  • FIR digital filters
  • Vector quantization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Communication

Fingerprint

Dive into the research topics of 'Coding FIR filter coefficients in power-of-two format'. Together they form a unique fingerprint.

Cite this