A Simple Ladder Realization of Maximally Flat Allpass Fractional Delay Filters
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index; none of the 20 sources its claims cite is checked for support yet.
Abstract
This brief proposes a new ladder structure for the Thiran fractional delay filter (i.e., maximally flat allpass fractional delay filter given by the Thiran approximation). The proposed ladder structure is based on a continued fraction representation. Although there exists a similar approach that was proposed by Tassart and Depalle, their structure is not realizable because of delay-free loops. On the other hand, we show that the proposed method avoids generating delay-free loops and thus successfully yields a realizable ladder structure for the Thiran fractional delay filter in a very simple form.
Overview
CoChat Summary
TL;DR
This brief proposes a realizable ladder structure for the Thiran maximally flat allpass fractional delay filter using a continued fraction formulation that avoids the delay-free loops of an earlier Tassart–Depalle approach. The resulting structure is simple, stable, and each ladder section requires only two multipliers.
Key findings
- The proposed ladder structure avoids delay-free loops by using the substitution \(z^{-1} \leftarrow z^{-1}/(1-z^{-1})\), whereas the earlier method of [9] used \(z^{-1} \leftarrow z^{-1}-1\) and produced an unrealizable structure.
- Each ladder section uses very simple coefficients calculated from \(D\) and \(k\); the integer coefficients \(2\) and \(2k-1\) can be implemented by shifters and adders, so each section requires only two multipliers.
- Stability is guaranteed: for \(1 \le k \le N\), each ladder section has a single pole \(z=(D-3k+2)/(D+k)\), and the paper proves \(|(D-3k+2)/(D+k)|<1\) for \(D>N-1\), so all poles lie inside the unit circle.
- The prototype filter before substitution is not necessarily stable and is not allpass; the substitution maps unstable poles inside the unit circle and converts it into the desired stable allpass maximally flat fractional delay filter. The paper also reports experimentally confirming that state variables are mutually orthogonal for white noise input.
Methods
- Theoretical derivation: the paper introduces a continued fraction expansion involving \(x\) and \(y\), sets \(x=z^{-1}\) and \(y=-D\), and uses the \((2N+1)\)st approximant to obtain a new formulation \(G_{\mathrm{FD}}(z)\) identical to the \(N\)th-order Thiran fractional delay filter \(H_{\mathrm{FD}}(z)\).
- Structure construction: it first builds a prototype ladder for \(G_p(z)\) by modifying the type IB ladder form of Mitra and Sherwood, then applies substitutions to obtain the proposed ladder structure for the Thiran filter.
- Analysis: stability is proved by deriving the pole of each ladder section and showing it lies inside the unit circle; no empirical dataset or numerical simulation study is reported.
Limitations
- The paper states that theoretical analysis of the finite wordlength performance of the proposed ladder structure is beyond its scope.
- The paper states that the orthogonal property of state variables for white noise input was experimentally confirmed, but theoretical proof and a practical application are still being investigated.
- Evident from the text: no quantitative implementation results, finite wordlength measurements, or comparisons with other structures are provided.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures



Verification
Claims the paper makes
0 Valid · 0 Not valid · 17 Not checked · 26 Own results and interpretations
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the continued fraction given by (12) coincides with the right-hand side of (5).”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the poles of the subsections G pk ( z ) given in Fig. 2(b) are calculated to be z = -2(2 k -1) / ( D + k ) , which does not necessarily satisfy | z | < 1”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the two integer coefficients ( 2 and 2 k -1 ) can be implemented by shifters and adders”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“each ladder section requires only two multipliers.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“we show that the proposed method avoids generating delay-free loops”
- Also stated in: § III. MAIN RESULT · p. 3 · plain
“the proposed structure does not include any delay-free loop”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § III. MAIN RESULT · p. 3 · plain
28 more claims
Create a free account to see all 43 claims and every source verdict.
- Probably not a substantial claim. 5
- It may state two separate claims as one. 5
Citations
Cites
(1972) · Cited by 17,806
Splitting the unit delay [FIR/all pass filters design]
Laakso, T. I., Valimaki, V., Karjalainen, M., & Laine, U. K. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.482137 · Cited by 1,168
Splitting the Unit Delay - Tools for fractional delay filter design
Laakso, T. I., Välimäki, V., Karjalainen, M., et al. (1996) · IEEE Signal Processing Magazine · Cited by 534
Recursive digital filters with maximally flat group delay
Thiran, J.-P. (1971) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1971.1083363 · Cited by 247
A normalized digital filter structure
Gray, A., & Markel, J. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162680 · Cited by 234 · cited 1×
“It was shown that a ladder structure is a promising candidate for such a highaccuracy structure [20], [21], and the same was proven in the field of analog filters [22].”
BackgroundRoundoff noise in digital filters: Frequency transformations and invariants
Mullis, C., & Roberts, R. (1976) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1976.1162869 · Cited by 168
Nonlinear Methods in Numerical Analysis.
Jacobsen, L., Cuyt, A. A. M., & Wuytack, L. (1988) · Mathematics of Computation · doi:10.2307/2008603 · Cited by 128
Discrete-Time Modeling of Acoustic Tubes Using Fractional Delay Filters
V�lim�ki, V. (1998) · Cited by 123
Johns, D. A., Snelgrove, W. M., & Sedra, A. S. (1989) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.17579 · Cited by 75
Efficient tunable IIR and allpass filter structures
Makundi, M., Laakso, T. I., & Välimäki, V. (2001) · Electronics Letters · doi:10.1049/el:20010276 · Cited by 52
Cited by
Frequency Adaptive Repetitive Control of New Energy Grid-Connected Inverter Based on Improved IIR
Liu, P., Wang, C., Zhang, Y., Liang, Y., Cui, Y., & Fang, J. (2023) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2023.3274185 · Cited by 35
Variable cutoff frequency FIR filters: a survey
Dhabu, S. S., Ambede, A., Agrawal, N., Smitha, K. G., Darak, S. J., & Vinod, A. P. (2020) · SN Applied Sciences · doi:10.1007/s42452-020-2140-6 · Cited by 28
“elay. (A detailed literature review regarding the ‘fractional delay structures’ (FDSs), which can provide desired fractional delay, can be found in [1]. More recent advances in the design of FDSs are [63, 64, 65, 66].) To control the cutoff frequency of the overall VCF filter on-the-fly, the fractional delay generated…”
BackgroundGarg, S., Yadav, R., & Kumar, M. (2022) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-022-00846-8 · Cited by 3
Koshita, S. (2022) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2022sml0004 · Cited by 1
Self-citationA Novel Subband Fractional Delay Algorithm Based on the Filterbank of Cochlear ImplantPreprint
Chen, Y., & Chen, Y. (2020) · doi:10.21203/rs.3.rs-21519/v1
“The least mean square fractional delay filter [22-27] and the maximal flat fractional delay filter [23-32] are the most widely used fractional delay interpolation methods.”
Method
Metadata
- Authors
- Koshita, S., Abe, M., & Kawamata, M.
- Affiliations
- Tohoku University (JP)
- ORCID
- Koshita, Shunsuke
- Venue
- IEEE Transactions on Circuits and Systems II: Express Briefs
- Published
- 2014-03
- Volume
- 61
- Issue
- 3
- Pages
- 203-207
- ISSN
- 1549-7747 (ISSN-L)
- 1558-3791
- OpenAlex
- W2085274624
- Semantic Scholar
- cb1f4141a9fadde4d5aecc7ac8d987f65030556e
- Cited by
- 5
- References
- 23
- Citations by year
- 2023: 1 · 2022: 2 · 2020: 2
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- IEEE Transactions on Circuits & Systems II Express Briefs (publishedVersion)
- Funders
- Japan Society for the Promotion of Science (24760286)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Analog and Mixed-Signal Circuit Design
- Physical Sciences › Computer Science › Signal Processing › Advanced Adaptive Filtering Techniques
- Keywords
- fractional delay filter, all-pass filter, continued fraction representation
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.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Simple Ladder Realization of Maximally Flat Allpass Fractional Delay Filters. https://app.cochat.ai/papers/10.1109/tcsii.2013.2296131
- The paper
- Koshita, S., Abe, M., & Kawamata, M. (2014). A Simple Ladder Realization of Maximally Flat Allpass Fractional Delay Filters. IEEE Transactions on Circuits and Systems II: Express Briefs. https://doi.org/10.1109/tcsii.2013.2296131
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.