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...
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: | |
Online Access: | https://ieeexplore.ieee.org/document/7856982/ |
Similar Items
-
A Robust Handwritten Numeral Recognition Using Hybrid Orthogonal Polynomials and Moments
by: Sadiq H. Abdulhussain, et al.
Published: (2021-03-01) -
On the computational aspects of Charlier polynomials
by: Alaa M. Abdul-Hadi, et al.
Published: (2020-01-01) -
The Ultraspherical Polynomials
by: Moore, John Bowman
Published: (1959) -
A New Separable Moments Based on Tchebichef-Krawtchouk Polynomials
by: Zinah N. Idan, et al.
Published: (2020-01-01) -
On Computational Aspects of Krawtchouk Polynomials for High Orders
by: Basheera M. Mahmmod, et al.
Published: (2020-08-01)