Polar code decoding method and decoding apparatus

Patent metadata

Field	Value
Publication number	US-2016308643-A1
Application number	US-201615191533-A
Country	US
Kind code	A1
Filing date	Jun 24, 2016
Priority date	Dec 24, 2013
Publication date	Oct 20, 2016
Grant date	—

Abstract

A method for decoding Polar codes includes: receiving a Polar code having a length of N, and dividing the Polar code into m subcodes that are coupled to each other, each subcode has a length of N/m, and each of N and m is an integer powers of 2; calculating squared Euclidean distances of input bits in the m subcodes, to obtain minimum squared Euclidean distances of the input bits that are independent of each other; obtaining, accordingly a minimum squared Euclidean distance of input bits that are coupled to each other in the m subcodes; and obtaining input bits that are in the m subcodes and that meet the independent minimum squared Euclidean distances and the combined minimum squared Euclidean distance, and obtaining a decoding result of the Polar code with reference to relationships between the m subcodes and the Polar code.

First claim

What is claimed is:

1 . A Polar code decoding apparatus, comprising:
a processor; and a non-transitory computer readable storage medium storing program codes for execution by the processor, wherein the program codes include instructions for: receiving a Polar code having a length of N, and dividing the Polar code into m subcodes that are coupled to each other, wherein each subcode has a length of N/m, and wherein each of N and m is an integer power of 2; separately calculating, for the m subcodes, squared Euclidean distances of input bits that are independent of each other in the m subcodes, to obtain minimum squared Euclidean distances of the input bits that are independent of each other in the m subcodes, wherein the minimum squared Euclidean distances of the input bits that are independent of each other in the m subcodes are collectively referred to as independent minimum squared Euclidean distances; obtaining, according to the m independent minimum squared Euclidean distances, a minimum squared Euclidean distance of input bits that are coupled to each other in the m subcodes, wherein the minimum squared Euclidean distance of the input bits that are coupled to each other in the subcodes is referred to as a combined minimum squared Euclidean distance; and obtaining input bits that are in the m subcodes and that meet the independent minimum squared Euclidean distances and the combined minimum squared Euclidean distance, and obtaining a decoding result of the Polar code with reference to relationships between the m subcodes and the Polar code.

2 . The decoding apparatus according to claim 1 , wherein separately calculating the independent minimum squared Euclidean distances comprises:
calculating the independent minimum squared Euclidean distances in parallel.

3 . The decoding apparatus according to claim 1 , wherein m is 2, 4, or 8.

4 . The decoding apparatus according to claim 3 , wherein m is 2,
wherein receiving and dividing the Polar code into m subcodes comprises:
receiving the Polar code, wherein the Polar code is expressed by a formula:

x
1
N

=



v
1
N

×

[

F

⊗

(

n
-
1

)

0

F

⊗

(

n
-
1

)

F

⊗

(

n
-
1

)

]

=



[

(

v
1

N
/
2

⊕

v

N
/
2

+
1

N

)



F

⊗

(

n
-
1

)





v

N
/
2

+
1

N



F

⊗

(

n
-
1

)

]

,

Assignees

• Huawei Tech Co Ltd

Inventors

• Li Bin
• Tong Wen
• Shen Hui
• Shi Yuchen

Classifications

• H03M13/13 Primary

  Linear codes · CPC title

• H04L1/0054 Primary

  Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms · CPC title

• H04B7/0413

  MIMO systems · CPC title

• H03M13/1105 Primary

  Decoding · CPC title

• H03M13/6502

  Reduction of hardware complexity or efficient processing · CPC title