Elimination of limit cycles due to two's complement quantization in normal form digital filters

Guo Fang Xu, Tamal Bose

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Normal form digital filters are attractive due to their desirable properties when implemented in finite wordlength arithmetic. These filters are free from all overflow limit cycles and quantization limit cycles when magnitude truncation is used. However, when two's complement truncation (TCT) quantization is used, limit cycles can still exist. In this paper, it is shown that when block structures are used, normal form digital filters can be made free of limit cycles due to TCT quantization. It is shown that this can be done with a small block size. An algorithm is also presented to find the minimum block size required for a given filter. Some examples are given to illustrate the results.

Original languageEnglish (US)
Pages (from-to)2891-2895
Number of pages5
JournalIEEE Transactions on Signal Processing
Volume45
Issue number12
DOIs
StatePublished - Dec 1997
Externally publishedYes

Fingerprint

Digital filters

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Elimination of limit cycles due to two's complement quantization in normal form digital filters. / Xu, Guo Fang; Bose, Tamal.

In: IEEE Transactions on Signal Processing, Vol. 45, No. 12, 12.1997, p. 2891-2895.

Research output: Contribution to journalArticle

@article{bee6b56c172e4441911aa3c27ff445da,
title = "Elimination of limit cycles due to two's complement quantization in normal form digital filters",
abstract = "Normal form digital filters are attractive due to their desirable properties when implemented in finite wordlength arithmetic. These filters are free from all overflow limit cycles and quantization limit cycles when magnitude truncation is used. However, when two's complement truncation (TCT) quantization is used, limit cycles can still exist. In this paper, it is shown that when block structures are used, normal form digital filters can be made free of limit cycles due to TCT quantization. It is shown that this can be done with a small block size. An algorithm is also presented to find the minimum block size required for a given filter. Some examples are given to illustrate the results.",
author = "Xu, {Guo Fang} and Tamal Bose",
year = "1997",
month = "12",
doi = "10.1109/78.650246",
language = "English (US)",
volume = "45",
pages = "2891--2895",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Elimination of limit cycles due to two's complement quantization in normal form digital filters

AU - Xu, Guo Fang

AU - Bose, Tamal

PY - 1997/12

Y1 - 1997/12

N2 - Normal form digital filters are attractive due to their desirable properties when implemented in finite wordlength arithmetic. These filters are free from all overflow limit cycles and quantization limit cycles when magnitude truncation is used. However, when two's complement truncation (TCT) quantization is used, limit cycles can still exist. In this paper, it is shown that when block structures are used, normal form digital filters can be made free of limit cycles due to TCT quantization. It is shown that this can be done with a small block size. An algorithm is also presented to find the minimum block size required for a given filter. Some examples are given to illustrate the results.

AB - Normal form digital filters are attractive due to their desirable properties when implemented in finite wordlength arithmetic. These filters are free from all overflow limit cycles and quantization limit cycles when magnitude truncation is used. However, when two's complement truncation (TCT) quantization is used, limit cycles can still exist. In this paper, it is shown that when block structures are used, normal form digital filters can be made free of limit cycles due to TCT quantization. It is shown that this can be done with a small block size. An algorithm is also presented to find the minimum block size required for a given filter. Some examples are given to illustrate the results.

UR - http://www.scopus.com/inward/record.url?scp=0031386121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031386121&partnerID=8YFLogxK

U2 - 10.1109/78.650246

DO - 10.1109/78.650246

M3 - Article

VL - 45

SP - 2891

EP - 2895

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 12

ER -