Coded modulation in the block-fading channel: coding theorems and code construction
暂无分享,去创建一个
[1] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[2] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[3] Giuseppe Caire,et al. Optimum power control over fading channels , 1999, IEEE Trans. Inf. Theory.
[4] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[5] A. Viterbi. CDMA: Principles of Spread Spectrum Communication , 1995 .
[6] Shlomo Shamai,et al. On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes , 2001, IEEE Trans. Inf. Theory.
[7] Dariush Divsalar,et al. Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.
[8] Raymond Knopp,et al. On coding for block fading channels , 2000, IEEE Trans. Inf. Theory.
[9] Hui Jin,et al. Analysis and design of turbo-like codes , 2001 .
[10] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[11] Giuseppe Caire,et al. Error probability analysis of bit-interleaved coded modulation , 2006, IEEE Transactions on Information Theory.
[12] Stephan ten Brink,et al. Designing Iterative Decoding Schemes with the Extrinsic Information Transfer Chart , 2001 .
[13] D. Divsalar. A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .
[14] Sergio Verdú,et al. A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.
[15] Shlomo Shamai,et al. Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum , 2000, IEEE Trans. Inf. Theory.
[16] Albert Guillen i Fabregas,et al. Concatenated codes for block-fading channels , 2004 .
[17] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .
[18] Shlomo Shamai,et al. Information theoretic considerations for cellular mobile radio , 1994 .
[19] Sergio Benedetto,et al. Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.
[20] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[21] Dariush Divsalar,et al. Upper bounds to error probabilities of coded systems beyond the cutoff rate , 2003, IEEE Trans. Commun..
[22] Albert Guillen i Fabregas,et al. Turbo-like codes over the block fading channel: code design and construction , 2003 .
[23] V.W.S. Chan,et al. Principles of Digital Communication and Coding , 1979 .
[24] Harry Leib,et al. Evaluating the performance of convolutional codes over block fading channels , 1999, IEEE Trans. Inf. Theory.
[25] Shlomo Shamai,et al. Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.
[26] Shlomo Shamai,et al. Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels , 2003, IEEE Trans. Commun..
[27] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[28] Axthonv G. Oettinger,et al. IEEE Transactions on Information Theory , 1998 .
[29] Giuseppe Caire,et al. Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.
[30] Marco Chiani,et al. Further results on convolutional code search for block-fading channels , 2004, IEEE Transactions on Information Theory.
[31] Emre Telatar,et al. On the Asymptotic Input-Output Weight Distributions and Thresholds of Convolutional and Turbo-Like Codes , 2006 .
[32] Raymond Knopp. Coding and multiple-access over fading channels , 1997 .
[33] R. Durrett. Probability: Theory and Examples , 1993 .
[34] Lizhong Zheng,et al. Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.
[35] J.E. Mazo,et al. Digital communications , 1985, Proceedings of the IEEE.
[36] Giuseppe Caire,et al. On the Performance of Incremental Redundancy Schemes with Turbo Codes , 2002 .
[37] Albert Guillen i Fabregas. Error probability of bit-interleaved coded modulation using the Gaussian approximation , 2004 .
[38] Stephen G. Wilson,et al. Multifrequency trellis coding with low delay for fading channels , 1993, IEEE Trans. Commun..
[39] Byeong Gi Lee,et al. On the Performance Analysis of Space-Time Codes in Quasi-Static Rayleigh-Fading Channels , 2004, IEEE Trans. Inf. Theory.
[40] Harry Leib,et al. Coded Diversity on Block-Fading Channels , 1999, IEEE Trans. Inf. Theory.