Generalized digital Butterworth filter design
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
This correspondence introduces a new class of infinite impulse response (IIR) digital filters that unifies the classical digital Butterworth filter and the well-known maximally flat FIR filter. New closed-form expressions are provided, and a straightforward design technique is described. The new IIR digital filters have more zeros than poles (away from the origin), and their (monotonic) square magnitude frequency responses are maximally flat at /spl omega/=0 and at /spl omega/=/spl pi/. Another result of the correspondence is that for a specified cutoff frequency and a specified number of zeros, there is only one valid way in which to split the zeros between z=-1 and the passband. This technique also permits continuous variation of the cutoff frequency. IIR filters having more zeros than poles are of interest because often, to obtain a good tradeoff between performance and implementation complexity, just a few poles are best.
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.
Integrity signals
Registry
Cites
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.
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
Multirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
Gani, J. (1969) · Technometrics · doi:10.1080/00401706.1969.10490702 · Cited by 1,023
Parks, T. W., & Burrus, C. S. (1987) · Cited by 793
Self-citationRecursive 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
On the approximation problem in nonrecursive digital filter design
Herrmann, O. (1971) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1971.1083275 · Cited by 199
Maximally flat low-pass FIR filters with reduced delay
Selesnick, I., & Burrus, C. S. (1998) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.659456 · Cited by 51
Self-citationOn maximally-flat linear-phase FIR filters
Vaidyanathan, P. P. (1984) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1984.1085581 · Cited by 23
The Roots of the Maximally Flat-Delay Polynomials
Orchard, H. J. (1965) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1965.1082473 · Cited by 12
Research works printed but not linked: 16
- rabiner, 1972, Digital Signal Processing
- 10.1109/TASSP.1983.1164083 · doi:10.1109/tassp.1983.1164083
- 10.1002/cta.4490130306 · doi:10.1002/cta.4490130306
- sarama¨ki, 1980, iir filters with maximally flat passband and equiripple stopband, Proc Europ Conf Circuit Theory Des, 468
- selesnick, 0, Maximally flat lowpass filters realizable as allpass sums
- selesnick, 1996, New techniques for digital filter design
- 10.1109/78.668565 · DOI
- 10.1109/ICASSP.1996.543681 · DOI
- 10.1109/78.295193 · doi:10.1109/78.295193
- kaiser, 1979, design subroutine (mxflat) for symmetric fir low pass digital filters with maximally-flat pass and stop bands, Proc IEEE ASSP Soc Dig Signal Process Committ Programs Dig Signal Process, 5.3-1
- 10.1016/0165-1684(85)90034-9 · doi:10.1016/0165-1684(85)90034-9
- oberhettinger, 1970, hypergeometric functions, Handbook of Mathematical Functions
- 10.1109/78.229887 · doi:10.1109/78.229887
- 10.1109/ISCAS.1993.692589 · doi:10.1109/iscas.1993.692589
- 10.1049/el:19800359 · doi:10.1049/el:19800359
- unbehauen, 1981, on the design of recursive digital low-pass filters with maximally flat pass-band and chebyshev stop-band attenuation, Proc IEEE Int Symp Circuits Syst (ISCAS), 528
Cited by
Li, F., Xia, Y., Wang, F., Zhang, D., Li, X., & He, F. (2020) · Applied Sciences · doi:10.3390/app10051804 · Cited by 64
Electrocardiographic Biomarker Based on Machine Learning for Detecting Overt Hyperthyroidism
Choi, B., Jang, J. H., Son, M., Lee, M. S., Jo, Y. Y., Jeon, J. Y., Jin, U., Soh, M., Park, R. W., & Kwon, J. M. (2022) · European Heart Journal - Digital Health · doi:10.1093/ehjdh/ztac013 · Cited by 12
Metadata
- Authors
- Selesnick, I. W., & Burrus, C. S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1998-06
- Volume
- 46
- Issue
- 6
- Pages
- 1688-1694
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2157519031
- Cited by
- 314
- References
- 8
- FWCI
- 2.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized digital Butterworth filter design. https://app.cochat.ai/papers/10.1109/78.678493
- The paper
- Selesnick, I. W., & Burrus, C. S. (1998). Generalized digital Butterworth filter design. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.678493
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.