Parallel turbo coding interleavers: avoiding collisions in accesses to storage elements
暂无分享,去创建一个
High-speed, low latency convolutional turbo codes require a parallel decoder architecture. To maximise the gain in speed, the interleaver also should have a parallel structure. Here, a class of optimum parallel interleavers regarding the access to storage elements is presented. They combine regularity (easy implementation) with no latency in data transfer between the decoder module and intrinsic/extrinsic values memories, and show excellent BER performance.
[1] Dariush Divsalar,et al. Performance analysis of turbo codes , 1995, Proceedings of MILCOM '95.
[2] S. Dolinar,et al. Weight distributions for turbo codes using random and nonrandom permutations , 1995 .
[3] 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.
[4] Francky Catthoor,et al. Memory optimization of MAP turbo decoder algorithms , 2001, IEEE Trans. Very Large Scale Integr. Syst..