Skip to main content
Log in

On the computation of discrete Legendre polynomial coefficients

  • Communication Briefs
  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

A new and fast method to find the discrete Legendre polynomial (DLP) coefficients is presented. The method is based on forming a simple matrix using addition only and then multiplying two elements of the matrix to compute the DLP coefficients.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Peter Beckman,Orthogonal Polynomials for Engineers and Physicists, The Golem Press, Boulder, CO: 1973.

    Google Scholar 

  2. Orin J. Farrel and Bertram Ross,Solved Problems: Gamma and Beta Functions, Legendre Polynomials, Bessel Functions, New York: Macmillan, 1963.

    Google Scholar 

  3. Isaac M. Horowitz,Synthesis of Feedback Systems, New York: Academic Press, 1963.

    Google Scholar 

  4. Richard A. Haddad and Thomas W. Parsons,Digital Signal Processing: Theory, Applications, and Hardware, New York: Computer Science Press, 1991.

    Google Scholar 

  5. R.M. MacRobert,Spherical Harmonics, New York: Dover, 1948.

    Google Scholar 

  6. Norman Morrison,Introduction to Sequential Smoothing and Prediction, New York: McGraw-Hill, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aburdene, M.F. On the computation of discrete Legendre polynomial coefficients. Multidim Syst Sign Process 4, 181–186 (1993). https://doi.org/10.1007/BF00986240

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00986240

Key Words

Navigation