欧氏几何LDPC码的构造与多级编码调制分析.pdfVIP

万方数据 Abstract Designing codes with capacity approaching performance and the low coding complexity is a challenging but meaningful task in modern channel coding fields. Low density parity check (LDPC) code is a class of channel coding scheme which can approach Shannon capacity and has a relatively low encoding and decoding complexity. Therefore, LDPC codes have been widely used in various communication systems. The design of the circles in the LDPC code structure is a crucial factor. The length of the girth, i.e. the shortest ring, and the distribution of the circles have effects on the convergence of the iterative decoding, and resulting in high the error floor. Additionally, the coded modulation technique, which can be effectively encoded and modulated without sacrificing any bandwidth, became one of the key technologies in the future broadband wireless communication systems. Based on the two mentioned transmission technologies, this paper studies the construction of the Euclidean geometry based LDPC codes and the application of the designed codes in multilevel coded modulation. The paper introduces the concept of Euclidean geometric space and some existed LDPC codes construction methods based on Euclidean geometry. In order to reduce the number of six-circle structure in the original Euclidean geometry LDPC codes, A new method to construct Euclidean geometry LDPC codes is proposed by combining of planes and lines Furthermore, the number of