IP Library Granted Patent US 12,267,165
Granted Patent B2
US 12,267,165 · App. 18/645,817 · Granted Apr 1, 2025

Polar coding systems, procedures, and signaling

Inventors: Chunxuan Ye (San Diego, CA); Fengjun Xi (San Diego, CA); Sungkwon Hong (Seoul, KR); Kyle Jung-Lin Pan (Saint James, NY); Robert L. Olesen (Huntington, NY)
Assignee: InterDigital Patent Holdings, Inc.
H04L1/0071H03M13/05H03M13/13H03M13/27H03M13/2778H03M13/2792H03M13/2906H03M13/618H03M13/6306H03M13/6356H03M13/6362H03M13/6368H04L1/0041H04L1/0057H04L1/0067
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,267,165
App. No.
18/645,817
Granted
Apr 1, 2025
Kind
B2
Abstract

Systems, methods, and instrumentalities are disclosed for interleaving coded bits. A wireless transmit/receive unit (WTRU) may generate a plurality of polar encoded bits using polar encoding. The WTRU may divide the plurality of polar encoded bits into sub-blocks of equal size in a sequential manner. The WTRU may apply sub-block wise interleaving to the sub-blocks using an interleaver pattern. The sub-blocks associated with a subset of the sub-blocks may be interleaved, and sub-blocks associated with another subset of the sub-blocks may not be interleaved. The sub-block wise interleaving may include applying interleaving across the sub-blocks without interleaving bits associated with each of the sub-blocks. The WTRU may concatenate bits from each of the interleaved sub-blocks to generate interleaved bits, and store the interleaved bits associated with the interleaved sub-blocks in a circular buffer. The WTRU may select a plurality of bits for transmission from the interleaved bits.

Claims (68)

1. A method implemented by a wireless transmit/receive unit (WTRU), the method comprising:

generating a first plurality of uplink control information (UCI) bits to be transmitted in a first codeword;

applying a first polar code to the first UCI bits, wherein a first mother code length associated with the first polar code is determined based on a first codeword length for transmission of the first UCI bits, and wherein the first mother code length is less than the first codeword length;

performing rate matching on the first polar coded UCI bits using a repetition scheme;

transmitting the first rate matched, polar coded UCI bits;

generating a second plurality of uplink control information (UCI) bits to be transmitted in a second codeword;

applying a second polar code to the second UCI bits, wherein a second mother code length associated with the second polar code is determined based on a second codeword length for transmission of the second UCI bits, and wherein the second mother code length is greater than the second codeword length;

performing rate matching on the second polar coded UCI bits using a puncturing scheme based on a code rate for the second codeword being less than a threshold;

transmitting the second rate matched, polar coded UCI bits;

generating a third plurality of uplink control information (UCI) bits to be transmitted in a third codeword;

applying a third polar code to the third UCI bits, wherein a third mother code length associated with the third polar code is determined based on a third codeword length for transmission of the third UCI bits, and wherein the third mother code length is greater than the third codeword length;

performing rate matching on the third polar coded UCI bits using a shortening scheme based on a code rate for the third codeword is greater than the threshold; and

transmitting the third rate matched, polar coded UCI bits.

2. The method of claim 1 , wherein the second mother code length is determined based on the code rate for the second codeword and the third mother code length is determined based on the code rate for the third codeword.

3. The method of claim 1 , wherein the first codeword comprises a first plurality of cyclic redundancy check (CRC) bits, the second codeword comprises a second plurality of CRC bits, and the third codeword comprises a third plurality of CRC bits.

4. The method of claim 1 , wherein the code rate for the second codeword corresponds to a first number of UCI bits and a first number of cyclic redundancy check (CRC) bits in the second codeword divided by a first number of coded bits in the second codeword; and

wherein the code rate for the third codeword corresponds to a second number of UCI bits and a second number of CRC bits in the third codeword divided by a second number of coded bits in the third codeword.

5. The method of claim 1 , wherein the first polar code comprises a first concatenated polar code, the second polar code comprises a second concatenated polar code, and the third polar code comprises a third concatenated polar code.

6. The method of claim 5 , further comprising performing the rate matching on the first concatenated polar code, the second concatenated polar code, and the third concatenated polar code.

7. A wireless transmit/receive unit (WTRU), comprising a processor and a memory, the processor and the memory configured to:

generate a first plurality of uplink control information (UCI) bits to be transmitted in a first codeword;

apply a first polar code to the first UCI bits, wherein a first mother code length associated with the first polar code is determined based on a first codeword length for transmission of the first UCI bits, and wherein the first mother code length is less than the first codeword length;

perform rate matching on the first polar coded UCI bits using a repetition scheme;

transmit the first rate matched, polar coded UCI bits;

generate a second plurality of uplink control information (UCI) bits to be transmitted in a second codeword;

apply a second polar code to the second UCI bits, wherein a second mother code length associated with the second polar code is determined based on a second codeword length for transmission of the second UCI bits, and wherein the second mother code length is greater than the second codeword length;

perform rate matching on the second polar coded UCI bits using a puncturing scheme based on a code rate for the second codeword being less than a threshold;

transmit the second rate matched, polar coded UCI bits;

generate a third plurality of uplink control information (UCI) bits to be transmitted in a third codeword;

apply a third polar code to the third UCI bits, wherein a third mother code length associated with the third polar code is determined based on a third codeword length for transmission of the third UCI bits, and wherein the third mother code length is greater than the third codeword length;

perform rate matching on the third polar coded UCI bits using a shortening scheme based on a code rate for the third codeword is greater than the threshold; and

transmit the third rate matched, polar coded UCI bits.

8. The WTRU of claim 7 , wherein the second mother code length is determined based on the code rate for the second codeword and the third mother code length is determined based on the code rate for the third codeword.

9. The WTRU of claim 7 , wherein the first codeword comprises a first plurality of cyclic redundancy check (CRC) bits, the second codeword comprises a second plurality of CRC bits, and the third codeword comprises a third plurality of CRC bits.

10. The WTRU of claim 7 , wherein the code rate for the second codeword corresponds to a first number of UCI bits and a first number of cyclic redundancy check (CRC) bits in the second codeword divided by a first number of coded bits in the second codeword; and

wherein the code rate for the third codeword corresponds to a second number of UCI bits and a second number of CRC bits in the third codeword divided by a second number of coded bits in the third codeword.

11. The WTRU of claim 7 , wherein the first polar code comprises a first concatenated polar code, the second polar code comprises a second concatenated polar code, and the third polar code comprises a third concatenated polar code.

12. The WTRU of claim 11 , wherein the processor and the memory are further configured to:

perform the rate matching on the first concatenated polar code, the second concatenated polar code, and the third concatenated polar code.

13. At least one computer-readable medium having stored thereon instructions that, when executed by a processor, are configured to cause the processor to:

generate a first plurality of uplink control information (UCI) bits to be transmitted in a first codeword;

apply a first polar code to the first UCI bits, wherein a first mother code length associated with the first polar code is determined based on a first codeword length for transmission of the first UCI bits, and wherein the first mother code length is less than the first codeword length;

perform rate matching on the first polar coded UCI bits using a repetition scheme;

transmit the first rate matched, polar coded UCI bits;

generate a second plurality of uplink control information (UCI) bits to be transmitted in a second codeword;

apply a second polar code to the second UCI bits, wherein a second mother code length associated with the second polar code is determined based on a second codeword length for transmission of the second UCI bits, and wherein the second mother code length is greater than the second codeword length;

perform rate matching on the second polar coded UCI bits using a puncturing scheme based on a code rate for the second codeword being less than a threshold;

transmit the second rate matched, polar coded UCI bits;

generate a third plurality of uplink control information (UCI) bits to be transmitted in a third codeword;

apply a third polar code to the third UCI bits, wherein a third mother code length associated with the third polar code is determined based on a third codeword length for transmission of the third UCI bits, and wherein the third mother code length is greater than the third codeword length;

perform rate matching on the third polar coded UCI bits using a shortening scheme based on a code rate for the third codeword is greater than the threshold; and

transmit the third rate matched, polar coded UCI bits.

14. The at least one computer-readable medium of claim 13 , wherein the instructions, when executed, are further configured to cause the processor to:

determine the second mother code length based on the code rate for the second codeword; and

determine the third mother code length based on the code rate for the third codeword.

15. The at least one computer-readable medium of claim 13 , wherein the instructions, when executed, are further configured to cause the processor to:

apply a first polar code to the first UCI bits, wherein the first mother code length associated with the first polar code is determined based on a first codeword length, wherein the first codeword comprises a first plurality of cyclic redundancy check (CRC) bits;

apply a second polar code to the second UCI bits, wherein the second mother code length associated with the second polar code is determined based on the second codeword length, wherein the second codeword comprises a second plurality of CRC bits; and

apply a third polar code to the third UCI bits, wherein the third mother code length associated with the third polar code is determined based on the third codeword length, wherein the third codeword comprises a third plurality of CRC bits.

16. The at least one computer-readable medium of claim 13 , wherein the instructions, when executed, are further configured to cause the processor to:

perform rate matching on the second polar coded UCI bits, wherein the code rate for the second codeword corresponds to a first number of UCI bits and a first number of cyclic redundancy check (CRC) bits in the second codeword divided by a first number of coded bits in the second codeword; and

perform rate matching on the third polar coded UCI bits, wherein the code rate for the third codeword corresponds to a second number of UCI bits and a second number of CRC bits in the third codeword divided by a second number of coded bits in the third codeword.

17. The at least one computer-readable medium of claim 13 , wherein the instructions, when executed, are further configured to cause the processor to:

apply a first polar code to the first UCI bits, wherein the first polar code comprises a first concatenated polar code

apply a second polar code to the second UCI bits, wherein the second polar code comprises a second concatenated polar code; and

apply a third polar code to the third UCI bits, wherein the third polar code comprises a third concatenated polar code.

18. The at least one computer-readable medium of claim 17 , wherein the instructions, when executed, are further configured to cause the processor to:

perform the rate matching on the first concatenated polar code, the second concatenated polar code, and the third concatenated polar code.

Continuity (10)
Continuation 18143394 · May 4, 2023
Continuation 17746795 · May 17, 2022
Continuation 17350054 · Jun 17, 2021
Continuation 16494666
Provisional Application 62556104 · Sep 8, 2017
Provisional Application 62545615 · Aug 15, 2017
Provisional Application 62519700 · Jun 14, 2017
Provisional Application 62500887 · May 3, 2017
Provisional Application 62474875 · Mar 22, 2017
Related Publication 20240291591A1 · Aug 29, 2024
References Cited (80)
US 8559552B2 · Wang et al. · 2013 [cited by applicant]
US 8799735B2 · Wu et al. · 2014 [cited by applicant]
US 10057098B2 · Baek et al. · 2018 [cited by applicant]
US 10128983B2 · Robert Safavi · 2018 [cited by examiner]
US 10171204B2 · Wu · 2019 [cited by examiner]
US 10425111B2 · Wu · 2019 [cited by examiner]
US 10432234B2 · Wu · 2019 [cited by examiner]
US 10979081B2 · Wu · 2021 [cited by examiner]
US 11012096B2 · Kim et al. · 2021 [cited by applicant]
US 11070317B2 · Ye · 2021 [cited by examiner]
US 11223443B2 · Jang et al. · 2022 [cited by applicant]
US 11683125B2 · Ye · 2023 [cited by examiner]
US 20080301536A1 · Shin et al. · 2008 [cited by applicant]
US 20090086849A1 · Tsai et al. · 2009 [cited by applicant]
US 20100169722A1 · Wu et al. · 2010 [cited by applicant]
US 20110033004A1 · Wang et al. · 2011 [cited by applicant]
US 20150003538A1 · Baek et al. · 2015 [cited by applicant]
US 20150089321A1 · Myung et al. · 2015 [cited by applicant]
US 20150333769A1 · Jeong et al. · 2015 [cited by applicant]
US 20150358035A1 · Scarpa · 2015 [cited by examiner]
US 20160079999A1 · Shen et al. · 2016 [cited by applicant]
US 20160105201A1 · Lee et al. · 2016 [cited by applicant]
US 20160182187A1 · Kim et al. · 2016 [cited by applicant]
US 20170005753A1 · Shen et al. · 2017 [cited by applicant]
US 20170047947A1 · Hong et al. · 2017 [cited by applicant]
US 20170093529A1 · Robert Safavi · 2017 [cited by examiner]
US 20170331590A1 · Wu · 2017 [cited by examiner]
US 20180026663A1 · Wu · 2018 [cited by examiner]
US 20180199317A1 · Hwang · 2018 [cited by examiner]
US 20180226995A1 · Wu · 2018 [cited by examiner]
US 20190158226A1 · Hui · 2019 [cited by examiner]
US 20190181983A1 · Ye · 2019 [cited by examiner]
US 20190393987A1 · Hong · 2019 [cited by examiner]
US 20200014405A1 · Wu · 2020 [cited by examiner]
US 20200099471A1 · Ye · 2020 [cited by examiner]
US 20210242887A1 · Kim et al. · 2021 [cited by applicant]
US 20210385016A1 · Ye · 2021 [cited by examiner]
US 20220030532A1 · Hajir · 2022 [cited by examiner]
CN 102007747A · 2011 [cited by applicant]
CN 102122966A · 2011 [cited by applicant]
CN 102187593A · 2011 [cited by applicant]
CN 104811266A · 2015 [cited by applicant]
CN 104869087A · 2015 [cited by applicant]
CN 106165303A · 2016 [cited by applicant]
CN 106464425A · 2017 [cited by applicant]
EP 2206262A1 · 2010 [cited by applicant]
EP 3799314A1 · 2021 [cited by applicant]
JP 2020524464A · 2020 [cited by applicant]
KR 20160018804A · 2016 [cited by applicant]
KR 20170016003A · 2017 [cited by applicant]
WO WO2014116041A1 · 2014 [cited by applicant]
WO WO2015123842A1 · 2015 [cited by applicant]
WO WO2017176309A1 · 2017 [cited by applicant]
WO WO2018236114A1 · 2018 [cited by applicant]
Meng, et al., “A Novel Interleaving Scheme for Polar Codes”, IEEE 84th Vehicular Technology Conference (VTC-Fall), arXiv:1603.00644v2, Mar. 20, 2016, 5 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), “Rani Chairman's Notes”, 3GPP TSG RAN WG1 Meeting #88, Athens, Greece, Feb. 13-17, 2017, 109 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), “Rani Chairman's Notes”, 3GPP TSG RAN WG1 Meeting NR Ad-Hoc, Spokane, USA, Jan. 16-20, 2017, 60 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), “Rani Chairman's Notes”, 3GPP TSG RAN WG1 Meeting #90, Prague, Czech Republic, Aug. 21-25, 2017, 143 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1608862, “Polar Code Construction for NR”, Huawei, HiSilicon, 3GPP TSG RAN WG1 Meeting #86bis, Lisbon, Portugal, Oct. 10-14, 2016, 8 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1611254, “Details of the Polar Code Design”, Huawei, HiSilicon, 3GPP TSG RAN WG1 Meeting #87, Reno, USA, Nov. 10-14, 2016, 15 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1701702, “Construction Schemes for Polar Codes”, Huawei, HiSilicon, 3GPP TSG RAN WG1 Meeting #88, Athens, Greece, Feb. 13-17, 2017, 7 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1702646, “Polar Code Information Bit Allocation and Nested Extension Construction”, Qualcomm Incorporated, 3GPP TSG-RAN WG1 Meeting #88, Athens, Greece, Feb. 13-17, 2017, pp… [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1702735, “Polar Code Size and Rate-Matching Design for NR Control Channels”, MediaTek Inc., 3GPP TSG RAN WG1 Ran 1 #88 Meeting, Athens, Greece, Feb. 13-17, 2017, 8 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1710750, “Design of Unified Rate-Matching for Polar Codes”, Samsung, 3GPP TSG RAN WG1 NR Ad-Hoc#2, Qingdao, P.R. China, Jun. 27-30, 2017, pp. 1-6. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1710752, “Design of Channel Interleaver for Polar Codes”, Samsung, 3GPP TSG RAN WG1 NR Ad-Hoc#2, Qingdao, P.R. China, Jun. 27-30, 2017, pp. 1-3. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1713474, “Design and Evaluation of Interleaver for Polar Codes”, Qualcomm Incorporated, 3GPP TSG-RAN RAN1#90, Prague, CZ, Aug. 21-25, 2017, pp. 1-10. [cited by applicant]
3rd Generation Partnership Project (3GPP), R1-1715000, “Way Forward on Rate-Matching for Polar Code”, MediaTek, Qualcomm, Samsung ZTE, 3GPP TSG RAN WG1 Meeting #90, Prague, Czech Republic, Aug. 21-25, 2017, 24 pages. [cited by applicant]
“The Vienna 5G Link Level Simulator V1.0”, Jun. 12, 2017. [cited by applicant]
Ari Kan, Erdal, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels”, IEEE Transactions on Information Theory, vol. 55, No. 7, Jul. 2009, pp. 3051-307… [cited by applicant]
Bai, et al., “Sub-Block Recovery Scheme for Iterative Decoding of Turbo Codes”, IEEE, 2005, pp. 1970-1974. [cited by applicant]
Bioglio, et al., Low-Complexity Puncturing and Shortening of Polar Codes, 2017, IEEE, pp. 1-6. (Year: 2017). [cited by applicant]
El-Khamy, et al., “Circular Buffer Rate-Matched Polar Codes”, arViv: 1702.04080v1, IEEE Transactions on Communications, Feb. 14, 2017, pp. 1-30. [cited by applicant]
Niu, et al., “CRC-Aided Decoding of Polar Codes”, IEEE Communications Letters, vol. 16, No. 10, Oct. 2012, pp. 1668-1671. [cited by applicant]
Tal, et al., “How to Construct Polar Codes”, IEEE Transactions on Information Theory, vol. 59, No. 10, Oct. 2013, pp. 6562-6582. [cited by applicant]
Tal, et al., “List Decoding of Polar Codes”, arXiv:1206.0050v1, May 31, 2012, pp. 1-11. [cited by applicant]
Trifonov, Peter, “Efficient Design and Decoding of Polar Codes”, IEEE Transactions on Communications, vol. 60, No. 11, Nov. 2012, pp. 3221-3227. [cited by applicant]
Verizon, TS VSG.212 V1 .2, “ Verizon SG TF, Air Interface Working Group, Verizon 5th Generation Radio Access, Multiplexing and Channel Coding (Release 1)”, Cisco, Ericsson, Intel Corp., LG Electronics, Nokia, Qualcomm T… [cited by applicant]
Wang, et al., “A Novel Puncturing Scheme for Polar Codes”, IEEE Communications Letters, vol. 18, No. 12, Dec. 2014, pp. 2081-2084. [cited by applicant]
Wang, et al., “Interleaved Concatenations of Polar Codes with BCH and Convolutional Codes”, IEEE Journal on Selected Areas in Communications, vol. 34, No. 2, Feb. 2016, pp. 267-277. [cited by applicant]
El-Khamy, Mostafa, et al., “HARQ Rate-Compatible Polar Codes for Wireless Channels”, Institute of Electrical and Electronics Engineers (IEEE), 2015, 6 pages. [cited by applicant]