CoChat

Minimax Design of Low-Complexity Allpass Variable Fractional-Delay Digital Filters

Tian-Bo Deng · 2010 · IEEE Transactions on Circuits and Systems I: Regular Papers
Cited by 70

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

This paper proposes noniterative and iterative linear programming (LP) procedures for designing low-complexity allpass variable fractional-delay (VFD) digital filters in the minimax sense. Expressing each coefficient of an allpass VFD filter as a polynomial in the VFD parameterp, we show that the frequency response error of an allpass VFD filter can be written as a pure imaginary part divided by its denominator. Thus, the minimax design can be approximately formulated as an LP problem through neglecting the denominator, which leads to a noniterative minimax design. To improve the minimax design accuracy, we propose an iterative LP procedure that utilizes the denominator from the preceding iteration as a known. The iterative LP minimization is repeated until it converges to the minimax solution. Moreover, we also present a two-stage algorithm for optimizing the optimal variable rangep∈ [pMin,pMax] of the VFD parameterpand successively reducing the subfilter orders. Design examples are given to show that both noniterative and iterative LP methods can achieve much better minimax designs (smaller peak errors) than the existing iterative weighted-least-squares (WLS) approaches, which aim to minimize the peak errors of VFD response and variable phase response, respectively. Moreover, the resulting allpass VFD filters have lower complexities than those from the iterative WLS approaches.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcsi.2009.2037407

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 70

Metadata

Authors
Deng, T.-B.
Venue
IEEE Transactions on Circuits and Systems I: Regular Papers
Published
2010-08
Volume
57
Issue
8
Pages
2075-2086
ISSN
  • 1549-8328 (ISSN-L)
  • 1558-0806
OpenAlex
W2149046860
Cited by
70
References
4
FWCI
14.26
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.