Spatially Coupled Turbo-Like Codes: A New Trade-Off Between Waterfall and Error Floor
暂无分享,去创建一个
Michael Lentmaier | Alexandre Graell i Amat | Saeedeh Moloudi | M. Lentmaier | A. Graell i Amat | Saeedeh Moloudi
[1] Michael Lentmaier,et al. Spatially Coupled Hybrid Concatenated Codes , 2017 .
[2] Rüdiger L. Urbanke,et al. Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.
[3] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[4] Michael Lentmaier,et al. Thresholds of Braided Convolutional Codes on the AWGN Channel , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[5] Sergio Benedetto,et al. Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.
[6] Lara Dolecek,et al. Absorbing set characterization of array-based spatially coupled LDPC codes , 2014, 2014 IEEE International Symposium on Information Theory.
[7] Dariush Divsalar,et al. Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.
[8] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[9] Irina E. Bocharova,et al. Average spectra for ensembles of LDPC codes and applications , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[10] Michael Lentmaier,et al. Braided Convolutional Codes: A New Class of Turbo-Like Codes , 2010, IEEE Transactions on Information Theory.
[11] Ali Emre Pusane,et al. Pseudocodeword Performance Analysis for LDPC Convolutional Codes , 2006, IEEE Transactions on Information Theory.
[12] Henry D. Pfister,et al. A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions , 2013, IEEE Transactions on Information Theory.
[13] William E. Ryan,et al. Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes , 2011, IEEE Transactions on Information Theory.
[14] Michael Lentmaier,et al. Spatially coupled turbo codes , 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).
[15] 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.
[16] Baoming Bai,et al. Braided Convolutional Codes With Sliding Window Decoding , 2017, IEEE Transactions on Communications.
[17] Michael Lentmaier,et al. Randomly Punctured LDPC Codes , 2016, IEEE Journal on Selected Areas in Communications.
[18] Henry D. Pfister,et al. A simple proof of threshold saturation for coupled scalar recursions , 2012, 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).
[19] Michael Lentmaier,et al. Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.
[20] Alexandre Graell i Amat,et al. Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes , 2011, IEEE Transactions on Communications.
[21] Michael Lentmaier,et al. Finite length weight enumerator analysis of braided convolutional codes , 2016, 2016 International Symposium on Information Theory and Its Applications (ISITA).
[22] Daniel J. Costello,et al. Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.
[23] David G. M. Mitchell,et al. Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes , 2013, IEEE Transactions on Information Theory.
[24] Alexandre Graell i Amat,et al. Performance Analysis of 3-D Turbo Codes , 2011, IEEE Transactions on Information Theory.
[25] Michael Lentmaier,et al. Spatially Coupled Turbo-Like Codes , 2016, IEEE Transactions on Information Theory.
[26] Henry D. Pfister,et al. A simple proof of threshold saturation for coupled vector recursions , 2012, 2012 IEEE Information Theory Workshop.
[27] F. Vatta,et al. Hybrid concatenated codes with asymptotically good distance growth , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.
[28] Alexandre Graell i Amat,et al. Design and performance analysis of a new class of rate compatible serially concatenated convolutional codes , 2009, IEEE Transactions on Communications.
[29] K.Sh. Zigangirov,et al. Periodic time-varying convolutional codes with low-density parity-check matrices , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[30] Kamil Sh. Zigangirov,et al. Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.
[31] William E. Ryan,et al. Ensemble Enumerators for Protograph-Based Generalized LDPC Codes , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.