On Gallager-type bounds for the mismatched decoding regime with applications to turbo codes
暂无分享,去创建一个
[1] Robert G. Gallager,et al. A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.
[2] R. Gallager. Information Theory and Reliable Communication , 1968 .
[3] Chintha Tellambura,et al. Generation of bivariate Rayleigh and Nakagami-m fading envelopes , 2000, IEEE Communications Letters.
[4] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[5] S. Shamai,et al. Information rates and error exponents of compound channels with application to antipodal signaling in a fading environment , 1993 .
[6] Shlomo Shamai,et al. On information rates for mismatched decoders , 1994, IEEE Trans. Inf. Theory.
[7] D. Divsalar. A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .
[8] Emre Telatar,et al. Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit , 2000, IEEE Trans. Inf. Theory.
[9] Masoud Salehi,et al. Turbo codes and turbo coded modulation systems: analysis and performance bounds , 1998 .
[10] Shlomo Shamai,et al. Improved upper bounds on the ML performance of turbo codes for interleaved Rician fading channels, with comparison to iterative decoding , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.
[11] T. Duman,et al. New performance bounds for turbo codes , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.