This application relates to the field of communications technologies, and in particular, to an encoding method and apparatus.
In a communications system, channel coding is usually used to improve reliability of data transmission and ensure quality of communication. Currently, a 5G mobile communications system includes three application scenarios: enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine-type communications (mMTC), and puts forward new requirements on data communication. A polar code is the first channel coding method that can be strictly proved to “reach” a channel capacity, and can be applicable to 5G communication and a future communications system.
This application provides an encoding method and apparatus.
According to a first aspect, this application provides an encoding method, including:
performing, by an encoding apparatus, CRC encoding on A to-be-encoded information bits based on a cyclic redundancy check (CRC) polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and the A to-be-encoded information bits, and L and A are positive integers, where
when L=3, the CRC polynomial is D{circumflex over ( )}3+D{circumflex over ( )}2+1;
when L=4, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}4+1;
D{circumflex over ( )}4+D{circumflex over ( )}3+1; or
D{circumflex over ( )}4+D{circumflex over ( )}2+1;
when L=5, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}5+D{circumflex over ( )}4+1;
D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}5+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1;
when L=8, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}8+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+D+1; or
when L=16, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}11+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}5+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1; and performing polar encoding on the first bit sequence.
In this encoding manner, a false alarm rate (FAR) requirement can be satisfied, and normal communication can be ensured.
In a possible design, the CRC polynomial is implemented by using a shift register.
In a possible design, the L CRC bits in the first bit sequence are located after the A to-be-encoded information bits.
In a possible design, the encoding apparatus transmits the polar-encoded first bit sequence.
In a possible design, the foregoing encoding method may be implemented by using hardware, for example, a circuit, or one or more integrated circuits. The foregoing encoding method may alternatively be implemented by using software. For example, the foregoing encoding method is performed by one or more processors by reading an instruction stored in a memory. The one or more processors may be integrated in one chip, or may be distributed in a plurality of chips. The foregoing encoding method may alternatively be partially implemented by using hardware and partially implemented by using software. For example, the processor performs the step of “performing CRC encoding on A to-be-encoded information bits based on a cyclic redundancy check (CRC) polynomial” by reading the instruction stored in the memory, and the step of “performing polar encoding on the first bit sequence” is implemented by using a logical circuit or an accelerator. Certainly, a combination of the foregoing manners may be used by a person skilled in the art in a specific implementation.
In a possible design, the encoding apparatus is a base station or a terminal.
According to a second aspect, this application provides an encoding apparatus, including:
a first encoding module, configured to perform CRC encoding on A to-be-encoded information bits based on a cyclic redundancy check (CRC) polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and the A information bits, and L and A are positive integers, where
when L=3, the CRC polynomial is D{circumflex over ( )}3+D{circumflex over ( )}2+1;
when L=4, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}4+1;
D{circumflex over ( )}4+D{circumflex over ( )}3+1; or
D{circumflex over ( )}4+D{circumflex over ( )}2+1;
when L=5, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}5+D{circumflex over ( )}4+1;
D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}5+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1;
when L=8, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}8+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+D+1; or
when L=16, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}11+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}5+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1; and
a second encoding module, configured to perform polar encoding on the first bit sequence.
In a possible, the CRC polynomial is implemented by using a shift register.
In a possible design, the L CRC bits in the first bit sequence are located after the A to-be-encoded information bits.
In a possible design, the apparatus further includes a sending module, configured to send the polar-encoded first bit sequence.
In a possible design, the apparatus is a base station or a terminal.
According to a third aspect, this application provides an encoding apparatus including a processor, and the processor is configured to:
perform CRC encoding on A to-be-encoded information bits based on a cyclic redundancy check (CRC) polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and the A information bits, and L and A are positive integers, where
when L=3, the CRC polynomial is D{circumflex over ( )}3+D{circumflex over ( )}2+1;
when L=4, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}4+1;
D{circumflex over ( )}4+D{circumflex over ( )}3+1; or
D{circumflex over ( )}4+D{circumflex over ( )}2+1;
when L=5, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}5+D{circumflex over ( )}4+1;
D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}5+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1;
when L=8, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}8+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+D+1; or
when L=16, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}11+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}5+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1; and perform polar encoding on the first bit sequence.
In a possible design, the encoding apparatus further includes a memory, and the memory is configured to store a program instruction.
In a possible design, the CRC polynomial is implemented by using a shift register.
In a possible design, the L CRC bits in the first bit sequence are located after the A to-be-encoded information bits.
In a possible design, the apparatus is a base station or a terminal.
The memory may be located inside the processor, or outside the processor. The processor may be integrated in a terminal or a base station.
The processor may be a circuit, or one or more integrated circuits or one or more special-purpose chips. The processor may alternatively be a general-purpose chip, configured to implement the encoding function when the program instruction of the encoding method is loaded to the processor. The processor may alternatively be one of or a combination of more than one of a circuit, an integrated circuit, a special-purpose chip, and a general-purpose chip.
According to a fourth aspect, this application provides an encoding apparatus, including:
an input interface, configured to obtain a to-be-encoded bit sequence;
a logical circuit, configured to perform, based on the obtained to-be-encoded bit sequence, the method provided in any one of the first aspect and the possible designs of in the first aspect, to obtain an encoded bit; and
an output interface, configured to output the encoded bit.
In a possible design, the apparatus is a base station or a terminal.
According to a fifth aspect, this application provides a communications device, including an encoding apparatus provided in any one of the third aspect and the possible designs of the third aspect and a transceiver, where the transceiver is configured to send a bit encoded by the encoding apparatus.
In a possible design, the communications device is a base station or a terminal.
According to a sixth aspect, this application provides a readable storage medium, storing a computer program, and the computer program is configured to implement the encoding method provided in any one of the first aspect and the possible designs of the first aspect.
According to a seventh aspect, this application provides a program product, where the program product includes a computer program, and the computer program is stored in a readable storage medium. At least one processor of an encoding apparatus can read the computer program from the readable storage medium. The at least one processor executes the computer program, so that the encoding apparatus implements the encoding method in any one of the first aspect and the possible designs of the first aspect.
By using the CRC polynomial provided in this application, an FAR requirement of a system can be satisfied, so that normal communication can be ensured.
A polar code is a type of linear block code, whose generator matrix is GN and encoding process is x1N=u1NGN. u1N=(u1, u2, . . . , uN) is a binary row vector, and has a length of N (namely, a code length), where GN=F2⊗(log
F2⊗(log
To further improve encoding performance of a system, an outer code with a check capability, for example, a cyclic redundancy check (CRC) code may be cascaded to a polar code. When a decoding manner such as serial cancellation list decoding is used, after the decoding is completed, survivor paths are selected based on the cyclic redundancy check to improve channel coding performance of the system. When the polar code is used to control a channel, in addition to a conventional technical indicator such as a block error rate (BLER), a false alarm rate (FAR) indicator further needs to be satisfied. For example, if a quantity of CRC bits is L, the decoding manner such as the serial cancellation list decoding is used, and after the decoding is completed, the cyclic redundancy check is used to check T paths in the survivor paths, and then the FAR is usually required to be lower than (2{circumflex over ( )}(−L+log2(T))). It is noted that, selection of a value of T does not depend on a cyclic redundancy check polynomial and a length thereof, but depends on a complexity of decoding implementation, decoding performance, and the like. In this way, it is necessary to consider how to find a suitable manner of cascading the CRC check code and the polar code based on an FAR requirement. This application focuses on determining, based on the value of L, an approximate CRC polynomial to satisfy requirements of the system, thereby ensuring normal communication.
The embodiments of this application may be applied to a wireless communications system. It should be noted that, the wireless communications system mentioned in the embodiments of this application includes but is not limited to: a long term evolution system (LTE) and three application scenarios of a next-generation 5G mobile communications system: enhanced mobile broad band (eMBB), URLLC, and massive machine-type communications (mMTC). Alternatively, the wireless communications system may be a device to device (D2D) terminal communications system, another communications system, a future communications system, or the like.
The communications apparatus in this application may be configured in a communications device, and the communications device mainly includes a network device or a terminal device. If a transmit end in this application is a network device, a receive end is a terminal device; or if a transmit end in this application is a terminal device, a receive end is a network device.
In the embodiments of this application, as shown in
Because the network device 110 or the terminal 112 can use the encoding method described in the embodiments of this application to send information or data, for ease of describing, the communications system 100 in the embodiments of this application is simplified to be a system including a transmit end 101 and a receive end 102 as shown in
The encoding process in this application generally includes: performing a CRC check on to-be-encoded information, and if necessary, performing interleaving on the CRC-checked bit sequence, and then performing polar code encoding. In addition, based on a target code length M, the encoding bit encoded by the polar code may further be subjected but not limited to one or more of rate matching, modulation, digital-to-analog conversion, frequency conversion, and the like.
This application provides an encoding method and apparatus to satisfy an FAR requirement. The method and the apparatus in this application are applicable to both a control channel and a data channel, and applicable to both an uplink and a downlink. The encoding method and apparatus provided in this application are described in detail in the following with reference to the accompanying drawings.
S101. A transmit end performs CRC encoding on A to-be-encoded information bits based on a CRC polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and the A information bits, and L and A are positive integers. L is often referred to as a CRC length.
Considering the FAR requirement, when L=3, the CRC polynomial is D{circumflex over ( )}3+D{circumflex over ( )}2+1;
when L=4, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}4+1;
D{circumflex over ( )}4+D{circumflex over ( )}3+1; or
D{circumflex over ( )}4+D{circumflex over ( )}2+1;
when L=5, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}5+D{circumflex over ( )}4+1;
D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}5+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1;
when L=8, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}8+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+D+1; or when L=16, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}11+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}5+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1.
A specific process of performing CRC encoding based on a selected polynomial is not different from existing commonly-used CRC encoding.
Specifically, after receiving the A to-be-encoded information bits, the transmit end adds the L CRC bits based on the CRC polynomial, to obtain the first bit sequence.
The A to-be-encoded information bits may be obtained by arranging to-be-sent information bits in order or in reverse order, or may be obtained after performing other processing on the information bits. This is not limited herein.
An implementation of CRC encoding is a form of a shift register. For example,
S102. The transmit end performs interleaving on the first bit sequence, to obtain a second bit sequence.
The interleaving step may be performed on some bits in the first bit sequence, or may be performed on all bits in the first bit sequence. It should be noted that, this step is an optional step, and only when locations of information bits and/or CRC check bits need to be adjusted, this step is necessary; and if unnecessary, this step can be omitted in an actual encoding process. In this case, the second bit sequence in the step S103 is the first bit sequence. A specific interleaving solution is not content of this application, and details are not described herein again.
S103. The transmit end performs polar encoding on the second bit sequence, to obtain a third bit sequence. When step S102 is omitted, this step is that the transmit end performs polar encoding on the first bit sequence, to obtain a third bit sequence.
An existing polar encoding method can be used by the transmit end to perform polar encoding on the second bit sequence. Details are not described herein again.
In S104 (no shown), the transmit end sends the third bit sequence after performing some or all of the steps, including but not limited to, rate matching, modulation, analog-to-digital conversion, and frequency conversion.
It should be noted that, the rate matching step in step S104 is optional. If an encoding code length is the same as a code length of a target code, the rate matching is not needed. Because this embodiment of the present disclosure does not focus on step S104, details are not described herein again. For example, in a possible implementation, a person skilled in the art can also refer to practices in the prior art.
In the encoding method according to this embodiment, the transmit end performs CRC encoding on the A to-be-encoded information bits based on the CRC polynomial in this application, to obtain the first bit sequence, and performs interleaving (if necessary) and polar encoding on the first bit sequence, so that after the polar code is cascaded to the CRC code, an FAR requirement can be satisfied in the used polar encoding manner.
It should be noted that after a receive end (a decoding side) receives to-be-decoded information bits, the receive end also needs to perform a CRC check based on the same CRC polynomial. Details are not described herein again.
In this embodiment of this application, a decoding operation on the decoding side generally includes: receiving a to-be-decoded sequence, and performing polar code decoding on the obtained to-be-decoded sequence based on a CRC polynomial.
Based on a same inventive concept of the encoding method shown in
Optionally, the encoding apparatus 700 may be a chip or an integrated circuit in a specific implementation.
Optionally, when the encoding method in the foregoing embodiment is partially or fully implemented by using software, as shown in
Optionally, the memory 801 may be a physically independent unit, or may be integrated with the processor 802.
Optionally, when the encoding method shown in the embodiment of
The processor 802 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.
The processor 802 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.
The memory 801 may include a volatile memory, for example, a random access memory (RAM). The memory 801 may also include a non-volatile memory, for example, a flash memory, a hard disk drive (HDD), or a solid-state drive (SSD). The memory 801 may also include a combination of the foregoing types of memories.
Based on a same inventive concept of the encoding method shown in
When L=3, the CRC polynomial is D{circumflex over ( )}3+D{circumflex over ( )}2+1;
when L=4, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}4+1;
D{circumflex over ( )}4+D{circumflex over ( )}3+1; or
D{circumflex over ( )}4+D{circumflex over ( )}2+1;
when L=5, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}5+D{circumflex over ( )}4+1;
D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}5+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1;
when L=8, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}8+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+D+1; or
when L=16, the CRC polynomial is any one of the following polynomials:
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}11+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}5+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}13+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}5+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+1;
D{circumflex over ( )}16+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}4+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}14+D{circumflex over ( )}13+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}5+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}5+D{circumflex over ( )}3+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1;
D{circumflex over ( )}16+D{circumflex over ( )}12+D{circumflex over ( )}11+D{circumflex over ( )}10+D{circumflex over ( )}9+D{circumflex over ( )}8+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}2+D+1; or
D{circumflex over ( )}16+D{circumflex over ( )}15+D{circumflex over ( )}14+D{circumflex over ( )}9+D{circumflex over ( )}7+D{circumflex over ( )}6+D{circumflex over ( )}4+D{circumflex over ( )}3+D{circumflex over ( )}2+D+1.
Generally, the CRC polynomial used for CRC encoding is implemented by using a shift register. The L CRC bits in the first bit sequence may be located after the A to-be-encoded information bits, or and may be located before the A to-be-encoded information bits, or at any location agreed on by the transmit and receive ends. The interleaving module 902 is an optional module, configured to perform interleaving on the first bit sequence to obtain a second bit sequence. The module is necessary only when a manner such as distributed CRC is needed and locations of information bits and/or CRC check bits need to be adjusted. If there is no such a need, the module can be omitted in an actual encoding process. In this case, the second bit sequence is the first bit sequence. A second encoding module 903 is configured to perform polar encoding on the second bit sequence. When there is no interleaving module 902, the second encoding module 903 is configured to perform polar encoding on the first bit sequence.
It should be noted that, modules such as a rate matching module, a modulation module, and a sending module are not drawn in
Based on a same inventive concept of the encoding method in the foregoing embodiments, as shown in
an obtaining module 1001, configured to obtain a to-be-decoded bit sequence; and
a decoding module 1002, configured to decode the to-be-decoded bit sequence according to the decoding method, and the decoding method is determined based on a CRC polynomial and a polar encoding method.
Based on a same inventive concept of the decoding method in the foregoing embodiments, as shown in
Optionally, the decoding apparatus 1100 may be a chip or an integrated circuit in a specific implementation.
Optionally, when the decoding method in the foregoing embodiments is partially or fully implemented by using software, as shown in
Optionally, the memory 1201 may be a physically independent unit, or may be integrated with the processor 1202.
Optionally, when the decoding method shown in the foregoing embodiments is implemented by using software, the decoding apparatus 1200 may include only the processor 1202. The memory 1201 configured to store the program is located outside the decoding apparatus 1200. The processor 1202 is connected to the memory 1201 by using a circuit/a cable, and configured to read and execute the program stored in the memory 1201.
The processor 1202 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and an NP.
The processor 1202 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof.
The memory 1201 may include a volatile memory, for example, a random access memory (RAM). The memory 1201 may also include a non-volatile memory, for example, a flash memory, a hard disk drive (HDD), or a solid-state drive (SSD). The memory 1201 may further include a combination of the foregoing types of memories.
An embodiment of this application further provides a network device. Referring to
Similarly, the encoding apparatus and/or the decoding apparatus may be configured in the terminal 112. In addition to the encoding apparatus and/or the decoding apparatus, the terminal 112 may further include a transceiver 1312. The bit sequence encoded by the encoding apparatus is sent by the transceiver 1312 to the network device 110 after subsequent changes or processing (including but not limited to some or all of rate matching, modulation, digital-to-analog conversion, and frequency conversion), or the transceiver 1312 is further configured to receive information/data from the network device 110. The information/data is converted into a to-be-decoded sequence after a series of processing (including but not limited to some or all of frequency conversion, digital-to-analog conversion, demodulation, and rate de-matching), and a decoded sequence is obtained after being processed by the decoding apparatus. The terminal 112 may further include an input/output interface 1314, configured to receive information input by a user. Information that needs to be sent to the network device 110 needs to be processed by an encoder and then sent to the network device 110 by using the transceiver 1312. Data that has been decoded by a decoder may also be presented to the user by using input/output interface 1314 after subsequent processing.
An embodiment of this application further provides a computer storage medium storing a computer program. The computer program is configured to execute the encoding method shown in
An embodiment of this application further provides a polar code encoding apparatus, including the encoding apparatus in any one of
An embodiment of this application further provides a computer program product including an instruction, and when the computer program product is run on a computer, the computer is enabled to perform the encoding method shown in
A person skilled in the art should understand that the embodiments of this application may be provided as a method, a system, or a computer program product. Therefore, this application may use a form of hardware only embodiments, software only embodiments, or embodiments with a combination of software and hardware. Moreover, this application may use a form of a computer program product that is implemented on one or more computer-usable storage media (including but not limited to a disk memory, a CD-ROM, an optical memory, and the like) that include computer usable program code.
This application is described with reference to the flowcharts and/or block diagrams of the method, the device (system), and the computer program product according to the embodiments of this application. It should be understood that computer program instructions may be used to implement each process and/or each block in the flowcharts and/or the block diagrams and a combination of a process and/or a block in the flowcharts and/or the block diagrams. These computer program instructions may be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor of any other programmable data processing device to generate a machine, so that the instructions executed by a computer or a processor of any other programmable data processing device generate an apparatus for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
These computer program instructions may be stored in a computer readable memory that can instruct the computer or any other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
These computer program instructions may be loaded onto a computer or another programmable data processing device, so that a series of operations and steps are performed on the computer or the another programmable device, thereby generating computer-implemented processing. Therefore, the instructions executed on the computer or the another programmable device provide steps for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
Although some preferred embodiments of this application have been described, persons skilled in the art can make changes and modifications to these embodiments once they learn the basic inventive concept. Therefore, the following claims are intended to be construed as to cover the embodiments and all changes and modifications falling within the scope of this application.
Apparently, persons skilled in the art can make various modifications and variations to the embodiments of this application without departing from the scope of the embodiments of this application. This application is intended to cover these modifications and variations provided that they fall within the scope of protection defined by the following claims and their equivalent technologies.
Number | Date | Country | Kind |
---|---|---|---|
201710806972.3 | Sep 2017 | CN | national |
201710807973.X | Sep 2017 | CN | national |
201710807981.4 | Sep 2017 | CN | national |
201710808016.9 | Sep 2017 | CN | national |
201710808042.1 | Sep 2017 | CN | national |
This application is a continuation of International Patent Application No. PCT/CN2018/103586, filed on Aug. 31, 2018, which claims priority to Chinese Patent Application No. 201710807981.4, filed on Sep. 8, 2017, Chinese Patent Application No. 201710806972.3, filed on Sep. 8, 2017, Chinese Patent Application No. 201710807973.X, filed on Sep. 8, 2017, Chinese Patent Application No. 201710808016.9, filed on Sep. 8, 2017, and Chinese Patent Application No. 201710808042.1, filed on Sep. 8, 2017. The disclosures of the aforementioned applications are hereby incorporated by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5390196 | Cecil et al. | Feb 1995 | A |
9645884 | King et al. | May 2017 | B2 |
20080320370 | Shinagawa et al. | Dec 2008 | A1 |
20090094507 | Nakase | Apr 2009 | A1 |
20130061118 | Pi et al. | Mar 2013 | A1 |
20140173376 | Jeong et al. | Jun 2014 | A1 |
20140365842 | Li et al. | Dec 2014 | A1 |
20150222295 | Li et al. | Aug 2015 | A1 |
20150340045 | Hardwick | Nov 2015 | A1 |
20150362984 | Waters | Dec 2015 | A1 |
20160079999 | Shen et al. | Mar 2016 | A1 |
20170222754 | Noh et al. | Aug 2017 | A1 |
20170366199 | Ge et al. | Dec 2017 | A1 |
20180034593 | Xu et al. | Feb 2018 | A1 |
20180287738 | Xu et al. | Oct 2018 | A1 |
Number | Date | Country |
---|---|---|
101609418 | Dec 2009 | CN |
102694625 | Sep 2012 | CN |
103138892 | Jun 2013 | CN |
103220001 | Jul 2013 | CN |
103780329 | May 2014 | CN |
104219019 | Dec 2014 | CN |
105227539 | Jan 2016 | CN |
105337696 | Feb 2016 | CN |
106817192 | Jun 2017 | CN |
106817195 | Jun 2017 | CN |
107026656 | Aug 2017 | CN |
107040262 | Aug 2017 | CN |
107124188 | Sep 2017 | CN |
107659381 | Feb 2018 | CN |
108234081 | Jun 2018 | CN |
2014092502 | Jun 2014 | WO |
2017054164 | Apr 2017 | WO |
Entry |
---|
“False-alarm rate check for Polar code with CRC,” 3GPP TSG RAN WG1 RAN1 Meeting #90, R1-1713704, Prague, Czech, Total 6 pages, 3rd Generation Partnership Project, Valbonne, France (Aug. 21-25, 2017). |
Samsung, “Design of a Nested Sequence for Polar Codes,” 3GPP TSG RAN WG1 #88bis, Spokane, WA, R1-1705425, XP51243555, total 8 pages, 3rd Generation Partnership Project Valbonne, France (Apr. 3-7, 2017). |
Huawei, HiSilicon, “CRC polynomial for L1 control information and MIB,” 3GPP TSG RAN WG1 NR Ad-Hoc#2, Qingdao, China, R1-1710471, XP51299682, total 3 pages, 3rd Generation Partnership Project Valbonne, France (Jun. 27-30, 2017). |
ZTE, “Segmentation of Polar codes for large UCI,” 3GPP TSG RAN WG1 Meeting #90, Prague, Czechia, R1-1713237, XP51328050, total 6 pages, 3rd Generation Partnership Project Valbonne, France (Aug. 21-25, 2017). |
InterDigital Inc., “On CRC Polynomial for Uplink Polar Code Construction,” 3GPP TSG RAN WG1 Meeting NR#3, Nagoya, Japan, R1-1716742, XP51353845, total 9 pages, 3rd Generation Partnership Project Valbonne, France (Sep. 18-21, 2017). |
Rivadeneira Erazo, “Early Detection using CRC Precoding and Polar Codes for Low Latency Communications,” Electronic Master''s Thesis, Montreal, Ecole de technologie superieure, total 130 pages (Jun. 2017). |
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding (Release 15),” 3GPP TS 38.212 V0.0.1, total 23 pages, 3rd Generation Partnership Project Valbonne, France (Jul. 2017). |
Number | Date | Country | |
---|---|---|---|
20200212933 A1 | Jul 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCT/CN2018/103586 | Aug 2018 | US |
Child | 16811934 | US |