Reduced Complexity Techniques for Iterative Decoding
作者： Dhammika Bokolamulla
DOI:
关键词:
摘要:
chalmers.se参考文章(62)
Niclas Wiberg, Codes and Decoding on General Graphs Ph. D. dissertation, Linkoping Univ., Sweden. ,(1996)
D. Divsalar, S. Dolinar, Weight distributions for turbo codes using random and nonrandom permutations Telecommunications and Data Acquisition Progress Report. ,vol. 122, pp. 56- 65 ,(1995)
Andreas Cedergren, Maximum likelihood sequence detection by using the SA(B,C) algorithm : state partition methods Chalmers University of Technology. ,(2000)
Tor Aulin, Carl-Erik Sundberg, John B. Anderson, Digital Phase Modulation ,(1986)
Pär Moqvist, Serially concatenated systems : an iterative coding approach with application to continuous phase modulation Chalmers University of Technology. ,(1999)
Torbjörn Larsson, A state-space partitioning approach to trellis decoding Chalmers University of Technology. ,(1991)
F. Brannstrom, T.M. Aulin, L.K. Rasmussen, A.J. Grant, Convergence analysis of iterative detectors for narrow-band multiple access global communications conference. ,vol. 2, pp. 1373- 1377 ,(2002) , 10.1109/GLOCOM.2002.1188423
Peter Hoeher, Ingmar Land, Ulrich Sorger, None, Log-likelihood values and Monte Carlo simulation - some fundamental results Proc. Int. Symp. on Turbo Codes & Rel. Topics, Sept. 2000. ,(2000)
P. Thiennviboon, G. Ferrari, K.M. Chugg, Generalized trellis-based reduced-state soft-input/soft-output algorithms international conference on communications. ,vol. 3, pp. 1667- 1671 ,(2002) , 10.1109/ICC.2002.997132
L. R. Bahl, Optimal decoding of linear codes for minimizing symbol error rate IEEE Transactions on Information Theory. ,vol. 20, pp. 284- 287 ,(1974)