Efficient Computation of EXIT Functions for Nonbinary Iterative Decoding
暂无分享,去创建一个
[1] A. Grant,et al. Convergence of non-binary iterative decoding , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[2] Patrick Robertson,et al. Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes , 1998, IEEE J. Sel. Areas Commun..
[3] Alexander M. Haimovich,et al. EXIT charts for turbo trellis-coded modulation , 2004, IEEE Communications Letters.
[4] S. Brink. Rate one-half code for approaching the Shannon limit by 0.1 dB , 2000 .
[5] Stephan ten Brink,et al. Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.
[6] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[7] Gottfried Ungerboeck,et al. Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.
[8] David Burshtein,et al. Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels , 2005, IEEE Transactions on Information Theory.
[9] Stephan ten Brink,et al. Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..