Cart (Loading....) | Create Account
Close category search window
 

A fast polynomial interpolation for Remez exchange method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Iwaki, M. ; Wisdom Syst. Lab., Tsukuba Univ., Ibaraki, Japan ; Toraichi, K. ; Ishii, R.

The computational complexity of several algorithms for polynomial interpolation is quantitatively evaluated. There are four well-known algorithms for obtaining the interpolation polynomial. The first algorithm is to solve simultaneous equations for coefficients of the polynomial (the most basic one). The second is Lagrange's interpolation algorithm (the classical one used widely). The third is Lagrange's algorithm in the barycentric form. The fourth is Newton's interpolation algorithm (using divided differences). Using Newton's interpolation in the method, one can make the Remez exchange method faster, which is useful for the design of linear-phase Chebyshev FIR (finite impulse response) digital filters

Published in:

Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

19-21 May 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.