직렬연접 길쌈부호의 새로운 연접방법

A New Concatenation Scheme of Serial Concatenated Convolutional Codes

  • 배상재 (경북대학교 전자전기공학부) ;
  • 주언경 (경북대학교 전자전기공학부)
  • Bae, Sang-Jae (School of Electronic & Electrical Engineering, Kyungpook National University) ;
  • Ju, Eon-Gyeong (School of Electronic & Electrical Engineering, Kyungpook National University)
  • 발행 : 2002.03.01

초록

본 논문에서는 직렬연접 길쌈부호의 새로운 연접방법을 제시하고 그 성능을 분석하였다. 제시된 직렬연접 길쌈부호에서는 외부부호의 정보비트와 패러티비트가 각각 인터리버와 역인터리버를 거쳐서 내부부호로 입력된다. 따라서 인터리버와 역인터리버의 크기는 입력프레임의 크기와 동일하다. 제안된 직렬연접 길쌈부호에서는 인터리버의 크기가 Benedetto 구조에 비하여 반으로 줄어들기 때문에 반복복호시 매번 거쳐야 하는 인터리버의 지연시간을 줄일 수 있다. 또한 제시된 구조에서는 다중화기와 역다중화기가 사용되지 않기 때문에 복호기의 복잡도가 Benedetto 구조보다 상대적으로 더 간단하다. 모의실험 결과 인터리버의 크기가 동일한 경우 제시된 직렬연접 길쌈부호의 성능이 Benedetto 구조의 성능보다 더 우수하였다. 또한 Eb/No가 증가할수록 제시된 구조와 Benedetto 구조의 성능차이가 더욱 증가하였다. 입력프레임의 크기가 동일한 경우에는 제시된 직렬연접 길쌈부호의 성능이 인터리버의 크기가 반으로 줄어듦에도 불구하고 Benedetto 구조와 거의 동일한 성능을 나타내었다.

In this paper, a new concatenation scheme of serial concatenated convolutional codes is proposed and the performance analyzed. In the proposed scheme, each of information and parity bits of outer code is entered into inner code through interleaver and deinterleaver. Therefore, the interleaver size is same as the length of input frame. Since the interleaver size of proposed type is reduced to half of the conventional Benedetto type, the interleaver delay time required for iterative decoding is reduced. In addition the multiplexer and demultiplexer are not used in the decoder of the proposed type, the complexity of decoder can be also reduced. As results of simulation, the performance of proposed type shows the better error performance as compared to that of the conventional Benedetto type in case of the same interleaver size. And it can be observed that the difference of BER performance is increased with the increase of Eb/No. In case of the same length of input frame, the proposed type shows almost same performance with Benedetto type despite that the interleaver size is reduced by half.

키워드

참고문헌

  1. C. Berrou and A. Glavieux, 'Near optimum error correcting coding and decoding:Turbo-codes,' IEEE Trans. Commun., Vol. 44, No. 10, pp. 1261-1271, Oct. 1996 https://doi.org/10.1109/26.539767
  2. L. R. BahI, J. Cocke, F. Jelinek, and J. Raviv, 'Optimal decoding of linear code for minimizing symbol error rate,' IEEE Trans. Inform. Theory, Vol. 20, No. 2, pp. 284-287, Mar. 1974 https://doi.org/10.1109/TIT.1974.1055186
  3. S. S. Pietrobon and A. S. Barbulescu, 'A simplification of the modified Bahl decoding algorithm for systematic convolutional codes,' Proc. IEEE ISITA'94, Sydney, Australia, pp. 1073-1077, Nov. 1994
  4. P. Robertson, E. Villerun, and P. Hoeher, 'A comparison of optimal and sub-optimal MAP decoding algorithms operating in log domain,' Proc. IEEE ICC'95, Seattle, Washington, Vol. 2, pp. 1009-1013, June 1995 https://doi.org/10.1109/ICC.1995.524253
  5. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes,' Proc. IEEE ICC'96, Dallas,Texas, Vol. 2, pp. 112-117, June 1996 https://doi.org/10.1109/ICC.1996.540255
  6. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'Soft-output decoding algorithms in iterative decoding of turbo codes,' The TDA Progress report 42-124, Jet Propulsion Laboratory, Pasadena, California, pp. 63-87, Feb. 15, 1996
  7. J. Hagenauer, 'The turbo principle: tutorial introduction and state of the art,' Proc. Int. Symp. on Turbo Codes and Related Topics, Brest, France, pp. 1-11, Sep. 1997
  8. S. Benedetto and G. Montorsi, 'Unveiling turbo codes: Some results on parallel concatenated coding schemes,' IEEE Trans. Inform. Theory, Vol. 42, No. 2, pp. 409-428, Mar. 1996 https://doi.org/10.1109/18.485713
  9. D. Divsalar and F. Pollar, 'On the design of Turbo codes,' JPL TDA Progress Report, 42-123, pp. 99-121, Nov. 1995
  10. S. Benedetto, G. Montorsi, D. Divsalar, and F. Pollara, 'Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding,' JPL TDA Progress Report, Vol. 42, pp. 1-26, Aug. 1996
  11. S. Benedetto and G. Montorsi, 'Serial concatenation of block and convolutional codes,' Electron. Lett., Vol. 32, pp 887-888, May 1996 https://doi.org/10.1049/el:19960621
  12. A. Ambroze, G. Wade, and M. Tomlinson, 'Iterative MAP decoding for serial concatenated convolutional codes,' Proc. IEEE Commun., Vol. 145, No. 2, pp. 53-59, Apr. 1998 https://doi.org/10.1049/ip-com:19981876