Rate matching method, coding device and communication device

Abstract

The embodiment of the invention provides a rate matching method, a coding and decoding device and a communication device. The rate matching method comprises the steps of obtaining an information bit sequence and a target code length M of a Polar code; when the target code length M satisfies a preset condition, coding the information bit sequence by adopting the Polar code with the code length of a first mother code as N1 and outputting a first coding bit sequence, wherein the N1 is less than or equal to M, and N1 is the integer power of 2; repeating at least a portion of bits of the first coding bit sequence to obtain a first target Polar code with the length of M; when the target code length M does not satisfy the preset condition, coding the information bit sequence by adopting the Polar code with the code length of a second mother node of N2, and outputting a second coding bit sequence, wherein N2 is greater than or equal to M, and N2 is the integer power of 2; shortening or drilling the second coding bit sequence to obtain a second target Polar code with the length of M. A repetition based rate matching scheme is adopted under the condition of very low coding gain loss, so that the coding and decoding complexity is reduced.

Description

technical field [0001] The embodiments of the present invention relate to the communication field, and more specifically, to a rate matching method and device. Background technique [0002] Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication. The polar codes (Polar codes) proposed by Turkish professor Arikan are the first good codes that can reach Shannon capacity and have low encoding and decoding complexity. Polar code is a linear block code whose coding matrix is ​​G N , the encoding process is in Is a binary row vector with a length of N (that is, the mother code length); G N is an N×N matrix, and defined as log 2 N matrix F 2 The Kronecker product of . [0003] the above matrix [0004] During the encoding process of Polar code, Some of the bits in are used to carry information, called information bits, and the index set of these bits is denoted as The other part of th...

AI Technical Summary

Problems solved by technology

The cache size, complexity, and delay of encoding and decoding are all related to the length of the mother code. When shortening or punching more bits (for example, shortening or punching from 2048 bits to 1200 bits), the additional overhead caused by punching is very large

As the target code length increases, the code rate decreases. On the one hand, it can bring coding gain, and on the other hand, the complexity also increases with the increase of the mother code length.

Images