Method and apparatus for wirelessly communicating over a noisy channel with a variable codeword length polar code to improve transmission capacity

Patent metadata

Field	Value
Publication number	US-11057053-B2
Application number	US-201916569813-A
Country	US
Kind code	B2
Filing date	Sep 13, 2019
Priority date	Sep 28, 2018
Publication date	Jul 6, 2021
Grant date	Jul 6, 2021

Abstract

Systems and methods of communicating using asymmetric polar codes are provided which overcome the codeword length constraints of systems and methods of communicating that use traditional polar codes. Used herein, asymmetric polar codes refers to a polarizing linear block code of any arbitrary length that is constructed by connecting together constituent polar codes of unequal length. Asymmetric polar codes may be known by other names. In comparison to conventional solutions for variable codeword length, asymmetric polar codes may provide more flexibility, improved performance, and/or reduced complexity of decoding, encoding, or code design. The system and method provide a flexible, universal, and well-defined coding scheme and to provide sound bit-error correction performance and low decoding latency (compared with current length-compatible methods which can be used with current hardware designs). For the most part, the provided embodiments can be implemented with nearly all available current encoding/decoding polar code techniques.

First claim

The invention claimed is:

1. A method comprising:
obtaining an input bit sequence containing N 1 +N 2 bits, the input bit sequence including information bits and frozen bits, where N 1 and N 2 are different powers of a polar code kernel size;
polar encoding N 1 bits of the input bit sequence with a first constituent polar encoder to produce a first set of N 1 polar encoded bits;
polar encoding N 2 bits of the input bit sequence with a second constituent polar encoder to produce a second set of N 2 polar encoded bits;
after the encoding the N 1 bits and the encoding the N 2 bits, combining at least some of the first set of N 1 polar encoded bits with at least some of the second set of N 2 polar encoded bits with a first additional polarizing stage to produce a set of N 1 combined bits; and
generating an asymmetric polar encoded codeword of length N 1 +N 2 consisting of the set of N 1 combined bits and the second set of N 2 polar encoded bits.

2. The method of claim 1 ,
wherein the polar encoding the N 1 bits, the polar encoding the N 2 bits, the combining the N 1 polar encoded bits with N 1 of the N 2 polar encoded bits, and the generating the asymmetric polar encoded codeword comprise multiplying the input bit sequence by a generator matrix.

3. The method of claim 1 further comprising:
transmitting the asymmetric polar encoded codeword over a wireless channel.

4. The method of claim 1 further comprising:
transmitting the N 2 polar encoded bits;
receiving feedback from which it can be concluded that the N 2 polar encoded bits were not decoded successfully; and
in response to receiving the feedback, transmitting the set of N 1 combined bits.

5. The method of claim 1 wherein N 1 <N 2 , and the first additional polarization stage is the same as a last set of connections and XOR operations of a polar code encoder of a size K N 1+1 , where K is a size of a polar code kernel, such that the set of N 1 combined bits is based on the N 1 polar encoded bits and N 1 of the N 2 polar encoded bits.

6. The method of claim 1 wherein N 1 >N 2 , and the first additional polarization stage includes part of a last set of connections and XOR operations of a polar code encoder of a size K N 1+1 , where K is a size of a polar code kernel, such that the set of N 1 combined bits includes N 2 of the N 1 polar encoded bits combined with the N 2 polar encoded bits and includes remaining N 1 −N 2 of the N 2 polar encoded bits.

7. The method of claim 1 comprising:
encoding N A input bits with a length asymmetric N A polar code encoder by:
for each of a plurality of p subsets of the input bits having lengths N 0 , N 1 , . . . , N p−1 , which sum to N A , where p>=3, polar code encoding the subset with a respective constituent polar code encoder; and
linking together the outputs of the constituent polar code encoders recursively with additional polarizing stages such that each constituent polar code N i is linked with the next constituent code N i+1 in sequence for i=0, 1, . . . , p−2, wherein the additional polarizing stage used for linking in each iteration is the same XOR transform which is used for last stage of an Arikan polar code of length 2N i+1 ,
wherein the subsets consist of a first subset containing the N 1 bits, and a subset containing the N 2 bits and p−2 further subsets,
wherein the constituent polar code encoders consist of the first constituent polar code encoder, the second constituent polar code encoder and p−2 further constituent polar code encoders, and
wherein the additional polarization stages are inclusive of the first additional polarization stage and p−2 further additional polarization stages.

8. The method of claim 1 further comprising:
adapting a value N A , where N A =N 1 +N 2 based on feedback.

9. The method of claim 1 , wherein N 1 is less than N 2 , the combining comprises:
inputting the first set of N 1 polar encoded bits and N 1 of the second set of N 2 polar encoded bits to the first additional polarizing stage to produce the set of N 1 combined bits.

10. A method comprising:
encoding an input vector with an original polar code encoder to produce an initial codeword, wherein the original polar code encoder is an asymmetric polar code encoder for an asymmetric polar encoded codeword;
transmitting the initial codeword to a receiving device;
receiving, from the receiving device, feedback from which it can be concluded that the initial codeword was not decoded successfully;
after the receiving the feedback, generating an extended input vector by extending the input vector to include an extension vector that comprises at least one redundancy bit;
after the generating, encoding the extended input vector with an additional asymmetric polar code encoder based on a combination of the original polar code encoder, a further polar code encoder having a size equal to the size of the extension vector, and a further polarizing stage that links outputs of the original polar code encoder and the further polar code encoder; and
transmitting an output of the further polarizing stage.

11. An apparatus comprising:
an input interface that obtains an input bit sequence containing N 1 +N 2 bits including information bits and frozen bits, where N 1 and N 2 are different powers of a polar code kernel size;
a first polar code encoder that polar encodes N 1 bits of the input bit sequence with a first constituent polar encoder to produce a first set of N 1 polar encoded bits;
a second polar code encoder that polar encodes N 2 bits of the input bit sequence with a second constituent polar encoder, to produce a second set of N 2 polar encoded bits;
a first additional polarizing stage that combines at least some of the first set of N 1 polar encoded bits with at least some of the second set of N 2 polar encoded bits to produce a set of N1 combined bits after the first set of N 1 polar encoded bits and the second set of N 2 polar encoded bits are produced;
a codeword generator that generates an asymmetric polar encoded codeword of length N 1 +N 2 consisting of the set of N 1 combined bits and the N 2 polar encoded bits; and
a transmitter that transmits the asymmetric polar encoded codeword over a wireless channel.

12. The apparatus of claim 11 wherein the transmitter transmits the asymmetric polar encoded codeword by:
transmitting the N 2 polar encoded bits;
receiving feedback from which it can be concluded that the N 2 polar encoded bits were not decoded successfully; and
in response to receiving the feedback, transmitting the set of N 1 combined bits.

13. The apparatus of claim 11 wherein N 1 <N 2 , and the first additional polarization stage is the same as a last set of connections and XOR operations of a polar code encoder of a size K N 1+1 , where K is a size of a polar code kernel, such that the set of N 1 combined bits is based on the N 1 polar encoded bits and N 1 of the N 2 polar encoded bits.

14. The apparatus of claim 10 wherein N 1 >N 2 , and the first additional polarization stage includes part of a last set of connections and XOR operations of a polar code encoder of a size K N 1+1 , where K is a size of a polar code kernel, such that the set of N 1 combined bits includes N 2 of the N 1 polar encoded bits combined with the N 2 polar encoded bits and includes remaining N 1 −N 2 of the N 2 polar encoded bits.

15. An apparatus comprising:
an original polar code encoder that encodes an input vector to produce an initial codeword, wherein the original polar code encoder is an asymmetric polar

Assignees

• Huawei Tech Co Ltd
• The Royal Institution For The Advancement Of Learning/Mcgill Univ

Inventors

• Gross Warren Jeffrey
• Cavatassi Adam Christian
• Tonnellier Thibaud
• Ge Yiqun

Classifications

• H03M13/2906

  using block codes (H03M13/2957 takes precedence) · CPC title

• H03M13/13 Primary

  Linear codes · CPC title

• H03M13/616

  Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations · CPC title

• H03M13/39

  Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes · CPC title

• H03M13/6362

  by puncturing · CPC title