IP Library Granted Patent US 12,744,621
Granted Patent B2
US 12,744,621 · App. 19/065,495 · Granted Sep 22, 2026

Polar coding systems, procedures, and signaling

Inventors: Chunxuan Ye (San Diego, CA); Fengjun Xi (San Diego, CA); Sungkwon Hong (Dongjak-gu, 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,744,621
App. No.
19/065,495
Granted
Sep 22, 2026
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 (39)

1 . A wireless transmit/receive unit (WTRU) comprising a processor configured to:

apply a polar code to uplink control information (UCI) bits and cyclic redundancy check (CRC) bits to generate N polar encoded bits;

perform rate matching on the N polar encoded bits to generate rate matched polar encoded bits, wherein the N polar encoded bits are partitioned into b sub-blocks, each of the b sub-blocks having N/b bits, an index i represents a bit position of a bit of the N polar encoded bits, and a position of one or more of the N polar encoded bits is changed based on at least: a first function d 1 multiplied by N/b, wherein the first function d 1 is a function of

ib

N

,

and a second function d 2 , wherein the second function d 2 is a function of mod (i, N/b); and

transmit the rate matched polar encoded bits.

2 . The WTRU of claim 1 , wherein b is equal to 32.

3 . The WTRU of claim 1 , wherein the function d 2 corresponds to d 2 (x)=x.

4 . The WTRU of claim 1 , wherein an equal number of sub-blocks at a beginning of the N polar encoded bits and at an end of the N polar encoded bits are not changed in position.

5 . The WTRU of claim 1 , wherein the rate matching corresponds to a puncturing scheme.

6 . The WTRU of claim 5 , wherein the puncturing scheme is used based on a code rate for the transmitted rate matched polar encoded bits being less than a threshold.

7 . The WTRU of claim 1 , wherein N corresponds to a mother code length associated with the polar code.

8 . The WTRU of claim 1 , wherein the function di is associated with identifying a sub-block to be punctured, and wherein the function d 2 is associated with identifying a punctured bit of the sub-block to be punctured.

9 . The WTRU of claim 1 , wherein the N polar encoded bits are partitioned into the b sub-blocks in a sequential manner.

10 . The WTRU of claim 1 , wherein the rate matching corresponds to a shortening scheme.

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

applying a polar code to uplink control information (UCI) bits and cyclic redundancy check (CRC) bits to generate N polar encoded bits;

performing rate matching on the N polar encoded bits to generate rate matched polar encoded bits, wherein the N polar encoded bits are partitioned into b sub-blocks, each of the b sub-blocks having N/b bits, an index i represents a bit position of a bit of the N polar encoded bits, and a position of one or more of the N polar encoded bits is changed based on at least:

a first function d 1 multiplied by N/b, wherein the first function d 1 is a function of

ib

N

,

and a second function d 2 , wherein the second function d 2 is a function of mod(i, N/b); and

transmitting the rate matched polar encoded bits.

12 . The method of claim 11 , wherein b is equal to 32.

13 . The method of claim 11 , wherein the function d 2 corresponds to d 2 (x)=x.

14 . The method of claim 11 , wherein an equal number of sub-blocks at a beginning of the N polar encoded bits and at an end of the N polar encoded bits are not changed in position.

15 . The method of claim 11 , wherein the rate matching corresponds to a puncturing scheme.

16 . The method of claim 15 , wherein the puncturing scheme is used based on a code rate for the transmitted rate matched polar encoded bits being less than a threshold.

17 . The method of claim 11 , wherein N corresponds to a mother code length associated with the polar code.

18 . The method of claim 11 , wherein the function di is associated with identifying a sub-block to be punctured, and wherein the function d 2 is associated with identifying a punctured bit of the sub-block to be punctured.

19 . The method of claim 11 , wherein the N polar encoded bits are partitioned into the b sub-blocks in a sequential manner.

20 . The method of claim 11 , wherein the rate matching corresponds to a shortening scheme.

Continuity (11)
Continuation 18645817 · Apr 25, 2024
Continuation 18143394 · May 4, 2023
Continuation 17746795 · May 17, 2022
Continuation 17350054 · Jun 17, 2021
Continuation 16494666 · Mar 21, 2018
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 20250226918A1 · Jul 10, 2025
References Cited (91)
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 10805939B2 · John Wilson et al. · 2020 [cited by applicant]
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 20150103947A1 · Shen 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 20160285479A1 · El-Khamy 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 20190149268A1 · Xu · 2019 [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]
US 20230275697A1 · Ye · 2023 [cited by examiner]
US 20250226918A1 · Ye · 2025 [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 106027068A · 2016 [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]
JE 20160018804A · 2016 [cited by applicant]
JP 2020524464A · 2020 [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]
3rd Generation Partnership Project (3GPP), “Interleaver for Polar Codes”, InterDigital Communications, 3GPP TSG RAN WG1 Meeting #87, R1-1612656, Reno, USA Nov. 14-18, 2016, 5 pages. [cited by applicant]
3rd Generation Partnership Project (3GPP), “Polar Code Design Parameters”, Ericsson, 3GPP TSG-RAN WG1 #88, R1-1701632, Athens, Greece, Feb. 13-17, 2017, 3 pages. [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), “RAN1 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), “RAN1 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), “RAN1 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]
R1-1701602, “Rate Matching of Polar Codes for eMBB”, ZTE, ZTE Microelectronics, Feb. 13-17, 2017, 20 Pages. [cited by applicant]
R1-1701703, “Maximum mother code size of polar codes”, Huawei, HiSilicon, Feb. 13-17, 2017, 4 pages. [cited by applicant]