• 한국정보통신학회논문지
• /
• 제11권2호
• /
• pp.385-391
• /
• 2007

본 논문에서는 V-BLAST (Vertical-Bell-lab Layered Space Time)의 두 디코딩 과정인 ordering과 slicing에 사전 확률 (a priori probability)로 사용하기 위해서 반복 디코딩 (iterative decoding)을 사용한 MAP (Maximum A Posteriori) 디코더의 외부 정보 (extrinsic information)를 이용한 최적의 터보 부호화된 (Turbo Coded) V-BLAST 기법을 적용한 적응 변조 시스템 (adaptive modulation system)을 제시 후 성능을 관찰한다. 또한 적응 변조 시스템에서 간단하게 V-BLAST 시스템과 터보 부호화 (Turbo Coding) 기법이 결합된 기존의 터보 부호화된 V-BLAST 기법을 적용한 경우에 비하여 어느 정도 전송률 (throughput)향상이 있는가를 살펴본다. 실험결과, 적응 변조 시스템에서 최적의 터보 부호화된 V-BLAST 기법을 적용한 경우가 기존의 터보 부호화된 V-BLAST 기법을 적용한 경우에 비하여 전송률 성능이 우수함을 보였다. 특히, 실험 결과는 2.5 Mbps의 전송률에서 1.5 dB의 SNR 이득을 보인다.

• Journal of Communications and Networks
• /
• 제6권3호
• /
• pp.209-215
• /
• 2004

In this paper, a butterfly Log-MAP decoding algorithm for turbo code is proposed. Different from the conventional turbo decoder, we derived a generalized formula to calculate the log-likelihood ratio (LLR) and drew a modified butterfly states diagram in 8-states systematic turbo coded system. By comparing the complexity of conventional implementations, the proposed algorithm can efficiently reduce both the computations and work units without bit error ratio (BER) performance degradation.

• Journal of information and communication convergence engineering
• /
• 제6권1호
• /
• pp.1-5
• /
• 2008

In this paper, we propose and analyze the AMC (Adaptive Modulation and Coding) system with efficient turbo coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique. The proposed algorithm adopts extrinsic information from a MAP (Maximum A Posteriori) decoder with iterative decoding as a priori probability in two decoding procedures of V-BLAST scheme; the ordering and the slicing. Also, we consider the AMC system using the conventional turbo coded V-BLAST technique that simply combines the V-BLAST scheme with the turbo coding scheme. And we compare the proposed decoding algorithm to a conventional V-BLAST decoding algorithm and a ML (Maximum Likelihood) decoding algorithm. In addition, we apply a STD (Selection Transmit Diversity) scheme to the systems for better performance improvement. Results indicate that the proposed systems achieve better throughput performance than the conventional systems over the entire SNR range. In terms of transmission rate performance, the suggested system is close in proximity to the conventional system using the ML decoding algorithm.

• ETRI Journal
• /
• 제29권3호
• /
• pp.363-370
• /
• 2007

In this paper, we propose a flexible turbo decoding algorithm for a high order modulation scheme that uses a standard half-rate turbo decoder designed for binary quadrature phase-shift keying (B/QPSK) modulation. A transformation applied to the incoming I-channel and Q-channel symbols allows the use of an off-the-shelf B/QPSK turbo decoder without any modifications. Iterative codes such as turbo codes process the received symbols recursively to improve performance. As the number of iterations increases, the execution time and power consumption also increase. The proposed algorithm reduces the latency and power consumption by combination of the radix-4, dual-path processing, parallel decoding, and early-stop algorithms. We implement the proposed scheme on a field-programmable gate array and compare its decoding speed with that of a conventional decoder. The results show that the proposed flexible decoding algorithm is 6.4 times faster than the conventional scheme.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• 융합신호처리학회논문지
• /
• 제2권2호
• /
• pp.62-67
• /
• 2001

최근의 이동통신 시스템에서 오류 정정 부호화 방식으로 사용되는 터보 코드의 성능은 부호기에 내재되어 부호의 자유 거리 결정에 큰 영향을 미치는 인터리버와 복호기에서 수행되는 반복 복호에 의한 것이다. 하지만 우수한 성능을 얻기 위해 수신과정에서 많은 지연시간이 요구되는데 이는 주로 인터리버의 크기에 의존하게 된다. 또한 터보 코드는 페이딩 채널 상에서도 신뢰성 있는 강력한 코딩 기법으로 알려져, 최근 ITU 등에서 IMT-2700과 같은 차세대 이동 통신에서 채널 코드의 표준으로 채택되었다. 따라서 본 논문에서는 복잡도는 2배로 증가하나 성능을 개선시킨 병렬 구조의 4-New 터보 복호기를 제안하고, 차세대 무선 멀티미디어 통신에서 실시간 음성 및 비디오 서비스를 제공 시 복호 지연시간을 단축시키기 위해 가변 복호 방법을 이용하여 AWGN과 페이딩 채널 환경에서의 컴퓨터 모의 실험을 통해 성능 분석을 하였다.

• 대한전자공학회논문지SD
• /
• 제41권9호
• /
• pp.39-48
• /
• 2004

최근 3세대 이동통신의 오류정정부호의 표준으로 채택된 터보 코드는 샤논의 한계에 가까운 성능을 보이며, 반복적인 디코딩 과정의 특성상 이동통신 시스템에서 전력 소모가 많은 블록 중 하나이다. 따라서 이동통신 기기의 전력 소모를 최소화하기 위한 노력으로 터보 디코더의 전력 소모를 줄이는 방법들에 대한 연구가 진행되어왔다. 본 논문에서는 디코딩 가능 임계값과 불가능 임계값 등 두개의 정지 기준을 적용함으로써 기존의 반복 디코딩 정지 기준 알고리즘을 개선하여, 오류정정 성능과 전력 소모면에서 기존의 방법보다 효율적인 새로운 터보 디코더 기술을 개발하였다. 실험 결과, 제안한 방법은 기존의 대표적인 방법에 비하여, 전체 12500회 실험 중 잘못된 오류정정 횟수는 평균적으로 89% 감소시키고 반복 디코딩 횟수는 29% 감소시킬 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.61-64
• /
• 1999

The turbo code appropriate to IMT-2000 is known to have a good performance whenever the size of frame increases. But it is not appropriate to a sort of video service to need real time because of decoding complexity and long delay time by the size of frame. Therefore this paper proposes decoding decision algorithm of short frame in which soft output is weighted according to iteration number in turbo decoder. Performance of the proposed algorithm is analysed in the AWGN channel when short length of frame is 100, 256, 640. As the result. it is appeared that the proposed decoding decision algorithm has improved in BER other than in the existing MAP decoding algorithm.

• Journal of Advanced Marine Engineering and Technology
• /
• 제25권2호
• /
• pp.375-382
• /
• 2001

In this study, an adapted Turbo Coding Algorithm for reducing communication error of a fire detection system for marine vessels, especially image transmission via power lone. Because it is necessary that this system communicate larger and faster than previous method, this study carried out enhancement a decoding speed by adaptation CRC with Turbo Code Algorithm, improvement of metric method, and reduction of decoding delay by using of Center-to-Top method. And the results are as follows: (1) Confirmed that a Turbo Code is so useful methods for reducing communication error in lots of noise environments. (2)Proposed technology in this study speed increasing method of Turbo Coding Algorithm proves 2 times faster than normal Turbo Code and communication error reducing as well in the board made by VHDL software & chips ALTERA company.

• ETRI Journal
• /
• 제28권5호
• /
• pp.672-675
• /
• 2006

The effect of block interleaving in a low density parity check (LDPC)-turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed-Solomon (RS) code. Thus, an LDPC-turbo concatenated code can show better performance than the conventional RS-turbo concatenated code. Furthermore, the performance of an LDPC-turbo code can be improved by using a block interleaver between the LDPC and turbo code. The average number of iterations in LDPC decoding can also be reduced by a block interleaver.