Low-pass filters realizable as all-pass sums

design via a new flat delay filter

Research output: Contribution to journalArticle

Abstract

This paper describes a new class of maximally flat low-pass recursive digital filters. The filters are realizable as a parallel sum of two all-pass filters, a structure for which low-complexity low-noise implementations exist. Note that, with the classical Butterworth filter of degree N which is retrieved as a special case, it is not possible to adjust the delay (or phase linearity). However, with the more general class of filters described in this paper, the adjustment of the delay becomes possible, and the tradeoff between the delay and the phase linearity can be chosen. The construction of these low-pass filters depends upon a new maximally flat delay allpole filter, for which the degrees of flatness at ω -0 and ω -π are not necessarily equal. For the coefficients of this flat delay filter, an explicit solution is introduced, which also specializes to a previously known result.

Original languageEnglish (US)
Pages (from-to)40-50
Number of pages11
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume46
Issue number1
DOIs
StatePublished - 1999

Fingerprint

All-pass filters
Butterworth filters
Low pass filters
Digital filters

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

@article{56303453e99848098469b176b5c62008,
title = "Low-pass filters realizable as all-pass sums: design via a new flat delay filter",
abstract = "This paper describes a new class of maximally flat low-pass recursive digital filters. The filters are realizable as a parallel sum of two all-pass filters, a structure for which low-complexity low-noise implementations exist. Note that, with the classical Butterworth filter of degree N which is retrieved as a special case, it is not possible to adjust the delay (or phase linearity). However, with the more general class of filters described in this paper, the adjustment of the delay becomes possible, and the tradeoff between the delay and the phase linearity can be chosen. The construction of these low-pass filters depends upon a new maximally flat delay allpole filter, for which the degrees of flatness at ω -0 and ω -π are not necessarily equal. For the coefficients of this flat delay filter, an explicit solution is introduced, which also specializes to a previously known result.",
author = "Ivan Selesnick",
year = "1999",
doi = "10.1109/82.749080",
language = "English (US)",
volume = "46",
pages = "40--50",
journal = "IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing",
issn = "1057-7130",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Low-pass filters realizable as all-pass sums

T2 - design via a new flat delay filter

AU - Selesnick, Ivan

PY - 1999

Y1 - 1999

N2 - This paper describes a new class of maximally flat low-pass recursive digital filters. The filters are realizable as a parallel sum of two all-pass filters, a structure for which low-complexity low-noise implementations exist. Note that, with the classical Butterworth filter of degree N which is retrieved as a special case, it is not possible to adjust the delay (or phase linearity). However, with the more general class of filters described in this paper, the adjustment of the delay becomes possible, and the tradeoff between the delay and the phase linearity can be chosen. The construction of these low-pass filters depends upon a new maximally flat delay allpole filter, for which the degrees of flatness at ω -0 and ω -π are not necessarily equal. For the coefficients of this flat delay filter, an explicit solution is introduced, which also specializes to a previously known result.

AB - This paper describes a new class of maximally flat low-pass recursive digital filters. The filters are realizable as a parallel sum of two all-pass filters, a structure for which low-complexity low-noise implementations exist. Note that, with the classical Butterworth filter of degree N which is retrieved as a special case, it is not possible to adjust the delay (or phase linearity). However, with the more general class of filters described in this paper, the adjustment of the delay becomes possible, and the tradeoff between the delay and the phase linearity can be chosen. The construction of these low-pass filters depends upon a new maximally flat delay allpole filter, for which the degrees of flatness at ω -0 and ω -π are not necessarily equal. For the coefficients of this flat delay filter, an explicit solution is introduced, which also specializes to a previously known result.

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

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

U2 - 10.1109/82.749080

DO - 10.1109/82.749080

M3 - Article

VL - 46

SP - 40

EP - 50

JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

SN - 1057-7130

IS - 1

ER -