为了解决构造任意长度、无小停止集且无短环QC-LDPC码的设计问题,研究了基于Tanner图的停止集、围长和最小码重三者之间的关系,提出了QC-LDPC码无短停止距离且无短环的充要条件.在此基础上,为了进一步降低编码复杂度并保留结构化特性,提出了一种具有线性编码复杂度的基于后向迭代的QC-LDPC码.仿真结果表明:所构造的QC-LDPC码的纠错性能与IEEE 802.11n中QC-LDPC码相近,与IEEE 802.16e中QC-LDPC码相比,在误码率为10^(-6)时,可获得0.15 d B的性能增益;此外,该码字只需存储移位因子和单位子矩阵的阶数,所占硬件存储空间明显小于另外2种QC-LDPC码.
传统协作通信常采用译码转发(DF)协议。而该协议在源-中继节点链路通信质量较差情况下,易出现误码传播现象。为了改进该问题,该文提出可应用于编码协作(CC)机制的Raptor编码协作方案,其可在高信噪比下获得较大编码增益和满分集增益。它在源节点和中继节点使用不同Raptor编码,使中继节点新编码码字为源节点码字的部分校验信息,使接收端所得码字独立不等。因此,目的节点在分别接收来自不同独立链路消息后,可根据码字间固有关系联合译码,以获得额外发送空间分集增益。为了降低复杂度,Raptor码的预编码还可采用整数序列构造的准循环低密度奇偶校验(QC-LDPC)码,从而获得较低线性预编码复杂度。仿真表明:在误比特率(BER)为10-4时,所提Raptor编码协作方案较传统DF协议Raptor方案,Raptor与分布式空时分组码(DSTBC)结合方案,分别有2 d B和1 dB增益。此外,当中断概率为10^(-2)时,其性能较CC,DF协作方案提高了约2 dB和7 d B。
The downlink energy-efficient transmission schedule with non-ideal circuit power over Wreless networks involving a single transmitter and multiple receivers was investigated. According to the special structure of the ...
详细信息
The downlink energy-efficient transmission schedule with non-ideal circuit power over Wreless networks involving a single transmitter and multiple receivers was investigated. According to the special structure of the problem, a novel algorithm called OOSCPMR （the optimal offine scheduling with non-ideal circuit power for multi-receivers） is proposed, and the optimal offine solutions to optimize the energy- efficient transmission policy are found. The packets to be transmitted can be divided into two types where one type of packet is determined to be transmitted using the enrgy- efficient tansmission time, and the other type of packet is determined by the ID moveright algorithm. Finally, an energy-efficient online schedule is developed based on te proposed OOSCPMR algoriAm. Simulation results show that the optima offline transmission schedule provides te lower bound performance for the online tansmission schedule. The proposed optimal offline and online policy is more energy efficient than the existing schemes tat assume ideal circuit power.
暂无评论