光学学报, 2016, 36 (8): 0806008, 网络出版: 2016-08-18  

低复杂度的光空时网格编码

Low-Complexity Optical Space-Time Trellis Code
作者单位
1 兰州理工大学计算机与通信学院, 甘肃 兰州 730050
2 中国移动通信集团甘肃有限公司省网络管理中心, 甘肃 兰州 730070
摘要
根据光通信的特点,提出一种基于脉冲位置调制(PPM)的低复杂度光空时网格码。该方案在发射端利用延迟分集思想,建立了信号在时间和空间上的关联性。在接收端采用反馈干扰抵消算法(FICA),并对消除干扰后的信号进行最大似然判决来完成译码。该方案以牺牲发射分集的性能来换取译码复杂度的降低,从而降低了对系统计算能力的要求。以天线数为2和3为例,分析了该算法与Viterbi译码算法的计算复杂度。仿真结果表明,当分集增益相同时,相对于采用Viterbi译码算法的系统,所提方案的译码复杂度分别降低了93.75%和95.84%,而其误码性能的恶化仅为3 dB和4.77 dB。
Abstract
According to the characteristics of optical communication, a low-complexity optical space time trellis code based on pulse position modulation(PPM) is proposed. The scheme is based on the idea of delay diversity of the transmitter, and establishes the correlation of signals in time and space. The feedback interface cancellation algorithm (FICA) is used at the receiving end, and the maximum likelihood decision is used to decode the eliminated interference signal. The proposed scheme reduces the complexity of decoding by sacrificing the performance of transmitting diversity, which reduces the computational requirement of the system. The computational complexities of the algorithm and the Viterbi decoding algorithm are analyzed with the antenna numbers of 2 and 3. The simulation results show that when diversity gain is the same,the decoding complexities of the proposed scheme are reduced by 93.75% and 95.84% respectively, compared with the Viterbi decoding algorithm, and the deteriorations of the bit error rate performance are only 3 dB and 4.77 dB.

王惠琴, 肖博, 贾非, 曹明华, 孙剑锋. 低复杂度的光空时网格编码[J]. 光学学报, 2016, 36(8): 0806008. Wang Huiqin, Xiao Bo, Jia Fei, Cao Minghua, Sun Jianfeng. Low-Complexity Optical Space-Time Trellis Code[J]. Acta Optica Sinica, 2016, 36(8): 0806008.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!