Data transmission method and apparatus

Patent metadata

Field	Value
Publication number	US-10944462-B2
Application number	US-201916671722-A
Country	US
Kind code	B2
Filing date	Nov 1, 2019
Priority date	May 4, 2017
Publication date	Mar 9, 2021
Grant date	Mar 9, 2021

Abstract

Embodiments of this application provide a data transmission method and apparatus. The method includes: sending, by a network device, first information by using first signaling, where the first information is used to indicate a quantity N of transmitted precoding matrix indicators TPMIs in second signaling; and sending, by the network device, resource scheduling information and the N TPMIs by using the second signaling, where the resource scheduling information is used to indicate n scheduled physical resource blocks PRBs of M PRBs included in a communication bandwidth, all or some of the N TPMIs is used to indicate a precoding matrix of the n PRBs.

First claim

What is claimed is:

1. A data transmission method, comprising:
receiving, by a terminal device, a first signaling, wherein the first signaling comprises first information, the first information indicating a quantity N of precoding matrix indicators (TPMIs) to be transmitted in a second signaling, and N being a positive integer; and
after receiving the first signaling, receiving, by the terminal device, the second signaling based on the first signaling, the second signaling comprising resource scheduling information of the terminal device and the second signaling comprising the N TPMIs, the resource scheduling information indicating a quantity n of scheduled physical resource blocks (PRBs) of a quantity M of PRBs comprised in a communication bandwidth, wherein the n PRBs are classified into N PRB groups, each of the N PRB groups comprises at least one PRB, the N TPMIs indicate N precoding matrices of the n PRBs, and each of the N TPMIs indicates a respective corresponding precoding matrix of a corresponding PRB group of the N PRB groups.

2. The method according to claim 1 , wherein:
the first information is an integer value of the quantity N.

3. The method according to claim 1 , wherein an i th TPMI of the N TPMIs indicates a corresponding precoding matrix of x, PRBs of the M PRBs, i∈{1, . . . , N}, M, n, and x, are all positive integers, x 1 + . . . +x N ≤M, quantities of PRBs comprised in N-k PRB groups of the N PRB groups are respectively z 1 , . . . , and z N-k , where z 1 =x i 1 , z 2 =x i 2 , . . . , and z N-K =x i N-k , quantities of PRBs comprised in k PRB groups other than the N-k PRB groups of the N PRB groups are respectively y 1 , . . . , and y k , y 1 , . . . , and y k are all positive integers and meet a condition in which y i + . . . +y k =n−x 1 − . . . −x N-k , and wherein k is a positive integer less than N.

4. The method according to claim 1 , wherein the first information comprises a quantity of bits in a TPMI field in the second signaling, and the quantity of bits in the TPMI field corresponds to the quantity N of TPMIs.

5. The method according to claim 1 , wherein the first information comprises a bandwidth with m PRBs, and the m PRBs are associated with the N TPMIs, and wherein m is a positive integer, and m is less than the quantity M.

6. The method according to claim 1 , wherein, a quantity of PRBs comprised in each of N-k′ PRB groups of the N PRB groups is

⌈

n
N

⌉

,

quantities of PRBs comprised in k′ PRB groups other than the N-k′ PRB groups of the N PRB groups are y 1 ′ , . . . , and y k′ ′ , and y 1 ′ , . . . , and y k′ ′ , are positive integers and meet a condition in which

y
1
′

+
…
+

y

k
′

′

=

n
-

(

N
-

k
′

)

⁢

⌈

n
N

⌉

,

and wherein k′ is a positive integer less than N.

7. The method according to claim 1 , further comprising:
precoding, by the terminal device, to-be-sent data based on the resource scheduling information and the N TPMIs.

8. A data transmission apparatus, comprising:
a transmitter, configured to:
send first information by using a first signaling, wherein the first information indicates a quantity N of precoding matrix indicators (TPMIs) to be transmitted in a second signaling, and N is a positive integer; and
after sending the first information, send resource scheduling information and the N TPMIs by using the second signaling, wherein the resource scheduling information indicates a quantity n of scheduled physical resource blocks (PRBs) of a quantity M of PRBs comprised in a communication bandwidth, the n PRBs are classified into N PRB groups, each of the N PRB groups comprises at least one PRB, the N TPMIs indicate N precoding matrices of the N PRBs, and each of the N TPMIs indicates a respective corresponding precoding matrix of a corresponding PRB group of the N PRB groups.

9. The apparatus according to claim 8 , wherein:
the first information is an integer value of the quantity N.

10. The apparatus according to claim 8 , wherein an i th TPMI of the N TPMIs indicates a corresponding precoding matrix of x, PRBs of the M PRBs, i∈{1, . . . , N}, M, n, and x i are all positive integers, x 1 + . . . x N ≤+M, quantities of PRBs comprised in N-k PRB groups of the N PRB groups are respectively z 1 , . . . , and z N-k , z 1 =x i 1 , z 2 =x i 2 , . . . , and z N-k =x i N-k , quantities of PRBs comprised in k PRB groups other than the N-k PRB groups of the N PRB groups are respectively and y 1 , . . . , and y k , and y 1 , . . . , and y k are all positive integers and meet a condition in which y 1 + . . . +y k =n−x 1 − . . . −x N-k , and wherein k is a positive integer less than the quantity N.

11. The apparatus according to claim 8 , wherein the first information comprises a quantity of bits in a TPMI field in the second signaling, and the quantity of bits in the TPMI field corresponds to the quantity N of TPMIs.

12. The apparatus according to claim 8 , wherein the first information comprises a bandwidth with m PRBs, and the m PRBs are associated with the N TPMIs, and wherein m is a positive integer, and m is less than the quantity M.

13. The apparatus according to claim 8 , wherein a quantity of PRBs comprised in each of N-k′ PRB groups of the N PRB groups is

⌈

n
N

⌉

,

quantities of PRBs comprised in k′ PRB groups other than the N-k′ PRB groups of the N PRB groups are y 1 ′ , . . . , and y k′ ′ , and y 1 ′ , . . . , and y k′ ′ , are positive integers and meet a condition in which

y
1
′

+
…
+

y

k
′

′

=

n
-

Assignees

• Huawei Tech Co Ltd

Inventors

• Li Xueru
• Liu Kunpeng

Classifications

• H04W72/12

  Wireless traffic scheduling · CPC title

• H04W72/23

  in the downlink direction of a wireless link, i.e. towards a terminal · CPC title

• H04L5/0094

  Indication of how sub-channels of the path are allocated · CPC title

• H04L1/0025

  Transmission of mode-switching indication · CPC title

• H04L1/00

  Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)} · CPC title