A low-complexity superorthogonal turbo-code for CDMA applications
暂无分享,去创建一个
[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] Peter Jung. Novel low complexity decoder for turbo-codes , 1995 .
[3] Patrick Robertson,et al. Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.
[4] A. Viterbi. CDMA: Principles of Spread Spectrum Communication , 1995 .
[5] Sergio Benedetto,et al. Performance evaluation of parallel concatenated codes , 1995, Proceedings IEEE International Conference on Communications ICC '95.
[6] Sergio Benedetto,et al. Design guidelines of parallel concatenated convolutional codes , 1995, Proceedings of GLOBECOM '95.
[7] Rémi Sfez,et al. A weighted-output variant of the Viterbi algorithm for concatenated schemes using a convolutional inner code , 1990, EUROCODE.
[8] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[9] K. Pehkonen,et al. A superorthogonal turbo-code for CDMA applications , 1996, Proceedings of ISSSTA'95 International Symposium on Spread Spectrum Techniques and Applications.
[10] Peter Jung,et al. Dependence of the error performance of turbo-codes on the interleaver structure in short frame transmission systems , 1994 .
[11] Dariush Divsalar,et al. Turbo codes for PCS applications , 1995, Proceedings IEEE International Conference on Communications ICC '95.