Fourier Series Representation for Polynomials with Application to Nonlinear Digital Filtering,
Abstract
A change-of-basis transformation between the trigonometric Fourier series and the Legendre polynomial series is derived. This transformation leads to two immediate results: one is a fast algorithm for computing the Legendre polynomial coefficients for a function; the second is a numerically stable computation algorithm for evaluating j sub n(z), and nth order spherical Bessel function. In addition, these results lead to a simple recursive digital network to be used in the implementation of adaptive nonlinear functions. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1976
- Accession Number
- ADA035363
Entities
People
- Gary L. Wise
- John S. Allen
- Neal C. Gallagher
Organizations
- University of Texas at Austin