# US 2022/0278772 A1 · Method and apparatus for decoding polar code in communication and broadcasting system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0278772 A1
- Document ID: US20220278772A1
- Status: Published application
- Kind: A1
- Application number: 17/749,854
- Filed: 2022-05-20
- Published: 2022-09-01
- Earliest claimed: 2019-11-29
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Min JANG; Hyuntack LIM
- Web page: https://patentgrep.com/patent/US20220278772A1

## CPC

- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H04L 1/0061: {Error detection codes}
- H03M 13/091: {Parallel or block-wise CRC computation}
- H03M 13/13: Linear codes
- H03M 13/3776: {using a re-encoding step during the decoding process}
- H03M 13/611: {Specific encoding aspects, e.g. encoding by means of decoding}
- H04L 1/0054: {Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The disclosure proposes a technique for achieving validity decision performance of a suitable level in communication and broadcasting systems using a polar code. The polar code is a channel code in which it is difficult to use a syndrome check due to a successive cancellation (SC)-based decoding operation and coding structure. Accordingly, in the communication of the related art and broadcasting systems using the polar code, a validity check of a decoding result has been performed by using a path-metric (PM) generated during decoding and a concatenated error detection code, such as a cyclic redundancy check (CRC) code. However, it is difficult to achieve target error detection performance only via such methods when the length of the CRC code is short or when input and output lengths of a code are short. In this regard, an embodiment of the disclosure proposes a method for obtaining a Euclidean distance-based metric between a received signal and a decoded signal by using an estimated codeword output bit sequence, and performing post error detection based on this.

## Claims

### Claim 1

A method performed by a receiving end in a wireless communication system, the method comprising:
receiving a signal from a transmitting end;
performing successive cancellation (SC) decoding, based on a log-likelihood ratio (LLR) sequence obtained from the received signal;
obtaining an estimated codeword bit sequence by re-encoding an encoding input bit sequence obtained through the decoding;
obtaining a decision metric, based on the estimated codeword bit sequence and the LLR sequence; and
deciding whether the decoding is successful, based on the obtained decision metric.

### Claim 2 (depends on 1)

The method of claim 1, wherein the obtaining of the estimated codeword bit sequence by re-encoding the estimated encoding input bit sequence through the decoding comprises:
obtaining a code parameter and a code configuration; and
obtaining the estimated encoding input bit sequence, based on the obtained code parameter and code configuration.

### Claim 3 (depends on 1)

The method of claim 1, further comprising performing the SC decoding based on the LLR sequence to obtain a cyclic redundancy check (CRC) result and a path metric.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
deciding whether the CRC result is a success; and
determining that the decoding fails if the CRC result is a failure.

### Claim 5 (depends on 1)

The method of claim 1, wherein the decision metric is obtained based on the equation of:
τ
=
∑
i
=
0
E
-
1
⁢
(
-
1
)
c
^
i
⁢
l
i
,
where τ denotes a decision metric, E denotes a codeword length, ĉi denotes an i-th bit of the estimated codeword bit sequence, and li denotes an i-th bit of the LLR sequence.

### Claim 6 (depends on 1)

The method of claim 1, wherein the decision metric is obtained based on the equation of:
τ=Σi∈χ(−1){circumflex over (x)}i·l′i,
where τ denotes a decision metric, {circumflex over (x)}i denotes an i-th bit of the estimated codeword sequence before performing rate-matching, l′i denotes an i-th bit of the LLR sequence obtained by performing rate-dematching, and χ denotes an index set of bits actually transmitted using the rate-matching in the estimated codeword sequence before the rate-matching is performed.

### Claim 7 (depends on 1)

The method of claim 1, wherein the deciding of whether the decoding is successful, based on the decision metric, comprises determining that the decoding is successful if the decision metric is greater than a predetermined value.

### Claim 8

A receiving end in a wireless communication system, the receiving end comprising:
at least one processor;
a memory; and
a transceiver including a decoding unit,
wherein the transceiver is configured to:
receive a signal from a transmitting end,
perform successive cancellation (SC) decoding, based on a log-likelihood ratio (LLR) sequence obtained from the received signal,
obtain an estimated codeword bit sequence by re-encoding an encoding input bit sequence obtained through the decoding,
obtain a decision metric, based on the estimated codeword bit sequence and the LLR sequence; and
decide whether the decoding is successful, based on the obtained decision metric.

### Claim 9 (depends on 8)

The receiving end of claim 8, wherein in order to obtain the estimated codeword bit sequence by re-encoding the estimated encoding input bit sequence through the decoding, the transceiver is further configured to:
obtain a code parameter and a code configuration, and
obtain the estimated encoding input bit sequence, based on the obtained code parameter and code configuration.

### Claim 10 (depends on 8)

The receiving end of claim 8, wherein the transceiver is further configured to perform the SC decoding based on the LLR sequence to obtain a cyclic redundancy check (CRC) result and a path metric.

### Claim 11 (depends on 10)

The receiving end of claim 10, wherein the transceiver is further configured to:
decide whether the CRC result is a success, and
determine that the decoding fails if the CRC result is a failure.

### Claim 12 (depends on 8)

The receiving end of claim 8, wherein the decision metric is obtained based on the equation of:
τ
=
∑
i
=
0
E
-
1
⁢
(
-
1
)
c
^
i
⁢
l
i
where τ denotes a decision metric, E denotes a codeword length, ĉi denotes an i-th bit of the estimated codeword bit sequence, and li denotes an i-th bit of the LLR sequence.

### Claim 13 (depends on 8)

The receiving end of claim 8, wherein the decision metric is obtained based on the equation of:
τ=Σi∈χ(−1){circumflex over (x)}i·l′i,
where τ denotes a decision metric, {circumflex over (x)}i denotes an i-th bit of the estimated codeword sequence before performing rate-matching, l′i denotes an i-th bit of the LLR sequence obtained by performing rate-dematching, and χ denotes an index set of bits actually transmitted using the rate-matching in the estimated codeword sequence before the rate-matching is performed.

### Claim 14 (depends on 8)

The receiving end of claim 8, wherein the transceiver is further configured to determine that the decoding is successful if the decision metric is greater than a predetermined value.

### Claim 15 (depends on 14)

The receiving end of claim 14, wherein, if it is determined that the decoding is successful, the transceiver is further configured to:
output an estimated encoding input bit sequence and the estimated codeword bit sequence, and
report the decoding success.

### Claim 16

At least one non-transitory computer readable storage medium configured to store one or more computer programs including instructions that, when executed by at least one processor, cause the at least one processor to control to:
receive a signal from a transmitting end,
perform successive cancellation (SC) decoding, based on a log-likelihood ratio (LLR) sequence obtained from the received signal,
obtain an estimated codeword bit sequence by re-encoding an encoding input bit sequence obtained through the decoding,
obtain a decision metric, based on the estimated codeword bit sequence and the LLR sequence; and
decide whether the decoding is successful, based on the obtained decision metric.
