• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1384-1392
• /
• 1999

A high compression rate is required to transmit video sequences over low bit rate networks such as low bit rate communication channels. When highly compressed videos are transmitted over mobile channels of high error rate, bitstreams corrupted by channel errors are not only difficult to be decoded, but also have fatal effects on the other parts of the bitstreams. In this Paper, we propose an error concealment algorithm for recovering the blocks which can not be decoded due to damaged bitstreams. The proposed error concealment algorithm recovers the damaged blocks using the information of adjacent blocks which are correctly decoded. In the proposed algorithm, the motion vector of the damaged block is estimated using the overlapped block motion compensation(OBMC) and block boundary matching(BBM) techniques. Experiment results show that the proposed algorithm exhibits better performance in PSNR than existing error concealment methods.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.571-578
• /
• 2002

In this paper, we propose a video sequence coding scheme called AMV (Auxiliary Motion Vector) to minimize error propagation caused by transmission errors over the Internet. Unlike the conventional coding schemes the AMY coder, for a macroblock in a frame, selects two best matching blocks among several preceding frames. The best matching block, called a primary block, is used for motion compensation of the destination macroblock. The other block, called an auxiliary block, replaces the primary block in case of its loss at the decoder. When a primary block is corrupted or lost during transmission, the decoder can efficiently and simply suppress error propagation to the subsequent frames by replacing the block with an auxiliary block. This scheme has an advantage of reducing both the number and the impact of error propagations. We implemented the proposed coder by modifying H.263 standard coding and evaluated the performance of our proposed scheme in the simulation. The simulation results show that AMV coder is more efficient than the H.263 baseline coder at the high packet loss rate.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.712-714
• /
• 2001

매쉬 구조를 갖는 다중 프로세서에서의 오류를 허용하는 라우팅 기법은 구현에 있어 간결함을 제공하는 환경으로, 다수의 오류를 허용하기 위해 직사각형 모양의 오류 블록으로 구성하여 라우팅을 수행한다. 이 경우, 블록 내부의 정상적인 노드 역시 오류 노드로 간주되어 전체 노드의 사용율을 저하시키는데, 오류 블록을 몇 개의 확장된 매쉬로 나누고 DAG(Directed Acyclic Graph)에 적용하여 메시지 전송의 최단 거리를 구하는 RIFP(Routing for Irregular Faulty Pattern)기법으로 이를 해결하였다. 그러나, 이 기법은 노드간에 주고받는 메시지가 거치는 hop의 수가 오히려 증가되는 문제가 발생하게 된다. 본 논문에서는 증가되는 hop의 수를 억제하기 위해 목적 노드와 이웃 노드들로부터 오류블록 경계 부분까지 직선 경로를 찾는 SCP(Short-Cut Path)를 적용한 RIFP를 제안한다.

• Journal of Digital Contents Society
• /
• v.5 no.1
• /
• pp.28-34
• /
• 2004

In this paper, we have analyzed the block error probability of orthogonal multicarrier 16 QAM signal in a frequency selective Rician fading environment. The block error probability is evaluated with several parameters such as normalized propagation delay $(\gamma/T_S),$, bit energy to noise power ratio $(E_b/N_0),$ and desired signal to undesired signal power ratio (DUR) in fast fading and slow fading channels. In the fast fading channel, The result shows that the block error probability rather in the fast fading channel achieves better performance than in the slow fading channel, when the error correction capability is one or two.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.319-326
• /
• 2001

본 논문에서는 다단계상호연결 네트워크에 기반한 입력버퍼 구조의 ATM 스위치에 관해서 언급한다. 제안된 방법은 HOL 블록킹으로 인해 균일 트래픽(uniform traffic) 하에서 최대 약 58.6%의 처리율을 넘지 못하는 문제를 해결 할 수 있는 방법을 제시하며, 또한 오류허용 기능을 확장시키기 위하여 베이스라인 네트워크에서 버디 연결 매핑 및 제한연결 매핑 특성을 이용한 다중경로를 제공할 수 있는 버퍼 기법에 관하여 언급한다. 시뮬레이션에 의한 성능 평가 결과, 기존 방식과 비교하여 좋은 처리율과 셀 손실율을 보였으며, 더욱이 오류 스위치의 증가에도 불구하고 처리율의 수준은 적정한 셀 지연 범위 내에서 유지될 수 있음을 보여주고 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.337-340
• /
• 2010

본 논문은 H.264/AVC를 이용한 근접 무손실 화면내 부호화에서 기존의 라인 기반 예측 방법에서 발생할 수 있는 오류 전파 문제를 해결하기 위한 방법을 제안한다. H.264/AVC의 화면내 예측 부호화는 주변 블록의 복원 화소들을 현재 부호화하려는 블록의 예측값으로 사용하여 공간적 상관성을 제거하고 부호화 효율을 향상시킨다. 기존의 라인 기반 예측 방법에서는 일반적으로 화소 간 거리가 멀어질수록 화소 간 상관성이 떨어지므로 라인 단위로 예측을 수행하여 예측의 정확도를 높였다. 하지만, 이 경우 오류 전파 문제에 취약하다는 단점이 있다. 본 논문에서는 화면내 $16{\times}16$ 수직 및 수평 예측 모드에 대해 매크로블록을 라인 단위로 예측하면서 정해진 서브 블록마다 참조 화소를 업데이트하는 방법을 제안한다. 따라서, 라인 기반 예측 방법의 예측 정확도는 유지하면서 오류 전파 문제를 예방할 수 있다. 실험을 통해, 제안하는 방법이 High 프로파일에서 H.264/AVC 표준 소프트웨어 JM 12.2에 비해 평균 약 5.8%의 비트율을 감소시킬 수 있음을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2645-2652
• /
• 1996

In this paper wepropose a sub-block retransmission scheme for ARQ and hybrid ARQ schemes. When the cannel is quiet the sub-block retransmission scheme behaves like a conventional ARQ or hybrid ARQ scheme. As the channel is becoming noisy, the data block is dvided into small sub-blocks for transmission. Each sub-block is encoded for error control by an apprpriate shortened code and the code length of the shortened code is being adaptive to the corresponding channel BER. the reeived block is checked for errors sub-block by sub-block. The propsoed sub-block retransmission scheme provides improved throughput over conventional schemes by retransmitting only the naked sub-blocks in the occurrence of errors. An example of transferring ATM cells is considered for simulation.

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

In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10$^{-3}$ -10$^{-4}$ , it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1014-1020
• /
• 2008

Storage devices such as memories are widely used in various electronic products. They require high-density memory and currently the data has been stored in multi-level format, that results in high error rate. In this paper, we apply error correction schemes that are widely used in communication system to the storage devices for satisfying low bit error rate and high code rate. In A WGN channel with average BER $10^{-5}$ and $5{\times}10^{-6}$, we study error correction schemes for 4-1evel cell to achieve target code rate 0.99 and target BER $10^{-11}$ and $10^{-13}$, respectively. Since block codes may perform better than the concatenated codes for high code rate, and it is important to use less degraded inner code even when many bits are punctured. The performance of concatenated codes using general feedforward systematic convolutional codes are worse than the block code only scheme. The simulation results show that RSC codes must be used as inner codes to achieve good performance of punctured convolutional codes for high code rate.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.603-609
• /
• 2003

Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.