First the notion of a digital filter is briefly introduced. Next the part of the design process for such filters where approximation by polynomials with integral coefficients enters is outlined. Finally a result is stated and proved, which reduces the determination of the error involved in approximating a function by a polynomial whose coefficients are integers to a finite number of calculations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    Andria, G.: Approximation of continuous functions by polynomials with integral coefficients, J. Approx. Theory 4 (1971), 357–362.CrossRefGoogle Scholar
  2. (2).
    Ferguson, L. B. O.: Existence and uniqueness in approximation by integral polynomials, J. Approx. Theory 10 (1974), 237–244.CrossRefGoogle Scholar
  3. (3).
    Ferguson, L. B. O.: Uniform approximation by polynomials with integral coefficients I, Pacific J. Math. 27 (1968), 53–69.CrossRefGoogle Scholar
  4. (4).
    Liu, B.: Digital Filters and the Fast Fourier Transform. Beuchmark Papers in Electrical Engineering and Computer Science/12, Stroudsburg, Pennsylvania, Dowden, Hutchinson and Ross (distributed by Academic Press), 1975.Google Scholar
  5. (5).
    Oppenheim, A. V. and R. W. Schafer: Digital Signal Processing, Englewood Cliffs, New Jersey, Prentice Hall, 1975.Google Scholar
  6. (6).
    Rabiner, R. L. and C. M. Rader, eds.: Digital Signal Processing, New York, IEEE Press, 1972.Google Scholar
  7. (7).
    Selected Papers in Digital Signal Processing, II, New York, IEEE Press, 1975.Google Scholar

Copyright information

© Springer Basel AG 1980

Authors and Affiliations

  • Le Baron
    • 1
  • O. Ferguson
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaRiversideUSA

Personalised recommendations