WO2019206136A1

WO2019206136A1 - Method and device for rate matching and de-rate matching polar code

Info

Publication number: WO2019206136A1
Application number: PCT/CN2019/083883
Authority: WO
Inventors: 牛凯; 朴瑨楠; 戴金晟; 董超; 王桂杰
Original assignee: 华为技术有限公司
Priority date: 2018-04-23
Filing date: 2019-04-23
Publication date: 2019-10-31
Also published as: CN110391874B; CN110391874A

Abstract

Provided by the embodiments of the present application are a method and device for rate matching and de-rate matching a polar code, the method comprising: acquiring a sequence to be coded of which the length is N according to a coding constraint relationship, and performing polarization coding on the sequence to be coded so as to obtain a coded sequence, the coding constraint relationship being used to indicate at least two constraint positions in the sequence to be coded, and bits located at the at least two constraint positions having the same value; obtaining, according to matching positions in a rate matching pattern and the coded sequence, a rate matching sequence of which the length is M, wherein the rate matching pattern comprises a plurality of consecutive matching positions, and coded bits corresponding to the matching positions in the coded sequence are 0, N and M being integers, and M being less than N; and sending the rate matching sequence to a receiving device. The embodiments of the present application may improve decoding performance.

Description

Rate matching, de-rate matching method and device for polarization code

This application claims the priority of the Chinese patent application filed on April 23, 2018, the Chinese Patent Office, the application number is 201810366668.6, and the application name is "Polarization code rate matching, de-rate matching method and device". The citations are incorporated herein by reference.

Technical field

The embodiments of the present invention relate to the field of coding and decoding technologies, and in particular, to a rate matching and de-rate matching method and device for a polarization code.

Background technique

Communication systems usually use channel coding to improve the reliability of data transmission to ensure the quality of communication. The Polar codes proposed by Turkish professor Arikan are the first good codes that can theoretically achieve Shannon's capacity and have low coding and decoding complexity. Therefore, Polar code has great prospects in the development and application 5G, and the Third Generation Partnership Project ^{(the 3 rd Generation Partner Project,} 3GPP) radio access network (Radio Access Network, RAN1) 87th meeting Accepted for control channel coding.

In the specific implementation process, the code length of the original Polar code (parent code) is an integer power of 2. In practical applications, a Polar code of any code length needs to be implemented by rate matching. The prior art implements rate matching using a scheme such as puncture or shortening. That is, the prior art performs rate matching during encoding, puncturing or shortening the mother code exceeding the target code length to reach the target code length, performing de-rate matching during decoding, and filling and restoring the received decoding sequence to the mother code. Code length. However, at present, for the rate matching scheme of the polar code, there is a problem that the decoding performance is not high. Therefore, it is urgent to provide a rate matching method to improve the decoding performance.

Summary of the invention

The embodiment of the present application provides a rate matching and de-rate matching method and device for a polarization code to improve decoding performance.

In a first aspect, the embodiment of the present application provides a rate matching method for a polarization code, including:

Obtaining a sequence to be coded with a length of N according to a coding constraint relationship, and performing polarization coding on the sequence to be coded to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be coded, and The bits located at the at least two constraint positions have the same value;

Performing a puncturing or shortening operation on the encoded sequence according to the matching position in the rate matching pattern to obtain a rate matching sequence of length M, wherein the rate matching pattern includes multiple consecutive matching positions, and the matching may be obtained. When searching for a location, the number of available matching locations will be searched for by

The reduction is M+1 times, which effectively reduces the search complexity. By setting the coding constraint relationship, the coding bit corresponding to the matching position in the encoded sequence can be made 0, and the decoding performance is improved, and the N and the M are An integer, the M is less than N; the rate matching sequence is sent to the receiving device.

In this embodiment, the rate matching of the Polar code is performed based on the coding constraint relationship and the matching position consecutively, and the decoding performance can be improved.

In a possible design, the number of the coding constraint relationships is at least one, the difference between the number of all constraint positions corresponding to the at least one coding constraint relationship and the number of the coding constraint relationships and the matching position The number is equal, and the code rate non-destructive principle can be satisfied, so that the code rate can take any value between 0 and 1.

In a possible design, before the obtaining a sequence to be encoded of length N according to the coding constraint relationship, the method further includes:

And obtaining a matching column from the encoding matrix according to the matching position in the rate matching pattern, wherein the sorting of the matching column in the encoding matrix is the same as the sorting position of the matching position in the rate matching pattern;

Acquiring a solution expression corresponding to each of the matching positions according to a preset configuration sequence and a matching column that is the same as a sorting position of each matching position, where the preset structure sequence is a constructed sequence of the sequence to be encoded, The value of the solution expression is 0;

And obtaining the coding constraint relationship according to a solution expression corresponding to each of the matching positions.

In a possible design, the obtaining a matching column from the coding matrix according to the matching position in the rate matching pattern includes:

Extracting an initial matrix from the coding matrix according to a matching position in the rate matching pattern;

Gaussian elimination processing is performed on the element 1 in the initial matrix to obtain a matching matrix, and the columns in the matching matrix are the matching columns.

By extracting the initial matrix and performing Gaussian elimination processing, the coding matrix is simplified, so that the coding constraint relationship can be quickly obtained.

In a possible design, the acquiring a sequence to be encoded of length N according to a coding constraint relationship includes:

Obtaining the to-be-coded sequence according to the coding constraint relationship, an attribute of a first bit of each constraint position located in the coding constraint relationship, and an attribute of a second bit located outside the coding constraint relationship, where the bit The attributes are frozen bits or information bits.

In a possible design, the attribute according to the coding constraint relationship, the first bit of each constraint position located in the coding constraint relationship, and the attribute of the second bit located outside the coding constraint relationship, Before the obtaining the sequence to be encoded, the method further includes:

Determining an attribute of the first bit of each constraint position in the encoding constraint relationship in a preset configuration sequence, where the preset construction sequence is a constructed sequence of the sequence to be encoded;

Determining an attribute of the second bit in the preset configuration sequence, where the second bit is a bit other than the first bit in the preset configuration sequence, and the attribute of the bit is a frozen bit or information Bit.

By constructing the attributes of the bits of the constraint position in the coding constraint relationship, the attributes of the bits at other positions can be constructed to ensure that the information bits and the frozen bits are correct in quantity and attributes.

In a possible design, the determining the attributes of the first bit of each constraint position in the encoding constraint relationship in the preset configuration sequence includes:

Determining, according to a preset construction method, a first information bit in the first bit corresponding to each constraint position of each of the coding constraint relationships;

Determining, in the first bit corresponding to each constraint position, a first bit other than the first information bit as a first frozen bit, wherein the value of the first frozen bit satisfies the coding constraint relationship.

In a possible design, the determining the attributes of the second bit in the preset configuration sequence includes:

Determining, according to the length of the preset information bit sequence and the number of the first information bits, the number of second information bits in the second bit;

Determining, according to the preset configuration method and the number of the second information bits, the second information bit and the second frozen bit in the second bit, where the value of the second frozen bit is preset fixed value.

In a second aspect, an embodiment of the present application provides a method for matching a rate of a polarization code, including:

Receiving a rate matching sequence of length M sent by the sending device;

The rate matching sequence is de-rate matched according to the rate matching pattern to obtain a sequence to be decoded of length N, where the rate matching pattern includes a plurality of consecutive matching positions, and the N and the M are integers. Said M is less than N;

Decoding the sequence to be decoded according to a coding constraint relationship to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded, and at least two The decoding result of the bits of the constraint position is the same.

In a possible design, the number of the decoding constraint relationships is at least two, and the difference between the number of all constraint positions corresponding to at least two of the coding constraint relationships and the number of the decoding constraint relationships is The number of matching locations is equal.

In a possible design, if the first to-be-decoded bit in the sequence to be decoded is located at a constraint position in the coding constraint relationship, the to-be-decoded according to the coding constraint relationship The sequence is decoded, including:

Determining whether the second to-be-decoded bit in the same coding constraint relationship as the first to-be-decoded bit is decoded;

If yes, setting the value of the first to-be-decoded bit to be the same as the value of the second to-be-decoded bit;

If not, decoding the first to-be-decoded bit to obtain a value of the first to-be-decoded bit.

In a third aspect, the embodiment of the present application provides a sending device, including:

An encoding module, configured to obtain a sequence to be encoded with a length of N according to a coding constraint relationship, and perform polarization coding on the sequence to be coded to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two of the sequences to be coded. Constrained positions, and the bits at the at least two constraint positions have the same value;

a rate matching module, configured to obtain a rate matching sequence of length M according to the matching position in the rate matching pattern and the encoded sequence, where the rate matching pattern includes multiple consecutive matching positions, after the encoding The coded bit corresponding to the matching position in the sequence is 0, the N and the M are integers, and the M is less than N;

And a sending module, configured to send the rate matching sequence to the receiving device.

In a possible design, the number of the coding constraint relationships is at least one, the difference between the number of all constraint positions corresponding to the at least one coding constraint relationship and the number of the coding constraint relationships and the matching position The number is equal.

In a possible design, the method further includes: a relationship obtaining module, configured to obtain a matching column from the encoding matrix according to the matching position in the rate matching pattern before acquiring the sequence to be encoded with the length N according to the encoding constraint relationship, The ordering of the matching columns in the encoding matrix is the same as the sorting position of the matching locations in the rate matching pattern;

In a possible design, the relationship obtaining module is further specifically configured to:

In a possible design, the coding module is specifically used to:

In a possible design, the method further includes: a bit attribute determining module, configured to, according to the encoding constraint relationship, an attribute of a first bit located in each constraint position in the encoding constraint relationship, and located in the encoding constraint relationship Attributes of the second bit other than the attribute, before acquiring the sequence to be coded, determining an attribute of the first bit of each constraint position in the coding constraint relationship in the preset configuration sequence, where the preset structure sequence is a constructed sequence of the sequence to be encoded;

In a possible design, the bit attribute determining module is specifically configured to:

In a possible design, the bit attribute module is specifically used to:

In a fourth aspect, the embodiment of the present application provides a receiving device, including:

a receiving module, configured to receive a rate matching sequence of length M sent by the sending device;

a rate matching module, configured to perform rate de-matching on the rate matching sequence according to the rate matching pattern, to obtain a sequence to be decoded of length N, where the rate matching pattern includes multiple consecutive matching positions, where the N and The M is an integer, and the M is less than N;

a decoding module, configured to decode the to-be-decoded sequence according to a coding constraint relationship, to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded, and The decoding results of the bits located at the at least two constraint positions are the same.

In a possible design, if the first to-be-decoded bit in the sequence to be decoded is located at a constraint position in the coding constraint relationship, the decoding module is specifically configured to:

In a fifth aspect, an embodiment of the present application provides a sending device, including: a memory and a processor, where the memory is used to store a computer program, and the processor is configured to call and run the computer program from the memory, so that The processor runs the computer program to perform the rate matching method as described in the first aspect and the various possible designs of the first aspect.

In a sixth aspect, an embodiment of the present application provides a receiving device, including: a memory, a processor, and a computer program, where the computer program is stored in the memory, and the processor runs the computer program to perform the foregoing second aspect and The de-rate matching method described in various possible designs of the second aspect.

In a seventh aspect, the embodiment of the present application provides a storage medium, where the storage medium includes a computer program, and the computer program is used to implement the rate matching method according to the first aspect and various possible designs of the first aspect, Alternatively, the computer program is for implementing the de-rate matching method as described in the second aspect and the various possible designs of the second aspect.

In an eighth aspect, an embodiment of the present application provides a computer program product, where the computer program product includes computer program code, when the computer program code is run on a computer, causing the computer to perform the foregoing first aspect and the first aspect A rate matching method as described in the possible design, or a de-rate matching method as described in the second aspect and the various possible designs of the second aspect.

In a ninth aspect, an embodiment of the present application provides a chip, including a memory and a processor, where the memory is used to store a computer program, and the processor is configured to call and run the computer program from the memory, so that the processing The apparatus performs the rate matching method as described in the first aspect and the various possible designs of the first aspect, or the de-rate matching method described in the second aspect and the various possible designs of the second aspect.

In a tenth aspect, an embodiment of the present application provides an encoding apparatus for performing the rate matching method according to the first aspect and various possible designs of the first aspect.

In an eleventh aspect, an embodiment of the present application provides a decoding apparatus for the de-rate matching method described in the second aspect and the various possible designs of the second aspect.

In this embodiment, the transmitting device obtains a sequence to be encoded of length N according to the coding constraint relationship, and performs polarization coding on the coded sequence to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be coded. And the bits of the at least two constraint positions have the same value, and the sending device obtains a rate matching sequence of length M according to the matching position and the encoded sequence in the rate matching pattern, where the rate matching pattern includes multiple consecutive matches. Position, the coded bit corresponding to the matching position in the sequence is 0, N and M are integers, M is less than N, the transmitting device sends a rate matching sequence to the receiving device, and the receiving device receives the rate matching sequence of length M sent by the sending device, The receiving device performs rate de-matching on the rate matching sequence according to the rate matching pattern to obtain a sequence to be decoded with a length of N, and the receiving device decodes the sequence to be decoded according to the decoding constraint relationship to obtain a decoded sequence and a decoding constraint relationship. Used to indicate at least two constraint positions in the sequence to be decoded, and at least Same bit positions constraints decoding result. In this embodiment, rate matching and de-rate matching of the Polar code are performed based on the coding constraint relationship and the matching position consecutively, and the decoding performance can be improved.

DRAWINGS

FIG. 1 shows a network architecture that may be applicable to an embodiment of the present application;

FIG. 2 is a flowchart of processing a rate matching of a polarization code according to an embodiment of the present disclosure;

FIG. 3 is a schematic flowchart of a method for acquiring a rate matching pattern according to an embodiment of the present disclosure;

4 is a schematic structural diagram of a rate matching pattern provided by an embodiment of the present application;

FIG. 5 is a schematic flowchart of a method for constructing a Polar code according to an embodiment of the present disclosure;

FIG. 6 is a schematic diagram of a process of constructing a Polar code according to an embodiment of the present application;

FIG. 7 is a signaling flowchart of rate matching and de-rate matching provided by an embodiment of the present application;

FIG. 8 is a schematic diagram of obtaining a rate matching sequence according to an embodiment of the present application;

FIG. 9 is a schematic flowchart of a decoding method according to an embodiment of the present disclosure;

FIG. 10A is a schematic diagram 1 of a path extension according to an embodiment of the present application; FIG.

FIG. 10B is a schematic diagram 2 of a path extension according to an embodiment of the present application; FIG.

FIG. 11 is a schematic diagram 1 of decoding performance comparison according to an embodiment of the present application; FIG.

FIG. 12 is a second schematic diagram of decoding performance according to an embodiment of the present application; FIG.

FIG. 13 is a third schematic diagram of decoding performance provided by an embodiment of the present application; FIG.

FIG. 14 is a schematic structural diagram of a sending device according to an embodiment of the present disclosure;

FIG. 15 is a schematic structural diagram of a receiving device according to an embodiment of the present disclosure;

FIG. 16 is a schematic structural diagram of hardware of a sending device according to an embodiment of the present disclosure;

FIG. 17 is a schematic structural diagram of hardware of a receiving device according to an embodiment of the present disclosure.

detailed description

The network architecture and the service scenario described in the embodiments of the present application are for the purpose of more clearly illustrating the technical solutions of the embodiments of the present application, and do not constitute a limitation of the technical solutions provided by the embodiments of the present application. The technical solutions provided by the embodiments of the present application are equally applicable to similar technical problems.

The embodiments of the present application can be applied to a wireless communication system. It should be noted that the wireless communication system mentioned in the embodiments of the present application includes but is not limited to: Narrow Band-Internet of Things (NB-IoT), global mobile Global System for Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access (CDMA) 2000 System (Code Division Multiple Access, CDMA2000), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution (LTE), and Next Generation 5G Mobile Communication System .

The possible network architecture of the embodiment of the present application is introduced below with reference to FIG. FIG. 1 shows a network architecture that may be applicable to an embodiment of the present application. As shown in FIG. 1 , the network architecture provided by this embodiment includes a network device 101 and a terminal device 102.

The network device 101 is a device that accesses the terminal device to the wireless network, and may be in Global System of Mobile communication (GSM) or Code Division Multiple Access (CDMA). Base station (Base Transceiver Station, BTS for short), may also be a base station (NodeB, NB for short) in Wideband Code Division Multiple Access (WCDMA), or Long Term Evolution (LTE). Evolved Node B (eNB or eNodeB for short), or a relay station or access point, or a network side device (such as a base station) in a future 5G network or a public land mobile network (Public Land Mobile Network) Network devices and the like in PLMN) are not limited herein. FIG. 1 is a schematic diagram showing a possible schematic diagram, and the network device 101 is taken as an example for a base station. The base station may include various forms of macro base stations, micro base stations, relay stations, access points, and the like.

The device device 102 may be a wireless terminal or a wired terminal, the wireless terminal may be a device that provides voice and/or other service data connectivity to the user, a handheld device with wireless connectivity, or other processing device connected to the wireless modem. . The wireless terminal can communicate with one or more core networks via a Radio Access Network (RAN), which can be a mobile terminal, such as a mobile phone (or "cellular" phone) and a mobile terminal. The computer, for example, can be a portable, pocket, handheld, computer built-in or in-vehicle mobile device that exchanges language and/or data with the wireless access network. For example, Personal Communication Service (PCS) telephone, cordless telephone, Session Initiation Protocol (SIP) telephone, Wireless Local Loop (WLL) station, personal digital assistant (Personal) Digital Assistant, PDA for short. The wireless terminal may also be referred to as a system, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, and a remote terminal. The access terminal, the user terminal (User Terminal), and the user agent (User Agent) are not limited herein. FIG. 1 schematically depicts a possible schematic diagram in which the terminal device 102 is a mobile phone as an example.

In this embodiment, the network device 101 and the terminal device 102 may use a Polar code as a coding and coding scheme. The encoding device as the transmitting device in this embodiment may be the network device 101 or the terminal device 102. Similarly, the decoding device as the receiving device may be the terminal device 102 or the network device 101. Specifically, when the network device 101 performs polarization coding as a transmitting device, the terminal device 102 performs polarization decoding as a receiving device. Correspondingly, when the terminal device 102 performs polarization coding as a transmitting device, the network device 101 performs polarization decoding as a receiving device.

In this embodiment, the Polar code herein includes, but is not limited to, an Arikan Polar code, a PC-Polar code, a CA-Polar code, and a PC-CA-Polar code. Arikan Polar refers to the original Polar code, which is not cascaded with other codes, only information bits and frozen bits. PC-Polar is a Polar code of Cascade Check (PC), CA-Polar is a Cyclic Redundancy Check Aided (CA) Polar code and other cascading Polar codes. The PC-CA-Polar code is a Polar code that concatenates both PC and CA at the same time. PC-Polar and CA-Polar improve the performance of Polar codes by cascading different codes.

The Polar code is a linear block code whose encoding matrix is G, and the encoding process is u ^N G=x ^N , where u ^N =(u ₁ , u ₂ , . . . , u _N ) is a binary line. Vector, length N (ie mother code length); G is an N×N matrix, and

Matrix here

The Kronecker product defined as log ₂ N matrices F ₂ ; the addition and multiplication operations referred to above are addition and multiplication operations on a binary Galois field.

In the encoding process of the Polar code, a part of the bits in u ^N are used to carry information, which is called information bits. The set of indexes of these bits is denoted as A; another part of the bits is set to a fixed value pre-agreed by the transceiver, which is called A fixed bit whose set of indices is represented by the complement A ^{c of} A. Without loss of generality, these fixed bits are usually set to 0, only need to be pre-agreed by the transceiver, and the fixed bit sequence can be arbitrarily set.

The Polar code is decoded based on a Successive Cancellation (SC) decoding algorithm or a SC List (SCL) decoding algorithm. The decoding algorithm of the polar code is not particularly limited in this embodiment. The SC decoding algorithm, that is, sequentially decodes from the first bit. The serial offset list (SC List, SCL) decoding algorithm is an improvement of the SC decoding algorithm. Multiple candidate decoding results are reserved in each bit, and all the bits are decoded, and all decodings in the list are performed according to certain criteria. The result is selected to obtain the final decoded result.

FIG. 2 is a flowchart of processing a rate matching of a polarization code according to an embodiment of the present application. As shown in FIG. 2, the CA-Polar code is taken as an example, that is, the CRC of the CRC code is used as an example to describe the process of the rate matching process. I will not repeat them here.

Specifically, on the transmitting device side, the transmitting device obtains a K-bit long information bit sequence according to k information bits and a CRC code of length m, and then performs polarization encoding on the information bit sequence to obtain N bits long. The encoded sequence, wherein the N-bit long encoded sequence includes information bits and freeze bits. The transmitting device performs puncturing or puncturing on the encoded sequence to obtain a rate matching sequence of M bits long. The transmitting device sends the encoded sequence to the receiving device through the channel, and the receiving device performs decoding by using the SCL decoding method to obtain a plurality of candidate paths, and the candidate path obtained by the CRC is verified, and if the verification result is verified Then, the candidate path that passes the verification is the decoding result, and if the verification fails, the other candidate paths are verified until the decoding result is obtained.

In this embodiment, a rate matching and de-rate matching method for a polarization code is proposed, which makes the matching position more flexible and variable, and the decoding performance is higher. The rate matching may be a puncture process or a shortening process on the encoded sequence. Among them, the punching position of the punching process or the shortening position of the shortening process can be understood as a matching position. The matching position can be flexibly set, and the matching position can be not only the front end or the back end of the encoded sequence, but also any position of the encoded sequence.

In this embodiment, a plurality of consecutive matching locations may be indicated by a rate matching pattern. The design principle of the rate matching pattern is that the matching position is continuous, and the number of frozen bits and the number of matching positions that satisfy the matching position are equal, so as to achieve the principle of rate loss. Based on the above two principles, the present embodiment obtains a rate matching pattern based on the coded bit corresponding to the matching position, and constructs a Polar code based on the coding constraint relationship corresponding to the rate matching pattern, thereby performing targeted polarization. Encoding to ensure decoding performance. Detailed description will be made below using specific embodiments.

The channel model of this embodiment: the code length of the coded mother code is N=2 ⁿ , the code length M is matched, the number of matches is Q=NM, the length of the information bit is K, and the source sequence u ^N =(u ₁ , u ₂ , ..., u _N ), then the coding sequence c = u ^N G, where G is the polarization code encoding matrix, and

FIG. 3 is a schematic flowchart of a method for acquiring a rate matching pattern according to an embodiment of the present disclosure. As shown in FIG. 3, the method includes:

S301: Set a preset structure sequence with a mother code length of N. After the rate matching, the code length is M, the number of matches is Q=N-M, the matching position is i to i+Q-1, and i is initialized=1.

The preset construction sequence is a constructed sequence of the sequence to be encoded.

S302. Acquire i to i+Q-1 columns from the coding matrix according to the matching positions (i to i+Q-1) in the rate matching pattern to obtain a matching column.

The sorting of the matching column in the encoding matrix is the same as the sorting position of the matching position in the rate matching pattern.

S303. Acquire a solution expression corresponding to each matching position according to a preset configuration sequence and a matching column that is the same as a sorting position of each matching position, where the value of the solution expression is 0;

S304. Acquire a coding constraint relationship according to a solution expression corresponding to each matching position.

S305, setting i=i+1, determining whether i+1 is less than or equal to i+Q-1, if yes, executing S302, and if not, executing S306.

FIG. 3 is a detailed description of the present embodiment in conjunction with a specific embodiment. For other implementation manners, similar to the embodiment, the present embodiment is not described herein again.

First, construct a preset structure sequence u ⁸ =(u ₁ ,u ₂ ,...,u ₈ ) with a mother code length of 8, and the code length after the rate matching is 5, that is, the number of matches Q=NM=8-5= 3. The preset structure sequence is a structure sequence of the sequence to be coded, that is, the present application pre-configures a sequence with a mother code length of 8, which is the same length as the sequence to be coded.

The matching position of this embodiment takes i to i+Q-1, that is, takes Q consecutive matching positions. The matching position in the initial rate matching pattern is from 1 to 3, and then 2 to 4, 3 to 5, and so on. The rate matching pattern is used to indicate a plurality of consecutive matching positions, and the length of the matching pattern is equal to the preset configuration sequence, and may be a sequence including 0 and 1, wherein 0 is used to indicate a matching position, and 1 is used to indicate Non-matching location.

When i=1 is initialized, the matching position is 1, 2, and 3. The matching columns thus obtained from the encoding matrix G are the first to third columns in the matrix. The coding matrix is as follows:

Matrix A

The shaded part of matrix A is the matching column. Obtaining a solution expression corresponding to each matching position according to a preset construction sequence u ⁸ =(u ₁ , u ₂ , . . . , u ₈ ) and a matching column having the same sorting position as each matching position, wherein The expression is an expression obtained by multiplying a preset construction sequence and a matching column, and the value of the solution expression is 0.

In this embodiment, the solution expression is as follows:

among them,

In order to take the XOR symbol, the process of obtaining the encoding constraint relationship according to the solution expression is as follows:

In the case of derivation, this example is derived from the column with a small column weight, and then the column with a large column is deduced. Thus, the coding constraint relationship is obtained as u ₁ =u ₂ =u ₃ =u ₄ and u ₅ =u ₆ =u ₇ =u ₈ .

Then, i=i+1 is set, and the matching position is 2, 3, and 4, and the implementation of the coding constraint relationship is as shown in the above, which is not described herein again. In this embodiment, for convenience of explanation, how to obtain the coding relationship when the matching positions are 4, 5, and 6 is described in detail.

When the matching positions are 4, 5, 6, the matching columns thus obtained from the encoding matrix G are the 4th to 6th columns in the matrix. The coding matrix is as follows:

Matrix B

The shaded portion of matrix B is the matching column. According to the preset construction sequence u ⁸ =(u ₁ , u ₂ ,..., u ₈ ) and the matching column with the same sort position as each matching position, the solution expression corresponding to each matching position is obtained as follows:

The process of obtaining the coding constraint relationship according to the solution expression is as follows:

c ₆ =0→{u ₆ =u ₈

c ₄ =0→{u ₄ =u ₈

In the case of derivation, this example is derived from the column with a small column weight, and then the column with a large column is deduced. Thus, the coding constraint relationship is obtained as u ₄ = u ₆ = u ₈ and u ₅ = u ₇ .

The above similar process is repeated, and when i=6, the coding constraint relationship corresponding to the six matching positions can be obtained.

Further, on the basis of the foregoing embodiment, the coding matrix can be simplified, so that the coding constraint relationship can be quickly obtained. Specifically, the initial matrix is extracted from the coding matrix according to the matching position in the rate matching pattern; the Gaussian elimination processing is performed on the element 1 in the initial matrix to obtain a matching matrix, and the columns in the matching matrix are matching columns. For convenience of explanation, the matrix B will be described here as an example.

Among them, the gray 4, 5, and 6 columns constitute the initial matrix, and Gaussian elimination processing is performed on the element 1 in the initial matrix to obtain the matching matrix Gp. Among them, the Gaussian elimination process is a Gaussian elimination process on a column with a large column. For example, if the column weight of the fifth column is 4, the Gaussian elimination is performed on the 5th column according to the 6th column, because the 6th element of the 5th column is The eighth element is the same as the sixth element and the eighth element of the sixth column, so the sixth element and the eighth element of the fifth column perform Gaussian elimination processing, and element 1 becomes element 0. This embodiment only schematically shows the process of Gaussian elimination. For other Gaussian elimination processes, the embodiment is not particularly limited herein.

After the matching matrix Gp is obtained, the solution expression that can be obtained according to the matching column in the matching matrix is as follows:

Among them, the process of obtaining the coding constraint relationship according to the solution expression is as follows:

c ₄ =0→{u ₄ =u ₈

c ₆ =0→{u ₆ =u ₈

Those skilled in the art can understand that for the matching matrix obtained by simplification, the obtained expression is simpler, the column weight of each column is equal, and the coding constraint relationship can be derived from any column, the derivation process is simple, and the processing efficiency is improved.

Further, for the matching matrix obtained by simplification, the coding constraint relationship can also be directly obtained for the matching matrix. Specifically, the coding constraint relationship may be directly obtained according to the position of the element 1 in the coding constraint relationship. For example, for the first column in the matching matrix, there are two locations where the element is 1, corresponding to u ₄ , u ₈ , because each column If the modulo two-addition result is zero, u ₄ =u ₈ can be obtained, since u ₈ appears in the third column in the matching matrix, and the third column element has a position of 1, corresponding to u ₈ , u ₆ , thereby Obtaining u ₄ =u ₈ =u ₆ directly, u ₅ =u ₇ can be obtained for the second column in the matching matrix. This embodiment schematically shows another implementation manner for obtaining an encoding constraint relationship through a matching matrix. For other implementation manners for obtaining a coding constraint relationship through a matching matrix, the protection scope of the present application is not included in this embodiment. Let me repeat.

S306. Obtain a rate matching pattern that satisfies the code rate lossless principle according to the number of each coding constraint relationship and the number of matching positions.

Those skilled in the art can understand that, through S301 to S305, six coding constraint relationships can be obtained, that is, corresponding to the 6 medium rate matching pattern. However, due to the existence of the coding constraint relationship, the number of information bits that can be carried is affected, and there is a problem of code rate impairment. Therefore, in all the coding constraint relationships obtained, the coding constraint relationship satisfying the code rate lossless principle is obtained.

Taking the coding constraint relationship corresponding to the above matrix A and matrix B as an example, the problem of rate loss is explained.

For matrix A, the coding constraint relationship is u ₁ =u ₂ =u ₃ =u ₄ and u ₅ =u ₆ =u ₇ =u ₈ , the number of information bits that can be carried is only 2 due to the existence of the constraint relationship, but due to M=5, so for the rate matching pattern corresponding to the matrix A, the code rate is at most 2/5, and there is a problem of loss of rate. Therefore, the coding constraint relationship corresponding to the matrix A does not satisfy the code rate non-destructive principle.

For matrix B, the coding constraint relationship is u ₄ = u ₆ = u ₈ and u ₅ = u ₇ . Due to the existence of the constraint relationship, the number of information bits that can be carried is 5 (the coding constraint relationship corresponds to 2, and the remaining 3 bits correspond to 3), and M=5, so the matrix B corresponds to the rate matching pattern, and the maximum code rate is 1, there is no problem of loss of rate, the guaranteed code rate can be taken from 0 to 1.

It can be seen that, when the number of coding constraint relationships is at least one, when the difference between the number of all constraint positions corresponding to the at least one coding constraint relationship and the number of coding constraint relationships is equal to the number of matching positions, the coding constraint relationship is The corresponding rate matching pattern satisfies the code rate lossless principle.

For example, for matrix A, two coding constraint relations correspond to 8 constraint positions, then the difference is 6, and the difference can be understood as the number of frozen bits affected, and the difference is not equal to the number of matching positions, so A rate matching pattern with a matching position of 1 to 3 does not satisfy the rate loss non-destructive principle. For the matrix B, the two coding constraint relations correspond to five constraint positions, and the difference is 3, and the difference can be understood as the number of frozen bits affected, the difference being equal to the number of matching positions, the matching position A rate matching pattern of 4 to 6 satisfies the rate loss principle.

It can be understood by those skilled in the art that the present embodiment exemplarily illustrates the case where the code rate non-destructive principle is not satisfied and the case where the code rate non-destructive principle is satisfied by using the matrix A and the matrix B. In the specific implementation process, the code rate is not damaged. The rate matching pattern of the principle may be at least one, and the rate matching pattern that does not satisfy the code rate lossless may also be multiple.

S307. Acquire a target rate matching pattern according to a preset screening principle and a rate matching pattern that satisfies a code rate losslessness.

It can be seen from the above that there are multiple rate matching patterns satisfying the principle of rate loss, so that the rate matching pattern to be used can be selected according to the preset screening principle. The preset screening rules include, but are not limited to, Gaussian Approximation (GA) estimation, or Polarization Weight (PW) value as a measure to select the best rate matching pattern as the rate matching pattern. . Or fixed matching position selection, such as front end, back end, end, etc., to obtain the target rate matching pattern. In this embodiment, the preset screening principle is not particularly limited, and the implementation manner of acquiring the target rate matching pattern is not particularly limited. If the target rate matching pattern is the rate matching pattern corresponding to the matrix B, the implementation is as shown in FIG. 4 , and FIG. 4 is a schematic structural diagram of the rate matching pattern provided by the embodiment of the present application. Where 0 represents the matching position and 1 represents the non-matching position.

In this embodiment, by setting consecutive matching positions, not only can the matching position be set regularly, but also the decoding performance can be improved, and the matching position can be any position by the coding constraint relationship, and the matching position can be increased. The flexibility of the setting, and the rate matching pattern satisfies the code rate non-destructive principle, ensuring that the code rate can be taken from 0 to 1.

FIG. 5 is a schematic flowchart of a method for constructing a Polar code according to an embodiment of the present disclosure. In this embodiment, the attribute of the first bit of each constraint position in the encoding constraint relationship in the preset configuration sequence is first determined; and the attribute of the second bit in the preset structure sequence is determined, wherein the second bit is a preset The bits in the sequence other than the first bit are constructed, and the attributes of the bits are frozen bits or information bits. The specific implementation process is shown in Figure 5:

S501. Determine, according to a preset construction method, a first information bit in a first bit corresponding to each constraint position of each coding constraint relationship;

S502, determining, by the first bit corresponding to each constraint position, a first bit other than the first information bit as a first frozen bit, where the value of the first frozen bit satisfies an encoding constraint relationship;

S503. Determine, according to a preset length of the information bit sequence and the number of first information bits, a quantity of second information bits in the second bit, where the second bit is a bit other than the first bit in the preset configuration sequence;

S504. Determine, according to the preset configuration method and the number of second information bits, the second information bit and the second frozen bit in the second bit, where the value of the second frozen bit is a preset fixed value.

In this embodiment, the preset construction method may be a GA configuration mode or a PW construction manner. The specific configuration manner is not particularly limited in this embodiment, as long as the configuration manner can construct a Polar code, which belongs to the protection scope of the present application. . In the present embodiment, for convenience of description, the PW structure is preset as an example of the preset configuration.

Continuing to refer to the embodiment shown in FIG. 3, in the embodiment shown in FIG. 3, the rate matching pattern corresponding to the matrix B is a pattern that satisfies the code rate lossless principle. Therefore, the coding constraint relationship corresponding to the matrix B in this embodiment is For example, to explain how to construct a Polar code.

In this embodiment, the length K=4 of the preset information bit sequence is taken as an example and described with reference to FIG. 6. FIG. 6 is a schematic diagram of a process of constructing a Polar code according to an embodiment of the present application. In this embodiment, the reliability of each polarized subchannel is obtained according to the PW metric, and the information bits and the freeze bits are determined according to the reliability of the polarized subchannel. As shown in FIG. 6, in this embodiment, the reliability of the polarized subchannels is ranked. As the ordering increases, the reliability of the polarized subchannels decreases, that is, the reliability of the polarized subchannels ranked 1 is the highest. The polarization subchannels sorted to 8 have the lowest reliability.

The preset construction sequence is u ⁸ = (u ₁ , u ₂ , ..., u ₈ ). As can be seen from the embodiment of Fig. 3, the coding constraint relationship corresponding to matrix B is u ₄ = u ₈ = u ₆ and u ₅ = u ₇ , in Figure 5, the constraint positions in the same constraint relationship are indicated by the same shading. The process of determining information bits (Data, abbreviated as D) and frozen bits (Frozen, F for short) is as follows:

1) determining, in the first bit corresponding to each constraint position of each coding constraint relationship, that the first bit with the highest reliability of the polarization subchannel is the first information bit, and dividing the first bit corresponding to each constraint position by the first one The first bit other than the information bit is determined as the first frozen bit;

Specifically, a coding constraints u ₄ = u ₈ = u _6, in the first bit u _4, u _6, u ₈ _{u. 8} is determined as the information bits, the first bit u _4, u ₆ bits is determined as frozen . For the coding constraint relationship of u ₅ = u ₇ , it is determined in u ₅ and u ₇ that u ₇ is an information bit and u _{5 is} determined as a frozen bit. A person skilled in the art can understand that the value of the frozen bit determined here is not a preset fixed value, but a coding constraint relationship is satisfied, that is, the value is the same as the value of the information bit.

2) determining, according to a difference between the length of the information bit sequence and the number of first information bits, the number of second information bits in the second bit except the first bit to the preset configuration sequence, according to a preset construction method and The number of second information bits, the second information bit and the second frozen bit being determined in the second bit.

Wherein, the length of the preset information bit sequence is K=4, two first information bits have been determined according to the coding constraint relationship, and two information bits are still different. Therefore, the second bit u ₁ except the first bit In u ₂ , u ₃ , according to the reliability of the polar subchannel, it is determined that the second bits u ₂ and u ₃ are information bits, and the second bit u ₁ is a frozen bit. It can be understood by those skilled in the art that the frozen bit determined here does not need to satisfy the constraint relationship, and the value may be a preset fixed value, and the preset fixed value may be 0.

Through the process 1) and the process 2), the process of determining the information bits and the frozen bits in the preset configuration sequence is illustrated by a specific example. For other preset construction sequences, the above method may also be used to determine the information. Bits and freeze bits, this embodiment will not be repeated here.

In this embodiment, the Polar code is constructed according to the coding constraint relationship, and then the remaining bits in the preset structure sequence are constructed, so that the frozen bit and the information bit can conform to the coding constraint relationship, and the information bits in the preset structure sequence are guaranteed. The number of sequences is the same as the length of the information bit sequence, so that the preset construction sequence can be used in the encoding and decoding process of the Polar code.

Thus, through the above-described embodiments shown in FIGS. 3 to 6, the coding constraint relationship and the rate matching pattern are obtained. It will be understood by those skilled in the art that for a receiving device as a decoding device, a decoding constraint relationship and a rate matching pattern can be obtained in the same manner, wherein the decoding constraint relationship is similar to the encoding constraint relationship. The manner in which the decoding side obtains the decoding constraint relationship and the rate matching pattern is not described in this embodiment. Those skilled in the art can understand that the encoding device can also send the encoding constraint relationship and the rate matching pattern to the receiving device after acquiring the encoding constraint relationship. Alternatively, the coding constraint relationship and the rate matching pattern may also be determined by other devices, and then the coding constraint relationship and the rate matching pattern are preset to the encoding device and the decoding device, that is, pre-agreed for both. In this embodiment, the implementation manner of obtaining the coding constraint relationship and the rate matching pattern for the encoding device and the decoding device is not particularly limited. The specific implementation of rate matching and de-rate matching is described in detail below for the rate matching pattern and coding constraint relationship that have been obtained.

FIG. 7 is a signaling flowchart of rate matching and de-rate matching provided by an embodiment of the present application. As shown in FIG. 7, the method includes:

S701. The sending device acquires a sequence to be encoded of length N according to the coding constraint relationship, and performs polarization coding on the coded sequence to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be coded, and is located at The bits of at least two constraint positions have the same value.

For convenience of explanation, the present embodiment has two coding constraint relationships (the coding constraint relationship u ₄ =u ₈ =u ₆ and the coding constraint relationship u ₅ =u ₇ ) determined by the above embodiments of FIG. 3 to FIG. 6, and FIG. 4 above. The rate matching pattern shown is taken as an example for detailed description. Where N=8, the number of matching positions is Q=3, and the length of the information bit sequence is K=4. The rate matching pattern corresponding to the coding constraint relationship of this embodiment satisfies the code rate lossless principle. Those skilled in the art can understand that for different transmission requirements, when the code rate can be less than 1, a rate matching pattern that does not satisfy the principle of loss of rate can also be used.

In a specific implementation process, the to-be-coded sequence is obtained according to the coding constraint relationship, the attribute of the first bit of each constraint position located in the coding constraint relationship, and the attribute of the second bit located outside the coding constraint relationship. Specifically, the attribute of the first bit and the attribute of the second bit can be referred to the Polar code constructed in FIG. 6 above.

Assuming that the information bits are i ₁ , i ₂ , i ₃ and i ₄ , the sequence to be encoded is obtained according to the coding constraint relationship and the Polar code shown in FIG. 6, and then the sequence to be encoded is polar coded to obtain a coded sequence. The structure of the sequence to be encoded and the sequence after encoding can be as shown in FIG. 8, where 0 represents a frozen bit and A represents 0 or 1.

S702. The sending device obtains a rate matching sequence of length M according to the matching position and the encoded sequence in the rate matching pattern, where the rate matching pattern includes multiple consecutive matching positions, and the coding bits corresponding to the matching positions in the encoded sequence are obtained. 0, N and M are integers, and M is less than N.

The rate matching pattern can be as shown in FIG. 4, and those skilled in the art can understand that the determination of the coding constraint relationship is set by the result of the matching position coding being 0, and therefore, the coded sequence corresponds to the matching position. The position code result must be 0.

After obtaining the encoded sequence, according to the matching position in the rate matching pattern, the encoded sequence is punctured or shortened to obtain a rate matching sequence of length M, which can be seen in FIG. 8.

S703. The sending device sends a rate matching sequence to the receiving device.

S704. The receiving device receives a rate matching sequence of length M transmitted by the sending device.

The sending device sends the rate matching sequence to the receiving device by using the channel, and the receiving device receives the rate matching sequence of length M transmitted by the sending device. A person skilled in the art can understand that after the rate matching sequence is transmitted through the channel, the received signal sequence received by the receiving device is soft information, and the receiving device obtains a log likelihood ratio corresponding to each bit to be decoded according to the soft information (Log likelihood). Ratio, LLR), for a receiving device, the rate matching sequence can be understood as a log likelihood ratio sequence.

S705. The receiving device performs rate de-matching on the rate matching sequence according to the rate matching pattern to obtain a sequence to be decoded with a length of N. The rate matching pattern includes multiple consecutive matching positions, where N and M are integers, and M is less than N.

S706. The receiving device decodes the sequence to be decoded according to a coding constraint relationship, to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded, and at least two constraint positions. The decoding result of the bits is the same.

After receiving the rate matching sequence, the receiving device performs rate de-matching on the rate matching sequence according to the rate matching pattern. Specifically, since the matching position in the rate matching pattern is a punctured or shortened position, that is, the bit corresponding to the matching position is a bit that is not transmitted, in the process of de-rate matching, for the puncturing operation, the pair corresponding to the matching position The number likelihood ratio is set to 0. For the shortening operation, the log likelihood ratio corresponding to the matching position is set to a relatively large value, for example, it can be set to infinity. By setting the log likelihood ratio of the matching position and combining the log likelihood ratio of the channel reception, a sequence to be decoded with a code length of N can be obtained.

Optionally, in this embodiment, since the coded bit corresponding to the matching position is 0, and it is known to both ends of the transmitting and receiving, the matching end can be shortened at the encoding end to achieve rate matching. At the decoding end, the log likelihood ratio corresponding to the matching position can be set to a relatively large value.

After the sequence to be decoded is obtained, the SC or SCL decoding method may be used, and the decoding sequence is decoded in combination with the decoding constraint relationship to obtain a decoded sequence. That is, for the same decoding constraint relationship, the decoding results of the bits located in at least two constraint positions are the same.

A detailed embodiment is used below to illustrate how to decode according to the encoding constraint relationship.

FIG. 9 is a schematic flowchart of a decoding method according to an embodiment of the present disclosure. As shown in FIG. 9, the method includes:

S901, initializing i=1;

S902. Determine whether u _i is located in a constraint bit.

S903. Determine whether u _i is an information bit.

S904. Determine whether u _j in the same decoding constraint relationship as u _i is decoded.

S905, u _{i is} set to 0, and path expansion is not performed;

S906, u _i are decoded according to information bits, and path expansion is performed;

S907, u _i =u _j , no path expansion;

S908, u _i are decoded according to information bits, and path expansion is performed;

S909. Determine whether the extended path is greater than a search width L.

S910. Select the path with the highest reliability of L;

S911, determining whether i is less than N;

S912, i=i+1;

S913. Select a path that can pass the CRC check from the L paths as a post-decoding sequence.

In Polar's SCL decoding process, the initial path is set to an empty path, all paths are expanded by

bit

0 or 1, and the path metrics are updated separately, the paths are sorted by path metrics, and the L bars with the largest path metric are retained. Path, delete the remaining paths. When the length of the path reaches the length of the mother code N, the information bit sequence corresponding to each path is output in descending order of the path metric value, and the CRC check is performed one by one for each information bit sequence in the output order. To obtain the decoded result. Where L is the search width, that is, the maximum number of saved paths, and L is greater than or equal to 1. After each path expansion, the path can be deleted according to the search width.

When the present embodiment is directed to the constraints in the decoder u _i and u _j, u _j is located before if u _i, u _i is to be coded, u _i = u _j is set, a route is not extended. In the present embodiment, for convenience of explanation, two cases will be described. One case is u ₃ = u ₄ , the path extension is shown in Figure 10A, the other is u ₃ = u ₄ , and the path extension can be as shown in Figure 10B. This embodiment provides a schematic diagram of path extension. For other path extensions, this embodiment will not be described here.

In this embodiment, decoding is performed by decoding a constraint relationship, and a reliable decoding path can be obtained, and decoding performance can be improved.

The decoding performance achieved by the embodiment of the present application will be described in detail below with reference to FIG. 11 , FIG. 12 and FIG. 13 . Specifically, the coding matching scheme based on the coding constraint relationship and the rate matching scheme of the Reverse Quasi Uniform Puncturing (RQUP) proposed in this embodiment are compared. Among them, Table 1 lists some decoding parameters:

Table I

In FIG. 11 to FIG. 13 , wherein RQUP is a decoding curve corresponding to a reverse-order quasi-uniform puncturing rate matching scheme, and Pd (Proposed, Pd for short) is a decoding curve based on a coding constraint relationship proposed by the embodiment of the present application. Improved decoding. The abscissa Eb/N0 is the bit signal to noise ratio, the ordinate is the block error ratio (BLER), R is the code rate, and K is the length of the information sequence.

As shown in FIG. 11 to FIG. 13 , for the same code rate R and the information sequence length K, when the value of the bit signal to noise ratio Eb/N0 is the same, the bit error rate corresponding to the rate matching scheme of the embodiment of the present application is significantly smaller than that of the RQUP. The bit error rate of the scheme, the embodiment of the present application has a performance gain of about 0.2 dB with respect to RQUP.

FIG. 14 is a schematic structural diagram of a sending device according to an embodiment of the present disclosure. As shown in FIG. 14, the transmitting device 140 includes an encoding module 1401, a rate matching module 1402, and a sending module 1403. Optionally, the method further includes: a relationship obtaining module 1404 and a bit attribute determining module 1405.

The encoding module 1401 is configured to obtain a sequence to be encoded with a length of N according to a coding constraint relationship, and perform polarization coding on the sequence to be encoded to obtain a coded sequence, where the coding constraint relationship is used to indicate at least a sequence to be coded. Two constraint positions, and the bits at the at least two constraint positions have the same value;

The rate matching module 1402 is configured to obtain a rate matching sequence of length M according to the matching position in the rate matching pattern and the encoded sequence, where the rate matching pattern includes multiple consecutive matching positions, and the encoding The coded bit corresponding to the matching position in the subsequent sequence is 0, the N and the M are integers, and the M is less than N;

The sending module 1403 is configured to send the rate matching sequence to the receiving device.

Optionally, the number of the coding constraint relationships is at least one, and a difference between the number of all constraint positions corresponding to the at least one coding constraint relationship and the number of the coding constraint relationships is equal to the number of the matching positions.

Optionally, the relationship obtaining module 1404 is configured to obtain a matching column from the encoding matrix according to the matching position in the rate matching pattern before acquiring the sequence to be encoded with the length N according to the encoding constraint relationship, where the matching column is obtained. The ordering in the encoding matrix is the same as the sorting position of the matching position in the rate matching pattern;

Optionally, the relationship obtaining module 1404 is further specifically configured to:

Optionally, the encoding module 1401 is specifically configured to:

Optionally, the bit attribute determining module 1404 is configured to: in accordance with the encoding constraint relationship, an attribute of a first bit located in each constraint position in the encoding constraint relationship, and a second bit located outside the encoding constraint relationship An attribute of the first bit of each constraint position in the coding constraint relationship in the preset configuration sequence before the sequence to be coded is obtained, where the preset structure sequence is the sequence to be coded Construction sequence

Optionally, the bit attribute determining module 1404 is specifically configured to:

Optionally, the bit attribute module 1404 is specifically configured to:

The sending device provided in this embodiment may be used to perform the rate matching method performed by the sending device in the foregoing method, and the implementation principle and the technical effect are similar.

FIG. 15 is a schematic structural diagram of a receiving device according to an embodiment of the present disclosure. As shown in FIG. 15, the receiving device 150 includes: a receiving module 1501, a de-rate matching module 1502, and a decoding module 1503.

The receiving module 1501 is configured to receive a rate matching sequence of length M sent by the sending device.

The rate matching module 1502 is configured to perform rate de-matching on the rate matching sequence according to the rate matching pattern to obtain a sequence to be decoded of length N, where the rate matching pattern includes multiple consecutive matching positions, and the N And said M is an integer, and said M is less than N;

The decoding module 1503 is configured to decode the to-be-decoded sequence according to a coding constraint relationship to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded. And the decoding results of the bits located at the at least two constraint positions are the same.

Optionally, the number of the coding constraint relationships is at least two, and the difference between the number of all constraint positions corresponding to at least two of the coding constraint relationships and the number of the coding constraint relationships and the matching position The number is equal.

Optionally, if the first to-be-decoded bit in the to-be-decoded sequence is located in a constraint position in the coding constraint relationship, the decoding module 1503 is specifically configured to:

The receiving device provided in this embodiment may be used to perform the de-rate matching method performed by the receiving device in the foregoing method embodiment, and the implementation principle and the technical effect are similar.

FIG. 16 is a schematic structural diagram of hardware of a sending device according to an embodiment of the present disclosure. As shown in FIG. 16, the transmitting device 160 includes: a processor 1601 and a memory 1602;

a memory 1602 for storing a computer program;

The processor 1601 is configured to execute a computer program of the memory storage to implement the rate matching method performed by the transmitting device in the foregoing embodiment. For details, refer to the related description in the foregoing method embodiments.

Alternatively, the memory 1602 can be either independent or integrated with the processor 1601.

When the memory 1602 is a device other than the processor 1601, the sending device 160 may further include:

A bus 1603 is provided for connecting the memory 1602 and the processor 1601.

The transmitting device shown in FIG. 16 may further include a transmitter 1601 for transmitting a rate matching sequence and the like.

Optionally, the relationship obtaining module, the encoding module, the rate matching module, and the bit attribute determining module described in FIG. 14 may be implemented by being integrated in the processor 1601, and the sending module may be implemented by being integrated in the transmitter 1601.

FIG. 17 is a schematic structural diagram of hardware of a receiving device according to an embodiment of the present disclosure. The receiving device 170 of this embodiment includes: a processor 1701 and a memory 1702; wherein

a memory 1702, configured to store a computer program;

The processor 1701 is configured to execute a computer program of the memory storage to implement the steps performed by the receiving device in the above embodiment. For details, refer to the related description in the foregoing method embodiments.

Alternatively, the memory 1702 can be either independent or integrated with the processor 1701.

When the memory 1702 is a device other than the processor 1701, the receiving device 170 may further include:

The bus 1703 is configured to connect the memory 1702 and the processor 1701.

The receiving device shown in FIG. 17 may further include a receiver 1704 for receiving a rate matching sequence and the like.

Alternatively, the receiving module described in FIG. 15 may be implemented in the receiver 1704, and the de-rate matching module and the decoding module may be implemented in the processor 1701.

The receiving device provided in this embodiment may be used to perform the de-rate matching method performed by the receiving device in the foregoing example, and the implementation principle and the technical effect are similar.

The embodiment of the present application further provides a storage medium, where the storage medium includes a computer program, and the computer program is used to implement an indication method of an encoding mode performed by the first device in the foregoing embodiment.

The embodiment of the present application further provides a storage medium, where the storage medium includes a computer program, and the computer program is used to implement the indication method of the encoding mode performed by the second device in the above embodiment.

The embodiment of the present application further provides a computer program product, the computer program product comprising computer program code, when the computer program code is run on a computer, causing the computer to execute the indication method of the coding mode performed by the first device.

The embodiment of the present application further provides a chip, including a memory and a processor, the memory is used to store a computer program, and the processor is configured to call and run the computer program from the memory, so that the chip is installed The communication device performs the indication method of the encoding mode performed by the first device as above.

The embodiment of the present application further provides a computer program product, the computer program product comprising computer program code, when the computer program code is run on a computer, causing the computer to execute the indication method of the coding mode performed by the second device.

The embodiment of the present application further provides a chip, including a memory and a processor, the memory is used to store a computer program, and the processor is configured to call and run the computer program from the memory, so that the chip is installed The communication device performs the indication method of the encoding mode performed by the second device as above.

In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the device embodiments described above are only illustrative. For example, the division of the modules is only a logical function division. In actual implementation, there may be another division manner. For example, multiple modules may be combined or integrated. Go to another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or module, and may be electrical, mechanical or otherwise.

The modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional module in each embodiment of the present invention may be integrated into one processing unit, or each module may exist physically separately, or two or more modules may be integrated into one unit. The unit formed by the above module can be implemented in the form of hardware or in the form of hardware plus software functional units.

The above-described integrated modules implemented in the form of software function modules can be stored in a computer readable storage medium. The software function module is stored in a storage medium, and includes a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (English: processor) to perform the embodiments of the present application. Part of the steps of the method.

It should be understood that the foregoing processor may be a central processing unit (English: Central Processing Unit, CPU for short), or may be other general-purpose processors, digital signal processors (English: Digital Signal Processor, referred to as DSP), ASICs. (English: Application Specific Integrated Circuit, ASIC for short). The general purpose processor may be a microprocessor or the processor or any conventional processor or the like. The steps of the method disclosed in connection with the invention may be directly embodied by the execution of the hardware processor or by a combination of hardware and software modules in the processor.

The memory may include high speed RAM memory, and may also include non-volatile memory NVM, such as at least one disk memory, and may also be a USB flash drive, a removable hard disk, a read only memory, a magnetic disk, or an optical disk.

The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus. The bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, the bus in the drawings of the present application is not limited to only one bus or one type of bus.

The above storage medium may be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable In addition to Programmable Read Only Memory (EPROM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Magnetic Memory, Flash Memory, Disk or Optical Disk. A storage medium may be any available media that can be accessed by a general purpose or special purpose computer.

An exemplary storage medium is coupled to the processor to enable the processor to read information from, and write information to, the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and the storage medium may be located in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the storage medium can also exist as discrete components in the electronic device or the master device.

Claims

A rate matching method for a polarization code, comprising:

Obtaining a sequence to be coded with a length of N according to a coding constraint relationship, and performing polarization coding on the sequence to be coded to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be coded, and The bits located at the at least two constraint positions have the same value;

And obtaining, according to the matching position in the rate matching pattern and the encoded sequence, a rate matching sequence of length M, wherein the rate matching pattern includes a plurality of consecutive matching positions, and the matching position in the encoded sequence Corresponding coded bits are 0, the N and the M are integers, and the M is less than N;

The rate matching sequence is sent to the receiving device.
The method according to claim 1, wherein the number of the encoding constraint relationships is at least one, and the difference between the number of all constraint positions corresponding to the at least one encoding constraint relationship and the number of the encoding constraint relationships is The number of matching locations is equal.
The method according to claim 1 or 2, wherein before the obtaining the sequence to be encoded of length N according to the coding constraint relationship, the method further comprises:

And obtaining a matching column from the encoding matrix according to the matching position in the rate matching pattern, wherein the sorting of the matching column in the encoding matrix is the same as the sorting position of the matching position in the rate matching pattern;

Acquiring a solution expression corresponding to each of the matching positions according to a preset configuration sequence and a matching column that is the same as a sorting position of each matching position, where the preset structure sequence is a constructed sequence of the sequence to be encoded, The value of the solution expression is 0;

And obtaining the coding constraint relationship according to a solution expression corresponding to each of the matching positions.
The method according to claim 3, wherein the obtaining a matching column from the coding matrix according to the matching position in the rate matching pattern comprises:

Extracting an initial matrix from the coding matrix according to a matching position in the rate matching pattern;

Gaussian elimination processing is performed on the element 1 in the initial matrix to obtain a matching matrix, and the columns in the matching matrix are the matching columns.
The method according to any one of claims 1 to 4, wherein the acquiring the sequence to be encoded of length N according to the coding constraint relationship comprises:

Obtaining the to-be-coded sequence according to the coding constraint relationship, an attribute of a first bit of each constraint position located in the coding constraint relationship, and an attribute of a second bit located outside the coding constraint relationship, where the bit The attributes are frozen bits or information bits.
The method according to claim 5, wherein said attribute according to said coding constraint relationship, said first bit of each constraint position located in said coding constraint relationship, and said parameter other than said coding constraint relationship The method of the two-bit, before acquiring the sequence to be encoded, the method further includes:

Determining an attribute of the first bit of each constraint position in the encoding constraint relationship in a preset configuration sequence, where the preset construction sequence is a constructed sequence of the sequence to be encoded;

Determining an attribute of the second bit in the preset configuration sequence, where the second bit is a bit other than the first bit in the preset configuration sequence, and the attribute of the bit is a frozen bit or information Bit.
The method according to claim 6, wherein the determining the attributes of the first bit of each constraint position in the coding constraint relationship in the preset configuration sequence comprises:

Determining, according to a preset construction method, a first information bit in the first bit corresponding to each constraint position of each of the coding constraint relationships;

Determining, in the first bit corresponding to each constraint position, a first bit other than the first information bit as a first frozen bit, wherein the value of the first frozen bit satisfies the coding constraint relationship.
The method according to claim 7, wherein the determining the attribute of the second bit in the preset configuration sequence comprises:

Determining, according to the length of the preset information bit sequence and the number of the first information bits, the number of second information bits in the second bit;

Determining, according to the preset configuration method and the number of the second information bits, the second information bit and the second frozen bit in the second bit, where the value of the second frozen bit is preset fixed value.
A method for de-rate matching of a polarization code, comprising:

Receiving a rate matching sequence of length M sent by the sending device;

The rate matching sequence is de-rate matched according to the rate matching pattern to obtain a sequence to be decoded of length N, where the rate matching pattern includes a plurality of consecutive matching positions, and the N and the M are integers. Said M is less than N;

Decoding the sequence to be decoded according to a coding constraint relationship to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded, and at least two The decoding result of the bits of the constraint position is the same.
The method according to claim 9, wherein the number of the decoding constraint relationships is at least two, and the number of all the constraint positions corresponding to at least two of the coding constraint relationships is related to the coding constraint relationship. The difference in the number is equal to the number of matching positions.
The method according to claim 9 or 10, wherein if the first to-be-decoded bit in the sequence to be decoded is located at a constraint position in the coding constraint relationship, the decoding constraint is The relationship decodes the sequence to be decoded, including:

Determining whether the second to-be-decoded bit in the same coding constraint relationship as the first to-be-decoded bit is decoded;

If yes, setting the value of the first to-be-decoded bit to be the same as the value of the second to-be-decoded bit;

If not, decoding the first to-be-decoded bit to obtain a value of the first to-be-decoded bit.
A transmitting device, comprising:

An encoding module, configured to obtain a sequence to be encoded with a length of N according to a coding constraint relationship, and perform polarization coding on the sequence to be coded to obtain a coded sequence, where the coding constraint relationship is used to indicate at least two of the sequences to be coded. Constrained positions, and the bits at the at least two constraint positions have the same value;

a rate matching module, configured to obtain a rate matching sequence of length M according to the matching position in the rate matching pattern and the encoded sequence, where the rate matching pattern includes multiple consecutive matching positions, after the encoding The coded bit corresponding to the matching position in the sequence is 0, the N and the M are integers, and the M is less than N;

And a sending module, configured to send the rate matching sequence to the receiving device.
The device according to claim 12, wherein the number of the coding constraint relationships is at least one, and the difference between the number of all constraint positions corresponding to the at least one coding constraint relationship and the number of the coding constraint relationships is The number of matching locations is equal.
The device according to claim 12 or 13, further comprising: a relationship obtaining module, configured to match the matching position in the pattern according to the rate before acquiring the sequence to be encoded of length N according to the encoding constraint relationship Obtaining a matching column in the encoding matrix, wherein the sorting of the matching column in the encoding matrix is the same as the sorting position of the matching position in the rate matching pattern;

Acquiring a solution expression corresponding to each of the matching positions according to a preset configuration sequence and a matching column that is the same as a sorting position of each matching position, where the preset structure sequence is a constructed sequence of the sequence to be encoded, The value of the solution expression is 0;

And obtaining the coding constraint relationship according to a solution expression corresponding to each of the matching positions.
The device according to claim 14, wherein the relationship obtaining module is further configured to:

Extracting an initial matrix from the coding matrix according to a matching position in the rate matching pattern;

Gaussian elimination processing is performed on the element 1 in the initial matrix to obtain a matching matrix, and the columns in the matching matrix are the matching columns.
The device according to any one of claims 12 to 15, wherein the encoding module is specifically configured to:

Obtaining the to-be-coded sequence according to the coding constraint relationship, an attribute of a first bit of each constraint position located in the coding constraint relationship, and an attribute of a second bit located outside the coding constraint relationship, where the bit The attributes are frozen bits or information bits.
The apparatus according to claim 16, further comprising: a bit attribute determining module, configured to attribute and locate the first bit of each constraint position located in said encoding constraint relationship according to said encoding constraint relationship Attributes of the second bit other than the coding constraint relationship, before acquiring the to-be-coded sequence, determining attributes of the first bit of each constraint position in the coding constraint relationship in the preset configuration sequence, a preset construction sequence is a constructed sequence of the sequence to be encoded;

Determining an attribute of the second bit in the preset configuration sequence, where the second bit is a bit other than the first bit in the preset configuration sequence, and the attribute of the bit is a frozen bit or information Bit.
The device according to claim 17, wherein the bit attribute determining module is specifically configured to:

Determining, according to a preset construction method, a first information bit in the first bit corresponding to each constraint position of each of the coding constraint relationships;

Determining, in the first bit corresponding to each constraint position, a first bit other than the first information bit as a first frozen bit, wherein the value of the first frozen bit satisfies the coding constraint relationship.
The device according to claim 18, wherein the bit attribute module is specifically configured to:

Determining, according to the length of the preset information bit sequence and the number of the first information bits, the number of second information bits in the second bit;

Determining, according to the preset configuration method and the number of the second information bits, the second information bit and the second frozen bit in the second bit, where the value of the second frozen bit is preset fixed value.
A receiving device, comprising:

a receiving module, configured to receive a rate matching sequence of length M sent by the sending device;

a rate matching module, configured to perform rate de-matching on the rate matching sequence according to the rate matching pattern, to obtain a sequence to be decoded of length N, where the rate matching pattern includes multiple consecutive matching positions, where the N and The M is an integer, and the M is less than N;

a decoding module, configured to decode the to-be-decoded sequence according to a coding constraint relationship, to obtain a decoded sequence, where the coding constraint relationship is used to indicate at least two constraint positions in the sequence to be decoded, and The decoding results of the bits located at the at least two constraint positions are the same.
The apparatus according to claim 20, wherein the number of the decoding constraint relationships is at least two, and the number of all the constraint positions corresponding to at least two of the coding constraint relationships is related to the coding constraint relationship. The difference in the number is equal to the number of matching positions.
The device according to claim 20 or 21, wherein if the first to-be-decoded bit in the sequence to be decoded is located at a constraint position in the coding constraint relationship, the decoding module is specifically used for :

Determining whether the second to-be-decoded bit in the same coding constraint relationship as the first to-be-decoded bit is decoded;

If yes, setting the value of the first to-be-decoded bit to be the same as the value of the second to-be-decoded bit;

If not, decoding the first to-be-decoded bit to obtain a value of the first to-be-decoded bit.
A transmitting device, comprising: a memory for storing a computer program, the processor for calling and running the computer program from the memory, such that the processor operates The computer program performs the rate matching method according to any one of claims 1 to 8.
A receiving device, comprising: a memory, a processor, and a computer program, wherein the computer program is stored in the memory, the processor running the computer program to perform as claimed in any one of claims 9 to The solution rate matching method described.
A storage medium, characterized in that the storage medium comprises a computer program for implementing the rate matching method according to any one of claims 1 to 8, or the computer program is used to implement The de-rate matching method according to any one of claims 9 to 11.
A computer program product, comprising: computer program code, causing a computer to perform the rate matching method according to any one of claims 1 to 8 when the computer program code is run on a computer Or, the de-rate matching method according to any one of claims 9 to 11 is performed.
A chip, comprising: a memory for storing a computer program, the processor for calling and running the computer program from the memory, such that the processor executes the claim The rate matching method according to any one of claims 1 to 8, or the de-rate matching method according to any one of claims 9 to 11.
An encoding device for performing the method of any of claims 1-8.
A decoding device for performing the method of any one of claims 9-11.