On the Union Bounds of Self-Concatenated Convolutional Codes
暂无分享,去创建一个
[1] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[2] Sergio Benedetto,et al. Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.
[3] Dariush Divsalar,et al. Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.
[4] Lajos Hanzo,et al. Near-Capacity Iteratively Decoded Binary Self-Concatenated Code Design Using EXIT Charts , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[5] Hans-Andrea Loeliger. New turbo-like codes , 1997, Proceedings of IEEE International Symposium on Information Theory.
[6] Stephan ten Brink,et al. Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..
[7] Branka Vucetic,et al. Optimization of space-time block codes based on multidimensional super-set partitioning , 2005, IEEE Signal Processing Letters.
[8] Dariush Divsalar,et al. Self-concatenated trellis coded modulation with self-iterative decoding , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).
[9] Dariush Divsalar,et al. Trellis Coded Modulation for 4800-9600 bits/s Transmission Over a Fading Mobile Satellite Channel , 1987, IEEE J. Sel. Areas Commun..
[10] Chintha Tellambura,et al. Receive Antenna Selection Based on Union-Bound Minimization Using Convex Optimization , 2007, IEEE Signal Processing Letters.
[11] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .