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

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 5; pp. 2470 - 2478
Main Authors:	Abdulhussain, Sadiq H., Ramli, Abd Rahman, Al-Haddad, Syed Abdul Rahman, Mahmmod, Basheera M., Jassim, Wissam A.
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Coefficients Compression tests Computation Computers Discrete cosine transform Discrete cosine transforms Electronic mail Feature extraction Image reconstruction Indexes numerical propagations errors Orthogonal polynomials Polynomials recurrence algorithm Signal analysis Signal processing Signal processing algorithms Speech Speech compression Tchebichef polynomials
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!