检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学通信工程学院,西安710071 [2]航天工业总公司五○四研究所,西安710000
出 处:《电子与信息学报》2001年第3期241-247,共7页Journal of Electronics & Information Technology
摘 要:在瑞利衰落信道中,对于一个分组调制(Block Coded Modulation)码的构造通常是通过将具有尽可能大最小乘积距离和汉明距离的成分码与Ungerboeck的集分割映射相结合来实现的,但这种集分割映射方法使得构造的BCM码的路径复杂度大大增加,造成了系统性能的下降。文章给出了一种新的集分割映射方法。仿真结果表明,采用这种方法构造出的BCM码在瑞利衰落信道中的性能较前者有很大的改善。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.
分 类 号:TN911.21[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.205