2012
DOI: 10.1155/2012/752024
|View full text |Cite
|
Sign up to set email alerts
|

N Point DCT VLSI Architecture for Emerging HEVC Standard

Abstract: This work presents a flexible VLSI architecture to compute the -point DCT. Since HEVC supports different block sizes for the computation of the DCT, that is, up to , the design of a flexible architecture to support them helps reducing the area overhead of hardware implementations. The hardware proposed in this work is partially folded to save area and to get speed for large video sequences sizes. The proposed architecture relies on the decomposition of the DCT matrices into sparse submatrices in order to redu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
32
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 43 publications
(32 citation statements)
references
References 22 publications
0
32
0
Order By: Relevance
“…Moreover, the proposed architecture can be pruned to reduce the complexity of implementation substantially with only a marginal effect on the coding performance for both folded and full-parallel 2-D DCT-II implementations. Ahmed et al [21] have proposed a dynamic N-point DCT-II for HEVC inverse transform of sizes 4x4, 8x8, 16x16 and 32x32. The hardware architecture is partially folded in order to save the area and improve the speed up of the design.…”
Section: B Hardware Transform Implementationmentioning
confidence: 99%
“…Moreover, the proposed architecture can be pruned to reduce the complexity of implementation substantially with only a marginal effect on the coding performance for both folded and full-parallel 2-D DCT-II implementations. Ahmed et al [21] have proposed a dynamic N-point DCT-II for HEVC inverse transform of sizes 4x4, 8x8, 16x16 and 32x32. The hardware architecture is partially folded in order to save the area and improve the speed up of the design.…”
Section: B Hardware Transform Implementationmentioning
confidence: 99%
“…Even though it uses a smaller technology compared to SDCT (45 nm vs. 65 nm) that grants a faster clock frequency (1.7×), the SDCT presents 4.7× higher throughput. Ahmed et al [17] designed a folded structure that decomposes the DCT matrices into sparse submatrices to reduce the multiplications. Moreover, these last are eliminated thanks to a lifting scheme.…”
Section: Comparison With Previous Workmentioning
confidence: 99%
“…With the factorization relationship of DCT, the number of arithmetic operations of transform can be reduced. Ahmed et al [9] decomposed the DCT matrix into sparse submatrices where the multiplications are avoided by using the lifting scheme. Arai et al [10] proposed AAN fast algorithm based on common factor extraction algorithm in which the complicated common factors were moved from transform kernel to scale part.…”
Section: Introductionmentioning
confidence: 99%