2020
DOI: 10.1109/tcsvt.2018.2886736
|View full text |Cite
|
Sign up to set email alerts
|

An Area-Efficient Variable-Size Fixed-Point DCT Architecture for HEVC Encoding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…The proposed method has reduced rate-distortion losses and achieved significant complexity savings compared to existing implementations. Two families of architectures for the 2D-DCT are designed: folded and full-parallel [9]. The proposed method uses Integer DCT approximation which yields higher mean square error deviations.…”
Section: Existing Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed method has reduced rate-distortion losses and achieved significant complexity savings compared to existing implementations. Two families of architectures for the 2D-DCT are designed: folded and full-parallel [9]. The proposed method uses Integer DCT approximation which yields higher mean square error deviations.…”
Section: Existing Modelsmentioning
confidence: 99%
“…𝛽 ρ𝑙 is computed for odd value of n using (9). The quotient 𝑞 𝜌𝑖 is computed as (ρi + (ρ-1)/2)/N, to adjust the sign of 𝛽 ρ𝑙 .…”
Section: D-dct Using N 1d-dctmentioning
confidence: 99%
“…In [7], distributed arithmetic techniques [20] are used to implement the multipliers with simple shift and accumulator circuits. In [13], a n-dimensional Reduced Adder Graph (RAG-n) algorithm [21] is used to minimize the number of adders in add-shift-based multiplication circuits.…”
Section: A Proposals Related To the Hevc Standardmentioning
confidence: 99%
“…In [11], the results of the first 1D transform are transposed before they are written into the memory; thus, the 1D transform processors use the transposition memory as a simple memory buffer. In [13], the first 1D processor writes the first transform results row-wise in the transposition buffer, and the second 1D processor reads them column-wise; at the same time, the first 1D processor writes the second transform results column-wise, and so on.…”
Section: A Proposals Related To the Hevc Standardmentioning
confidence: 99%