IP Library Granted Patent US 11,177,926
Granted Patent B2
US 11,177,926 · App. 16/583,243 · Granted Nov 16, 2021

Methods and apparatus for providing soft and blind combining for PUSCH acknowledgement (ACK) processing

Inventors: Sabih Guzelgoz (Santa Clara, CA); Hong Jik Kim (Santa Clara, CA); Tejas Maheshbhai Bhatt (Santa Clara, CA); Fariba Heidari (Santa Clara, CA)
Assignee: Marvell Asia Pte, Ltd.
H04L5/0055H04L1/0026H04L1/0035H04L1/1664H04L5/0057H04L25/067H04W72/121H04W72/1268
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 11,177,926
App. No.
16/583,243
Granted
Nov 16, 2021
Kind
B2
Abstract

Methods and apparatus for providing soft and blind combining for PUSCH acknowledgement (ACK) processing. In an exemplary embodiment, a method includes soft-combining acknowledgement (ACK) bits received from a UE that are contained in a received sub-frame of symbols. The ACK bits are soft-combined using a plurality of scrambling sequences to generate a plurality of hypothetical soft-combined ACK bit streams. The method also includes receiving a parameter that identifies a selected scrambling sequence to be used. The method also includes decoding a selected hypothetical soft-combined ACK bit stream to generate a decoded ACK value, wherein the selected hypothetical soft-combined ACK bit stream is selected from the plurality of hypothetical soft-combined ACK bit streams based on the parameter.

Claims (29)

1. A method for processing received acknowledgement (ACK) bits, the method comprising:

soft-combining the ACK bits using a plurality of scrambling sequences to generate a plurality of hypothetical soft-combined ACK bit streams, respectively, wherein at least a portion of the soft-combining is performed;

receiving a parameter identifying a selected scrambling sequence and

decoding one hypothetical soft-combined ACK bit stream identified by the parameter to generate a decoded ACK value.

2. The method of claim 1 , wherein the decoding comprises outputting the one hypothetical soft-combined ACK bit stream as the decoded ACK value, if the one hypothetical soft-combined ACK bit stream represents a 1-bit ACK.

3. The method of claim 1 , wherein the decoding comprises decoding the one hypothetical soft-combined ACK bit stream according to an algorithm, if the one hypothetical soft-combined ACK bit stream represents a 2-bit ACK.

4. The method of claim 3 , wherein the algorithm comprises decoding the 2-bit ACK according to an equation expressed as (O 2 ACK =(O 1 ACK +O 1 ACK ) mod 2).

5. The method of claim 1 , further comprising storing the plurality of hypothetical soft-combined ACK bit streams in a memory.

6. The method of claim 1 , further comprising receiving the acknowledgement (ACK) bits in a subframe of symbols that are part of a received uplink transmission from user equipment (UE).

7. The method of claim 6 , further comprising receiving the uplink transmission as a Long-Term Evolution (LTE) uplink transmission.

8. The method of claim 6 , wherein the acknowledgement (ACK) bits are received over a physical uplink shared channel (“PUSCH”).

9. The method of claim 1 , further comprising performing the method to decode ACK bits received from a plurality of UEs.

10. An apparatus for processing received acknowledgement (ACK) bits, the apparatus comprising:

a soft-combiner that soft-combines the ACK bits using a plurality of scrambling sequences to generate a plurality of hypothetical soft-combined ACK bit streams, respectively, wherein the soft-combiner soft-combines at least a portion of the ACK bits;

receiving a parameter identifying a selected scrambling sequence; and

a decoder that decodes one hypothetical soft-combined ACK bit stream identified by the parameter to generate a decoded ACK value.

11. The apparatus of claim 10 , wherein the decoder outputs the one hypothetical soft-combined ACK bit stream as the decoded ACK value, if the one hypothetical soft-combined ACK bit stream represents a 1-bit ACK.

12. The apparatus of claim 10 , wherein the decoder decodes the one hypothetical soft-combined ACK bit stream according to an algorithm, if the one hypothetical soft-combined ACK bit stream represents a 2-bit ACK.

13. The apparatus of claim 12 , wherein the algorithm comprises an equation expressed as (O 2 ACK =(O 0 ACK +O 1 ACK ) mod 2).

14. The apparatus of claim 10 , further comprising a memory that stores the plurality of hypothetical soft-combined ACK bit streams.

15. The apparatus of claim 10 , wherein the received ACK bits are received in a subframe of symbols that are part of a received uplink transmission from user equipment (UE).

16. The apparatus of claim 15 , wherein the received the uplink transmission is a Long-Term Evolution (LTE) uplink transmission.

17. The apparatus of claim 15 , wherein the ACK bits are received over a physical uplink shared channel (“PUSCH”).

18. An apparatus for processing received acknowledgement (ACK) bits, the apparatus comprising:

means for soft-combining the ACK bits using a plurality of scrambling sequences to generate a plurality of hypothetical soft-combined ACK bit streams, respectively, wherein at least a portion of the ACK bits are soft-combined;

means for receiving a parameter identifying a selected scrambling sequence; and

means for decoding one hypothetical soft-combined ACK bit stream identified by the parameter to generate a decoded ACK value.

19. The apparatus of claim 18 , wherein the means for decoding outputs the one hypothetical soft-combined ACK bit stream as the decoded ACK value, if the one hypothetical soft-combined ACK bit stream represents a 1-bit ACK.

20. The apparatus of claim 18 , wherein the means for decoding decodes the one hypothetical soft-combined ACK bit stream according to an algorithm, if the one hypothetical soft-combined ACK bit stream represents a 2-bit ACK and wherein the algorithm comprises an equation expressed as (O 2 ACK =(O 0 ACK +O 1 ACK ) mod 2).

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 15, 2020
From: CAVIUM INTERNATIONAL
To: MARVELL ASIA PTE, LTD.
Reel/Frame 053179/0320 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 17, 2020
From: CAVIUM, LLC
To: CAVIUM INTERNATIONAL
Reel/Frame 051948/0807 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 25, 2019
From: GUZELGOZ, SABIH; KIM, HONG JIK; BHATT, TEJAS MAHESHBAI; HEIDARI, FARIBA
To: CAVIUM, LLC
Reel/Frame 050492/0875 →