• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.381-384
• /
• 2009

In the Wyner-Ziv coding, compression performance highly depends on the quality of the side information since better quality of side information brings less channel noise and less parity bit. However, as decoder generates side information without any knowledge of the current Wyner-Ziv frame, it doesn't have optimal criterion to decide which block is more advantageous to generate better side information. Hence, in general, fixed block size motion estimation (ME) is performed in generating side information. By the fixed block size ME, the best coding performance cannot be attained since some blocks are better to be motion estimated in different block sizes. Therefore if there is a way to find appropriate ME block of each block, the quality of the side information might be improved. In this paper, we investigate the effects of variable block sizes of ME in generating side information.

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

분산 비디오 복호화 기술은 저 용량 저 전력 시스템을 위한 초경량 복호화기를 제공할 수 있어 최근 많은 이슈가 되고 있다. 그러나 분산 비디오 복호화 기술은 피드백 채널을 이용하여 반복적인 패리티 비트 제어 방법을 주로 사용하기 때문에 전체 복호화 시간이 매우 길다는 단점을 가지고 있다. 따라서 분산 비디오 복호화 시스템의 고속화가 반드시 필요하며 이를 위해 많은 연구가 진행되어 왔다. 본 논문에서는 분산 비디오 복호화의 고속화를 위하여 보조정보와 LDPCA 프레임의 율-왜곡을 이용하여 패리티 비트 요구량을 예측하는 방법을 제안한다. 모의실험을 통해 제안하는 방법을 이용함으로써 분산 비디오 복호화에 소요되는 전제 복호 시간 대비 약 80% 시간 절감 효과를 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.594-597
• /
• 2010

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length($10^3{\leq}N{\leq}4\times10^3$) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) $P_b$ of practical importance($10^{-5}{\leq}P_b{\leq}10^{-4}$).