Granted Patent B2

US 12,237,917 · App. 17/845,219 · Granted Feb 25, 2025

Inventors: Jung Hyun Bae (San Jose, CA); Daeson Kim (San Jose, CA); Jinhong Wu (San Jose, CA); Mohamad Monzer Mansour (San Jose, CA); Dongwoon Bai (San Jose, CA); Kee-Bong Song (San Jose, CA)

Assignee: Samsung Electronics Co., Ltd.

H04L1/0045H04L1/0057H04L1/0067

Abstract

Claims (111)

1. A method of decoding, the method comprising:

receiving, by a user equipment (UE), a downlink control information (DCI) that is encoded;

identifying, by the UE, a first bit position of the DCI as a known bit; and

reducing a number of candidate code words for the DCI based on the known bit.

2. The method of claim 1 , wherein the identifying the first bit position of the DCI as a known bit comprises:

decoding a first previous DCI by applying no known bit assumptions;

decoding a second previous DCI by applying no known bit assumptions; and

determining that the first bit position has a value that is the same in the first previous DCI and the second previous DCI.

3. The method of claim 1 , further comprising:

decoding the DCI by treating the first bit position as a known bit;

failing to successfully decode the DCI; and

decoding the DCI without treating the first bit position as a known bit.

4. The method of claim 1 , further comprising:

decoding a full set of an aggregation level (AL) of the DCI without treating any bit positions of the full set as a known bit;

failing to successfully decode the DCI; and

decoding the DCI by treating the first bit position as a known bit, the first bit position corresponding to a subset of the AL that matches with a previous successfully decoded DCI.

5. The method of claim 1 , further comprising decoding the DCI according to a successive cancellation list decoding method, wherein the UE is configured to treat, as a special node, a node having the known bit as a leaf node.

6. The method of claim 5 , further comprising using

PM

2

n

-

d

v

-

1

as a path metric for the special node, wherein

PM

2

n

-

d

v

-

1

=

1

2

⁢

∑

i

=

0

2

n

-

d

v

-

1

❘

"\[LeftBracketingBar]"

α

i

❘

"\[RightBracketingBar]"

-

η

i

⁢

α

i

,

and

wherein:

η i is 1−2β i , β i being an i-th bit of a group of frozen bits and known bits at leaves of a special node;

n is a sign (+1 or −1) representation for a bit value (0 or 1) of β i ;

d v is a level of the special node in a binary tree representation; and

α i is a value of the i-th position of an incoming log likelihood ratio (LLR) vector ay for a node v.

7. The method of claim 1 , further comprising decomposing an encoded code word into a first linear component code word and a second linear component code word.

8. The method of claim 7 , further comprising:

descrambling, by the UE, a channel log likelihood ratio (LLR) by the second linear component code word to produce a first descrambled output;

decoding, by a decoder of the UE, the DCI by using the first descrambled output as an input to the decoder to produce a first decoder output;

scrambling, by the UE, the first decoder output by the second linear component code word to produce a full decoder output comprising an original code comprising the first linear component code word and the second linear component code word;

performing a radio network temporary identifier (RNTI) de-masking operation on a last sixteen CRC bits of the original code; and

performing, by the UE, a cyclic redundancy code (CRC) check on the decoder output based on the performing of the RNTI de-masking operation.

9. The method of claim 7 , wherein:

the first linear component code word is the result of encoding a data word having a zero at the first bit position, the first bit position being a known bit position or an original frozen bit position and an unknown bit at a second bit position, and an unknown bit at a second bit position, the second bit position being an unknown bit position; and

the first bit position is labeled as a frozen bit for a decoder.

10. The method of claim 7 , wherein:

the second linear component code word is the result of encoding a data word having the known bit at the first bit position and a zero at an unknown bit position.

11. The method of claim 1 , further comprising pruning an invalid candidate code word path based on the invalid candidate code word path being inconsistent with the known bit.

12. A user equipment (UE) comprising a processing circuit and being configured to perform a method of decoding, the method comprising:

receiving, by a user equipment (UE), a downlink control information (DCI) that is encoded;

identifying, by the UE, a first bit position of the DCI as a known bit; and

reducing a number of candidate code words for the DCI based on the known bit.

13. The UE of claim 12 , wherein the identifying the first bit position of the DCI as a known bit comprises:

decoding a first previous DCI by applying no known bit assumptions;

decoding a second previous DCI by applying no known bit assumptions; and

determining that the first bit position has a value that is the same in the first previous DCI and the second previous DCI.

14. The UE of claim 12 , wherein the method further comprises:

decoding the DCI by treating the first bit position as a known bit;

failing to successfully decode the DCI; and

decoding the DCI without treating the first bit position as a known bit.

15. The UE of claim 12 , wherein the method further comprises:

decoding a full set of an aggregation level (AL) of the DCI without treating any bit positions of the full set as a known bit;

failing to successfully decode the DCI; and

decoding the DCI by treating the first bit position as a known bit, the first bit position corresponding to a subset of the AL that matches with a previous successfully decoded DCI.

16. The UE of claim 12 , wherein the method further comprises decoding the DCI according to a successive cancellation list decoding method, wherein the UE is configured to treat, as a special node, a node having the known bit as a leaf node.

17. The UE of claim 12 , wherein the method further comprises decomposing an encoded code word into a first linear component code word and a second linear component code word.

18. The UE of claim 17 , wherein the method further comprises:

descrambling, by the UE, a channel log likelihood ratio (LLR) by the second linear component code word to produce a first descrambled output;

decoding, by a decoder of the UE, the DCI by using the first descrambled output as an input to the decoder to produce a first decoder output;

scrambling, by the UE, the first decoder output by the second linear component code word to produce a full decoder output comprising an original code comprising the first linear component code word and the second linear component code word;

performing a radio network temporary identifier (RNTI) de-masking operation on a last sixteen CRC bits of the original code; and

performing, by the UE, a cyclic redundancy code (CRC) check on the decoder output based on the performing of the RNTI de-masking operation.

19. The UE of claim 12 , wherein the method further comprises pruning an invalid candidate code word path based on the invalid candidate code word path being inconsistent with the known bit.

20. A user equipment (UE) comprising a means for processing and being configured to perform a method of decoding, the method comprising:

receiving, by the UE, a downlink control information (DCI) that is encoded;

identifying, by the UE, a first bit position of the DCI as a known bit; and

reducing a number of candidate code words for the DCI based on the known bit.

Assignments (2)

Continuity (2)

References Cited (12)