• Title/Summary/Keyword: channel decoder

Search Result 343, Processing Time 0.026 seconds

The Softest handoff Design using iterative decoding (Turbo Coding)

  • Yi, Byung-K.;Kim, Sang-G.;Picknoltz, Raymond-L.
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.76-84
    • /
    • 2000
  • Communication systems, including cell-based mobile communication systems, multiple satellite communication systems of multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite of beam-to-team, respectively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35% to 70% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff during a session. this new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative decoding algorithm (Turbo Coding). the Turbo code introduced by Berrou et all. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently. Turbo codes have been adapted as the coding scheme for the data transmission of the third generation international cellular communication standards : UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suitable for the code and packet diversity combining techniques. this proposed system provides not only an unprecedented coding gain from the Turbo code and it iterative decoding, but also gain induced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analysis using exact upper bounding techniques for medium to high signal to noise ratio.

  • PDF

Performance of Run-length Limited Coded Parity of Soft LDPC Code for Perpendicular Magnetic Recording Channel (런-길이 제한 부호를 패리티로 사용한 연판정 LDPC 부호의 수직자기기록 채널 성능)

  • Kim, Jinyoung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.9
    • /
    • pp.744-749
    • /
    • 2013
  • We propose soft user data input on LDPC codes with parity encoded by the (1, 7) run length limited (RLL) code for perpendicular magnetic recording channel. The user data are encoded by maximum transition run (MTR) (3;11) code. In order to minimize the loss of code rate, the (1, 7) RLL code only encode the parity of LDPC. Also, to increase performance, we propose only user data part applied soft output Viterbi algorithm (SOVA). The performance using the SOVA showed good performance lower than 26 dB. In contrast, it showed worse performance high than 26 dB. This is because of incorrect soft information by high jitter noise and two different input types for LDPC decoder.

Advanced Error Tracking Algorithm for H.263 (H.263에 적합한 개선된 에러 트래킹 알고리즘)

  • Hyo-seok Lee;Soo-Mok Jung
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.1
    • /
    • pp.123-130
    • /
    • 2004
  • In this paper, an advanced error tracking algorithm by using feedback channel was proposed for error resilient transmission. Using this proposed algorithm, the propagation of errors were reduced within the decoded data over bit error prone network. The addresses of corrupted blocks are reported to encoder by decoder. With negative acknowledgments of feedback channel, the encoder can precisely calculate negative acknowledgments and track the propagated errors by examining the backward motion dependency for proper pixel in the current encoding frame. The error-propagation effects can be terminated completely by INTRA refreshing the affected macro-blocks by using proposed error tracking algorithm. By utilizing the selective four-corner error tracking approximation, the error tracking computations of the proposed algorithm is less than that of the algorithm using full pixel without substantial degradation in video quality. The proposed algorithm can track errors rapidly and accurately.

  • PDF

Performance Analysis of Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 세미 랜덤 인터리버를 이용한 터보코드의 성능분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.5
    • /
    • pp.1067-1075
    • /
    • 2000
  • In this paper, the performance of turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

  • PDF

Fast Decoding Method of Distributed Video Based on Modeling of Parity Bit Requests (패리티 비트 요구량 모델링에 의한 분산 비디오의 고속 복호화 기법)

  • Kim, Man-Jae;Kim, Jin-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2465-2473
    • /
    • 2012
  • Recently, as one of low complexity video encoding methods, DVC (Distributed Video Coding) scheme has been actively studied. Most of DVC schemes exploit feedback channel to achieve better coding performances, however, this causes these schemes to have high decoding delay. In order to overcome these, this paper proposes a new fast DVC decoding method using parity-bit request model, which can be obtained by using bit-error rate, sent by encoder with motion vector, which is transmitted through feedback channel by decoder after generating side information. Through several simulations, it is shown that the proposed method improves greatly the decoding speed, compared to the conventional schemes.

A Performance Assessment of Real-time Multichannel Audio Codec

  • Kim, Sunghan;Jang, Daeyoung;Hong, Jinwoo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.3E
    • /
    • pp.56-61
    • /
    • 1997
  • In this paper, we describe a real-time implementation of a multi-channel auido codec system that is based on the MPEG-1 audio algorithm. The major feature of this system is that it has a flexible multi-DSP system that can be adapted for various applications with using up to four TMS320C40 DSPs. The purpose of this paper is to present the problems of the system and is to describe the optimized methods to solve the problems in the view of hardware and software. Our audio codec is composed of an encoder an a decoder system and the bit rate of bitstream is up to 384 kbps. Fast input/output interfaces, DSP overloads, and inter-DSP communications methods with high speed are considered in multi-DSP H/W. Also, to run real-time in S/W, optimizing methods of algorithm are considered. After implementation of system, the subjective assessment method, and 'triple stimulus/hidden reference/double blind' that recommended by ITU-R TG10/3 is adopted for the quality of our system. All test items except one are awarded difference grades(diffgrade) better than 1-. Form the results, multi-channel audio system can be used for HDTV service.

  • PDF

Performance Analysis of Reed Solomon/Convolutional Concatenated Codes and Turbo code using Semi Random Interleaver over the Radio Communication Channel (무선통신 채널에서 RS/길쌈 연쇄부호와 세미 랜덤 인터리버를 이용한 터보코드의 성능 분석)

  • 홍성원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.5
    • /
    • pp.861-868
    • /
    • 2001
  • In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

  • PDF

A Method of Estimating Distortion in Pixel-Domain Wyner-Ziv Residual Video Coding (화면 간 차이신호의 화소영역 위너-지브 비디오 부호화 기법에서 왜곡 예측방법)

  • Kim, Jin-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.4
    • /
    • pp.891-898
    • /
    • 2014
  • The DVC (Distributed Video Coding) provides a theoretical basis for the implementation of light video encoder. Conventionally, lots of studies have been focused on the codec scheme of Stanford University that has a feedback channel to control the bit rate finely. However, the codec scheme can not evaluate the qualities of the frames reconstructed by the received parity bits at the decoder side. This paper presents an efficient method of estimating distortion by correcting the virtual channel noises in side information and then facilitating the measurements of the visual qualities. Through several simulations, it is shown that the proposed method is very efficient in estimating the visual qualities of the reconstructed WZ frames.

Robust Scalable Video Transmission using Adaptive Multiple Reference Motion Compensated Prediction (적응 다중 참조 이동 보상을 이용한 에러에 강인한 스케일러블 동영상 전송 기법)

  • 김용관;김승환;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3C
    • /
    • pp.408-418
    • /
    • 2004
  • In this paper, we propose a novel scalable video coding algorithm based on adaptively weighted multiple reference frame method. To improve the coding efficiency in the enhancement layer, the enhancement frame is predicted by the sum of adaptively weighted double motion compensated frames in the enhancement layer and the current frame in the base layer, according to the input video characteristics. By employing adaptive reference selection scheme at the decoder, the proposed method reduce the drift problem significantly. From the experimental results, the proposed algorithm shows more than 1.0 ㏈ PSNR improvement, compared with the conventional scalable H.263+ for various packet loss rate channel conditions.

On the Existence of the (2,1) Mother Code of (n,n-1) Convolutional Code ((n,n-1) 길쌈부호에 대한 (2,1) 마더부호의 존재)

  • Jang, Hwan-Seok;Chung, Ha-Bong;Seong, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.4
    • /
    • pp.165-171
    • /
    • 2014
  • The rate of the channel code can be controlled by various methods. Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (n,k) convolutional code is obtainable by puncturing some mother codes, and the process of finding the mother code is necessary for designing the optimum channel decoder. In this paper, we proved that any (n,n-1) convolutional code has (2,1) mother codes regardless of the puncturing pattern and showed that they must be equivalent.