Terminating the trellis was considered essential to lower the bit error probability in a turbo coded system. When a sliding window algorithm is used, this issue becomes even more important. It is shown that trellis termination can be completely ignored by using an interleaver that takes into account the particular window size of the sliding window algorithm.
References
-
-
1)
-
S.A. Barbulescu ,
S.S. Pietrobon
.
Terminating the trellis of turbo codes in the same state.
Electron. Lett.
,
1 ,
22 -
23
-
2)
-
Barbulescu, S.A.: `Iterative decoding of turbo codes and other concatenated codes'. Dissertation,,', Aug. 1995, PhD, University of South Australia.
-
3)
-
Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon limit error-correcting coding and decoding: turbo-codes', Proc. ICC 1993, May 1993, Geneva, Switzerland, p. 1064–1070.
-
4)
-
C. Berrou ,
M. Jezequel
.
Frame-oriented convolutional codes.
Electron. Lett.
,
15 ,
1362 -
1364
-
5)
-
Divsalar, D., Pollara, F.: `Turbo codes for deep space communications', 42–120, TDA Progress Report, Feb. 1995, p. 29–39.
-
6)
-
Benedetto, S., Montorsi, G., Divsalar, D., Pollara, F.: `Soft-output decoding algorithms in iterative decoding of turbo codes', 42–124, TDA Progress Report , Feb. 1996, p. 63–87.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20010889
Related content
content/journals/10.1049/el_20010889
pub_keyword,iet_inspecKeyword,pub_concept
6
6