IP Library › Granted Patent US 12,261,693
Granted Patent B2
US 12,261,693 · App. 16/664,157 · Granted Mar 25, 2025

Communication techniques applying low-density parity-check code base graph selection

Inventors: Shimman Arvind Patel (San Diego, CA); Joseph Binamira Soriaga (San Diego, CA); Gabi Sarkis (San Diego, CA); June Namgoong (San Diego, CA)
Assignee: QUALCOMM Incorporated
H04L1/0057H04L1/0009H04L1/0041H04L1/0046H04L1/0068H04L1/1819
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,261,693
App. No.
16/664,157
Granted
Mar 25, 2025
Kind
B2
Abstract

Certain aspects of the present disclosure generally relate to techniques for selecting a base graph to be used for wireless communications. Selection can be based on a variety of factors. Abase graph can be used to derive a low-density parity-check (LDPC) code used for encoding a retransmission of an original transmission. An exemplary method generally includes selecting, based on a modulation and coding scheme (MCS) and a resource allocation (RA) for transmitting a codeword, a base graph (BG), from which to derive a low density parity check (LDPC) code for use in encoding data bits in the codeword (e.g., encoding data bits of a bitstream such that some redundant bits are included in the codeword), encoding the data bits to generate the codeword using the LDPC code derived from the selected BG, and transmitting the codeword using the MCS via resources of the

Claims (100)

1. A method for wireless communications by a user equipment (UE) comprising a processor in electrical communication with a memory, the processor configured to obtain data from the memory in preparation for wireless communications, the method comprising:

receiving control information indicating a modulation order, a coding rate, and a resource allocation (RA) for transmission of a codeword;

selecting a base graph (BG) from which to derive a low density parity check (LDPC) code for use in decoding the codeword, wherein the selecting is based on the coding rate and the RA;

receiving the codeword via resources of the RA; and

decoding the codeword using the LDPC code derived from the selected BG.

2. The method of claim 1 , wherein selecting the BG comprises selecting the BG from a set of two base graphs.

3. The method of claim 1 , wherein selecting the BG comprises:

determining the coding rate based on the modulation order;

calculating a code block size (CBS) based on the coding rate and the RA; and

selecting the BG based on the CBS and the coding rate.

4. The method of claim 3 , wherein selecting the BG further comprises:

selecting a first BG from a set of two base graphs when:

the CBS is less than or equal to a first threshold number of bits,

the coding rate is less than or equal to a first threshold coding rate, or

the CBS is less than or equal to a second threshold number of bits and the coding rate is less than or equal to a second threshold coding rate; and

selecting a second BG from the set of the two base graphs when the first BG is not selected.

5. The method of claim 4 , wherein:

the first threshold number is 292;

the first threshold coding rate is 0.25;

the second threshold number is 3824, and

the second threshold coding rate is 0.67.

6. A method for wireless communications by a base station (BS) comprising a processor in electrical communication with a memory, the processor configured to obtain data from the memory in preparation for wireless communications, the method comprising:

selecting a base graph (BG) stored in said memory from which to derive a low density parity check (LDPC) code for use in encoding data bits, wherein the selecting is based on a first coding rate and a resource allocation (RA) for transmitting a codeword;

encoding, by an encoder circuit, the data bits to generate the codeword using the LDPC code derived from the selected BG; and

transmitting the codeword using a modulation order via resources of the RA using one or more antenna elements.

7. The method of claim 6 , wherein selecting the BG comprises selecting the BG from a set of two base graphs.

8. The method of claim 6 , wherein selecting the BG comprises:

determining the first coding rate based on the modulation order;

calculating a code block size (CBS) based on the first coding rate and the RA; and

selecting the BG based on the CBS and the first coding rate.

9. The method of claim 8 , wherein selecting the BG further comprises:

selecting a first BG from a set of two base graphs when:

the CBS is less than or equal to a first threshold number of bits,

the first coding rate is less than or equal to a first threshold coding rate, or

the CBS is less than or equal to a second threshold number of bits and the first coding rate is less than or equal to a second threshold coding rate; and

selecting a second BG from the set of the two base graphs when the first BG is not selected.

10. The method of claim 9 , wherein:

the first threshold number is 292;

the first threshold coding rate is 0.25;

the second threshold number is 3824, and

the second threshold coding rate is 0.67.

11. The method of claim 6 , further comprising:

obtaining an indication that a user equipment (UE) did not receive the codeword;

selecting, by the processor, a second coding rate for a retransmission of the data bits of the codeword, wherein the selection is from a restricted set of coding rates designed to ensure the UE selects a same BG to decode the retransmission; and

retransmitting the data bits in another codeword according to the selected second coding rate.

12. The method of claim 11 , wherein retransmitting the data bits comprises:

selecting, by the processor, another modulation order and another resource allocation (RA) for the retransmitting, based on the selected second coding rate; and

transmitting the another codeword using the selected other modulation order and via resources of the other RA using the one or more antenna elements.

13. An apparatus for wireless communications, comprising:

a processor configured to:

cause the apparatus to receive control information indicating a modulation order, a coding rate, and a resource allocation (RA) for transmission of a codeword;

select a base graph (BG), from which to derive a low density parity check (LDPC) code for use in decoding the codeword, based on the coding rate and the RA;

cause the apparatus to receive the codeword via resources of the RA; and

decode the codeword using the LDPC code derived from the selected BG; and

a memory coupled with the processor.

14. The apparatus of claim 13 , wherein the processor is configured to select the BG by selecting the BG from a set of two base graphs.

15. The apparatus of claim 13 , wherein the processor is configured to select the BG by:

determining the coding rate based on the modulation order;

calculating a code block size (CBS) based on the coding rate and the RA; and

selecting the BG based on the CBS and the coding rate.

16. The apparatus of claim 15 , wherein the processor is further configured to select the BG by:

selecting a first BG from a set of two base graphs when:

the CBS is less than or equal to a first threshold number of bits,

the coding rate is less than or equal to a first threshold coding rate, or

the CBS is less than or equal to a second threshold number of bits and the coding rate is less than or equal to a second threshold coding rate; and

selecting a second BG from the set of the two base graphs when the processor does not select the first BG.

17. The apparatus of claim 16 , wherein:

the first threshold number is 292;

the first threshold coding rate is 0.25;

the second threshold number is 3824, and

the second threshold coding rate is 0.67.

18. An apparatus for wireless communications, comprising:

a processor configured to:

select a base graph (BG) from which to derive a low density parity check (LDPC) code for use in encoding data bits in a codeword, wherein the selection is based on a first coding rate and a resource allocation (RA) for transmitting a codeword;

encode the data bits to generate the codeword using the LDPC code derived from the selected BG; and

cause the apparatus to transmit the codeword using a modulation order via resources of the RA; and

a memory coupled with the processor.

19. The apparatus of claim 18 , wherein the processor is configured to select the BG by selecting the BG from a set of two base graphs.

20. The apparatus of claim 18 , wherein the processor is configured to select the BG by:

determining the first coding rate based on the modulation order;

calculating a code block size (CBS) based on the first coding rate and the RA; and

selecting the BG based on the CBS and the first coding rate.

21. The apparatus of claim 20 , wherein the processor is further configured to select the BG by:

selecting a first BG from a set of two base graphs when:

the CBS is less than or equal to a first threshold number of bits,

the first coding rate is less than or equal to a first threshold coding rate, or

the CBS is less than or equal to a second threshold number of bits and the first coding rate is less than or equal to a second threshold coding rate; and

selecting a second BG from the set of the two base graphs when the first BG is not selected.

22. The apparatus of claim 21 , wherein:

the first threshold number is 292;

the first threshold coding rate is 0.25;

the second threshold number is 3824, and

the second threshold coding rate is 0.67.

23. The apparatus of claim 18 , wherein the processor is further configured to:

obtain an indication that a user equipment (UE) did not receive the codeword;

select a second coding rate for a retransmission of the data bits of the codeword, wherein the selection is from a restricted set of coding rates designed to ensure the UE selects a same BG to decode the retransmission; and

cause the apparatus to retransmit the data bits in another codeword according to the selected second coding rate.

24. The apparatus of claim 23 , wherein the processor is configured to cause the apparatus to retransmit the data bits by:

selecting another modulation order and another resource allocation (RA) for the retransmitting, based on the selected second coding rate; and

causing the apparatus to transmit the another codeword using the selected other modulation order and via resources of the other RA.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2019
From: PATEL, SHIMMAN ARVIND; SORIAGA, JOSEPH BINAMIRA; SARKIS, GABI; NAMGOONG, JUNE
To: QUALCOMM INCORPORATED
Reel/Frame 050830/0609 →
Continuity (4)
Continuation PCTUS2018040507 · Jun 30, 2018
Continuation 16023807 · Jun 29, 2018
Provisional Application 62529765 · Jul 7, 2017
Related Publication 20200059317A1 · Feb 20, 2020
References Cited (400)
US 5583500A · Allen et al. · 1996 [cited by applicant]
US 5844918A · Kato · 1998 [cited by applicant]
US 6438724B1 · Cox et al. · 2002 [cited by applicant]
US 6633865B1 · Liao · 2003 [cited by applicant]
US 6674768B1 · Okamura · 2004 [cited by applicant]
US 6854082B1 · Rhee · 2005 [cited by applicant]
US 6931581B1 · Cassiday et al. · 2005 [cited by applicant]
US 6961388B2 · Ling et al. · 2005 [cited by applicant]
US 6961888B2 · Jin et al. · 2005 [cited by applicant]
US 7133853B2 · Richardson et al. · 2006 [cited by applicant]
US 7222284B2 · Stolpman · 2007 [cited by applicant]
US 7231557B2 · Jin et al. · 2007 [cited by applicant]
US 7237171B2 · Richardson · 2007 [cited by applicant]
US 7237181B2 · Richardson · 2007 [cited by applicant]
US 7493551B2 · Berens et al. · 2009 [cited by applicant]
US 7526717B2 · Kyung et al. · 2009 [cited by applicant]
US 7552097B2 · Richardson et al. · 2009 [cited by applicant]
US 7571372B1 · Burd et al. · 2009 [cited by applicant]
US 7581159B2 · Hocevar · 2009 [cited by applicant]
US 7627801B2 · Jin et al. · 2009 [cited by applicant]
US 7685495B2 · Bhushan · 2010 [cited by applicant]
US 7747934B2 · Livshitz · 2010 [cited by applicant]
US 7793194B2 · Seo et al. · 2010 [cited by applicant]
US 7840880B1 · Bain · 2010 [cited by applicant]
US 7979784B2 · Shao et al. · 2011 [cited by applicant]
US 7986622B2 · Frazier et al. · 2011 [cited by applicant]
US 8006162B2 · Choi et al. · 2011 [cited by applicant]
US 8117516B2 · Kim et al. · 2012 [cited by applicant]
US 8132072B2 · El-Khamy et al. · 2012 [cited by applicant]
US 8149948B2 · Song et al. · 2012 [cited by applicant]
US 8151157B2 · Lee et al. · 2012 [cited by applicant]
US 8218675B2 · Kim et al. · 2012 [cited by applicant]
US 8261155B2 · Richardson et al. · 2012 [cited by applicant]
US 8271846B2 · Myung et al. · 2012 [cited by applicant]
US 8356227B2 · Chung et al. · 2013 [cited by applicant]
US 8392789B2 · Biscondi et al. · 2013 [cited by applicant]
US 8418015B2 · Cao et al. · 2013 [cited by applicant]
US 8473821B2 · Taghavi et al. · 2013 [cited by applicant]
US 8484545B2 · McLaughlin et al. · 2013 [cited by applicant]
US 8495459B2 · Myung et al. · 2013 [cited by applicant]
US 8516334B2 · Xu et al. · 2013 [cited by applicant]
US 8578249B2 · Khandekar et al. · 2013 [cited by applicant]
US 8601345B1 · Huang · 2013 [cited by applicant]
US 8601352B1 · Anholt et al. · 2013 [cited by applicant]
US 8650457B1 · Yeo · 2014 [cited by applicant]
US 8687751B1 · Lee et al. · 2014 [cited by applicant]
US 8751902B2 · Jin et al. · 2014 [cited by applicant]
US 8892979B2 · Richardson et al. · 2014 [cited by applicant]
US 9214960B2 · Jeong et al. · 2015 [cited by applicant]
US 9325347B1 · Graumann et al. · 2016 [cited by applicant]
US 9362956B2 · Mahdavifar et al. · 2016 [cited by applicant]
US 9479375B1 · Ankarali et al. · 2016 [cited by applicant]
US 9602133B1 · Graumann et al. · 2017 [cited by applicant]
US 9667381B2 · Jeong et al. · 2017 [cited by applicant]
US 9692451B2 · Vasista et al. · 2017 [cited by applicant]
US 9742439B1 · Graumann · 2017 [cited by applicant]
US 9774893B2 · Moon et al. · 2017 [cited by applicant]
US 9917675B2 · Kudekar et al. · 2018 [cited by applicant]
US 10051333B2 · Moon et al. · 2018 [cited by applicant]
US 10075266B2 · Luo et al. · 2018 [cited by applicant]
US 10177787B1 · Danjean et al. · 2019 [cited by applicant]
US 10291354B2 · Richardson et al. · 2019 [cited by applicant]
US 10291359B2 · Xu et al. · 2019 [cited by applicant]
US 10312939B2 · Richardson et al. · 2019 [cited by applicant]
US 10313057B2 · Lin et al. · 2019 [cited by applicant]
US 10340949B2 · Soriaga et al. · 2019 [cited by applicant]
US 10348451B2 · Kudekar et al. · 2019 [cited by applicant]
US 10355822B2 · Patel et al. · 2019 [cited by applicant]
US 10432219B2 · Zheng et al. · 2019 [cited by applicant]
US 10560118B2 · Soriaga et al. · 2020 [cited by applicant]
US 10659079B2 · Hsu et al. · 2020 [cited by applicant]
US 10680646B2 · Richardson · 2020 [cited by applicant]
US 10735138B2 · Kalachev et al. · 2020 [cited by applicant]
US 11032026B2 · Richardson et al. · 2021 [cited by applicant]
US 11277151B2 · Soriaga et al. · 2022 [cited by applicant]
US 11791845B2 · Ahn et al. · 2023 [cited by applicant]
US 20020147954A1 · Shea · 2002 [cited by applicant]
US 20030033575A1 · Richardson et al. · 2003 [cited by applicant]
US 20030053435A1 · Sindhushayana et al. · 2003 [cited by applicant]
US 20030123409A1 · Kwak et al. · 2003 [cited by applicant]
US 20030172342A1 · Elzur · 2003 [cited by applicant]
US 20040098659A1 · Bjerke et al. · 2004 [cited by applicant]
US 20040187129A1 · Richardson · 2004 [cited by applicant]
US 20040262376A1 · Mezard et al. · 2004 [cited by applicant]
US 20050050435A1 · Kyung et al. · 2005 [cited by applicant]
US 20050078765A1 · Jeong et al. · 2005 [cited by applicant]
US 20050149842A1 · Kyung et al. · 2005 [cited by applicant]
US 20050246617A1 · Kyung et al. · 2005 [cited by applicant]
US 20050283707A1 · Sharon et al. · 2005 [cited by applicant]
US 20050283708A1 · Kyung et al. · 2005 [cited by applicant]
US 20060020868A1 · Richardson et al. · 2006 [cited by applicant]
US 20060020872A1 · Richardson et al. · 2006 [cited by applicant]
US 20060026486A1 · Richardson et al. · 2006 [cited by applicant]
US 20060036925A1 · Kyung et al. · 2006 [cited by applicant]
US 20060156199A1 · Palanki et al. · 2006 [cited by applicant]
US 20060184855A1 · Wang et al. · 2006 [cited by applicant]
US 20060274687A1 · Kim · 2006 [cited by applicant]
US 20060294445A1 · Divsalar et al. · 2006 [cited by applicant]
US 20070011568A1 · Hocevar · 2007 [cited by applicant]
US 20070022362A1 · Yue et al. · 2007 [cited by applicant]
US 20070089025A1 · Hong et al. · 2007 [cited by applicant]
US 20070101243A1 · Kim et al. · 2007 [cited by applicant]
US 20070113147A1 · Hong et al. · 2007 [cited by applicant]
US 20070113148A1 · Hong et al. · 2007 [cited by applicant]
US 20070136636A1 · Tsai et al. · 2007 [cited by applicant]
US 20080059862A1 · Kyung et al. · 2008 [cited by applicant]
US 20080062975A1 · Mes et al. · 2008 [cited by applicant]
US 20080126916A1 · Chung et al. · 2008 [cited by applicant]
US 20080178065A1 · Khandekar et al. · 2008 [cited by applicant]
US 20080204286A1 · Kose · 2008 [cited by applicant]
US 20080207120A1 · Kurina et al. · 2008 [cited by applicant]
US 20080298334A1 · Arviv et al. · 2008 [cited by applicant]
US 20080317152A1 · Sun et al. · 2008 [cited by applicant]
US 20080320353A1 · Blankenship et al. · 2008 [cited by applicant]
US 20090077456A1 · Pi et al. · 2009 [cited by applicant]
US 20090113256A1 · Radosavljevic et al. · 2009 [cited by applicant]
US 20090113276A1 · Radosavljevic et al. · 2009 [cited by applicant]
US 20090125735A1 · Zimmerman · 2009 [cited by applicant]
US 20090125780A1 · Taylor et al. · 2009 [cited by applicant]
US 20090158129A1 · Myung et al. · 2009 [cited by applicant]
US 20090204868A1 · Park et al. · 2009 [cited by applicant]
US 20090217129A1 · Myung et al. · 2009 [cited by applicant]
US 20090259915A1 · Livshitz et al. · 2009 [cited by applicant]
US 20090300461A1 · Shor et al. · 2009 [cited by applicant]
US 20100023834A1 · Richardson et al. · 2010 [cited by applicant]
US 20100077275A1 · Yu et al. · 2010 [cited by applicant]
US 20100107033A1 · Kuri et al. · 2010 [cited by applicant]
US 20100153819A1 · Ueng et al. · 2010 [cited by applicant]
US 20100185926A1 · Lawson et al. · 2010 [cited by applicant]
US 20100199153A1 · Okamura et al. · 2010 [cited by applicant]
US 20100211844A1 · Yuda et al. · 2010 [cited by applicant]
US 20100257425A1 · Yue et al. · 2010 [cited by applicant]
US 20100275089A1 · Mow et al. · 2010 [cited by applicant]
US 20100287438A1 · Lakkis · 2010 [cited by applicant]
US 20100325511A1 · Oh et al. · 2010 [cited by applicant]
US 20110047433A1 · Abu-Surra et al. · 2011 [cited by applicant]
US 20110066916A1 · Abu-Surra et al. · 2011 [cited by applicant]
US 20110096862A1 · Kuri et al. · 2011 [cited by applicant]
US 20110126072A1 · Yoshimoto et al. · 2011 [cited by applicant]
US 20110161772A1 · Yoshii et al. · 2011 [cited by applicant]
US 20110170015A1 · Kim et al. · 2011 [cited by applicant]
US 20110202820A1 · Eroz et al. · 2011 [cited by applicant]
US 20120084625A1 · Pisek et al. · 2012 [cited by applicant]
US 20120166917A1 · El-Khamy et al. · 2012 [cited by applicant]
US 20120240001A1 · Abu-Surra et al. · 2012 [cited by applicant]
US 20120317461A1 · Hwang et al. · 2012 [cited by applicant]
US 20130031438A1 · Hu et al. · 2013 [cited by applicant]
US 20130051556A1 · Myung et al. · 2013 [cited by applicant]
US 20130086445A1 · Yedidia et al. · 2013 [cited by applicant]
US 20130117344A1 · Gross et al. · 2013 [cited by applicant]
US 20130272378A1 · Sole Rojals et al. · 2013 [cited by applicant]
US 20140003533A1 · He et al. · 2014 [cited by applicant]
US 20140019820A1 · Vardy et al. · 2014 [cited by applicant]
US 20140040214A1 · Ma et al. · 2014 [cited by applicant]
US 20140068375A1 · Eroz et al. · 2014 [cited by applicant]
US 20140101116A1 · Alnafoosi et al. · 2014 [cited by applicant]
US 20140173376A1 · Jeong et al. · 2014 [cited by applicant]
US 20140201592A1 · Shen et al. · 2014 [cited by applicant]
US 20140223254A1 · Pisek · 2014 [cited by applicant]
US 20140229788A1 · Richardson · 2014 [cited by applicant]
US 20140229789A1 · Richardson · 2014 [cited by applicant]
US 20140304574A1 · Seo et al. · 2014 [cited by applicant]
US 20140365842A1 · Li et al. · 2014 [cited by applicant]
US 20140365844A1 · Kliger et al. · 2014 [cited by applicant]
US 20140365845A1 · Pantelias et al. · 2014 [cited by applicant]
US 20150120798A1 · Jeong et al. · 2015 [cited by applicant]
US 20150178149A1 · Cai et al. · 2015 [cited by applicant]
US 20150188666A1 · Mahdavifar et al. · 2015 [cited by applicant]
US 20150229337A1 · Alhussien et al. · 2015 [cited by applicant]
US 20150249473A1 · Li et al. · 2015 [cited by applicant]
US 20150293716A1 · Jiang et al. · 2015 [cited by applicant]
US 20150334700A1 · Tsai · 2015 [cited by applicant]
US 20150381208A1 · Li et al. · 2015 [cited by applicant]
US 20160012465A1 · Sharp · 2016 [cited by applicant]
US 20160013810A1 · Gross et al. · 2016 [cited by applicant]
US 20160013931A1 · Pisek et al. · 2016 [cited by applicant]
US 20160020783A1 · Yang et al. · 2016 [cited by applicant]
US 20160043745A1 · Vojcic et al. · 2016 [cited by applicant]
US 20160087648A1 · Korb et al. · 2016 [cited by applicant]
US 20160134304A1 · Shinohara et al. · 2016 [cited by applicant]
US 20160164537A1 · Pisek et al. · 2016 [cited by applicant]
US 20160164629A1 · Ahn et al. · 2016 [cited by applicant]
US 20160173132A1 · Cho · 2016 [cited by applicant]
US 20160183187A1 · Park · 2016 [cited by applicant]
US 20160197701A1 · Kim · 2016 [cited by applicant]
US 20160218750A1 · Ma · 2016 [cited by applicant]
US 20160309482A1 · Verma et al. · 2016 [cited by applicant]
US 20160337083A1 · Englert et al. · 2016 [cited by applicant]
US 20160380763A1 · Ahn et al. · 2016 [cited by applicant]
US 20170031599A1 · Bowman et al. · 2017 [cited by applicant]
US 20170047947A1 · Hong et al. · 2017 [cited by applicant]
US 20170063493A1 · Mundhada et al. · 2017 [cited by applicant]
US 20170075754A1 · Wang · 2017 [cited by applicant]
US 20170141798A1 · Kudekar et al. · 2017 [cited by applicant]
US 20170187489A1 · Myung et al. · 2017 [cited by applicant]
US 20170222663A1 · Parthasarathy et al. · 2017 [cited by applicant]
US 20170230149A1 · Wang et al. · 2017 [cited by applicant]
US 20170250712A1 · Chiu et al. · 2017 [cited by applicant]
US 20170331494A1 · Richardson et al. · 2017 [cited by applicant]
US 20170331497A1 · Richardson et al. · 2017 [cited by applicant]
US 20170353267A1 · Kudekar et al. · 2017 [cited by applicant]
US 20170359086A1 · Kudekar et al. · 2017 [cited by applicant]
US 20180007712A1 · Lou et al. · 2018 [cited by applicant]
US 20180131392A1 · Fisher-Jeffes et al. · 2018 [cited by applicant]
US 20180152205A1 · Kim · 2018 [cited by examiner]
US 20180212628A1 · Chen et al. · 2018 [cited by applicant]
US 20180226992A1 · Panteleev et al. · 2018 [cited by applicant]
US 20180278267A1 · Lee et al. · 2018 [cited by applicant]
US 20180331698A1 · Lee et al. · 2018 [cited by applicant]
US 20180367245A1 · Soriaga et al. · 2018 [cited by applicant]
US 20180367253A1 · Nammi et al. · 2018 [cited by applicant]
US 20190052400A1 · Soriaga et al. · 2019 [cited by applicant]
US 20190068318A1 · Marinier et al. · 2019 [cited by applicant]
US 20190181884A1 · Sun et al. · 2019 [cited by applicant]
US 20190215020A1 · Shinohara et al. · 2019 [cited by applicant]
US 20190245654A1 · Richardson et al. · 2019 [cited by applicant]
US 20190260507A1 · Lin et al. · 2019 [cited by applicant]
US 20190280817A1 · Kudekar et al. · 2019 [cited by applicant]
US 20190334652A1 · Myung et al. · 2019 [cited by applicant]
US 20190356337A1 · Richardson et al. · 2019 [cited by applicant]
US 20190394000A1 · Kim · 2019 [cited by examiner]
US 20200007159A1 · Jin et al. · 2020 [cited by applicant]
US 20200028523A1 · Li et al. · 2020 [cited by applicant]
US 20200044665A1 · Zheng et al. · 2020 [cited by applicant]
US 20200052817A1 · Kudekar et al. · 2020 [cited by applicant]
US 20200067641A1 · Ma · 2020 [cited by examiner]
US 20200162109A1 · Zhang · 2020 [cited by examiner]
US 20200235759A1 · Ye et al. · 2020 [cited by applicant]
US 20200235854A1 · Xu et al. · 2020 [cited by applicant]
US 20200322085A1 · Kudekar et al. · 2020 [cited by applicant]
US 20200404069A1 · Li et al. · 2020 [cited by applicant]
US 20200412387A1 · Kudekar · 2020 [cited by applicant]
US 20210058192A1 · Richardson · 2021 [cited by applicant]
US 20210281359A1 · Xu · 2021 [cited by applicant]
US 20220224356A1 · Kudekar et al. · 2022 [cited by applicant]
US 20230275599A1 · Richardson et al. · 2023 [cited by applicant]
US 20230327683A1 · Kudekar et al. · 2023 [cited by applicant]
US 20230421177A1 · Myung et al. · 2023 [cited by applicant]
US 20240063826A1 · Ahn et al. · 2024 [cited by applicant]
US 20240146453A1 · Patel et al. · 2024 [cited by applicant]
CN 1399829A · 2003 [cited by applicant]
CN 1780199A · 2006 [cited by applicant]
CN 1868145A · 2006 [cited by applicant]
CN 1953335A · 2007 [cited by applicant]
CN 1960188A · 2007 [cited by applicant]
CN 101019328A · 2007 [cited by applicant]
CN 101047387A · 2007 [cited by applicant]
CN 101076946A · 2007 [cited by applicant]
CN 101141133A · 2008 [cited by applicant]
CN 101188428A · 2008 [cited by applicant]
CN 101217337A · 2008 [cited by applicant]
CN 101645763A · 2010 [cited by applicant]
CN 101682381A · 2010 [cited by applicant]
CN 101826878A · 2010 [cited by applicant]
CN 102017426A · 2011 [cited by applicant]
CN 102340378A · 2012 [cited by applicant]
CN 102437858A · 2012 [cited by applicant]
CN 102474386A · 2012 [cited by applicant]
CN 102571105A · 2012 [cited by applicant]
CN 102651652A · 2012 [cited by applicant]
CN 102783206A · 2012 [cited by applicant]
CN 103152056A · 2013 [cited by applicant]
CN 103188044A · 2013 [cited by applicant]
CN 103281166A · 2013 [cited by applicant]
CN 103441816A · 2013 [cited by applicant]
CN 103636130A · 2014 [cited by applicant]
CN 103716130A · 2014 [cited by applicant]
CN 103746708A · 2014 [cited by applicant]
CN 103780329A · 2014 [cited by applicant]
CN 103905152A · 2014 [cited by applicant]
CN 104202126A · 2014 [cited by applicant]
CN 105227189A · 2016 [cited by applicant]
CN 105284053A · 2016 [cited by applicant]
CN 105306165A · 2016 [cited by applicant]
CN 105337696A · 2016 [cited by applicant]
CN 106341138A · 2017 [cited by applicant]
CN 107733442A · 2018 [cited by applicant]
CN 109150191A · 2019 [cited by applicant]
EP 1601109A2 · 2005 [cited by applicant]
EP 1724932A1 · 2006 [cited by applicant]
EP 2091171A2 · 2009 [cited by applicant]
EP 2096760A1 · 2009 [cited by applicant]
EP 2518923A1 · 2012 [cited by applicant]
EP 2899912A1 · 2015 [cited by applicant]
EP 3046259A1 · 2016 [cited by applicant]
EP 3264611A1 · 2018 [cited by applicant]
JP H07288479A · 1995 [cited by applicant]
JP 2007507156A · 2007 [cited by applicant]
JP 2009081577A · 2009 [cited by applicant]
JP 2010537460A · 2010 [cited by applicant]
JP 2011512106A · 2011 [cited by applicant]
JP 2011514049A · 2011 [cited by applicant]
JP 2016518035A · 2016 [cited by applicant]
KR 100833515B1 · 2008 [cited by applicant]
KR 20090092197A · 2009 [cited by applicant]
KR 20090130176A · 2009 [cited by applicant]
KR 101157246B1 · 2012 [cited by applicant]
KR 20150034561A · 2015 [cited by applicant]
KR 101524869B1 · 2015 [cited by applicant]
KR 101598754B1 · 2016 [cited by applicant]
KR 20170053589A · 2017 [cited by applicant]
RU 2520405C2 · 2014 [cited by applicant]
RU 2520406C2 · 2014 [cited by applicant]
SG 11201905916S · 2019 [cited by applicant]
TW 427076B · 2001 [cited by applicant]
TW 272777B · 2007 [cited by applicant]
TW 200711359A · 2007 [cited by applicant]
WO 2002062002A1 · 2002 [cited by applicant]
WO 2006124428A2 · 2006 [cited by applicant]
WO 2008092040A2 · 2008 [cited by applicant]
WO 2008112625A1 · 2008 [cited by applicant]
WO 2009005264A1 · 2009 [cited by applicant]
WO 2009011134A1 · 2009 [cited by applicant]
WO 2009107990A2 · 2009 [cited by applicant]
WO 2012064869A1 · 2012 [cited by applicant]
WO 2014117836A1 · 2014 [cited by applicant]
WO 2014127140A1 · 2014 [cited by applicant]
WO 2015054268A1 · 2015 [cited by applicant]
WO 2015139297A1 · 2015 [cited by applicant]
WO 2017092693A1 · 2017 [cited by applicant]
WO WO2017091244A1 · 2017 [cited by applicant]
WO 2017119922A1 · 2017 [cited by applicant]
WO 2017209837A1 · 2017 [cited by applicant]
WO 2018029633A1 · 2018 [cited by applicant]
WO 2018030927A1 · 2018 [cited by applicant]
WO 2018050062A1 · 2018 [cited by applicant]
WO 2018127196A1 · 2018 [cited by applicant]
WO 2018128560A1 · 2018 [cited by applicant]
WO 2018144251A1 · 2018 [cited by applicant]
WO 2018144560A1 · 2018 [cited by applicant]
WO 2018201553A1 · 2018 [cited by applicant]
WO 2018201609A1 · 2018 [cited by applicant]
WO 2018209035A1 · 2018 [cited by applicant]
WO 2018218471A1 · 2018 [cited by applicant]
International Search Report of International Application No. PCT/US2018/040507, International Searching Authority, European Patent Office, Rijswijk, Netherlands, pp. 1-4, dated Oct. 15, 2018. (Year: 2018). [cited by examiner]
Written Opinion of the International Searching Authority of International Application No. PCT/US2018/040507, International Searching Authority, European Patent Office, Rijswijk, Netherlands, pp. 1-7, dated Oct. 15, 2018… [cited by examiner]
Mackay D.J.C., “Good Error-Correcting Codes Based on Very Sparse Matrices,” IEEE Transactions on Information Theory, Mar. 1999, vol. 45 (2), pp. 399-431. [cited by applicant]
Roth C., et al., “A 15.8 pJ/bit/iter Quasi-Cyclic LDPC Decoder for IEEE 802.11n in 90 nm CMOS,” IEEE Asian Solid-State Circuits Conference, Nov. 8-10, 2010, 4 pages. [cited by applicant]
Trifonov P., et al., “Fast Encoding of Polar Codes with Reed-Solomon Kernel,” IEEE Transactions on Communications, May 2016, pp. 1-8. [cited by applicant]
Zhang Z., et al., “An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors,” IEEE Journal of Solid-State Circuits, Apr. 2010, vol. 45 (4), pp. 843-855. [cited by applicant]
Richardson T., et al., “Design of Low-Density Parity Check Codes for 5G New Radio,” IEEE Communications Magazine, vol. 56 (3), Mar. 1, 2018, pp. 28-34, XP055480192. [cited by applicant]
Richardson T., et al., “LDPC Proposal Update”, C30-20061218-004, 3GPP2-Drafts, Dec. 18, 2006 (Dec. 18, 2006), pp. 1-30, XP040476671, ftp://ftp.3gpp2.org/TSGC/Working/2007/2007-01-Vancouver/TSG-C-2007-01-Vancouver/WG3/Di… [cited by applicant]
Samsung: “Flexibility of LDPC—Length, Rate and IR-HARQ”, 3GPP Draft, 3GPP TSG RAN WG1 #85, R1-164007 Brd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-06921 Sophia-Antipolis… [cited by applicant]
Samsung: “Preliminary Evaluation Results on New Channel Coding Scheme for NR—LDPC Code for High Throughput”, 3GPP TSG-RAN WG1#85, R1-164812, May 14, 2016, 17 Pages. [cited by applicant]
Shea J M, et al., “Multidimensional Codes”, In Wiley Encyclopedia of Telecommunications, vol. 3, pp. 1-26, XP055402230, https://doi.org/10.1002/0471219282.eot342, Apr. 15, 2003, Entirety. [cited by applicant]
Shi L., “Research on Polar Code Characters and its Encoding and Decoding Method”, Chinese Master's Theses Full-Text Database, Information Science and Technology, Issue No. 12, Dec. 15, 2015. [cited by applicant]
Stolte N., Rekursive Codes mit der Plotkin-Konstruktion und ihre Decodierung, D17 Darmstadter Dissertation, Jan. 1, 2002, 151 pages, (in particular, pp. 13-30), XP055241445, URL:http://tuprints.ulb.tu-darmstadt.de/epda/… [cited by applicant]
Surra S.A., et al., “Gigabit Rate Achieving Low-Power LDPC Codes: Design And Architecture”, IEEE, Mar. 1, 2011, pp. 1994-1999. [cited by applicant]
Tal I., et al., “List Decoding of Polar Codes”, IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, May 2015, vol. 61, No. 5, pp. 2213-2226. [cited by applicant]
Tal I., et al., “List Decoding of Polar Codes”, International Symposium on Information Theory proceedings, ISIT 2011, St. Petersburg, Russia, Jul. 31-Aug. 5, 2011, May 31, 2012 (May 31, 2012), pp. 1-11, XP055225954, Pis… [cited by applicant]
Trifonov P., “Efficient Design and Decoding of Polar Codes”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, USA, vol. 60, No. 11, Nov. 1, 2012 (Nov. 1, 2012), XP011473857, pp. 3221-3227, ISSN:… [cited by applicant]
Trifonov P., et al., “Generalized Concatenated Codes Based on Polar Codes”, 8th International Symposium on Wireless Communication Systems, Nov. 6, 2011, XP032090122, pp. 442-446, DOI: 10.11 09/ISWCS.2011.6125399, ISBN: … [cited by applicant]
Wang T., et al., “Parity-Check-Concatenated Polar Codes”, IEEE Communications Letters, IEEE Service Center, Piscataway, NJ, US, vol. 20, No. 12, Dec. 1, 2016, pp. 2342-2345, XP011636292, ISSN: 1089-7798, DOI: 10.1109/LC… [cited by applicant]
Wang Y., et al., “Concatenations of Polar Codes With Outer BCH Codes and Convolutional Codes”, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Sep. 30, 2014, pp. 813-819, XP0327… [cited by applicant]
Xie Y., et al., “Design of Rate Compatible Protograph-based LDPC Codes with Mixed Circulants”, IEEE, 6th International Symposium on Turbo Codes & Iterative Information Processing, Sep. 2010, pp. 434-438. [cited by applicant]
Zhou H., et al., “Segmented CRC-Aided SC List Polar Decoding”, 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), May 15, 2016 (May 15, 2016), XP032918751, pp. 1-5, DOI: 10.1109/VTCSPRING.2016.7504469, retriev… [cited by applicant]
ZTE et al., “Compact LDPC Design for eMBB”, 3GPP Draft, 3GPP TSG RAN WG1 AH NR Meeting, R1-1700247 Compact LDPC Design for EMBB_Final, 3RD Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des … [cited by applicant]
ZTE: “NR LDPC Design”, 3GPP Draft; R1-1709289, NR LDPC design, 3rd Generation Partnership ProjecT (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921, Sophia-Antipolis Cedex; France, vol. RAN WG1, No. Han… [cited by applicant]
ZTE: “Structured LDPC Coding with Rate Matching”, 3GPP TSG RAN WG1 LTE Ad Hoc Meeting, 3GPP Draft; R1-060115 Structured LDPC Coding with Rate Matching, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and Channel Coding (Release 15)”, 3GPP TS 38.212 V15.3.0 (Sep. 2018), pp. 1-95. [cited by applicant]
Abbasfar A., et al., “Accumulate Repeat Accumulate Codes”, Dec. 2, 2003, XP002585965, Retrieved from the Internet: URL: http://trs-new.jpl.nasa.gov/dspace/bitstream/2014/8047/1/03-3469.pdf [retrieved on Jun. 4, 2010], 6… [cited by applicant]
Alcatel-Lucent et al., “LDPC Coding Proposal for Lbc”, 3GPP2 Draft; C30-20070226-002_C30-20070212-034R1_AHLQRZ_LDPC_PROPOSAL_FOR_LBC, Mar. 27, 2007, XP062206073, Retrieved from the Internet: URL:http://ftp.3gpp2.org/TSG… [cited by applicant]
Alcatel-Lucent et al., “LDPC Coding Proposal for LBC”, 3GPP2-Drafts, 2500 Wilson Boulevard, Suite 300, Arlington, Virginia 22201, USA, Mar. 15, 2007 (Mar. 15, 2007), XP040477608, 32 Pages, p. 1-p. 13, pp. 10-12. [cited by applicant]
Arikan E., “A Survey of Reed-Muller Codes From Polar Coding Perspective”, Information Theory Workshop (ITW), Piscataway, NJ, USA, Jan. 6, 2010, pp. 1-5, XP031703947, ISBN: 978-1-4244-6372-5. [cited by applicant]
Arikan E., “Challenges and some new directions in channel coding,” Computer Science, Information Theory, arXiv: 1504.03916, Apr. 15, 2015, 11 pages. [cited by applicant]
Arikan E., “Channel Polarization: a Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels”, IEEE Transactions on Information Theory, IEEE Press, USA, vol. 55, No. 7, Jul. 1, 200… [cited by applicant]
Chen B., et al., “List Viterbi Algorithms for Continuous Transmission”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, USA, vol. 49, No. 5, XP011009921, May 1, 2001 (May 1, 2001), pp. 784-792,… [cited by applicant]
Chen T.Y., et al., “Protograph-based Raptor-Like LDPC Codes with Low Thresholds”, IEEE International Conference on Communications, Jun. 10, 2012, DOI: 10.1109/ICC.2012.6363996, ISBN: 978-1-4577-2052-9, pp. 2161-2165. [cited by applicant]
Chiu M.C., et al., “Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes”, Sep. 28, 2016, XP055384603, pp. 1-9, Retrieved from the Internet: URL:https://arxiv.org/pdf/1609.08813.pdf [retrieved on Jun. 23, 2017… [cited by applicant]
Deng X., et al., “Segmented Cyclic Redundancy Check: A Data Protection Scheme for Fast Reading RFID Tag's Memory,” IEEE Wireless Communications and Networking Conference, 2008, pp. 1576-1581. [cited by applicant]
El-Khamy M., et al., “Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding”, Computer Science, Information Theory, Arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY … [cited by applicant]
El-Khamy M., et al., “Design of Rate Compatible Structured LDPC Codes for Hybrid ARQ Applications”, IEEE, Aug. 1, 2009, vol. 27(6), pp. 965-973. [cited by applicant]
Ericsson: “CRC Attachment Point for MAC-is When Transmitting MAC-c PDU”, R2-086458, 3GPP TSG-RAN WG2 Meeting #64 , Prague, Czech Republic, Nov. 10-14, 2008, Nov. 3, 2008, 2 Pages. [cited by applicant]
Ericsson: “Design Parameters and Implementation Aspects of LPDC Codes,” 3GPP Draft, 3GPP TSG-RAN WG1 #88, R1-1703537 Design Parameters and Implementation Aspects of LDPC Codes, 3rd Generation Partnership Project (3GPP),… [cited by applicant]
Ericsson: “Implementation and Performance of LDPC Decoder”, 3GPP TSG RAN WG1 AH_NR Meeting R1-1700111, Jan. 20, 2017, 8 Pages. [cited by applicant]
Ericsson: “Performance and Complexity of Per-Segment CRC Attachment Methods”, 3GPP TSG-RAN WG1#50, 3GPP Draft, R1-073741, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-0… [cited by applicant]
Ericsson: “System Information for Low Complexity and Extended Coverage”, 3GPP Draft; R1-1708730—Sysinfo for Low Complexity and Ext Coverage, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Rout… [cited by applicant]
Examiner Requisition for CA03021881 dated Nov. 7, 2018. [cited by applicant]
Examiner Requisition for CA03021881 dated Jan. 28, 2019. [cited by applicant]
Guo J., et al., “Multi-CRC Polar Codes and Their Applications”, IEEE Communications Letters, IEEE Service Center, Piscataway, NJ, US, vol. 20, No. 2, Feb. 1, 2016 (Feb. 1, 2016), XP011598246, pp. 212-215, ISSN: 1089-779… [cited by applicant]
Hashemi S.A., et al., “Partitioned Successive-Cancellation List Decoding of Polar Codes”, 2016 IEEE International Conference on Acoustics. Speech and Signal Processing (ICASSP), Mar. 20, 2016, pp. 957-960, https://ieeex… [cited by applicant]
Huawei et al., “Details of the Polar Code Design”, 3GPP TSG RAN WG1 Meeting #87, R1-1611254, Reno, USA, 3rd Generation, Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antip… [cited by applicant]
IEEE: “IEEEStd 802.16e-2005, Air Interface For Fixed and Mobile Broadband Wireless Access Systems,” Amendment 2 and Corrigendum 1 to IEEE Std 802.16-2004, IEEE STD 802.16E-2005, Feb. 28, 2006 (Feb. 28, 2006), pp. 626-63… [cited by applicant]
“IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Broadband Wireless Access Systems; IEEE Std 802.16-2009 (Revision of IEEE Std 802.16-2004)”, IEEE Standard, IEEE, Piscataway, NJ, USA, M… [cited by applicant]
Intel Corporation: “LDPC Code Design for NR”, 3GPP TSG RAN WG1 Meeting #85, 3GPP Draft; R1-164183, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis C… [cited by applicant]
Intel Corporation: “LDPC Coding Chain” [online], 3GPP Draft, 3GPP TSG RAN WG1 Meeting NR-Adhoc#2,R1-1711344, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-06921 Sophia-A… [cited by applicant]
Interdigital Inc: “Code Block Segmentation for Data Channel”, 3GPP Draft; R1-1710958, Code Block Segmentation for Data Channel, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650 Route Des Lucioles… [cited by applicant]
Jiang M., et al., “An Improved Variable Length Coding Scheme Using Structured LDPC Codes”, Wireless Communications and Signal Processing (WCSP), 2010 International Conference on, IEEE, Piscataway, NJ, USA, Oct. 21, 2010… [cited by applicant]
Jun Lin et al., “A reduced latency list decoding algorithm for polar codes”, 2014 IEEE Workshop on Signal Processing Systems (SIPS), Oct. 1, 2014, p. 1-6. [cited by applicant]
Leroux C., et al., “A Semi-Parallel Successive-Cancellation Decoder for Polar Codes,” IEEE Transactions on Signal Processing, Jan. 2013, vol. 61, No. 2, pp. 1-11. [cited by applicant]
Liu J., et al., “Rate-Compatible LDPC Codes with Short Block Lengths Based on Puncturing and Extension Techniques,” 2014, pp. 1-20. [cited by applicant]
Lucas R et al., “Improved Soft-Decision Decoding of Reed-Muller Codes as Generalized Multiple Concatenated Codes”, ITG-FACHBERI, vol. 183, VDE-VERLAG, DE, No. 146, Mar. 5, 1998, pp. 137-142. [cited by applicant]
Mahdavifar H., et al., “Fast Multi-dimensional Polar Encoding and Decoding,” Information Theory and Applications Workshop (ITA), IEEE, 2014, 5 pages. [cited by applicant]
Mahdavifar H., et al., “On the Construction and Decoding of Concatenated Polar Codes”, IEEE International Symposium on Information Theory, Jul. 7, 2013, pp. 952-956, XP032497043, ISSN: 2157-8095, DOI: 10.1109/ SIT.2013.… [cited by applicant]
Mediatek Inc: “Multi-Codebook Embedded Compact QC-LDPC Designs”, 3GPP TSG-RAN WG1 NR, R1-1706175, Apr. 4, 2017, XP051252463, Retrieved from the Internet: URL:http://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR1_88b/Docs/, 14 p… [cited by applicant]
Myung S., et al., “Extension of Quasi-cyclic LDPC Codes by Lifting,” PROC ., IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, Australia, Sep. 4, 2005 (Sep. 4, 2005), —Sep. 9, 2005 (SSep. 9, 2005)… [cited by applicant]
Myung S., et al., “Lifting Methods for Quasi-Cyclic LDPC Codes”, IEEE Communications Letters, IEEE Service Center, Piscataway, NJ, US, (Jun. 1, 2006) Jun. 2006, vol. 10, No. 6, pp. 489-491, doi:10.1109/LCOMM.2006.163862… [cited by applicant]
Nguyen T.V., et al., “The Design of Rate-Compatible Protograph LDPC Codes”, IEEE Transactions on Communications, Oct. 1, 2012, vol. 60, No. 10, XP011469171, ISSN: 0090-6778, DOI: 10.1109/TCOMM.2012.081012.110010, pp. 28… [cited by applicant]
Niu K., et al., “CRC-Aided Decoding of Polar Codes,” IEEE Communications Letters, Oct. 2012, vol. 16, No. 10, pp. 1668-1671. [cited by applicant]
Nokia et al., “Alcatel-Lucent Shanghai Bell Performance and Complexity of Turbo, LDPC and Polar Codes”, 3GPP TSG-RAN WG1 #84bis, R1-162897, Busan, Korea, Apr. 11-15, 2016, 6 Pages. [cited by applicant]
Cited By (1)
US 51,040