• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.352-359
• /
• 2013

This paper proposes an entropy coding unit for H.264/AVC baseline profile. Entropy coding requires code tables for macroblock encoding. There are patterns in codewords of each code tables. In this paper, the patterns between codewords are analyzed to reduce the hardware cost. The entropy coding unit consists of Exp-Golomb unit and CAVLC unit. The Exp-Golomb unit can process five code types in a single unit. It can perform Exp-Golomb processing using only two adders. While typical CAVLC units use various code tables which require large amounts of resources, the sizes of the tables are reduced to about 40% or less of typical CAVLC units using relationships between table elements in the proposed CAVLC unit. After the Exp-Golomb unit and the CAVLC unit generate code values, the entropy unit uses a small size shifter for bit-stream generation while typical methods are barrel shifters.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.510-513
• /
• 2007

가변길이 부호는 많은 이미지 및 영상 표준에서 폭넓게 사용되는 기법이다. 특히 국제 표준인 JVT와 중국 A/V 표준인 AVS는 엔트로피 코딩을 수행하기 위해 Exp-Golomb 코드에 기반한 UVLC(Universal Variable Length Code)를 채용하고 있다. 본 논문에서는 H.264/AVC의 엔트로피 코딩에서 사용되는 Exp-Golomb CODEC의 하드웨어 구현에 대해 연구하였다. 식의 간략화로 구현하기 어려운 log함수와 거듭제곱 연산을 하지 않으며, 첫 번째 1 검출기와 누산기 제어에 의한 배럴 쉬프터를 통하여 별도의 시간 지연 없이 부호화 및 복호화가 되도록 설계하였다. Xilinx ISE툴을 사용하여 합성하고, 보드 수준에서 PCI인터페이스를 사용하여 검증하였다. 본 논문에서 설계된 Exp-Glomb CODEC은 H.264/AVC 및 AVS와 같은 분야에서 응용이 가능할 것으로 예견된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1244-1251
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple code words in H.264/A VC entropy coding. The exponential Golomb (Exp-Golomb) code words used in H 264/A VC do not reflect enough the symbol distributions of the combined syntax element in [7] due to their static probability distribution characteristics However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax clement according to given image sequences. Simulation results show that our proposed scheme outperforms the existing [7] me in compression efficiency without loss of quality.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.231-233
• /
• 2012

HEVC 비디오 코덱에서는 인터 예측을 수행할 때 고정된 지수 골룸 코드를 사용하여 차분 움직임 벡터를 부호화한다. 그러나 고정된 Exp-Golomb 코드를 사용하게 되면 영상의 움직임을 고려하지 않고 영상의 국지적인 특성을 반영하는데 어려움이 있다. 본 논문에서는 현재 블록의 MVP와 예측된 MV에 따라 적응적인 Exp-Golomb 코드를 결정하는 방법을 제안한다. 현재 블록의 MVP에 따라 현재 MV를 예측하는 MV모델링을 통하여 Exp-Golomb 코드를 결정한다. HEVC의 참조소프트웨어인 HM6.0을 이용하여 실험한 결과, Random Access 부호화 구조에서는 평균적으로 약 0.9%의 성능 향상을 얻을 수 있었으며, Low Delay 부호화 구조에서는 약 0.6%의 BD-rate의 감소를 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1055-1061
• /
• 2004

In this paper, we propose an efficient dynamic coding scheme by using multiple codewords in H.264/AVC entropy coding. The exponential Golomb (Exp-Golomb) codewords used in H.264/AVC do not reflect enough the symbol distributions of the combined syntax element in (7) due to their static probability distribution characteristics. However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax element according to given image sequences. Simulation results show that our proposed scheme outperforms the existing (7) method in compression efficiency without loss of quality.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.11
• /
• pp.71-76
• /
• 2008

H.264(or MPEG-4/AVC pt.10) is a high performance video coding standard, and is widely used. Variable length code (VLC) of the H.264 standard compresses data using the statistical distribution of values. A decoder parses the compressed bit stream and searches decoded values in lookup tables, and the decoding process is not easy to implement by hardware. We propose an architecture of variable length decoder(VLD) for the H.264 baseline profile(BP) L4. The CAVLD decodes syntax elements using the combination of arithmetic units and lookup tables for the optimized hardware architecture. A barral shifter and a first 1's detector parse NAL bit stream, and are shared by Exp-Golomb decoder and CAVLD. A FIFO memory between CAVLD and the reorder unit and a buffer at the output of the reorder unit eliminate the bottleneck of data stream. The proposed VLD is designed using Verilog-HDL and is implemented using an FPGA. The synthesis result using a 0.18um standard CMOS technology shows that the gate count is 22,604 and the decoder can process HD($1920{\times}1080$) video at 120MHz.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1359-1365
• /
• 2008

The portion of header in H.264 gets higher than those of previous standards instead of its better compression efficiency. Therefore, this paper proposes a new technique to compress the header of H.264. Unifying a sentence elementary in H.264, H.264 does not consider the distribution of element which be encoded and uses existing Exp-Golomb method, but it is uneffective for variable length coding. Most of the header are block type(s) and motion vector difference(s), and there are redundancies in the header of H.264. The redundancies in the header of H.264 which are analyzed in this paper are three. There are frequently appearing symbols and non-frequently appearing symbols in block types. And when mode 8 is selected in macroblock, all of four sub-macroblock types are transferred. At last, same values come in motion vector difference, especially '0.' This paper proposes the algorithm using type code and quadtree, and with them presents the redundant information of header in H.264. The type code indicates shape of the macroblock and the quadtree does the tree structured motion compensation. Experimental results show that proposed algorithm achieves lower total number of encoded bits over JM12.4 up to 32.51% bit reduction.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.101-102
• /
• 2012

지수-골롬 부호는 데이터의 무손실 부호화를 위해 사용되는 대표적인 방법으로서 지수 함수 형태로 단일 모드 분포를 가지는 데이터의 부호화에 적합하다. 본 논문에서는 데이터의 분포가 단일 모드가 아닌 이중 모드를 가지는 경우에 적용하기 위해 변형된 지수-골롬 부호를 제안하고 모드의 높이와 모드 사이의 거리에 따른 부호화 성능을 살펴보았으며 실제 데이터에 적용한 실험결과를 제시하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11C
• /
• pp.1058-1065
• /
• 2006

In this paper, we propose a new motion vector coding algorithm suitable for MPEG-4 Part 10 video coding standard. In the proposed algorithm, the amount of the motion for a given video sequence is Predicted by using a characteristic of the motion vector distribution for the neighboring blocks as well as the MB_type, which is the syntax element in the standard. And one of the independent coding and the combined coding methods is adaptively employed to compress the motion vector difference. Simulation results show that the proposed algorithm outperforms the conventional methods without additional memory and calculations.