基于欧式距离的自适应交织算法  

Adaptive Interleaving Method Based on Euclidean Distance

作　　者：王昊[1] 杨鸿文[1] 

机构地区：[1]北京邮电大学信息与通信工程学院,北京100876

出　　处：《北京邮电大学学报》2010年第4期110-113,共4页Journal of Beijing University of Posts and Telecommunications

摘　　要：针对正交频分复用系统,提出了一种新的自适应交织器算法.该方法基于信道状态信息(CSI),从一组交织器中选出一个较优者来传输当前编码块.所选交织器能使最小欧式距离最大,从而能获得更好的性能.与已有的自适应交织算法相比,所提方法复杂度低,系统开销小,并且性能相近.此外,所提算法基本不存在交织器失步的问题,可以大大降低对CSI反馈的要求.An adaptive interleaving scheme for orthogonal frequency division multiplexing system is proposed. Based on the channel state information,whatever,an interleaver from a pool of candidate interleavers is selected. As the selected one is expected to have larger minimum Euclidean distance at receiver,the scheme can significantly improve the decoding error rate performance. Compared with the adaptive interleaving schemes proposed in literatures,the proposed has no interleaving pattern synchronization problem and requires only a few bits for the signaling.

关 键 词：自适应交织器 正交频分复用 比特交织编码调制 

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