INFORMATION TRANSMISSION METHOD, DEVICE, AND STORAGE MEDIUM

Information

  • Patent Application
  • 20240291541
  • Publication Number
    20240291541
  • Date Filed
    October 28, 2022
    2 years ago
  • Date Published
    August 29, 2024
    2 months ago
Abstract
Provided are an information transmission method, a device and a storage medium. The information transmission method applied to a first communication node includes: receiving configuration information of a second communication node and reporting channel state information to the second communication node according to the configuration information. The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator. A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.
Description
TECHNICAL FIELD

The present application relates to the communication field and, in particular, to an information transmission method, a device and a storage medium.


BACKGROUND

In a wireless communication system, a base station may determine a data transmission strategy according to a channel state represented by received channel state information and transmit data according to the data transmission strategy to improve the data transmission efficiency. Thus, how to design a processing mechanism of the channel state information to improve the accuracy of the obtained channel state and reduce the used resource overhead and the system complexity remains an urgent problem to be solved.


SUMMARY

Embodiments of the present application provide an information transmission method. The method is applied to a first communication node and includes the following.


Configuration information of a second communication node is received.


Channel state information is reported to the second communication node according to the configuration information.


The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator.


A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


Embodiments of the present application provide an information transmission method. The method is applied to a second communication node and includes the following.


Configuration information is determined.


The configuration information is sent to a first communication node to enable the first communication node to report channel state information according to the configuration information.


The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator. A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


Embodiments of the present application provide a communication device. The communication device includes a communication module, a memory and one or more processors.


The communication module is configured to perform communication interaction between a first communication node and a second communication node.


The memory is configured to store one or more programs.


When executed by the one or more processors, the one or more programs cause the one or more processors to perform the method according to any one of the preceding embodiments.


Embodiments of the present application provide a storage medium storing a computer program which, when executed by a processor, causes the processor to perform the method according to any one of the preceding embodiments.





BRIEF DESCRIPTION OF DRAWINGS


FIG. 1 is a flowchart of an information transmission method according to an embodiment of the present application.



FIG. 2 is a flowchart of another information transmission method according to an embodiment of the present application.



FIG. 3 is a block diagram illustrating the structure of an information transmission apparatus according to an embodiment of the present application.



FIG. 4 is a block diagram illustrating the structure of another information transmission apparatus according to an embodiment of the present application.



FIG. 5 is a diagram illustrating the structure of a communication device according to an embodiment of the present application.





DETAILED DESCRIPTION

Embodiments of the present application are described hereinafter in conjunction with drawings. The present application is described hereinafter in conjunction with the embodiments and the drawings. The examples listed hereinafter are merely intended to explain the present application and not to limit the scope of the present application.


Wireless communications have developed to the 5th communication technology. Long-term evolution (LTE) in the 4th wireless communication technology and New Radio (NR) in the 5th wireless communication technology are based on orthogonal frequency-division multiplexing (OFDM). In OFDM, the minimum frequency domain unit is a subcarrier, and the minimum time domain unit is an OFDM symbol. To facilitate the use of frequency domain resources, a resource block (RB) is defined, and one resource block is defined as a certain number of successive subcarriers. A bandwidth part (BWP) is also defined, and one bandwidth part is defined as another certain number of successive resource blocks on one carrier. To facilitate the use of time domain resources, a slot is defined, and one slot is defined as yet another certain number of successive OFDM symbols.


A method for acquiring channel state information in a wireless communication system and a method for transmitting data using the channel state information include the following steps. A base station sends a reference signal. A terminal measures the reference signal, determines channel state information from the base station to the terminal and reports the channel state information to the base station. The base station receives the channel state information reported by the terminal. The base station determines a data transmission strategy according to a channel state represented by the received channel state information and transmits data so as to improve the data transmission efficiency. The accuracy of the channel state represented by the channel state information affects the transmission strategy of the base station so as to affect the data transmission efficiency. Moreover, the base station needs to occupy the overhead of downlink resources for sending the reference signal, and the terminal needs to occupy the overhead of uplink resources for uploading the channel state information. On the other hand, increased system complexity increases the cost of the system and the energy loss. Therefore, multiple factors need to be comprehensively considered in design.


The development of wireless communication technology needs to further design a processing mechanism of the channel state information to improve the accuracy of the obtained channel state and reduce the used resource overhead and the system complexity.


The reference signal sent to the terminal by the base station is a downlink reference signal. Downlink reference signals for reporting the channel state information in an LTE system include a cell-specific reference signal (CRS) and a channel state information reference signal (CSI-RS). Downlink reference signals for reporting the channel state information in an NR system includes a CSI-RS. The CSI-RS is carried by a channel state information reference signal resource. The channel state information reference signal resource is formed by code-division multiplexing (CDM) groups. One CDM group is formed by wireless resource elements. A CSI-RS of a group of CSI-RS ports is multiplexed thereon by using code-division multiplexing.


The content of the channel state information transmitted between the base station and the terminal includes a channel quality indicator (CQI) for indicating the quality of a channel or a precoding matrix indicator (PMI) for indicating a precoding matrix applied to antennas of a base station. One type of CQI reporting format is wideband CQI reporting, that is, one channel quality is reported for a channel state information reporting band, and the channel quality corresponds to the entire channel state information reporting band. Another type of CQI reporting format is subband CQI reporting, that is, channel qualities are provided for the channel state information reporting band in unit of subbands, where one channel quality corresponds to one subband, that is, one channel quality is reported for each subband of the channel state information reporting band. The each subband is a frequency domain unit and is defined as N successive RBs, where N is a positive integer. For ease of description, the each subband is referred to as a channel quality indicator subband, or a CQI subband, or a subband in the present application. N is referred to as the size of the CQI subband, or the CQI subband size, or the subband size. The bandwidth part (BWP) is divided into subbands. The channel state information reporting band is defined by a subset of the subbands of the bandwidth part (BWP). The channel state information reporting band is a band on which channel state information needs to be reported.


A manner for determining a channel quality is determined according to the strength of the reference signal received by the terminal. Another manner for determining a channel quality is determined according to the signal-to-noise ratio of the received reference signal. On the channel state information reporting band, if the channel quality does not change significantly, reporting the CQI in the manner of the wideband CQI reporting can reduce the resource overhead for reporting the CQI; if the channel quality differs significantly in the frequency domain, reporting the CQI in the manner of the subband CQI reporting can increase the accuracy of reporting the CQI.


One type of PMI reporting format is wideband PMI reporting, that is, one PMI is reported for the channel state information reporting band, and the PMI corresponds to the entire channel state information reporting band. Another type of PMI reporting format is subband PMI reporting, that is, one PMI or one component of the PMI is reported for the each subband of the channel state information reporting band. For example, the PMI is composed of X1 and X2, and one manner for reporting one component of the PMI for the each subband of the channel state information reporting band includes: reporting one X1 for the entire band, and reporting one X2 for the each subband; and another manner includes: reporting one X1 and one X2 for the each subband.


Another type of PMI reporting format is that the reported PMI indicates R precoding matrices for the each subband, where R is a positive integer. From the perspective of feeding back the frequency domain granularity of a precoding matrix, R also denotes the number of precoding matrix subbands included in the each subband or the number of precoding matrix subbands included in each CQI subband.


A method for reporting channel state information includes that a terminal receives configuration information (including first configuration information and second configuration information) of a base station, the terminal receives a channel state information reference signal transmitted by the base station according to the configuration information, and the terminal reports channel state information according to the configuration information.


The channel state information includes a precoding matrix indicator. A precoding matrix is determined by a first group of vectors or by a first group of vectors and a second group of vectors. The first group of vectors include L vectors, and the second group of vectors include Mv vectors, where L and Mv are positive integers. One vector in the first group of vectors corresponds to one port of the channel state information reference signal. One vector in the second group of vectors is a discrete Fourier transform (DFT) vector whose index is n3(f). An element of the DTF vector whose index is n3(f) is:









e

j



2

π


tn
3

(
f
)




N
3




.

t

=

{

0
,
1
,


,


N
3

-
1


}


,




and N3 denotes the number of precoding matrices.


t denotes an index of the element in the DFT vector and has values of 0, 1, . . . , N3−1. t may also denote an index of the precoding matrix. t may also denote an index of a frequency domain unit. One value of t corresponds to one frequency domain unit. For example, a precoding matrix whose index is t and that corresponds to an element whose index is t of the DFT vector in the second group of vectors is a precoding matrix of a frequency domain unit whose index is t.


The precoding matrix may be composed of only the first group of vectors or may also be composed of the first group of vectors and the second group of vectors. The precoding matrix is composed of only the first group of vectors, where one layer is exemplified as: W=W1W2. W denotes the precoding matrix, W1 denotes a matrix formed by the first group of vectors, and W2 denotes a coefficient combining the first group of vectors to form the precoding matrix and is denoted by a matrix. The precoding is matrix composed of the first group of vectors and the second group of vectors, where one layer is exemplified as: W=W1W2Wf. W denotes the precoding, W1 denotes a matrix formed by the first group of vectors, Wf denotes a matrix formed by the second group of vectors, and W2 denotes a coefficient combining the first group of vectors and the second group of vectors to form the precoding matrix and is denoted by a matrix.


In order for the terminal to report the CSI, the base station configures CSI-RS resources to the terminal, where the number of ports of the CSI-RS resources is P. The terminal selects K1 ports from the P CSI-RS ports, where L ports are selected in each polarization direction, and K1=2L. Each port in the L ports is mapped to one vector in the first group of vectors. The number of coefficients reported by the terminal to form the one layer of the precoding matrix does not exceed K0, and the total number of coefficients reported to form all the layers of the precoding matrix does not exceed 2K0, where K0=┌2LMvβ┐, and β denotes a parameter configured by the base station to the terminal. The terminal reports the number KNZ of reported coefficients to the base station.


One port whose serial number is mi is mapped to one vector vmi in such a manner that vmi is a vector including P/2 elements, where the (mi mod P/2)-th element is 1, and the remaining elements are 0. mod denotes a module operation, mi denotes a dividend, P/2 denotes a divisor, and the first element is the 0-th element. An example in which P equals to 8, and mi equals to 2 is used, and v2=[0,0,1,0]T, where T denotes transposition.


An example in which the L vectors form W1 is illustrated, and







W
1

=


[





v

m
0





v

m
1








v

m

L
-
1







O


O


O


O






O


O


O


O





v

m
0





v

m
1








v

m

L
-
1







]

.





O denotes a vector including P/2 elements with all elements being 0.


A vector in the second group of vectors is denoted as y(f) where f=0,1, . . . , Mv−1. For example, Mv vectors in the second group of vectors are y(0), y(1), . . . , y(Mv−1) and are row vectors. An example in which the Mv vectors in the second group of vectors form Wf is illustrated as:







W
f

=


[




y

(
0
)







y

(
1
)












y

(


M
v

-
1

)





]

.





In the case where the precoding matrix is composed of only the first group of vectors, the one layer of the precoding matrix is exemplified as: W=W1W2. W denotes the precoding matrix, W1 denotes the matrix formed by the first group of vectors, and the dimension is P×2L. That is, a first dimension is P, and a second dimension is 2L. W2 denotes the coefficient combining the first group of vectors to form the precoding matrix and is denoted by the matrix, and the dimension is 2L×1. That is, a first dimension is 2L, a second dimension is 1, and the number of elements included in W2 is 2L. That is, the number of coefficients forming the one layer of the precoding matrix is 2L.


In the case where the precoding matrix is composed of the first group of vectors and the second group of vectors, the one layer of the precoding matrix is exemplified as: W=W1W2Wf. W denotes the precoding matrix, W1 denotes the matrix formed by the first group of vectors, and the dimension is P×2L. That is, the first dimension is P, and the second dimension is 2L. We denotes the matrix formed by the second group of vectors, and the dimension is Mv×N3. That is, a first dimension is Mv, and a second dimension is N3. W2 denotes the coefficient combining the first group of vectors and the second group of vectors to form the precoding matrix and is denoted by the matrix, and the dimension is 2L×Mv. That is, a first dimension is 2L, a second dimension is Mv, and the number of elements included in W2 is 2LMv. That is, the number of coefficients forming the one layer of the precoding matrix is 2LMv.


To save the overhead for the terminal to report the precoding matrix indicator, the terminal only reports a part of the coefficients forming the precoding matrix. For example, the base station configures the parameter β to the terminal to determine the parameter K0, and K0=┌2LMvβ┐, where β denotes a positive integer less than or equal to 1. For the coefficients forming the one layer of the precoding matrix, the number of coefficients reported to the base station by the terminal does not exceed K0. For the coefficients forming all the layers of the precoding matrix, the total number of coefficients reported to the base station by the terminal does not exceed 2K0. In order to enable the base station to receive the reported coefficients, the terminal also reports the number KNZ of the reported coefficients and a bitmap to the base station so as to indicate which coefficients in the coefficients forming the precoding matrix are reported by using non-zero bits of the bitmap. KNZ denotes the number K of coefficients whose values are not 0 and that are reported by the terminal to the base station.


In an embodiment, FIG. 1 is a flowchart of an information transmission method according to an embodiment of the present application. This embodiment may be performed by a first communication node. The first communication node may be a terminal side (such as a user equipment). As shown in FIG. 1, this embodiment includes the steps S110 to S120.


In S110, configuration information of a second communication node is received.


In S120, channel state information is reported to the second communication node according to the configuration information.


The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator.


A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


In the embodiment, the strongest coefficient indicator refers to an indicator of the strongest coefficient in the first coefficients. The first coefficients refer to coefficients combining the first group of vectors to form the precoding matrix or combining the first group of vectors and the second group of vectors to form the precoding matrix. The strongest coefficient refers to a coefficient having the maximum amplitude in the first coefficients. Exemplarily, the maximum value of the amplitude is 1, so the strongest coefficient is a coefficient whose amplitude is 1 in the first coefficients. Certainly, in the case where a coefficient whose amplitude is 1 is not present in the first coefficients, a coefficient having the maximum amplitude in the first coefficients is searched and used as the strongest coefficient. In the embodiment, the strongest coefficient indicator is used to indicate the index of the strongest coefficient in the first coefficients. In the embodiment, the strongest coefficient indicator indicates the index of the strongest coefficient in the first coefficients so that coefficients of the index can be directly reported to the second communication node, and the first communication node does not need to report all the coefficients to the second communication node to enable the second communication node to analyze and determine the strongest coefficient so that the resource overhead for reporting the coefficients can be saved. Alternatively, the strongest coefficient indicator indicates the index of the strongest coefficient in the first coefficients, and the strongest coefficient uses a predefined value to save the direct reporting of an amplitude value and a phase value of the strongest coefficient so that the resource overhead for reporting the amplitude value and the phase value of the strongest coefficient can be saved. Since the strongest coefficient uses the predefined value, the accuracy of the used value of the strongest coefficient can be improved so that the accuracy of the reported precoding matrix can be improved, thereby improving the performance of the reported precoding matrix. For example, in a normalized scenario, the strongest coefficient is predefined as 1, that is, the amplitude value of the strongest coefficient is predefined as 1, and the phase value of the strongest coefficient is predefined as 0. The strongest coefficient indicator indicates the index of the strongest coefficient, without directly reporting the amplitude value and the phase value of the strongest coefficient. The index of the strongest coefficient may determine that a corresponding coefficient is the strongest coefficient with its amplitude value being one and its phase value being 0.


In an embodiment, the index of the strongest coefficient include an index of a first dimension and an index of a second dimension.


The index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors. It is to be understood that the precoding matrix is a matrix composed of two dimensions. Accordingly, the first coefficients for forming the precoding matrix also include two dimensions, that is, a first dimension and a second dimension. Accordingly, index of each first coefficient are composed of two dimensions, that is, the index of the strongest coefficient also include two dimensions, that is, the index of the first dimension and the index of the second dimension. The index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors. The one vector in the first group of vectors corresponds to the one port of the channel state information reference signal, and one element in one vector in the second group of vectors corresponds to one precoding matrix.


In an embodiment, a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors. In the embodiment, the number of vectors in the second group of vectors refers to the total number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors. In the embodiment, each time the index of the first dimension is changed by 1, the strongest coefficient indicator is correspondingly changed by the value of the number of vectors in the second group of vectors. Accordingly, each time the index of the first dimension is changed by n, the value of the strongest coefficient indicator is correspondingly changed by n times the value of the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors. In the embodiment, the number of vectors in the first group of vectors refers to the total number of vectors in the first group of vectors. In the embodiment, each time the index of the second dimension is changed by 1, the strongest coefficient indicator is correspondingly changed by twice the value of the number of vectors in the first group of vectors. Accordingly, each time the index of the second dimension is changed by n, the value of the strongest coefficient indicator is correspondingly changed by 2n times the value of the number of vectors in the first group of vectors.


In an embodiment, in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is the same as the index of the first dimension, and the index of the second dimension is 0. In the embodiment, in the case where the number of vectors in the second group of vectors is 1, the strongest coefficient indicator is the same as the index of the first dimension, and the index of the second dimension is 0.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the second dimension and a product of the index of the first dimension and the number of vectors in the second group of vectors. In the case where the number of vectors in the second group of vectors is 2, the value of the strongest coefficient indicator equals the sum of the value of the index of the second dimension and the product of the index of the first dimension and the number of vectors of the second group of vectors.


In an embodiment, the value range of the index of the first dimension is between 0 and twice the number of vectors in the first group of vectors minus 1, and the values of the index of the second dimension include 0 and 1.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the first dimension and a product of the index of the second dimension and the number of vectors in the first group of vectors.


In an embodiment, the strongest coefficient indicator and the index of the second dimension have the same adjustment value. In the embodiment, each time the index of the second dimension is adjusted by 1, the value of the strongest coefficient indicator is correspondingly adjusted by 1. Certainly, each time the index of the second dimension is adjusted by n, the value of the strongest coefficient indicator is correspondingly adjusted by n. n is a positive integer greater than 0.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and the number of vectors in the first group of vectors. In the embodiment, each time the index of the second dimension is adjusted by 1, the value of the strongest coefficient indicator is correspondingly adjusted by the product of the value of the index of the second dimension and the number of vectors in the first group of vectors. Accordingly, each time the index of the second dimension is adjusted by n, the value of the strongest coefficient indicator is correspondingly adjusted by a product of the value of the index of the second dimension, the number of vectors in the first group of vectors and n. n is 0 or 1.


In an embodiment, FIG. 2 is a flowchart of another information transmission method according to an embodiment of the present application. This embodiment may be performed by a second communication node. The second communication node may be a base station. As shown in FIG. 2, this embodiment includes the steps S210 to S220.


In S210, configuration information is determined.


In S220, the configuration information is sent to a first communication node to enable the first communication node to report channel state information according to the configuration information.


The channel state information includes precoding matrix indicators, and the precoding matrix indicators include a strongest coefficient indicator. A precoding matrix corresponding to each precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to each precoding matrix indicator is formed by combining first coefficients with a group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


In an embodiment, the index of the strongest coefficient include an index of a first dimension and an index of a second dimension.


The index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors.


In an embodiment, a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors.


In an embodiment, in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is the same as the index of the first dimension, and the index of the second dimension is 0.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the second dimension and a product of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, the value range of the index of the first dimension is between 0 and twice the number of vectors in the first group of vectors minus 1, and the values of the index of the second dimension include 0 and 1.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the first dimension and a product of the index of the second dimension and the number of vectors in the first group of vectors.


In an embodiment, the strongest coefficient indicator and the index of the second dimension have the same adjustment value.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and the number of vectors in the first group of vectors.


It is to be noted that explanations of parameters in the information transmission method applied to the second communication node are referred to the descriptions in the information transmission method applied to the first communication node in the preceding embodiments, and details are not repeated herein.


In an embodiment, the reporting process of the channel state information is illustrated using an example in which the first communication node is a terminal, and the second communication node is a base station. In the embodiment, the steps for reporting the channel state information include that the terminal receives configuration information of the base station and reports channel state information according to the configuration information.


The channel state information includes the precoding matrix indicators. The precoding matrix corresponding to the each precoding matrix indicator is determined by the first group of vectors or by the first group of vectors and the second group of vectors. The first group of vectors include L vectors, and the second group of vectors include Mv vectors, and L and Mv are positive integers. The one vector in the first group of vectors corresponds to the one port of the channel state information reference signal, and one element in one vector in the second group of vectors corresponds to one precoding matrix.


For example, the configuration information includes the value of L or includes the value of L and the value of Mv. For another example, the configuration information includes version information of a codebook of the precoding matrix. For another example, the configuration information indicates a reference signal for measuring the channel state information when the channel state information is reported.


The precoding matrix indicators include first coefficient indicators. The first coefficient indicators are configured to indicate the first coefficients. The first coefficients are coefficients combining the first group of vectors to form the precoding matrix or combining the first group of vectors and the second group of vectors to form the precoding matrix.


Indexes of the first coefficients are used for identifying coefficients in the first coefficients. The indexes of the first coefficients include the index i of the first dimension and the index f of the second dimension. The index i of the first dimension corresponds to the first group of vectors, and the index f of the second dimension corresponds to the second group of vectors. For example, the first coefficient indicator di,f having the index (i,f) of the first coefficient is mapped to a first coefficient ui,f having the index (i,f) in the first coefficients. The first coefficient indicator di,f is an indicator whose index is (i,f) in the first coefficient indicators. The first coefficient ui,f is a coefficient whose index is (i,f) in the first coefficients. The index i of the first dimension corresponds to the first group of vectors, and the index f of the second dimension corresponds to the second group of vectors. That is, the index of the first coefficients are index of the coefficients in the first coefficients. The first coefficients include a first coefficient amplitude and a first coefficient phase. The first coefficient indicators also include a first coefficient amplitude indicator and a first coefficient phase indicator.


For example, an amplitude indicator ki,f of the first coefficient having the index (i,f) of the first coefficients is mapped to an amplitude pi,f of the first coefficient having the index (i,f) of the first coefficients. The amplitude indicator di,f of the first coefficient is an indicator whose index is (i,f) in the amplitude indicators of the first coefficients. The amplitude pi,f of the first coefficient is an amplitude whose index is (i,f) in the amplitudes of the first coefficients. The index i of the first dimension corresponds to the first group of vectors, and the index f of the second dimension corresponds to the second group of vectors. For example, a phase indicator ci,f of the first coefficient having the index (i,f) of the first coefficients is mapped to a phase øi,f of the first coefficient having the index (i,f) of the first coefficients. The phase indicator ci,f of the first coefficients is an indicator whose index is (i,f) in the phase indicators of the first coefficients. The phase øi,f of the first coefficients is an phase whose index is (i,f) in the phases of the first coefficients. The index i of the first dimension corresponds to the first group of vectors, and the index f of the second dimension corresponds to the second group of vectors.


The strongest coefficient in the first coefficients is referred to as the strongest coefficient. The precoding matrix indicators include the strongest coefficient indicator. The strongest coefficient indicator is used to indicate the strongest coefficient. The strongest coefficient indicator is used to indicate the index of the strongest coefficient in the first coefficients, that is, to indicate the index of first coefficients of the strongest coefficient. For example, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients, where i′ denotes the index of the first dimension, and f′ denotes the index of the second dimension. An amplitude indicator ki′,f′ of the strongest coefficient is not reported, and an amplitude value pi′,f′ mapped by the amplitude indicator ki′,f′ of the strongest coefficient is 1. A phase indicator ci′,f′ of the strongest coefficient is not reported and is 0.


In an embodiment, the precoding indicators include the strongest coefficient indicators, and the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients. The index i′ of the first dimension corresponds to the first group of vectors, and the index f′ of the second dimension corresponds to the second group of vectors. The first coefficients are the coefficients combining the first group of vectors to form the precoding matrix or combining the first group of vectors and the second group of vectors to form the precoding matrix.


In an embodiment, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients. The mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is determined according to the value of Mv.


The strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients. This is indicated by the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension. The mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is determined according to the value of Mv.


As an example, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients, and each time the index i′ of the first dimension is changed by 1, the value of the strongest coefficient indicators is changed by Mv.


For example, the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′. Mv+f′.


For another example, the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′ · Mv+f′, where i′∈{0, 1, . . . , 2L−1}, and f′ ∈{0, 1, . . . , Mv−1}.


As another example, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients, and each time the index f′ of the second dimension is changed by 1, the value of the strongest coefficient indicators is changed by 2L, where the value range of f′ is an integer from 0 to Mv−1.


For example, the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is: s=f′·2L+i′, where i′∈{0, 1, . . . , 2L−1}, and f′∈{0, 1, . . . , Mv−1}.


Alternatively, the mapping relationship is: s=2Lf′+i′, where i′ ∈{0, 1, . . . ,2L−1}, and f′∈{0, 1, . . . , Mv−1}.


In an embodiment, in response to the value of Mv being one, the mapping relationship between the strongest coefficient indicators and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′, f′=0.


In response to the value of Mv being two, the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′Mv+f′.


Alternatively, the mapping relationship is: s=i′Mv+f′, where i′ ∈{0,1, . . . ,2L−1}, and f′={0, 1}.


Alternatively, the mapping relationship is:






s
=

{









f


·
L

+

i



;


wherein



i



=
0


,
1
,


,


L
-
1

;


f


=
0


,

1
;











f


·
L

+

i



;


wherein



i



=
L


,

L
+
1

,


,



2

L

-
1

;


f


=
0


,

1
;





.






In the embodiment, in the case where the value ranges of i′ are different, the mapping relationships between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension are also different.


In response to the value of Mv being one, the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′, f′=0.


In response to the value of Mv being two, the mapping relationship between the strongest coefficient indicator S and the index i′ of the first dimension and the index f′ of the second dimension is: s=i′Mv+f′.


Alternatively, the mapping relationship is s=i′Mv+f′, where i′∈{0,1, . . . ,2L−1}, and f′∈{0, 1}.


Alternatively, the mapping relationship is:






s
=

{









f


·
L

+

i



;


wherein



i



=
0


,
1
,


,


L
-
1

;


f


=
0


,

1
;











f


·
L

+

i



;


wherein



i



=
L


,

L
+
1

,


,



2

L

-
1

;


f


=
0


,

1
;





.






In an embodiment, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients. In the mapping relationship between the strongest coefficient indicator s and the index i′ of the first dimension and the index f′ of the second dimension, each time the index f′ of the second dimension is changed by 1, the strongest coefficient indicator s is changed by 1.


For example, s=i′. Mv+f′.


For another example, s=i′. Mv+f′, where i′∈{0, 1, . . . , 2L−1}, and f′ ∈{0, 1, . . . , Mv−1}.


In an embodiment, the strongest coefficient indicator s indicates the index (i′, f′) of the strongest coefficient in the first coefficients, and each time the index f′ of the second dimension is changed by 1, the value of the strongest coefficient indicator s is changed by L, where the value range of f′ is an integer from 0 to Mv−1.







For


example

,


s
=

{









f


·
L

+

i



;


wherein



i



=
0


,
1
,


,


L
-
1

;


f


=
0


,

1
;











f


·
L

+

i



;


wherein



i



=
L


,

L
+
1

,


,



2

L

-
1

;


f


=
0


,

1
;





.







In an embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients that need to be reported in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits.


In another embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients whose values are not 0 in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits.


It is to be noted that, to save the overhead for the terminal to report the precoding matrix indicators, the terminal only reports a part of the coefficients forming the precoding matrix. For example, the base station configures the parameter β to the terminal to determine the parameter K0, and K0=┌2LMvβ┐, where β denotes a positive integer less than or equal to 1. For the coefficients forming the one layer of the precoding matrix, the number of coefficients reported to the base station by the terminal does not exceed K0. For the coefficients forming all the layers of the precoding matrix, the total number of coefficients reported to the base station by the terminal does not exceed 2 Kg. In order to enable the base station to receive the reported coefficients, the terminal also reports the number KNZ of the reported coefficients and a bitmap to the base station so as to indicate which coefficients in the coefficients forming the precoding matrix are reported by using non-zero bits of the bitmap. KNZ denotes the number K of coefficients whose values are not 0 and that are reported by the terminal to the base station. In the case where the precoding matrix is only one layer, the maximum potential value B of the number of the coefficients that need to be reported in the first coefficients is K0. In the case where the precoding matrix is multilayer, the maximum potential value B of the number of the coefficients that need to be reported in the first coefficients is 2K0. In the channel state information, the terminal uses the first number indicator to indicate the number of the coefficients that need to be reported in the first coefficients and uses the field formed by the A bits to report the first number indicator. K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits. Alternatively, in the channel state information, the terminal uses the first number indicator to indicate the number K of the coefficients whose values are not 0 in the first coefficients and uses the field formed by the A bits to report the first number indicator. K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits. A is a non-negative integer. For example, A=┌log2(B)┐, that is, A is a rounding value of a logarithm based on 2 of B. The first number indicator indicates K in such a manner that the 1-bit resource overhead can be saved. For example, the number B is 16, and B is the value of the field formed by the A bits, so A needs to be greater than 4, that is, A needs to be greater than 4 bits to report B; and if the number B is 16, and B is the value of the field formed by the A bits plus 1, so A only needs to equal 4, that is, only 4 bits are needed to report B. In this way, the 1-bit resource overhead for one reporting number B can be saved.


In an embodiment, FIG. 3 is a block diagram illustrating the structure of an information transmission apparatus according to an embodiment of the present application. This embodiment is applied to a first communication node. As shown in FIG. 3, an information transmission apparatus in this embodiment includes a receiving module 310 and a reporting module 320.


The receiving module 310 is configured to receive configuration information of a second communication node.


The reporting module 320 is configured to report channel state information to the second communication node according to the configuration information.


The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator.


A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


In an embodiment, the indexes of the strongest coefficient include an index of a first dimension and an index of a second dimension.


The index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors.


In an embodiment, a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors.


In an embodiment, in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is the same as the index of the first dimension, and the index of the second dimension is 0.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the second dimension and a product of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, the value range of the index of the first dimension is between 0 and twice the number of vectors in the first group of vectors minus 1, and the values of the index of the second dimension include 0 and 1.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the first dimension and a product of the index of the second dimension and the number of vectors of the first group of vectors.


In an embodiment, the strongest coefficient indicator and the index of the second dimension have the same adjustment value.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and the number of vectors in the first group of vectors.


In an embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients that need to be reported in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits, and A is a non-negative integer.


In an embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients whose values are not 0 in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits, and A is a non-negative integer.


The information transmission apparatus provided in this embodiment is configured to perform the information transmission method applied to the first communication node in the embodiment shown in FIG. 1. The information transmission apparatus provided in this embodiment has similar implementation principles and technical effects, and details are not repeated here.


In an embodiment, FIG. 4 is a block diagram illustrating the structure of another information transmission apparatus according to an embodiment of the present application. This embodiment is applied to a second communication node. As shown in FIG. 4, an information reporting apparatus in this embodiment includes a determination module 410 and a sending module 420.


The determination module 410 is configured to determine configuration information.


The sending module 420 is configured to send the configuration information to a first communication node to enable the first communication node to report channel state information according to the configuration information.


The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator. A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


In an embodiment, the index of the strongest coefficient include an index of a first dimension and an index of a second dimension.


The index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors.


In an embodiment, a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors.


In an embodiment, in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is the same as the index of the first dimension, and the index of the second dimension is 0.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the second dimension and a product of the index of the first dimension and the number of vectors in the second group of vectors.


In an embodiment, the value range of the index of the first dimension is between 0 and twice the number of vectors in the first group of vectors minus 1, and the values of the index of the second dimension include 0 and 1.


In an embodiment, in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is that the strongest coefficient indicator is determined according to the index of the first dimension and a product of the index of the second dimension and the number of vectors in the first group of vectors.


In an embodiment, the strongest coefficient indicator and the index of the second dimension have the same adjustment value.


In an embodiment, an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and the number of vectors in the first group of vectors.


In an embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients that need to be reported in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits, and A is a non-negative integer.


In an embodiment, the channel state information further includes a first number indicator. The first number indicator is used to indicate the number K of coefficients whose values are not 0 in the first coefficients, and is reported by a field formed by A bits, and K is the value of the first number indicator plus 1. The value of the first number indicator is the value of the field formed by the A bits, and A is a non-negative integer.


The information transmission apparatus provided in this embodiment is configured to perform the information transmission method applied to the second communication node in the embodiment shown in FIG. 2. The information transmission apparatus provided in this embodiment has similar implementation principles and technical effects, and details are not repeated here.



FIG. 5 is a diagram illustrating the structure of a communication device according to an embodiment of the present application. As shown in FIG. 5, the communication device provided in the present application includes a processor 510, a memory 520 and a communication module 530. One or more processors 510 may be provided in the device, with one processor 510 as an example in FIG. 5. One or more memories 520 may be provided in the device, with one memory 520 as an example in FIG. 5. The processor 510, the memory 520 and the communication module 530 in the device may be connected by a bus or in other manners. The connection via the bus is shown as an example in FIG. 5. In this embodiment, the device may be a first communication node. For example, the first communication node may be a terminal side (such as a user equipment).


The memory 520, as a computer-readable storage medium, may be configured to store software programs and computer executable programs and modules such as program instructions/modules corresponding to the device in any embodiment of the present application (such as the receiving module 310 and the reporting module 320 in the information transmission apparatus). The memory 520 may include a program storage region and a data storage region, where the program storage region may store an operating system and an application program required by at least one function while the data storage region may store data created depending on the use of a device. Additionally, the memory 520 may include a high-speed random-access memory and may further include a non-volatile memory, such as at least one magnetic disk memory, flash memory or another non-volatile solid-state memory. In some examples, the memory 520 may further include memories located remotely relative to the processor 510, and these remote memories may be connected to the device via a network. Examples of the preceding network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.


The communication module 530 is configured to perform communication interaction between the first communication node and a second communication node.


In the case where the communication device is the first communication node, the preceding device may be configured to perform the information transmission method applied to the first communication node provided in any preceding embodiment and has corresponding functions and effects.


In the case where the communication device is the second communication node, the preceding device may be configured to perform the information transmission method applied to the second communication node provided in any preceding embodiment and has corresponding functions and effects.


An embodiment of the present application further provides a storage medium including computer-executable instructions. When executed by a computer processor, the computer-executable instructions are configured to cause the computer processor to perform an information transmission method applied to a first communication node. The method includes: receiving configuration information of a second communication node and reporting channel state information to the second communication node according to the configuration information. The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator. A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


An embodiment of the present application further provides a storage medium including computer-executable instructions. When executed by a computer processor, the computer-executable instructions are configured to cause the computer processor to perform an information transmission method applied to a second communication node. The method includes: determining configuration information and sending the configuration information to a first communication node to enable the first communication node to report channel state information according to the configuration information. The channel state information includes a precoding matrix indicator, and the precoding matrix indicator includes a strongest coefficient indicator. A precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors. The strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.


It is to be understood by those skilled in the art that the term “user equipment” covers any suitable type of a wireless user equipment, such as a mobile phone, a portable data processing apparatus, a portable web browser, or a vehicle-mounted mobile station.


Generally, multiple embodiments of the present application may be implemented in hardware or dedicated circuits, software, logics or any combination thereof. For example, some aspects may be implemented in hardware while the other aspects may be implemented in firmware or software that may be executed by a controller, a microprocessor or another computing apparatus, though the present application is not limited thereto.


Embodiments of the present application may be implemented by computer program instructions executed by a data processor of a mobile apparatus, for example, implemented in a processor entity, by hardware or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcodes, firmware instructions, status setting data, or source or object codes written in any combination of one or more programming languages.


A block diagram of any logic flow among the drawings of the present application may represent program steps, may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps with logic circuits, modules and functions. Computer programs may be stored in the memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, a read-only memory (ROM), a random-access memory (RAM) and an optical memory apparatus and system (a digital video disc (DVD), or a compact disc (CD)). A computer-readable medium may include a non-transitory storage medium. The data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) and a processor based on a multi-core processor architecture.

Claims
  • 1. An information transmission method, applied to a first communication node, comprising: receiving configuration information of a second communication node; andreporting channel state information to the second communication node according to the configuration information;wherein the channel state information comprises a precoding matrix indicator, and the precoding matrix indicator comprises a strongest coefficient indicator; andwherein a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors, and the strongest coefficient indicator is used to indicate an index of a strongest coefficient in the first coefficients.
  • 2. The method according to claim 1, wherein the index of the strongest coefficient comprises an index of a first dimension and an index of a second dimension; and wherein the index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors.
  • 3. The method according to claim 2, wherein a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors.
  • 4. The method according to claim 3, wherein an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors.
  • 5. The method according to claim 3, wherein an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors.
  • 6. The method according to claim 3, wherein in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension comprises the strongest coefficient indicator being the same as the index of the first dimension, and the index of the second dimension being 0.
  • 7. The method according to claim 3, wherein in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension comprises the strongest coefficient indicator being determined according to the index of the second dimension and a product of the index of the first dimension and the number of vectors in the second group of vectors.
  • 8. The method according to claim 7, wherein a value range of the index of the first dimension is between 0 and twice the number of vectors in the first group of vectors minus 1, and values of the index of the second dimension comprise 0 and 1.
  • 9. The method according to claim 3, wherein in response to the number of vectors in the second group of vectors being 2, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension comprises the strongest coefficient indicator being determined according to the index of the first dimension and a product of the index of the second dimension and the number of vectors in the first group of vectors.
  • 10. The method according to claim 3, wherein the strongest coefficient indicator and the index of the second dimension have a same adjustment value.
  • 11. The method according to claim 3, wherein an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and the number of vectors in the first group of vectors.
  • 12. The method according to claim 1, wherein the channel state information further comprises a first number indicator, wherein the first number indicator is used to indicate the number K of coefficients that need to be reported in the first coefficients, and the first number indicator is reported by using a field formed by A bits, and K denotes a value of the first number indicator plus 1, wherein the value of the first number indicator is a value of the field formed by the A bits, and A is a non-negative integer.
  • 13. The method according to claim 1, wherein the channel state information further comprises a first number indicator, wherein the first number indicator is used to indicate a number K of coefficients whose values are not 0 in the first coefficients, and the first number indicator is reported by a field formed by A bits, and K denotes a value of the first number indicator plus 1, wherein the value of the first number indicator is a value of the field formed by the A bits, and A is a non-negative integer.
  • 14. An information transmission method, applied to a second communication node, comprising: determining configuration information; andsending the configuration information to a first communication node to enable the first communication node to report channel state information according to the configuration information,wherein the channel state information comprises a precoding matrix indicator, and the precoding matrix indicator comprises a strongest coefficient indicator; andwherein a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors, and the strongest coefficient indicator is used to indicate index of a strongest coefficient in the first coefficients.
  • 15. (canceled)
  • 16. A non-transitory storage medium storing a computer program which, when executed by a processor, causes the processor to perform an information transmission method, wherein the method comprises: receiving configuration information of a second communication node; andreporting channel state information to the second communication node according to the configuration information;wherein the channel state information comprises a precoding matrix indicator, and the precoding matrix indicator comprises a strongest coefficient indicator; andwherein a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors, or a precoding matrix corresponding to the precoding matrix indicator is formed by combining first coefficients with a first group of vectors and a second group of vectors, and the strongest coefficient indicator is used to indicate an index of a strongest coefficient in the first coefficients.
  • 17. The non-transitory storage medium according to claim 16, wherein the index of the strongest coefficient comprises an index of a first dimension and an index of a second dimension; and wherein the index of the first dimension corresponds to the first group of vectors, and the index of the second dimension corresponds to the second group of vectors.
  • 18. The non-transitory storage medium according to claim 17, wherein a mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension is determined according to the number of vectors in the second group of vectors.
  • 19. The non-transitory storage medium according to claim 18, wherein an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the first dimension and the number of vectors in the second group of vectors.
  • 20. The non-transitory storage medium according to claim 18, wherein an adjustment value of the strongest coefficient indicator is a product of an adjustment value of the index of the second dimension and twice the number of vectors in the first group of vectors.
  • 21. The non-transitory storage medium according to claim 18, wherein in response to the number of vectors in the second group of vectors being one, the mapping relationship between the strongest coefficient indicator and the index of the first dimension and the index of the second dimension comprises the strongest coefficient indicator being the same as the index of the first dimension, and the index of the second dimension being 0.
Priority Claims (1)
Number Date Country Kind
202111301957.6 Nov 2021 CN national
PCT Information
Filing Document Filing Date Country Kind
PCT/CN2022/128287 10/28/2022 WO