pp. 905-922
S&M1824 Research Paper of Special Issue https://doi.org/10.18494/SAM.2019.2163 Published: March 29, 2019 Hardware Architecture Design for High-Performance H.264/AVC Deblocking Filter [PDF] Xiaodong Zheng, Wei Zhu, Shaoyong Yu, and Jinpeng Wu (Received October 15, 2018; Accepted January 30, 2019) Keywords: block-based discrete cosine transform (BDCT), block effect, deblocking filter, low memory, low cost.
In multimedia imaging/video compression systems, the block-based discrete cosine transform (BDCT) is widely applied to conversion and compression. During the quantization of compression, after processing with an inverse discrete cosine transform (IDCT), a certain defect emerges in BDCT, i.e., two adjacent blocks fail to be perfectly joined together. This block effect of the picture undermines the video quality and tends to become more pronounced as the sampling factor increases. In image decoding, a deblocking filter requires an enormous amount of computation. If the computation is carried out entirely by software, a large system bandwidth will inevitably be occupied. To overcome this problem, the design of a suitable hardware architecture is urgently required. In this study, we proposed the use of the system bus and a low-memory, low-cost, and effective deblocking filter architecture to reduce the operation time of the deblocking filter. In contrast to existing hardware architectures, the design proposed in this paper adopts dual-port static random access memory (SRAM) and two-port SRAM architectures, thereby storing data via a new data reading approach, to save transposed memory and reduce the hardware size. By coupling the proposed architecture with parallel processing units, the processing speed will be increased.
Corresponding author: Wei ZhuThis work is licensed under a Creative Commons Attribution 4.0 International License. Cite this article Xiaodong Zheng, Wei Zhu, Shaoyong Yu, and Jinpeng Wu, Hardware Architecture Design for High-Performance H.264/AVC Deblocking Filter, Sens. Mater., Vol. 31, No. 3, 2019, p. 905-922. |