WO2022206470A1

WO2022206470A1 - Data processing method and device, electronic device, and storage medium

Info

Publication number: WO2022206470A1
Application number: PCT/CN2022/082182
Authority: WO
Inventors: 夏欣; 陈卫民; 张颜; 刘安
Original assignee: 华为技术有限公司
Priority date: 2021-03-29
Filing date: 2022-03-22
Publication date: 2022-10-06
Also published as: CN115133967A

Abstract

The present application relates to the technical field of communications, and discloses a data processing method and device, an electronic equipment and a storage medium. In the method, a pre-coding matrix is subjected to primary quantization, and projection information obtained by means of the primary quantization is subjected to secondary quantization, so as to reduce the amount of data of the projection information obtained after the primary quantization, and when a receiving end sends to a transmitting end a secondary quantization result instead of the projection information obtained after the primary quantization, the signaling overhead allowing the receiving end to feed information back to the transmitting end can be reduced.

Description

Data processing method, device, electronic device and storage medium

This application claims the priority of the Chinese patent application with the application number 202110333444.7 filed on March 29, 2021 and the invention titled "Data Processing Method, Device, Electronic Device and Storage Medium", the entire contents of which are incorporated herein by reference middle.

technical field

The present application relates to the field of communication technologies, and in particular, to a data processing method, apparatus, electronic device, and storage medium.

Background technique

Large-scale input and multiple output (multiple input and multiple output, MIMO) system has become one of the core technologies of the fifth generation mobile communication system (5G) because it can greatly improve the system capacity and spectrum utilization. In a MIMO system, precoding technology is usually used for multiplexing between multiple data streams and antennas, which can make more effective use of existing channel resources, and can improve system capacity and reduce data streams by allocating power to data streams. The interference between them improves the overall performance of the system.

For example, the receiving end in a MIMO system obtains a precoding matrix through channel estimation, and uses the codebook shared by the receiving end and the transmitting end to quantize the precoding matrix, so that the precoding matrix can use the projection coefficient matrix and the multiplicity in the codebook. The receiving end sends the projection coefficient matrix and the index information used to indicate the positions of the multiple vectors in the codebook to the transmitting end, so that the transmitting end can base on the projection coefficient matrix, the index information and the shared codebook , reconstruct the precoding matrix, and use the precoding matrix to send the data stream to the receiving end.

However, when the number of antennas at the transmitting end is too large, the codebook shared by the transmitting end and the receiving end is a high-dimensional codebook, and the signaling overhead required to feed back the projection coefficient matrix of the precoding matrix on the high-dimensional codebook and the index information will also be A substantial increase. Therefore, a data processing method is urgently needed to reduce the signaling overhead required for massive MIMO channel feedback.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a data processing method, an apparatus, an electronic device, and a storage medium, which can enable the receiving end to feed back the required signaling overhead to the transmitting end. The technical solution is as follows:

In a first aspect, a data processing method is provided, the method comprising:

Perform quantization processing on the precoding matrix of the channel based on at least one first codebook to obtain first index information and first projection information; perform quantization processing on the first projection information based on the second codebook to obtain second index information and second projection information; sending the first index information, the second index information and the second projection information;

The first index information is used to indicate a vector used to represent the precoding matrix in the at least one first codebook, and the first projection information includes the precoding matrix and at least one first codebook The second index information is used to indicate a vector used to represent the first projection information in the second codebook, and the second projection information includes the first projection information and the Projection coefficients between the second codebooks.

In this method, the precoding matrix is quantized for the first time, and the projection information obtained by the initial quantization is subjected to secondary quantization to reduce the data amount of the projection information obtained after the primary quantization. When the receiving end replaces the quantization result of the secondary quantization When the projection information obtained after the initial quantization is sent to the transmitting end, the signaling overhead required for the receiving end to feed back to the transmitting end can be reduced.

In a possible implementation manner, performing quantization processing on the first projection information based on the second codebook to obtain second index information and second projection information of the first projection information includes:

Perform column vector quantization processing on the projection coefficients in the first projection information to obtain a column vector; perform quantization processing on the column vector based on the second codebook to obtain the second index information and the second index information Projection information.

In a possible implementation manner, the at least one codebook includes a spatial-domain codebook and a frequency-domain codebook, and the first index information includes first sub-index information and second sub-index information;

The performing quantization processing on the precoding matrix of the channel based on the at least one first codebook, and obtaining the first index information and the first projection information of the precoding matrix include:

Perform quantization processing on the precoding matrix based on the spatial codebook to obtain the first sub-index information and third projection information; perform quantization processing on the third projection information based on the frequency domain codebook to obtain the the second sub-index information and the first projection information;

The first sub-index information is used to indicate a vector used to represent the precoding matrix in the spatial codebook, and the third projection information includes the difference between the precoding matrix and the spatial codebook. a projection coefficient, the second sub-index information is used to indicate a vector in the frequency domain codebook used to represent the third projection information, and the first projection information includes the third projection information and the frequency domain Projection coefficients between codebooks.

In a possible implementation manner, the dimensions of the spatial-domain codebook and the frequency-domain codebook are both greater than or equal to the number of antennas at the transmitting end.

In a possible implementation manner, before the sending the first index information, the second index information and the second projection coefficient, the method further includes:

For any index information among the first sub-index information, the second sub-index information, and the second index information, obtain the difference between the any index information obtained in the current channel measurement process and the historical index information Difference information between, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between any index information and the historical index information;

Sending the any index information includes: sending the difference information.

In a possible implementation manner, the any index information includes at least one data block, and any data block is used to indicate whether adjacent multiple vectors in the codebook corresponding to the any index information are used for this time quantify;

The difference value information includes at least one of a quantization indication bit corresponding to any data block and position information, and one of the quantization indication bits is used to indicate that in the current quantization and in the historical quantization, among the multiple vectors Whether the adoption of the first vector is the same, the historical quantization is the quantization corresponding to the historical index information in the last channel measurement process, and one piece of the position information is used to indicate that the second vector in the plurality of vectors is in The position in the codebook corresponding to any index information, the first vector is any vector used in the multiple vectors during the historical quantization, and the second vector is the historical Any one of the vectors that is not used during quantization, and the second vector is used in this quantization process.

In a possible implementation manner, the difference information further includes a length indication bit, and the length indication bit is used to indicate whether the length of any data block is the same as that of a historical data block, and the historical data block is the same length as the historical data block. The data block corresponding to any of the data blocks in the historical index information.

In a possible implementation manner, if the length indication bit is used to indicate that the length of any data block is different from that of the historical data block, the difference information further includes the length of any data block .

In a possible implementation, the method further includes:

For any one of the first projection information, the second projection information, and the third projection information, based on the any projection information, a codebook corresponding to the any projection information is trained.

In a second aspect, a data processing method is provided, the method comprising:

receiving first index information, second index information, and second projection information, where the first index information is used to indicate a vector representing a precoding matrix of a channel in the at least one first codebook, and the second index The information is used to indicate a vector used to represent the first projection information in the second codebook, and the second projection information includes a projection coefficient between the first projection information and the second codebook;

determining the first projection information based on the second index information, the second projection information, and the second codebook;

The precoding matrix is determined based on the first index information, the first projection information, and the at least one first codebook.

In a possible implementation manner, the at least one codebook includes a spatial-domain codebook and a frequency-domain codebook, the first index information includes first sub-index information and second sub-index information, and the first sub-index information The information is used to indicate the vector used to represent the precoding matrix in the spatial codebook, the second sub-index information is used to indicate the vector used to represent the third projection information in the frequency domain codebook, the The first projection information includes projection coefficients between the third projection information and the frequency-domain codebook, and the third projection information includes projection coefficients between the precoding matrix and the spatial-domain codebook.

In a possible implementation manner, the determining the precoding matrix based on the first index information, the first projection information and the at least one first codebook includes:

determining the third projection information based on the first projection information, the second sub-index information and the frequency domain codebook;

The precoding matrix is determined based on the third projection information, the first sub-index information, and the spatial codebook.

In a possible implementation manner, for any index information among the first sub-index information, the second sub-index information, and the second index information, receiving the any index information includes:

Receive the difference information between the any index information and the historical index information, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate that the any index information is different from the index information. Differences between the historical index information;

The method also includes:

The any index information is determined based on the difference value information and the historical index information.

In a possible implementation, the method further includes:

In a third aspect, a data processing apparatus is provided for executing the above data processing method. Specifically, the data processing apparatus includes a functional module for executing the data processing method provided in the first aspect or in any optional manner of the first aspect.

In a fourth aspect, a data processing apparatus is provided for executing the above data processing method. Specifically, the data processing apparatus includes a functional module for executing the data processing method provided in the above second aspect or any optional manner of the above second aspect.

In a fifth aspect, an electronic device is provided, the electronic device includes a processor and a memory, the memory stores at least one piece of program code, the program code is loaded and executed by the processor to implement the operations performed by the above-mentioned data processing method .

In a sixth aspect, a computer-readable storage medium is provided, and at least one piece of program code is stored in the storage medium, and the program code is loaded and executed by a processor to implement the operations performed by the above data processing method.

In a seventh aspect, a computer program product or computer program is provided, the computer program product or computer program includes program code, the program code is stored in a computer-readable storage medium, and the processor of the electronic device reads from the computer-readable storage medium The program code is taken, and the processor executes the program code, so that the computer device executes the data processing methods provided in the various optional implementation manners described above.

Description of drawings

1 is a schematic diagram of a data processing system provided by an embodiment of the present application;

2 is a schematic structural diagram of an electronic device provided by an embodiment of the present application;

3 is a flowchart of a data processing method provided by an embodiment of the present application;

4 is a flowchart of a data processing method provided by an embodiment of the present application;

5 is a schematic diagram of index information compression provided by an embodiment of the present application;

6 is a schematic flowchart of a data processing provided by an embodiment of the present application;

7 is a system performance comparison diagram under various feedback modes under a SU-CDL-B channel model provided by an embodiment of the present application;

8 is a system performance comparison diagram under various feedback modes under a SU-CDL-D channel model provided by an embodiment of the present application;

9 is a system performance comparison diagram under various feedback modes under a MU-CDL-B channel model provided by an embodiment of the present application;

10 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application;

FIG. 11 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application.

Detailed ways

In order to make the objectives, technical solutions and advantages of the present application clearer, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings.

FIG. 1 is a schematic diagram of a data processing system provided by an embodiment of the present application. Referring to FIG. 1 , the system 100 includes at least one transmitting end 101 and at least one receiving end 102 . Optionally, the transmitting end 101 is a base station, such as an evolved node B (eNB) in FIG. 1 , and the receiving end 102 is a terminal, which is a portable mobile terminal, such as a smart phone, a tablet computer, a moving image expert compression standard audio layer 3 (moving picture experts group audio layer III, MP3) players, moving picture experts compression standard audio layer 4 (moving picture experts group audio layer IV, MP4) players, laptops or desktop computers. The terminal may also be called user equipment, portable terminal, laptop terminal, desktop terminal, etc. by other names. In another possible implementation manner, the transmitting end 101 is a terminal, and the receiving end 102 is a base station.

Optionally, the system 100 is a frequency division duplexing (FDD) system 100 or a time division duplex (time division duplex, TDD) system 100. For single-user (SU)-MIMO or multi-user (MU-) MIMO transmission, in enhanced mobile broadband (enhanced mobile broadband, eMBB) or wireless broadband to the home (wireless to the x, WTTX ) In the backhaul scenario, especially in the FDD system 100, feedback information from the receiving end 102 is required so that the transmitting end 101 can allocate an appropriate precoding matrix, modulation and coding scheme level for the subsequent transmission of the receiving end 102 based on the feedback information .

In a possible implementation manner, the transmitting end 101 sends a measurement signal (for example, a packet including pilot symbols) for channel estimation to the receiving end 102, and the receiving end 102, based on the received measurement signal, Perform channel estimation on the channel between the terminal 101 and the receiving terminal 102 to obtain a channel matrix of the channel; the terminal performs singular value decomposition on the channel matrix to obtain the precoding matrix used by the transmitting terminal and the receiving terminal 102 . After that, the receiving end 102 performs initial quantization processing on the precoding matrix based on the at least one first codebook, and subsequently the receiving end 102 performs secondary quantization processing on the quantization result of the initial quantization based on the second codebook, and quantizes the initial quantization processing. The obtained index information, the quantization result of the secondary quantization, and the index information obtained during the secondary quantization processing are sent to the transmitting end 101, so that the transmitting end 101 can perform the secondary quantization processing based on the quantization result of the secondary quantization and the receiving end 102. The obtained index information restores the initial quantization processing result, and restores the precoding matrix based on the initial quantization result and the index information obtained when the receiving end 102 quantizes for the first time, so that the transmitting end 101, based on the restored precoding matrix, can The data sent by the receiving end 102 is encoded, and the encoded data is sent to the receiving end 102 . The steps performed by the transmitting end 101 and the receiving end 102 will be described in detail in the following in conjunction with the method embodiments.

In another possible implementation manner, the base station is the receiving end 102 and the terminal is the transmitting end 101. In this case, the base station needs to feed back the quantization result to the terminal, and the terminal restores the precoding matrix based on the quantization result fed back by the base station, so as to be based on The precoding matrix sends the encoded data to the base station.

In order to further reflect the hardware structure of the transmitter and the terminal, refer to FIG. 2 , which is a schematic structural diagram of an electronic device provided by an embodiment of the present application. The electronic device 200 may have relatively large differences due to different configurations or performances, including One or more processors 201 and one or more memories 202, wherein the processors include central processing units (CPUs). The memory 202 stores at least one program code, and the at least one program The code is loaded and executed by the processor 201 to implement the data processing methods provided by the following various method embodiments. In a possible implementation manner, when the electronic device is configured as a transmitter, the at least one piece of program code is loaded and executed by the processor 201 to implement the steps performed by the transmitter in the implementation of the following methods; When the electronic device is configured as a receiver, the at least one piece of program code is loaded and executed by the processor 201 to implement the steps performed by the receiver in the implementation of the following methods. Of course, the electronic device 200 may also have components such as a wired or wireless network interface, a keyboard, and an input/output interface for input and output, and the electronic device 200 may also include other components for implementing device functions, which will not be repeated here.

In an exemplary embodiment, a computer-readable storage medium, such as a memory including program codes, is also provided, and the program codes can be executed by a processor in the terminal to complete the data processing methods in the following embodiments. For example, the computer-readable storage medium is a non-transitory computer-readable storage medium, such as read-only memory (ROM), random access memory (RAM), compact disc read-only memory, CD-ROM), magnetic tapes, floppy disks, and optical data storage devices, etc.

For further embodiment, the receiving end feeds back the quantization result of the precoding matrix to the transmitting end, and the transmitting end recovers the precoding matrix based on the quantization result fed back by the receiving end. Refer to a data provided by an embodiment of the present application as shown in FIG. 3 . Flowchart of the processing method.

301. The receiving end acquires a precoding matrix, where the precoding matrix is used to indicate the channel quality of the channel between the receiving end and the transmitting end.

The receiver is any receiver that communicates with the transmitter. For the convenience of description, the precoding matrix is denoted as W, where the precoding matrix W includes N _t ×N ₃ elements, which can be expressed as

Among them, N _t is the number of antennas in the transmitting end, N ₃ is the number of sub-bandwidths in the full bandwidth range, and each element in N _t ×N ₃ is used to indicate that one antenna in the transmitting end is in a sub-bandwidth Weighting factor for the data above.

In a possible implementation manner, the receiver receives the measurement signal sent by the antenna of the transmitter, and based on the measurement signal, performs channel measurement on the channel between the receiver and the transmitter to obtain a channel matrix of the channel , the receiver performs singular value decomposition on the channel matrix to obtain the precoding matrix W.

It should be noted that, the receiving end may acquire the precoding matrix W in various manners. Here, the embodiment of the present application does not limit the manner of acquiring the precoding matrix W, as long as the receiving end can acquire it.

302. The receiving end performs quantization processing on the precoding matrix of the channel based on the at least one first codebook to obtain first index information and first projection information, where the first index information is used to indicate the at least one first codebook used in the channel. In the vector representing the precoding matrix, the first projection information includes projection coefficients between the precoding matrix and at least one first codebook.

Wherein, any codebook in the at least one codebook includes a plurality of vectors, and each vector includes a plurality of elements. It can also be understood that the any codebook includes a plurality of elements of multiple rows and columns, and each column includes a plurality of elements. The elements of is a vector. The number of vectors in any codebook or the dimension of any codebook is greater than or equal to the number of antennas at the transmitting end, so that the codebook used in this embodiment of the present application is a codebook with a high vector density (that is, an encryption code). In the process of quantization, multiple vectors can be selected from the codebook with large vector density to linearly represent the precoding matrix, thereby improving the quantization accuracy of the precoding matrix and reducing the quantization error. For example, the number of antennas at the transmitting end is N _t , and the number of vectors in any codebook is 2N _t , 3N _t , etc. The embodiments of the present application do not limit the number of vectors in any codebook.

Optionally, the at least one codebook includes a spatial codebook and a frequency domain codebook, wherein the spatial codebook is a codebook used when the precoding matrix is quantized in the spatial dimension, and the frequency domain codebook is a codebook in the frequency domain. The codebook used to quantize the precoding matrix in dimension. In a possible implementation manner, the vector in the spatial-domain codebook is called a spatial-domain vector, and the vector in the frequency-domain codebook is called a frequency-domain vector.

The first index information includes a plurality of index indication bits, each index indication bit corresponds to a vector in at least one codebook, and each index indication bit is used to indicate whether the corresponding vector is used to represent the precoding matrix. If an index indicating bit takes the value of the first parameter, the vector corresponding to the index indicating bit is used to represent the precoding matrix. If the index indicating bit takes the value of the second parameter, the vector corresponding to the index indicating bit is not used. to represent the precoding matrix. The first parameter value and the second parameter value are two different parameter values, which can be different numerical values (eg, the first parameter value is 1, and the second parameter value is 0), or different characters (eg, the first parameter value is 0). is k, and the second parameter value is L), or one parameter value is a numerical value and the other parameter value is a character. Here, the value of the index indication bit is not limited in this embodiment of the present application. Optionally, the first index information includes first sub-index information and second sub-index information, the first sub-index information corresponds to a spatial domain codebook, and the second sub-index information corresponds to a frequency domain codebook.

The first projection information includes at least one projection coefficient, and each projection coefficient corresponds to a vector used to represent the precoding matrix in the at least one codebook. Optionally, the first projection information includes first sub-projection information and second sub-projection information, the first sub-projection information corresponds to a spatial-domain codebook, and the second sub-projection information corresponds to a frequency-domain codebook.

In a possible implementation manner, the receiving end first quantizes the precoding matrix by using a spatial codebook, and then uses a frequency domain codebook to quantize the quantization result in the spatial domain, so as to achieve both spatial and frequency domain quantization results. The purpose of quantizing the precoding matrix in each dimension. Optionally, the process shown in this step 302 is implemented by the processes shown in the following steps 3021-3022.

Step 3021: The receiving end performs quantization processing on the precoding matrix based on the spatial codebook to obtain first sub-index information and third projection information of the precoding matrix, where the first sub-index information is used to indicate the spatial codebook A vector used to represent the precoding matrix in , and the third projection information includes projection coefficients between the coding matrix and the spatial codebook.

The first sub-index information includes a plurality of index indication bits, each index indication bit corresponds to a vector in the spatial codebook, and each index indication bit is used to indicate whether the corresponding vector in the spatial codebook is used to represent the precoding matrix. For example, the first index indication bit in the first sub-index information corresponds to the first vector in the spatial codebook. If the first vector is used to represent the precoding matrix, the first index indication bit The value of is the first parameter value, otherwise, the value is the second parameter value.

Optionally, the first sub-index information is represented by a first index vector, the first index vector includes a plurality of elements, each element corresponds to a value of an index indicating bit, and the plurality of elements are arranged in a column or a row. , in the embodiment of the present application, the elements in the first sub-index information are arranged in one column for illustration.

The third projection information is also the output of the precoding matrix after spatial compression, and each projection coefficient in the third projection information corresponds to a vector selected on the spatial codebook. After the quantization in step 3021, the precoding matrix is linearly represented by the projection coefficients in the third projection information and the vector selected from the spatial codebook.

In a possible implementation manner, this step 3021 is implemented by the following steps S11-S12.

Step S11, the receiving end determines the optimal spatial sparse representation of the precoding matrix based on the spatial codebook.

The optimal spatial sparse representation of the precoding matrix is given by the following formula (1):

Among them, S is the spatial codebook,

M is the number of vectors in the spatial codebook S; Z is the spatial projection matrix, which is used to represent the third projection information,

Z _i is the ith vector in the spatial domain projection matrix Z, 1≤i≤N ₃ ; s _sup is the maximum number of vectors used to represent the precoding matrix in the spatial domain codebook,

is the projection precision of the precoding matrix on the spatial codebook.

The formula (1) can be understood as, under the restriction of s _sup , it is satisfied that the projection accuracy of the precoding matrix on the spatial codebook is the smallest, and at this time s _sup ≤M.

Step S12, the receiving end determines the first sub-index information and the third projection information based on the optimal spatial sparse representation of the precoding matrix.

In a possible implementation manner, the receiving end solves the above (1) based on the enhancement (E)-orthogonal matching pursuit (OMP) algorithm, so as to obtain the limit of s _sup that can A target spatial projection matrix Z _c that minimizes the projection accuracy of the precoding matrix on the spatial codebook.

In a possible implementation manner, the receiving end is based on the E-OMP algorithm, and the process of solving the above (1) includes: the receiving end uses the precoding matrix W, the spatial codebook S, and the spatial codebook S with The maximum number of vectors s _sup representing the precoding matrix is input data, and the first sub-index vector is initialized so that the bit value indicated by each index included in the first sub-index sub-vector is the second parameter value , to indicate that a vector has not been selected from the spatial codebook S to represent the precoding matrix at this time; the receiving end performs s _sup iterations based on the input data.

In each iterative operation process, the receiver selects a vector from the current spatial codebook S to represent the precoding matrix W based on the unrepresented part of the precoding matrix W in the previous iterative process, and the value of the index indicating bit corresponding to the vector in the first index sub-vector is updated to the first parameter value to indicate that the vector is selected to represent the precoding matrix. The receiver transfers the vector selected from the current spatial codebook S to the first matrix S _temp , where the first matrix S _temp is used to store the precoding matrix W selected from the spatial codebook and used to represent the precoding matrix W At this time, the spatial codebook S does not include the vector selected from the spatial codebook S in the current iteration process and the historical iteration process. The receiving end determines the projection coefficient corresponding to the vector selected this time based on each vector in the first matrix S _temp and the precoding matrix W, and adds the projection coefficient to the spatial projection matrix Z _c . The receiving end determines the product between the current first matrix S _temp and the current spatial projection matrix Z as the part that the precoding matrix W can currently represent; the receiving end determines the precoding matrix W and the precoding matrix The difference between the parts that can currently be represented by W determines the part that has not yet been represented in the precoding matrix W in this iteration process. If the total number of current iterative operations is less than s _sup , the receiving end performs the next iterative process based on the unrepresented part of the precoding matrix W during the current iteration process, if the total number of current iterative operations is equal to s _sup , then the iteration is ended; after s _sup times of iterative operation process, s _sup index indication bits in the first sub-index vector are updated to the first parameter value to indicate that s _sup vectors in the airspace codebook are selected to represent the pre- Coding matrix W, the first matrix S _temp includes s _sup vectors, and these s _sup vectors are used to represent the precoding matrix W. At this time, the spatial projection matrix Z includes the projection coefficients corresponding to the ssup vectors. The spatial projection matrix Z is also the target spatial projection matrix Z _c (ie the third projection information), at this time W=S _temp ×Z _c +R _s , where R _s is the precoding matrix W after the s _sup iteration operation process The part that has not yet been represented, that is, the quantized precoding matrix

The error matrix between it and the precoding matrix W is denoted as the spatial error matrix R _s .

It should be noted that in the process of the first iterative operation, since the iterative operation has not been performed before, the unrepresented part of the precoding matrix W in the last iterative process is the precoding matrix W itself. The spatial codebook of is also the input spatial codebook S.

In a possible implementation manner, the receiving end selects a vector from the spatial codebook S to represent the precoding matrix W based on the precoding matrix W, including: the receiving end determining the transposition of the spatial codebook S The inner product P between the matrix and the precoding matrix W, each row element in the inner product P corresponds to a vector in the spatial codebook S; the receiving end determines the modulo sum of each row element in the inner product P, The vector corresponding to the element with the largest sum value in the spatial codebook S is selected to represent the precoding matrix.

In order to further illustrate the process of solving the above (1) by the receiving end based on the E-OMP algorithm, please refer to the E-OMP algorithm shown in the following pseudo code 1.

Pseudocode 1:

Among them, the ompiter in the above pseudo code 1 is the number of iterations s _sup , and the final output target spatial projection matrix of the above pseudo code 1

At this time ompiter=s _sup . The first index matrix a _s is used to represent the first sub-index information, and each index in the first index matrix a _s indicates the second parameter value of the bit during initialization.

Step 3022, the receiving end performs quantization processing on the third projection information based on the frequency domain codebook to obtain the second sub-index information and the first projection information, where the second sub-index information is used to indicate the frequency domain codebook A vector used to represent the third projection information in , where the first projection information includes projection coefficients between the third projection information and the frequency domain codebook.

The second sub-index information includes a plurality of index indication bits, each index indication bit corresponds to a vector in the frequency domain codebook, and each index indication bit is used to indicate whether the corresponding vector in the frequency domain codebook is used to represent the third projection information. For example, the first index indication bit in the second sub-index information corresponds to the first vector in the frequency domain codebook. If the first vector is selected to represent the third projection information, the first index The value of the indication bit is the value of the first parameter, otherwise, the value of the second parameter is the value. The first projection information includes at least one projection coefficient, and each projection coefficient corresponds to a vector used to represent the third projection information in the frequency domain codebook.

In a possible implementation manner, this step 3022 is implemented by the following steps S21-S22.

Step S21, the receiving end determines the optimal frequency domain sparse representation of the third projection information based on the frequency domain codebook.

Wherein, the optimal frequency domain sparse representation of the third projection information is shown in the following formula (2):

Among them, F is the frequency domain codebook

N is the number of vectors in the frequency domain codebook F; X is the frequency domain projection matrix, X is used to represent the first projection information

X _j is the j-th vector in the frequency domain projection matrix X, 1≤j≤s _sup ; f _sup is the maximum number of vectors used to represent the space domain projection matrix Z in the frequency domain codebook F;

is the projection accuracy of the target spatial domain projection matrix Z _c on the frequency domain codebook F.

The formula (2) can be understood as, under the restriction of f _sup , the projection accuracy of the spatial domain projection matrix Z on the frequency domain codebook F is the smallest.

Step S22, the receiving end determines the second sub-index information and the first projection information based on the optimal frequency domain sparse representation of the third projection information.

In a possible implementation manner, the step S22 is implemented by the following steps S221-S222.

Step S221, the receiving end uses each vector in the frequency domain codebook to quantize the third projection information to obtain initial frequency domain projection information.

The optimal frequency domain sparse representation shown in formula (2) is a non-convex optimization problem. The L _2,1 norm of the matrix is used to approximate the non-convex 0 norm restriction. The receiver converts the above (2) approximately into the following Formula (3):

in,

is the L _2,1 norm of the frequency domain projection matrix X, which is used to represent the sum of the L ₂ norm of each column vector in the frequency domain projection matrix X to describe the column sparsity of the frequency domain projection matrix X; λ is used for A parameter that trades off projection representation accuracy and column sparsity. Optionally, the value of λ ranges from 10 ^-4 to 10 ^-3 .

In a possible implementation manner, the receiving end adopts a fixed-point algorithm (FPA) to convert the above (3) into the following formula (4):

in,

"*" means taking the conjugate transpose operation, I means the unit frame (ie, the unit matrix),

vec( ) represents the column vectorization of the matrix (that is, arranges all the columns in the matrix into one column), N is the number of vectors in the frequency domain projection matrix X, and l _k (h) is the frequency domain projection matrix X The L ₂ norm of the k-th column vector in , 1≤k≤N.

The receiving end performs an iterative operation on the above (4) based on the following (5) to obtain the second column vector h.

h ^t+1 =C(h ^t )E ^H (EC(h ^t )E ^H +λI) ^-1 u

In the above formula (5), t is the number of iterations, ht is the second column vector h obtained by the t-th iteration operation, and h ^t+1 is the second column vector h obtained by the t+1-th iteration operation.

In a possible implementation manner, the receiving end uses the target spatial domain projection matrix Z _c , the frequency domain codebook F and the parameter λ as input data, the preset target value is the total number of iterations, and the error threshold is preset. Initially, the receiving end selects each vector in the frequency domain codebook F to represent the target spatial domain projection matrix Z _c , and obtains the least squares solution of Z _c -XF=0, and obtains the reference frequency domain projection matrix. X ⁰ ; the receiving end performs column quantization on the conjugate matrix of the target spatial projection matrix Z _c to obtain a third vector u, and performs column quantization on the conjugate matrix of X ⁰ to obtain a reference second vector h ⁰ . The receiving end performs an iterative operation based on the input data, the third vector u, and the reference frequency domain projection matrix X ⁰ to refer to the second vector h ⁰ .

During the t-th iteration, the receiver obtains the L ₂ norm of each vector in the frequency-domain projection matrix X ^t-1 : l ₁ (h ^t-1 )～l _N (h ^t-1 ), where , the frequency domain projection matrix X ^t-1 is the frequency domain projection matrix obtained by the t-1th iterative operation; the receiving end is based on l ₁ (h ^t-1 )～l _N (h ^t-1 ) and the unit frame I, Determine the intermediate matrix C; the receiving end inputs the determined intermediate matrix C and the input data into the above formula (5), and outputs h ^t ; the receiving end converts h ^t into a frequency-domain projection matrix X ^t , where X ^t is The frequency domain projection matrix obtained by the t-th iteration operation; the receiver obtains whether the error between h ^t and h ^t-1 is less than the error threshold, if it is less than the error threshold, it means that h ^t is the final convergence in the t-th iteration operation process , the receiver terminates the iteration, and uses the frequency-domain projection matrix X ^t as the initial frequency-domain projection matrix X _I . If it is not less than t, it means that the operation process has not converged after t iterations. If t is still smaller than the preset If t is greater than or equal to the target value, the receiving end uses the frequency domain projection matrix X ^t as the initial frequency domain projection matrix X _I (initial frequency domain projection information) , and terminate the iteration, when the iterative operation is terminated, Z _c = _X IF at this time.

It should be noted that when t=1, since the iterative operation has not been performed yet, the reference frequency domain projection matrix X ⁰ is the frequency domain projection matrix X ^t-1 obtained in the 0th iteration process, and the reference second vector h ⁰ is the second vector obtained during the 0th iteration.

In order to further illustrate the process of acquiring the initial frequency domain projection matrix X _I based on the FPA, please refer to the FPA algorithm shown in the following pseudo code 2.

Pseudocode 2:

When the receiving end outputs the conjugate transpose matrix X ^* of the target frequency domain projection matrix based on the FPA process shown in the above pseudo code 2, the receiving end converts the conjugate transpose matrix X ^* of the target frequency domain projection matrix into the target Frequency domain projection matrix X _c .

Step S222, the receiving end obtains the second sub-index information and the first projection information based on the initial frequency domain projection information.

In a possible implementation manner, the receiving end performs conjugate transpose processing on the initial frequency domain projection matrix X _I to obtain the initial transformation matrix X _F ,

The receiving end performs modulo sum calculation on each vector in the initial transformation matrix _XF , and obtains N values, each of which is the modulo sum of elements in a vector in the initial transformation matrix _XF . The receiving end selects the largest a data among the N data, and determines the a vector corresponding to the a data in the frequency domain codebook F as the vector used to represent the third projection information, one of the a data The data corresponds to a vector in the frequency domain codebook F. The receiving end forms the a vector into a second matrix F _stemp . The receiving end forms the target frequency domain projection matrix X _c (that is, the first projection information) with the projection coefficients corresponding to the a data in the initial frequency domain projection matrix X _I ,

The target frequency domain projection matrix X _c is also the frequency domain projection matrix that makes the target spatial domain projection matrix Z _c on the frequency domain codebook F with the smallest projection accuracy under the restriction of f _sup . At this time, Z _c = _F _temp ×X _c +RF , where _RF is the part that has not been represented by the target spatial projection matrix Z _c , that is, the quantized target spatial projection matrix

The error matrix between it and the target spatial domain projection matrix Z _c is denoted as the frequency domain error matrix R _F .

The receiving end obtains second sub-index information based on the vector corresponding to the data a in the frequency-domain codebook F, where the second sub-index information includes a plurality of index indicating bits, each index indicating bit corresponding to the frequency-domain codebook F and the index indication bits corresponding to the vectors corresponding to the a pieces of data are the first parameter values, and the values of the remaining index indication bits in the second sub-index information are all the second parameter values.

303. The receiving end performs quantization processing on the first projection information based on the second codebook to obtain second index information and second projection information, where the second index information is used to indicate that the second codebook is used to represent the first projection information. A vector of projection information, wherein the second projection information includes projection coefficients between the first projection information and the second codebook.

Wherein, the second codebook is a known dictionary D, and the second codebook includes a plurality of vectors. The second index information includes a plurality of index indication bits, each index indication bit corresponds to a vector in the second codebook, and each index indication bit is used to indicate whether the corresponding vector in the second codebook is used to represent the First projection information. There is at least one projection coefficient between the first projection information and the second codebook, and each projection coefficient corresponds to a vector used to represent the first projection information in the second codebook.

In a possible implementation manner, this step 303 is implemented by the processes shown in steps 3031-3032.

Step 3031: The receiving end performs column vectorization processing on the projection coefficients in the first projection information to obtain a first column vector.

The receiving end arranges the projection coefficients in the first projection information into a column to form the first column vector.

Step 3032: The receiving end performs quantization processing on the first column vector based on the second codebook to obtain the second index information and the second projection information.

The receiving end selects q vectors from the second codebook to represent the first column vector, the receiving end composes the q vectors into a third matrix D _stemp , and combines the third matrix D _stemp and the first column vector A column vector outputs the following formula (6):

v _x =[d ₁ ,...,d _q ]·B

The receiving end outputs a target projection matrix B, where the target projection matrix B is used to represent the second projection information, [d ₁ , . . . , d _q ] is the third matrix D _stemp , d ₁ and d _q are the receiving The first vector and the qth vector among the q vectors selected by the terminal from the second codebook, where q is an integer greater than 0; _vx is the first column vector.

304. Send the first index information, the second index information, and the second projection information to the transmitting end.

305. The transmitting end receives the first index information, the second index information, and the second projection information.

306. The transmitter determines the first projection information based on the second index information, the second projection information, and the second codebook.

Both the second codebook and the at least one first codebook are codebooks shared by the transmitting end and the receiving end. The transmitting end obtains a q vector representing the first projection information from the second codebook based on the indication of the second index information, and forms a third matrix D _stemp from the q vector. In a possible implementation manner, the transmitting end sequentially determines q index bits in the second index information whose values are the first parameter values, and then sets the q values in the second codebook as the first index bits. The index of the parameter value indicates the vector corresponding to the bit, forming the third matrix D _stemp .

After acquiring the third matrix D _stemp , the transmitting end inputs the third matrix D _stemp and the target projection matrix B used to represent the second projection coefficient into the above formula (6) as input data, and outputs the first column vector v _x , which the transmitter converts into the target frequency-domain projection matrix X _c (ie, the first projection information) based on the first column vector v _x .

307. The transmitter determines the precoding matrix based on the first index information, the first projection information, and the at least one first codebook.

In a possible implementation manner, the process shown in this step 307 is implemented by the processes shown in the following steps 3071-3072.

Step 3071: The transmitting end determines third projection information based on the first projection information, the frequency domain codebook, and the second sub-index information included in the first index information.

Optionally, the transmitting end sequentially determines a plurality of index indication bits whose values are the first parameter value in the second sub-index information, and then corresponds to the plurality of index indication bits in the frequency domain codebook _XF . vector to form a second matrix F _stemp , and the transmitting end uses the product between the second matrix F _stemp and the target frequency domain projection matrix X _c used to represent the first projection coefficient as the quantized target spatial domain projection matrix

and the quantized target airspace projection matrix

As the target spatial projection matrix Z _c used by the receiving end, that is, the third projection information.

In another possible implementation manner, the transmitting end obtains the frequency domain error matrix _RF from the receiving end, and the transmitting end combines the obtained frequency domain error matrix _RF with the quantized target spatial domain projection matrix

The sum is determined as the target spatial projection matrix Z _c used by the receiver.

Step 3072: The transmitter determines the precoding matrix based on the third projection information, the first sub-index information and the spatial codebook.

Optionally, the transmitting end sequentially determines a plurality of index indication bits in the first sub-index information that are valued as the first parameter value, and then the vectors corresponding to the plurality of index indication bits in the spatial codebook are composed of The first matrix S _stemp , the transmitter determines the product between the first matrix S _stemp and the obtained target spatial projection matrix Z _c as the quantized precoding matrix

and the quantized precoding matrix

As the precoding matrix W used by the receiver.

In another possible implementation manner, the transmitter acquires the spatial error matrix R _S from the receiver, and the transmitter combines the acquired spatial error matrix R _S with the quantized precoding matrix

The sum is determined as the precoding matrix W used by the receiver.

In the method provided by the embodiments of the present application, the precoding matrix is quantized for the first time, and the projection information obtained by the initial quantization is subjected to secondary quantization, so as to reduce the data amount of the projection information obtained after the initial quantization. When the quantization result of the secondary quantization is sent to the transmitting end in place of the projection information obtained after the initial quantization, the signaling overhead required for the receiving end to feed back to the transmitting end can be reduced.

In a possible implementation manner, after acquiring the first index information or the second index information, the receiving end can further compress the first index information or the second index information, and send the compressed index to the transmitting end information. To further illustrate the process, refer to the flowchart of a data processing method provided by an embodiment of the present application shown in FIG. 4 .

401. The receiving end obtains a precoding matrix.

This step 401 is the same as the process shown in the above-mentioned step 301, and this step 401 is not described repeatedly in this embodiment of the present application.

402. The receiving end performs quantization processing on the precoding matrix of the channel based on at least one first codebook to obtain first index information and first projection information.

This step 402 is the same as the process shown in the above-mentioned step 302, and this step 402 is not described repeatedly in this embodiment of the present application.

403. The receiving end performs quantization processing on the first projection information based on the second codebook to obtain second index information and second projection information.

This step 403 is the same as the process shown in the above-mentioned step 303, and this step 403 is not described repeatedly in this embodiment of the present application.

404. For the second index information, the first sub-index information included in the first index information, and any index information in the second sub-index information, the receiver obtains the channel measurement process obtained this time. Difference information between any index information and historical index information, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between the any index information and the historical index information difference part.

The method process shown in FIG. 4 is also the current channel measurement process. The arbitrary index information is of the same type as the historical index information. If the arbitrary index information is the first sub-index information, the historical index information is the first sub-index information obtained in the last channel measurement process. If the index information is the second sub-index information, the historical index information is the second sub-index information obtained in the last channel measurement process. If any of the index information is the second index information, the historical index information is the last index information. The second index information obtained in the channel measurement process.

The any index information includes at least one data block (block), and any data block in the at least one data block is used to indicate whether the adjacent multiple vectors in the codebook corresponding to the any index information are used for this quantization . If any index information is the first sub-index information, the codebook corresponding to the any index information is a spatial codebook; if the any index information is the second sub-index information, the codebook corresponding to the any index information The codebook is a frequency domain codebook. If any index information is the second index information, the codebook corresponding to the any index information is the second codebook.

For a piece of index information (such as first sub-index information, second sub-index information or second index information) obtained by the receiving end in the first channel measurement process, the receiving end determines a plurality of data in the index information block, each data block includes a plurality of adjacent index indicating bits, and at least one index indicating bit in each data block takes the value of the first parameter value, and the index indicating bits between the multiple data blocks in the index information The value is the second parameter value. It can be understood that each data block is an area with relatively high distribution density of the first parameter value in the index information. In a possible implementation manner, at least one index indication bit in each data block is the second parameter value. Optionally, a plurality of index indication bits that take the value of the first parameter in each data block are adjacent, for example, each index indication bit in a data block is the value of the first parameter, then the value in the data block is the value of the first parameter. The plurality of indices of the first parameter value indicates that the bits are adjacent. In another possible implementation manner, at least one index in each data block that takes the value of the first parameter indicates that the bits are not adjacent, for example, there is at least one index that takes the value of the second parameter in one data block indicator bits, and at least one index indicator bit appears between multiple index indicator bits that take values of the first parameter value, then the plurality of index indicator bits of the first parameter value in the data block are not adjacent. For example, in the historical index information shown in FIG. 5 , the index indicating bits that take the value of the first parameter value and the index indicating bits that take the value of the second parameter value in each data block are mixed together. A plurality of index indication bits whose value is the first parameter value are not necessarily adjacent, wherein FIG. 5 is a schematic diagram of index information compression provided by an embodiment of the present application.

In the first channel measurement process, after the receiving end determines a plurality of data blocks in the index information, for any data block in the plurality of data blocks, the receiving end determines the middle of any data block. The index indicating bit, the block identifier of any data block, and the type identifier of the index information are stored in association with each other. Wherein, the middle index indication bit is the middle index indication bit in any data block. The block identifier of the any data block, the block identifier is used to indicate the any data block, for example, the block identifier of the first data block in the index information is 1, and the block identifier of the second data block is 2. The type identifier of the index information is used to indicate the type of the index information. If the codebook corresponding to the index information is a spatial codebook, the type of the index information is the first type, and if the codebook corresponding to the index information is a frequency domain codebook, the type of the index information is the second type, and if the codebook corresponding to the index information is the second codebook, the type corresponding to the index information is the third type. In a possible implementation manner, for any data block in multiple data blocks in any index information obtained by this channel measurement, the difference information between the any index information and the historical index information includes any The block identifier of the data block.

In a possible implementation manner, the difference information further includes a length indication bit of the any data block, and the length indication bit is used to indicate whether the length of the any data block is the same as the length of the historical data block, and the historical data A block is a data block corresponding to any data block in the historical index information. Wherein, the middle index indication bit of any data block is the same as the middle index indication bit of the historical data block. For example, if the value of the length indicator bit is the third parameter value, it means that the length of any data block is the same as the length of the historical data block, indicating that the historical data block has become any data block at this time, but the length of the data block is the same as that of the historical data block. There is no change in length. If the value of the length indication bit is the fourth parameter value, it means that the length of any data block is not the same as the length of the historical data block, indicating that the historical data block has become any data block, but the length of the data block If changes have occurred, the embodiments of the present application do not limit the representation of the third parameter value and the fourth parameter value. For example, the third parameter value is 1 and the fourth parameter value is 0.

In a possible implementation manner, the receiving end determining the length indication bit of the any data block in the difference information includes: the receiving end determining the historical data block corresponding to the any data block in the historical index information, Wherein, the block identifier of the historical data block is the same as the block identifier of any data block; the receiving end compares the any data block with the historical data block, and determines the length of the any data block and the historical data block Whether it is consistent; if the length of any data block is the same as that of the historical data block, the length indicator bit of the any data block in the difference information takes the value of the third parameter; If the lengths of the data blocks are not the same, the length indication bit of any data block in the difference information takes the value of the fourth parameter value.

In a possible implementation manner, the receiving end compares the any data block with the historical data block, and determining whether the lengths of the any data block and the historical data block are the same includes: the receiving end determining any data block The maximum index indication bit and the minimum index indication bit of the block, and the maximum index indication bit and the minimum index indication bit of the historical data block are determined, wherein, for any data block and a data block in the historical data block, the data block The maximum index indication bit is the last indication bit of the first parameter value in the data block, and the minimum index indication bit of the data block is the first indication bit of the first parameter value in the data block; If the maximum index indication bit of any data block and the maximum index indication bit of the historical data block are not the same index indication bit, and/or, the minimum index indication bit of any data block and the minimum index indication bit of the historical data block If the bit is not the same index indicating bit, the length of any data block and the historical data block are different; if the maximum index indicating bit of any data block and the largest index indicating bit of the historical data block are the same index indicating bit , and the minimum index indication bit of any data block and the minimum index indication bit of the historical data block are the same index indication bit, then the length of any data block and the historical data block are the same.

In a possible implementation manner, if the length indication bit of the any data block in the difference information is used to indicate that the length of the any data block is different from that of the historical data block, the difference information also includes the length of the any data block. The length of a data block. In a possible implementation manner, if the length indication bit of any data block in the difference information is used to indicate that the length of any data block is the same as the length of the historical data block, the difference information does not include The length of any data block.

Wherein, the receiving end acquiring the length increased by the any data block includes: the receiving end acquiring the minimum index bit, the middle index bit and the largest index bit of the any data block; the receiving end acquiring the minimum index of the historical data block bits, middle index bits, and maximum index bits. Still taking FIG. 5 as an example, a historical data block in the historical indication information includes the 61st index indication bit to the 76th index indication bit in the historical indication information, wherein the 64th, 69th and 74th The index indication bits are respectively the minimum index bit, the middle index bit and the maximum index bit of the historical data block, and the data block corresponding to the historical data block in any index indication information includes the 61st in the any index indication information The index indication bits to the 76th index indication bits, wherein the 63rd, 69th and 74th index indication bits are the minimum index bit, the middle index bit and the maximum index bit of any data block. The receiving end uses the minimum index bit, the middle index bit and the maximum index bit of any data block, the minimum index bit, the middle index bit and the maximum index bit of the historical data block as output data, and inputs the following formula (7):

The receiving end outputs the area length Commonlength of the any data block, and uses the area length of the any data block as the length BlockLength of the any data block. Among them, MaxIndex(q) is the largest index bit of the historical data block, MaxIndex(q+1) is the largest index bit of any data block; MidIndex(q) is the middle index bit of the historical data block, MidIndex(q +1) is the middle index bit of any data block; MinIndex(q) is the minimum index bit of the historical data block, MinIndex(q+1) is the minimum index bit of any data block; the any data block The length of the region is the length of the region where the index indicating bit of the first parameter value in any data block is located.

In a possible implementation manner, in order to facilitate quantized representation, the receiving end rounds the region length of any data block to a power of 2, and uses it as the length of any data block BlockLength, as shown in the following formula (8):

In a possible implementation manner, the difference information further includes at least one of a quantization indicator bit corresponding to any data block and position information, and a quantization indicator bit is used to indicate that during the current quantization and during historical quantization, Whether the usage of the first vector in the plurality of vectors is the same, the historical quantization is the quantization corresponding to the historical index information in the last channel measurement process, and a position information is used to indicate that the second vector in the plurality of vectors is in the The position in the codebook corresponding to any index information, the first vector is any one of the vectors used in the historical quantization, the second vector is the historical quantization in the multiple vectors Any vector that is not taken.

In a possible implementation manner, the receiving end determining the quantization indicator bit corresponding to any of the data blocks includes: the receiving end determining at least one index indicator bit in the historical data block that takes the value of the first parameter value, wherein the The vector indicated by the at least one index indication bit is the vector (that is, at least one first vector) adopted during historical quantization, and the adopted vector is the vector selected by the receiving end to represent the matrix during the quantization process; the receiving end obtains the quantization Indication information, the quantization indication information includes at least one quantization indication bit, and each quantization indication bit corresponds to an index indication bit in the historical data block whose value is the first parameter value, or it can be understood that each quantization indication bit corresponds to one The first vector; for any index indication bit whose value is the first parameter value in the historical data block, if the value of the any index indication bit in the any index information and the value in the historical index information Inconsistent, then the receiving end sets the quantization indication bit corresponding to the any index indication bit in the quantization indication information as the fifth parameter value, to indicate that the first vector corresponding to the any index indication bit is quantized this time and in the history The adoption situation during quantization is different; if the value of the any index indication bit in the any index information is consistent with the value in the historical index information, the receiving end will use the quantization indication information for the any index in the information. The quantization indication bit corresponding to the indication bit is set as the sixth parameter value to indicate that the first vector corresponding to any index indication bit is used in the same situation in the current quantization and in the historical quantization.

Here, the embodiments of the present application do not limit the representation of the fifth parameter value and the sixth parameter value. For example, the fifth parameter value is 0 and the sixth parameter value is 1, and the historical data block shown in FIG. 5 is For example, the 6 index indication bits in the historical data block shown in FIG. 5 are all the first parameter values, and these 6 index indication bits are the 64th, 66th, and 67th in the historical index information respectively. The 69th, 70th and 74th index indication bits, and the 64th, 66th, 67th, 69th, 70th and 74th vectors in the corresponding codebook are the first vector. However, in any data block shown in FIG. 5, the values of the first, third and fourth index indicating bits of the six index indicating bits have all changed, and among the six index indicating bits The 2nd, 5th, and 6th index indication bits of , do not change, and the quantization indication information corresponding to any data block is [0, 1, 0, 0, 1, 1].

In a possible implementation manner, the receiving end determining the location information corresponding to the any data block includes: for any index indication bit that takes the value of the first parameter value in the any data block, if the corresponding historical The data block does not include any of the index indication bits, which means that compared with the historical data block, the any index indication bit is the newly added index indication bit in the any data block, and the any index indication bit is located. The corresponding vector is used in this quantization, and the vector corresponding to any index indication bit is the second vector; for any index indication bit that takes the value of the second parameter value in the historical data block, if the any index The value of the indicator bit in any of the index information is the first parameter value, indicating that the vector corresponding to the indicator bit of any index was not used in historical quantization, but is used in this quantization, then the receiving end determines The vector corresponding to any index indication bit is a second vector; after the receiving end determines at least one second vector corresponding to any data block, the receiving end corresponds to the index indication bit corresponding to the at least one second vector The position in the any data block is determined as the position information corresponding to the any data block. Still taking Fig. 5 as an example, the vectors corresponding to the 3rd and 8th index indication bits in the historical data block shown in Fig. 5 are the second vectors, then the position information corresponding to any data block includes 3 and 8. 8.

405. The receiving end sends the difference information of the first sub-index information, the difference information of the second sub-index information, the difference information of the second index information, and the second projection information to the transmitting end.

406. The transmitting end receives the difference information of the first sub-index information, the difference information of the second sub-index information, the difference information of the second index information, and the second projection information.

407. For any indication information among the first sub-index information, the second sub-index information, and the second index information, the transmitting end determines the any index information based on the difference information of the any indication information.

The transmitter determines the historical index information corresponding to the type identifier based on the type identifier corresponding to the any index information; for any historical data block in the plurality of historical index information, the transmitter determines from the difference information Obtain the quantization indication information of any historical data block, and for any quantization indication bit whose value is the fifth parameter value in the quantization indication information, the transmitting end updates the corresponding quantization indication bit in the historical index information. The index indicates the value of the bit. For example, if the first parameter value of the index indication bit corresponding to any quantization indication bit in the historical index information, the transmitting end updates the index indication bit corresponding to the any quantization indication bit in the historical index information to the first parameter value of the index indication bit. Two parameter values.

After the transmitter has updated any historical data block in the historical index information based on the quantization indication information of the historical data block. For a data block corresponding to any historical data block in any of the indication information, if the difference information of any of the indication information includes the length indication bit of the data block, and the length indication bit is used to indicate that the data block is different from the data block. If the length of any historical data block is not the same, the transmitting end obtains the length of the data block from the difference information; the transmitting end adds the length of the data block at the beginning and end of the updated historical data block based on the length of the data block. The index indication bit is set, so that the length of any historical data block to which the index indication bit is added is the same as the length of the data block. For example, the data block has 2 more indication bits than any historical data block, and the transmitting end adds one index indication bit at the beginning and end of any historical data block respectively. For another example, if the data block has 4 more index indication bits than any historical data block, the transmitting end adds 2 index indication bits at the beginning and end of any historical data block respectively. If the length indication bit is used to indicate that the length of the data block is the same as that of any historical data block, the transmitter does not add an index indication bit to any historical data block.

After the transmitting end updates any historical data block based on the length indication bit of the any historical data block, the transmitting end obtains the position information corresponding to the any historical data block from the difference information, and for the position information At any position in any of the updated historical index information, the transmitting end updates the index indication bit corresponding to the any position in the updated historical index information to the first parameter value.

When the transmitting end updates any historical data block based on the location information corresponding to the historical data block, the updating of the historical data block is completed, and the updated historical data block also restores the any index information When the transmitting end updates all the historical data blocks in the historical index information, the historical index information is updated, and the updated historical index information is also the any index information.

408. The transmitting end determines the precoding matrix based on the determined first sub-index information, second sub-index information, the second index information, and the second projection information.

The process described in this step 408 is the same as the process shown in the foregoing steps 3071-3072, and this step 408 is not described repeatedly in this embodiment of the present application.

In the method provided by the embodiments of the present application, the precoding matrix is quantized for the first time, and the projection information obtained by the initial quantization is subjected to secondary quantization, so as to reduce the data amount of the projection information obtained after the initial quantization. When the quantization result of the secondary quantization is sent to the transmitting end in place of the projection information obtained after the initial quantization, the signaling overhead required for the receiving end to feed back to the transmitting end can be reduced. In addition, by sending the difference information between the quantized projection information and the historical projection information, the signaling overhead required for the receiving end to feed back to the transmitting end is further reduced.

In a possible implementation manner, for any of the methods shown in FIG. 3 and FIG. 4 , when the receiving end acquires any one of the first projection information, the second projection information and the third projection information After that, any method further includes the following step S3.

Step S3: The receiving end performs training on a codebook corresponding to any projection information based on the any projection information.

If the any projection information is the first projection information, the codebook corresponding to the any projection information is the frequency domain codebook; if the any projection information is the second projection information, the codebook corresponding to the any projection information is the first Two codebooks, if any one of the projection information is the third projection information, the codebook corresponding to the any one of the projection information is the third codebook.

In a possible implementation manner, the receiving end uses any projection information as a sample, and uses a K-singular value decomposition (K-SVD) algorithm to perform a codebook corresponding to any projection information. training, so that in the next channel measurement, the receiving end can directly use the codebook obtained after training, thereby realizing the online training of the codebook.

In a possible implementation manner, the receiving end performs training for the target number of times based on the projection matrix used to represent the any projection information, the codebook corresponding to the any projection information, and the first threshold as input data.

For any training process in the training process of the target number of times, the receiving end uses the codebook to quantize the projection matrix to obtain a quantized projection matrix and an error matrix between the quantized projection matrix and the projection matrix, wherein the target The index matrix includes the projection coefficient between the projection matrix and the quantized projection matrix; if the modulus of the error matrix is less than the first threshold, the receiving end terminates the iteration and does not update the codebook; otherwise, the receiving end The codebook is updated as follows:

For any row of data in the quantized projection matrix, if the any row of data is a non-zero row, the receiving end deletes the any row of data in the quantized projection matrix to obtain an updated quantized projection matrix, and uses the updated quantized projection matrix. The product between the projection matrix and the codebook serves as the error projection matrix of the quantized projection matrix. The receiver obtains the error matrix between the quantization projection matrix and the error projection matrix, and performs singular value decomposition on the error matrix to obtain an eigenvector of the error matrix, and the eigenvector is used to represent the feature of the error matrix; the The receiving end updates the vector corresponding to the data of any row in the codebook to the feature vector.

When the receiving end updates a vector in the codebook once based on each row of data in the quantized projection matrix, the training process ends. When the receiving end performs the training process for the target number of times, The codebook training is completed, and the finally obtained codebook is also the trained codebook.

It should be noted that, in the embodiment of the present application, the condition for judging whether to update the codebook is whether the modulus of the error matrix is less than the first threshold. Of course, this condition can also be replaced by other conditions. Conditions are not limited.

In order to further illustrate the above K-SVD algorithm, it is assumed that any projection matrix is the spatial domain projection matrix Z, and the codebook to be trained is the spatial domain codebook as an example. See Pseudocode 3 below:

Correspondingly, after the transmitting end determines the any projection information, the any method further includes the following step S4.

Step S4, the transmitting end performs training on a codebook corresponding to any one of the projection information based on the any one of the projection information.

The process shown in this step S4 is the same as the process shown in the step S3, and here, the embodiment of the present application does not repeat the description of this step S4. After the transmitter completes the training on any codebook, in the next channel measurement, the transmitter can directly use the codebook obtained after training, thereby realizing the online training of the codebook.

To further illustrate the process of the receiving end feeding back the compressed projection information and the codebook online training to the transmitting end, refer to the schematic flowchart of a data processing provided by an embodiment of the present application shown in FIG. 6 . Among them, the receiving end includes a spatial basis selector (spatial basis selector), a frequency domain sparse basis optimizer (frequency basis optimizer), a sparse binary vector two-stage differential compressor (two-stage binary differential compression) and a vector quantization codebooker (vector quantization codebook). After obtaining the precoding matrix W, the spatial sparse basis solver uses the spatial codebook S to solve (that is, quantization) the spatial sparse basis for the precoding matrix W, and obtains the target spatial projection matrix Z _c and the first index matrix a _s ( That is, the first sub-index information). After that, the frequency domain sparse basis optimizer uses the frequency domain codebook F to solve (ie quantize) the target spatial domain projection matrix Z _c the domain sparse basis, and obtain the target frequency domain projection matrix X _c and the second index matrix b _s (that is, the first two sub-index information). After that, the sparse binary vector two-stage differential compressor performs two-stage differential operations on the first index matrix a _s and the second index matrix b _s respectively (refer to the above step 404) to obtain the difference information of the first index matrix a _s and the first index matrix a s. For the difference information of the two-index matrix b _s , the difference information of the first index matrix a _s and the difference information of the second index matrix b _s are replaced by the difference information C for the convenience of description. The compressor sends the difference information c to the transmitter. The vector quantization codebook uses the second codebook to further quantize the target frequency domain projection matrix X _c to obtain the target projection matrix B and the third index matrix c _x , and quantifies the target projection matrix B and the third index matrix c _x transmitted to the transmitter.

The transmitting end includes binary vector recovery, sparse basis reconstruction, sparse coefficients recovery and precoding matrix recovery. The binary sparse vector restorer receives the difference information C from the receiving end, and restores the first index matrix a _s and the second index matrix b _s according to the difference information C. After that, the sparse basis reconstructor determines the first matrix based on the spatial codebook S, the frequency domain codebook F, the first index matrix a _s and the second index matrix b _s , and based on the spatial codebook and the first index matrix a _s S _stemp (ie the spatial sparse basis of the precoding matrix W), based on the frequency domain codebook and the second index matrix b _s , determine the second matrix F _stemp (ie the frequency domain sparse basis of the precoding matrix W). The sparse coefficient matrix restorer receives the target projection matrix B and the third index matrix c _s from the receiving end, and quantizes the target frequency domain matrix based on the second codebook, the target projection matrix B and the third index matrix c _s

The precoding matrix restorer is based on the first matrix S _stemp , the second matrix F _stemp and the quantized target frequency domain matrix

Get the quantized precoding matrix

in,

In the method provided by the embodiment of the present application, the receiving end feeds back the precoding matrix to the transmitting end by sending the quantization result of the precoding matrix to the transmitting end, and the current precoding matrix feedback method includes a sounding reference signal based on a sounding reference signal. , SRS) feedback mode, SVD-based feedback mode, and R16 type II (Type II) codebook-based feedback mode, wherein, the SRS-based feedback mode is: the receiving end sends SRS to the transmitting end, and the transmitting end determines a pre-determined value based on the SRS. Edit the matrix. The feedback method based on SVD is as follows: the receiver performs singular value decomposition on the channel matrix to obtain a pre-programmed matrix, and directly sends the pre-programmed matrix to the transmitter. The feedback method based on the R16TypeII codebook is as follows: the receiving end uses the R16TypeII codebook to quantize the precoding matrix, and quantizes the amplitude and phase of the quantization result to obtain quantized data, and sends the quantized data to the transmitting end, so that the transmitting end can base on the The precoding matrix is recovered from the quantized data and the R16TypeII codebook.

For further embodiment, the method provided by the embodiment of the present application can reduce the feedback overhead of the receiving end, and can improve the performance of the system. In the case of the same feedback overhead, through simulation experiments, the system performance of the embodiments of the present application and the current pre-programmed matrix feedback mode is compared. Simulation experiments are carried out with the SU-clustered delay line (CDL)-B channel model, the SU-CDL-D channel model and the MU-CDL-B channel model, respectively. The comparison results are shown in Figures 7-9.

FIG. 7 is a system performance comparison diagram under various feedback modes under a SU-CDL-B channel model provided by an embodiment of the present application, and the precoding matrix is a channel state information-reference signal (channel state information-reference signal, CSI- One of the RS) species, the left picture in FIG. 7 is that in the scenario of feeding back CSI-RS, the transmitting end adopts a rank (rank) as the third-order modulation and coding scheme (modulation and coding scheme, MCS) 27 for coding, and transmits When the performance parameters of the antenna include 32 ports (port), 8 horizontal (horizon, H), and 4 (vertical, V), the method provided in this embodiment of the present application and several current pre-programmed matrix feedback methods are used. The pre-programmed matrix is fed back in the CDL-B channel, and the comparison diagram after the simulation experiment is carried out. Among them, the number of antennas at the transmitter is 64T, dual-polarized, and each polarization is 32 antennas. 8H4V indicates the arrangement of these 32 antennas, positive and negative. Polarization is the same. The right picture in FIG. 7 shows that in the scenario of feeding back CSI-RS, the transmitting end uses MCS 20 with a rank of 4 for encoding, and when the performance parameters of the transmitting antenna include 32 ports and 8H4V, the method provided by the embodiment of the present application is adopted. As well as several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the SU-CDL-D channel, and the comparison diagram after the simulation experiment is carried out. The compressed CSI mode (mode) 1 and the compressed CSI mode 2 in FIG. 7 both represent the methods provided by the embodiments of the present application, and the difference lies in the parameters used in the quantization process. The parameter used to reflect the system performance in Figure 7 is the ratio of the energy of each symbol to the energy spectral density of noise (ratio of symbol energy to noise power spectral density, ESN0), and the unit is decibel (dB). It can be seen from the two graphs in FIG. 7 that, under the same feedback overhead and the same block error ratio (BLER), compared with the feedback method based on the R16TypeII codebook, the method provided by the embodiment of the present application has The gain brought about is more than 5 dB higher. If the feedback overhead is increased, the gain brought by the method provided in the embodiment of the present application can be further increased by 2-5 dB. Furthermore, it can be seen from the left graph in FIG. 7 that the correlations RR corresponding to the feedback method based on the R16 Type II codebook and the

compressed CSI modes

1 and 2 are 0.6302, 0.7610 and 0.8268, respectively. It can be seen from the right figure in FIG. 7 that the correlations RR corresponding to compressed

CSI modes

1 and 2 based on the feedback mode of the R16 Type II codebook are 0.5981, 0.7309 and 0.8022, respectively. The correlation corresponding to a feedback method is used to indicate the correlation between the precoding matrix recovered by the transmitter and the precoding matrix used by the receiver when the receiver uses this feedback method to feed back the precoding matrix. The larger the degree is, the more accurate the pre-programmed matrix recovered by the transmitter is. Therefore, as can be seen from FIG. 7 , compared with the feedback method based on the R16TypeII codebook, the method provided by the embodiment of the present application can enable the transmitter to recover more accurately out the precoding matrix.

8 is a system performance comparison diagram under various feedback modes under a SU-CDL-D channel model provided by an embodiment of the present application, wherein the antenna distribution between the transmitting end and the receiving end is 64 transmit (transmit, T) x4 receive (receive, R) means that the transmitter has 64 antennas and the receiver has 4 antennas. The left picture in FIG. 8 shows that in the scenario of feeding back CSI-RS, the transmitting end uses MCS 27 with a rank of 1 for encoding, and when the performance parameters of the transmitting antenna include 32 ports and 8H4V, the method provided by the embodiment of the present application is adopted. As well as several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the SU-CDL-D channel, and the comparison diagram after the simulation experiment is carried out. The right picture in FIG. 7 shows that in the scenario of feeding back CSI-RS, the transmitting end uses MCS 27 with a rank of 2 for encoding, and when the performance parameters of the transmitting antenna include 32 ports and 8H4V, the method provided by the embodiment of the present application is adopted. As well as several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the SU-CDL-D channel, and the comparison diagram after the simulation experiment is carried out. It can be seen from the two graphs in FIG. 8 that under the same feedback overhead and the same BLER, the gain brought by the method provided by the embodiment of the present application is basically the same as the gain brought by the feedback method based on the R16TypeII codebook, In the case of high-order MCS27, compared with the feedback method based on the R16TypeII codebook, the gain brought by the method provided in the embodiment of the present application is about 0.7 dB higher.

FIG. 9 is a system performance comparison diagram under various feedback modes under a MU-CDL-B channel model provided by an embodiment of the present application. The upper left picture in FIG. 9 is a scenario where CSI-RS is fed back, and the receiving end is a user Terminal 0, the transmitting end uses MCS13 with a rank of 1 for coding, and when the performance parameters of the transmitting antenna include 32 ports and 8H4V, the method provided in this embodiment of the present application and several current pre-programmed matrix feedback methods are used. The pre-programmed matrix is fed back in the CDL-B channel, and the comparison diagram after the simulation experiment is carried out. The upper right picture in Fig. 9 shows that in the scenario of feeding back CSI-RS, the receiving end is user terminal 0, the transmitting end uses MCS 15 with a rank of 2 for coding, and the performance parameters of the transmitting antenna include 32 ports and 8H4V. In the method provided in the embodiment of the present application and several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the MU-CDL-B channel, and a comparison diagram after a simulation experiment is performed. The lower left picture in Figure 9 shows that in the scenario of feeding back CSI-RS, the receiving end is user terminal 1, the transmitting end uses MCS13 with rank 1 for coding, and the performance parameters of the transmitting antenna include 32 ports and 8H4V. In the method provided in the application embodiment and several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the MU-CDL-B channel, and a comparison diagram after a simulation experiment is performed. The lower right picture in Fig. 9 shows that in the scenario of feeding back CSI-RS, the receiving end is user terminal 1, the transmitting end uses MCS 15 with a rank of 2 for encoding, and the performance parameters of the transmitting antenna include 32 ports and 8H4V. Using the method provided by the embodiment of the present application and several current pre-programmed matrix feedback methods, the pre-programmed matrix is fed back in the MU-CDL-B channel, and a comparison diagram after a simulation experiment is performed. It can be seen from the four graphs in FIG. 9 that, under the same feedback overhead and the same BLER, compared with the feedback method based on the R16TypeII codebook, the gain brought by the method provided in the embodiment of the present application can reach up to about 6dB, The order of MCS can also be increased by 1 to 2 orders. For the upper right graph and the lower right graph in FIG. 9 , the performance curves corresponding to the feedback method based on the R16TypeII codebook both have plateaus. For the two figures on the left in FIG. 9 , when the same CSI is fed back, the average correlations corresponding to the R16 Type II codebook-based feedback mode and compressed

CSI modes

1 and 2 are 0.6909, 0.81155, and 0.85755, respectively. For the two figures on the right in FIG. 9 , in the case of feeding back the same CSI, the average correlations corresponding to the feedback mode based on the R16 Type II codebook and the

compressed CSI modes

1 and 2 are 0.5869, 0.8034, and 0.85745, respectively. It can be seen that in the case of feeding back the same CSI, compared with the feedback method based on the R16TypeII codebook, the average correlation corresponding to the method provided by the embodiment of the present application is higher, and the embodiment of the present application can enable the transmitting end to more accurately restore the precoding matrix. Wherein, the average correlation corresponding to one feedback mode is the average value between the corresponding correlations when different terminals use this feedback mode to feed back the precoding matrix.

10 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application, and the apparatus includes:

A first quantization module 1001, configured to perform quantization processing on a precoding matrix of a channel based on at least one first codebook to obtain first index information and first projection information, where the first index information is used to indicate the at least one first codebook. A vector used to represent the precoding matrix in a codebook, and the first projection information includes projection coefficients between the precoding matrix and at least one first codebook;

The second quantization module 1002 is configured to perform quantization processing on the first projection information based on a second codebook to obtain second index information and second projection information, where the second index information is used to indicate the second codebook is used to represent the vector of the first projection information in , and the second projection information includes the projection coefficients between the first projection information and the second codebook;

The sending module 1003 is configured to send the first index information, the second index information and the second projection information.

In a possible implementation manner, the second quantization module 1002 includes:

a first quantization unit, configured to perform column vector quantization processing on the projection coefficients in the first projection information to obtain a column vector;

A second quantization unit, configured to perform quantization processing on the column vector based on the second codebook to obtain the second index information and the second projection information.

The first quantization module 1001 includes:

a third quantization unit, configured to perform quantization processing on the precoding matrix based on the spatial codebook to obtain the first sub-index information and third projection information, where the first sub-index information is used to indicate the spatial domain a vector used to represent the precoding matrix in the codebook, and the third projection information includes projection coefficients between the precoding matrix and the spatial codebook;

The fourth quantization unit performs quantization processing on the third projection information based on the frequency domain codebook to obtain the second sub-index information and the first projection information, where the second sub-index information is used to indicate the A vector used to represent the third projection information in the frequency domain codebook, and the first projection information includes projection coefficients between the third projection information and the frequency domain codebook.

In a possible implementation, the apparatus further includes:

an obtaining module, configured to obtain the any index information obtained in this channel measurement process for any index information in the first sub-index information, the second sub-index information and the second index information The difference information between the historical index information and the historical index information, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between the any index information and the historical index information the difference part;

The sending module 1003 is further configured to send the difference information.

In a possible implementation, the apparatus further includes:

The training module is configured to, for any projection information in the first projection information, the second projection information and the third projection information, based on the any projection information, for any projection information corresponding to the any projection information codebook for training.

FIG. 11 is a schematic structural diagram of a data processing apparatus provided by an embodiment of the present application, and the apparatus includes:

A receiving module 1101, configured to receive first index information, second index information, and second projection information, where the first index information is used to indicate a vector representing a precoding matrix of a channel in the at least one first codebook , the second index information is used to indicate a vector used to represent the first projection information in the second codebook, and the second projection information includes the projection coefficients between the first projection information and the second codebook ;

a first determining module 1102, configured to determine the first projection information based on the second index information, the second projection information and the second codebook;

The second determining module 1103 is configured to determine the precoding matrix based on the first index information, the first projection information and the at least one first codebook.

In a possible implementation manner, the second determining module 1103 includes:

a first determining unit, configured to determine the third projection information based on the first projection information, the second sub-index information and the frequency domain codebook;

A second determining unit, configured to determine the precoding matrix based on the third projection information, the first sub-index information and the spatial codebook.

In a possible implementation manner, the receiving module 1101 is further configured to:

For any one of the first sub-index information, the second sub-index information, and the second index information, receive difference information between the any index information and historical index information, and the historical index The information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between the any index information and the historical index information;

The device also includes:

A third determining module, configured to determine any one of the index information based on the difference information and the historical index information.

In a possible implementation, the apparatus further includes:

All the above-mentioned optional technical solutions can be combined arbitrarily to form optional embodiments of the present disclosure, which will not be repeated here.

It should be noted that when the data processing apparatus provided in the above-mentioned embodiments processes data, only the division of the above-mentioned functional modules is used as an example for illustration. The internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the data processing method embodiments provided by the above embodiments belong to the same concept, and the specific implementation process thereof is detailed in the method embodiments, which will not be repeated here.

Embodiments of the present application also provide a computer program product or computer program, where the computer program product or computer program includes computer instructions, where the computer instructions are stored in a computer-readable storage medium, and the processor of the electronic device is obtained from the computer-readable storage medium. After reading the computer instructions, the processor executes the computer instructions, so that the electronic device executes the above data processing method.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above embodiments can be completed by hardware, or can be completed by instructing relevant hardware through a program, and the program can be stored in a computer-readable storage medium. The storage medium mentioned may be a read-only memory, a magnetic disk or an optical disk, etc.

The above are only exemplary embodiments of the present application and are not intended to limit the present application. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application shall be included in the protection of the present application. within the range.

Claims

A data processing method, characterized in that the method comprises:

The precoding matrix of the channel is quantized based on the at least one first codebook to obtain first index information and first projection information, where the first index information is used to indicate that the at least one first codebook is used to represent the a vector of the precoding matrix, and the first projection information includes projection coefficients between the precoding matrix and at least one first codebook;

The first projection information is quantized based on the second codebook to obtain second index information and second projection information, where the second index information is used to indicate that the second codebook is used to represent the first a vector of projection information, the second projection information includes projection coefficients between the first projection information and the second codebook;

The first index information, the second index information, and the second projection information are sent.
The method according to claim 1, wherein the performing quantization processing on the first projection information based on the second codebook to obtain the second index information and the second projection information of the first projection information comprises:

Perform column vectorization processing on the projection coefficients in the first projection information to obtain a column vector;

The column vector is quantized based on the second codebook to obtain the second index information and the second projection information.
The method according to claim 1 or 2, wherein the at least one codebook includes a spatial-domain codebook and a frequency-domain codebook, and the first index information includes first sub-index information and second sub-index information;

The performing quantization processing on the precoding matrix of the channel based on the at least one first codebook, and obtaining the first index information and the first projection information of the precoding matrix include:

The precoding matrix is quantized based on the spatial codebook to obtain the first sub-index information and third projection information, where the first sub-index information is used to indicate that the a vector of the precoding matrix, and the third projection information includes a projection coefficient between the precoding matrix and the spatial codebook;

The third projection information is quantized based on the frequency-domain codebook to obtain the second sub-index information and the first projection information, where the second sub-index information is used to indicate the frequency-domain codebook A vector used to represent the third projection information in , where the first projection information includes projection coefficients between the third projection information and the frequency domain codebook.
The method according to claim 3, wherein the dimensions of the space-domain codebook and the frequency-domain codebook are both greater than or equal to the number of antennas at the transmitting end.
The method according to claim 3, wherein before the sending the first index information, the second index information and the second projection coefficient, the method further comprises:

For any index information among the first sub-index information, the second sub-index information, and the second index information, obtain the difference between the any index information obtained in the current channel measurement process and the historical index information Difference information between, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between any index information and the historical index information;

Sending any of the index information includes:

The difference information is sent.
The method according to claim 5, wherein the any index information includes at least one data block, and any data block is used to indicate whether adjacent multiple vectors in the codebook corresponding to the any index information are used for this quantification;

The difference value information includes at least one of a quantization indication bit corresponding to any data block and position information, and one of the quantization indication bits is used to indicate that in the current quantization and in the historical quantization, among the multiple vectors Whether the adoption of the first vector is the same, the historical quantization is the quantization corresponding to the historical index information in the last channel measurement process, and one piece of the position information is used to indicate that the second vector in the plurality of vectors is in The position in the codebook corresponding to any index information, the first vector is any vector used in the multiple vectors during the historical quantization, and the second vector is the historical Any one of the vectors that is not used during quantization, and the second vector is used in this quantization process.
The method according to claim 6, wherein the difference information further comprises a length indication bit, and the length indication bit is used to indicate whether the length of any data block is the same as that of a historical data block, and the historical data block has the same length. The data block is a data block corresponding to any of the data blocks in the historical index information.
The method according to claim 7, wherein, if the length indication bit is used to indicate that the length of any data block is different from that of the historical data block, the difference information further includes the length of the any data block. The length of the data block.
The method according to any one of claims 3-8, wherein the method further comprises:

For any one of the first projection information, the second projection information, and the third projection information, based on the any projection information, a codebook corresponding to the any projection information is trained.
A data processing method, characterized in that the method comprises:

receiving first index information, second index information, and second projection information, where the first index information is used to indicate a vector representing a precoding matrix of a channel in the at least one first codebook, and the second index The information is used to indicate a vector used to represent the first projection information in the second codebook, and the second projection information includes a projection coefficient between the first projection information and the second codebook;

determining the first projection information based on the second index information, the second projection information, and the second codebook;

The precoding matrix is determined based on the first index information, the first projection information, and the at least one first codebook.
The method according to claim 10, wherein the at least one codebook includes a spatial codebook and a frequency domain codebook, the first index information includes first sub-index information and second sub-index information, The first sub-index information is used to indicate the vector used to represent the precoding matrix in the spatial codebook, and the second sub-index information is used to indicate the frequency domain codebook used to represent the third projection vector of information, the first projection information includes projection coefficients between the third projection information and the frequency domain codebook, the third projection information includes the precoding matrix and the spatial domain codebook projection coefficient.
The method according to claim 11, wherein the determining the precoding matrix based on the first index information, the first projection information and the at least one first codebook comprises:

determining the third projection information based on the first projection information, the second sub-index information and the frequency domain codebook;

The precoding matrix is determined based on the third projection information, the first sub-index information, and the spatial codebook.
The method according to claim 11, wherein for any index information among the first sub-index information, the second sub-index information and the second index information, the any index information is received include:

Receive the difference information between the any index information and the historical index information, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate that the any index information is different from the index information. Differences between the historical index information;

The method also includes:

The any index information is determined based on the difference value information and the historical index information.
The method according to any one of claims 11-13, wherein the method further comprises:

For any one of the first projection information, the second projection information, and the third projection information, based on the any projection information, a codebook corresponding to the any projection information is trained.
A data processing device, characterized in that the device comprises:

a first quantization module, configured to perform quantization processing on a precoding matrix of a channel based on at least one first codebook to obtain first index information and first projection information, where the first index information is used to indicate the at least one first a vector used to represent the precoding matrix in the codebook, and the first projection information includes projection coefficients between the precoding matrix and at least one first codebook;

A second quantization module, configured to perform quantization processing on the first projection information based on the second codebook to obtain second index information and second projection information, where the second index information is used to indicate a vector used to represent the first projection information, the second projection information including the projection coefficients between the first projection information and the second codebook;

A sending module, configured to send the first index information, the second index information and the second projection information.
The apparatus according to claim 15, wherein the second quantization module comprises:

a first quantization unit, configured to perform column vector quantization processing on the projection coefficients in the first projection information to obtain a column vector;

A second quantization unit, configured to perform quantization processing on the column vector based on the second codebook to obtain the second index information and the second projection information.
The apparatus according to claim 15 or 16, wherein the at least one codebook includes a spatial-domain codebook and a frequency-domain codebook, and the first index information includes first sub-index information and second sub-index information;

The first quantization module includes:

a third quantization unit, configured to perform quantization processing on the precoding matrix based on the spatial codebook to obtain the first sub-index information and third projection information, where the first sub-index information is used to indicate the spatial domain a vector used to represent the precoding matrix in the codebook, and the third projection information includes projection coefficients between the precoding matrix and the spatial codebook;

The fourth quantization unit performs quantization processing on the third projection information based on the frequency domain codebook to obtain the second sub-index information and the first projection information, where the second sub-index information is used to indicate the A vector used to represent the third projection information in the frequency domain codebook, and the first projection information includes projection coefficients between the third projection information and the frequency domain codebook.
The apparatus according to claim 17, wherein the dimensions of the space-domain codebook and the frequency-domain codebook are both greater than or equal to the number of antennas at the transmitting end.
The apparatus of claim 17, wherein the apparatus further comprises:

an obtaining module, configured to obtain the any index information obtained in the current channel measurement process for any index information in the first sub-index information, the second sub-index information and the second index information Difference information between the historical index information and the historical index information, the historical index information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between the any index information and the historical index information the difference part;

The sending module is further configured to send the difference information.
The apparatus according to claim 19, wherein the any index information includes at least one data block, and any data block is used to indicate whether adjacent multiple vectors in the codebook corresponding to the any index information are used for this quantification;

The difference value information includes at least one of a quantization indication bit corresponding to any data block and position information, and one of the quantization indication bits is used to indicate that in the current quantization and in the historical quantization, among the multiple vectors Whether the adoption of the first vector is the same, the historical quantization is the quantization corresponding to the historical index information in the last channel measurement process, and one piece of the position information is used to indicate that the second vector in the plurality of vectors is in The position in the codebook corresponding to any index information, the first vector is any vector used in the multiple vectors during the historical quantization, and the second vector is the historical Any one of the vectors that is not used during quantization, and the second vector is used in this quantization process.
The apparatus according to claim 20, wherein the difference information further comprises a length indication bit, and the length indication bit is used to indicate whether the length of any data block is the same as that of a historical data block, and the historical data block has the same length. The data block is a data block corresponding to any of the data blocks in the historical index information.
The apparatus according to claim 21, wherein, if the length indication bit is used to indicate that the length of any data block is different from that of the historical data block, the difference information further includes the any one of the data blocks. The length of the data block.
The device according to any one of claims 17-22, wherein the device further comprises:

The training module is configured to, for any projection information in the first projection information, the second projection information and the third projection information, based on the any projection information, for any projection information corresponding to the any projection information codebook for training.
A data processing device, characterized in that the device comprises:

a receiving module, configured to receive first index information, second index information, and second projection information, where the first index information is used to indicate a vector used to represent a precoding matrix of a channel in the at least one first codebook, The second index information is used to indicate a vector used to represent first projection information in the second codebook, and the second projection information includes a projection coefficient between the first projection information and the second codebook;

a first determining module, configured to determine the first projection information based on the second index information, the second projection information and the second codebook;

A second determining module, configured to determine the precoding matrix based on the first index information, the first projection information and the at least one first codebook.
The apparatus according to claim 24, wherein the at least one codebook includes a spatial codebook and a frequency domain codebook, and the first index information includes first sub-index information and second sub-index information, The first sub-index information is used to indicate the vector used to represent the precoding matrix in the spatial codebook, and the second sub-index information is used to indicate the frequency domain codebook used to represent the third projection vector of information, the first projection information includes projection coefficients between the third projection information and the frequency domain codebook, the third projection information includes the precoding matrix and the spatial domain codebook projection coefficient.
The apparatus according to claim 25, wherein the second determining module comprises:

a first determining unit, configured to determine the third projection information based on the first projection information, the second sub-index information and the frequency domain codebook;

A second determining unit, configured to determine the precoding matrix based on the third projection information, the first sub-index information and the spatial codebook.
The device according to claim 25, wherein the receiving module is further configured to:

For any one of the first sub-index information, the second sub-index information, and the second index information, receive difference information between the any index information and historical index information, and the historical index The information is the index information obtained in the last channel measurement process, and the difference information is used to indicate the difference between the any index information and the historical index information;

The device also includes:

A third determining module, configured to determine any one of the index information based on the difference information and the historical index information.
The device according to any one of claims 25-27, wherein the device further comprises:

The training module is configured to, for any projection information in the first projection information, the second projection information and the third projection information, based on the any projection information, for any projection information corresponding to the any projection information codebook for training.
An electronic device, characterized in that the electronic device comprises a processor, and the processor is configured to execute program codes, so that the electronic device executes the method according to any one of claims 1 to 9, or A method as claimed in any one of claims 10 to 14.
A computer-readable storage medium, characterized in that, at least one piece of program code is stored in the storage medium, and the at least one piece of program code is read by a processor to cause the electronic device to execute any one of claims 1 to 14. one of the methods described.