检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071
出 处:《西安电子科技大学学报》2008年第2期206-209,222,共5页Journal of Xidian University
基 金:国家自然科学基金资助(60572149)
摘 要:提出了一种适用于低码率应用环境的低复杂度非相干正交调制解调方案.信息比特首先经过一个Zigzag码线性编码器,然后将满足奇偶校验关系的编码比特映射为一个PPM符号发送出去.再根据PPM的软输出解调和正交Hadamard码译码之间的等价关系,就可以在接收端将解调和译码看作一个整体处理,这样不但避免了解调和译码之间的迭代运算,而且可以应用快速Hadamard变换(FHT)和基于FHT的后验概率译码(APP-FHT)来降低译码复杂度.还应用联合设计的线性交织器进一步改善本方案中存在的错误平层问题.仿真结果表明,本方案在降低复杂度的同时具有和其他方案可比的性能.A low-complexity orthogonal modulation scheme with non-coherent detection is presented, which is suitable to the low-rate region. Information bits are first encoded by a Zigzag encoder and then the coded bits satisfying a single parity check constraint are mapped into a PPM symbol. According to the equivalence between soft-out demodulation and decoding of orthogonal Hadamard codes, demodulation and decoding can be considered as a whole at the receiver side, so not only can the iterative operations between decoding and demodulation be avoided, but also the fast Hadamard transform(FHT) and the socalled a posteriori probability fast Hadamard transform(APP-FHT) algorithm can be adopted to further decrease decoding complexity. Furthermore, linear interleavers with a joint design are used to improve the error floor problem in our scheme. Simulation results show that our scheme can lead to performance comparable to that of other non-coherent orthogonal modulation schemes.
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.68