DOI QR코드

DOI QR Code

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

A Low-Complexity Turbo coded BICM-ID System

  • Kang, Donghoon (Department of Information Communications Engineering, Chungnam National University) ;
  • Lee, Yongwook (Department of Information Communications Engineering, Chungnam National University) ;
  • Oh, Wangrok (Department of Information Communications Engineering, Chungnam National University)
  • 투고 : 2013.03.21
  • 발행 : 2013.08.15

초록

본 논문에서는 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.

키워드

참고문헌

  1. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding : turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996. https://doi.org/10.1109/26.539767
  2. G. Ungerboeck, "Channel coding with multileve /phase signals," IEEE Trans. Inform. Theory, vol. 28, pp. 55-67, Jan. 1982. https://doi.org/10.1109/TIT.1982.1056454
  3. E. Zehavi, "8-PSK trellis codes for a Rayleigh channel," IEEE Trans. Commun., vol. 40, pp. 873-884, May 1992. https://doi.org/10.1109/26.141453
  4. S. Le Goff, A. Glavieux, and C. Berrou, "Turbo-codes and high spectral efficiency modulation," Proc. ICC '94, pp. 645-649, 1994.
  5. I. Abramovici and S. Shamai, "On turbo encoded BICM," Ann. Telecomm., vol. 54, pp. 225-234, Mar. 1999.
  6. S. A. Barbulescu and W. Farrel, "Bandwidth efficient turbo coding for high speed mobile satellite communications," International Symposium on Turbo Codes and Related Topics,(Brest Fr.), pp. 119-126, 1997.
  7. C. A. Nour, C. Douillard, "Performance improvement using turbo coded BICM-ID with 16-QAM over Gaussian and flat fading Rayleigh channels," IST Mobile and Wireless Communications Summit, Dresden, Germany, pp. 1-4, 2005.
  8. S. Schwandter, Z. Naja, P. Duhamel and G. Matz, "Complexity reduction in BICM-ID systems through selective log-likelihood ratio updates," in Proc. IEEE Int. Workshop on Signal Process. Advances in Wireless Commun., (SPAWC), June 2010.
  9. J. Tan and G. L. Stuber, "Analysis and Design of Symbol Mappers for Iteratively Decoded BICM," IEEE Trans. Wireless Commun., vol. 4, no. 2, pp. 662-672, Mar. 2005. https://doi.org/10.1109/TWC.2004.842966
  10. I. Abramovici and S. Shamai, "On turbo encoded BICM," Ann. Telecommun., vol. 54, pp. 225-234, Mar. 1999.