1989
DOI: 10.1109/29.45536
|View full text |Cite
|
Sign up to set email alerts
|

A new look at DCT-type transforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

1992
1992
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(3 citation statements)
references
References 21 publications
0
2
0
1
Order By: Relevance
“…Let us first consider the DCT-II, which belongs to the family of discrete trigonometric transforms (DTT), and their implicit extension properties [32][33][34][35][36][37][38][39][40]. To summarize the DTT sequence extensions, two relevant parameters must be considered-the symmetry type (ST) and the point of symmetry (PoS).…”
Section: A Note On the Implicit Extension Of The Sequences Depending mentioning
confidence: 99%
“…Let us first consider the DCT-II, which belongs to the family of discrete trigonometric transforms (DTT), and their implicit extension properties [32][33][34][35][36][37][38][39][40]. To summarize the DTT sequence extensions, two relevant parameters must be considered-the symmetry type (ST) and the point of symmetry (PoS).…”
Section: A Note On the Implicit Extension Of The Sequences Depending mentioning
confidence: 99%
“…However, the implementation of the KLT is difficult because, during processing, one needs to determine the signal covariance matrix. One merit of the OCT is that there exist many fast algorithms for implementation; see Chen and Smith (l977a,b), Wang (1983), Kou and Mark (1989), Yip andRao (1984,1988).…”
Section: Introductionmentioning
confidence: 99%
“…Πιο αποτελεσματικοί γρήγοροι αλγόριθμοι ΔΜΣ μπορούν να χτιστούν με τις τεχνικές της παραγοντοποίησης [97]-[ΐ02], ή της αναδρομής [103]- [107]. Οι αλγόριθμοι παραγοντοποίησης διασπούν τον πίνακα του ΔΜΣ σε ένα γινόμενο αραιών (sparse) πινάκων, με σκοπό τη μείωση του αριθμού των προσθέσεων και των πολλαπλασιασμών.…”
Section: ανασκόπησηunclassified