Information CSI report, terminal, and network device

A method for transmitting a channel state information CSI report, applied to a network device side and comprising:

• receiving a channel state information CSI report of a terminal, wherein the CSI report has at least one of the following information in the CSI report discarded:
• non-zero quantized coefficients in a compressed coefficient matrix at each layer, or a bitmap indicating the quantized coefficients;
• determining the number of bits of a bitmap in the CSI report based on priority information preset for information groups, and demodulating the bitmap based on the number of bits of the bitmap;
• and
• determining the number of bits of a quantized coefficient based on the demodulated bitmap, and demodulating the quantized coefficient based on the number of bits of the quantized coefficient;
• wherein the information groups are obtained through dividing non-zero quantized coefficients in a compressed coefficient matrix and a bitmap indicating the quantized coefficients;
• wherein a manner of the dividing comprises any one of the following:
• mapping elements of the bitmap to a bit stream column by column, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each correspond to elements of P columns in the bitmap, P is a preset group length, N is equal to ceil(BH/P) or floor(BH/P), ceil is round up, floor is round down, and BH is the number of columns in the bitmap;
• mapping elements of the bitmap to a bit stream row by row, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each correspond to elements of Q rows in the bitmap, Q is a preset group length, N is equal to ceil(BL/Q) or floor(BL/Q), and BL is the number of rows in the bitmap;
• dividing the bitmap into A*B portions, wherein (A−1)*(B−1) portions comprise elements of P columns and Q rows;
• and mapping the bitmap to a bit stream portion by portion, wherein each portion is one information subgroup, P and Q are preset group lengths, and A*B is equal to any one of the following:
• ceil(BH/P)*ceil(BL/Q), floor(BH/P)*floor(BL/Q), ceil[(BH/P)*(BL/Q)], and floor[(BH/P)*(BL/Q)];
• mapping elements of the bitmap to a bit stream column by column, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each comprise S bits, S is a preset group length, N is equal to ceil(BS/S) or floor(BS/S), and BS is a total number of bits in the bitmap;
• or
• mapping elements of the bitmap to a bit stream row by row, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each comprise S bits, and S is a preset group length.

A communications device, comprising a processor, a memory, and a program stored in the memory and capable of running on the processor, wherein when the program is executed by the processor, the steps of a method for transmitting a channel state information (CSI) report are implemented, wherein the method comprises:

• dividing non-zero quantized coefficients in a compressed coefficient matrix and a bitmap indicating the quantized coefficients into a plurality of information groups;
• discarding, based on priority information preset for information groups, at least one of the following information in the CSI report:
• the quantized coefficients or the bitmap;
• and
• transmitting the CSI report with the information discarded;
• wherein the information groups are obtained through dividing non-zero quantized coefficients in a compressed coefficient matrix and a bitmap indicating the quantized coefficients;
• wherein a manner of the dividing comprises any one of the following:
• mapping elements of the bitmap to a bit stream column by column, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each correspond to elements of P columns in the bitmap, P is a preset group length, N is equal to ceil(BH/P) or floor(BH/P), ceil is round up, floor is round down, and BH is the number of columns in the bitmap;
• mapping elements of the bitmap to a bit stream row by row, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each correspond to elements of Q rows in the bitmap, Q is a preset group length, N is equal to ceil(BL/Q) or floor(BL/Q), and BL is the number of rows in the bitmap;
• dividing the bitmap into A*B portions, wherein (A−1)*(B−1) portions comprise elements of P columns and Q rows;
• and mapping the bitmap to a bit stream portion by portion, wherein each portion is one information subgroup, P and Q are preset group lengths, and A*B is equal to any one of the following:
• ceil(BH/P)*ceil(BL/Q), floor(BH/P)*floor(BL/Q), ceil[(BH/P)*(BL/Q)], and floor[(BH/P)*(BL/Q)];
• mapping elements of the bitmap to a bit stream column by column, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each comprise S bits, S is a preset group length, N is equal to ceil(BS/S) or floor(BS/S), and BS is a total number of bits in the bitmap;
• or
• mapping elements of the bitmap to a bit stream row by row, and dividing the bit stream into N information subgroups, wherein N−1 information subgroups each comprise S bits, and S is a preset group length.