1996
DOI: 10.1006/dspr.1996.0015
|View full text |Cite
|
Sign up to set email alerts
|

A Fast 8 × 8 Pruned DCT Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1998
1998
2007
2007

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…Recently, El-Sharkawy and Eshmawy [3] presented an efficient matrix factorization for one-dimensional (1-D) recursive pruned DCT (RPDCT) which improves the result of Wang [6] significantly. Later, they [4] extended the proposed method from the 1-D domain to the 2-D domain successfully. Based on the result of [3], the motivation of this research is to present new matrix factorizations for RPDCT in order to gain some computational advantages.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, El-Sharkawy and Eshmawy [3] presented an efficient matrix factorization for one-dimensional (1-D) recursive pruned DCT (RPDCT) which improves the result of Wang [6] significantly. Later, they [4] extended the proposed method from the 1-D domain to the 2-D domain successfully. Based on the result of [3], the motivation of this research is to present new matrix factorizations for RPDCT in order to gain some computational advantages.…”
Section: Introductionmentioning
confidence: 99%