On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order

On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order

Tchebichef polynomials (TPs) and their moments are widely used in signal processing due to their remarkable performance in signal analysis, feature extraction, and compression capability. The common problem of the TP is that the coefficients computation is prone to numerical instabilities when the p...

Full description

Bibliographic Details
Main Authors: Sadiq H. Abdulhussain, Abd Rahman Ramli, Syed Abdul Rahman Al-Haddad, Basheera M. Mahmmod, Wissam A. Jassim
Format: Article
Language:English
Published: IEEE 2017-01-01
Series:IEEE Access
Subjects:
Orthogonal polynomials
recurrence algorithm
Tchebichef polynomials
numerical propagations errors
Online Access:https://ieeexplore.ieee.org/document/7856982/

Internet

https://ieeexplore.ieee.org/document/7856982/

Similar Items