Turbo码并行无冲突交织器设计  

Design on Collision-free Interleaver of Turbo Code

作　　者：丘选锋[1] 赵宏宇[1] 

机构地区：[1]西南交通大学信息编码与传输省重点实验室,四川成都610031

出　　处：《通信技术》2013年第8期5-7,共3页Communications Technology

基　　金：国家自然科学基金资助课题(批准号:61071106)

摘　　要：并行译码方案能够显著地降低译码延迟,适合于高比特速率传输的通信系统。然而,在turbo码分块并行译码方案中,交织器的随机置换可能引起存储器地址争用问题。因此在分块并行译码方案中要解决的一个关键问题就是设计出能够避免存储器地址争用的并行交织器。这篇文章提出一种新的产生并行无冲突S随机交织器的算法,和现有的无冲突行列S随机交织器相比较,新算法产生的交织器具有较大的延展因子S和平均码字自由距离。As for the high data-rate transmission,the parallel decoding method can greatly reduce the decoding latency.However,in the parallel decoding method,the random permutation of interleaver may probably result in memory collision problem.A challenge to the design of parallel turbo decoder is the design of collision-free interleavers with the purpose to avoid the memory access collision.This paper proposes a novel algorithm for generating collision-free S-random interleavers of turbo codes.The collision-free S-random interleavers generated by the proposed algorithm could achieve larger spreading factor S and better average code distance than the collision-free row column S-random interleavers by existing algorithm.

关 键 词：TURBO码 交织器 并行无冲突 

分 类 号：TN911.22[电子电信—通信与信息系统]