检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]杭州电子科技大学通信工程学院,浙江杭州310018
出 处:《电路与系统学报》2012年第2期54-59,共6页Journal of Circuits and Systems
基 金:国家自然科学基金(60972049);浙江省自然科学基金资助课题(Y1100579)
摘 要:本文研究了多接入中继信道(MARC)上全分集LDPC码的实现与性能。首先,分析了MARC模型及其固有分集,然后构造了在MARC上能取得全分集的LDPC码,新构造的码字采用根校验节点把源节点传输与中继节点传输联系起来,从而获得全分集。接着,研究了所构造码字的密度演化过程,在密度演化的基础上,进一步分析了全分集LDPC码校验矩阵的结构,给出了通过提高全分集校验比特的比例,改善全分集LDPC码在MARC上编码增益的方法。仿真结果表明,本文所提算法在MARC信道上不仅能实现全分集,而且能取得较高的编码增益。Cooperative communication is a well known technique to yield transmit diversity in multi-user environment. Multiple Access Relay Channel (MARC) is the most common method to acquire cooperative communication, where two source users share a common relay node in their transmission to the destination. In order to improve the performance of communication system with MARC, a kind of full diversity LDPC on MARC is proposed in this paper. The new proposed LDPC codes connect the source node transmissions with the relay transmissions by root-connection to get extern diversity gain. In addition, the relationship between the structure of full diversity LDPC codes and the coding gain is given, and an algorithm to improve coding gain is brought forward by increasing the proportion of full diversity parity bits in this paper. Simulation results show that the proposed algorithm can not only achieve full diversity, but also get better performance than constructed LDPC codes for MARC at present.
关 键 词:多接入中继信道 中继 全分集 分集增益 编码增益
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200