高维调制作为一种新型调制格式,很好地解决了谱效率与功率效率之间的矛盾。但晶格编解码时间复杂度高带来的传输延迟,严重影响了高维调制技术在高速大容量光通信系统中的应用。针对此问题,笔者提出一种基于树结构的低复杂度高维晶格编...高维调制作为一种新型调制格式,很好地解决了谱效率与功率效率之间的矛盾。但晶格编解码时间复杂度高带来的传输延迟,严重影响了高维调制技术在高速大容量光通信系统中的应用。针对此问题,笔者提出一种基于树结构的低复杂度高维晶格编解码方法,由晶格的分布规律构建树结构,通过树结构索引算法完成晶格编解码。该方法可以有效实现高维晶格编解码,当信噪比为16 d B时,误码率可达到3. 1×10^-4,同时可将点数为M的晶格编解码复杂度由O(M)降低为O(log M),并具有通用性。展开更多
In this letter, we present a modified vector-perturbation precoding scheme for the multiple-input multiple-output broadcast channel, where a perturbation vector is chosen to take into account both the instantaneous po...In this letter, we present a modified vector-perturbation precoding scheme for the multiple-input multiple-output broadcast channel, where a perturbation vector is chosen to take into account both the instantaneous power and the instantaneous peak power of the transmitted signal. This perturbation vector is obtained by using the closest point search, with the aid of the lattice-reduction algorithm. Simulation results show that the proposed scheme yields a tradeoff among power efficiency, peak-to-average power ratio reduction, and complexity.展开更多
文摘高维调制作为一种新型调制格式,很好地解决了谱效率与功率效率之间的矛盾。但晶格编解码时间复杂度高带来的传输延迟,严重影响了高维调制技术在高速大容量光通信系统中的应用。针对此问题,笔者提出一种基于树结构的低复杂度高维晶格编解码方法,由晶格的分布规律构建树结构,通过树结构索引算法完成晶格编解码。该方法可以有效实现高维晶格编解码,当信噪比为16 d B时,误码率可达到3. 1×10^-4,同时可将点数为M的晶格编解码复杂度由O(M)降低为O(log M),并具有通用性。
基金the National Natural Science Foundation of China (Nos. 60502046 and U0635003)the National Hi-Tech Research and Development Program (863) of China (No. 2006AA01Z267)
文摘In this letter, we present a modified vector-perturbation precoding scheme for the multiple-input multiple-output broadcast channel, where a perturbation vector is chosen to take into account both the instantaneous power and the instantaneous peak power of the transmitted signal. This perturbation vector is obtained by using the closest point search, with the aid of the lattice-reduction algorithm. Simulation results show that the proposed scheme yields a tradeoff among power efficiency, peak-to-average power ratio reduction, and complexity.
