$H^{\infty}$-Optimal Fractional Delay Filters
Open accessThe DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index; 3 of the 18 sources its claims cite were checked for support.
Abstract
Fractional delay filters are digital filters to delay discrete-time signals by a fraction of the sampling period. Since the delay is fractional, the intersample behavior of the original analog signal becomes crucial. In contrast to the conventional designs based on the Shannon sampling theorem with the band-limiting hypothesis, the present paper proposes a new approach based on the modern sampled-data H∞optimization that aims at restoring the intersample behavior beyond the Nyquist frequency. By using the lifting transform or continuous-time blocking the design problem is equivalently reduced to a discrete-time H∞optimization, which can be effectively solved by numerical computation softwares. Moreover, a closed-form solution is obtained under an assumption on the original analog signals. Design examples are given to illustrate the advantage of the proposed method.
Overview
CoChat Summary
TL;DR
The paper proposes designing fractional delay filters via sampled-data \(H^\infty\) optimization, aiming to restore intersample behavior beyond the Nyquist frequency rather than relying on Shannon bandlimiting. Using lifting, the sampled-data problem is reduced exactly to a finite-dimensional discrete-time \(H^\infty\) problem, with a closed-form solution under a first-order low-pass signal model.
Key findings
- The sampled-data \(H^\infty\) error system is norm-equivalent to a finite-dimensional discrete-time system: \(\|E\|_\infty = \|E_d\|_\infty\), so the design can be solved by standard discrete-time \(H^\infty\) software.
- Under a first-order low-pass weighting \(\hat W(s)\) with cutoff \(\omega_c>0\), the optimal filter \(\hat K(z)\) has a closed-form solution depending on fractional delay \(d\) and integer delay \(m\), enabling variable fractional delay filtering.
- In the design example with \(T=1\) sec, \(D=5.5\) sec (\(m=5\), \(d=0.5\)), and \(\omega_c=0.1\) rad/sec \(\approx 0.016\) Hz, the \(H^\infty\) design gave an \(L^2\) reconstruction error of \(1.34\times10^{-2}\), versus \(2.07\times10^{-2}\) for the conventional discrete-time \(H^2\) design.
- The \(H^2\)-optimal filter appeared closer to the ideal low-pass filter, but showed much larger high-frequency errors and more ringing at signal edges than the proposed \(H^\infty\)-optimal filter.
Methods
- The design problem is formulated as a sampled-data \(H^\infty\) optimization: find a digital filter \(K\) minimizing the worst-case error between the ideal delayed-and-sampled signal and the filtered sampled signal, with continuous-time input modeled by a stable strictly proper \(W(s)\).
- Continuous-time lifting transforms the mixed continuous/discrete error system into a time-invariant discrete-time system with infinite-dimensional input/output spaces; the dual operator \(BB^*\) then yields a norm-equivalent finite-dimensional discrete-time system.
- A closed-form solution is derived for first-order low-pass \(\hat W(s)\), and numerical examples compare the proposed filter with conventional FIR filters designed by discrete-time \(H^2\) optimization using an impulse-invariant discretization of \(\hat W(s)\).
Limitations
- The paper states that the closed-form solution assumes \(\hat W(s)\) is a first-order low-pass filter, which “may appear somewhat restrictive,” though it is argued to cover many typical cases and variations via robustness properties.
- The paper notes that \(H^\infty\)-optimal filters are generally difficult to solve analytically; the closed-form result is only for the first-order assumption.
- Remark 2 states that as \(\omega_c\to\infty\), the optimal filter coefficients \(a_0(d),a_1(d)\to0\) and \(\|E\|_\infty\to\infty\), meaning that if analog signals contain high-frequency components far beyond Nyquist, the worst-case input becomes more severe and the \(H^\infty\)-optimal filter approaches zero.
- Evident from the text: the numerical validation is limited to one design example and compares only against discrete-time \(H^2\) design; no broader empirical study or real-world implementation is reported.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures










Verification
Claims the paper makes
3 Valid · 2 Not valid · 16 Not checked · 45 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“Note that the signal subspace WL 2 is much wider than that of band-limited L 2 signals [42].”
What the sources say
- Supportedcites [42] [42] M. Nagahara, M. Ogura, and Y. Yamamoto, ' H ∞ design of periodically nonuniform interpolation and decimation for non-band-limited signals,' SICE Journal of Control, Measurement, and System Integration , vol. 4, no. 5, pp. 341-348, 2011. - source
Section 3.3 defines the signal subspace as FL₂ and explicitly says it is “essentially wider” than the band-limited subspace BL. The citing sentence uses W rather than the source’s F for the operator, but makes the same comparison. (LLM, conf=0.90)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Furthermore, the obtained filter shows greater robustness against unknown disturbances due to the nature of the uniform attenuation of the error frequency response; see [27] for details.”
What the sources say
- Supportedcites [27] [27] Y. Yamamoto, M. Nagahara, and P. P. Khargonekar, 'Signal reconstruction via H ∞ sampled-data control theory - Beyond the Shannon paradigm,' IEEE Trans. Signal Processing , vol. 60, no. 2, pp. 613-625, 2012. - source
The Signal Reconstruction Problem section says the design minimizes the worst error induced by an unknown input. The paper’s discussion of the H∞ norm says minimizing it yields performance that is uniformly good across the whole frequency range, supporting the stated reason for the filter’s robustness. Page numbers are not available in our copy. (LLM, conf=0.87)
plainstates a cause- 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.
- Supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The H 2 -optimal filter has much larger errors around edges of the signal than the proposed H ∞ -optimal one.”
plainstates an associationSingle case- 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 reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Design examples show that the H ∞ -optimal filter exhibits a much more satisfactory performance than the conventional H 2 -optimal filter.”
plainstates an association- 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.
None of the sources cited for this claim have been checked yet.
In the paper
“Theorem 2: Assume that ˆ W ( s ) is given by (15). Then the optimal filter ˆ K ( z ) is given by”
plainstates a cause- 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.
23 more claims
Create a free account to see all 66 claims and to verify the 3 references still open.
- It may state two separate claims as one. 13
- The quote only partly states this claim. 4
- Probably not a substantial claim. 26
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ REFERENCES · p. 8
“[28] P. P. Khargonekar and Y. Yamamoto, 'Delayed signal reconstruction using sampled-data control,' in Proc. 35th IEEE CDC , 1996, pp. 12591263.”
§ REFERENCES · p. 8
“[31] M. Nagahara and Y. Yamamoto, 'Optimal design of fractional delay filters,' in Proc. of 35th Conf. on Decision and Control , 2003, pp. 65396544.”
Citations
Cites
Communication in the presence of noise
Shannon, C. E. (1949) · Proceedings of the IRE · doi:10.1109/jrproc.1949.232969 · Cited by 6,539 · cited 1×
“Conventionally, fractional delay filters are designed based on the Shannon sampling theorem [13], [14] for strictly bandlimited analog signals.”
MethodState-space solutions to standard H/sub 2/ and H/sub infinity / control problems
Doyle, J. C., Glover, K., Khargonekar, P. P., & Francis, B. A. (1989) · IEEE Transactions on Automatic Control · doi:10.1109/9.29425 · Cited by 5,569
Multirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
Communication In The Presence Of Noise
Shannon, C. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.659497 · Cited by 4,804
Optimal Sampled-Data Control Systems
Chen, T., & Francis, B. A. (1995) · doi:10.1007/978-1-4471-3037-6 · Cited by 2,217
Sampling-50 years after Shannon
Unser, M. (2000) · Proceedings of the IEEE · doi:10.1109/5.843002 · Cited by 1,358 · cited 1×
“Conventionally, fractional delay filters are designed based on the Shannon sampling theorem [13], [14] for strictly bandlimited analog signals.”
MethodSplitting 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
Computing integrals involving the matrix exponential
Van Loan, C. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101743 · Cited by 832 · cited 1×
“Remark 1:The matrix M(t) can be computed via the matrix exponential formula [45]:”
MethodA continuously variable digital delay element
Farrow, C. W. (2003) · 1988., IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1988.15483 · Cited by 816 · cited 1×
“In some applications, digital filters with variable delay responses ( variable fractional delay filters[40], [10], [25], [26]) are desired.”
Bamieh, B. A., & Pearson, J. B. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.126576 · Cited by 682
Research works printed but not linked: 3
- [49] D. Donoho, A. Maleki, and M. Shaharam, 'Wavelab 850,' 2006.
- 0, MATLAB Codes for H-infinity Optimal Fractional Delay Filters
- [43] W. J. Rugh, Linear Systems Theory . Prentice Hall, 1996. -
Cited by
Fractional-Order Three-Dimensional $\nabla\times n$ Circuit Network
Zhou, K., Chen, D., Zhang, X., et al. (2015) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2015.2469031 · Cited by 19
Tracking of signals beyond the Nyquist frequency
Yamamoto, Y., Yamamoto, K., & Nagahara, M. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798875 · Cited by 14
Self-citationFractional-order multiple RLαCβ circuit
Li-Jie, D., Zhang, X., & Chen, D. (2014) · Acta Physica Sinica · doi:10.7498/aps.63.038401 · Cited by 8
Fractional-orderLβCαfilter circuit network
Hong, Z., Qian, J., Chen, D., et al. (2015) · Chinese Physics B · doi:10.1088/1674-1056/24/8/080204 · Cited by 7
Signal reconstruction with generalized sampling
Yamamoto, K., Nagahara, M., & Yamamoto, Y. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264601 · Cited by 8
Self-citationElectrical characteristics of a fractional-order 3 × n Fan network
Tan, Z., & Wang, X. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad2c81 · Cited by 6
Yamamoto, Y., & Nagahara, M. (2018) · Wiley eBooks · doi:10.1002/047134608x.w1010.pub2 · Cited by 7
Self-citationA Simple Ladder Realization of Maximally Flat Allpass Fractional Delay Filters
Koshita, S., Abe, M., & Kawamata, M. (2014) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2013.2296131 · Cited by 5
Xie, L., Shieh, L. S., Tsai, J. S. H., Wu, C.-Y., & Park, J. J. (2015) · Applied Mathematical Modelling · doi:10.1016/j.apm.2015.08.012 · Cited by 4
Sampled-Data Filters with Compactly Supported Acquisition Prefilters
Yamamoto, Y., Yamamoto, K., & Nagahara, M. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619614 · Cited by 3
Self-citationH∞-Optimal Fractional Delay Filters with Application to Pitch Shifting
Nagahara, M., & Yamamoto, Y. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120622-3-us-4021.00016 · Cited by 1
Self-citationDynamic tracking performance of servo mechanisms based on compound controller
Wen, N., Liu, Z., Zhang, F., et al. (2016) · Advances in Mechanical Engineering · doi:10.1177/1687814016671443 · Cited by 1
“The coefficient of equation (17) for the assumed filter only consumes a small number of additions and multiplications.”
BackgroundControl Applications in Audio Reproduction
Yamamoto, Y. (2021) · Springer eBooks · doi:10.1007/978-3-030-44184-5_183 · Cited by 1
Self-citationŘežaeizadeh, A., & Smith, R. S. (2016) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2016.2552458
Control Applications in Audio Reproduction
Yamamoto, Y. (2019) · Springer eBooks · doi:10.1007/978-1-4471-5102-9_183-2
Self-citation
Metadata
- Authors
- Nagahara, M., & Yamamoto, Y.
- Affiliations
- Kyoto University (JP)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-09
- Volume
- 61
- Issue
- 18
- Pages
- 4473-4480
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2036326049
- Semantic Scholar
- 196d701d6557045a54cbce3b5885741aa399c78e
- Cited by
- 15
- References
- 53
- Citations by year
- 2024: 1 · 2021: 1 · 2019: 1 · 2018: 2 · 2017: 1 · 2016: 3 · 2015: 3 · 2014: 2
- FWCI
- 4.10
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Japan Society for the Promotion of Science (24560543)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Design
- Keywords
- fractional delay filter, H-infinity optimization, sampled-data systems, intersample behavior, analytical solution, digital filter design
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
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).
Cited sources are checked with a language model’s help (gpt-6-sol).
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.