Methods and apparatus for determining precoding matrix, device, and storage medium

Abstract

The present disclosure relates to the technical field of communications. Disclosed are methods and apparatus for determining a precoding matrix, a device, and a storage medium. A method comprises: generating a precoding matrix by using one or more intermediate matrices, the value of the intermediate matrix being determined on the basis of first information, and the first information comprising a first codebook index, a first combination coefficient and a second combination coefficient. The first codebook index is an index selected from basis vectors of a first codebook, the first codebook being a codebook consisting of a plurality of basis vectors; the first combination coefficient is used for performing linear combination on the basis vectors indicated by the first codebook index to obtain a first basis vector set; and the second combination coefficient is used for performing linear combination on the basis of the first basis vector set, a result of the linear combination being used for obtaining a precoding matrix.

Description

Methods, apparatus, devices and storage media for determining precoding matrices

[0001] This disclosure claims priority to Chinese Patent Application No. 202411368084.4, filed with the Chinese Patent Office on September 29, 2024, entitled “Method, Apparatus, Device and Storage Medium for Determining a Precoding Matrix”, the entire contents of which are incorporated herein by reference. Technical Field

[0002] This disclosure relates to the field of communication technology, and in particular to a method, apparatus, device and storage medium for determining a precoding matrix. Background Technology

[0003] The design of the codebook for Channel State Information (CSI) feedback is a crucial issue for maintaining links in multi-antenna (Multi-Input Multi-Output, MIMO) transmissions and improving the performance of single or multi-user MIMO transmissions. Among related technologies, CSI codebook schemes with low reporting overhead have limited performance, while schemes with high performance and accuracy have excessively high reporting overhead.

[0004] Therefore, it is necessary to study a method for determining the precoding matrix that takes into account both reporting overhead and performance. Summary of the Invention

[0005] This disclosure provides a method, apparatus, device, and storage medium for determining a precoding matrix, taking into account both the reporting overhead and performance of the precoding matrix.

[0006] In a first aspect, embodiments of this disclosure provide a method for determining a precoding matrix, applied to a terminal, comprising:

[0007] A precoding matrix is ​​generated using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0008] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0009] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0010] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0011] Secondly, embodiments of this disclosure also provide a method for determining a precoding matrix, applied to a network device, comprising:

[0012] Send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix;

[0013] Receive target information sent by the terminal;

[0014] Determine the target precoding matrix based on the target information;

[0015] The value of the intermediate matrix is ​​determined based on the first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0016] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0017] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0018] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0019] Thirdly, embodiments of this disclosure provide an apparatus for determining a precoding matrix, applied to a terminal, comprising: a memory, a transceiver, and a processor.

[0020] A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations:

[0021] A precoding matrix is ​​generated using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0022] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0023] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0024] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0025] Fourthly, embodiments of this disclosure provide an apparatus for determining a precoding matrix, applied to a network device, comprising: a memory, a transceiver, and a processor.

[0026] A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations:

[0027] Send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix;

[0028] Receive target information sent by the terminal;

[0029] Determine the target precoding matrix based on the target information;

[0030] The value of the intermediate matrix is ​​determined based on the first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0031] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0032] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0033] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0034] Fifthly, embodiments of this disclosure provide an apparatus for determining a precoding matrix, applied to a terminal, comprising:

[0035] The first processing unit is configured to generate a precoding matrix using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on first information, the first information including: a first codebook index, a first merging coefficient, and a second merging coefficient;

[0036] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0037] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0038] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0039] Sixthly, embodiments of this disclosure provide an apparatus for determining a precoding matrix, applied to a network device, comprising:

[0040] The first sending unit is used to send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more intermediate matrices form a precoding matrix;

[0041] The first receiving unit is used to receive target information sent by the terminal;

[0042] The first processing unit is used to determine the target precoding matrix based on the target information;

[0043] The value of the intermediate matrix is ​​determined based on the first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0044] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0045] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0046] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0047] In a seventh aspect, embodiments of this disclosure also provide a processor-readable storage medium storing a computer program that, when executed by a processor, implements the steps in the method for determining a precoding matrix as described above.

[0048] In this embodiment, the basis vectors indicated by the first codebook index are linearly merged using a first merging coefficient to obtain a first set of basis vectors. This optimizes the basis vectors indicated by the first codebook index, making them more compatible with the characteristics of the cell or terminal. Furthermore, by linearly merging the basis vectors based on the first set of basis vectors and the second codebook basis vectors indicated by the second codebook index using a second merging coefficient, more accurate beam direction and delay path estimation can be obtained, thereby improving codebook accuracy and precoding matrix performance. Simultaneously, since the first set of basis vectors obtained by linearly merging the basis vectors indicated by the first codebook index using the first merging coefficient is more compatible with the characteristics of the cell or terminal, fewer non-zero coefficients are required to obtain the optimal beam direction and delay when merging using the second merging coefficient, thus reducing reporting overhead. Attached Figure Description

[0049] Figure 1 is a flowchart of one of the methods for determining a precoding matrix provided in an embodiment of this disclosure;

[0050] Figure 2 is a second flowchart of the method for determining the precoding matrix provided in an embodiment of this disclosure;

[0051] Figure 3 is a structural diagram of one of the apparatuses for determining a precoding matrix provided in an embodiment of this disclosure;

[0052] Figure 4 is a second structural diagram of the apparatus for determining the precoding matrix provided in an embodiment of this disclosure;

[0053] Figure 5 is a third structural diagram of the apparatus for determining the precoding matrix provided in this embodiment of the present disclosure;

[0054] Figure 6 is a fourth structural diagram of the apparatus for determining the precoding matrix provided in the embodiments of this disclosure. Detailed Implementation

[0055] In this disclosure, the term "and / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent three cases: A alone, A and B simultaneously, and B alone. The character " / " generally indicates that the preceding and following related objects have an "or" relationship.

[0056] In this disclosure, the term "multiple" refers to two or more, and other quantifiers are similar.

[0057] The technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this disclosure.

[0058] This disclosure provides a method and apparatus for determining a precoding matrix, which balances reporting overhead and performance.

[0059] The method and apparatus are based on the same concept of the application. Since the methods and apparatus solve problems in similar ways, the implementation of the apparatus and methods can refer to each other, and the repeated parts will not be described again.

[0060] Referring to Figure 1, which is a flowchart of a method for determining a precoding matrix provided in an embodiment of this disclosure, applied to a terminal, as shown in Figure 1, it includes the following steps:

[0061] Step 101: Generate a precoding matrix using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on the first information.

[0062] In one implementation of this disclosure, the first information includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0063] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors; the first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors; the second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of linear merging is used to obtain the precoding matrix. The result of linear merging used to obtain the precoding matrix may include directly obtaining the precoding matrix from the result of linear merging.

[0064] For example, the first codebook index may include the indexes of the basis vectors in the horizontal dimension of the first codebook and / or the indexes of the basis vectors in the vertical dimension of the first codebook; alternatively, the basis vectors in the first codebook may not distinguish between horizontal and vertical dimensions. In embodiments of this disclosure, the first codebook may be a codebook composed of spatial domain basis vectors, an angle domain basis vector, an angle-range domain basis vector, or a beam domain basis vector. This first codebook may be indicated by the network device or selected by the terminal.

[0065] In this case, the terminal may also report one or more of the first codebook index, the first merging coefficient, the second merging coefficient, and the first codebook to the network device.

[0066] In one implementation of this disclosure, the first information includes: a first codebook index, a second codebook index, a first merging coefficient, and a second merging coefficient.

[0067] Wherein, the first codebook index is an index selected from the basis vectors of a first codebook, and the first codebook is a codebook composed of multiple basis vectors; the first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors; the second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of linear merging is used to obtain the precoding matrix. Specifically, in this embodiment, the second merging coefficient is used to perform linear merging based on the first set of basis vectors and the second codebook basis vectors indicated by the second codebook index to obtain the precoding matrix. Therefore, using the result of linear merging to obtain the precoding matrix can include directly obtaining the precoding matrix based on the result of linear merging.

[0068] The second codebook index is an index selected from the basis vectors of the second codebook. The second codebook index includes the indexes of the basis vectors in the second codebook, or it includes the indexes of the basis vectors in the second codebook and the indexes of the intermediate basis vectors. The second codebook is a codebook composed of basis vectors.

[0069] For example, the first codebook index may include the indexes of the basis vectors in the horizontal dimension and / or the indexes of the basis vectors in the vertical dimension of the first codebook, or the basis vectors in the first codebook may not distinguish between horizontal and vertical dimensions. The second codebook and the first codebook correspond to different vector spaces. For example, in this embodiment, the first codebook may be a codebook composed of spatial domain basis vectors, an angle domain basis vector codebook, an angle-range domain basis vector codebook, or a beam domain basis vector codebook. The second codebook may be a codebook composed of frequency domain basis vectors or a codebook composed of time-delay domain basis vectors. The first and second codebooks may be indicated by the network device or selected by the terminal.

[0070] In this case, the terminal may also report one or more of the first codebook index, the first merging coefficient, the second merging coefficient, the second codebook index, and the second codebook to the network device.

[0071] In one implementation of this disclosure, the first information includes: a first codebook index, a second codebook index, a first merging coefficient, a second merging coefficient, and a third merging coefficient.

[0072] Wherein, the first codebook index is an index selected from the basis vectors of a first codebook, and the first codebook is a codebook composed of multiple basis vectors; the first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors; the second merging coefficient is used to linearly merge based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix. Specifically, the second merging coefficient is used to linearly merge based on the first set of basis vectors to obtain a second set of basis vectors, and the third merging coefficient is used to linearly merge the basis vectors indicated by the second codebook index and the second set of basis vectors to obtain the precoding matrix. Therefore, the result of the linear merging used to obtain the precoding matrix may include processing the result of the linear merging with other information (such as the third merging coefficient) to obtain the precoding matrix.

[0073] The second codebook index is an index selected from the basis vectors of the second codebook. The second codebook index includes the indexes of the basis vectors in the second codebook, or it includes the indexes of the basis vectors in the second codebook and the indexes of the intermediate basis vectors. The second codebook is a codebook composed of basis vectors.

[0074] For an explanation of the first and second codebooks, please refer to the description of the foregoing embodiments.

[0075] In this case, the terminal may also report one or more of the following to the network device: the first codebook index, the first merging coefficient, the second merging coefficient, the second codebook index, the third merging coefficient, the first codebook, and the second codebook.

[0076] In the above embodiments, one or more of the first codebook and the second codebook are based on wideband or subband feedback in the frequency domain and on a first feedback cycle in the time domain (for example, the reporting cycle may be independently or jointly configured relative to other reported information (such as the first merging coefficient); one or more of the first codebook index and the second codebook index are based on wideband feedback in the frequency domain and on a second feedback cycle in the time domain; the first merging coefficient is based on wideband or subband feedback in the frequency domain and on a third feedback cycle in the time domain; the second merging coefficient is based on subband feedback in the frequency domain and on a fourth feedback cycle in the time domain; the third merging coefficient is based on wideband feedback in the frequency domain and on a fifth feedback cycle in the time domain; wherein, the lengths of any two of the first to fifth feedback cycles are the same or different.

[0077] Specifically, the reporting of the first merging coefficient can be simultaneous with the first codebook index or independent; the reporting of the second merging coefficient can be simultaneous with the first merging coefficient and the first codebook index or independent, and the frequency domain granularity of the reported coefficients can be the same or different; when the value of the precoding matrix is ​​also determined by the second codebook index, the reporting of the second codebook index can be simultaneous with the first codebook index or independent, and the frequency domain granularity of the reported coefficients can be the same or different; when the value of the precoding matrix is ​​also determined by the third merging coefficient, the reporting of the third merging coefficient can be simultaneous with the second codebook index or independent, and the frequency domain granularity of the reported coefficients can be the same or different.

[0078] Here, since the long-time feedback CSI portion has already undergone preliminary beam combining in each polarization direction, the resulting long-time feedback beamgroup can form a better basis vector. This allows subsequent linear combining short-time CSI reporting based on this basis vector to obtain a more accurate precoding vector. Furthermore, the better basis vector results in fewer non-zero coefficients in the linear combining report, reducing reporting overhead. By using different feedback periods for long and short-time feedback, the amount of codebook coefficient feedback can be reduced, lowering the overhead of Channel State Information (CSI) reporting and achieving a better trade-off between performance and reporting overhead. In other words, different levels of codebook feedback can adopt different long and short-time feedback periods. Because the long-time feedback portion changes relatively slowly in the time domain and forms a better basis vector, the overhead of subsequent linear combining short-time CSI reporting based on this basis vector can be significantly reduced, improving the trade-off between codebook performance and overhead.

[0079] Wherein, the first merging coefficient includes K 01 K is a non-zero coefficient. 01 The first merging coefficient is an integer greater than 0; it includes: an indicator of the position of the first non-zero merging coefficient, an indicator of the position of the first strongest merging coefficient, a first amplitude merging coefficient, and a first phase merging coefficient. K 01 The value can be selected and reported by the UE, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0080] The first indicator of the position of the non-zero coefficient is used to indicate the position information of the non-zero coefficients in each column of the matrix corresponding to the first merged coefficient; the indicator of the position of the first strongest coefficient is used to indicate the position information of the strongest coefficient in each column of the matrix corresponding to the first merged coefficient; the first amplitude merged coefficient is used to indicate the linear merged amplitude scaling coefficient information in each column of the matrix corresponding to the first merged coefficient; and the first phase merged coefficient is used to indicate the coefficient information of the linear merged phase adjustment in each column of the matrix corresponding to the first merged coefficient.

[0081] Wherein, the second merging coefficient includes K 02 K is a non-zero coefficient. 02 The second merging coefficient is an integer greater than 0; it includes: an indicator of the position of the second non-zero merging coefficient, an indicator of the position of the second strongest merging coefficient, a second amplitude merging coefficient, and a second phase merging coefficient. K 02 The value can be selected and reported by the UE, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0082] The second indicator of the non-zero coefficient position is used to indicate the position information of the non-zero coefficients in each column of the matrix corresponding to the second combined coefficient; the second indicator of the strongest coefficient position is used to indicate the position information of the strongest coefficient in each column of the matrix corresponding to the second combined coefficient; the second amplitude combined coefficient is used to indicate the linear combined amplitude scaling coefficient information in each column of the matrix corresponding to the second combined coefficient; the second phase combined coefficient is used to indicate the coefficient information of the linear combined phase adjustment in each column of the matrix corresponding to the second combined coefficient.

[0083] The third merging coefficient includes K. 03 K is a non-zero coefficient. 03 The third merging coefficient is an integer greater than 0; it includes: an indication of the position of the third non-zero merging coefficient, an indication of the position of the third strongest merging coefficient, a third amplitude merging coefficient, and a third phase merging coefficient. K 03 The value can be selected and reported by the UE, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0084] The third merge non-zero coefficient position indicator is used to indicate the position information of the non-zero coefficients in each column of the matrix corresponding to the third merge coefficient; the third merge strongest coefficient position indicator is used to indicate the position information of the strongest coefficient in each column of the matrix corresponding to the third merge coefficient; the third amplitude merge coefficient is used to indicate the linear merge amplitude scaling coefficient information in each column of the matrix corresponding to the third merge coefficient; the third phase merge coefficient is used to indicate the linear merge phase adjustment coefficient information in each column of the matrix corresponding to the third merge coefficient.

[0085] Among the above methods, taking spatial or frequency domain basis vectors as examples, the set of spatial (frequency) domain basis vectors forms a complete linear spatial basis, spanning the entire linear space. In other words, any direction in the spatial (frequency) domain can be obtained by linearly combining the set of spatial (frequency) domain basis vectors. Therefore, in this embodiment, whether using the first or third linear combining coefficients, linear combining is performed, resulting in a better fit with the spatial (frequency) domain characteristics of the cell or terminal. Furthermore, the amplitude distribution range of the second linear combining coefficients is smaller, improving quantization accuracy for the same number of quantization bits. Therefore, when generating the final precoding matrix based on the superior spatial (frequency) domain basis using second linear combining, the codebook accuracy is improved, thereby enhancing the performance of the precoding matrix. Meanwhile, since the superior spatial (frequency) domain basis generated after the linear merging is more compatible with the spatial (frequency) domain characteristics of the cell or terminal, the number of basis vectors fed back when using the second linear merging of the spatial (frequency) domain basis to characterize the precoding matrix of the terminal's layer and / or sub-band will decrease. The number of non-zero coefficients required to obtain the optimal spatial beam direction and delay by performing the second linear merging based on the superior spatial (frequency) domain basis vector will be less, thereby reducing the reporting overhead.

[0086] The following describes, in conjunction with different implementation methods, the values ​​of the intermediate matrix and the determination methods of each piece of information in the first information in the embodiments of this disclosure.

[0087] Option A: In this option, the values ​​of the intermediate matrix are determined as follows:

[0088] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction (a total of 2L vectors), where L is an integer greater than 0.

[0089] The basis vectors of the two polarization directions are linearly merged using the first merging coefficient to obtain the first basis vector set, wherein the number of basis vectors in the first basis vector set is R0, and R0 is an integer greater than 0;

[0090] The first basis vector set is linearly merged using the matrix corresponding to the second merging coefficient to obtain the precoding matrix. The number of columns of the precoding matrix is ​​RI, where RI is the number of layers (rank) of the precoding matrix and is an integer greater than 0.

[0091] That is, in this scheme A, the first codebook obtains L basis vectors in each of the two polarization directions according to the first codebook index, for a total of 2L basis vectors; the first merging coefficient merges the aforementioned 2L basis vectors into R0 basis vectors to obtain the first basis vector set; the second merging coefficient merges the aforementioned R0 basis vectors into RI basis vectors to obtain the precoding matrix, where RI is the number of layers (rank) of the precoding matrix.

[0092] Specifically, the above precoding matrix can be represented by the following codebook structure: W = W1·W2·W3.

[0093] The precoding matrix W has dimensions of 2N1N2×RI, which corresponds to the precoding matrix transmitted across a total of RI layers. The precoding matrix of the i-th layer is a vector in the i-th column of matrix W. N1 and N2 are the number of antenna ports in the horizontal and vertical dimensions, respectively.

[0094] Where W1 represents the first codebook index, it is a matrix composed of the basis vectors of the L first codebooks, and the dimension of W1 is 2N1N2×2L. W1 can be in the form of a block diagonal matrix, i.e. In this matrix, the dimension of matrix B on the diagonal blocks is N1N2×L, and each diagonal block corresponds to the polarization direction of an antenna. Each column of B is a basis vector (such as a spatial basis vector) of length N1N2×1. The index of the basis vector in the first codebook can be used to indicate the index of the basis vector (such as a spatial basis vector) of the first dimension. 1,1 The index indicator i of the second-dimensional basis vectors (such as spatial basis vectors) 1,2 The indicator can also be the index indicator i1 of a single basis vector (such as a spatial basis vector). The first dimension can be either horizontal or vertical, and the second dimension can be either vertical or horizontal.

[0095] The first codebook can be a set of orthogonal or non-orthogonal basis vectors composed of Discrete Fourier Transform (DFT) vectors, Discrete Cosine Transform (DCT) vectors, Slepian Transform (ST) vectors, eigenvectors, etc. In the example above, the l-th column of matrix B can be written as... u l,1 Let i be an orthogonal or non-orthogonal basis vector in the first codebook in the horizontal or vertical direction, determined by the index i of the basis vectors in the first dimension (such as spatial basis vectors). 1,1 Instructions, u l,2 For an orthogonal or non-orthogonal basis vector in the first codebook in the vertical or horizontal direction, the index i of the basis vector in the second dimension (such as the spatial basis vector) is... 1,2Indication. The choice of L basis vectors in each of the two polarization directions can be the same or different.

[0096] When the L basis vectors of the two polarization directions are chosen differently, the above The matrices B1 and B2 on the diagonal blocks have dimensions N1N2×L, corresponding to the selection of L basis vectors in the corresponding polarization direction. The value of L can be predefined by the protocol, configured by the network through higher-layer signaling (Radio Resource Control (RRC) signaling), or a combination of both. The first codebook can be predefined by the protocol, configured by the network through higher-layer signaling (RRC signaling), reported by the terminal (feature vector codebook), or a combination of the above forms.

[0097] Where W2 is the matrix of the first merging coefficients, and the dimension of W2 is 2L×R0. R0 is the number of columns in the W2 matrix. Each column vector of W2 merges the L basis vectors (e.g., spatial basis vectors) selected by the terminal in each of the two polarization directions in the W1 matrix into a new basis vector (e.g., spatial basis vector). The effect of W1·W2 is that each column of the R0 column in the W2 matrix merges 2L basis vectors (e.g., spatial basis vectors) into a new basis vector (e.g., spatial basis vector), for a total of R0 new basis vectors (e.g., spatial basis vectors), thus obtaining the first basis vector set. The merging in the two polarization directions can be independent. The value of R0 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0098] by Taking spatial basis vectors as an example, without loss of generality, let the r-th column of the W2 matrix be... That is, 2L spatial basis vectors are merged into 1 new spatial basis vector. Regarding the first merging coefficient c... i , Merging 2L spatial basis vectors into a new spatial vector can be any form of linear merging, including the indicator i of the position of the non-zero coefficient of the first merge. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 .

[0099] Wherein, the first combination is not an indicator of the zero coefficient position i 2,1 Provide the position information of the non-zero coefficients in each column. In the example above, the position of the first non-zero coefficient in the r-th column is indicated by i. 2,1,r Can indicate middle The specific position of each non-zero coefficient among 2L elements.

[0100] Specific indication methods may include: (i) indicating using a bitmap, for example... In this bitmap, w corresponds from left to right (or from right to left). r In (ii) Alternatively, it can be indicated by the position index of the first non-zero coefficient in column r and the difference position index offset of the remaining non-zero coefficients. In the example above, the number of the first non-zero coefficients in column r is... The W2 matrix has column R0, therefore the total number of non-zero coefficients contained in the first combined coefficients is... Among them, K 01 The value can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0101] Indicator i of the position of the strongest coefficient in the first merging 2,2 Provide the location information of the strongest coefficient in each column. In the example above, the indicator i of the location of the first merged strongest coefficient... 2,2,r It can indicate the strongest coefficient in column r. The specific position of each non-zero coefficient. A specific indication method could be to use the strongest coefficient in the r-th column... The position index of the non-zero coefficients is used to indicate this. In the example above, the W2 matrix has column R0, so the index of the first combined strongest coefficient is i. 2,2,r The total number is R0. The value of R0 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0102] First amplitude combining coefficient i 2,3 Provide the linear combining amplitude scaling factor information for each column. First amplitude combining factor i 2,3 Specifically, it is further divided into the indication of the broadband amplitude merging amplitude scaling factor i 2,3,1 Indicator i of the amplitude scaling factor for sub-band amplitude merging 2,3,2 This corresponds to the first amplitude combining coefficient indicator when different reporting granularities are selected. When the reporting granularity is wideband, the first amplitude combining coefficient only includes the indicator i of the wideband amplitude combining amplitude scaling factor. 2,3,1 When the reported granularity is sub-band, the first amplitude combining factor includes an indicator i of the broadband amplitude combining amplitude scaling factor. 2,3,1 Indicator i of the amplitude scaling factor for sub-band amplitude merging 2,3,2 Or it may only contain an indication of the sub-band amplitude combining amplitude scaling factor. 2,3,2 Specifically, the bandwidth amplitude scaling factor i in column r is... 2,3,1,r It also contains 2 indicators i2,3,1,r,1 i 2,3,1,r,2 , corresponding to the broadband amplitude combining scaling factor for the two polarization directions in the r-th column, respectively. The indicator i for the sub-band amplitude combining scaling factor. 2,3,2 Contains N subband (N subband This indicates the number of sub-bands (an integer greater than 0). It represents the combined amplitude scaling factor for all sub-band amplitude values ​​in columns R0 of the nth sub-band. SB The sub-band amplitude combining scaling factor in the r-th column of the sub-band is indicated as follows:

[0103] First amplitude combining coefficient i 2,3 This could be: (i) a bitmap of index values ​​for the amplitude scaling factor, where the specific scaling factor is determined based on the index value corresponding to each bit in the bitmap. For example, in the example above, the indicator of the combined amplitude scaling factor for the broadband amplitude in the two polarization directions in column r. nth SB Subband amplitude merging scaling factor in the r-th column of the subband Index value The value range is {0, 1, 2, 3, 4, 5, 6, 7}, and the amplitude scaling factor corresponding to each index value is... (ii) Specific scaling factor quantization values. For example, in the example above, the indication of the broadband amplitude combining amplitude scaling factor in the two polarization directions of the r-th column. nth SB Subband amplitude merging scaling factor in the r-th column of the subband It refers to the specific scaling factor quantization value. Quantization can be scalar quantization or vector quantization. The quantization interval can be uniform or non-uniform. The quantization range, number of bits, and quantization interval can be predefined by the protocol, selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of the above.

[0104] First phase combining coefficient i 2,4 Provides the coefficient information for the linear merging phase adjustment of each column. First phase merging coefficient i 2,4 Specifically, it is further divided into the indication of the broadband phase merging phase adjustment coefficient i 2,4,1 Indicator i of sub-band phase merging phase adjustment coefficient 2,4,2 This corresponds to the first phase merging coefficient indicator when different reporting granularities are selected. When the reporting granularity is wideband, the first phase merging coefficient only includes the indicator i of the wideband phase merging phase adjustment coefficient. 2,4,1 When the reported granularity is sub-band, the first phase combining coefficient includes an indication i of the broadband phase combining phase adjustment coefficient. 2,4,1Indicator i of sub-band phase merging phase adjustment coefficient 2,4,2 Or, only includes an indication of the sub-band phase merging phase adjustment coefficient. 2,4,2 Specifically, the broadband phase merging phase adjustment coefficient i in the r-th column. 2,4,1,r The broadband phase-combining phase adjustment coefficients correspond to the r-th polarization direction. Specifically, the phase adjustment coefficient for the first polarization direction is 1 (no adjustment) by default, and the phase adjustment coefficient for the second polarization direction relative to the first polarization direction is i. 2,4,1,r i 2,4,2 Contains N subband (N subband The indicator represents the subband phase merging phase adjustment coefficients of all R0 columns in the nth subband (indicating the number of subbands reported by the terminal), where the nth subband is the subband phase merging phase adjustment coefficient. SB The subband phase merging phase adjustment coefficient of the r-th column of the subband is indicated as follows:

[0105] First phase combining coefficient i 2,4 This could be: (i) a bitmap of index values ​​for phase adjustment coefficients, where the specific adjustment coefficient is determined based on the index value corresponding to each bit in the bitmap. For example, in the example above, the indicator of the broadband phase-combining phase adjustment coefficients in the two polarization directions of column r. nth SB Subband phase merging phase adjustment coefficient of the r-th column of the subband Index value The value range is {0, 1, ..., 15}, and the phase adjustment coefficient corresponding to each index value is... (ii) Specific adjustment coefficient quantification value.

[0106] For example, in the above example, the indication of the inter-polarization broadband phase merging phase adjustment coefficient of the r-th column. nth SB The sub-band phase merging phase adjustment factor for the r-th column of the sub-band is:

[0107] in, It refers to the specific adjustment coefficient quantization value. Quantization can be scalar quantization, the quantization interval can be uniform, and the quantization range, number of bits, and quantization interval can be predefined by the protocol, selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of the above.

[0108] Here, W3 is the matrix of the second merging coefficients, with dimensions R0×RI, where RI is the number of columns in the W3 matrix, which is also the level (rank) of the precoding matrix. Since the W3 matrix has RI columns, the effect of W1·W2·W3 is that each column of the W3 matrix merges the R0 basis vectors (such as spatial basis vectors) of W1·W2 into one new basis vector (such as spatial basis vector), for a total of RI new basis vectors (such as spatial basis vectors), resulting in the precoding matrix. The merged sum in the i-th column of the W3 matrix corresponds to the precoding matrix of the i-th level.

[0109] Taking W1·W2=[v1…vR0] as an example, let a certain column of the W3 matrix be... but That is, R0 basis vectors (such as spatial basis vectors) are merged into one new basis vector (such as spatial basis vector). Regarding the merging coefficient w′, merging R0 basis vectors (such as spatial basis vectors) into one new basis vector (such as spatial basis vector) can be any form of linear merging, including the indicator i indicating the position of the second non-zero coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific interpretations of these instructions are similar to those related to the first consolidation coefficient.

[0110] Based on the foregoing description, taking the basis vectors included in the first codebook as spatial basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: Let the W2 matrix be formed by the first merging coefficients: Let the W3 matrix be formed by the second merging coefficients: The precoding codeword of layer i, obtained by vector summation and expansion of the first codebook index, first merging coefficient, and second merging coefficient reported by the terminal, i.e., the precoding matrix of layer i, can be written as:

[0111] Among them, b l , The index of the spatial basis vector in the horizontal dimension indicates i 1,1 The index indicator i of the spatial basis vectors in the vertical dimension 1,2 Determine (b) l and (They can be the same vector); The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure.

[0112] Option B: In this option, the values ​​of the intermediate matrix are determined as follows:

[0113] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction, where L is an integer greater than 0.

[0114] Using the first merging coefficient and the basis vector indicated by the first codebook index in each polarization direction, the first basis vector set is obtained, wherein the number of basis vectors in the first basis vector set is 2R0, and there are R0 basis vectors in each polarization direction, where R0 is an integer greater than 0;

[0115] The first basis vector set is linearly merged using the matrix corresponding to the second merging coefficient to obtain the precoding matrix. The precoding matrix has RI columns, where RI is the layer number of the precoding matrix and is a positive integer. Specifically, L vectors are obtained for each of the two polarization directions based on the first codebook index, for a total of 2L vectors. The first merging coefficient and the first codebook index are then used to obtain R0 vectors for each of the two polarization directions (a total of 2R0 vectors), which is the first basis vector set. The second merging coefficient merges these 2R0 vectors into RI vectors to obtain the precoding matrix, where RI is the layer number (rank) of the precoding matrix.

[0116] In this scheme, the above codebook design can be represented by the following codebook structure:

[0117] The precoding matrix W has a dimension of 2N1N2×RI, which corresponds to the precoding matrix transmitted across a total of RI layers. The precoding matrix of the i-th layer is a vector of the i-th column of matrix W.

[0118] Here, W1 represents the first codebook index, which is a matrix composed of L vectors from the first codebook. The dimension of W1 is N1N2×L, corresponding to the polarization direction of an antenna. Each column of W1 is a spatial basis vector of length N1N2×1, indicated by the index of the vector in the first codebook, and may contain the index indicator i of the basis vector of the first dimension. 1,1 The index indicator i of the second-dimensional basis vectors (such as spatial basis vectors) 1,2 The indicator can also be the index indicator i1 of a single basis vector (such as a spatial basis vector). The first dimension can be a horizontal or vertical dimension, and the second dimension can be a horizontal or vertical dimension. The first codebook can be a set of orthogonal or non-orthogonal basis vectors composed of Discrete Fourier Transform (DFT) vectors, Discrete Cosine Transform (DCT) vectors, Slepian Transform (ST) vectors, eigenvectors, etc.

[0119] In the example above, the l-th column of matrix W1 can be written as u l,1 Let i be an orthogonal or non-orthogonal basis vector in the first codebook in the horizontal or vertical direction, determined by the index i of the basis vectors in the first dimension (such as spatial basis vectors). 1,1 Instructions, u l,2 For an orthogonal or non-orthogonal basis vector in the first codebook in the vertical or horizontal direction, the index i of the basis vector in the second dimension (such as the spatial basis vector) is... 1,2 Instructions. The choice of L basis vectors in the two polarization directions can be the same or different. When the choice of L basis vectors in the two polarization directions is different, the above... Wherein, matrix W 1,1 W 1,2 The dimension is N1N2×L, corresponding to the selection of L basis vectors in the polarization direction. The value of L can be predefined by the protocol, configured by the network through higher-layer signaling (RRC signaling), or a combination of both. The first codebook can be predefined by the protocol, configured by the network through higher-layer signaling (RRC signaling), reported by the terminal (feature vector codebook), or a combination of the above forms.

[0120] In this matrix, W2 is the first merging coefficient matrix, with dimensions L×R0, where R0 is the number of columns. Each column vector of W2 merges the L basis vectors (e.g., spatial basis vectors) selected by the terminal in one polarization direction from the W1 matrix into a new basis vector (e.g., spatial basis vector). The effect of W1·W2 is that each column of the R0 column in the W2 matrix merges the L basis vectors (e.g., spatial basis vectors) into a new basis vector (e.g., spatial basis vector), resulting in a total of R0 new basis vectors (e.g., spatial basis vectors), thus obtaining the first basis vector set. The merging in the two polarization directions can be independent. The value of R0 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0121] With W1 = [b1…b L For example, without loss of generality, let the r-th column of the W2 matrix be w. r =[c1 … c L ] T , That is, L basis vectors (such as spatial basis vectors) are merged into one new basis vector (such as spatial basis vector). The first merging coefficient can be the same or different in the two polarization directions. Regarding the first merging coefficient c... i For L basis vectors (such as spatial basis vectors), merging a new basis vector can be performed. This can be an arbitrary linear merging, including the indicator i of the position of the non-zero coefficient of the first merge. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 .

[0122] The first merge coefficient of Scheme B is not the zero coefficient position indicator, but the position indicator of the first strongest merge coefficient. The first amplitude merge coefficient and the first phase merge coefficient are the same as those of Scheme A, the only difference being the change in matrix dimension.

[0123] Here, W3 is the matrix of the second merging coefficients, and its dimension is 2R0×RI, where RI is the number of columns in the W3 matrix, which is also the number of layers (rank) of the precoding matrix. Since the W3 matrix has RI columns... The effect is that each column of the RI column in the W3 matrix will... The 2R0 basis vectors (such as spatial basis vectors) are merged into 1 new basis vector (such as spatial basis vector), for a total of RI new basis vectors (such as spatial basis vectors), to obtain the precoding matrix. In the W3 matrix, the merging and subtraction of the i-th column corresponds to the precoding matrix of the i-th layer.

[0124] by For example, let a column of the W3 matrix be... but That is, 2R0 spatial vectors are merged into one new spatial vector. Regarding the merging coefficient w′, merging 2R0 spatial vectors into one new spatial vector can be any form of linear merging, including the indicator i indicating the position of the second non-zero coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific interpretations of these instructions are similar to those of the instructions related to the first consolidation coefficient.

[0125] Based on the foregoing description, taking the basis vectors included in the first codebook as spatial basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: W1 = [b1 … b L Let the W2 matrix, formed by the first merging coefficients, be: Let the W3 matrix be formed by the second merging coefficients: The precoding codeword of layer i, obtained by vector summation and expansion of the first codebook index, first merging coefficient, and second merging coefficient reported by the terminal, i.e., the precoding matrix of layer i, can be written as:

[0126] Among them, b l The index of the spatial basis vector in the first dimension indicates i 1,1 The index indicator i of the second-dimensional spatial basis vector 1,2 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure.

[0127] By improving scheme B, scheme B1 can also be obtained, in which:

[0128] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction, where L is an integer greater than 0.

[0129] Using the first merging coefficient and the basis vector indicated by the first codebook index in each polarization direction, the first basis vector set is obtained, wherein the number of basis vectors in the first basis vector set is 2R0, and there are R0 basis vectors in each polarization direction, where R0 is an integer greater than 0;

[0130] Using the matrix corresponding to the second merging coefficient, a single basis vector is selected from the first basis vector set and an inter-polarity merging factor is added to obtain the precoding matrix. The number of columns of the precoding matrix is ​​RI, where RI is the number of layers of the precoding matrix and RI is an integer greater than 0.

[0131] In scheme B1, the above codebook design scheme can be represented by the following codebook structure:

[0132] The designs of W1 and W2 are the same as those of Scheme B, the difference being the design of W3.

[0133] W3 is the matrix of the second merging coefficients. The dimension of W3 is 2R0×RI, where RI is the number of columns in the W3 matrix, which is also the level (rank) of the precoding matrix. Each column of W3 consists of a column selection vector plus a phase / amplitude merging factor. The k-th column of the W3 matrix is... Where c jk It is a column selection vector of length R0, the j-th column... k One element is 1, and the other elements are 0. The result is that each column of column RI in the W3 matrix will select one column from W1·W2 and add a merging factor to obtain a new spatial vector, for a total of RI new spatial vectors, forming a precoding matrix. The i-th column in the W3 matrix corresponds to the precoding matrix of the i-th layer.

[0134] by For example, let the k-th column of the W3 matrix be... but The indication information of W3 includes the indication of the position of the second non-zero coefficient. 3,1 (Determine the position of each non-zero element in each column), second amplitude merging coefficient i 3,3 Second phase merging coefficient i 3,4 The specific details are similar to those of the first merging coefficient, and will not be repeated here.

[0135] Based on the foregoing description, taking the basis vectors included in the first codebook as spatial basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: W1 = [b1 … b L Let the W2 matrix, formed by the first merging coefficients, be: Let the W3 matrix be formed by the second merging coefficients: The precoding codeword of layer i, obtained by vector summation and expansion of the first codebook index, first merging coefficient, and second merging coefficient reported by the terminal, i.e., the precoding matrix of layer i, can be written as:

[0136] Among them, b ji The index of the spatial basis vector in the first dimension indicates i 1,1 The index indicator i of the second-dimensional spatial basis vector 1,2 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Confirmed; j i The indication i of the position of the second non-zero coefficient 3,1 Confirmed, d i The second amplitude combining coefficient i 3,3 Determined; θ i By the second phase merging coefficient i 3,4 Sure.

[0137] Option C: In this option, the values ​​of the intermediate matrix are determined as follows:

[0138] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. L basis vectors are selected in each polarization direction, where L is an integer greater than 0.

[0139] The basis vectors of the two polarization directions are linearly merged using the first merging coefficient to obtain the first basis vector set, where the number of basis vectors in the first basis vector set is R0, and R0 is an integer greater than 0.

[0140] The first basis vector set is linearly merged using the second merging coefficient to obtain a second basis vector set, where the number of columns in the second basis vector set is K, and K is an integer greater than 0.

[0141] The precoding matrix is ​​obtained by linearly merging the basis vectors indicated by the second codebook index using the second set of basis vectors, wherein the basis vectors indicated by the second codebook index are K basis vectors of length N. subband The row vectors of the precoding matrix have N columns. subband N subbanb This represents the number of subbands reported by the terminal, and is a positive integer.

[0142] That is, in scheme C, L basis vectors are obtained in each of the two polarization directions of the first codebook according to the first codebook index, for a total of 2L basis vectors; the first merging coefficient merges the aforementioned 2L basis vectors into R0 basis vectors, obtaining the first vector set; the second merging coefficient further merges the R0 vectors obtained by the first merging coefficient into K vectors, obtaining the second basis vector set; the aforementioned K vectors and the K basis vectors of length N obtained according to the second codebook index... subband The row vectors are merged to obtain N. subband From the vectors, we obtain the precoding matrix.

[0143] Specifically, the above codebook design scheme can be represented by the following codebook structure: W = W1·W2·W3·W4.

[0144] In this scheme, W1 and W2 are the same as those described in the previous scheme. It should be noted that the dimension of matrix W differs from that in the previous scheme. In this scheme, the dimension of matrix W is 2N1N2×N. subband All N corresponding to the transmission of one layer subbabd If there are a total of RI layers of transmission in the subband precoding matrix, and each layer corresponds to a dimension of 2N1N2×N. subband The matrix W can be the same or different for each layer.

[0145] In this matrix, W3 is the matrix of the second merging coefficients. It's important to note that in this case, the dimension of matrix W3 differs from the previous scheme; W3 has a dimension of R0×K. Here, K is the number of columns in matrix W3, the number of rows in matrix W4, the number of frequency domain basis vectors selected after frequency domain compression (if the basis vectors are spatial basis vectors), and the number of effective channel delay paths corresponding to the precoding matrix. Since matrix W3 has K columns, the effect of W1·W2·W3 is that each of the K columns in matrix W3 merges the R0 basis vectors (e.g., spatial basis vectors) of W1·W2 into one new basis vector (e.g., a spatial basis vector), for a total of K new basis vectors.

[0146] by For example, let one column of the W3 matrix be... but That is, R0 basis vectors (such as spatial basis vectors) are merged into one new basis vector (such as spatial basis vector). Regarding the merging coefficient d...i Merging R0 vectors with a new basis vector (such as spatial basis vectors) can be any form of linear merging, including the indicator i of the position of the second non-zero coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific details are similar to those of the first merging coefficient, and will not be repeated here. The value of R0 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0147] Here, W4 represents the second codebook index, which is a matrix composed of vectors from the K second codebooks, and W4 has a dimension of K×N. subband , where N subband This represents the number of columns in the W4 matrix, and also the number of subbands transmitted. Each row of W4 is a 1×N matrix. subband The basis vectors (such as frequency domain basis vectors) are indicated by the indices of the vectors in the second codebook, including the index indicator i of the basis vectors (such as frequency domain basis vectors). 4,1 And optional, the index indicator i of intermediate basis vectors (such as frequency domain basis vectors) 4,2 The second codebook can be a set of any orthogonal or non-orthogonal basis vectors formed by Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Slepian Transform (ST), frequency domain eigenvectors, etc. The second codebook index indicates i. 4,1 and i 4,2 This forms the W4 matrix. The second codebook can be predefined by the protocol, configured by the network through higher-layer signaling (RRC signaling), reported by the terminal (frequency domain feature vector codebook), or a combination of the above.

[0148] The effect of W3·W4 is that for an original dimension of R0×N subband The basis vector (e.g., frequency domain basis vector) matrix is ​​subjected to frequency domain compression with a rank of K. That is, for dimensions R0×N subband The matrix is ​​estimated and decomposed to have a rank of K. The value of K can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both. subband The value can be predefined by the protocol, configured by the network through higher-level signaling (RRC signaling), or a combination of both.

[0149] Based on the foregoing description, taking the basis vectors of the first codebook as spatial basis vectors and the basis vectors of the second codebook as frequency basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: Let the W2 matrix be formed by the first merging coefficients: Let the W3 matrix be formed by the second merging coefficients: Let the matrix formed by the vectors in the second codebook be: Based on the first codebook index, first merging coefficient, second merging coefficient, and second codebook index reported by the terminal, all N values ​​of a certain layer are obtained by vector summation expansion. subband Subband precoding codewords, that is, the precoding matrix of all subbands in any given layer, can be written as:

[0150] Among them, b l , The index of the spatial basis vector in the horizontal dimension indicates i 1,1 The index indicator i of the spatial basis vectors in the vertical dimension 1,2 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure. The index of the frequency domain basis vector indicates i 4,1 And optionally, the index indicator i of the intermediate frequency domain basis vectors 4,2 Sure.

[0151] Option D: In this option, the values ​​of the intermediate matrix are determined as follows:

[0152] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction, where L is an integer greater than 0.

[0153] Using the first merging coefficient and the basis vector indicated by the first codebook index in each polarization direction, the first basis vector set is obtained, wherein the number of basis vectors in the first basis vector set is 2R0, and there are R0 basis vectors in each polarization direction, where R0 is an integer greater than 0;

[0154] The first basis vector set is linearly merged using the second merging coefficient to obtain a second basis vector set, where the number of columns in the second basis vector set is K, and K is an integer greater than 0.

[0155] The precoding matrix is ​​obtained by linearly merging the basis vectors indicated by the second codebook index using the second set of basis vectors, wherein the basis vectors indicated by the second codebook index are K basis vectors of length N. subband The row vectors of the precoding matrix have N columns. subband N subband This represents the number of subbands reported by the terminal, and is a positive integer.

[0156] That is, based on the first codebook index, L vectors are obtained for each of the two polarization directions, for a total of 2L vectors; after the first merging coefficient and the first codebook index are processed, R0 vectors are obtained for each of the two polarization directions (a total of 2R0 vectors), thus obtaining the first basis vector set; the second merging coefficient further merges the aforementioned 2R0 vectors into K vectors, thus obtaining the second basis vector set; the aforementioned K vectors, based on the second codebook index, yield K basis vectors of length N. subband The row vectors are merged to obtain N. subband The precoding matrix is ​​obtained by using vectors.

[0157] Specifically, the above precoding matrix can be represented by the following codebook structure:

[0158] In this case, W1 and W2 are the same as in scheme B. It should be noted that the dimension of matrix W is 2N1N2×N. subband All N corresponding to the transmission of one layer subband Subband precoding matrix. If there are a total of RI layers for transmission, each layer corresponds to a dimension of 2N1N2×N. subband The matrix W can be the same or different for each layer.

[0159] W3 is the matrix of the second combining coefficients, with dimensions 2R0×K. The design and usage of W3 are the same as in scheme B, except that it has K columns. K is also the number of rows in matrix W4, the number of frequency domain basis vectors selected after frequency domain compression, and the number of effective channel delay paths corresponding to the precoding matrix. The second combining coefficients for combining 2R0 basis vectors (such as spatial basis vectors) can be any form of linear combining, including the indicator i of the non-zero coefficient position of the second combining coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 For details, please refer to the description of the aforementioned Scheme B.

[0160] W4 represents the second codebook index, and its design and use are the same as in scheme C.

[0161] Based on the foregoing description, taking the basis vectors of the first codebook as spatial basis vectors and the basis vectors of the second codebook as frequency basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: W1 = [b1 … b L Let the W2 matrix, formed by the first merging coefficients, be: Let the W3 matrix be formed by the second merging coefficients: Let the matrix formed by the vectors in the second codebook be: Based on the first codebook index, first merging coefficient, second merging coefficient, and second codebook index reported by the terminal, all N values ​​of a certain layer are obtained by vector summation expansion. subband Subband precoding codewords, that is, the precoding matrix of all subbands in any given layer, can be written as:

[0162] Among them, b l It is indicated by the index i of the spatial basis vectors in the first dimension. 1,1 The index indicator i of the second-dimensional spatial basis vector 1,2 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure. The index of the frequency domain basis vector indicates i 4,1 And optionally, the index indicator i of the intermediate frequency domain basis vectors 4,2 Sure.

[0163] Option E: In this option, the values ​​of the intermediate matrix are determined as follows:

[0164] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction, where L is an integer greater than 0.

[0165] The basis vectors of the two polarization directions are linearly merged using the first merging coefficient to obtain the first basis vector set, wherein the number of basis vectors in the first basis vector set is R0, and R0 is an integer greater than 0;

[0166] The first basis vector set is linearly merged using the second merging coefficient to obtain a second basis vector set, where the number of columns in the second basis vector set is R1, and R1 is an integer greater than 0.

[0167] The second basis vector set is merged using the third merging coefficient to obtain a third basis vector set, wherein the number of columns in the third basis vector set is K, and K is an integer greater than 0;

[0168] The precoding matrix is ​​obtained by linearly merging the basis vectors indicated by the second codebook index using the third basis vector set, wherein the basis vectors indicated by the second codebook index are K basis vectors of length N. subband The row vectors of the precoding matrix have N columns. subband N subband This represents the number of subbands reported by the terminal, and is a positive integer.

[0169] That is, based on the first codebook index, L vectors are obtained in each of the two polarization directions of the first codebook, for a total of 2L vectors; the first merging coefficient merges the aforementioned 2L vectors into R0 vectors, thus obtaining the first basis vector set; the second merging coefficient further merges the R0 vectors obtained by the first merging coefficient into R1 vectors, thus obtaining the second basis vector set; the third merging coefficient further merges the aforementioned R1 vectors into K vectors, thus obtaining the third basis vector set; the aforementioned K vectors, obtained from the second codebook index, are K vectors of length N. subband The row vectors are merged to obtain N. subband From the vectors, we obtain the precoding matrix.

[0170] Specifically, the above precoding matrix can be represented by the following codebook structure: W = W1·W2·W3·W4′·W4.

[0171] W1 and W2 are the same as in the previous scheme, and will not be repeated here. It should be noted that in this case, the dimension of matrix W is 2N1N2×N. subband All N corresponding to the transmission of one layer subband Subband precoding matrix. If there are a total of RI layers for transmission, each layer corresponds to a dimension of 2N1N2×N. subband The matrix W can be the same or different for each layer.

[0172] Here, W3 is the matrix of the second merging coefficients. It's important to note that in this case, the dimension of matrix W3 differs from the previous scheme; W3 has a dimension of R0 × R1. R1 is the number of columns in matrix W3. Since matrix W3 has R1 columns, the effect of W1·W2·W3 is that each column of matrix W3 merges the R0 basis vectors obtained from merging W1·W2 into one basis vector, resulting in a total of R1 new basis vectors. For example, let one column of the W3 matrix be... but That is, R0 spatial vectors are merged into one new vector. Regarding the merging coefficient d... i For R0 basis vectors, a new basis vector can be merged, which can be any form of linear merging, including the indicator i of the position of the second non-zero coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4The specific content is similar to the relevant indication of the first merging coefficient. The value of R0 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both. Taking the basis vector of the first codebook as the spatial basis vector and the basis vector of the second codebook as the frequency basis vector as an example, the matrix operation W1·W2·W3 will yield a new basis vector in column R1, which corresponds to the spatial beam direction in the direction of the R1 frequency basis vectors.

[0173] Here, W4' is the matrix of the third combining coefficients. It's important to note that the definition and dimensions of matrix W4' differ from the previous schemes; the dimension of matrix W4' is R1×K. R1 is the number of columns in matrix W3, and also the number of rows in matrix W4'. K is the number of columns in matrix W4', the number of rows in matrix W4 (see subsequent description), the number of frequency domain basis vectors selected after frequency domain compression, and the number of effective channel delay paths corresponding to the precoding matrix. W4' combines the R1 column vectors of W1·W2·W3 to obtain a new vector of K columns. This combination can be any form of linear combination, including the indicator i of the non-zero coefficient position of the third combining coefficient. 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude merging coefficient i 4′,3 Third phase merging coefficient i 4′,4 The specific details are similar to those of the first merging coefficient, and will not be repeated here. The value of R1 can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both.

[0174] Here, W4 represents the second codebook index, and W4 is a matrix composed of K vectors from the second codebook, with dimensions K×N. subband , where N subband This represents the number of columns in the W4 matrix, and also the number of subbands transmitted. Each row of W4 is a 1×N matrix. subband The frequency domain basis vectors are indicated by the indices of the vectors in the second codebook, including the index indicator i of the frequency domain basis vectors. 4,1 And optionally, the index indicator i of the intermediate frequency domain basis vectors 4,2 The second codebook can be a set of any orthogonal or non-orthogonal basis vectors formed by Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Slepian Transform, frequency domain eigenvectors, etc. The second codebook index indicates i. 4,1 and i 4,2 This forms the W4 matrix. The second codebook can be predefined by the protocol, configured by the network through higher-layer signaling (RRC signaling), reported by the terminal (frequency domain feature vector codebook), or a combination of the above. The effect of W4′·W4 is that for an original dimension of R1×N... subbandThe frequency domain basis vector matrix is ​​compressed in the frequency domain with a rank of K.

[0175] With W4′=[q1 … q K ], That is, for dimensions R1×N subband The matrix is ​​estimated and decomposed to have a rank of K. The value of K can be selected and reported by the terminal, configured by the network through higher-layer signaling (RRC signaling), or a combination of both. subband The value can be predefined by the protocol, configured by the network through higher-level signaling (RRC signaling), or a combination of both.

[0176] Based on the foregoing description, taking the basis vectors of the first codebook as spatial basis vectors and the basis vectors of the second codebook as frequency basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: Let the W2 matrix be formed by the first merging coefficients: Let the W3 matrix be formed by the second merging coefficients: Let the W4′ matrix be formed by the third merging coefficients: Let the matrix formed by the vectors in the second codebook be: Based on the first codebook index, first merging coefficient, second merging coefficient, third merging coefficient, and second codebook index reported by the terminal, all N values ​​of a certain layer are obtained through vector summation expansion. subband Subband precoding codewords, that is, the precoding matrix of all subbands in any given layer, can be written as:

[0177] Among them, b l , The index of the spatial basis vector in the horizontal dimension indicates i 1,1 The index indicator i of the spatial basis vectors in the vertical dimension 1,2 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indication i of the position of the first non-zero coefficient 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure. The index of the frequency domain basis vector indicates i 4,1 And optionally, the index indicator i of the intermediate frequency domain basis vectors 4,2 Sure; The indication i of the position of the third non-zero coefficient 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude merging coefficient i 4′,3 Sure; The indication i of the position of the third non-zero coefficient 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 Third phase merging coefficient i 4′,4 Sure.

[0178] Option F: In this option, the values ​​of the intermediate matrix are determined as follows:

[0179] The first codebook index is used to obtain the basis vectors of the first codebook in two polarization directions. There are L basis vectors in each polarization direction, where L is an integer greater than 0.

[0180] Using the first merging coefficient and the basis vector indicated by the first codebook index in each polarization direction, the first basis vector set is obtained, wherein the number of basis vectors in the first basis vector set is 2R0, and there are R0 basis vectors in each polarization direction, where R0 is an integer greater than 0;

[0181] The first basis vector set is linearly merged using the second merging coefficient to obtain a second basis vector set, where the number of columns in the second basis vector set is R1, and R1 is an integer greater than 0.

[0182] The second basis vector set is merged using the third merging coefficient to obtain a third basis vector set, wherein the number of columns in the third basis vector set is K, and K is an integer greater than 0;

[0183] The precoding matrix is ​​obtained by linearly merging the basis vectors indicated by the second codebook index using the third basis vector set, wherein the basis vectors indicated by the second codebook index are K basis vectors of length N. subband The row vectors of the precoding matrix have N columns. subban1 N dubband This represents the number of subbands reported by the terminal, and is a positive integer.

[0184] That is, based on the first codebook index, L vectors are obtained for each of the two polarization directions, for a total of 2L vectors; after the first merging coefficient and the first codebook index are processed, R0 vectors are obtained for each of the two polarization directions (a total of 2R0 vectors), which is the first basis vector set; the second merging coefficient further merges the aforementioned 2R0 vectors into R1 vectors, obtaining the second basis vector set; the third merging coefficient further merges the aforementioned R... b The vectors are further merged into K vectors to obtain the third basis vector set; the aforementioned K vectors are used to obtain K vectors of length N based on the second codebook index. suuband The row vectors are merged to obtain N. subband The precoding matrix is ​​obtained by using vectors.

[0185] Specifically, the above precoding matrix can be represented by the following codebook structure:

[0186] Among them, W1 and W2 are the same as those in the aforementioned scheme D.

[0187] Here, W3 is the matrix of the second merging coefficients. It's important to note that in this case, the dimension of matrix W3 differs from the previous scheme; the dimension of W3 is 2R0×R1. The design and use of W3 are the same as in scheme B, the difference being that the number of columns is R1. Here, R1 is the number of columns in matrix W3. For merging 2R0 spatial vectors, the second merging coefficients can be any form of linear merging, including the indicator i of the non-zero coefficient position of the second merging coefficient. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific details are similar to those of Plan D, and will not be repeated here.

[0188] Among them, W4′ is the matrix of the third merging coefficients, which is the same as that of scheme E.

[0189] Here, W4 is a matrix composed of K vectors from the second codebook, which is the same as scheme E.

[0190] Based on the foregoing description, taking the basis vectors of the first codebook as spatial basis vectors and the basis vectors of the second codebook as frequency basis vectors as an example, let the W1 matrix formed by the indices of the first codebook be: W1 = [b1 … b L Let the W2 matrix, formed by the first merging coefficients, be: Let the W3 matrix be formed by the second merging coefficients: Let the W4′ matrix be formed by the third merging coefficients: Let the matrix formed by the vectors in the second codebook be: Based on the first codebook index, first merging coefficient, second merging coefficient, third merging coefficient, and second codebook index reported by the terminal, all N values ​​of a certain layer are obtained through vector summation expansion. subband Subband precoding codewords, that is, the precoding matrix of all subbands in any given layer, can be written as:

[0191] Among them, b l It is indicated by the index i of the spatial basis vectors in the first dimension. 1,1 The index indicator i of the second-dimensional spatial basis vector 1,2 Sure; The indicator i is the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 Sure; The indicator i is the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 First phase merging coefficient i 2,4 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Sure; The indication i of the position of the second non-zero coefficient 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 Second phase merging coefficient i 3,4 Sure. The index of the frequency domain basis vector indicates i 4,1 And optionally, the index indicator i of the intermediate frequency domain basis vectors 4,2 Sure; The indication i of the position of the third non-zero coefficient 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude merging coefficient i 4′,3 Sure; The indication i of the position of the third non-zero coefficient 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 Third phase merging coefficient i 4′,4 Sure.

[0192] In this embodiment, the basis vectors indicated by the first codebook index are linearly merged using a first merging coefficient to obtain a first set of basis vectors. This optimizes the basis vectors indicated by the first codebook index, making them more compatible with the characteristics of the cell or terminal. Furthermore, by linearly merging the basis vectors based on the first set of basis vectors and the second codebook basis vectors indicated by the second codebook index using a second merging coefficient, more accurate beam direction and delay path estimation can be obtained, thereby improving codebook accuracy and precoding matrix performance. Simultaneously, since the first set of basis vectors obtained by linearly merging the basis vectors indicated by the first codebook index using the first merging coefficient is more compatible with the characteristics of the cell or terminal, fewer non-zero coefficients are required to obtain the optimal beam direction and delay when merging using the second merging coefficient, thus reducing reporting overhead.

[0193] In one embodiment of this disclosure, the main operations of the terminal may further include:

[0194] Step 201: The terminal receives the channel state information reporting parameters configured by the network, wherein the channel state information reporting parameters are used to measure and report channel state information.

[0195] The channel state information (CSI) reporting parameters include CSI reporting bandwidth, subband size, and reference signal configuration. The CSI reporting bandwidth consists of continuous or discontinuous CSI subbands within the system. Each CSI subband includes several consecutive Physical Resource Blocks (PRBs). The number of PRBs in each CSI subband can be configured by the network to the terminal via parameters, or it can be a pre-agreed number.

[0196] Step 202: Receive the reference signal sent by the network device.

[0197] The terminal receives reference signals from the base station, which may be Channel State Information Reference Signals (CSI-RS).

[0198] Step 203: The terminal performs channel estimation based on the reference signal to obtain a downlink channel matrix on one or more subcarrier sets.

[0199] Step 204: The terminal calculates the first broadband correlation matrix (such as the spatial broadband correlation matrix) based on the downlink channel matrix.

[0200] The terminal calculates the first wideband correlation matrix based on the downlink channel matrix within the CSI reporting bandwidth. Let H be the channel matrix of subcarrier i within the CSI reporting bandwidth. i Dimension N r×(2N1N2), where N r Where 2N1N2 is the number of receiving antennas at the terminal, and 2N1N2 is the number of antenna ports for CSI-RS transmission from the base station, the calculation of the empty first broadband correlation matrix is ​​as follows:

[0201] Where Sc is the set of subcarriers within the CSI reporting bandwidth.

[0202] Step 205: The terminal obtains a first matrix based on the first broadband correlation matrix. The first matrix is ​​a matrix composed of the largest R0 principal eigenvectors of the first broadband correlation matrix, or it is a matrix obtained by linear transformation or linear combination of the largest R0 principal eigenvectors of the first broadband correlation matrix, where R0 is an integer greater than 0.

[0203] For example, the terminal performs eigenvalue decomposition on the first broadband correlation matrix and selects the R0 largest principal eigenvectors. remember Other algorithms can also be used to calculate the E matrix. For example, the E matrix is ​​the largest R0 principal eigenvectors of the first broadband correlation matrix. The E matrix is ​​obtained through linear transformation or linear combination, or it is obtained by linear transformation of the principal eigenvector e1 of the first broadband correlation matrix. in, These are linear transformation matrices.

[0204] The E matrix can also be determined using methods such as Newton's iteration method, Jacob's method, or orthogonal triangular decomposition (QR).

[0205] Step 206: Based on the first matrix, determine the first merging coefficient and / or the second merging coefficient.

[0206] (1) Among them, determining the first merging coefficient includes:

[0207] Step 207: The terminal determines the first codebook index based on the first broadband correlation matrix and the first codebook.

[0208] The terminal selects a basis vector from the first codebook and constructs the first codebook index W1 using the indices of the selected basis vectors. One implementation is to select the basis vectors in an energy-maximizing manner, that is, for any vector v in the first codebook... i ,calculate Select the L largest Revi vectors, denoted as b1 … b L .

[0209] For the aforementioned schemes A, C, and E... For the aforementioned scheme B, B1, D, F, W1 = [b1 … b L The terminal uses the index values ​​of the L vectors in the first codebook as the index of the first codebook.

[0210] Step 208: The terminal obtains the first merging coefficient based on the first codebook index and the first matrix.

[0211] The terminal calculates the matrix W2 = Quant((W1)) corresponding to the first merging coefficient. H E). Here, Quant(A) is a function that quantizes each element of matrix A, which can be scalar quantization or vector quantization. The quantization function Quant(A) can quantize some elements in matrix A to 0 values, for example, quantizing values ​​below a set threshold to 0.

[0212] The terminal obtains the indication i of the position of the first non-zero coefficient based on W2. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 .

[0213] (2) Among them, determining the second merging coefficient includes:

[0214] I. For schemes A and B, based on the channel state information of any sub-band within the CSI reported bandwidth, the first codebook index, and the first combining coefficient, determine the second combining coefficient associated with the sub-band, specifically including the following:

[0215] S1. For any sub-band within the CSI reporting bandwidth:

[0216] There are at least two ways to do this:

[0217] Method 1

[0218] (1) The terminal performs eigenvalue decomposition on the correlation matrix of the subband and takes the largest RI principal eigenvectors s1, s2, ..., s RI Let S = [s1, s2, ..., s RI The subband correlation matrix is ​​calculated using the same method as the broadband correlation matrix, which is calculated using the channel matrix on the subcarriers within that subband.

[0219] (2) The terminal calculates the matrix corresponding to the second merging coefficient:

[0220] For scheme A: W3 = Quant((W1W2) H S);

[0221] For option B:

[0222] Method 2

[0223] (1) Calculate the subband correlation matrix R at the terminal. s Terminal pair matrix (W1W2) H R s W1W2 or Perform eigenvalue decomposition and select the RI largest principal eigenvectors u1, u2, ..., u RI .

[0224] (2) The terminal calculates the second merging coefficient matrix W3 = Quant([u1,u2,...,u...). RI ]).

[0225] Subsequently, the terminal calculates the indication i of the second non-zero coefficient position based on W3. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific calculation is similar to the relevant indications of the first merging coefficient, and will not be repeated here.

[0226] S2, the terminal will obtain the first codebook index, and the indicator i of the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 The second combination is not an indicator of the zero coefficient position. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 Send it to the network device.

[0227] II. Regarding Scheme B1, the terminal, based on the channel state information of any sub-band within the CSI-reported bandwidth, the first codebook index, and the first combining coefficient, traverses possible column selection vectors and combining factors to determine the second combining coefficient associated with the sub-band. The column selection vector is a basis vector from a set of first basis vectors determined based on the first codebook index and the first combining coefficient. Specifically, this may include:

[0228] S1. For any sub-band within the CSI reporting bandwidth:

[0229] (1) The terminal performs eigenvalue decomposition on the correlation matrix of the subband and takes the largest RI principal eigenvectors s1, s2, ..., s RI Let S = [s1, s2, ..., sRI The subband correlation matrix is ​​calculated using the same method as the broadband correlation matrix, which is calculated using the channel matrix on the subcarriers within that subband.

[0230] (2) The terminal calculates the second merging coefficient matrix W3. One approach is for the terminal to traverse possible column selection vectors and merging factors, select the optimal combination of column selection vectors and merging factors, and determine the second merging coefficient associated with the subband.

[0231] (3) The terminal obtains the indication i of the position of the second non-zero coefficient based on W3. 3,1 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 .

[0232] S2, the terminal will obtain the first codebook index, and the indicator i of the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 The second combination is not an indicator of the zero coefficient position. 3,1 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 Send it to the network device.

[0233] III. For schemes C and D, there are at least a few ways to determine the second merging coefficient:

[0234] Method 1

[0235] S1. Calculate the second broadband correlation matrix based on the downlink channel matrix within the CSI reported bandwidth.

[0236] Specifically, the terminal calculates the frequency broadband correlation matrix, i.e., the second broadband correlation matrix. The terminal calculates the frequency broadband correlation matrix based on the downlink channel matrix within the CSI reporting bandwidth. Let H be the channel matrix of subcarrier i within the CSI reporting bandwidth. i Dimension N r ×(2N1N2), where N r 2N1N2 represents the number of receiving antennas at the terminal, and 2N1N2 represents the number of CSI-RS antenna ports transmitted by the base station. Let matrix G... mn =[H1(m,n) H2(m,n) … H F [m,n], where F is the number of subcarriers, H1(m,n) is the element in the m-th row and n-th column of matrix H1, and so on. The frequency domain broadband channel correlation matrix is ​​then calculated as follows:

[0237] S2. Determine the second codebook index W4 based on the second wideband correlation matrix and the second codebook.

[0238] One implementation is to choose based on energy maximization, that is, for any vector f in the second codebook... i ,calculate Select the R1 largest Revi vectors, denoted as s1 … s K .

[0239] The terminal uses the index values ​​of the K vectors in the second codebook as the index of the second codebook.

[0240] S3. Obtain a third matrix based on the channel state information of any sub-band within the CSI reporting bandwidth. The third matrix is ​​a matrix composed of the largest principal eigenvector of the first sub-band correlation matrix. The first sub-band correlation matrix is ​​a sub-band correlation matrix calculated based on the downlink channel state information of the sub-band.

[0241] For any layer of the precoding matrix:

[0242] For any subband n within the CSI reporting bandwidth SB The terminal performs eigenvalue decomposition on the correlation matrix of the sub-band, takes the largest principal eigenvector s1, and obtains the third matrix, denoted as S(n). SB )=[s1]. The calculation method for the subband correlation matrix is ​​the same as that for the broadband correlation matrix, which is calculated using the channel matrix on the subcarriers within the subband.

[0243] S4. Based on the first codebook index, the first merging coefficient, the third matrix, and the second codebook index, the second merging coefficient W3 is obtained, expressed as:

[0244] W3 = Quant((W1W2) H [[S(1) S(2) … S(N subband )](W4) H );or

[0245] Method 2

[0246] S1. Calculate the second broadband correlation matrix based on the downlink channel matrix within the CSI reported bandwidth.

[0247] S2. Determine the second codebook index W4 based on the second wideband correlation matrix and the second codebook.

[0248] S3. Obtain a third matrix based on the channel state information of any sub-band within the CSI reporting bandwidth. The third matrix is ​​a matrix composed of the largest principal eigenvector of the first sub-band correlation matrix. The first sub-band correlation matrix is ​​a sub-band correlation matrix calculated based on the downlink channel state information of the sub-band.

[0249] In this case, S1-S3 of method two can be described with reference to S1-S3 of method one.

[0250] S4. Determine the fourth merging coefficient based on the third matrix, the first codebook index, and the first merging coefficient.

[0251] For scheme C, the terminal calculates the fourth merging coefficient W6: W6(n) SB )=(W1W2) H S(n SB ).

[0252] For scheme D, the terminal calculates the fourth merging coefficient W6:

[0253] S5. Based on the fourth merging coefficient and the second codebook index, the second merging coefficient is obtained.

[0254] Specifically, the terminal calculates W3 as: W3 = Quant([W6(1) W6(2) … W6(N)) subband )](W4) H ).

[0255] Method 3: The terminal determines the second combining coefficient associated with the sub-band based on the channel state information of any sub-band within the bandwidth reported by CSI, the first codebook index, the first combining coefficient, and the second codebook index.

[0256] For any subband n within the CSI reporting bandwidth SB The terminal calculates the subband correlation matrix R. s Terminal pair matrix (W1W2) H R s W1W2 or Perform eigenvalue decomposition and select the RI largest principal eigenvectors u. 1,nSB ,u 2,nSB ,...,u RI,nSB .

[0257] For the i-th layer, the terminal calculates the second merging coefficient W3.

[0258] Based on the above three methods, the terminal calculates the indication i of the second non-zero coefficient position according to W3. 3,1 The indicator i of the position of the second strongest combined coefficient3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The specific calculation is similar to the relevant indications of the first merging coefficient, and will not be repeated here.

[0259] Subsequently, the terminal will obtain the first codebook index, the second codebook index, and the indicator i of the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 The second combination is not an indicator of the zero coefficient position. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 Send it to the network device.

[0260] IV. For codebook schemes E and F, the third merging coefficient can be determined as follows:

[0261] S1. Calculate the second broadband correlation matrix based on the downlink channel matrix within the CSI reported bandwidth.

[0262] Specifically, the terminal calculates the frequency broadband correlation matrix, i.e., the second broadband correlation matrix. The terminal calculates the frequency broadband correlation matrix based on the downlink channel matrix within the CSI reporting bandwidth. Let H be the channel matrix of subcarrier i within the CSI reporting bandwidth. i The dimension is N4×(2N1N2), where N r 2N1N2 represents the number of receiving antennas at the terminal, and 2N1N2 represents the number of CSI-RS antenna ports transmitted by the base station. Let matrix G... mn =[H1(m,n) H2(m,n) …H F [m,n], where F is the number of subcarriers, H1(m,n) is the element in the m-th row and n-th column of matrix H1, and so on. The frequency domain broadband channel correlation matrix is ​​then calculated as follows:

[0263] S2. Determine the second codebook index based on the second wideband correlation matrix and the second codebook.

[0264] The terminal selects a vector from the second codebook to form the second codebook index W4. One implementation is to select the vector in an energy-maximizing manner, that is, for any vector f in the second codebook... i ,calculate Select the K largest Revi vectors, denoted as s1 … s K .So:

[0265] The terminal uses the index values ​​of the K vectors in the second codebook as the index of the second codebook.

[0266] S3. Based on the second bandwidth correlation matrix, a fourth matrix is ​​obtained. The fourth matrix is ​​a matrix composed of the largest R1 principal eigenvectors of the second bandwidth correlation matrix, or it is a matrix obtained by linear transformation or linear combination of the largest R1 principal eigenvectors of the second bandwidth correlation matrix, where R1 is an integer greater than 0.

[0267] For example, the terminal performs eigenvalue decomposition on the second bandwidth correlation matrix and selects the R1 largest principal eigenvectors. We obtain the fourth matrix, denoted as...

[0268] S4. The terminal obtains the third merging coefficient based on the fourth matrix and the second codebook index.

[0269] The terminal calculates the third combined coefficient matrix W4′=Quant(Q(W4)). H The terminal obtains the indication i of the position of the third non-zero coefficient based on W4′. 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude merging coefficient i 4′,3 Third phase merging coefficient i 4′,4 .

[0270] For schemes E and F, the second merging coefficient can be calculated as follows:

[0271] Method 1

[0272] S1. Obtain a third matrix based on the channel state information of any sub-band within the CSI reporting bandwidth. The third matrix is ​​a matrix composed of the largest principal eigenvector of the first sub-band correlation matrix. The first sub-band correlation matrix is ​​a sub-band correlation matrix calculated based on the downlink channel state information of the sub-band.

[0273] For any subband n within the CSI reporting bandwidth SB The terminal performs eigenvalue decomposition on the correlation matrix of the subband, takes the largest principal eigenvector s1, and obtains the third matrix, denoted as S(n). SB )=[s1]. The calculation method for the subband correlation matrix is ​​the same as that for the broadband correlation matrix, which is calculated using the channel matrix on the subcarriers within the subband.

[0274] S2. Determine the fourth merging coefficient based on the third matrix, the first codebook index, and the first merging coefficient. For one layer of the precoding matrix:

[0275] For scheme E, the terminal calculates the fourth merging coefficient W6: W6(n SB )=(W1W2) H S(n SB );

[0276] For scheme F, the terminal calculates the fourth merging coefficient W6:

[0277] S3. The second merging coefficient is obtained based on the second codebook index, the third merging coefficient, and the fourth merging coefficient.

[0278] The second merging coefficient can be expressed as: W3 = Quant([W6(1) W6(2) … W6(N)) subband )](W4′W4) H ).

[0279] Method 2

[0280] S1. Obtain a third matrix based on the channel state information of any sub-band within the CSI reporting bandwidth. The third matrix is ​​a matrix composed of the largest principal eigenvector of the first sub-band correlation matrix. The first sub-band correlation matrix is ​​a sub-band correlation matrix calculated based on the downlink channel state information of the sub-band.

[0281] For any subband n within the CSI reporting bandwidth SB The terminal performs eigenvalue decomposition on the correlation matrix of the subband, takes the largest principal eigenvector s1, and obtains the third matrix, denoted as S(n). SB )=[s1]. The calculation method for the subband correlation matrix is ​​the same as that for the broadband correlation matrix, which is calculated using the channel matrix on the subcarriers within the subband.

[0282] S2. The terminal obtains the second merging coefficient based on the first codebook index, the first merging coefficient, the third matrix, the second codebook index, and the third merging coefficient.

[0283] The second merging coefficient can be expressed as: W3 = Quant((W1W2)) H [[S(1) S(2) … S(N subband )](W4′W4) H );or

[0284] The terminal calculates the indication i of the position of the second non-zero coefficient based on W3. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4The specific calculation is similar to the relevant indications of the first merging coefficient, and will not be repeated here.

[0285] Subsequently, the terminal will obtain the first codebook index, the second codebook index, and the indicator i of the position of the first non-zero coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 The second combination is not an indicator of the zero coefficient position. 3,1 The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 The third combination is not an indicator of the zero coefficient position. 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude merging coefficient i 4′,3 Third phase merging coefficient i 4′,4 Send it to the network device.

[0286] In some embodiments of this disclosure, the terminal may also receive codebook parameters sent by a network device, wherein the codebook parameters are used to determine the values ​​of the intermediate matrix, including one or more of the following:

[0287] Antenna port (N1, N2) parameter configuration in the horizontal and / or vertical directions;

[0288] Configuration of oversampling factors (O1, O2) in the horizontal and / or vertical directions;

[0289] Codebook subset constraints and / or rank constraints (levels) information are configured by RRC;

[0290] Port selection configurations, such as port codebook size and port rank (layer) limit;

[0291] The configuration information for the sub-band precoding matrix indicator (PMI) is calculated based on the sub-band channel quality indicator (CQI).

[0292] Codebook configuration parameter combinations;

[0293] The value of L in the first codebook index;

[0294] The value of R0 in the first merging coefficient; the number of non-zero coefficients K contained in the first merging coefficient. 01In some embodiments, the first merging coefficient amplitude quantization form (e.g., SQ, VQ) and bit width, the first merging coefficient phase adjustment quantization form (e.g., BPSK, QPSK, 8PSK), and whether the sub-band reports the first merging coefficient amplitude adjustment.

[0295] The number K of non-zero coefficients included in the first merging coefficient. 01 In some embodiments, the first merging coefficient amplitude quantization form (e.g., SQ, VQ) and bit width, the first merging coefficient phase adjustment quantization form (e.g., BPSK, QPSK, 8PSK), and whether the sub-band reports the first merging coefficient amplitude adjustment.

[0296] The number K of non-zero coefficients included in the second merging coefficient 02 In some embodiments, the value of R1 is (when the terminal reports the second codebook index and the terminal reports the third merging coefficient); in some embodiments, the amplitude quantization form (e.g., SQ, VQ) and bit width of the second merging coefficient, the phase adjustment quantization form (e.g., BPSK, QPSK, 8PSK) of the second merging coefficient, and whether the sub-band reports the amplitude adjustment of the second merging coefficient.

[0297] The third combining coefficient includes the number of non-zero coefficients, K. 03 In some embodiments, the third merging coefficient amplitude quantization form (e.g., SQ, VQ) and bit width, the second merging coefficient phase adjustment quantization form (e.g., BPSK, QPSK, 8PSK), and whether the sub-band reports the third merging coefficient amplitude adjustment.

[0298] The codebook parameters may include one or more of the following:

[0299] The amplitude quantization form and bit width of the first merging coefficient;

[0300] The phase adjustment quantization form of the first merging coefficient;

[0301] Whether the first merging coefficient amplitude should be adjusted in the sub-band report;

[0302] The value of the number R1 of the second spatial basis vectors;

[0303] The second quantization form of the combined coefficient amplitude;

[0304] The second merging coefficient phase adjustment quantization form;

[0305] Whether the second merging coefficient amplitude should be adjusted in the sub-band report;

[0306] The third merging coefficient amplitude quantization form;

[0307] The third merging coefficient phase adjustment quantization form;

[0308] Whether the third merging coefficient amplitude should be adjusted in the sub-band report;

[0309] The value of K in the second codebook index;

[0310] Information related to sub-band reporting;

[0311] Indicators of the types of spatial basis vectors in the first codebook (e.g., DFT, DCT, ST eigenvectors);

[0312] Indicators of the types of frequency domain basis vectors in the second codebook (e.g., DFT, DCT, ST eigenvectors);

[0313] Reported volume;

[0314] The type of codebook reported, such as CSI reporting based on the codebook of this disclosure embodiment, and the reporting quantity is PMI-RI-CQI, etc.

[0315] Referring to Figure 2, Figure 2 illustrates a method for determining the precoding matrix according to an embodiment of this disclosure, applied to a network device, including:

[0316] Step 301: Send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more intermediate matrices form a precoding matrix.

[0317] The meaning of the codebook parameters can be found in the description of the foregoing method embodiments. The method for determining the values ​​of the intermediate matrix and related content can also be found in the description of the foregoing method embodiments.

[0318] Step 302: Receive target information sent by the terminal. The target information includes, but is not limited to, first information reported by the terminal; the explanation of the first information can be found in the description of the foregoing method embodiments.

[0319] Step 303: Determine the target precoding matrix based on the target information.

[0320] After determining the target precoding matrix, the base station determines the precoding matrix to be used for the final Physical downlink shared channel (PDSCH) / Demodulation Reference Signal (DMRS) channel transmission based on the obtained channel state information and scheduling decisions, and then performs transmission accordingly.

[0321] Based on the above embodiments, the network device may also send channel state information reporting parameters to the terminal, wherein the channel state information reporting parameters are used to measure and report channel state information; and send a reference signal to the terminal, wherein the reference signal is used for channel estimation.

[0322] In this embodiment, the basis vectors indicated by the first codebook index are linearly merged using a first merging coefficient to obtain a first set of basis vectors. This optimizes the basis vectors indicated by the first codebook index, making them more compatible with the characteristics of the cell or terminal. Furthermore, by linearly merging the basis vectors based on the first set of basis vectors and the second codebook basis vectors indicated by the second codebook index using a second merging coefficient, more accurate beam direction and delay path estimation can be obtained, thereby improving codebook accuracy and precoding matrix performance. Simultaneously, since the first set of basis vectors obtained by linearly merging the basis vectors indicated by the first codebook index using the first merging coefficient is more compatible with the characteristics of the cell or terminal, fewer non-zero coefficients are required to obtain the optimal beam direction and delay when merging using the second merging coefficient, thus reducing reporting overhead.

[0323] Taking network equipment as a base station as an example, the following processing content may be included:

[0324] Step 401: The base station configures the codebook parameters via RRC signaling. The configurable codebook parameters are as described in the previous embodiments.

[0325] Step 402: Configure the channel status information reporting parameters for the base station, including CSI reporting bandwidth, sub-band size, reference signal resource configuration, and channel status information reporting configuration.

[0326] Step 403: The base station transmits reference signals, which may be Channel State Information Reference Signals (CSI-RS).

[0327] Step 404: The base station receives the channel state information report based on the precoding matrix of this embodiment reported by the terminal.

[0328] Channel state information reporting includes: an optional first codebook; an optional second codebook; a first codebook index; an optional second codebook index; and first combining coefficient information, including an indication of the position of the first non-zero combining coefficient. 2,1 The indicator i of the position of the first combined strongest coefficient 2,2 The first amplitude merging coefficient i 2,3 First phase merging coefficient i 2,4 The second merged coefficient information includes an indication of the position of the second merged non-zero coefficient. 3,1The indicator i of the position of the second strongest combined coefficient 3,2 The second amplitude combining coefficient i 3,3 Second phase merging coefficient i 3,4 Optional third merge coefficient information, including an indication of the position of the third merge non-zero coefficient. 4′,1 The indicator i of the position of the third strongest coefficient in the merging 4′,2 The third amplitude combining coefficient i′ 4,3 Third phase merging coefficient i 4′,4 The base station obtains the precoding matrices for each layer and / or sub-band, along with the associated channel state information, reported by the terminal based on the terminal's channel state information.

[0329] Step 405: The base station makes terminal scheduling decisions based on the precoding matrices of each layer and / or each sub-band and the associated channel state information.

[0330] Step 406: Based on the channel state information and scheduling decisions described above, the base station determines the precoding matrix to be used for the final PDSCH / DMRS channel transmission and transmits accordingly.

[0331] As can be seen from the above description, the embodiments of this disclosure realize the fusion design and rapid switching of conventional precision codebooks and high precision codebooks, reducing the complexity of base station codebook, measurement reference signal, and CSI reporting configuration.

[0332] The technical solutions provided in this disclosure can be applied to a variety of systems. For example, applicable systems may include Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Long Term Evolution Advanced (LTE-A) systems, Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) systems, 5th Generation Mobile Communication Technology (5G) New Radio (NR) systems and their evolutionary communication systems, and 6th Generation Mobile Communication Technology (6G) systems. These systems may include terminal equipment and network equipment. The systems may also include a core network component, such as an Evolved Packet Core (EPC) or a 5G core (5GC).

[0333] The terminal devices involved in the embodiments of this disclosure can be devices that provide voice and / or data connectivity to users, handheld devices with wireless connectivity, or other processing devices connected to a wireless modem. The names of the terminal devices may differ in different systems; for example, in 5G or 6G systems, the terminal device may be called User Equipment (UE). Wireless terminal devices can be USB storage devices, other personal computer memory devices, and dongles. They can also communicate with one or more core networks (CNs) via a Radio Access Network (RAN). Wireless terminal devices can be mobile terminal devices, such as mobile phones (or "cellular" phones) and computers with mobile terminal devices. For example, they can be portable, pocket-sized, handheld, computer-embedded, or vehicle-mounted mobile devices that exchange voice and / or data with the radio access network. Examples of such devices include Personal Communication Service (PCS) telephones, cordless phones, Session Initiated Protocol (SIP) phones, Wireless Local Loop (WLL) stations, Personal Digital Assistants (PDAs), personal computers, tablets, and Machine-type Communication (MTC) terminal devices. Wireless terminal devices can also be referred to as systems, subscriber units, subscriber stations, mobile stations, mobile devices, remote stations, access points, remote terminals, access terminals, user terminals, user agents, user devices, and wireless access devices and routers / modems that meet the limitations of this definition, but are not limited to these in the embodiments of this disclosure.

[0334] The network device involved in this disclosure can be a base station, which may include multiple cells providing services to terminals. Depending on the specific application, the base station may also be called an access point, or a device in the access network that communicates with wireless terminal devices through one or more sectors on the air interface, or other names. The network device can be used to exchange received air frames with Internet Protocol (IP) packets, acting as a router between the wireless terminal device and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) communication network. The network device can also coordinate the attribute management of the air interface. For example, the network device involved in this disclosure can be an evolved Node B (eNB or e-NodeB) in a long term evolution (LTE) system, a 5G base station (gNB) in a next generation system, or a Home evolved Node B (HeNB), relay node, femto, pico, network testing equipment, etc., and is not limited in this disclosure. In some network architectures, network devices may include centralized unit (CU) nodes and distributed unit (DU) nodes, which may also be geographically separated.

[0335] Network devices and terminal devices can each use one or more antennas for Multiple Input Multiple Output (MIMO) transmission. MIMO transmission can be Single User MIMO (SU-MIMO) or Multiple User MIMO (MU-MIMO). Depending on the configuration and number of antenna combinations, MIMO transmission can be 2D MIMO, 3D MIMO, Full Dimension MIMO (FD-MIMO), or Massive MIMO. It can also be diversity transmission, pre-coded transmission, or beamforming transmission, etc.

[0336] As shown in Figure 3, the apparatus for determining the precoding matrix according to an embodiment of this disclosure, applied to a network device, includes: a processor 500, configured to read a program from a memory 520 and execute the following processes:

[0337] Send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix;

[0338] Receive target information sent by the terminal;

[0339] Determine the target precoding matrix based on the target information;

[0340] The value of the intermediate matrix is ​​determined based on the first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0341] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0342] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0343] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0344] Transceiver 510 is used to receive and send data under the control of processor 500.

[0345] In Figure 3, the bus architecture may include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 500 and memory represented by memory 520. The bus architecture may also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides an interface. Transceiver 510 may be multiple elements, including transmitters and receivers, providing a unit for communicating with various other devices over a transmission medium. Processor 500 is responsible for managing the bus architecture and general processing, and memory 520 may store data used by processor 500 during operation.

[0346] The processor 500 can be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD). The processor can also adopt a multi-core architecture.

[0347] The processor 500 is responsible for managing the bus architecture and general processing, while the memory 520 can store the data used by the processor 500 when performing operations.

[0348] The processor 500 is also used to read the program and perform the following steps:

[0349] Send channel state information reporting parameters to the terminal, wherein the channel state information reporting parameters are used to report channel state information;

[0350] A reference signal is sent to the terminal, the reference signal being used for channel estimation.

[0351] The target information includes, but is not limited to, first information. The value of the intermediate matrix and the explanation of the first information can be found in the description of the foregoing method embodiments.

[0352] It should be noted that the apparatus provided in this embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0353] As shown in Figure 4, the apparatus for determining the precoding matrix according to an embodiment of this disclosure, applied to a terminal, includes: a processor 600, configured to read a program from a memory 620 and execute the following processes:

[0354] A precoding matrix is ​​generated using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0355] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0356] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0357] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0358] Transceiver 610 is used to receive and send data under the control of processor 600.

[0359] In Figure 4, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 600 and memory represented by memory 620. The bus architecture can also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides an interface. Transceiver 610 can be multiple components, including transmitters and receivers, providing a unit for communicating with various other devices over a transmission medium. For different user equipment, user interface 630 can also be an interface capable of connecting external or internal devices, including but not limited to keypads, displays, speakers, microphones, joysticks, etc.

[0360] The processor 600 is responsible for managing the bus architecture and general processing, while the memory 620 can store the data used by the processor 600 when performing operations.

[0361] The processor 600 can be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD). The processor can also adopt a multi-core architecture.

[0362] The processor executes any of the methods described in the embodiments of this disclosure by invoking a computer program stored in memory, according to the obtained executable instructions. The processor and memory may also be physically separated.

[0363] The explanation of the values ​​of the intermediate matrix can be found in the description of the aforementioned method embodiments.

[0364] The processor 600 is also used to read the program and perform the following steps:

[0365] Report the first information to the network device.

[0366] For an explanation of the first information, please refer to the description of the foregoing method embodiments.

[0367] The processor 600 is also used to read the program and perform the following steps:

[0368] Receive channel state information reporting parameters sent by network devices, wherein the channel state information reporting parameters are used to measure and report channel state information;

[0369] Receive reference signals sent by the network device;

[0370] Channel estimation is performed based on the reference signal to obtain a downlink channel matrix on one or more subcarrier sets;

[0371] Calculate the first broadband correlation matrix based on the downlink channel matrix;

[0372] A first matrix is ​​obtained based on the first broadband correlation matrix. The first matrix is ​​a matrix composed of the largest R0 principal eigenvectors of the first broadband correlation matrix, or it is a matrix obtained by linear transformation or linear combination of the largest R0 principal eigenvectors of the first broadband correlation matrix, where R0 is an integer greater than 0.

[0373] Based on the first matrix, determine the first merging coefficient and / or the second merging coefficient.

[0374] The method for determining the first merging coefficient and the second merging coefficient can be referred to the description of the aforementioned method embodiments.

[0375] The processor 600 is also configured to read the program and perform the following steps: obtaining the third merging coefficient. The method for determining the third merging coefficient can be referred to the description of the foregoing method embodiments. In this case, the method for determining the second merging coefficient can be referred to the description of the foregoing method embodiments.

[0376] It should be noted that the apparatus provided in this embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0377] As shown in Figure 5, the apparatus for determining the precoding matrix according to an embodiment of this disclosure, applied to a terminal, includes:

[0378] The first processing unit 701 is configured to generate a precoding matrix using one or more intermediate matrices, wherein the values ​​of the intermediate matrices are determined based on first information, the first information including: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0379] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0380] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0381] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0382] The explanation and determination methods for the first information and the values ​​of the intermediate matrix can be found in the description of the aforementioned method embodiments.

[0383] The device may further include:

[0384] The first sending unit is configured to report the first information to the network device. An explanation of the first information can be found in the description of the foregoing method embodiments.

[0385] The device may further include:

[0386] The first receiving unit is used to receive channel state information reporting parameters sent by the network device, wherein the channel state information reporting parameters are used to measure and report channel state information;

[0387] The second receiving unit is used to receive the reference signal sent by the network device;

[0388] The second processing unit is used to perform channel estimation based on the reference signal to obtain a downlink channel matrix on one or more subcarrier sets;

[0389] The third processing unit is used to calculate the first broadband correlation matrix based on the downlink channel matrix;

[0390] The fourth processing unit is used to obtain a first matrix based on the first broadband correlation matrix. The first matrix is ​​a matrix composed of the largest R0 principal eigenvectors of the first broadband correlation matrix, or it is a matrix obtained by linear transformation or linear combination of the largest R0 principal eigenvectors of the first broadband correlation matrix, where R0 is an integer greater than 0.

[0391] Based on the first matrix, determine the first merging coefficient and / or the second merging coefficient.

[0392] The method for determining the first merging coefficient and the second merging coefficient can be referred to the description of the aforementioned method embodiments.

[0393] The device may further include:

[0394] The fifth processing unit is used to obtain the third merging coefficient. The method for determining the third merging coefficient can be referred to the description of the foregoing method embodiments. In this case, the method for determining the second merging coefficient can be referred to the description of the foregoing method embodiments.

[0395] It should be noted that the apparatus provided in this embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0396] As shown in Figure 6, the apparatus for determining the precoding matrix according to an embodiment of this disclosure, applied to a network device, includes:

[0397] The first sending unit 801 is used to send codebook parameters to the terminal, wherein the codebook parameters are used to determine the values ​​of intermediate matrices, and one or more intermediate matrices form a precoding matrix; the first receiving unit 802 is used to receive target information sent by the terminal; and the first processing unit 803 is used to determine a target precoding matrix based on the target information.

[0398] The value of the intermediate matrix is ​​determined based on the first information, which includes: a first codebook index, a first merging coefficient, and a second merging coefficient.

[0399] Wherein, the first codebook index is an index selected from the basis vectors of the first codebook, and the first codebook is a codebook composed of multiple basis vectors;

[0400] The first merging coefficient is used to linearly merge the basis vectors indicated by the first codebook index to obtain a first set of basis vectors;

[0401] The second merging coefficient is used to perform linear merging based on the first set of basis vectors, wherein the result of the linear merging is used to obtain the precoding matrix.

[0402] The device may further include:

[0403] The second sending unit is used to send channel state information reporting parameters to the terminal, wherein the channel state information reporting parameters are used to report channel state information;

[0404] The third transmitting unit is used to transmit a reference signal to the terminal, the reference signal being used for channel estimation.

[0405] The target information includes, but is not limited to, first information. The explanation and determination method of the first information and the value of the intermediate matrix can be referred to the description of the foregoing method embodiments.

[0406] It should be noted that the apparatus provided in this embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0407] It should be noted that the division of units in the embodiments of this disclosure is illustrative and only represents one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional units in the various embodiments of this disclosure can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated units described above can be implemented in hardware or as software functional units.

[0408] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a processor-readable storage medium. Based on this understanding, the technical solution of this disclosure, in essence, or the part that contributes to related technologies, or all or part of the technical solution, can be embodied in the form of a computer software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0409] This disclosure also provides a communication device, including: a memory, a processor, and a program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps in the method for determining a precoding matrix as described above.

[0410] This disclosure also provides a computer program product, including computer instructions, which, when executed by a processor, implement the various processes of the above-described method embodiment for determining a precoding matrix and achieve the same technical effect. To avoid repetition, these will not be described again here.

[0411] This disclosure also provides a processor-readable storage medium storing a program. When executed by a processor, this program implements the various processes of the above-described method embodiments for determining the precoding matrix and achieves the same technical effect. To avoid repetition, it will not be described again here. The readable storage medium can be any available medium or data storage device accessible to the processor, including but not limited to magnetic storage (e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO)), optical storage (e.g., compact disc (CD), digital video disc (DVD), Blu-ray disc (BD), high-definition versatile disc (HVD)), and semiconductor storage (e.g., ROM, erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), non-volatile memory (NAND (Non-volatile Memory Device) FLASH), solid-state drives (SSD)).

[0412] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0413] Those skilled in the art will understand that embodiments of this disclosure can be provided as methods, systems, or computer program products. Therefore, this disclosure can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this disclosure can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0414] This disclosure describes embodiments of methods, apparatus (systems), and computer program products according to embodiments of this disclosure with reference to flowchart illustrations and / or block diagrams. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more flowchart illustrations and / or one or more block diagrams.

[0415] These processor-executable instructions may also be stored in a processor-readable memory that can instruct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0416] Furthermore, it should be noted that in the apparatus and method of this disclosure, it is obvious that the components or steps can be decomposed and / or recombined. These decompositions and / or recombinations should be considered equivalent solutions of this disclosure. Moreover, the steps performing the above series of processes can naturally be executed in the order described, but are not necessarily required to be executed in chronological order; some steps can be executed in parallel or independently of each other. Those skilled in the art will understand that all or any step or component of the method and apparatus of this disclosure can be implemented in any computing device (including processors, storage media, etc.) or network of computing devices, in hardware, firmware, software, or a combination thereof, which can be achieved by those skilled in the art using their basic programming skills after reading the description of this disclosure.

[0417] It should be noted that the above division of modules is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, these modules can be implemented entirely in software via processing element calls; they can be fully implemented in hardware; or some modules can be implemented by processing element calls to software, while others are implemented in hardware. For example, a module can be a separate processing element, or it can be integrated into a chip in the aforementioned device. Alternatively, it can be stored as program code in the memory of the aforementioned device, and its function can be called and executed by a processing element of the device. The implementation of other modules is similar. Moreover, these modules can be fully or partially integrated together, or they can be implemented independently. The processing element mentioned here can be an integrated circuit with signal processing capabilities. In the implementation process, each step of the above method or each of the above modules can be completed through integrated logic circuits in the hardware of the processor element or through software instructions.

[0418] For example, each module, unit, subunit, or submodule can be one or more integrated circuits configured to implement the above methods, such as one or more application-specific integrated circuits (ASICs), one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs). As another example, when a module is implemented using processing element scheduler code, the processing element can be a general-purpose processor, such as a central processing unit (CPU) or other processor capable of calling program code. Furthermore, these modules can be integrated together to implement a system-on-a-chip (SOC).

[0419] The terms “first,” “second,” etc., used in this disclosure and in the claims are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of this disclosure described herein may be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus. Additionally, the use of “and / or” in the specification and claims indicates at least one of the connected objects, such as A and / or B and / or C, indicating seven possibilities: A alone, B alone, C alone, and both A and B, both B and C, both A and C, and A, B, and C. Similarly, the use of “at least one of A and B” in this specification and claims should be understood as “A alone, B alone, or both A and B.”

[0420] Obviously, those skilled in the art can make various modifications and variations to the embodiments of this disclosure without departing from the spirit and scope of the embodiments of this disclosure. Therefore, if these modifications and variations to the embodiments of this disclosure fall within the scope of the claims of the embodiments of this disclosure and their equivalents, then the embodiments of this disclosure are also intended to include these modifications and variations.

Claims

1. A method for determining a precoding matrix, applied to a terminal, the method comprising: generating the precoding matrix by using one or more intermediate matrices, wherein values of the intermediate matrices are determined according to first information, the first information comprising: a first codebook index, a first combining coefficient, and a second combining coefficient; wherein the first codebook index is an index of a basis vector selected from a first codebook, the first codebook being a codebook consisting of a plurality of basis vectors; the first combining coefficient is used to linearly combine the basis vector indicated by the first codebook index to obtain a first set of basis vectors; the second combining coefficient is used to linearly combine based on the first set of basis vectors, wherein a result of the linear combination is used to obtain the precoding matrix.

2. The method of claim 1, wherein, the first information further comprises a second codebook index; wherein the second codebook index is an index of a basis vector selected from a second codebook, the second codebook index comprising an index of a basis vector in the second codebook, or comprising an index of a basis vector in the second codebook and an index of an intermediate basis vector, the second codebook comprising a codebook consisting of a plurality of basis vectors, the second codebook and the first codebook corresponding to different vector spaces; the second combining coefficient is specifically used to linearly combine based on the first set of basis vectors and a second codebook basis vector indicated by the second codebook index to obtain the precoding matrix.

3. The method of claim 1, wherein, the first information further comprises a second codebook index and a third combining coefficient; wherein the second codebook index is an index of a basis vector selected from a second codebook, the second codebook index comprising an index of a basis vector in the second codebook, or comprising an index of a basis vector in the second codebook and an index of an intermediate basis vector, the second codebook comprising a codebook consisting of a plurality of basis vectors, the second codebook and the first codebook corresponding to different vector spaces; the second combining coefficient is specifically used to linearly combine based on the first set of basis vectors to obtain a second set of basis vectors; the third combining coefficient is used to linearly combine the basis vector indicated by the second codebook index and the second set of basis vectors to obtain the precoding matrix.

4. The method of claim 1, wherein, values of the intermediate matrices are determined in the following manner: obtain basis vectors of the first codebook in two polarization directions by using the first codebook index, each polarization direction having L basis vectors, L being an integer greater than 0; linearly combine the basis vectors in the two polarization directions by using the first combining coefficient to obtain the first set of basis vectors, wherein the number of basis vectors in the first set of basis vectors is R0, R0 being an integer greater than 0; linearly combine the first set of basis vectors by using a matrix corresponding to the second combining coefficient to obtain the precoding matrix, the precoding matrix having a column number of Rl, Rl being a layer number of the precoding matrix, Rl being an integer greater than 0.

5. The method of claim 1, wherein, values of the intermediate matrices are determined in the following manner: obtain basis vectors of the first codebook in two polarization directions by using the first codebook index, each polarization direction having L basis vectors, L being an integer greater than 0; obtaining the first set of basis vectors by using the first combining coefficients and the basis vectors indicated by the first codebook indexes in each polarization direction, wherein the number of basis vectors in the first set of basis vectors is 2R0, and there are R0 basis vectors in each polarization direction, and R0 is an integer greater than 0; performing linear combination on the first set of basis vectors by using a matrix corresponding to the second combining coefficients to obtain the precoding matrix, and the number of columns of the precoding matrix is RI, and RI is the number of layers of the precoding matrix, and RI is an integer greater than 0.

6. The method of claim 5, wherein, The method for performing linear combination on the first set of basis vectors by using a matrix corresponding to the second combining coefficients to obtain the precoding matrix comprises: performing linear combination on the first set of basis vectors by using a matrix corresponding to the second combining coefficients to obtain the precoding matrix, and the number of columns of the precoding matrix is RI, and RI is the number of layers of the precoding matrix, and RI is an integer greater than 0.

7. The method of claim 2, wherein, The value of the intermediate matrix is determined in the following manner: obtaining basis vectors of the first codebook in two polarization directions by using the first codebook indexes, and selecting L basis vectors in each polarization direction, and L is an integer greater than 0; obtaining the first set of basis vectors by using the first combining coefficients and the basis vectors indicated by the first codebook indexes in each polarization direction, wherein the number of basis vectors in the first set of basis vectors is 2R0, and there are R0 basis vectors in each polarization direction, and R0 is an integer greater than 0; performing linear combination on the first set of basis vectors by using the second combining coefficients to obtain a second set of basis vectors, and the number of columns of the second set of basis vectors is K, and K is an integer greater than 0; linearly combine the basis vectors indicated by the second codebook index by using the second set of basis vectors to obtain the precoding matrix, wherein the basis vectors indicated by the second codebook index are K row vectors with a length of N subband , and the column number of the precoding matrix is N subband , N subband is the number of subbands reported by the terminal, and is an integer greater than 0.

8. The method of claim 2, wherein, The value of the intermediate matrix is determined in the following manner: obtaining basis vectors of the first codebook in two polarization directions by using the first codebook indexes, and there are L basis vectors in each polarization direction, and L is an integer greater than 0; obtaining the first set of basis vectors by using the first combining coefficients and the basis vectors indicated by the first codebook indexes in each polarization direction, wherein the number of basis vectors in the first set of basis vectors is 2R0, and there are R0 basis vectors in each polarization direction, and R0 is an integer greater than 0; performing linear combination on the first set of basis vectors by using the second combining coefficients to obtain a second set of basis vectors, and the number of columns of the second set of basis vectors is K, and K is an integer greater than 0; linearly combine the basis vectors indicated by the second codebook index by using the second set of basis vectors to obtain the precoding matrix, wherein the basis vectors indicated by the second codebook index are K row vectors with a length of N subband , and the column number of the precoding matrix is N subband , N subband is the number of subbands reported by the terminal, and is an integer greater than 0.

9. The method of claim 3, wherein, The value of the intermediate matrix is determined in the following manner: obtaining basis vectors of the first codebook in two polarization directions by using the first codebook indexes, and there are L basis vectors in each polarization direction, and L is an integer greater than 0; obtaining the first set of basis vectors by using the first combining coefficients and the basis vectors indicated by the first codebook indexes in each polarization direction, wherein the number of basis vectors in the first set of basis vectors is 2R0, and there are R0 basis vectors in each polarization direction, and R0 is an integer greater than 0; performing linear combination on the first set of basis vectors by using the second combining coefficients to obtain a second set of basis vectors, and the number of columns of the second set of basis vectors is K, and K is an integer greater than 0; performing combination on the second set of basis vectors by using the third combining coefficients to obtain a third set of basis vectors, and the number of columns of the third set of basis vectors is K, and K is an integer greater than 0; linearly combine the basis vectors indicated by the second codebook index by using the third basis vector set, to obtain the precoding matrix, wherein the basis vectors indicated by the second codebook index are K row vectors with a length of N subband , the column number of the precoding matrix is N subband , N subband is the number of subbands reported by the terminal, and is an integer greater than 0.

10. The method of claim 3, wherein, The value of the intermediate matrix is determined by the following manner: obtaining base vectors of the first codebook in two polarization directions by using the first codebook index, each polarization direction having L base vectors, L being an integer greater than 0; obtaining the first base vector set by using the first combining coefficient and the base vector indicated by the first codebook index in each polarization direction, the number of base vectors in the first base vector set being 2R0, each polarization direction having R0 base vectors, R0 being an integer greater than 0; performing linear combination on the first base vector set by using the second combining coefficient to obtain a second base vector set, the number of columns of the second base vector set being R1, R1 being an integer greater than 0; performing combination on the second base vector set by using the third combining coefficient to obtain a third base vector set, the number of columns of the third base vector set being K, K being an integer greater than 0; linearly combine the basis vectors indicated by the second codebook index by using the third set of basis vectors to obtain the precoding matrix, wherein the basis vectors indicated by the second codebook index are K row vectors of length N subband , and the number of columns of the precoding matrix is N subband , N subband is the number of subbands reported by the terminal, and is an integer greater than 0.

11. The method of any one of claims 1-3, wherein, The method further comprises: reporting the first information to a network device.

12. The method of claim 11, wherein one or more of the first codebook and the second codebook is fed back based on a wideband or a subband in a frequency domain and based on a first feedback period in a time domain; one or more of the first codebook index and the second codebook index is fed back based on a wideband in a frequency domain and based on a second feedback period in a time domain; the first combining coefficient is fed back based on a wideband or a subband in a frequency domain and based on a third feedback period in a time domain; the second combining coefficient is fed back based on a subband in a frequency domain and based on a fourth feedback period in a time domain; the third combining coefficient is fed back based on a wideband in a frequency domain and based on a fifth feedback period in a time domain; wherein the lengths of any two of the first to fifth feedback periods are the same or different.

13. The method of any one of claims 1-3, wherein, The first merged coefficient includes K 01 nonzero coefficients, K 01 is an integer greater than 0. wherein the first combining coefficient comprises one or more of: an indication of a first combining non-zero coefficient position, an indication of a first combining strongest coefficient position, a first amplitude combining coefficient, a first phase combining coefficient; wherein the indication of the first combining non-zero coefficient position is used to indicate position information of non-zero coefficients of each column in a matrix corresponding to the first combining coefficient; the indication of the first combining strongest coefficient position is used to indicate position information of strongest coefficients of each column in the matrix corresponding to the first combining coefficient; the first amplitude combining coefficient is used to indicate linear combination amplitude scaling coefficient information of each column in the matrix corresponding to the first combining coefficient; the first phase combining coefficient is used to indicate linear combination phase adjustment coefficient information of each column in the matrix corresponding to the first combining coefficient.

14. The method of claim 2, wherein, The second merged coefficient includes K 02 nonzero coefficients, K 02 is an integer greater than 0. wherein the second combining coefficient comprises one or more of: an indication of a second combining non-zero coefficient position, an indication of a second combining strongest coefficient position, a second amplitude combining coefficient, a second phase combining coefficient; wherein the indication of the second combining non-zero coefficient position is used to indicate position information of non-zero coefficients of each column in a matrix corresponding to the second combining coefficient; the indication of the second combining strongest coefficient position is used to indicate position information of strongest coefficients of each column in the matrix corresponding to the second combining coefficient; The second amplitude combination coefficient is used to indicate linear combination amplitude scaling coefficient information of each column in a matrix corresponding to the second combination coefficient. The second phase combination coefficient is used to indicate linear combination phase adjustment coefficient information of each column in a matrix corresponding to the second combination coefficient.

15. The method of claim 3, wherein, The third merged coefficient includes K 03 nonzero coefficients, K 03 is an integer greater than 0. The third combination coefficient includes one or more of the following: an indication of a third combination non-zero coefficient position, an indication of a third combination strongest coefficient position, a third amplitude combination coefficient, and a third phase combination coefficient. The indication of the third combination non-zero coefficient position is used to indicate non-zero coefficient position information of each column in a matrix corresponding to the third combination coefficient. The indication of the third combination strongest coefficient position is used to indicate strongest coefficient position information of each column in a matrix corresponding to the third combination coefficient. The third amplitude combination coefficient is used to indicate linear combination amplitude scaling coefficient information of each column in a matrix corresponding to the third combination coefficient. The third phase combination coefficient is used to indicate linear combination phase adjustment coefficient information of each column in a matrix corresponding to the third combination coefficient.

16. The method of claim 1, further comprising: receiving channel state information reporting parameters sent by a network device, wherein the channel state information reporting parameters are used to measure and report channel state information; receiving a reference signal sent by the network device; performing channel estimation according to the reference signal to obtain a downlink channel matrix on one or more subcarrier sets; calculating a first wideband correlation matrix according to the downlink channel matrix; obtaining a first matrix from the first wideband correlation matrix, wherein the first matrix is a matrix composed of the largest R0 principal eigenvectors of the first wideband correlation matrix, or is a matrix obtained by linear transformation or linear combination of the largest R0 principal eigenvectors of the first wideband correlation matrix, wherein R0 is an integer greater than 0; determining the first combination coefficient and / or the second combination coefficient based on the first matrix.

17. The method of claim 16, wherein, Determining the first combination coefficient includes: determining the first codebook index according to the first wideband correlation matrix and the first codebook; obtaining the first combination coefficient according to the first codebook index and the first matrix.

18. The method of claim 17, wherein, Determining the second combination coefficient includes: determining the second combination coefficient associated with any subband within the CSI reporting bandwidth according to channel state information of the subband, the first codebook index, and the first combination coefficient.

19. The method of claim 17, wherein, Determining the second combination coefficient includes: determining the second combination coefficient associated with any subband within the CSI reporting bandwidth by traversing possible column selection vectors and combination factors according to channel state information of the subband, the first codebook index, and the first combination coefficient, wherein the column selection vector is a basis vector in a first basis vector set determined according to the first codebook index and the first combination coefficient.

20. The method of claim 17, wherein, Determining the second combination coefficient includes: calculating a second wideband correlation matrix according to a downlink channel matrix within the CSI reporting bandwidth; determining the second codebook index according to the second wideband correlation matrix and a second codebook; The third matrix is obtained according to the channel state information of any subband within the CSI reporting bandwidth, and the third matrix is a matrix composed of the largest one principal eigenvector of the first subband correlation matrix, the first subband correlation matrix being a subband correlation matrix calculated according to the downlink channel state information of the subband; The second combining coefficient is obtained according to the first codebook index, the first combining coefficient, the third matrix and the second codebook index.

21. The method of claim 17, wherein, The second combining coefficient is determined by: The second wideband correlation matrix is calculated according to the downlink channel matrix within the CSI reporting bandwidth; The second codebook index is determined according to the second wideband correlation matrix and a second codebook; The third matrix is obtained according to the channel state information of any subband within the CSI reporting bandwidth, and the third matrix is a matrix composed of the largest one principal eigenvector of the first subband correlation matrix, the first subband correlation matrix being a subband correlation matrix calculated according to the downlink channel state information of the subband; The fourth combining coefficient is determined according to the third matrix, the first codebook index and the first combining coefficient; The second combining coefficient is obtained according to the fourth combining coefficient and the second codebook index.

22. The method of claim 17, wherein, The second combining coefficient is determined by: The second combining coefficient associated with the subband is determined according to the channel state information of any subband within the CSI reporting bandwidth, the first codebook index, the first combining coefficient and the second codebook index.

23. The method of claim 17, wherein, The method further comprises: The second wideband correlation matrix is calculated according to the downlink channel matrix within the CSI reporting bandwidth; The second codebook index is determined according to the second wideband correlation matrix and a second codebook; The fourth matrix is obtained according to the second wideband correlation matrix, the fourth matrix being a matrix composed of the largest R1 principal eigenvectors of the second wideband correlation matrix, or being a matrix obtained by linear transformation or linear combination of the largest R1 principal eigenvectors of the second wideband correlation matrix, where R1 is an integer greater than 0; The third combining coefficient is obtained according to the fourth matrix and the second codebook index.

24. The method of claim 23, wherein, The second combining coefficient is determined by: The third matrix is obtained according to the channel state information of any subband within the CSI reporting bandwidth, and the third matrix is a matrix composed of the largest one principal eigenvector of the first subband correlation matrix, the first subband correlation matrix being a subband correlation matrix calculated according to the downlink channel state information of the subband; The fourth combining coefficient is determined according to the third matrix, the first codebook index and the first combining coefficient; The second combining coefficient is obtained according to the second codebook index, the third combining coefficient and the fourth combining coefficient.

25. The method of claim 23, wherein, The second combining coefficient is determined by: The third matrix is obtained according to the channel state information of any subband within the CSI reporting bandwidth, and the third matrix is a matrix composed of the largest one principal eigenvector of the first subband correlation matrix, the first subband correlation matrix being a subband correlation matrix calculated according to the downlink channel state information of the subband; The second combining coefficient is obtained according to the first codebook index, the first combining coefficient, the third matrix, the second codebook index and the third combining coefficient. 26.A method for determining a precoding matrix, applied to a network device, the method comprising: sending a codebook parameter to a terminal, wherein the codebook parameter is used to determine values of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix; receiving target information sent by the terminal; determining a target precoding matrix according to the target information; wherein the values of the intermediate matrices are determined according to first information, and the first information comprises a first codebook index, a first combining coefficient and a second combining coefficient; wherein the first codebook index is an index of a basis vector selected from a first codebook, and the first codebook is a codebook comprising a plurality of basis vectors; the first combining coefficient is used to linearly combine the basis vector indicated by the first codebook index to obtain a first basis vector set; the second combining coefficient is used to linearly combine based on the first basis vector set, and a result of the linear combination is used to obtain the precoding matrix.

27. The method of claim 26, wherein, The first information further comprises a second codebook index; wherein the second codebook index is an index of a basis vector selected from a second codebook, and the second codebook index comprises an index of a basis vector in the second codebook, or comprises an index of a basis vector in the second codebook and an index of an intermediate basis vector, and the second codebook comprises a codebook comprising basis vectors, and the second codebook and the first codebook correspond to different vector spaces; the second combining coefficient is used to linearly combine based on the first basis vector set and a second codebook basis vector indicated by the second codebook index to obtain the precoding matrix.

28. The method of claim 26, wherein, The first information further comprises a second codebook index and a third combining coefficient; wherein the second codebook index is an index of a basis vector selected from a second codebook, and the second codebook index comprises an index of a basis vector in the second codebook, or comprises an index of a basis vector in the second codebook and an index of an intermediate basis vector, and the second codebook comprises a codebook comprising basis vectors, and the second codebook and the first codebook correspond to different vector spaces; the second combining coefficient is used to linearly combine based on the first basis vector set to obtain a second basis vector set; the third combining coefficient is used to linearly combine the basis vector indicated by the second codebook index and the second basis vector set to obtain the precoding matrix.

29. An apparatus for determining a precoding matrix, applied to a terminal, the apparatus comprising: a memory, a transceiver and a processor: a memory, configured to store a computer program; a transceiver, configured to transceive data under control of the processor; a processor, configured to read the computer program in the memory and perform the following operations: generating a precoding matrix by using one or more intermediate matrices, wherein values of the intermediate matrices are determined according to first information, and the first information comprises a first codebook index, a first combining coefficient and a second combining coefficient; wherein the first codebook index is an index of a basis vector selected from a first codebook, and the first codebook is a codebook comprising a plurality of basis vectors. The first combination coefficient is used for linear combination of base vectors indicated by the first codebook index to obtain a first base vector set. The second combination coefficient is used for linear combination based on the first base vector set, and a result of the linear combination is used to obtain the precoding matrix. 30.An apparatus for determining a precoding matrix, applied to a network device, the apparatus comprising: a memory, a transceiver, and a processor a memory for storing a computer program a transceiver for transceiving data under control of the processor a processor for reading the computer program in the memory and performing the following operations sending codebook parameters to a terminal, wherein the codebook parameters are used to determine values of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix receiving target information sent by the terminal determining a target precoding matrix according to the target information wherein the values of the intermediate matrices are determined according to first information, and the first information includes a first codebook index, a first combination coefficient, and a second combination coefficient wherein the first codebook index is an index of a base vector selected from a first codebook, and the first codebook is a codebook composed of multiple base vectors the first combination coefficient is used for linear combination of base vectors indicated by the first codebook index to obtain a first base vector set the second combination coefficient is used for linear combination based on the first base vector set, and a result of the linear combination is used to obtain the precoding matrix 31. A device for determining a precoding matrix, applied to a terminal, the device comprising: a first processing unit for generating a precoding matrix by using one or more intermediate matrices, wherein values of the intermediate matrices are determined according to first information, and the first information includes a first codebook index, a first combination coefficient, and a second combination coefficient wherein the first codebook index is an index of a base vector selected from a first codebook, and the first codebook is a codebook composed of multiple base vectors the first combination coefficient is used for linear combination of base vectors indicated by the first codebook index to obtain a first base vector set the second combination coefficient is used for linear combination based on the first base vector set, and a result of the linear combination is used to obtain the precoding matrix 32. An apparatus for determining a precoding matrix, characterized by applied to a network device, comprising: a first sending unit for sending codebook parameters to a terminal, wherein the codebook parameters are used to determine values of intermediate matrices, and one or more of the intermediate matrices form a precoding matrix a first receiving unit for receiving target information sent by the terminal a first processing unit for determining a target precoding matrix according to the target information wherein the values of the intermediate matrices are determined according to first information, and the first information includes a first codebook index, a first combination coefficient, and a second combination coefficient wherein the first codebook index is an index of a base vector selected from a first codebook, and the first codebook is a codebook composed of multiple base vectors the first combination coefficient is used for linear combination of base vectors indicated by the first codebook index to obtain a first base vector set the second combination coefficient is used for linear combination based on the first base vector set, and a result of the linear combination is used to obtain the precoding matrix 33. A processor-readable storage medium having stored a program for causing the processor to execute the method of any one of claims 1 to 28.

Images