2017
DOI: 10.1109/access.2017.2669218
|View full text |Cite
|
Sign up to set email alerts
|

On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
49
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 55 publications
(49 citation statements)
references
References 26 publications
0
49
0
Order By: Relevance
“…The nth order of the scaled TP, T n (x) , with a positive integer N that represents the signal size is given by [7], [13], [14]:…”
Section: A Tchebichef Orthogonal Polynomialmentioning
confidence: 99%
See 2 more Smart Citations
“…The nth order of the scaled TP, T n (x) , with a positive integer N that represents the signal size is given by [7], [13], [14]:…”
Section: A Tchebichef Orthogonal Polynomialmentioning
confidence: 99%
“…Different TTR algorithms have been proposed to compute the TPCs. In this study, the state-of-the-art TTR algorithm, which is proposed in [7], is used and given as follows:…”
Section: A Tchebichef Orthogonal Polynomialmentioning
confidence: 99%
See 1 more Smart Citation
“…Transform-based approaches (TBAs) involve transforming a signal (frame) from the time (spatial) domain into the transform domain. Discrete transform is a useful tool in communication and signal processing [ 110 , 111 , 112 ]. It allows the viewing of signals in different domains and provides a massive shift in terms of its powerful capability to analyze the components of various signals.…”
Section: Sbd Approachesmentioning
confidence: 99%
“…There are many different ways to compute the coefficients of the orthogonal polynomials, i.e., by the hypergeometric definition [34], in terms of the Rodrigues formula [35], using the closed form representation, or by iterating the recurrence equations [36].…”
Section: Computational Aspects Of the Discrete Orthogonalmentioning
confidence: 99%