Exhaustive search algorithm for checking limit cycle behavior of digital filters

Kamal Premaratne, E. C. Kulasekere, P. H. Bauer, L. J. Leclerc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, an algorithm that can be utilized to determine the presence or absence of limit cycles in fixed-point implementation of digital filters is given. It is applicable for filters in state-space formulation (and hence, application to the corresponding direct form follows as a special case), and is independent of the order, type of quantization, and whether the accumulator is single- or double-length. Bounds on the amplitude and period of possible limit cycles are presented. The robustness of the algorithm in terms of limit cycle performance with respect to filter coefficient perturbations is verified. The algorithm is then used to obtain regions in the coefficient space where a filter of given order is limit cycle free. In this process, we have obtained limit cycle free regions that were previously unknown for the Two's complement case.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Editors Anon
PublisherIEEE
Pages2035-2038
Number of pages4
Volume3
StatePublished - 1995
EventProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA
Duration: Apr 30 1995May 3 1995

Other

OtherProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3)
CitySeattle, WA, USA
Period4/30/955/3/95

Fingerprint

Digital filters

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Premaratne, K., Kulasekere, E. C., Bauer, P. H., & Leclerc, L. J. (1995). Exhaustive search algorithm for checking limit cycle behavior of digital filters. In Anon (Ed.), Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 3, pp. 2035-2038). IEEE.

Exhaustive search algorithm for checking limit cycle behavior of digital filters. / Premaratne, Kamal; Kulasekere, E. C.; Bauer, P. H.; Leclerc, L. J.

Proceedings - IEEE International Symposium on Circuits and Systems. ed. / Anon. Vol. 3 IEEE, 1995. p. 2035-2038.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Premaratne, K, Kulasekere, EC, Bauer, PH & Leclerc, LJ 1995, Exhaustive search algorithm for checking limit cycle behavior of digital filters. in Anon (ed.), Proceedings - IEEE International Symposium on Circuits and Systems. vol. 3, IEEE, pp. 2035-2038, Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3), Seattle, WA, USA, 4/30/95.
Premaratne K, Kulasekere EC, Bauer PH, Leclerc LJ. Exhaustive search algorithm for checking limit cycle behavior of digital filters. In Anon, editor, Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 3. IEEE. 1995. p. 2035-2038
Premaratne, Kamal ; Kulasekere, E. C. ; Bauer, P. H. ; Leclerc, L. J. / Exhaustive search algorithm for checking limit cycle behavior of digital filters. Proceedings - IEEE International Symposium on Circuits and Systems. editor / Anon. Vol. 3 IEEE, 1995. pp. 2035-2038
@inproceedings{26ace670a6ac48698b1f3c8f82f0747a,
title = "Exhaustive search algorithm for checking limit cycle behavior of digital filters",
abstract = "In this paper, an algorithm that can be utilized to determine the presence or absence of limit cycles in fixed-point implementation of digital filters is given. It is applicable for filters in state-space formulation (and hence, application to the corresponding direct form follows as a special case), and is independent of the order, type of quantization, and whether the accumulator is single- or double-length. Bounds on the amplitude and period of possible limit cycles are presented. The robustness of the algorithm in terms of limit cycle performance with respect to filter coefficient perturbations is verified. The algorithm is then used to obtain regions in the coefficient space where a filter of given order is limit cycle free. In this process, we have obtained limit cycle free regions that were previously unknown for the Two's complement case.",
author = "Kamal Premaratne and Kulasekere, {E. C.} and Bauer, {P. H.} and Leclerc, {L. J.}",
year = "1995",
language = "English (US)",
volume = "3",
pages = "2035--2038",
editor = "Anon",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "IEEE",

}

TY - GEN

T1 - Exhaustive search algorithm for checking limit cycle behavior of digital filters

AU - Premaratne, Kamal

AU - Kulasekere, E. C.

AU - Bauer, P. H.

AU - Leclerc, L. J.

PY - 1995

Y1 - 1995

N2 - In this paper, an algorithm that can be utilized to determine the presence or absence of limit cycles in fixed-point implementation of digital filters is given. It is applicable for filters in state-space formulation (and hence, application to the corresponding direct form follows as a special case), and is independent of the order, type of quantization, and whether the accumulator is single- or double-length. Bounds on the amplitude and period of possible limit cycles are presented. The robustness of the algorithm in terms of limit cycle performance with respect to filter coefficient perturbations is verified. The algorithm is then used to obtain regions in the coefficient space where a filter of given order is limit cycle free. In this process, we have obtained limit cycle free regions that were previously unknown for the Two's complement case.

AB - In this paper, an algorithm that can be utilized to determine the presence or absence of limit cycles in fixed-point implementation of digital filters is given. It is applicable for filters in state-space formulation (and hence, application to the corresponding direct form follows as a special case), and is independent of the order, type of quantization, and whether the accumulator is single- or double-length. Bounds on the amplitude and period of possible limit cycles are presented. The robustness of the algorithm in terms of limit cycle performance with respect to filter coefficient perturbations is verified. The algorithm is then used to obtain regions in the coefficient space where a filter of given order is limit cycle free. In this process, we have obtained limit cycle free regions that were previously unknown for the Two's complement case.

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

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

M3 - Conference contribution

VL - 3

SP - 2035

EP - 2038

BT - Proceedings - IEEE International Symposium on Circuits and Systems

A2 - Anon, null

PB - IEEE

ER -