基于树结构的高维晶格编解码算法

Lattice Coding and Decoding Algorithm Based on Tree Structure

高维调制作为一种新型调制格式,很好地解决了谱效率与功率效率之间的矛盾。但晶格编解码时间复杂度高带来的传输延迟,严重影响了高维调制技术在高速大容量光通信系统中的应用。针对此问题,笔者提出一种基于树结构的低复杂度高维晶格编解码方法,由晶格的分布规律构建树结构,通过树结构索引算法完成晶格编解码。该方法可以有效实现高维晶格编解码,当信噪比为16 d B时,误码率可达到3. 1×10^-4,同时可将点数为M的晶格编解码复杂度由O(M)降低为O(log M),并具有通用性。

As a new modulation method, high-dimensional modulation solves the contradiction between spectral efficiency and power efficiency. However, the high complexity of lattice coding and decoding result in transmission delay, which seriously affects the application of high-dimensional modulation technology in highspeed and high-capacity optical communication systems. To solve this problem, a low complexity high dimensional lattice coding and decoding method based on tree structure is proposed. The tree structure is constructed according to the lattice distribution law, and the lattice coding and decoding is finished by the tree structure index algorithm. This method can effectively realize high-dimensional lattice coding and decoding. When the SNR is 16 dB, the bit error rate can reach 3. 1×10^-4 , and the complexity of lattice coding and decoding with points of M can be reduced from O(M) to O (log M), and is universal.