Information transmission method, device, and storage medium

Abstract

This application provides an information transmission method, an apparatus and a storage medium, the information transmission method being applied to a first communication node, comprising: 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 comprising a precoding matrix index, the precoding matrix index comprising a strongest coefficient index, a precoding matrix corresponding to the precoding matrix index being a combination of a first coefficient and a first set of vectors, or a combination of a first coefficient, a first set of vectors and a second set of vectors, the strongest coefficient index being used for indicating an index number of the strongest coefficient in the first coefficients.

Description

[Technical Field]

[0001] The present application relates to the field of communications, for example to information transmission methods, devices and storage media. [Background technology]

[0002] In a wireless communication system, a base station can determine a data transmission policy based on the channel state represented by the received channel state information and perform data transmission according to the data transmission policy, in order to improve data transmission efficiency. Therefore, how to design a channel state information processing mechanism to improve the accuracy of acquiring the channel state, reduce resource overhead, and reduce system complexity remains an urgent problem to be solved. Summary of the Invention [Means for solving the problem]

[0003] The present application is directed to An information transmission method applied to a first communication node, comprising: receiving configuration information of a second communication node; reporting channel state information to the second communication node based on the configuration information; the channel state information includes a precoding matrix index, the precoding matrix index includes a strongest coefficient index; The precoding matrix corresponding to the precoding matrix index is formed by a combination of a first coefficient and a first set of vectors, or a combination of a first coefficient, a first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficients; A method for transmitting information is provided.

[0004] The present application is directed to An information transmission method applied to a second communication node, comprising: determining configuration information; transmitting the configuration information to a first communication node to cause the first communication node to report channel state information based on the configuration information; the channel state information includes a precoding matrix index, the precoding matrix index includes a strongest coefficient index; The precoding matrix corresponding to the precoding matrix index is formed by a combination of a first coefficient and a first set of vectors, or a combination of a first coefficient, a first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficients; A method for transmitting information is provided.

[0005] The present application is directed to a communication module, a memory, and one or more processors; the communication module is configured to conduct a communication interaction between a first communication node and a second communication node; the memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement a method according to any one of the preceding embodiments. Provides communications equipment.

[0006] The present application is directed to A computer program is stored, and when the computer program is executed by a processor, the method according to any one of the above embodiments is realized. Provide a storage medium. [Brief explanation of the drawings]

[0007] [Figure 1] 1 is a flowchart of an information transmission method according to an embodiment of the present application; [Figure 2] 4 is a flowchart of another information transmission method according to an embodiment of the present application. [Figure 3]1 is a block diagram illustrating a configuration of an information transmission device according to an embodiment of the present application. [Figure 4] FIG. 10 is a block diagram illustrating the configuration of another information transmission device according to an embodiment of the present application. [Figure 5] 1 is a structural schematic diagram of a communication device according to an embodiment of the present application; DETAILED DESCRIPTION OF THE INVENTION

[0008] Hereinafter, the present application will be described with reference to the drawings. Hereinafter, the present application will be described with reference to the drawings of the embodiments. The examples given are merely for the purpose of interpreting the present application and are not intended to limit the scope of the present application.

[0009] Wireless communication has evolved into fifth-generation (5G) communication technology. Long-term evolution (LTE) technology, a fourth-generation (4G) wireless communication technology, and new radio access (NR) technology, a fifth-generation (5G) wireless communication technology, are based on orthogonal frequency division multiplexing (OFDM). In OFDM, the smallest frequency domain unit is a subcarrier, and the smallest time domain unit is an OFDM symbol. To facilitate the use of frequency domain resources, resource blocks (RBs) are defined, where one resource block is a specific number of consecutive subcarriers. Bandwidth parts (BWPs) are also defined, where one bandwidth part is a specific number of consecutive resource blocks in one carrier. To facilitate the use of time domain resources, slots are defined, where one slot is a specific number of consecutive OFDM symbols.

[0010] A method for acquiring channel state information in a wireless communication system and a method for transmitting data using the channel state information include a base station transmitting a reference signal, a terminal measuring the reference signal to determine channel state information from the base station to the terminal, and reporting the channel state information to the base station, and the base station receiving the channel state information reported by the terminal. The base station determines a data transmission policy based on the channel state represented by the received channel state information, transmits data, and improves data transmission efficiency. Here, the accuracy of the channel state represented by the channel state information affects the base station's transmission policy and the efficiency of data transmission. In addition, the base station needs to occupy downlink resource overhead to transmit the reference signal, and the terminal needs to occupy uplink resource overhead to upload the channel state information. Meanwhile, increased system complexity increases system costs and energy loss. Therefore, many factors must be comprehensively considered in design.

[0011] The development of wireless communication technology requires further design of mechanisms for processing channel state information in order to improve the accuracy of the acquired channel state, reduce the resource overhead used, and reduce the system complexity.

[0012] A reference signal transmitted from a base station to a terminal is a downlink reference signal, and downlink reference signals used for reporting channel state information in an LTE system include a cell-specific reference signal (CRS) and a channel-state information reference signal (CSI-RS), while downlink reference signals used for reporting channel state information in an NR system include a CSI-RS. The CSI-RS is bearered by a channel state information reference signal resource (CSI-RS resource), which is composed of code division multiplexing groups (CDM groups), and one CDM group is composed of radio resource elements, and the CSI-RS of one group of CSI-RS ports are multiplexed thereon using a code division multiplexing method.

[0013] 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 the channel, or a precoding matrix indicator (PMI) for indicating the precoding matrix to be applied to the antenna of the base station. One type of CQI reporting format is wideband CQI reporting, i.e., one channel quality is reported in a channel state information reporting band (CSI 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, which provides channel quality in subband units for the channel state information reporting band (CSI reporting band), and one channel quality corresponds to one subband, i.e., one channel quality is reported for each subband of the channel state information reporting band. The subband is a frequency domain unit and is defined as N consecutive RBs, where N is a positive integer. For ease of description, this application refers to a channel quality indication subband or CQI subband or subband, where N is referred to as the size of the CQI subband, or CQI subband size, or subband size. A bandwidth part (BWP) is divided into subbands, and a channel state information reporting band (CSI reporting band) is defined as a subset of the subbands in a bandwidth part (BWP). A channel state information reporting band (CSI reporting band) is a band on which channel state information needs to be reported.

[0014] One type of channel quality determination method is to determine it based on the strength of the reference signal received by the terminal, and another type of channel quality determination method is to determine it based on the signal-to-noise ratio of the received reference signal.When the channel quality does not vary significantly in the channel state information reporting band, the CQI can be reported in the wideband CQI reporting method to reduce the resource overhead used for CQI reporting.When the channel quality varies significantly in the frequency domain, the CQI can be reported in the subband CQI reporting method to increase the accuracy of CQI reporting.

[0015] One type of PMI reporting format is wideband PMI reporting, i.e., reporting one PMI in a channel state information reporting band, where the PMI corresponds to the entire channel state information reporting band. Another type of PMI reporting format is subband PMI reporting, i.e., reporting one PMI for each subband of the channel state information reporting band, or reporting one PMI component for each subband of the channel state information reporting band. For example, if a PMI is composed of X1 and X2, one way of reporting one PMI component for each subband of the channel state information reporting band is to report one X1 for the entire band and one X2 for each subband, and another way is to report one X1 and one X2 for each subband.

[0016] In another PMI reporting format, the reported PMI indicates R precoding matrices for each subband, where R is a positive integer. From the perspective of frequency domain granularity of feedbacking precoding matrices, R also represents the number of precoding matrix subbands included in each subband or the number of precoding matrix subbands included in each CQI subband.

[0017] As one method for reporting channel state information, the terminal receives configuration information (including first configuration information and second configuration information) of the base station, the terminal receives a channel state information reference signal transmitted from the base station based on the configuration information, and the terminal reports the channel state information based on the configuration information.

[0018]

number

[0019] t is the index number of an element in the DFT vector, and its value is 0, 1, ..., N3-1. t can also represent the index number of a precoding matrix. t can also represent the index number of a frequency domain unit, and one value of t corresponds to one frequency domain unit. For example, the precoding matrix with index number t corresponding to the element with index number t of the DFT vector in the second set of vectors is the precoding matrix of the frequency domain unit with index number t.

[0020] The precoding matrix may be composed of only the first set of vectors, or may be composed of the first set of vectors and the second set of vectors. When the precoding is composed of only the first set of vectors, an example of one layer is W = W1W2, where W represents the precoding matrix, W1 represents a matrix composed of the first set of vectors, and W2 represents coefficients that combine the first set of vectors to form the precoding matrix. When the precoding is composed of the first set of vectors and the second set of vectors, an example of one layer is W = W1W2W f where W represents precoding, W1 represents a matrix composed of the first set of vectors, and W f represents a matrix composed of the second set of vectors, and W2 represents coefficients that combine the first set of vectors and the second set of vectors to form a precoding matrix, and is represented by a matrix.

[0021]

number

[0022]

number

[0023]

number

[0024] Here, O represents a vector that includes P / 2 elements and all elements are 0.

[0025]

number

[0026] When the precoding matrix is ​​composed only of the first set of vectors, an example of one layer of the precoding matrix is ​​W=W1W2, where W represents the precoding matrix, W1 represents a matrix composed of the first set of vectors, and has dimensions P×2L, i.e., the first dimension is P and the second dimension is 2L, and W2 represents coefficients that combine the first set of vectors to form the precoding matrix, and is expressed as a matrix, with dimensions 2L×1, i.e., the first dimension is 2L and the second dimension is 1, i.e., the number of elements included in W2 is 2L, that is, the number of coefficients that form one layer of the precoding matrix is ​​2L.

[0027] If the precoding matrix consists of a first set of vectors and a second set of vectors, then an example of a single layer of precoding matrix is ​​W = W1W2W f where W represents the precoding matrix, W1 represents a matrix composed of the first set of vectors, and has dimensions P × 2L, i.e., the first dimension is P, the second dimension is 2L, and W f represents a matrix consisting of the second set of vectors, with dimension M v ×N3, that is, the first dimension is Mv The second dimension is N3, and W2 represents the coefficients that form the precoding matrix by combining the first set of vectors and the second set of vectors. The dimension is expressed as a matrix, 2L × M. v That is, the first dimension is 2L and the second dimension is M v That is, the number of elements in W2 is 2LM. v That is, the number of coefficients that make up one layer of the precoding matrix is ​​2LM v is.

[0028]

number

[0029] In one 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. Here, the first communication node may be a terminal side (e.g., a user equipment). As shown in FIG. 1, this embodiment includes steps S110 to S120.

[0030] In S110, the configuration information of the second communication node is received. At S120, the channel state information is reported to the second communication node based on the configuration information.

[0031] Here, the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index.

[0032] The precoding matrix corresponding to the precoding matrix index is composed of a combination of a first coefficient and a first set of vectors, or a combination of the first coefficient, the first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate the index number of the strongest coefficient in the first coefficients.

[0033] In the embodiment, the strongest coefficient index refers to the index of the strongest coefficient in the first coefficients. Here, the first coefficient is a coefficient that forms a precoding matrix by combining a first set of vectors, or a coefficient that forms a precoding matrix by combining a first set of vectors with a second set of vectors. The strongest coefficient refers to the coefficient with the largest amplitude in the first coefficients. For example, if the maximum amplitude is 1, the strongest coefficient is the coefficient with an amplitude of 1 in the first coefficients. Of course, if there is no coefficient with an amplitude of 1 in the first coefficients, the coefficient with the largest amplitude in the first coefficients is found and determined as the strongest coefficient. In the embodiment, the strongest coefficient index is used to indicate the index number of the strongest coefficient in the first coefficients. In the embodiment, by indicating the index number of the strongest coefficient in the first coefficients using the strongest coefficient index, the coefficient with the index number can be directly reported to the second communication node. This eliminates the need for the first communication node to report all coefficients to the second communication node so that the second communication node can analyze and determine the strongest coefficient, thereby saving resource overhead for reporting coefficients. Alternatively, the strongest coefficient index indicates the index number of the strongest coefficient in the first coefficient, and the strongest coefficient adopts a predefined value, saving the need to directly report the amplitude and phase values ​​of the strongest coefficient, saving the resource overhead of reporting the amplitude and phase values ​​of the strongest coefficient. Furthermore, since the strongest coefficient adopts a predefined value, the accuracy of the value adopted by the strongest coefficient is improved, improving the accuracy of the reported precoding matrix and 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 index indicates the index number of the strongest coefficient, eliminating the need to directly report the amplitude and phase values ​​of the strongest coefficient. The index number of the strongest coefficient can determine that the corresponding coefficient is the strongest coefficient, and its amplitude is 1 and its phase is 0.

[0034] In one embodiment, the index numbers of the strongest coefficients include a first dimension index number and a second dimension index number.

[0035] Here, the index numbers of the first dimension correspond to the vectors of the first set, and the index numbers of the second dimension correspond to the vectors of the second set. It can be understood that the precoding matrix is ​​a matrix composed of two dimensions, and accordingly, the first coefficients for constituting the precoding matrix also have two dimensions, i.e., the first dimension and the second dimension. Correspondingly, the index numbers of the first coefficients are composed of two dimensions, i.e., the index numbers of the strongest coefficients also have two dimensions, i.e., the index numbers of the first dimension and the index numbers of the second dimension. Here, the index numbers of the first dimension correspond to the vectors of the first set, and the index numbers of the second dimension correspond to the vectors of the second set. Here, one vector in the first set of vectors corresponds to one port of the channel state information reference signal, and one element in one vector in the second set of vectors corresponds to one precoding matrix.

[0036] In one embodiment, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the vector number of the second set of vectors, and in this embodiment, the vector number of the second set of vectors refers to the total number of vectors in the second set of vectors.

[0037] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the first dimension index number and the number of vectors in the second set of vectors. In this embodiment, every time the first dimension index number changes by 1, the strongest coefficient index changes the value of the number of vectors in the second set of vectors correspondingly, and correspondingly, every time the first dimension index number changes by n, the value of the strongest coefficient index changes the value of the number of vectors in the second set of vectors correspondingly by n times.

[0038] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the second-dimension index number and twice the number of vectors in the first set of vectors. In this embodiment, the number of vectors in the first set of vectors refers to the total number of vectors in the first set of vectors. In this embodiment, every time the second-dimension index number changes by 1, the strongest coefficient index correspondingly changes by twice the value of the number of vectors in the first set of vectors. Correspondingly, every time the second-dimension index number changes by n, the value of the strongest coefficient index correspondingly changes by 2n times the value of the number of vectors in the first set of vectors.

[0039] In one embodiment, corresponding to the number of vectors in the second set of vectors being 1, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is that the strongest coefficient index and the index number of the first dimension are the same, and the index number of the second dimension is 0. In an embodiment, when the number of vectors in the second set of vectors is 1, the strongest coefficient index and the index number of the first dimension are the same, and the index number of the second dimension is 0.

[0040] In one embodiment, corresponding to the number of vectors in the second set being 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined based on the multiplication value of the first-dimension index number and the number of vectors in the second set and the second-dimension index number. When the number of vectors in the second set is 2, the value of the strongest coefficient index is equal to the sum of the multiplication value of the first-dimension index number and the vector of the second set and the value of the second-dimension index number.

[0041] In one embodiment, the value range of the first dimension index number is from 0 to 2 times the number of vectors in the first set minus 1, and the value of the second dimension index number includes 0 and 1.

[0042] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the second-dimension index number and the vector data of the first set of vectors and the first-dimension index number.

[0043] In one embodiment, the adjustment value of the strongest coefficient index is the same as the adjustment value of the second dimension index number. In this embodiment, every time the second dimension index number is adjusted by 1, the value of the strongest coefficient index is correspondingly adjusted by 1, and of course, every time the second dimension index number is adjusted by n, the value of the strongest coefficient index is correspondingly adjusted by n, where n is a positive integer greater than 0.

[0044] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the second-dimension index number and the number of vectors in the first set. In this embodiment, every time the second-dimension index number is adjusted by 1, the value of the strongest coefficient index is correspondingly adjusted by the product of the value of the second-dimension index number and the number of vectors in the first set. Correspondingly, every time the second-dimension index number is adjusted by n, the value of the strongest coefficient index is correspondingly adjusted by the product of the value of the second-dimension index number and the number of vectors in the first set and n, where n is 0 or 1.

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

[0046] In S210, the configuration information is determined. At S220, configuration information is sent to the first communication node to cause the first communication node to report channel state information based on the configuration information.

[0047] Here, the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index, and a precoding matrix corresponding to the precoding matrix index is composed of a combination of a first coefficient and a first set of vectors, or a combination of the first coefficient, the first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficient.

[0048] In one embodiment, the index numbers of the strongest coefficients include a first dimension index number and a second dimension index number.

[0049] Here, the index numbers in the first dimension correspond to the first set of vectors, and the index numbers in the second dimension correspond to the second set of vectors.

[0050] In one embodiment, a mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the vector number of the second set of vectors.

[0051] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the first dimension and the number of vectors in the second set of vectors.

[0052] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and twice the number of vectors in the first set of vectors.

[0053] In one embodiment, corresponding to the number of vectors in the second set being 1, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is such that the strongest coefficient index and the index number of the first dimension are the same, and the index number of the second dimension is 0.

[0054] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the first-dimension index number and the number of vectors in the second set of vectors and the second-dimension index number.

[0055] In one embodiment, the value range of the first dimension index number is from 0 to 2 times the number of vectors in the first set minus 1, and the value of the second dimension index number includes 0 and 1.

[0056] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the second-dimension index number and the vector data of the first set of vectors and the first-dimension index number.

[0057] In one embodiment, the adjustment value of the strongest coefficient index is the same as the adjustment value of the index number of the second dimension.

[0058] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and the number of vectors in the first set of vectors.

[0059] For the interpretation of each parameter in the information transmission method applied to the second communication node, refer to the explanation of the information transmission method applied to the first communication node in the above embodiment, and the explanation will be omitted here.

[0060] In one embodiment, the first communication node is a terminal and the second communication node is a base station, and the channel state information reporting process is described below. In the embodiment, the channel state information reporting step includes: the terminal receives configuration information of the base station, and the terminal reports the channel state information according to the configuration information.

[0061] Wherein, the channel state information includes a precoding matrix index, and the precoding matrix corresponding to the precoding matrix index is determined by a first set of vectors, or by the first set of vectors and a second set of vectors, where the first set of vectors includes L vectors, and the second set of vectors includes M v vectors, where L, M v is a positive integer, where one vector in the first set of vectors corresponds to one port of the channel state information reference signal, and one element in one vector in the second set of vectors corresponds to one precoding matrix.

[0062] For example, the configuration information may be the value of L, or the value of L and M v Further, for example, the configuration information includes version information of a codebook of a precoding matrix. Further, for example, the configuration information indicates a reference signal for measuring channel state information in order to report the channel state information.

[0063] The precoding matrix index includes a first coefficient index for indicating a first coefficient, where the first coefficient is a coefficient that combines a first set of vectors to form a precoding matrix, or a coefficient that combines the first set of vectors and a second set of vectors to form a precoding matrix.

[0064] The index number of the first coefficient is used to label the coefficients in the first coefficient set. The index number of the first coefficient includes a first dimension index number i and a second dimension index number f, where the first dimension index number i corresponds to the first set of vectors and the second dimension index number f corresponds to the second set of vectors. For example, the index number of the first coefficient is the first coefficient index d of (i,f). i,f is the first coefficient u whose index number is (i,f) i、f and the first coefficient index d i,fis the index of the first coefficient index with index number (i,f), and the first coefficient u i、f is a coefficient with index number (i,f) in the first coefficient, where the index number i in the first dimension corresponds to the first set of vectors, and the index number f in the second dimension corresponds to the second set of vectors. That is, the first coefficient index number is the index number of the first coefficient in the first coefficient. The first coefficient includes a first coefficient amplitude and a first coefficient phase, and the first coefficient index also includes a first coefficient amplitude index and a first coefficient phase index.

[0065] For example, the amplitude index k of the first coefficient whose index number is (i,f) i,f is the amplitude p of the first coefficient whose index number is (i,f). i,f and the amplitude index of the first coefficient d i,f is the index of the amplitude index of the first coefficient, whose index number is (i,f), and the amplitude p i,f is the amplitude of the first coefficient whose index number is (i,f). Here, the index number i of the first dimension corresponds to the vector of the first set, and the index number f of the second dimension corresponds to the vector of the second set. For example, the phase index c of the first coefficient whose index number is (i,f) is i,f is the phase φ of the first coefficient whose index number is (i,f) i,f and the phase index of the first coefficient c i,f is an index whose index number is (i,f) in the phase index of the first coefficient, and the phase φ of the first coefficient i,f is the phase of the first coefficient whose index number is (i,f), where the first dimension index number i corresponds to the first set of vectors and the second dimension index number f corresponds to the second set of vectors.

[0066] The strongest coefficient in the first coefficient is called the strongest coefficient. The precoding index includes a strongest coefficient index, which is used to indicate the strongest coefficient, and the strongest coefficient index is used to indicate the index number of the first coefficient of the strongest coefficient, that is, the index number of the first coefficient of the strongest coefficient. For example, the strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, where i' is the index number of the first dimension and f' is the index number of the second dimension. Here, the amplitude index ki' of the strongest coefficient , It is not necessary to report f', and the amplitude index ki' of the strongest coefficient , The amplitude value pi' mapped to f' , f' is 1, and the phase index ci' of the strongest coefficient , There is no need to report f', and the phase index ci' of the strongest coefficient , f' is 0.

[0067] In one embodiment, the precoding index includes a strongest coefficient index s, and the strongest coefficient index s indicates an index number (i', f') of the first coefficient of the strongest coefficient, where the index number i' of the first dimension corresponds to a first set of vectors, and the index number f' of the second dimension corresponds to a second set of vectors, and where the first coefficient is a coefficient that combines the vectors of the first set to form a precoding matrix, or the first coefficient is a coefficient that combines the vectors of the first set and the vectors of the second set to form a precoding matrix.

[0068] In one embodiment, the strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, where the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is M v is determined based on the value of

[0069] The strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, and is determined by the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension. The mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is M v is determined based on the value of

[0070] One example is as follows: The strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, and every time the index number i' of the first dimension changes by 1, the value of the strongest coefficient index s changes by M v Change the

[0071] For example, the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is s=i'·M v +f'.

[0072] Furthermore, for example, the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is s=i'·M v +f', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1, ..., M v -1}.

[0073] A further example is as follows: The strongest coefficient index s indicates the index number (i', f') in the first coefficient of the strongest coefficient, and every time the index number f' in the second dimension changes by 1, the value of the strongest coefficient index s changes by 2L, where the value range of f' is from 0 to M. v It is an integer up to -1.

[0074] For example, the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is s=f'·2L+i', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1, ..., M v -1}.

[0075] Or, s=2Lf'+i', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1, ..., M v -1}.

[0076] In one embodiment, M v Corresponding to the value of 1, the mapping relationship between the strongest coefficient index s and the first dimension index number i' and the second dimension index number f' is s=i',f'=0.

[0077] M v The value of is 2, and the mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is s=i'·M v +f', Or, s=i'·M v +f', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1},

[0078]

number

[0079] In the embodiment, when the range of the value of i' is different, the mapping relationship between the value of the strongest coefficient index s and the first-dimension index number i' and the second-dimension index number f' is also different.

[0080] M v Corresponding to the value of 1, the mapping relationship between the strongest coefficient index s and the first dimension index number i' and the second dimension index number f' is s=i', f'=0.

[0081] M v The mapping relationship between the strongest coefficient index s and the index number i' of the first dimension and the index number f' of the second dimension is s=i'·M v +f', Or, s=i'·M v +f', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1},

[0082]

number

[0083] In one embodiment, the strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, where in the mapping relationship between the strongest coefficient index s and the first-dimension index number i' and the second-dimension index number f', the strongest coefficient index s changes by 1 every time the second-dimension index number f' changes by 1.

[0084] For example, s=i'·M v +f'. Furthermore, for example, s=i'·M v +f', where i'∈{0, 1, ..., 2L-1}, f'∈{0, 1, ..., M v -1}.

[0085] In one embodiment, the strongest coefficient index s indicates the index number (i', f') of the first coefficient of the strongest coefficient, and every time the index number f' of the second dimension changes by 1, the value of the strongest coefficient index s changes by L, where the value of f' ranges from 0 to M. v It is an integer up to -1.

[0086]

number

[0087] In one embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of coefficients that need to be reported in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits.

[0088] In a further embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of non-zero coefficients in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits.

[0089]

number

[0090] In one embodiment, Figure 3 is a block diagram of an information transmission device according to an embodiment of the present application. This embodiment is applied to a first communication node. As shown in Figure 3, the information reporting device in this embodiment includes a receiving module 310 and a reporting module 320.

[0091] Here, the receiving module 310 is configured to receive configuration information of a second communication node.

[0092] The reporting module 320 is configured to report the channel state information to the second communication node based on the configuration information.

[0093] Here, the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index.

[0094] The precoding matrix corresponding to the precoding matrix index is composed of a combination of a first coefficient and a first set of vectors, or a combination of the first coefficient, the first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate the index number of the strongest coefficient in the first coefficients.

[0095] In one embodiment, the index numbers of the strongest coefficients include a first dimension index number and a second dimension index number.

[0096] Here, the index numbers in the first dimension correspond to the first set of vectors, and the index numbers in the second dimension correspond to the second set of vectors.

[0097] In one embodiment, a mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the vector number of the second set of vectors.

[0098] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the first dimension and the number of vectors in the second set of vectors.

[0099] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and twice the number of vectors in the first set of vectors.

[0100] In one embodiment, corresponding to the number of vectors in the second set being 1, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is such that the strongest coefficient index and the index number of the first dimension are the same, and the index number of the second dimension is 0.

[0101] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the first-dimension index number and the number of vectors in the second set of vectors and the second-dimension index number.

[0102] In one embodiment, the value range of the first dimension index number is from 0 to 2 times the number of vectors in the first set minus 1, and the value of the second dimension index number includes 0 and 1.

[0103] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the second-dimension index number and the vector data of the first set of vectors and the first-dimension index number.

[0104] In one embodiment, the adjustment value of the strongest coefficient index is the same as the adjustment value of the index number of the second dimension.

[0105] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and the number of vectors in the first set of vectors.

[0106] In one embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of coefficients that need to be reported in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits, and A is a non-negative integer.

[0107] In one embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of non-zero coefficients in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits, and A is a non-negative integer.

[0108] The information transmission device of this embodiment is configured to realize the information transmission method applied to the first communication node of the embodiment shown in Figure 1, and the realization principle and technical effects of the information transmission device of this embodiment are similar, so the description will be omitted here.

[0109] In one embodiment, Figure 4 is a block diagram of another information transmission device according to an embodiment of the present application. This embodiment is applied to a second communication node. As shown in Figure 4, the information reporting device in this embodiment includes a determination module 410 and a sending module 420.

[0110] Here, the determination module 410 is configured to determine the configuration information. The transmitting module 420 is configured to transmit the configuration information to the first communication node, to cause the first communication node to report channel state information based on the configuration information.

[0111] Here, the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index, and a precoding matrix corresponding to the precoding matrix index is composed of a combination of a first coefficient and a first set of vectors, or a combination of the first coefficient, the first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficient.

[0112] In one embodiment, the index numbers of the strongest coefficients include a first dimension index number and a second dimension index number.

[0113] Here, the index numbers in the first dimension correspond to the first set of vectors, and the index numbers in the second dimension correspond to the second set of vectors.

[0114] In one embodiment, a mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the vector number of the second set of vectors.

[0115] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the first dimension and the number of vectors in the second set of vectors.

[0116] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and twice the number of vectors in the first set of vectors.

[0117] In one embodiment, corresponding to the number of vectors in the second set being 1, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is such that the strongest coefficient index and the index number of the first dimension are the same, and the index number of the second dimension is 0.

[0118] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the first-dimension index number and the number of vectors in the second set of vectors and the second-dimension index number.

[0119] In one embodiment, the value range of the first dimension index number is from 0 to 2 times the number of vectors in the first set minus 1, and the value of the second dimension index number includes 0 and 1.

[0120] In one embodiment, since the number of vectors in the second set of vectors is 2, the mapping relationship between the strongest coefficient index and the first-dimension index number and the second-dimension index number is determined such that the strongest coefficient index is determined based on the multiplication value of the second-dimension index number and the vector data of the first set of vectors and the first-dimension index number.

[0121] In one embodiment, the adjustment value of the strongest coefficient index is the same as the adjustment value of the index number of the second dimension.

[0122] In one embodiment, the adjustment value of the strongest coefficient index is the product of the adjustment value of the index number of the second dimension and the number of vectors in the first set of vectors.

[0123] In one embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of coefficients that need to be reported in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits, and A is a non-negative integer.

[0124] In one embodiment, the channel state information further includes a first number index, where the first number index is used to indicate the number K of non-zero coefficients in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is the value of the first number index plus 1, where the value of the first number index is the value of the domain consisting of A bits, and A is a non-negative integer.

[0125] The information transmission device of this embodiment is configured to realize the information transmission method applied to the second communication node of the embodiment shown in Figure 2, and the realization principle and technical effects of the information transmission device of this embodiment are similar, so the description will be omitted here.

[0126] FIG. 5 is a structural schematic diagram of a communication device according to an embodiment of the present application. As shown in FIG. 5, the communication device according to the present application includes a processor 510, a memory 520, and a communication module 530. The number of processors 510 in the device may be one or more, and FIG. 5 shows one processor 510 as an example. The number of memories 520 in the device may be one or more, and FIG. 5 shows one memory 520 as an example. The processor 510, memory 520, and communication module 530 of the device can be connected via a bus or other methods, and FIG. 5 shows a bus connection as an example. In this embodiment, the device may be a first communication node, for example, the first communication node may be a terminal (e.g., a user equipment).

[0127] The memory 520 can be used as a computer-readable storage medium to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (e.g., the receiving module 310 and the reporting module 320 in the information transmission device). The memory 520 may include a program storage area and a data storage area, where the program storage area can store an operating system and / or application programs required for at least one function, and the data storage area can store data generated based on the use of the device. The memory 520 may also include high-speed random access memory and may further include non-volatile memory such as at least one magnetic disk storage device, flash memory, or other non-volatile solid-state storage device. In some embodiments, the memory 520 may include memory located remotely from the processor 510, and these remote memories may be connected to the device via a network. Examples of such networks may include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0128] The communication module 530 is configured to conduct a communication interaction between the first communication node and the second communication node.

[0129] When the communication device is a first communication node, the above-mentioned device can be configured to perform the information transmission method applied to the first communication node according to any of the above embodiments, and has corresponding functions and effects.

[0130] When the communication device is a second communication node, the above-mentioned device can be configured to perform the information transmission method applied to the second communication node according to any of the above embodiments, and has corresponding functions and effects.

[0131] An embodiment of the present application further provides a storage medium including computer-executable instructions, which, when executed by a computer processor, are used to perform an information transmission method applied to a first communication node, the method including: receiving configuration information of a second communication node; and reporting channel state information to the second communication node based on the configuration information, wherein the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index; and configuring a precoding matrix corresponding to the precoding matrix index by combining a first coefficient with a first set of vectors, or by combining the first coefficient with the first set of vectors and a second set of vectors, wherein the strongest coefficient index indicates an index number of the strongest coefficient in the first coefficients.

[0132] An embodiment of the present application further provides a storage medium including computer-executable instructions, which, when executed by a computer processor, are used to perform an information transmission method applied to a second communication node, the method including: determining configuration information; and sending the configuration information to the first communication node, so as to cause the first communication node to report channel state information based on the configuration information, wherein the channel state information includes a precoding matrix index, and the precoding matrix index includes a strongest coefficient index, and a precoding matrix corresponding to the precoding matrix index is formed by a combination of a first coefficient and a first set of vectors, or a combination of the first coefficient, the first set of vectors, and a second set of vectors, and the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficients.

[0133] Those skilled in the art will appreciate that the term user equipment includes any suitable type of wireless user equipment, including, for example, a mobile phone, a portable data processing device, a portable network browser, or a mobile station mounted on a vehicle.

[0134] In general, various embodiments of the present application may be implemented in hardware or special purpose circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware while other aspects may be implemented in firmware or software executable by a controller, microprocessor, or other computing device, and the present application is not limited thereto.

[0135] Embodiments of the present application may be implemented by execution of computer program instructions by a data processor of a mobile device, for example 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, microcode, firmware instructions, state setting data, or source or target code written in any combination of one or more programming languages.

[0136] Any logic flow block diagrams in the figures herein may represent program steps, interconnected logic circuits, modules, and functions, or combinations of program steps and logic circuits, modules, and functions. Computer programs may be stored in memory. The memory may be of any type suitable for the local technology environment and may be implemented with any appropriate data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Versatile Discs (DVDs) or Compact Discs (CDs)), etc. Computer-readable media may also include non-transitory storage media. The data processor may be of any type suitable for the local technology 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; reporting channel state information to the second communication node based on the configuration information; the configuration information indicates a reference signal for measuring the channel state information; the channel state information includes a precoding matrix index, the precoding matrix index includes a strongest coefficient index; a precoding matrix corresponding to the precoding matrix index is configured by a combination of a first coefficient and a first set of vectors, or a combination of a first coefficient, a first set of vectors, and a second set of vectors; the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficients, and the strongest coefficient index is a coefficient having the largest amplitude in the first coefficients; The channel state information further includes a first number index, the first number index being used to indicate a number K of non-zero coefficients in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is a value of the first number index plus 1, the value of the first number index is a value of the domain consisting of A bits, and A is a non-negative integer. Information transmission method.

2. the index numbers of the strongest coefficients include a first dimension index number and a second dimension index number; the index numbers of the first dimension correspond to the vectors of the first set, and the index numbers of the second dimension correspond to the vectors of the second set; The method of claim 1.

3. determining a mapping relationship between the strongest coefficient index and the index numbers of the first dimension and the index numbers of the second dimension based on the number of vectors in the second set of vectors; The method of claim 2.

4. the adjustment value of the strongest coefficient index is a product of the adjustment value of the index number of the first dimension and the number of vectors in the second set, and the adjustment value is a fluctuation amount; The method of claim 3.

5. The adjustment value of the strongest coefficient index is a product of the adjustment value of the second dimension index number and twice the number of vectors in the first set, and the adjustment value is a fluctuation amount. The method of claim 3.

6. When the number of vectors in the second set is 1, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is such that the strongest coefficient index is the same as the index number of the first dimension, and the index number of the second dimension is 0. The method of claim 3.

7. Corresponding to the number of vectors in the second set being 2, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the product of the index number of the first dimension and the number of vectors in the second set and the index number of the second dimension. The method of claim 3.

8. The value range of the index number of the first dimension is from 0 to a value obtained by subtracting 1 from twice the number of vectors of the first set, and the value of the index number of the second dimension includes 0 and 1. The method of claim 7.

9. Corresponding to the number of vectors in the second set being 2, the mapping relationship between the strongest coefficient index and the index number of the first dimension and the index number of the second dimension is determined based on the product of the index number of the second dimension and the vector data of the first set of vectors and the index number of the first dimension. The method of claim 3.

10. The adjustment value of the strongest coefficient index is the same as the adjustment value of the second dimension index number, and the adjustment value is a fluctuation amount. The method of claim 3.

11. The adjustment value of the strongest coefficient index is a product of the adjustment value of the second dimension index number and the number of vectors in the first set, and the adjustment value is a fluctuation amount. The method of claim 3.

12. An information transmission method applied to a second communication node, comprising: determining configuration information; transmitting the configuration information to a first communication node so as to cause the first communication node to report channel state information based on the configuration information; receiving the channel state information reported by the first communication node; the configuration information indicates a reference signal for measuring the channel state information; the channel state information includes a precoding matrix index, the precoding matrix index includes a strongest coefficient index; a precoding matrix corresponding to the precoding matrix index is configured by a combination of a first coefficient and a first set of vectors, or a combination of a first coefficient, a first set of vectors, and a second set of vectors; the strongest coefficient index is used to indicate an index number of the strongest coefficient in the first coefficients, and the strongest coefficient index is a coefficient having the largest amplitude in the first coefficients; The channel state information further includes a first number index, the first number index being used to indicate a number K of non-zero coefficients in the first coefficient, and the first number index is reported using a domain consisting of A bits, where K is a value of the first number index plus 1, the value of the first number index is a value of the domain consisting of A bits, and A is a non-negative integer. Information transmission method.

13. a communication module, a memory, and at least one processor; the communication module is configured to conduct a communication interaction between a first communication node and a second communication node; the memory is configured to store at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method of any one of claims 1 to 12. Communication equipment.

14. A computer program is stored, the computer program being adapted to implement the method of any one of claims 1 to 12 when executed by a processor. storage medium.

Images