• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• 한국통신학회논문지
• /
• 제21권8호
• /
• pp.2013-2022
• /
• 1996

순환코드를 채널에러 뿐만아니라 버스트(또는 타임슬롯)동기의 검출에도 이용하면 버스트에 동기필드가 필요치않아 이에 따른 오버헤드를 줄일 수 있다. 본 논문에서는 순환코드를 이용하여 버스트 동기와 에러클 복합검출하는 시스팀에서 단 한번의 CRC(cyclic redundancy code) 디코딩 만으로 이를 수행하는 효율적인 방법을 제안하였다. 기존의 방식에서는 한번의 CRC 디코딩을 하여 버스트 동기를 찾은 후 에러 검출을 위해 다시 CRC디코딩을 하여 두번의 디코딩 과정이 필요하다. 제안된 방법은 처리 시간의 단축과 시스팀 구현을 용이하게 할 수 있는 장점이 있으며 동기검출 성능은 기존의 방식과 동일하다. 채널에러가 발생한다면 복합 검출 시스팀은 실제 전송된 코드워드가 아닌 다른 코드워드를 오검출할 수 있다. 오검출 확률은 검출방법에 좌우되지않고 발생한 전송에러 특성에 의해 결정된다는 사실에 착안, 간단한 과정을 통해 오검출 확률을 새롭게 유도하여 정확한 표현식을 제시하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.295-298
• /
• 2003

In this paper, a novel maximum a posterion (MAP) estimation for the channel decoding of H.264 codes in the presence of transmission error is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted. And, there has been growing interest of communication, the research about transmission of exact data is increasing. Unlike the case of voice transmission, noise has a fatal effect on the image transmission. The reason is that video coding standards have used the variable length coding. So, only one bit error affects the all video data compressed before resynchronization. For reasons of that, channel needs the channel codec, which is robust to channel error. But, usual channel decoder corrects the error only by channel error probability. So, designing source codec and channel codec, Instead of separating them, it is tried to combine them jointly. And many researches used the information of source redundancy In received data. But, these methods do not match to the video coding standards, because video ceding standards use not only one symbol but also many symbols in same data sequence. In this thesis, We try to design combined source-channel codec that is compatible with video coding standards. This MAP decoder is proposed by adding semantic structure and semantic constraint of video coding standards to the method using redundancy of the MAP decoders proposed previously. Then, We get the better performance than usual channel coder's.