Random mapping code construction method

Abstract

The invention relates to a random mapping code construction method. The method comprises (1) constructing an N*N random mapping matrix G by multilayer random cycle method or multilayer random arrangement method; (2) coding a group of baseband signals b={bi, i=1, 2, ..., N} according to the random mapping matrix G obtained in step (1) to obtain u; and (3) modulating two adjacent coded character to one IQ character, and transmitting the signal. In comparison with the prior art, the random mapping code construction method provided by the invention is stable in performance and easy for hardware implementation, and can obviate memory access conflict.

Description

technical field [0001] The invention relates to a physical layer coding and modulation method for wireless communication, in particular to a method for constructing random mapping codes. Background technique [0002] The random mapping code is a fast demodulation mechanism for link adaptation at the receiving end. It combines channel coding and modulation, and is divided into a sending end and a receiving end. Random mapping codes have similarities and differences with LDPC codes (Low Density Parity Check Codes). What they have in common: the mapping matrix of the random mapping code and the parity check matrix of LDPC are both sparse and can be represented by a Tenet diagram, which expresses the relationship between bit nodes and check nodes or symbol nodes. Their differences are as follows: (1) The mapping matrix of the random mapping code is a generator matrix, and the LDPC check matrix must be converted into a generator matrix; (2) The elements of the random mapping mat...

AI Technical Summary

Problems solved by technology

Although the construction methods of the LDPC check matrix include random generation, geometric construction, quasi-cyclic code and other relatively mature construction methods, because the algorithm principle of the random mapping code is different from that of LDPC, the construction method of the LDPC check matrix cannot be fully applied.

However, the original random mapping matrix construction method does not consider the requirements of hardware implementation, and the basic matrix for link adaptation at the traditional receiving end has two elements in the row direction, which is prone to memory access conflicts during hardware implementation.

Images