IP Library Granted Patent US 11,398,858
Granted Patent B2
US 11,398,858 · App. 17/107,807 · Granted Jul 26, 2022

Preparing CSI using a set of zero amplitude parameters

Inventors: Udar Mittal (Rolling Meadows, IL); Tyler Brown (Lake Zurich, IL); Khalid Zeineddine (Evanston, IL); Jiho Song (Ulsan, KR)
Assignee: Motorola Mobility LLC
H04B7/0626H04B7/0452H04B7/0469H04B7/0478H04B7/066H04B7/0697
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,398,858
App. No.
17/107,807
Granted
Jul 26, 2022
Kind
B2
Abstract

Apparatuses, methods, and systems are disclosed for preparing channel state information (“CSI”). One apparatus includes a processor and a transceiver configured to communicate with a base unit over a radio access network using at least one transmission layer and determining a total number of non-zero coefficients over a set of layers. The processor determines an indication of the total number of non-zero coefficients, where determining the indication of the total number of non-zero coefficients comprises encoding the total number of non-zero coefficients by selecting a codeword from a plurality of candidate codewords. The processor prepares CSI, where the CSI comprises the indication of the total number of non-zero coefficients and the transceiver transmits the CSI to the base unit.

Claims (31)

1. A method comprising:

communicating with a base unit over a radio access network using at least one transmission layer;

determining a total number of non-zero coefficients over a set of layers;

determining an indication of the total number of non-zero coefficients, wherein determining the indication of the total number of non-zero coefficients comprises encoding the total number of non-zero coefficients by selecting a single codeword from a plurality of candidate codewords in which the selected single codeword identifies the total number of non-zero coefficients to the base unit;

preparing channel state information (“CSI”), wherein the CSI comprises the selected single codeword encoding the total number of non-zero coefficients; and

transmitting the CSI to the base unit.

2. The method of claim 1 , wherein the non-zero coefficients are represented by bits, integers, or values in a range.

3. The method of claim 1 , wherein preparing the CSI comprises preparing a combined CSI for all of the at least one transmission layer.

4. The method of claim 1 , wherein each transmission layer in the at least one transmission layer comprises multiple beams.

5. The method of claim 1 , further comprising determining a set of zero coefficients and a set of non-zero coefficients over the set of layers, wherein determining the total number of non-zero coefficients over the set of layers is based on at least one of the set of non-zero coefficients and the set of zero coefficients.

6. The method of claim 1 , wherein encoding the total number of non-zero coefficients comprises encoding using a variable length code.

7. The method of claim 1 , wherein a length of each candidate codeword from the plurality of codewords is not more than the number of bits needed to code the total number of non-zero coefficients.

8. The method of claim 7 , further comprising determining locations of zero coefficients to generate a set of location bits, and wherein the CSI further comprises the set of location bits.

9. The method of claim 8 , wherein determining the locations of zero coefficients to generate the set of location bits comprises generating the set of location bits using a combinatorial coding or an enumerative coding.

10. The method of claim 8 , wherein determining the locations of zero coefficients to generate the set of location bits comprises encoding locations of non-zero coefficients using a combinatorial coding or an enumerative coding.

11. The method of claim 8 , wherein determining the locations of zero coefficients to generate the set of location bits comprises encoding the locations of zero coefficients using a combinatorial coding or an enumerative coding.

12. An apparatus comprising:

a transceiver that communicates with a base unit over a radio access network using at least one transmission layer; and

a processor that:

determines a total number of non-zero coefficients over a set of layers;

determines an indication of the total number of non-zero coefficients, wherein determining the indication of the total number of non-zero coefficients comprises encoding the total number of non-zero coefficients by selecting a single codeword from a plurality of candidate codewords in which the selected single codeword identifies the total number of non-zero coefficients to the base unit; and

prepares a channel state information (“CSI”), wherein the CSI comprises the selected single codeword encoding the total number of non-zero coefficients,

wherein the transceiver transmits the CSI to the base unit.

13. The apparatus of claim 12 , wherein the non-zero coefficients are represented by bits, integers, or values in a range.

14. The apparatus of claim 12 , wherein preparing the CSI comprises preparing a combined CSI for all of the at least one transmission layer.

15. The apparatus of claim 12 , wherein each transmission layer in the at least one transmission layer comprises multiple beams.

16. The apparatus of claim 12 , wherein the processor further determines a set of zero coefficients and a set of non-zero coefficients over the set of layers, wherein determining the total number of non-zero coefficients over the set of layers is based on at least one of the set of non-zero coefficients and the set of zero coefficients.

17. The apparatus of claim 12 , wherein encoding the total number of non-zero coefficients comprises encoding using a variable length code.

18. The apparatus of claim 12 , wherein a length of each candidate codeword from the plurality of codewords is not more than the number of bits needed to code the total number of non-zero coefficients.

19. The apparatus of claim 18 , further comprising determining locations of zero coefficients to generate a set of location bits, and wherein the CSI further comprises the set of location bits.

20. The apparatus of claim 19 , wherein determining the locations of zero coefficients to generate the set of location bits comprises encoding one of: locations of non-zero coefficients and locations of zero coefficients, said encoding using a combinatorial coding or an enumerative coding.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2021
From: MITTAL, UDAR; BROWN, TYLER; ZEINEDDINE, KHALID; SONG, JIHO
To: MOTOROLA MOBILITY LLC
Reel/Frame 055102/0480 →
Continuity (3)
Continuation 16422191 · May 24, 2019
Continuation 15844147 · Dec 15, 2017
Related Publication 20210083744A1 · Mar 18, 2021