US2022209793A1PendingUtilityA1

Performance of a data channel using polar codes for a wireless communication system

Assignee: AT & T IP I LPPriority: Feb 16, 2018Filed: Mar 21, 2022Published: Jun 30, 2022
Est. expiryFeb 16, 2038(~11.5 yrs left)· nominal 20-yr term from priority
H04L 1/0072H04L 1/0046H04L 1/0061H04L 1/0041H04L 1/0045H04L 1/0057H03M 13/15H04L 1/0067
66
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Various embodiments provide for encoding and decoding data channel information with polar codes where the frozen bits of the information block can be set to a scrambling identifier based on the device ID, cell ID, or some other unique identifier instead of being set to null. The frozen bits can be identified based on the type of polar code being used, and while the non-frozen bits can be coded with the data link data, the frozen bits can be coded with the scrambling identifier. In an example where there are more frozen bits than bits in the scrambling identifier, the most reliable of the frozen bits can be coded with the scrambling identifier. In another example, the frozen bits can be set to the CRC bits, which can then be masked by the scrambling identifier.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A transmitter device, comprising:
 a processor; and   a non-transitory memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, comprising:   determining a first quantity of frozen bits and a second quantity of bits in a scrambling identifier; and   in response to the first quantity being determined to be larger than the second quantity, coding a group of frozen bits from among the frozen bits based on respective reliabilities of the frozen bits determined according to a defined reliability criterion, wherein   the group of frozen bits is set to be equal in quantity to the second quantity, and   the frozen bits of the group of frozen bits are more reliable than any frozen bit excluded from the group of frozen bits.   
     
     
         2 . The transmitter device of  claim 1 , wherein
 the bits are determined to have a decoding reliability above a defined reliability threshold, and   the frozen bits are determined to have a decoding reliability below the defined reliability threshold.   
     
     
         3 . The transmitter device of  claim 1 , wherein the second quantity is 16 bits or 12 bits. 
     
     
         4 . The transmitter device of  claim 1 , wherein the scrambling identifier comprises a radio network temporary identifier number. 
     
     
         5 . The transmitter device of  claim 1 , wherein the operations further comprise:
 encoding an information block with a polar code into a codeword, wherein the information block comprises the frozen bits and the bits.   
     
     
         6 . The transmitter device of  claim 5 , wherein the codeword is equal in length to a sum of the frozen bits and the bits. 
     
     
         7 . The transmitter device of  claim 6 , wherein the operations further comprise:
 splitting the codeword into partial codewords to facilitate rate matching of a transmission block.   
     
     
         8 . A method, comprising:
 determining, by a device comprising a processor, a first quantity of frozen bits and a second quantity of bits in a scrambling identification number; and   in response to a determination that the first quantity is larger than the second quantity, coding, by the device, the frozen bits with the scrambling identification number comprising coding a group of the frozen bits from among the frozen bits based on respective reliabilities of the frozen bits determined according to a defined reliability criterion, wherein   the group of the frozen bits is set to be equal in quantity to the second quantity, and   every frozen bit of the group of the frozen bits is more reliable than any frozen bit excluded from the group of the frozen bits.   
     
     
         9 . The method of  claim 8 , wherein the frozen bits are determined using Bhattacharyya bounding. 
     
     
         10 . The method of  claim 8 , further comprising:
 assigning, by the device, to bits of the group of the frozen bits, payload data of channel state information.   
     
     
         11 . The method of  claim 10 , further comprising:
 coding, by the device, a second quantity of bits determined to have second reliabilities not satisfying a defined reliability threshold.   
     
     
         12 . The method of  claim 11 , wherein the second quantity of the bits is coded with the scrambling identification number. 
     
     
         13 . The method of  claim 8 , further comprising:
 marking, by the device, a third quantity of bits determined to have third reliabilities not satisfying a defined reliability threshold, for cyclic redundancy check bits, resulting in a marked group comprising the third quantity of bits.   
     
     
         14 . The method of  claim 13 , further comprising:
 masking, by the device, the marked group with the scrambling identification number.   
     
     
         15 . A non-transitory machine-readable medium, comprising executable instructions that, when executed by a processor of a device, facilitate performance of operations, comprising:
 determining a first quantity of frozen bits and a second quantity of bits in a scrambling identification number; and   in response to determining that the first quantity is larger than the second quantity, coding a first group of the frozen bits from among the frozen bits based on respective reliabilities of the frozen bits determined according to a defined reliability criterion, wherein   the first group of the frozen bits is set to be equal in quantity to the second quantity, and   each frozen bit of the first group of the frozen bits is more reliable than each frozen bit excluded from the first group of the frozen bits.   
     
     
         16 . The non-transitory machine-readable medium of  claim 15 , wherein coding the first group of the frozen bits comprises:
 coding the first group of the frozen bits with cyclic redundancy check bits; and   masking the cyclic redundancy check bits with the scrambling identification number.   
     
     
         17 . The non-transitory machine-readable medium of  claim 15 , wherein the operations further comprise:
 performing a cyclic redundancy check.   
     
     
         18 . The non-transitory machine-readable medium of  claim 17 , wherein the operations further comprise:
 in response to the cyclic redundancy check resulting in a pass, transmitting a hybrid automatic repeat request acknowledgement.   
     
     
         19 . The non-transitory machine-readable medium of  claim 15 , wherein the operations further comprise:
 unmasking, with the scrambling identification number, a third quantity of frozen bits, resulting in cyclic redundancy check bits.   
     
     
         20 . The non-transitory machine-readable medium of  claim 15 , wherein
 the bits are determined to have a decoding reliability above a defined reliability threshold, and   the frozen bits are determined to have a decoding reliability below the defined reliability threshold.

Join the waitlist — get patent alerts

Track US2022209793A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.