IP Library Granted Patent US 10,887,879
Granted Patent B2
US 10,887,879 · App. 16/786,332 · Granted Jan 5, 2021

Scrambling sequence design for embedding receiver ID into frozen bits for blind detection

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 10,887,879
App. No.
16/786,332
Granted
Jan 5, 2021
Kind
B2
Abstract

Methods and devices are described for encoding and decoding control information that has been modulated based on one or more identifiers of the transmitter and/or receiver. Some embodiments describe scrambling sequence design for multi-mode block discrimination on downlink control information (DCI) blind detection. Separate scrambling masks may be applied to disparate bit fields within a coded DCI message, wherein each of the scrambling masks is derived from a unique identifier associated with either the transmitter or the intended receiver. The scrambling masks may be used by the receiver to perform early termination of the decoding process, to mitigate intercell interference, and to verify that the receiver is the intended receiver.

Claims (73)

1. A receiver, comprising:

a radio; and

a processor coupled to the radio;

wherein the processor and the radio are configured to:

receive a first polar coded message in a wireless manner from a transmitter, the first polar coded message comprising an encoding of a plurality of frozen bits and a plurality of information bits;

implement a decoding procedure on the first polar coded message, wherein, in implementing the decoding procedure, the receiver is configured to:

begin a decode of the first polar coded message to produce a subset of the frozen bits;

calculate a moving average of a number of matches between the subset of frozen bits and a corresponding subset of reference bits, wherein the reference bits are based on an identifier of the receiver; and

abort the decoding procedure based on a determination that the moving average is below a threshold.

2. The receiver of claim 1 ,

wherein a size of the moving average is determined to balance a reliability and a latency associated with the decoding procedure.

3. The receiver of claim 1 ,

wherein the reference bits are a pseudorandom sequence of bits generated from the identifier of the receiver, wherein the pseudorandom sequence of bits is the same length as the plurality of frozen bits.

4. The receiver of claim 1 ,

wherein the subset of the plurality of frozen bits is selected to balance a reliability and a latency associated with the decoding procedure.

5. The receiver of claim 1 ,

wherein the first polar coded message is received and the decoding procedure is initiated as part of a downlink blind detection procedure.

6. The receiver of claim 1 ,

wherein the processor and the radio are further configured to:

receive a second polar coded message in a wireless manner from the transmitter; and

subsequent to aborting the decoding procedure on the first polar coded message, implement the decoding procedure on the second polar coded message.

7. The receiver of claim 1 ,

wherein the processor comprises a plurality of parallelized processing elements;

wherein the radio and the processor are further configured to:

receive one or more additional polar coded messages in a wireless manner from the transmitter; and

implement, by separate ones of the parallelized processing elements; the decoding procedure on each of the received one or more additional polar coded messages.

8. The receiver of claim 1 ,

wherein the processor comprises a plurality of parallelized processing elements;

wherein the decoding procedure comprises a successive cancellation list (SCL) decoding procedure; and

wherein separate ones of the plurality of parallelized processing elements are configured to perform decoding procedures on separate respective bit paths of the SCL decoding procedure.

9. The receiver of claim 1 ,

wherein, in implementing the decoding procedure on the first polar coded message, the receiver is further configured to:

continue the decode of the first polar coded message to produce the plurality of information bits based on a determination that the moving average is above the threshold.

10. A method for decoding control information, comprising:

by a receiver:

receiving a first polar coded message in a wireless manner from a transmitter, the first polar coded message comprising an encoding of a plurality of frozen bits and a plurality of information bits;

implementing a decoding procedure on the first polar coded message by:

beginning decoding the first polar coded message to produce a subset of the frozen bits;

calculating a moving average of a number of matches between the subset of frozen bits and a corresponding subset of reference bits, wherein the reference bits are based on an identifier of the receiver; and

aborting the decoding procedure based on a determination that the moving average is below a threshold.

11. The method of claim 10 ,

wherein a size of the moving average is determined to balance a reliability and a latency associated with the decoding procedure.

12. The method of claim 10 ,

wherein the reference bits are a pseudorandom sequence of bits generated from the identifier of the receiver, wherein the pseudorandom sequence of bits is the same length as the plurality of frozen bits.

13. The method of claim 10 ,

wherein the first polar coded message is received and the decoding procedure is initiated as part of a downlink blind detection procedure.

14. The method of claim 10 , the method further comprising:

receiving a second polar coded message in a wireless manner from the transmitter; and

subsequent to aborting the decoding procedure on the first polar coded message, implementing the decoding procedure on the second polar coded message.

15. The method of claim 10 ,

wherein the receiver comprises a plurality of parallelized processing elements;

wherein the method further comprises:

receiving one or more additional polar coded messages in a wireless manner from the transmitter; and

implementing, by separate ones of the parallelized processing elements;

the decoding procedure on each of the received one or more additional polar coded messages.

16. The method of claim 10 ,

wherein the receiver comprises a plurality of parallelized processing elements,

wherein the decoding procedure comprises a successive cancellation list (SCL) decoding procedure, and

wherein said implementing the decoding procedure comprises implementing, by separate ones of the plurality of parallelized processing elements, the decoding procedure on separate respective bit paths of the SCL decoding procedure.

17. The method of claim 10 , wherein implementing the decoding procedure further comprises:

continuing decoding the first polar coded message to produce the plurality of information bits based on a determination that the moving average is above the threshold.

18. A non-transitory computer-readable memory medium storing program instructions which, when executed by one or more processors of a receiver, cause the receiver to:

receive a first polar coded message in a wireless manner from a transmitter, the first polar coded message comprising an encoding of a plurality of frozen bits and a plurality of information bits;

implement a decoding procedure on the first polar coded message, wherein implementing the decoding procedure comprises causing the receiver to:

begin decoding of the first polar coded message to produce a subset of the frozen bits;

calculate a moving average of a number of matches between the subset of frozen bits and a corresponding subset of reference bits, wherein the reference bits are based on an identifier of the receiver; and

abort the decoding procedure based on a determination that the moving average is below a threshold.

19. The non-transitory computer-readable memory medium of claim 18 ,

wherein a size of the moving average is determined to balance a reliability and a latency associated with the decoding procedure.

20. The non-transitory computer-readable memory medium of claim 18 ,

wherein the one or more processors comprise a plurality of parallelized processing elements,

wherein the decoding procedure comprises a successive cancellation list (SCL) decoding procedure, and

wherein said implementing the decoding procedure comprises implementing, by separate ones of the plurality of parallelized processing elements, the decoding procedure on separate respective bit paths of the SCL decoding procedure.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 8, 2025
From: PACIFIC CAP ACQUISITION FUND, LLC
To: HYPERX HOLDINGS LLC
Reel/Frame 072342/0090 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 6, 2025
From: COHERENT LOGIX, INC.
To: PACIFIC CAP ACQUISITION FUND, LLC
Reel/Frame 072370/0394 →
SECURITY INTEREST Recorded Apr 11, 2024
From: COHERENT LOGIX, INCORPORATED
To: ACP POST OAK CREDIT I LLC
Reel/Frame 067097/0363 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 9, 2020
From: SHELBY, KEVIN A.; LIU, FENG
To: COHERENT LOGIX, INCORPORATED
Reel/Frame 052052/0113 →