• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.133-136
• /
• 2000

A RVLC(Reversible Variable Length Code) with an efficient table memory is proposed in this paper. In the conventional decoding methods, the weight of symbols and code values are used for the decoding table. These methods can be applied for Huffman decoding. In VLC decoding, many studies have been done for memory efficiency and decoding speed. We propose an improved table construction method for general VLC and RVLC decoding, which uses the transition number of bits within a symbol with an enhanced weight decomposition. In this method, tile table for RVLC decoding can be implemented with a smaller memory

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.137-140
• /
• 2003

In this paper, we propose a new construction algorithm for the reversible variable-length code (RVLC) using a simplified average length function of the optimal Huffman code. RVLC is introduced as one of the error resilience tools in H.263+ and MPEG-4 owing to its error-correcting capability. The proposed algorithm demonstrates an improved performance in terms of the average codeword length over the existing HVLC algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.57-68
• /
• 2004

Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.316-324
• /
• 2001

A table compression method for reversible variable length code is proposed in this paper. TNWT(Transition Number and Weight of Tree) method, which uses the transition number of bits within a symbol and the level of a code tree, is proposed. Compression of table values is performed after arrangment of values that is not distinghishable by transition number and weights. In decoding, the transition number and weight of code are used. In this method, the table for RVLC decoding can be implemented with a smaller memory.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.243-248
• /
• 1999

MPEG-4에서 오류강인성(Error Resilience)를 위한 한 방법으로 Resynchronization Markers(RM)을 사용한다. 한 프레임이 시작될 때 StartCode를 사용하여 동기를 맞추고 몇 개의MacroBlock을 encoding한 후 일정한 비트수(Threshold 값)가 지나면 재동기 마커 표시하여 재동기를 한다. 이렇게 하므로서 한 프레임 내에서 어떤 부분에 에러가 발생하더라도 그 에러가 속해있는 비디오패킷(재동기 마커와 재동기 마커사이의 Data)만을 버리거나 RVLC(ReversibleVariable Length Codes)를 사용하여 Data를 복원할 수 있다. 그러나 만약 재동기 마커에 에러가 발생하거나 에러의 전파로 인하여 재동기 마커를 인식 못한다면 두 개 이상의 패킷이 손실되거나RVLC를 사용한 데이터 복원을 할 수 없다. 본 논문에서는 이를 막기위해 디코딩 전에 Prescan을 통해서 재동기 마커의 위치를 탐지하고 에러가 생긴 재동기 마커를 복원하는 방법을 제안하였다. 그리고 bitrate에 따른 MB(MacroBlock)의 크기와 비디오 패킷 크기(재동기 마커와 재동기 마커간의 거리)를 분석하여 재동기 마커를 찾는 루틴에 적용하였다.