IP Library › Granted Patent US 12,425,050
Granted Patent B2
US 12,425,050 · App. 18/563,160 · Granted Sep 23, 2025

Method and apparatus for encoding and decoding signal in wireless communication system, and system for providing same

Inventors: Kwonjong Lee (Suwon-si, KR); Juho Lee (Suwon-si, KR); Sanghyo Kim (Suwon-si, KR); Seunghyun Lee (Suwon-si, KR); Minyoung Chung (Suwon-si, KR); Hyosang Ju (Suwon-si, KR); Jisang Park (Suwon-si, KR)
Assignees: Samsung Electronics Co., Ltd.; RESEARCH & BUSINESS FOUNDATION SUNGKYUNKWAN UNIVERSITY
H03M13/13H03M13/09H03M13/2906H03M13/45
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,425,050
App. No.
18/563,160
Granted
Sep 23, 2025
Kind
B2
Abstract

The present disclosure relates to a 5G or 6G communication system for supporting a higher data transmission rate. An encoding method using a polar code in a wireless communication system, according to an embodiment of the present disclosure, may comprise: generating first cyclic redundancy check (CRC) bits for a plurality of information bits to be transmitted, by the number of second bits that is less than the number of first bits determined so as to add a CRC code with respect to the plurality of information bits; for vulnerable bits from among the plurality of information bits to be transmitted, generating second CRC bits as many as bits corresponding to a difference between the number of first bits and the number of second bits; generating first encoded bits in which the information bits, the first CRC bits, and the second CRC bits are concatenated; and polar-encoding the first encoded bits.

Claims (28)

1. An encoding method using polar codes in a communication system, the encoding method comprising:

identifying K+1 bit indexes including K information bit indexes to be transmitted and 1 cyclic redundancy check (CRC) bit indexes;

identifying weak bit indexes among the K+1 bit indexes based on row weights corresponding to the K+1 bit indexes and polarization reliabilities corresponding to the K+1 bit indexes, wherein in case that a minimum row weight is less than a first threshold, the identified weak bit indexes include at least one weak bit index corresponding to the minimum row weight, at least one weak bit index corresponding to a next minimum row weight, and at least one weak bit index corresponding to a polarization reliability equal to or less than a second threshold;

generating 1 CRC bits for weak bits corresponding to the identified weak bit indexes, wherein the 1 CRC bits correspond to the 1 CRC bit indexes;

generating bits including K information bits and the 1 CRC bits that are concatenated, wherein the K information bits correspond to the K information bit indexes; and

performing polar-encoding on the generated bits.

2. The encoding method of claim 1 , wherein generating the bits comprises:

generating 1′ CRC bits for the K information bits; and

generating the bits including the K information bits, the 1′ CRC bits and the 1 CRC bits.

3. The encoding method of claim 1 , wherein the first threshold is log 2 N, wherein N is a number of generated bits.

4. The encoding method of claim 1 , wherein in case that the minimum row weight is equal to or higher than the first threshold, the identified weak bit indexes include the at least one weak bit index corresponding to the minimum row weight and the at least one weak bit index corresponding to the polarization reliability equal to or less than the second threshold.

5. The encoding method of claim 1 , further comprising:

transmitting information on the weak bit indexes in response to reception of an inquiry about a protection area associated with the 1 CRC bits.

6. An encoding apparatus comprising:

a memory;

a transceiver; and

a processor coupled with the memory and the transceiver, wherein the processor is configured to:

identify K+1 bit indexes including K information bit indexes to be transmitted and 1 cyclic redundancy check (CRC) bit indexes,

identify weak bit indexes among the K+1 bit indexes based on row weights corresponding to the K+1 bit indexes and polarization reliabilities corresponding to the K+1 bit indexes, wherein in case that a minimum row weight is less than a first threshold, the identified weak bit indexes include at least one weak bit index corresponding to the minimum row weight, at least one weak bit index corresponding to a next minimum row weight, and at least one weak bit index corresponding to a polarization reliability equal to or less than a second threshold,

generate 1 CRC bits for weak bits corresponding to the identified weak bit indexes, wherein the 1 CRC bits correspond to the 1 CRC bit indexes,

generate bits including K information bits and the 1 CRC bits that are concatenated, wherein the K information bits correspond to the K information bit indexes, and

perform polar-encoding on the generated bits.

7. The encoding apparatus of claim 6 , wherein the processor is further configured to:

generate 1′ CRC bits for the K information bits, and

generate the bits including the K information bits, the 1′ CRC bits and the 1 CRC bits.

8. The encoding apparatus of claim 6 , wherein the first threshold is log 2 N, wherein N is a number of generated bits.

9. The encoding apparatus of claim 8 , wherein in case that the minimum row weight is equal to or higher than the first threshold, the identified weak bit indexes include the at least one weak bit index corresponding to the minimum row weight and the at least one weak bit index corresponding to the polarization reliability equal to or less than the second threshold.

10. The encoding apparatus of claim 8 , wherein the processor is further configured to transmit information on the weak bit indexes in response to reception of an inquiry about a protection area associated with the I CRC bits.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 21, 2023
From: LEE, KWONJONG; LEE, JUHO; KIM, SANGHYO; LEE, SEUNGHYUN; CHUNG, MINYOUNG; JU, HYOSANG; PARK, JISANG
To: SAMSUNG ELECTRONICS CO., LTD.; RESEARCH & BUSINESS FOUNDATION SUNGKYUNKWAN UNIVERSITY
Reel/Frame 065637/0631 →
Priority Claims (1)
KR 10-2021-0066202 · May 24, 2021 · national
Continuity (1)
Related Publication 20240267057A1 · Aug 8, 2024
References Cited (21)
US 8458549B2 · Furusawa et al. · 2013 [cited by applicant]
US 9287896B2 · Seo et al. · 2016 [cited by applicant]
US 9525513B2 · Pi et al. · 2016 [cited by applicant]
US 10142060B2 · Xu · 2018 [cited by examiner]
US 20170214416A1 · Ge · 2017 [cited by examiner]
US 20180287738A1 · Xu · 2018 [cited by examiner]
US 20200076535A1 · Xu et al. · 2020 [cited by applicant]
US 20220393791A1 · Lee et al. · 2022 [cited by applicant]
JP 2012120217A · 2012 [cited by applicant]
KR 1020090026238A · 2009 [cited by applicant]
KR 1020100063032A · 2010 [cited by applicant]
KR 1020190093582A · 2019 [cited by applicant]
KR 1020220157146A · 2022 [cited by applicant]
K. Niu and K. Chen, CRC-aided Decoding of Polar Codes, in IEEE Commun. Lett., vol. 16, No. 10, pp. 1668-1671, Oct. 2012, Sep. 7, 2012. [cited by applicant]
[Guo15] J. Guo et al., Multi-CRC Polar Codes and Their Applications, in IEEE Commun. Lett., vol. 20, issue: 2, pp. 212-215, Feb. 2016, Dec. 11, 2015. [cited by applicant]
[Kim17] J. Kim, S. Kim, J. Jang, Y. Kim, Low Complexity List Decoding for Polar Codes with Multiple CRC Codes, in MDPI Entropy, vol. 19, issue: 4, Feb. 2017, Apr. 24, 2017. [cited by applicant]
Z. Qingshaung, L. Aijun, P. Xiaofei, Efficient CRC Concatenation Scheme for Polar Codes, in IEEE Elec. Lett., vol. 53, issue: 13, Jun. 2017, Jun. 1, 2017. [cited by applicant]
[Mori09] R. Mori and T. Tanaka, Performance of polar codes with the construction using density evolution, in IEEE Commun. Lett., vol. 13, No. 7, pp. 519-521, Jul. 2009, Jul. 21, 2009. [cited by applicant]
[Trifonov12] P. Trifonov, Efficient design and decoding of polar codes, in IEEE Trans. Commun., vol. 60, No. 11, pp. 3221-3227, Nov. 2012, Aug. 22, 2012. [cited by applicant]
[He17] G. He et al., β-expansion: A theoretical framework for fast and recursive construction of polar codes, in Proc. IEEE Globecom, Singapore, Dec. 2017, Jan. 15, 2018. [cited by applicant]
International Search Report dated Aug. 31, 2022, issued in International Application No. PCT/KR2022/007352. [cited by applicant]