Turbo coded BICM-ID의 복잡도 개선 기법

강동훈(Donghoon Kang),이용욱(Yongwook Lee),오왕록(Wangrok Oh) 대한전자공학회 2013 전자공학회논문지 Vol.50 No.8

본 논문에서는 Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding)의 구현 복잡도를 개선하기 위한 기법을 제안한다. 터보 부호는 Shannon 한계에 근접하는 우수한 성능을 나타내는 오류정정부호 (error correction code)이며 터보 부호와 고차원 변조 (high order modulation)를 결합하여 전송효율을 개선할 수 있다. BICM (bit-interleaved coded modulation)은 채널 부호와 고차원 변조 사이에 이진 인터리버를 사용하는 기법이며 복호기와 복조기 간에 정보를 주고받으며 반복 복호 (iterative decoding)를 수행하는 BICM-ID를 이용하여 성능을 개선 할 수 있다. BICM-ID는 BICM과 비교하였을 때 반복 복호로 인하여 비트오율 (bit error rate) 성능이 개선되지만 구현 복잡도가 크게 증가하는 단점이 있다. 본 논문에서는 Turbo coded BICM-ID에서 구현 복잡도를 개선하기 위한 기법을 제안한다. 제안하는 기법은 기존에 제안된 Turbo coded BICM-ID 기법과 유사한 비트오율 (bit error rate) 성능을 나타내면서 구현 복잡도를 크게 감소시킬 수 있는 장점이 있다. In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

무선통신채널에서 효과적으로 감소된 복잡도를 갖는 Turbo Trellis Coded Modulation 구조 연구

김정수 한국산학기술학회 2004 한국산학기술학회논문지 Vol.5 No.5

본 논문에서는 감소된 복잡도를 가진 Turbo TCM(Turbo Trellis Coded Modulation) 구조를 제안하고 그 성능을 분석한다. Turbo Codes와 대역폭 효율을 증대시키기 위한 변조기술을 적용한 부호화기를 구성하고 수신기에서는 이진 Turbo Codes와 유사한 형태지만 다소 상이한 심벌 대 심벌 MAP 반복복호를 사용한다. 반복복호에 따른 성능 분석을 했으며 제안 된 구조는 Gray mapping을 이용한 Turbo Codes와 비교한 결과 BER = 10^-2인 경우 약 2.5㏈ 우수한 이득을 얻음을 알 수 있다. This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth. This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2.5㏈ at BER = 10^-2 compared to Turbo Codes with Gray mapping.

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

정규혁,허준 한국통신학회 2008 Journal of communications and networks Vol.10 No.1

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 minimumHamming 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.

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

Chung, Kyu-Hyuk,Heo, Jun The Korea Institute of Information and Commucation 2008 Journal of communications and networks Vol.10 No.1

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.

Joint Encryption and Error Correction Technical Research Applied an Efficient Turbo Code

보안공학연구지원센터(IJSIA) 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.10

In order to improve safety and reliability of secure communication system, we propose a joint encryption error correction coding scheme. In this scheme, a conflict-free interleaver parallel decoding method of Turbo codes is used, which is known simply as” efficient Turbo codes”, and it is combined with chaotic encryption together. This scheme makes the information encryption and efficient Turbo coding step be completed at the same time, and explain the encryption/decryption process through the efficient parallel decoding method, and verify the feasibility of the scheme through the application of Turbo code in image transmission as an example. The Matlab simulation results show that, the scheme performance is more excellent and effective in security and reliability than the existing joint encryption and error correction coding scheme. Our proposed scheme may provide an excellent encoding candidate scheme for secure communication system.

수중 음향통신에 적합한 터보 등화기 기반의 최적의 반복 부호 기법 연구

박태두(Tae-Doo Park),정지원(Ji-Won Jung) 한국항해항만학회 2013 한국항해항만학회지 Vol.37 No.5

수중에서의 통신은 해수면과 해저면 등에 의한 신호의 반사가 생겨 다중경로 현상이 발생한다. 이러한 다중경로의 영향으로 신호는 왜곡되고 원활한 수신을 방해하게 된다. 본 논문에서는 수신신호의 성능을 향상시키고자 수중통신에 적합한 반복부호를 설정하였다. 적용 가능한 반복부호로는 터보 부호와 LDPC 부호, BCJR 기반의 컨볼루션 부호가 있으며, 동일한 부호화율 및 비슷한 부호어 길이에서 터보 등 화기 기반의 성능을 분석하였다. 반복횟수를 5회로 고정하였고, 수중 채널 데이터는 실제 동해 바다에서 송수신 거리가 5Km로 실험을 하였다. 그리고 데이터 속도를 1Kbps에서 측정된 실제 데이터를 이용하였다. 성능 분석 결과, BCJR 기반의 컨볼루션 부호가 가장 적합함을 알 수 있었다. Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes, LDPC codes and convolutional code based on BCJR algorithm are dominant channel coding schemes in recent. Therefore this paper analyzed the performance of iterative codes based on turbo equalizer with the same coding rate and similar codeword length. The performances of three kinds of iterative codes were evaluated in the environment of underwater acoustic communication channel that are real data collected in Korean east sea. The distance of transmitter and receiver was 5Km and data rate was 1Kbps. As a result, convolutional code based on BCJR algorithm has better performance in underwater channel than turbo codes and LDPC codes.

주파수 오프셋을 고려한 Tued OFDM 시스템의 성능 개선에 관한 연구

이영춘,박기식 한국정보통신학회 2001 한국정보통신학회논문지 Vol.5 No.5

본 논문에서는 우선 반송파 주파수 오프셋이 OFDM/M-ary PSK 시스템에 미치는 성능 열 화를 분석하기 위해 오율식을 유도하였다. 그리고 Turbo 부호화 기법을 OFDM/M-ary PSK 시스템에 적용하여 성능 개선 정도를 평가하였다 최종적으로 Turbo Coded OFDM/M-ary PSK 시스템에서 요구하는 BER 성능을 만족시키기 위해 허용 가능한 최대 주파수 오프셋을 결정하였다. 성능 해석 결과 ary수가 커질수록 BER 성능이 열화됨을 알 수 있었고, 음성 서비스의 QoS (Quality of Service) 조건인 BER : $10^{-3}$을 만족시키려면 QPSK, 8PSK, 16PSK 변조 방식의 경우, 각각 약 7 dB, 9 dB, 17 dB의 $E_b/N_o$가 요구됨을 알 수 있었다 그리고 $E_b/N_o$/가 10 dB와 15 dB인 경우, $BER=10^{-3}$ 을 달성하기 위해서는 주파수 오프셋을 각각 0.05, 0075 이하로 유지해야 함을 알 수 있었다. 한편, OFDM/M-ary PSK시스템에 Turbo부호를 적용하면 ary수가 낮을수록 Turbo 부호의 성능 개선 효과가 크게 나타남을 알 수 있었다 그리고 16 ary이하의 PSK 변조 방식에 Turbo 부호화 기법을 적용한 경우, 데이터 서비스의 005 조건인 $BER=10^{-5}$을 만족시키려 면 약 8 dB 이하의 $E_b/N_o$가 요구됨을 알 수 있었다. 또한 Turbo 부호화 기법을 적용하면 매우 낮은 $E_b/N_o$ 값으로 음성 서비스를 충분히 지원할 수 있음을 알 수 있었고, 데이터 서비스는 주파수 오프셋 허용치에 관계없이 약 8 dB 정도의 $E_b/N_o$로 충분히 지원할 수 있음을 알 수 있었다. In this paper, it is analyzed theoretically that the performance degradation, caused by carrier frequency offset, in an OFDM/M-ary PSK system. Then, when Turbo coding is adopted to an OFDM/M-ary PSK system, the degree of performance enhancement is evaluated. Finally, the maximum frequency offset is calculated to satisfy the BER performance required in a Turbo coded OFDM/M-ary PSK system. As results of analysis, it is shown that the more the number of M-ary is, the worse the BER performance is. Moreover, 7dB, 9dB, and 17dB of $E_b/N_o$ are required in QPSK, 8PSK and 16PSK systems, respectively in order to satisfy the error performance, $BER=10^{-3}$ for voice communication. If $E_b/N_o$ are 10㏈ and 15㏈, the frequency offset should be below 0.05 and 0.075, respectively, for voice communication. When Turbo coding is adopted to an OFDM/M-ary PSK system, the less the number of M-ary is, the greater the performance enhancement of Turbo coding is. If the number of a M-ary system of the system is below 16, it is found that required $E_b/N_o$ is about 8dB to satisfy $BER=10^{-5}$ Moreover, in the system the Turbo coding scheme, voice communication is available with greatly low$E_b/N_o$, and 8dB of $E_b/N_o$ is enough for data communication regardless of the permission range of frequency offset.

시뮬레이션 기법을 이용한 LDPC 부호와 터보부호에 대한 EXIT 차트 생성 비교

람손 문냐라지 니와무콘디와,김수영 한국위성정보통신학회 2015 한국위성정보통신학회논문지 Vol.10 No.3

본 논문에서는 반복 복호 과정에서 연판정 정보값들의 변화로 인하여 성능이 개선되는 상황을 분석하기 위하여 사용되는EXIT(extrinsic information transfer) 차트를 LDPC 부호와 터보 부호에 대하여 생성하는 기법을 소개하고, EXIT 차트 생성과정에서 비트 오류를 제외하였을 경우 나타나는 효과에 대해 살펴보기로 한다. 본 논문에서 제시된 시뮬레이션을 이용한 EXIT 챠트생성 기법은 매우 간단한 방법으로 반복 복호를 사용하는 오류정정부호의 정보흐름을 파악할 수 있는 효율적인 방법이다. 시뮬레이션 결과 분석을 통하여 비트 오류를 제외할 경우 지나치게 정보량이 높은 구간에서만 EXIT 챠트가 생성된다는 사실을 확인할수 있었다. In this paper, we present two simulation methods to investigate the effect of excluding bit errors on generating the extrinsic information transfer (EXIT) chart for low density parity check (LDPC) and turbo codes. We utilized the simulation methods including and excluding bit errors to generate EXIT chart which was originally proposed for turbo codes. The generated EXIT charts for LDPC and turbo codes shows that the presented methods appropriately demonstrates the performance behaviours of iterative decoding for LDPC and turbo codes. Analysis on the simulation results demonstrates that the EXIT chart excluding the bit errors shows only a small part of the curves where the amount of information is too large.

병렬 구조를 이용한 Turbo Product Code 성능 분석

이태길,정지원 한국통신학회 2004 韓國通信學會論文誌 Vol.29 No.2c

최근 터보 부호에 비해서 구현시 복잡하지 않고, 높은 부호화율에서 거의 샤논 이론에 접근하는 Turbo Product Code에 대해 관심이 고조되고 있다. 본 논문에서는 기존의 Turbo Product code 복호기에서 row과 column을 직렬로 복호를 하지 않고 복호 구조가 병렬로 동작하는 Turbo Product code 복호기를 제안한다. 모의 실험을 한 결과 기존의 방식에 비해 복호 지연이 줄어들고 성능면에서 직렬 방식과 거의 비슷한 성능이 나타난다. Recently, there has been intensive focus on Turbo Product Codes(TPCs) which have low decoding complexity and achieve near-optimum performances at high code-rate. This paper present a parallel algorithm of turbo product codes enable simultaneous decoding of row and column. The row and column decoders operate in parallel and update each other after row and column has been decoded. simulation results show that the performance of proposed parallel turbo code is almost the same as that conventional scheme for several turbo product codes.

Improve the BER Performance of Turbo Codes with Large Size Based on BER Distributions

Shao Xia,Zhang Weidang 보안공학연구지원센터 2015 International Journal of Future Generation Communi Vol.8 No.4

A method for bitwise energy optimization of turbo codes with large size is developed. Unlike earlier methods, which relied on searching for minimum-weight codewords, the proposed method finds the required parameters using two bit error rate (BER) distributions obtained via simulation. Therefore, this method can be used not only for the codes with small codeword length, but also for the codes with large codeword length. Simulation results show BER improvements for turbo codes. Though the method is applied to turbo codes in this letter for concreteness, it can also be used for other kinds of error control codes because it does not rely on the code’s structure.