The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

An Algorithm for Computing the Weight Enumerating Function of Concatenated Convolutional Codes

연쇄 컨볼루션 부호의 가중치 열거함수 계산 알고리듬

  • 강성진 (한국전자통신연구원 무선방송기술연구소 방송기술연구부 정회원) ;
  • 권성락 (LG정보통신 중앙연구소 이동통신연구원 정회원) ;
  • 이영조 (LG정보통신 중앙연구소 이동통신연구원 정회원) ;
  • 강창언 (연세대학교 전자공학과 정회원)
  • Published : 1999.07.01
Download PDF
⟨ Previous Next ⟩

Abstract

The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.

병렬 연쇄 컨볼루션 부호 및 직렬 연쇄 컨볼루션 부호의 ML 연판정 복호에 대한 비트오율확률의 상한치는 가중치 열거함수(Weight Enumerating Function; WEF)를 통해서 구할 수 있으며, 이 상한치는 반복 택 알고리듬과 양방향 탐색 알고리듬을 혼합한 새로운 오류사건 탐색 알고복호를 통해 얻을 수 있는 비트오류확률의 하한치가 된다. 본 논문에서는 스리듬을 제안하고, 얻어진 오류사건을 이용하여 WEF를 계산하는 알고리듬을 제안한다. 컴퓨터 시뮬레이션을 통해, 반복복호를 통해 얻을 수 있는 비트오류확률의 하한치가 됨을 확인하였다.

Keywords

References

  1. Concatenated codes G. D. Forney. Jr.
  2. Proceeding of ICC '93 Near Shannon limit error-correctinf coding and decoding: Turbo codes C. Berrou;A. Glavieux;P. Thitimajshima
  3. IEEE Trans. on Comm. v.42 no.2 Unveiling Turbo Codes ; Some Results on Parallel Concatenated Coding Schemes S. Benedetto;G. Montorsi
  4. TDA Progress Report 42-126 Serial Concatenation of Interleaved Codes : Performance Analysis, Design, and Iterative Decoding S. Benedetto(et al.)
  5. IEEE JSAC v.7 no.6 An algorithm for computing the distance spectrum of trellis codes M. Rouanne;D. J. Constello, Jr.
  6. IEEE Trans. on Info. Theory v.35 no.6 A fast alogrithm for computing distance spectrum of convolutional codes M. Codervall;R. Johannesson
  7. IEEE Trans. on Info. Theory Optimal decoding of linear codes for minimizing symbol error rate L. R. Bahl(et al.)
  8. Proceedings of the IEEE v.82 no.6 Performance evaluation of trellis-coded modulation schemes S. Benedetto(et al.)
  9. TDA Progress Report 42-127 A Soft-Input Soft-Output Maximum A Posteriori(MAP) Module to Decode Parallel and Serial Concatenated Codes S. Benedetto(et al.)
  10. TDA Progress Report 42-122 Transfer Function Bounds on the Performance of Turbo Codes D. Divsalar;S. Dolinar;F. Pollara;R. J. McEliece