Polar encoding and decoding using predefined information

Patent metadata

Field	Value
Publication number	US-2018358985-A1
Application number	US-201816001275-A
Country	US
Kind code	A1
Filing date	Jun 6, 2018
Priority date	Jun 8, 2017
Publication date	Dec 13, 2018
Grant date	—

Abstract

A method of encoding input data as a polar code includes generating unfrozen bits by adding at least one designated information bit to information bits which have been generated based on the input data, reordering the unfrozen bits and frozen bits by assigning the unfrozen bits to polarized sub-channels having higher reliability than the frozen bits having a value known to both of an encoder and a decoder, and generating a code word by polar-coding results of the reordering may be provided. The at least one designated information bit may have the value known to both the encoder and the decoder.

First claim

1 . A method of encoding input data as a polar code, the method comprising:
generating unfrozen bits by adding at least one designated information bit to information bits, which have been generated based on the input data; reordering the unfrozen bits and frozen bits by assigning the unfrozen bits to polarized sub-channels having higher reliability than the frozen bits having a value known to both of an encoder and a decoder; and generating a code word by polar-coding results of the reordering, wherein the at least one designated information bit has the value known to both the encoder and the decoder.

2 . The method of claim 1 ,
wherein a polar code tree comprises Rate-1 nodes having only the unfrozen bits as child nodes and Rate-R nodes having both the frozen bits and unfrozen bits as child nodes, and wherein the reordering comprises assigning the at least one designated information bit to a polarized sub-channel having a highest reliability among leaf nodes of the Rate-1 nodes or the Rate-R nodes.

3 . The method of claim 2 , wherein the assigning comprises assigning the at least one designated information bit to at least one leaf node having a lowest index among candidate indices associated with the Rate-1 nodes or the Rate-R nodes.

4 . The method of claim 2 , further comprising:
rate matching by puncturing or shortening the code word, wherein the assigning comprises assigning the at least one designated information bit to a polarized sub-channel, from among the polarized sub-channels, that does not correspond to punctured or shortened bit in the rate matching.

5 . The method of claim 1 ,
wherein the information bits comprise input bits and cyclic redundancy check (CRC) bits, and wherein the reordering further comprises assigning the input bits and the CRC bits to some of the polarized sub-channels to which the at least one designated information bit is not assigned.

6 . The method of claim 5 , wherein the assigning the input bits and the CRC bits comprises assigning the input bits and the CRC bits in an interleaving manner.

7 . The method of claim 5 , further comprising:
determining a number of the at least one designated information bit according to a false alarm rate and a number of the CRC bits.

8 . The method of claim 1 , further comprising:
transmitting the code word onto a physical control channel of a wireless communication system, wherein the transmitting comprises omitting transmission of wireless resource allocation information of the code word.

9 . The method of claim 1 , wherein the at least one designated information bit has a fixed value or a unique identifier of the decoder.

10 . An apparatus for encoding input data as a polar code, the apparatus comprising:
a memory configured to store computer-readable instructions; and one or more processors configured to execute the computer-readable instructions such that the one or more processors are configured to, generate a bit sequence by reordering unfrozen bits and frozen bits having a value known to both of an encoder and a decoder, based on reliability of polarized sub-channels, the unfrozen bits including at least one designated information bit and information bits based on the input data; and generate a code word by polar-coding the bit sequence.

11 . The apparatus of claim 10 , wherein the one or more processors are further configured to receive the information bits and generate the unfrozen bits by adding the at least one designated information bit to the information bits.

12 . The apparatus of claim 10 ,
wherein a polar code tree comprises Rate-1 nodes having only the unfrozen bits as child nodes and Rate-R nodes having both the frozen bits and the unfrozen bits as child nodes, and wherein the one or more processors are further configured to assign the at least one designated information bit to a polarized sub-channel having a highest reliability among leaf nodes of the Rate-1 nodes or the Rate-R nodes.

13 . (canceled)

14 . (canceled)

15 . A decoding method comprising:
receiving a code word generated by polar encoding a bit sequence; and performing list decoding of the code word by generating a list of L decoding paths in a case where L is a positive integer, wherein the bit sequence comprises unfrozen bits including input bits, cyclic redundancy check (CRC) bits, and at least one designated information bit, and frozen bits having values known to both of an encoder and a decoder, and wherein the performing comprises early terminating the list decoding of the code word based on a result of decoding the at least one designated information bit.

16 . The decoding method of claim 15 , wherein the performing comprises:
determining a type of a node based on a level of a code tree according to each of the L decoding paths; and determining early termination according to whether a value decoded by the node and a value of the at least one designated information bit are identical, in response to the type of the node corresponding to the at least one designated information bit.

17 . The decoding method of claim 16 , wherein the determining early termination comprises determining early termination of the list decoding of the code word in response to a value obtained by decoding the at least one designated information bit for all of the L decoding paths not being identical to the value of the at least one designated information bit.

18 . The decoding method of claim 16 ,
wherein the unfrozen bits comprises a plurality of designated information bits, and wherein the determining early termination comprises, determining early termination of the list decoding of the code word in response to a decoding path in which all of values obtained by decoding the plurality of designated information bits are identical to the value of the at least one designated information bit not occurring among the L decoding paths.

19 . The decoding method of claim 16 , wherein the performing further comprises performing list pruning, in response to the type of the node being an input bit.

20 . The decoding method of claim 16 , wherein the performing further comprises performing list pruning, in response to the type of the node being an unfrozen bit.

21 . The decoding method of claim 16 , wherein the performing further comprises discarding a decoding path in which a decoded value corresponding to the at least one designated information bit is not identical to the value of the at least one designated information bit.

22 . The decoding method of claim 15 , wherein the performing further comprises performing a CRC on a decoding path in response to reaching a final bit in the decoding path.

23 . (canceled)

Assignees

• Samsung Electronics Co Ltd

Inventors

• Kim Dae-Son
• Kim Min-Goo
• Kim Se-Hyoung

Classifications

• H03M13/09 Primary

  Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit · CPC title

• H03M13/15 Primary

  Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes (H03M13/17 takes precedence) · CPC title

• H03M13/2927

  Decoding strategies · CPC title

• H03M13/2792

  Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing · CPC title

• H03M13/27

  using interleaving techniques · CPC title