Journal of Jilin University (Information Science Edition) ›› 2019, Vol. 37 ›› Issue (5): 470-475.

Previous Articles     Next Articles

Lattice Coding and Decoding Algorithm Based on Tree Structure

BIE Yutaoa,LI Zhaoxib,LI Jiaoc,ZHANG Yunand,ZHAO Hongweie   

  1. a. Public Computer Education and Research Center; b. College of Telecommunication Engineering; c. Library; d. Education Administration Office; e. College of Computer Science and Technology,Jilin University,Changchun 130012,China
  • Online:2019-09-24 Published:2019-12-23

Abstract: 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.

Key words: tree structure, high-dimensional modulation, lattice coding, lattice decoding

CLC Number: 

  • TN929. 11