首页 | 本学科首页   官方微博 | 高级检索  
     

一种适合于衰落信道的BCM码的集分割映射方法
引用本文:骆亚娟,张伟,鞠德航.一种适合于衰落信道的BCM码的集分割映射方法[J].电子与信息学报,2001,23(3):241-247.
作者姓名:骆亚娟  张伟  鞠德航
作者单位:1. 西安电子科技大学通信工程学院
2. 航天工业总公司五○四研究所
摘    要:在瑞利衰落信道中,对于一个分组调制(Block Coded Modulation)码的构造通常是通过将具有尽可能大最小乘积距离和汉明距离的成分码与Ungerboeck的集分割映射相结合来实现的,但这种集分割映射方法使得构造的BCM码的路径复杂度大大增加,造成了系统性能的下降。文章给出了一种新的集分割映射方法。仿真结果表明,采用这种方法构造出的BCM码在瑞利衰落信道中的性能较前者有很大的改善。

关 键 词:BCM    欧氏距离    路径复杂度    集分割
收稿时间:1999-2-11
修稿时间:1999年2月11日

A Method of Set Partitioning for BCM Codes on Fading Channels
Luo Yajuan,Zhang Wei,Ju Dehang.A Method of Set Partitioning for BCM Codes on Fading Channels[J].Journal of Electronics & Information Technology,2001,23(3):241-247.
Authors:Luo Yajuan  Zhang Wei  Ju Dehang
Affiliation:Xidian University Xi' an 710071 China
Abstract:Construction of a BCM code on the Rayleigh-fading channel can be realized by combining component codes, whose minimum product distance and Hamming distance are as large as possible, with set partitioning method proposed by Ungerboeck. However, using this mapping method, the complexity of a BCM code constructed is greatly increased, which makes a degradation of the whole performance. In the paper, a new set partitioning method is proposed. Simulation result shows that BCM codes constructed by this mapping method have a better performance than those constructed by using Ungerboeck set partitioning mapping.
Keywords:BCM  Euclidean distance  Path complexity  Set partitioning
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号