Method for sending or receiving information, and communication apparatus

Abstract

The present application provides a method for sending or receiving information, and a communication apparatus. CSI reported by a terminal side to a network side comprises an RI, wherein the RI is associated with one candidate value among a group of candidate values of a rank configured by the network side. On the basis of the candidate value corresponding to the rank being equal to 1 or greater than 1, there being one or more quantization bits for codeword elements of an AI-based CSI codeword, the implementation such as different layers discard the codeword elements in an inter-layer common or inter-layer specific manner when the candidate value associated with the RI is greater than 1, and discarding processing and quantization on the CSI codeword, the terminal side reports the CSI to the network side. Facing the problem that the AI-based CSI codeword does not have an actual physical meaning, the present application can avoid the situation of loss of all pieces of CSI in a certain dimension that may be caused under a rule-based CSI discarding solution, and can reduce the performance loss of a system during AI-based CSI reporting.

Description

Methods and communication devices for sending or receiving information

[0001] This application claims priority to Chinese Patent Application No. 202411598511.8, filed on November 8, 2024, entitled "Method and Communication Apparatus for Sending or Receiving Information", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of wireless communication, and more specifically, to a method and communication apparatus for transmitting or receiving information. Background Technology

[0003] The Channel State Information Reference Signal (CSI-RS) is a reference signal specifically used for channel measurement. The base station transmits the CSI-RS in the downlink, enabling user equipment (UE) to perform channel estimation using the received CSI-RS. Based on the channel estimation results, the UE calculates the precoding matrix indicator (PMI), rank indicator (RI), and channel quality indicator (CQI), which together form the CSI. The CSI consists of two parts: Part 1 and Part 2. Part 1 contains the mandatory information in the CSI, such as RI and CQI; Part 2 contains information in the CSI that can be partially discarded, such as PMI. CSI discarding occurs when the uplink load (or uplink resources) for a given CSI report is insufficient to carry all the CSI information. Part 1 has a fixed reporting overhead and contains the same number of information bits as Part 2. All information in Part 1 is reported. After Part 1 reporting is completed, Part 2 is partially discarded and then reported again based on the uplink load.

[0004] Artificial intelligence (AI) has gradually become an important method in the physical layer of wireless communication, especially in CSI reporting, due to its ability to provide satisfactory fitting solutions to complex problems. However, AI-based CSI reporting still faces the problem of CSI dropping. When using AI CSI reporting schemes, the rule-based CSI dropping schemes in existing standards are not entirely applicable because the codeword elements generated by AI do not have physical meaning. For rule-based CSI dropping schemes, the dropping rules are difficult to configure flexibly, which may cause CSI in a certain dimension to be completely dropped, resulting in a significant performance loss for the communication system.

[0005] Therefore, how to avoid the performance loss of the communication system caused by the AI ​​CSI reporting scheme is an urgent problem to be solved. Summary of the Invention

[0006] This application provides a method and communication apparatus for sending or receiving information, which can reduce the performance loss of the communication system caused by the AI ​​CSI reporting scheme.

[0007] Firstly, a method for transmitting information is provided, executed by a communication device or a module for the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device), wherein the communication device may correspond to the terminal device in the method embodiment. The method may include: acquiring Channel State Information (CSI) reporting configuration information, the CSI reporting configuration information including rank restriction information, the rank restriction information indicating one or more candidate values ​​of rank; transmitting the CSI, wherein the CSI includes a rank indication RI, the RI being associated with a first candidate value among the one or more candidate values; and the CSI further including a first bitstream, the first bitstream being obtained based on the discarding and quantization of CSI codewords, the discarding being related to the first candidate value.

[0008] In the technical solution of this application, the network side configures a set of candidate values ​​for the rank, and the RI in the CSI reported by the terminal side is associated with one of these candidate values ​​(referred to as the first candidate value). The first candidate value indicates the number of layers used by the terminal side in reporting the CSI. Furthermore, the terminal side's discarding of codeword elements in the CSI codeword is related to the first candidate value. Depending on whether the first candidate value is 1 or greater than 1, the terminal side can adopt a corresponding scheme to discard codeword elements. Further, when the first candidate value is greater than 1, the terminal side can have further schemes to discard codeword elements for multiple layers. Based on the technical solution of this application, the situation where all CSI values ​​in a certain dimension might be lost under a priority-based CSI discarding scheme can be avoided, thus reducing system performance loss.

[0009] Optionally, when the network side configures multiple candidate values ​​for the rank, the RI in the CSI reported by the terminal side is associated with the first candidate value among these multiple candidate values. The first candidate value can be the candidate value among these multiple candidate values ​​whose signal-to-interference plus noise ratio (SINR) makes the Shannon capacity reach the highest.

[0010] In the CSI discarding process, as an example, the terminal side can discard codeword elements in the CSI codewords of each layer according to their contribution to the CSI reconstruction accuracy. For example, codeword elements can be discarded in order of their contribution to the CSI reconstruction accuracy from smallest to largest until the reporting overhead limit is reached.

[0011] In conjunction with the first aspect, in some implementations of the first aspect, the method includes: sending first information, the first information indicating a first candidate value.

[0012] In this implementation, when the network side is configured with multiple candidate values, the terminal side indicates the first candidate value associated with the RI in the reported CSI to the network side, so that the network side can perform dequantization and other processing on the first bitstream in the received CSI according to the first candidate value, such as grouping the first bitstream to correctly obtain the bitstream of each layer.

[0013] In conjunction with the first aspect, in some implementations of the first aspect, the first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

[0014] In this implementation, the terminal side quantizes the codeword elements retained in the CSI codeword discarding process based on the first candidate value being 1 or greater than 1, according to the number of quantized bits of the codeword elements of the CSI codeword, to obtain the first bitstream.

[0015] In conjunction with the first aspect, in some implementations of the first aspect, the CSI reporting configuration information also includes second information, which indicates the number of quantization bits.

[0016] In this implementation, when the number of quantized bits of a codeword element is determined by the terminal side, the terminal side reports the number of quantized bits to the network side, so that the network side can dequantize and perform other processing on the first bitstream in the received CSI.

[0017] In conjunction with the first aspect, in some implementations of the first aspect, the CSI reporting configuration information also includes the number of reported codeword elements.

[0018] In this implementation, "reported codeword elements" refer to the codeword elements retained during the CSI codeword discarding process, and are also the codeword elements ultimately reported by the terminal to the network. "Reported codeword elements" can also be referred to as the reported codeword length. When the number of reported codeword elements is determined autonomously by the terminal, the terminal indicates the number of reported codeword elements to the network so that the network can perform dequantization and other processing on the first bitstream in the received CSI.

[0019] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of 1, generating a first code stream based on the number of quantized bits, wherein the first code stream comes from M0 code word elements out of the M code word elements contained in the CSI codeword, and M0 is the number of reported code word elements.

[0020] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1; generating a first bitstream based on the number of quantized bits; the first bitstream containing r sub-bitstreams; the r sub-bitstreams corresponding one-to-one with r layers; the sub-bitstream of the i-th layer in the r layers originating from M0 codeword elements of the i-th layer; each of the r layers containing M codeword elements, where M0 is the number of reported codeword elements.

[0021] In the technical solution of this application, the first candidate value is 1 or greater than 1, representing the number of layers (i.e., the number of independent data streams) used by the terminal side to report CSI. The processing on the terminal side is different depending on whether one or more layers are used, as detailed in the embodiments.

[0022] In conjunction with the first aspect, in some implementations of the first aspect, the first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword, including: the first bitstream is obtained based on the first candidate value, the number of quantized bits, the type of the number of quantized bits, and the discarding and quantization of the CSI codeword.

[0023] In this implementation, besides the fact that the number of layers used by the terminal to report CSI can be one or more (corresponding to a first candidate value of 1 or greater than 1), the number of quantization bits of the CSI codeword element can also be one or more. The processing on the terminal side varies depending on the specific circumstances; please refer to the description in the embodiments for details.

[0024] In conjunction with the first aspect, in some implementations of the first aspect, the CSI reporting configuration information also includes third information, which indicates the type of the number of quantization bits.

[0025] In this implementation, when the type of quantization bits is determined by the terminal, the terminal reports the type of quantization bits to the network, facilitating the network to dequantize and perform other processing on the first bitstream in the received CSI. Optionally, the type of quantization bits can also be configured by the network to the terminal, or specified in the protocol.

[0026] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of 1, and the number of types of quantization bits being n, wherein the number of quantization bits corresponding to the CSI codeword is x. j M j Select from individual code elements The CSI codeword contains M codeword elements, ∑ j M j =M, j=1,2,…n, n is greater than or equal to 2; based on the types n of the quantization bit number, and the number of quantization bits corresponding one-to-one with the n types of quantization bit number, a first bitstream is generated, wherein the first bitstream contains n sub-bitstreams, and the j-th sub-bitstream of the n sub-bitstreams corresponds to the... Each code element.

[0027] In this implementation, when the first candidate value is 1 (i.e., rank=1), the codeword elements of the CSI codeword are discarded according to their contribution to the CSI reconstruction accuracy. This can avoid the situation where the entire CSI of a certain dimension may be lost under the priority-based discarding scheme.

[0028] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, r greater than 1, and the type of the number of quantized bits is one; generating a first bitstream, the first bitstream containing r sub-bitstreams, the r sub-bitstreams corresponding one-to-one with r layers, the bitstream of the i-th layer in the r layers coming from the M0 codeword elements of the i-th layer, and each of the r layers containing M codeword elements.

[0029] In this implementation, when the first candidate value is greater than 1 (i.e., rank is greater than 1), codeword elements can be discarded in the same way across different layers, simplifying the discarding process.

[0030] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1, and the type of the number of quantized bits is one; generating a first bitstream, the first bitstream containing r sub-bitstreams, the r sub-bitstreams corresponding one-to-one with r layers, and the sub-bitstream of the i-th layer among the r layers originating from the M of the i-th layer. i There are M codeword elements, and the i-th layer of the r layers contains M codeword elements.

[0031] In this implementation, when the first candidate value is greater than 1 (i.e., rank is greater than 1), the terminal side discards codeword elements according to their respective methods for different layers. For example, discarding or retaining codeword elements based on different attributes of each layer (i.e., each independent data stream) can ensure CSI reconstruction performance.

[0032] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1, and the number of quantization bits has n possible types; generating a first bitstream, the first bitstream containing r sub-bitstreams, each of the r sub-bitstreams corresponding to one of the r layers, wherein the sub-bitstream of the i-th layer originates from the i-th layer and has a corresponding number of quantization bits of x. j of There are codeword elements, wherein the i-th layer contains M. j There are 1, 2, ..., n codeword elements, where j = 1, 2, ..., n, and n is greater than or equal to 2.

[0033] In this implementation, when the first candidate value is greater than 1 (i.e., rank is greater than 1) and the codeword element has at least two quantization bit numbers, the terminal side supports discarding codeword elements in the same way for different quantization bit numbers at each layer, so as to simplify the discarding process.

[0034] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1, and the number of quantization bits is of n kinds; generating a first bitstream, the first bitstream containing r sub-bitstreams, the r sub-bitstreams corresponding one-to-one with r layers, wherein the sub-bitstream of the i-th layer in the r layers originates from the i-th layer and has a quantization bit count of x. j corresponding The i-th layer contains codeword elements. There are 1, 2, ..., n codeword elements, where j = 1, 2, ..., n, and n is greater than or equal to 2.

[0035] In this implementation, when the first candidate value is greater than 1 (i.e., rank is greater than 1) and the codeword element has at least two quantization bit numbers, the terminal side supports multiple layers to discard codeword elements in different ways for different quantization bit numbers. This can further ensure the flexibility of AI-based CSI reporting and the performance of CSI reconstruction.

[0036] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1, the type of the number of quantization bits is one, and the r layers corresponding to r adopt a first scheme to report the CSI, generating a first code stream, the first code stream containing r sub-code streams, the r sub-code streams corresponding one-to-one with the r layers, the code stream of the i-th layer in the r layers coming from the M0 codeword elements of the i-th layer, each of the r layers containing M codeword elements, wherein the first scheme indicates that in the discarding process of the CSI codeword, the number of codeword elements corresponding to the same number of quantization bits reported by the r layers is the same, and the reported codeword elements corresponding to the same number of quantization bits are in the same position among the M codeword elements of the corresponding layer.

[0037] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1; the number of quantization bits is of one type; and the r layers corresponding to r use a second scheme to report the CSI, generating a first bitstream. The first bitstream contains r sub-bitstreams, each of which corresponds to one of the r layers. The sub-bitstream of the i-th layer in the r layers originates from the M layer of the i-th layer. i There are M codeword elements in the r layers, where the i-th layer contains M codeword elements. The second scheme indicates that in the discarding process of the CSI codeword, the number of codeword elements corresponding to the same number of quantization bits reported by the r layers is different, and / or the reported codeword elements corresponding to the same number of quantization bits are in different positions among the M codeword elements in the corresponding layer.

[0038] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1; n types of quantization bit counts; and r layers corresponding to r employ a first scheme to report the CSI, generating a first bitstream. The first bitstream contains r sub-bitstreams, each of which corresponds to one of the r layers. The sub-bitstream of the i-th layer in the r layers originates from the i-th layer and has a corresponding quantization bit count of x. j of There are codeword elements, wherein the i-th layer contains M. j There are r codeword elements, j = 1, 2, ..., n, where n is greater than or equal to 2. The first scheme indicates that in the discarding process of the CSI codeword, the number of codeword elements corresponding to the same number of quantization bits reported by the r layers is the same, and the reported codeword elements corresponding to the same number of quantization bits are in the same position among the M codeword elements of the corresponding layer.

[0039] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: a first candidate value of r, where r is greater than 1; n types of quantization bit counts; and r layers corresponding to r employ a second scheme to report the CSI, generating a first bitstream. The first bitstream contains r sub-bitstreams, each of which corresponds to one of the r layers. The sub-bitstream of the i-th layer in the r layers originates from the i-th layer and has a quantization bit count of x. j corresponding The i-th layer contains codeword elements. There are r codeword elements, j = 1, 2, ..., n, where n is greater than or equal to 2. The second scheme indicates that in the discarding process of the CSI codeword, the number of codeword elements corresponding to the same number of quantization bits reported by the r layers is different, and / or the reported codeword elements corresponding to the same number of quantization bits are in different positions among the M codeword elements of the corresponding layer.

[0040] In the above implementation methods, when the terminal side uses multiple layers for CSI reporting, the discarding and / or quantization of codeword elements can be the same or different between different layers. For example, for multiple layers, the number of codeword elements retained for the same number of quantized bits can be the same or different, and the retained codeword elements can be located in the same or different positions. Some implementations can simplify the discarding process, while others can increase the flexibility of AI-based CSI reporting to ensure CSI reconstruction performance.

[0041] Secondly, a method for receiving information is provided, executed by a communication device or a module for the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device), wherein the communication device may correspond to the network device in the method embodiment. The method may include: sending Channel State Information (CSI) reporting configuration information, the CSI reporting configuration information including rank constraint information, the rank constraint information indicating one or more candidate values ​​of rank; receiving CSI, wherein the CSI includes a rank indication RI, the RI being associated with a first candidate value among the one or more candidate values; and the CSI further including a first bitstream, the first bitstream being obtained based on the discarding and quantization of CSI codewords, the discarding being related to the first candidate value.

[0042] The second aspect and its various implementations are network-side methods corresponding to the first aspect. Their beneficial technical effects can be found in the description of the first aspect or its corresponding implementations, and will not be repeated here.

[0043] In conjunction with the second aspect, in some implementations of the second aspect, the method includes: receiving first information, the first information indicating a first candidate value.

[0044] In conjunction with the second aspect, in some implementations of the second aspect, the first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

[0045] In conjunction with the second aspect, in some implementations of the second aspect, the CSI reporting configuration information also includes second information, which indicates the number of quantization bits.

[0046] In conjunction with the second aspect, in some implementations of the second aspect, the CSI reporting configuration information also includes the number of reported codeword elements.

[0047] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the rank constraint information indicating a candidate value, the candidate value being 1; dequantizing the first bitstream based on a number of quantization bits corresponding to the codeword elements of the CSI codeword to obtain M0 codeword elements; and padding the M0 codeword elements with zeros to obtain the CSI codeword, the CSI codeword containing M codeword elements.

[0048] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the rank constraint information indicating a candidate value, the candidate value being 1; and grouping the first code stream based on the number of n quantization bits corresponding to the codeword elements of the CSI codeword to obtain n first sub-code streams, wherein the number of quantization bits corresponding to the j-th sub-code stream among the n first sub-code streams is x. j n is greater than or equal to 2; for the n first sub-bit streams, respectively according to the corresponding number of quantization bits x j Dequantization is performed to obtain n second sub-bitstreams, where the number of quantized bits in the n second sub-bitstreams is x. j The second sub-stream contains Each of the n second sub-code streams is padded with zeros to obtain a codeword element containing M. j The third sub-code stream of n codeword elements; and concatenating the n third sub-code streams to obtain the CSI codeword, wherein the CSI codeword contains M codeword elements.

[0049] In conjunction with the second aspect, in some implementations of the second aspect, the first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword, including: the first bitstream is obtained based on the first candidate value, the number of quantized bits, the type of the number of quantized bits, and the processing, discarding, and quantization of the CSI codeword.

[0050] In conjunction with the second aspect, in some implementations of the second aspect, the CSI reporting configuration information further includes third information, which indicates the type of the number of quantization bits.

[0051] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the first candidate value is r, where r is greater than 1; based on one of the quantization bit numbers, the first code stream is divided into r first sub-code streams, each containing M0 codeword elements; dequantization is performed on the r first sub-code streams respectively to obtain r second sub-code streams, each containing M0 codeword elements; zero-padding is performed on the r second sub-code streams respectively to obtain r third sub-code streams, each containing M codeword elements; and the r third sub-code streams are concatenated to obtain the CSI codeword, the CSI codeword containing Mr codeword elements.

[0052] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the first candidate value is r, where r is greater than 1; the first bitstream is divided into r groups based on one of the quantization bit numbers, wherein the codeword length of the i-th group in the r groups is M. i x0 is the number of quantized bits; dequantization is performed on each of the r groups to obtain r first codewords, where the length of the i-th first codeword is M. i ; pad each of the r first codewords with zeros to obtain r second codewords, each second codeword having a length of M; and concatenate the r second codewords to obtain the CSI codeword, the CSI codeword containing Mr codeword elements.

[0053] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the first candidate value is r, where r is greater than 1; based on n possible quantization bit numbers, the first bitstream is divided into r first sub-bitstreams, each sub-bitstream having a length of... The number of quantized bits in the codeword element corresponding to each first sub-bitstream is x j The number of codeword elements; dividing each of the r first sub-codestreams into n groups, where the number of quantization bits in each n group is x. j The length of the group is For each of the r first sub-bitstreams corresponding to the n groups, dequantization is performed according to the number of quantization bits corresponding to each group to obtain the length of the codeword corresponding to each group. The length corresponding to each group is The codeword is padded with zeros to obtain a length of M. jThe second sub-codestream; for each of the r layers, concatenating all the second sub-codestreams to obtain r third sub-codestreams of length M; and concatenating the r third sub-codestreams to obtain the CSI codeword, the CSI codeword containing Mr codeword elements.

[0054] In conjunction with the second aspect, in some implementations of the second aspect, the method further includes: the first candidate value is r, where r is greater than 1; based on n possible quantization bit numbers, the first bitstream is divided into r first sub-bitstreams, wherein the length of the i-th first sub-bitstream among the r first sub-bitstreams is... in, Let x be the number of quantized bits in the i-th first sub-bit stream. j The number of codeword elements; dividing each of the r first sub-codestreams into n groups, where the number of quantization bits in each n group is x. j The length of the group is For each of the r first sub-bitstreams corresponding to n groups, dequantization is performed according to the number of quantization bits corresponding to each group, resulting in a length of [length missing] for each group. The codeword; the length corresponding to each group is The codeword is padded with zeros to obtain a length of The second sub-codestream; for each of the r layers, concatenating all the second sub-codestreams to obtain r third sub-codestreams of length M; and concatenating the r third sub-codestreams to obtain the CSI codeword, the CSI codeword containing Mr codeword elements.

[0055] In some implementations of the first or second aspect, the CSI codeword is obtained by processing a matrix composed of channel feature vectors based on an artificial intelligence (AI) encoder. This matrix is ​​determined by singular value decomposition (SVD) based on the measured CSI.

[0056] In some implementations of the first or second aspect, the CSI codeword is determined based on the reported configuration information.

[0057] In some implementations of the first or second aspect, the CSI reporting configuration information further includes fourth information, which indicates that the CSI reporting adopts a first scheme or a second scheme. The first scheme indicates that in the CSI codeword discarding process, the number of codeword elements corresponding to the same quantization bit number reported by the r layers is the same, and the codeword elements corresponding to the same quantization bit number are in the same position among the M codeword elements of the corresponding layer. The second scheme indicates that in the CSI codeword discarding process, the number of codeword elements corresponding to the same quantization bit number reported by the r layers is different, and / or the reported codeword elements corresponding to the same quantization bit number are in different positions among the M codeword elements of the corresponding layer.

[0058] Thirdly, a communication device is provided, the communication device having modules or means for implementing the methods of the first aspect or any possible implementation of the first aspect. The modules or means can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the aforementioned modules or means.

[0059] Fourthly, a communication device is provided, the communication device having modules or means for implementing the methods of the second aspect or any possible implementation of the second aspect. The modules or means can be implemented in hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the aforementioned modules or means.

[0060] Fifthly, a communication device is provided, comprising at least one processor configured to cause the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor is coupled to at least one memory for storing computer programs or instructions, and the at least one processor is configured to call and run the computer program or instructions from the at least one memory, causing the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor may be included in the communication device or may be configured outside the communication device. Optionally, the communication device further includes the at least one memory. Optionally, the communication device further includes at least one communication interface. As an example, the communication interface may include an input interface and / or an output interface, or may be an interface circuit.

[0061] Sixthly, a communication device is provided, comprising a communication interface and a circuit. The communication interface is configured to receive a signal to be processed and transmit the signal to the circuit. The circuit is configured to process the signal to perform a method as described in the first aspect or any possible implementation thereof; or to perform a method as described in the second aspect or any possible implementation thereof. Optionally, the communication interface is further configured to output a signal processed by the circuit. Optionally, the signal may include information and / or data. Optionally, the communication device may be a chip (e.g., a baseband chip) or a chip system.

[0062] A seventh aspect provides a computer-readable storage medium storing computer program code or instructions that, when executed on a computer, cause the method of the first aspect or any possible implementation thereof to be implemented; or, the method of the second aspect or any possible implementation thereof to be implemented.

[0063] Eighthly, a computer program product is provided, the computer program product comprising computer program code or instructions, which, when executed on a computer, cause the method in the first aspect or any possible implementation thereof to be implemented; or, as in the second aspect or any possible implementation thereof, the method to be implemented.

[0064] A ninth aspect provides a wireless communication system, including a communication device as described in the third aspect and a communication device as described in the fourth aspect. Attached Figure Description

[0065] Figure 1 is a schematic diagram of the AI ​​CSI reporting scheme.

[0066] Figure 2 shows an example of a communication system applicable to the technical solution of this application.

[0067] Figure 3 is a schematic flowchart of the method 300 for sending or receiving information provided in this application.

[0068] Figure 4 is a schematic diagram of a codeword element with rank equal to 1 and only one type of quantization bit count.

[0069] Figure 5 is a schematic diagram showing that rank is equal to 1 and the number of quantization bits of codeword elements is varied.

[0070] Figure 6 is a schematic diagram of a layer-common AI CSI reporting scheme with a rank greater than 1.

[0071] Figure 7 is a schematic diagram of a layer-specific AI CSI reporting scheme with a rank greater than 1.

[0072] Figure 8 is a schematic diagram of a layer-common AI CSI reporting scheme with a rank greater than 1.

[0073] Figure 9 is a schematic diagram of a layer-specific AI CSI reporting scheme with a rank greater than 1.

[0074] Figure 10 is a schematic block diagram of the communication device 1000 provided in this application.

[0075] Figure 11 is a schematic block diagram of another communication device 1100 provided in this application.

[0076] Figure 12 is a schematic structural diagram of the chip provided in this application.

[0077] Figure 13 is a schematic diagram of the system architecture of the communication device provided in this application. Detailed Implementation

[0078] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0079] In the fifth-generation radio access system standard New Radio (NR), downlink channel state information (CSI) plays a crucial role in system design as the receiver's estimation of the radio channel characteristics. User equipment (UE) reports the estimated CSI to the base station to optimize radio link performance. Specifically, the base station can use downlink CSI for adaptive modulation and coding, beamforming, and other methods to improve communication efficiency. UEs can report CSI via either the physical uplink shared channel (PUSCH) or the physical uplink control channel (PUCCH). Generally, the PUSCH can handle a larger CSI reporting overhead, while the PUCCH has relatively limited CSI reporting resources. However, regardless of whether CSI reporting is performed on the PUSCH or PUCCH, the problem of CSI discarding due to limited CSI reporting load remains.

[0080] The Channel State Information Reference Signal (CSI-RS) is a reference signal specifically used for channel measurement. The base station transmits the CSI-RS in the downlink, enabling the UE to perform channel estimation using the received CSI-RS. Based on the channel estimation results, the UE calculates the precoding matrix indicator (PMI), rank indicator (RI), and channel quality indicator (CQI), which together constitute the CSI. The CSI is divided into two parts: Part 1 and Part 2. Part 1 contains the mandatory information in the CSI, such as RI and CQI; Part 2 contains the partially discardable information in the CSI, such as PMI.

[0081] After the UE completes the CSI measurement, it needs to report the CSI to the base station. The reporting method depends on the configuration and application scenario. Specifically, CSI measurement reporting can be periodic, semi-persistent, or aperiodic.

[0082] 1) Periodic CSI reporting (P-CSI reporting): The base station configures the UE to perform periodic CSI reporting through higher-layer signaling, such as radio resource control (RRC) signaling. The UE performs channel measurement and interference measurement based on periodic CSI-RS resources and reports CSI feedback at fixed time intervals.

[0083] 2) Semi-persistent (or semi-static) CSI reporting (SP-CSI reporting): When a UE is configured to perform semi-persistent CSI reporting, the UE only begins CSI reporting after receiving downlink signaling from the base station and ends CSI reporting upon receiving the downlink signaling. Between these two downlink signaling transmission times, the UE performs periodic CSI measurements and reports. Semi-persistent CSI reporting can be carried by either PUSCH or PUCCH.

[0084] 3) Aperiodic CSI reporting (AP-CSI reporting): The base station first semi-statically configures multiple CSI reporting parameters for the UE through downlink RRC signaling, and triggers one or more of them to report through downlink control information (DCI). The UE performs CSI measurement according to the CSI reporting configuration parameters and reports the CSI measurement results using the physical layer uplink shared channel PUSCH.

[0085] In CSI reporting on the PUSCH, priority ranking of CSI reports is required. The reasons and purposes for prioritizing CSI reports include: the need for mapping order between different CSI reports; and the need to determine which CSI reports to retain and which to discard when uplink resources are insufficient. According to the priority ranking of CSI reports in NR Release 18, there are...

[0086] Pri iCSI (y,k,c,s)=2·N cells ·M s ·y+N cells ·M s ·k+M s ·c+s, where:

[0087] The value of y is determined by the type of CSI report. For aperiodic CSI (AP CSI) reports, y = 0; for semi-persistent CSI reports carried by PUSCH, y = 1; for semi-persistent CSI reports carried by PUCCH, y = 2; and for periodic CSI reports, y = 3.

[0088] The value of k is related to the content of the CSI report. When the CSI report contains L1-RSRP, that is, when the CSI report is beam-related, k = 0; when the CSI report does not contain L1-RSRP, that is, when the CSI report is non-beam-related, k = 1.

[0089] c is the index value of the serving cell, N cells These are high-level parameters: maximum number of serving cells (maxNrofServingCells);

[0090] s is the configuration identifier (reportConfigID) reported by CSI, M s This is a high-level parameter: the maximum number of CSI reporting configurations, maxNrofCSI-ReportConfigurations.

[0091] The priority parameter Pri is calculated based on the above formula. iCSIThe smaller the value of (y,k,c,s), the higher the priority of the corresponding CSI report.

[0092] When the uplink load of a CSI report is insufficient to carry the entire content of the CSI, CSI drops will occur. Part 1 has a fixed reporting overhead and contains the number of information bits of Part 2; the entire content of Part 1 is reported. After Part 1 reporting is completed, Part 2 is partially dropped and then reported again based on the uplink load.

[0093] AI-based CSI (hereinafter referred to as AI CSI) reporting scheme is an important method in CSI reporting.

[0094] Figure 1 is a schematic diagram of the AI ​​CSI reporting scheme. As shown in Figure 1, the AI ​​encoder f deployed on the UE side... enc (·) Encode the matrix V composed of channel feature vectors into floating-point digital words c, c = f enc (V), and then discarding codewords according to their importance based on the uplink load, leaving the remaining codewords. Through quantizer f quan (·) Quantized into a bit stream s and reported to the base station. The base station performs a dequantization operation f on the bit stream s. de-quan After (·) represents a floating-point digital character, it is sent to the AI ​​decoder f. dec (·) Reconstruct the matrix composed of channel feature vectors

[0095] According to the above process, for AI CSI reporting, the quantization configuration and codebook of codeword elements can be pre-aligned by the UE and the base station. However, AI CSI reporting still faces the possibility of CSI discarding. Since AI-encoded CSI codeword elements do not have actual physical meaning, the CSI discarding rules in codebook-based CSI reporting schemes cannot be directly applied. For AI-based CSI reporting, AI can assign different importance to different codeword elements; that is, some codeword elements may be more important than others. When CSI discarding occurs, retaining as many high-importance CSI codeword elements as possible can ensure a certain level of reconstruction accuracy.

[0096] In existing standards, CSI discarding is based on the physical meaning of the codebook. For example, in NR Release 18, CSI reporting on the PUSCH follows a certain priority rule, with a total of 2N. Rep Each reporting priority, N Rep This indicates the number of CSI reports carried on the PUSCH. The smaller the priority number, the higher the reporting priority. For the nth CSI report, it corresponds to N. Rep Each CSI report in PriiCSI The nth smallest (y,k,c,s) value should be reported.

[0097] In terms of reporting priority, NR's codebook schemes can be divided into two categories: different codebook schemes have different reporting schemes at the same priority; codebook schemes of the same category have the same reporting scheme at the same priority.

[0098] 1) Type II codebook: In the CSI reporting configuration, the codebook type is configured as "typeII-r16", "typeII-PortSelection-r16", "typeII-PortSelection-r17", "typeII-CJT-r18", "typeII-CJT-PortSelection-r18", "typeII-Doppler-r18", or "typeII-Doppler-PortSelection-r18".

[0099] 2) Second type of codebook: In the CSI reporting configuration, the codebook type is configured as "typeI-SinglePanel", or "typeI-MultiPanel", or "typeII", or "typeII-PortSelection".

[0100] For the first type of codebook, Part 2CSI is divided into 3 groups, and the contents of each group are shown in Table 1:

[0101] Table 1: Contents of the group in the first type of codebook

[0102] Where l = 1, ..., ν represents the layer index, and N4 represents the number of consecutive time slots.

[0103] The reporting rules for Part 2 CSI are shown in Table 2:

[0104] Table 2: Priority Reporting of Part 2 CSI

[0105] As shown in Tables 1 and 2, existing CSI discarding in standards is based on the physical meaning of the codebook. For example, the priority division rule for the first type of codebook is a group containing different parameters; the priority division rule for the second type of codebook is an odd / even subband. For codebook-based schemes, since the reported CSI has actual physical meaning, some CSI can be discarded according to preset rules. However, for AI CSI reporting, if a rule-based CSI discarding scheme is adopted, the reported CSI codeword elements do not have actual physical meaning, making it difficult to flexibly configure the discarding rules. Inappropriate discarding rules often result in the complete discarding of CSI in a certain dimension, causing significant performance loss to the communication system. Furthermore, when the codeword elements of the CSI codeword have different importance, the number of quantized bits for codeword elements of different importance may also be different. Therefore, how to report AI-based CSI with minimal performance loss to the communication system is a problem that urgently needs to be considered.

[0106] Therefore, this application provides a technical solution, which mainly involves how to discard CSI in an AI-based CSI reporting scheme so as to minimize the performance loss of the system.

[0107] The technical solution of this application is described in detail below.

[0108] The technical solutions of this application can be applied to various existing and future communication systems, including but not limited to: the 5th generation (5G) system or new radio (NR) system, long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD) system, satellite communication system, and future communication systems. Furthermore, they can also be applied to sidelink (SL) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and Internet of Things (IoT) communication systems or other communication systems, which are not limited herein.

[0109] Figure 2 illustrates an example of a communication system applicable to the technical solution of this application. As shown in Figure 2, the communication system may include one or more transmitters and one or more receivers. Optionally, one of the transmitters and receivers may be a terminal device, and the other may be a network device. The channel coding or decoding method provided in this application is applicable to communication between the network device and the terminal device shown in Figure 2, i.e., uplink communication or downlink communication. For example, in downlink communication, the transmitter in this embodiment is a network device, and the receiver is a terminal device; in uplink communication, the transmitter is a terminal device, and the receiver is a network device.

[0110] For example, a terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user apparatus. In the embodiments of this application, the terminal device may be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, in-vehicle equipment, etc. The terminal device in the embodiments of this application may be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. Optionally, the UE may be used as a base station. For example, the UE may act as a scheduling entity, providing sidelink signals between UEs in V2X or SL, etc.

[0111] In this embodiment, the device used to implement the functions of the terminal device can be the terminal device itself, or any device capable of supporting the terminal device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the terminal side and can be configured within or used in conjunction with the terminal device. The chip system can consist of chips or include chips and other discrete components. In this embodiment, the terminal device is used as an example to illustrate the device for implementing the corresponding functions of the terminal device.

[0112] The network device in this application embodiment may include a device for communicating with a terminal device. This network device may include an access network device or a radio access network device; for example, the network device may be a base station. In this application embodiment, the access network device may refer to a radio access network (RAN) node (or device) that connects the terminal device to the wireless network. A base station can broadly encompass, or be replaced by, various names such as: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, auxiliary station, motor slide retainer (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU) (also known as centralized unit or aggregation unit), distributed unit (DU), radio unit (RU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station can also be a mobile switching center, a device performing base station functions in D2D, V2X, and M2M communications, a network device (e.g., a base station) in a future communication network, or a device performing network device functions. A base station can support networks using the same or different access technologies. Optionally, a RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). The embodiments of this application do not limit the specific technology or device form used in the network equipment.

[0113] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0114] In some deployments, the network device in this application embodiment may be a device including a CU, or a DU, or a device including both CU and DU, or a control plane CU node (central unit-control plane (CU-CP)) and a user plane CU node (central unit-user plane (CU-UP)) and a DU node. For example, the network device may include gNB-CU-CP, gNB-CU-UP, and gNB-DU.

[0115] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes each implementing some of the base station's functions. For example, RAN nodes can be CUs, DUs, CU-CPs, CU-UPs, or RUs. CUs and DUs can be configured separately or included in the same network element, such as a BBU. RUs can be included in radio frequency equipment or radio frequency units, such as RRUs, AAUs, or RRHs.

[0116] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open radio access network (ORAN / O-RAN) system, CU can also be called an open CU (open CU, O-CU), and DU can also be called an open DU (open DU, O-DU). CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0117] In this embodiment, the device used to implement the functions of the network device can be the network device itself; it can also be a device capable of supporting the network device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the network side and can be configured within or used in conjunction with the network device. In this embodiment, only the network device is used as an example to illustrate the implementation of the corresponding functions of the network device.

[0118] Figure 3 is a schematic flowchart of a method 300 for sending or receiving information provided in this application. Method 300 involves network devices and terminal devices, and can be implemented by each of the network device and terminal device performing corresponding steps. Optionally, one or more steps in method 300 performed by a communication device (e.g., a network device or a terminal device) can be replaced by a device for the communication device (e.g., referred to as a first device). The first device can be a chip, processor, circuit, or AI entity serving the communication device, etc., applied to the communication device. The AI ​​entity can be deployed on or outside the communication device. The following embodiments use network devices and terminal devices as examples for description.

[0119] 310. The network device sends CSI reporting configuration information, and the terminal device receives the CSI reporting configuration information accordingly.

[0120] The configuration information reported by CSI includes rank restriction information, which indicates one or more candidate values ​​for the rank.

[0121] In the various embodiments of this application, rank refers to the number r of independent data streams that can be transmitted through a multiple-input multiple-output (MIMO) channel, that is, the PMI reported by the terminal side is associated with a matrix with r column vectors. One layer (stream) corresponds to one column vector in the matrix associated with the PMI.

[0122] As an example, rank constraint information can include a bitmap that indicates one or more candidate values ​​for the rank. Different candidate values ​​correspond to different numbers of independent data streams (r), or different layers, allowing the network to indicate any one or more layers through the bitmap. For instance, rank constraint information can include four bits, each corresponding to one of the four candidate rank values. A bit of 0 indicates that the rank corresponding to that bit does not support terminal-side reporting; a bit of 1 indicates that the rank corresponding to that bit allows terminal-side reporting.

[0123] For the sake of brevity, the CSI reporting configuration information in the following examples can also be simplified to "reporting configuration information".

[0124] 320. The terminal device sends a CSI to the network device.

[0125] The CSI includes a rank indicator (RI), which is associated with the first candidate value among one or more candidate values. The first candidate value can be any one of the one or more candidate values. For example, when the network side configures multiple candidate values, the terminal side can iterate through these multiple candidate values, calculate the Shannon capacity based on different candidate values ​​(i.e., different rank values) and their corresponding signal-to-interference-plus-noise ratio (SINR), and select the candidate value with the highest Shannon capacity as the first candidate value. In addition, the CSI also includes a first bitstream, which is obtained based on the discarding and quantization of CSI codewords. This discarding process is related to the first candidate value. The CSI codewords are determined based on the CSI reporting configuration information.

[0126] CSI codewords can also be expressed as AI CSI codewords, which refer to the CSI obtained by the terminal device through measurement reference signals based on the AI ​​encoder. In other words, the CSI codeword is the output of the AI ​​encoder when a matrix composed of channel feature vectors is used as input. This matrix is ​​determined based on the measured CSI. For example, in Figure 1, the matrix composed of channel feature vectors is matrix V, and the output of the AI ​​encoder is the CSI codeword in this embodiment. As an example, the matrix V composed of channel feature vectors can be formed by performing singular value decomposition (SVD) on the CSI of each sub-band, taking the first rank of feature vectors, and then concatenating them along the frequency dimension. For example, suppose H = [H1, H2, ... H...]. K ] indicates that there are K subbands. N represents t One transmitting antenna, N r One receiving antenna, for H i Do SVD: λ i Sort by size in descending order and take the first rank of largest λ values. i The corresponding v i That is, the feature vector of subband i; then v i The concatenation results in matrix V = [v1, v2, ... v2]. K ].

[0127] Optionally, method 300 further includes step 330.

[0128] 330. The terminal device sends the first information, which indicates the first candidate value.

[0129] The network device receives the first information.

[0130] The first information is used to indicate to the network side the candidate value associated with the RI in the CSI reported by the terminal side. This candidate value is any one of one or more candidate values ​​configured by the network side in the CSI reporting configuration information. It can be understood that when the network side configures only one candidate value, method 300 may not include step 330; that is, when the network side configures only one candidate value, it is assumed that the RI in the CSI reported by the terminal side can only be associated with that candidate value. In this case, the candidate value configured by the network side is the first candidate value. When the network side configures multiple candidate values, for example, two or more candidate values, the terminal side indicates to the network side the candidate value associated with the RI in the reported CSI, i.e., the first candidate value, so that the network side can process the received CSI accordingly based on the first candidate value.

[0131] As described above, the rank constraint information indicates one or more candidate values ​​for the rank. Each candidate value represents the number of independent data streams that can be transmitted through the MIMO channel when the terminal device reports CSI, and also represents how many column vector matrices the PMI reported by the terminal device is associated with. This matrix can correspond to the matrix V composed of channel feature vectors in Figure 1. The RI in the CSI reported by the terminal device is associated with the first candidate value. When the first candidate value is equal to 1, it means rank = 1; when the first candidate value is greater than 1, it means rank is greater than 1. In the embodiments below, r is used to represent the value of rank, where r is a positive integer equal to or greater than 1.

[0132] In the specific implementation, the first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

[0133] In this embodiment, quantization can refer to the mapping of the set of values ​​of codeword elements of a CSI codeword to a finite set of letters, such as the mapping of the quantization levels of the values ​​of codeword elements of a CSI codeword. Therefore, the number of quantization bits refers to the number of bits required to describe one codeword element of a CSI codeword.

[0134] Optionally, method 300 further includes steps 340 to 350.

[0135] 340. The terminal device generates a first bitstream based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

[0136] 350. The network device processes the first bitstream based on the first candidate value and the number of quantized bits of the codeword elements of the CSI codeword.

[0137] As mentioned above, the discarding of CSI codewords is related to the first candidate value. For example, a first candidate value equal to 1 or greater than 1 corresponds to one or more layers used by the terminal to report CSI. Based on whether the first candidate value is 1 or greater than 1, the terminal uses the corresponding scheme to discard codeword elements of the CSI codeword. Optionally, when the first candidate value is greater than 1, the terminal can also use the same or different methods to discard codewords across multiple layers. For example, when the first candidate value is equal to 1, the terminal's processing is illustrated in the following example; or, when the first candidate value is greater than 1, the terminal's processing is illustrated in Example 2 or Example 3 below, as detailed in the following description.

[0138] In steps 340-350, the number of quantized bits in the codeword elements of the CSI codeword is aligned on the terminal side or the network side. There are several implementation methods for this; for example, the number of quantized bits may be specified in the protocol, or the network side may send configuration information to the terminal side via CSI reporting. Alternatively, in another implementation, the number of quantized bits may be determined by the terminal side and reported to the network side.

[0139] Furthermore, the CSI codeword discarding process is performed on the terminal side. However, during this process, the total length of the CSI codewords for each layer (i.e., the number of codeword elements M contained in the CSI codeword) can be semi-statically configured by the network side via RRC signaling or specified by the protocol. Based on this, in one implementation, the number of codeword elements discarded or retained by each layer during the CSI codeword discarding process on the terminal side can be specified by the protocol or configured by the network side in the CSI reporting configuration information. In these implementations, the terminal side does not need to report the number of codeword elements retained by each layer to the network side. Alternatively, in another implementation, the number of codeword elements discarded or retained by each layer is determined by the terminal side itself. In this implementation, the terminal side needs to report the number of codeword elements discarded or retained by each layer to the network side so that the network side can process the received CSI accordingly based on this information. For any layer, after the terminal side discards CSI codewords, the codeword elements finally reported to the network side are called "reported codeword elements," which are relative to the total number of codeword elements for that layer. When the RI in the CSI reported by the terminal side is used to indicate that the rank is equal to 1, it means that there is only one layer. In this case, each layer refers to that single layer.

[0140] The number of quantization bits for codeword elements based on CSI codewords can be one or more types, and the first candidate value can be equal to or greater than 1, with multiple possible cases. For example, when there is only one type of quantization bit number, the terminal generates a first bitstream based on the first candidate value, that number of quantization bits, the discarding process of the CSI codeword, and the quantization of the retained codeword elements; the network processes the first bitstream based on the first candidate value and that number of quantization bits. When there are multiple types of quantization bits, the terminal generates a first bitstream based on the first candidate value, multiple quantization bit numbers, the discarding process of the CSI codeword, and the quantization of the retained codeword elements; the network processes the first bitstream based on the first candidate value and all multiple quantization bit numbers. The processing on the terminal and network sides differs under these different conditions, which will be explained in detail below.

[0141] Example 1

[0142] When the RI in the CSI reported by the terminal is used to indicate r=1, that is, when the first candidate value associated with the RI in the CSI is 1, the processing procedure of the terminal and the network is as follows.

[0143] 1. Terminal-side processing

[0144] 1) When the codeword elements of a CSI codeword have the same number of quantization bits x0 (i.e., the number of quantization bits for each codeword element is the same):

[0145] The terminal retains M0 codeword elements from a CSI codeword of total length M, based on the importance of the codeword elements. For example, it may retain the first M0 codeword elements, the last M0 codeword elements, or any M0 codeword elements at any of the M codeword elements in the CSI codeword. Here, the total length M of the CSI codeword indicates that the CSI codeword contains M codeword elements. M0 represents the codeword length reported by the terminal, or the number of reported codeword elements, or the number of codeword elements retained during the CSI codeword discarding process.

[0146] In one implementation, the reported codeword length M0 can be obtained by looking up a table. Confirmed. For example, surface It contains a total of q elements, so for the table The length of the codewords contained therein can be indicated on the terminal side using k bits. For example, codeword length k=2. For example, 00 represents a codeword length of 6, 01 represents a codeword length of 12, 10 represents a codeword length of 24, and 11 represents a codeword length of 48. Another example is the table... Each bit supports reporting. The length of the codeword in the code.

[0147] Figure 4 illustrates a case where rank equals 1 and the number of quantization bits for each codeword element is unique. As shown in Figure 4, the CSI codeword contains M codeword elements, and the terminal retains M0 codeword elements from these M elements. The terminal quantizes these M0 codeword elements based on the number of quantization bits x0 to obtain the first bitstream. Alternatively, the terminal discards (M-M0) codeword elements from the M codeword elements. The CSI reported by the terminal includes the first bitstream (or is represented as bitstream s). Specifically, Part 2 of the CSI includes bitstream s.

[0148] Optionally, in one implementation, the terminal side also reports the codeword length M0 reported by the terminal side, that is, the number of reported codeword elements M0. In this case, Part 1 of the CSI contains information indicating the reported codeword length M0. It should be noted that "reported codeword length" or "reported number of codeword elements" is relative to the total codeword length of the CSI codeword, and refers to the number of remaining codeword elements after subtracting discarded codeword elements from the total M codeword elements contained in the CSI codeword.

[0149] Alternatively, in another implementation, the CSI reporting configuration information includes second information indicating the number of quantization bits in the codeword elements of the CSI codeword. The number of quantization bits may differ in different examples; for example, some examples may have only one type of quantization bit, while others may have more than one type, such as two or more. Therefore, the number of quantization bits indicated by the second information may also differ in different examples, possibly indicating only one type of quantization bit or multiple types of quantization bit numbers, as detailed in the descriptions of each example.

[0150] As can be seen, in Example 1, in the implementation of reporting codeword length M0 on the terminal side, the terminal side reports M0 and the bitstream s (i.e., the first bitstream) obtained by encoding CSI by the AI ​​encoder. The reporting overhead is O = M0x0 + k, O ≤ p, where p represents the size of the PMI reporting payload. When the reported codeword length M0 is known on the network side, for example, if the codeword length M0 is configured in the CSI reporting configuration information or specified in the protocol, the terminal side does not need to report the codeword length M0 to the network side, and the reporting overhead is smaller. In this case, the reporting overhead only involves the overhead of bitstream s, that is, the reporting overhead O = M0x0, O ≤ p.

[0151] 2) When the codeword elements of a CSI codeword have at least two different numbers of quantization bits, for example, if the at least two numbers of quantization bits are represented as x1, x2, ..., the terminal-side processing procedure is as follows:

[0152] On the terminal side, the number of quantization bits is x, based on the importance of codeword elements. j M j Each code element is retained. Each codeword element, for example: retaining M j The first of the code elements Each code element or retain the last one A codeword element, or a corresponding quantization bit number of x. j M j Any codeword element Each code element. Among them, It is a positive integer greater than 0. Where, ∑ j M j =M, j=1,2,…n (n≥2), where n represents the number of types of quantization bits. As an example, the reported codeword length... You can look up the table For details, please refer to the corresponding explanation for the case where the codeword element corresponds to a certain number of quantization bits x0, which will not be repeated here.

[0153] Figure 5 illustrates a codeword with rank equal to 1 and multiple quantization bits for its elements. As shown in Figure 5, a CSI codeword contains M codeword elements, and the terminal reserves M1 codeword elements with a quantization bit count of x1. M2 codeword elements are reserved for a quantization bit count of x2. Each codeword element is processed in turn. The terminal side quantizes the retained codeword elements according to the corresponding number of quantization bits to obtain the first bitstream, or bitstream s. Bitstream s is included in Part 2 of CSI.

[0154] Optionally, in one implementation, the terminal side also reports the codeword length reported by the terminal side, i.e., the number of codeword elements. At this point, Part 1 of the CSI contains information for indicating the codeword length. The information indicates that when there are n types of quantization bits, there are also n types of reported codeword lengths. Part 1 contains information indicating the n types of codeword lengths, where the corresponding number of quantization bits is x. j The reported codeword length is

[0155] Reporting on the terminal side In the implementation method, the terminal side reports And the bitstream s obtained by encoding CSI by the AI ​​encoder, reporting overhead. O ≤ p. Since there are n possible quantization bits, the terminal indicates the reported codeword length to the network. The overhead is nk, where k is the overhead of one of the n quantization bit counts. When the reported codeword length... In cases where this is known, for example, the reported codeword length When configured in the CSI reporting configuration information or specified in the protocol, the reporting overhead is reduced. In this case, the reporting overhead only involves the overhead of bitstream s, i.e., the reporting overhead is minimal. O≤p.

[0156] Optionally, before discarding CSI codewords, the terminal first determines the size p of the PMI reporting payload and the codeword length M corresponding to each layer. As an example, the terminal can determine the size p of the PMI reporting payload through signaling interaction with the network side, for example, dynamically based on downlink control information (DCI) signaling or semi-statically based on radio resource control (RRC) signaling. Optionally, the codeword length M (i.e., the total number of codeword elements contained in the CSI codeword) corresponding to each layer (only one layer in Example 1) can be semi-statically determined through RRC signaling. Alternatively, in this embodiment, the length of the code stream of a certain layer, also called code length or codeword length, refers to the number of codeword elements contained in the CSI codeword of that layer.

[0157] 2. Network-side processing:

[0158] The network side receives the CSI from the terminal side, and the CSI contains a bit stream s. The network side processes the bit stream s based on the first candidate value and the number of quantized bits.

[0159] 1) If the codeword elements of a CSI codeword have the same number of quantization bits x0:

[0160] The network side performs dequantization on the bitstream s to obtain M0 codeword elements; then zeros are padded to the M0 codeword elements to obtain a bitstream with a codeword length of M.

[0161] 2) If the codeword elements of a CSI codeword have at least two different numbers of quantization bits, such as x1, x2, ..., the network side processing is as follows:

[0162] The bitstream s is grouped according to the type of quantization bit count of codeword elements, as described on the terminal side. If there are n types of quantization bit counts, then they are divided into groups with a length of... There are n groups, where n is the number of different types of quantization bits;

[0163] For each group of bits, the number of quantized bits corresponding to its codeword elements is x. j Perform dequantization to obtain n codewords, where the number of quantized bits in each of the n codewords is x. j The length of the codeword is

[0164] Padding each of the n codewords with zeros yields n bitstreams, where the number of quantized bits in each of the n bitstreams is x. j The length of the bitstream is M j ;as well as,

[0165] Concatenate n groups of code streams sequentially to obtain a code stream of total length M. For example, concatenate according to the number of quantization bits corresponding to each codeword, codeword c = [c1, c2, ...], where codeword c j The number of quantized bits in the non-zero portion is x j .

[0166] Example 2

[0167] When the RI in the reported CSI is used to indicate r>1, that is, when the first candidate value associated with the RI in the CSI is greater than 1, the PMI to be reported on the terminal side corresponds to r column vectors, and each column vector corresponds to the CSI of a stream (layer). At this time, a CSI discarding rule is designed for the reporting of AI CSI for each layer.

[0168] In the embodiments of this application, regarding the AI ​​CSI reporting scheme, in one implementation, the same AI CSI reporting scheme is set for each layer, which also represents a common (i.e., layer-common) AI CSI reporting scheme (also known as a layer-common AI CSI reporting scheme), that is, r column vectors use the same AI CSI reporting scheme, referred to as the "layer-common AI CSI reporting scheme"; in another implementation, different AI CSI reporting schemes are set for different layers, which also represents a specific (i.e., layer-specific) AI CSI reporting scheme (also known as a layer-specific AI CSI reporting scheme), that is, r column vectors use a specific (or their respective) AI CSI reporting scheme. In a layer-specific AI CSI reporting scheme, it is not required that the AI ​​CSI reporting schemes used by the r column vectors are different from each other. For example, the AI ​​CSI reporting schemes used by the r column vectors can be different from each other, or some column vectors can use the same AI CSI reporting scheme, while some column vectors can use an AI CSI reporting scheme that is different from any other column vector.

[0169] For the sake of brevity in the following embodiments, in each embodiment, the scheme of "setting the same AI CSI reporting scheme for each layer" is described as the first scheme (or scheme 1) or "layer-common AI CSI reporting scheme"; and the scheme of "setting different AI CSI reporting schemes for different layers" is described as the second scheme (or scheme 2) or "layer-specific AI CSI reporting scheme".

[0170] As an example, taking r layers as an example, the first scheme can also be described as follows: in the CSI codeword discarding process, the number of codeword elements corresponding to the same quantization bit number reported by the r layers is the same, and the reported codeword elements corresponding to the same quantization bit number are in the same position among the M codeword elements of the corresponding layer; the second scheme can also be described as follows: in the CSI codeword discarding process, the number of codeword elements corresponding to the same quantization bit number reported by the r layers is different, and / or the codeword elements corresponding to the same quantization bit number are in different positions among the M codeword elements of the corresponding layer.

[0171] When using Scheme 1 or Scheme 2, the number of quantization bits of the codeword elements based on AI CSI codewords can be one or more types, with the following different implementation processes.

[0172] ① Assume that CSI codewords have the same number of quantization bits x0.

[0173] 1. Terminal-side processing:

[0174] 1) The terminal side adopts a layer-common AI CSI reporting scheme.

[0175] For layer i, the terminal side retains M0 codeword elements of a CSI codeword of total length M. That is, M0 codeword elements are selected from the M codeword elements and discarded. Here, i = 1, 2, ..., r. For example, the first M0 codeword elements or the last M0 codeword elements can be retained. In one implementation, the reported codeword length M0 can be obtained by looking up a table. The codeword length M0 can be supported by k bits for reporting; see the relevant explanation in Example 1.

[0176] Figure 6 illustrates a layer-common AI CSI reporting scheme with a rank greater than 1. As shown in Figure 6, taking four layers as an example (layer 1 to layer 4), each layer's CSI codeword contains M codeword elements. For each layer, the UE retains M0 codeword elements. Furthermore, Figure 6 uses scheme 1, where all layers retain the same number of codeword elements, and these retained codeword elements come from the same position among the M codeword elements of their respective layers. For example, in Figure 6, each of the four layers retains four codeword elements, all from the first four positions of their respective layers.

[0177] On the terminal side, based on the number of quantized bits x0 corresponding to layer i, the M0 codeword elements retained by layer i are quantized using AI to obtain the bitstream s. i In this example, since all layers adopt a layer-common AI CSI reporting scheme, the terminal side reserves M0 codeword elements for all layers. Therefore, if the terminal side indicates the number of codeword elements to be reported, the cost of indicating the number of codeword elements to be reported is k. The cost of the bitstream of each layer is M0x0, so the cost of the bitstream of r layers is M0x0r. It should be understood that the first bitstream in method 300 is the sum of the bitstreams of r layers, denoted as bitstream s. For layer i = 1, 2, ... r, if the terminal side reports the reported codeword length M0, the reporting cost of the terminal side involves the cost of indicating the number of codeword elements to be reported and the cost of the bitstream s corresponding to layer i. i Then the total reporting overhead for r layers is O = M0x0r + k ≤ p, O ≤ p. When the reported codeword length (i.e., the number of codeword elements reported or retained during the CSI codeword discarding process) is configured in the CSI reporting configuration information or specified in the protocol, the reporting overhead is smaller. In this case, the reporting overhead only involves the bitstream s.i If the overhead is less than or equal to p, report the overhead O = M0x0, where O ≤ p.

[0178] 2) The terminal side adopts a layer-specific AI CSI reporting scheme

[0179] For layer i, the terminal side retains M0 codeword elements of the CSI codeword with a total length of M, that is, M0 codeword elements are selected and retained from the M codeword elements of the CSI codeword of layer i. For example, retain the first M codeword elements or the last M codeword elements. Here, i = 1, 2,... r, M is a positive integer greater than 0, and 0 < M0 < M. In one implementation, the reported codeword length M can be determined by looking up a table, and the codeword length M can be supported by k bits for reporting. See the relevant description in Example 1. i codeword elements, for example, retain the first M codeword elements or the last M i codeword elements, where i = 1, 2,..., r, M i is a positive integer greater than 0, 0 < M i < M. In one implementation, the reported codeword length M i < M. In one implementation, the reported codeword length M i can be determined by looking up a table, and the codeword length M i can be supported by k bits for reporting. See the relevant description in Example 1.

[0180] Figure 7 is a schematic diagram of a case where the rank is greater than 1 and the layer-specific AI CSI reporting scheme is adopted. As shown in Figure 7, taking 4 layers as an example, they are respectively represented as layer 1 to layer 4, and the CSI codeword of each layer contains M codeword elements. For layer i, the terminal side retains M i codeword elements. In Figure 7, Scheme 2 is adopted, that is, the number of codeword elements retained by each layer may be different from that of other layers, and / or the positions of the codeword elements retained by each layer are different from those of other layers. In Figure 7, it is taken as an example that the first M i codeword elements of the CSI codeword are retained for each layer. In fact, in Scheme 2, the M i codeword elements retained by each layer can come from any M i positions among the M codeword elements of this layer.

[0181] The terminal side quantizes the M i codeword elements retained by layer i based on AI according to the quantization bit number x0 corresponding to layer i, and obtains the bit stream s i . The first code stream in Method 300 is the sum of the bit streams of r layers, denoted as the bit stream s. For layer i = 1, 2,... r, if the terminal side reports M i and the bit stream s obtained by the AI encoder processing the CSI under layer i iThen the total reporting cost of r layers is O = ∑ i M i x0+rk, O≤p. Furthermore, in the reported codeword length... In implementations where CSI reporting configuration information is configured or specified in the protocol, the reporting overhead is smaller. In this case, the reporting overhead only involves the overhead of bitstream s, i.e., reporting overhead O = ∑ i M i x0, O≤p.

[0182] Optionally, before discarding CSI codewords, the terminal side first determines the size p of the PMI reporting load and the codeword length M corresponding to each layer. See the relevant explanation in Example 1.

[0183] 2. Network-side processing:

[0184] The network side receives CSI from the terminal side, and the CSI contains bit stream s.

[0185] 1) If the terminal side adopts the layer-common AI CSI reporting scheme

[0186] The network-side processing procedure is as follows:

[0187] The bitstream s is grouped by layer. Since in the layer-common AI CSI reporting scheme, each layer reports M0 codeword elements from the terminal side, and the number of quantization bits for each codeword element is only x0, the terminal side groups the bitstream s by layer to obtain r groups of first sub-bitstreams. The length of each first sub-bitstream is M0x0, and each first sub-bitstream contains M0 codeword elements.

[0188] Perform dequantization on each of the first sub-bitstreams in the r-group first sub-bitstreams to obtain the r-group second sub-bitstreams. Each second sub-bitstream contains M0 codeword elements.

[0189] Pad each of the r groups of second sub-codestreams with zeros to obtain r groups of third sub-codestreams, each group containing M codeword elements; and,

[0190] Concatenate the third sub-codestreams of group r in sequence to obtain a codestream of length Mr. For example: Concatenate the third sub-codestreams of group r codewords of length M according to their respective layers to obtain codeword c = [c 1 ,c 2 [,…], where the codeword corresponding to layer i (or the i-th stream) is c i .

[0191] 2) If the UE uses a layer-specific AI CSI reporting scheme

[0192] The bitstream s is grouped by layer. Because in the layer-specific AI CSI reporting scheme, the number of codeword elements reported by the terminal side in each layer is not exactly the same, with layer i retaining M codeword elements. i There are r groups, and the number of quantization bits for a codeword element is only one type, x0. Therefore, the bitstream s is divided into r groups according to the layer, and the lengths of these r groups are M1x0, M2x0, ..., M... i x0, ..., M r x0;

[0193] Dequantize each of the r groups of bitstreams to obtain r groups of codewords, where the length of the i-th codeword is M. i ;

[0194] Pad each of the r codeword groups with zeros to obtain r codeword groups of length M; and,

[0195] Concatenate r groups of codewords of length M in sequence to obtain a codeword of total length Mr. For example, concatenate r groups of codewords of length M according to their respective layers to obtain codeword c = [c 1 ,c 2 [,…], where the codeword corresponding to layer i is c i .

[0196] Example 3

[0197] ② Assume that the CSI codeword has at least two different numbers of quantization bits, such as x1, x2, ...

[0198] 1. Terminal-side processing:

[0199] 1) The terminal side adopts a layer-common AI CSI reporting scheme.

[0200] For layer i, the terminal side has a quantization bit count of x. j M j Each code character is retained. Each code element, among which A positive integer greater than or equal to 0. Where ∑ j M j = M, i = 1, 2, ..., r, j = 1, 2, ..., n (n ≥ 2). In one implementation, the reported codeword length This can be obtained by looking up a table; see the relevant explanation in Example 1.

[0201] Figure 8 illustrates a layer-common AI CSI reporting scheme with a rank greater than 1. As shown in Figure 8, taking four layers as an example, they are represented as layer 1 to layer 4. Each layer's CSI codeword contains M codeword elements. For layer i, the UE is defined as x quantized bits. j M j Each code element is retained. Each codeword element. For example, the UE reserves a codeword element with x1 quantized bits. Each codeword element is reserved for codeword elements with a quantization bit count of x2. Each code element, and so on.

[0202] On the terminal side, based on the number of quantized bits corresponding to layer i (x1, x2, ...), the codeword elements retained by each layer are quantized using AI to obtain the bitstream s. i In method 300, the first bitstream is the sum of the bitstreams of r layers, denoted as bitstream s.

[0203] For layer i = 1, 2, ..., r, if the UE reports and the bitstream s corresponding to layer i i The total reporting cost for r layers is... Similar to the other embodiments described above, for layer i, if the reported codeword length If the information is known to the network side, the terminal side will not indicate it to the network side. At this point, the reporting overhead is smaller, with the reporting overhead for r layers being lower.

[0204] 2) The terminal side adopts a layer-specific AI CSI reporting scheme.

[0205] For layer i, the terminal side has a quantization bit count of x. j of Each code character is retained. For example, a code word. The first of the codes individual code elements or the last Each code element, among which... A positive integer greater than or equal to 0. Reported codeword length This can be determined by looking up a table, where... i=1,2,…r, j=1,2,…n (n≥2).

[0206] Figure 9 illustrates a layer-specific AI CSI reporting scheme with a rank greater than 1. As shown in Figure 9, taking four layers as an example, they are represented as layer 1 to layer 4. For layer 1, the terminal side uses a quantization bit count of x1. Each code element is retained. Each codeword element has a quantization bit count of x2. Each code element is retained. Each codeword element is quantized, and so on; for layer 2, the terminal side has a quantization bit count of x1. Each code element is retained. Each codeword element has a quantization bit count of x2. Each code element is retained. Each code element, and so on.

[0207] The terminal side, based on the number of quantization bits corresponding to layer i (x1, x2, ...), reserves the following values ​​for layer i using AI: Each codeword element is quantized to obtain the bitstream s. i In method 300, the first bitstream is the sum of the bitstreams of r layers, denoted as bitstream s. For layers i = 1, 2, ..., r, if the terminal reports the codeword length... and the bitstream s corresponding to layer i i The total reporting cost for r layers is... O≤p. Optionally, if the reported codeword length If the information is known to the network side, the terminal side will not indicate it to the network side. At this point, the reporting overhead is smaller, involving only bit stream s. i The reporting cost of r layers is...

[0208] Optionally, before discarding CSI codewords, the terminal side first determines the size p of the PMI reporting load and the codeword length M corresponding to each layer. See the relevant explanation in Example 1.

[0209] 2. Network-side processing:

[0210] The network side receives CSI from the terminal side, and CSI contains bit stream s.

[0211] 1) If the UE adopts the layer-common AI CSI reporting scheme

[0212] The network-side processing procedure is as follows:

[0213] The bitstream s is grouped according to layer. In the layer-common AI CSI reporting scheme, for each layer, the number of quantized bits for codeword elements varies, and each number of quantized bits corresponds to a certain number of codeword elements. Specifically, for layer i, the number of quantized bits is x. j M j Each code character is retained. There are 10 codeword elements. Therefore, the network side groups the bitstream s according to layers, resulting in a bitstream of length 10 ... This indicates that the number of quantization bits in each layer is x. j The length of the bit stream;

[0214] Further, each bitstream is grouped according to the number of quantization bits in the codeword elements, that is, each bitstream is divided into groups of length [missing information]. There are n groups, where n is the number of different types of quantization bits.

[0215] In each layer, for each of the above n bitstreams, the number of quantization bits x of its codeword elements is calculated separately. j Perform dequantization to obtain a code length of The code words;

[0216] For each group of code lengths The codewords are padded with zeros to obtain a code length of M. j The code words;

[0217] In each layer, the code length of each group is M. j The codewords are concatenated sequentially to form a codeword of length M. For example, concatenation is performed according to the number of quantization bits of each codeword element to obtain the codeword. Among them, code words The number of quantized bits from layer i, which is non-zero, is x. j ;as well as,

[0218] By concatenating the codewords from each layer in sequence, a bitstream of total length Mr is obtained. For example, concatenating the codewords according to their corresponding layers yields codeword c = [c 1 ,c 2 ,…],where c i This indicates the codeword originating from layer i.

[0219] 2) If the UE uses a layer-specific AI CSI reporting scheme

[0220] The network-side processing procedure is as follows:

[0221] The bitstream s is grouped according to layer. Because in layer-specific AI CSI reporting schemes, the number of quantized bits for each codeword element varies for each layer, the number of codeword elements reported by the terminal for each quantized bit number also differs. For layer i, the terminal reports codeword elements with quantized bits x. j of Each code character is retained. 1 codeword. Therefore, the network side groups the bitstream s according to layers, resulting in a bitstream of length 10 ... This indicates that the number of quantization bits in each layer is x. j The length of the bit stream;

[0222] Further, each bitstream is grouped according to the number of quantization bits in the codeword elements, that is, each bitstream is divided into groups of length [missing information]. There are n groups, where n is the number of different types of quantization bits.

[0223] In each layer, for each of the above n bitstreams, the number of quantization bits x of its codeword elements is calculated separately. j Perform dequantization to obtain a code length of The code words;

[0224] For each group of code lengths The codewords are padded with zeros to obtain the original code length as follows: The code words;

[0225] Under each layer, the code length of each group is... The codewords are concatenated sequentially to form a codeword of length M. For example, they are concatenated according to the number of quantization bits of the codeword elements to obtain the codeword. Among the code words For layer i, the number of quantized bits in its non-zero portion is x. j ,as well as,

[0226] Concatenate the codewords from each layer in order to obtain the codeword of total length Mr. For example, concatenate the codewords according to their corresponding layers to obtain codeword c = [c 1 ,c 2 ,…], where the code word c i This indicates the codeword originating from layer i.

[0227] The above describes the processing procedures on the terminal side and the network side for various cases where rank = 1 or rank is greater than 1, the number of quantization bits is one or more, and when rank is greater than 1, r layers adopt Scheme 1 (i.e., layer-common AI CSI reporting) or Scheme 2 (i.e., layer-specific AI CSI reporting).

[0228] Optionally, in one implementation, if the set of rank candidate values ​​indicated by the rank restriction information in the CSI reporting configuration information contains only one candidate value, and that candidate value is rank=1, then the terminal side and the network side adopt the corresponding processing procedure described in Example 1; or, if the set of rank candidate values ​​indicated by the rank restriction information contains a candidate value greater than 1, that is, a candidate value with rank greater than 1, then the CSI reporting configuration information may contain indication information of the AI ​​CSI reporting scheme (referred to as the fourth information in this application embodiment), and the fourth information is used to indicate that the AI ​​CSI reporting scheme adopted by the terminal side is scheme 1 or scheme 2.

[0229] In another possible implementation, the network side and the terminal side default to using a layer-common AI CSI reporting scheme, i.e., scheme 1. However, when the network side needs to use a layer-specific AI CSI reporting scheme based on the detection of the current channel environment or channel resources, for example, when the PMI reporting load size p∈[p...], the implementation is different. min ,p max When the network side instructs the terminal side to adopt a layer-specific reporting scheme, i.e., scheme 2, through signaling, the network side will use signaling to instruct the terminal side to adopt a layer-specific reporting scheme.

[0230] In another possible implementation, for each CSI report from the terminal, the network side determines which AI CSI reporting scheme to use by detecting the current channel environment or channel resources. For example, it determines this by detecting the size p of the PMI reporting load, and instructs the terminal side to use either Scheme 1 or Scheme 2 AI CSI reporting scheme via signaling.

[0231] In summary, in the technical solution of this application, the terminal side discards codeword elements of the CSI codeword based on the value of the first candidate value associated with the RI in the reported CSI, which is 1 or greater than 1. When the first candidate value is greater than 1, the codeword elements are discarded based on the number of quantized bits and the types of quantized bits. For example, codeword elements can be discarded based on the contribution of CSI reconstruction accuracy. This can avoid the situation where all CSI in a certain dimension may be lost under the priority-based CSI discarding scheme, and can reduce the performance loss of the system.

[0232] The above provides a detailed description of the method for sending or receiving information provided in this application. The following describes the corresponding communication device.

[0233] Figure 10 is a schematic block diagram of the communication device 1000 provided in this application. As shown in Figure 10, the communication device 1000 may include a processing module 1001 and a communication module 1002. The communication device 1000 may be a terminal device, or a communication device applied to or used in conjunction with a terminal device to achieve the corresponding functions of the terminal device, such as a processor, chip, circuit, or AI entity. Alternatively, the communication device 1000 may be a network device, or a communication device applied to or used in conjunction with a network device to achieve the corresponding functions of the network device, such as a processor, chip, circuit, or AI entity.

[0234] The communication module can also be called a transceiver module, transceiver, transceiver machine, or transceiver device. The processing module can also be called a processor, processing board, processing unit, or processing device. Optionally, the communication module is used to perform the sending and receiving operations on the terminal device side or network device side in the above method. The device in the communication module that implements the receiving function can be regarded as a receiving unit, and the device in the communication module that implements the sending function can be regarded as a sending unit. That is, the communication module includes a receiving unit and a sending unit. When the communication device 1000 is applied to a network device or a terminal device, the processing module 1001 can be used to implement the processing functions of the network device or terminal device in the embodiments of Figures 3 to 9, and the communication module 1002 can be used to implement the sending and receiving functions of the network device or terminal device. For example, when applied to the network side, the communication module 1002 can be used to send CSI reporting configuration information, receive CSI, etc.; the processing module 1001 can be used to: process the first code stream contained in the received CSI based on the first candidate value, etc. When the communication device 1000 is applied to the terminal side, the communication module 1002 can be used to: receive CSI reported configuration information, send CSI, etc.; the processing module 1001 can be used to: generate a first code stream based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

[0235] Furthermore, it should be noted that the aforementioned communication module and / or processing module can be implemented through virtual modules. For example, the processing module can be implemented through software functional units or virtual devices, and the communication module can be implemented through software functions or virtual devices. Alternatively, the processing module or communication module can also be implemented through physical devices. For example, if the device is implemented using a chip / chip circuit, the communication module can be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operation) and output operations (corresponding to the aforementioned sending operation); the processing module is an integrated processor, microprocessor, or integrated circuit.

[0236] The module division in this application is illustrative and represents only one logical functional division. In actual implementation, other division methods are possible. Furthermore, the functional modules in the various examples of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware, as software functional modules, or a combination of hardware and software.

[0237] Figure 11 is a schematic block diagram of another communication device 1100 provided in this application. Optionally, the communication device 1100 may be a chip or a chip system. Optionally, in this application, the chip system may be composed of chips or may include chips and other discrete devices.

[0238] The communication device 1100 can be used to implement the functions of any of the network elements (e.g., network devices or terminal devices) described in the foregoing embodiments. The communication device 1100 may include at least one processor 1110. Optionally, the processor 1110 is coupled to a memory, which may be located within the communication device 1100, integrated with the processor, or located outside the communication device 1100. As an example, the communication device 1100 may also include at least one memory 1120. The memory 1120 stores the necessary computer programs (or computer instructions) and / or data for implementing the corresponding functions of any of the network elements in any of the above method embodiments; the processor 1110 may execute the computer programs stored in the memory 1120 to complete the methods implemented by any of the network elements in any of the above method embodiments.

[0239] The communication device 1100 may also include a communication interface 1130, through which the communication device 1100 can interact with other devices. For example, the communication interface 1130 may be a transceiver, circuit, bus, module, pin, or other type of communication interface. When the communication device 1100 is a chip-based device or circuit, the communication interface 1130 in the device 1100 may also be an input / output circuit, capable of inputting information (or receiving information) and outputting information (or sending information). The processor may be an integrated processor, a microprocessor, an integrated circuit, or a logic circuit, and the processor can determine the output information based on the input information.

[0240] The coupling in this application refers to indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 1110 may operate in conjunction with the memory 1120 and the communication interface 1130. This application does not limit the specific connection medium between the processor 1110, the memory 1120, and the communication interface 1130.

[0241] Optionally, as shown in Figure 11, the processor 1110, the memory 1120, and the communication interface 1130 are interconnected via a bus 1140. The bus 1140 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one line is used to represent the bus 1140 in Figure 11, but this does not mean that there is only one bus or one type of bus.

[0242] In one implementation, the communication device 1100 can be applied to the network side, such as the network device in the embodiments of this application. Specifically, the communication device 1100 can be a network device, or it can be a device capable of supporting the network device to implement the corresponding functions of the network device in any of the above method embodiments. The memory 1120 stores computer programs (or computer instructions) and / or data that implement the corresponding functions of the network device. The processor 1110 can execute the computer programs or instructions stored in the memory 1120 to complete the methods executed by the network device in any of the above method embodiments. The communication interface in the communication device 1100 can be used to interact with terminal devices.

[0243] In another implementation, the communication device 1100 can be applied to the terminal side. For example, the communication device 1100 can be a terminal device, or an apparatus capable of supporting the terminal device and implementing the corresponding functions of the terminal device in any of the above method embodiments. The memory 1120 stores computer programs (or computer instructions) and / or data that implement the corresponding functions of the terminal device in any of the above method embodiments. The processor 1110 can execute the computer program stored in the memory 1120 to complete the method executed by the terminal device in any of the above method embodiments. The communication interface in the communication device 1100 can be used to interact with network devices (e.g., base stations), such as sending information to or receiving information from network devices.

[0244] Figure 12 is a schematic structural diagram of the chip provided in this application. Chip 30 includes circuit 31 and communication interface 32. Circuit 31 can be a logic circuit, integrated circuit, etc., and communication interface 32 can also be called an input / output circuit, input / output interface, interface circuit, etc., which can input information (or receive information) or output information (or send information). Chip 30 can execute the methods executed by network devices or terminal devices in the various embodiments of this application. Circuit 31 can be one or more processors, or all or part of the circuitry in one or more processors used for control or processing.

[0245] Figure 13 is a schematic diagram of the system architecture of the communication device provided in this application. The input / output control module manages the input and output signals of the communication device (e.g., network device or terminal device). For example, the input / output control can be one or more forms such as a modem, keyboard, mouse, or touchscreen. The input / output control may also be part of the processor. The communication device establishes communication connections with other devices through the communication control module. The receiver / transmitter is used to communicate with other devices. The receiver / transmitter may include a modem for modulating information (transmitting device) or demodulating modulated information (receiving device). The antenna is used to transmit or receive signals. Storage can be used to store computer code, which can be executed by the processor to implement the corresponding functions of the communication device. The processor may include intelligent hardware devices such as a general-purpose processor, digital signal processor (DSP), central processing unit (CPU), field-programmable gate array (FPGA), graphics processing unit (GPU), neural network processor (NNF), etc. The communication device shown in Figure 13 can be a network device or a terminal device in the embodiments of this application.

[0246] In addition, this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause operations and / or processes performed by a terminal device or network device in the various method embodiments of this application to be executed.

[0247] This application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processes performed by a terminal device or network device in the various method embodiments of this application are executed.

[0248] This application also provides a chip including a processor, and a memory for storing a computer program, disposed independently of the chip. The processor executes the computer program stored in the memory, such that operations and / or processes performed by a terminal device or network device in any method embodiment are executed. Further, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Further, the chip may also include a memory.

[0249] This application also provides a chip, which may include circuitry and an input / output interface. The circuitry may be logic circuitry, integrated circuits, etc., and exemplaryly, the circuitry may be one or more processors, or all or part of the circuitry in one or more processors used to implement one or more processing, control, or computing functions. The input / output interface may also be an input / output circuit, or an interface circuit, capable of inputting information (or receiving information) and / or outputting information (or sending information). The chip may include a chip system. Optionally, the chip system may be composed of chips or may include chips and other discrete devices. The chip can be used to execute the methods implemented by terminal devices or network devices in the various embodiments of this application. Optionally, the chip may be a baseband chip, also known as a modem.

[0250] Furthermore, this application provides a communication system, including the terminal device and network device in any embodiment of this application. This communication system can implement the method for sending or receiving information provided in any of the embodiments shown in Figures 3 to 9.

[0251] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0252] The processor in this application embodiment has signal processing capabilities and may include intelligent hardware devices, such as general-purpose processors, digital signal processors (DSPs), central processing units (CPUs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), graphics processing units (GPUs), neural processing units (NPUs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in this application can be directly implemented by the hardware processor, or implemented by a combination of hardware and software modules within the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0253] In the embodiments of this application, memory is any other medium capable of carrying or storing desired program code in the form of instructions or data structures, and accessible by a computer, but is not limited thereto. The memory in this application can also be a circuit or any other means capable of implementing a storage function for storing computer programs and / or data; or, it can also be a circuit or any other means capable of implementing a storage function for storing computer programs and / or data. As an example, memory can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which serves as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, the types described above or any other suitable types of memory.

[0254] The technical solutions provided in this application can be implemented in whole or in part through software, hardware, firmware, or any combination thereof. When implemented using software, they can be implemented in whole or in part as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a terminal device, an access network device, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media, etc.

[0255] In the embodiments of this application, "at least one" refers to one or more items. "More than one" means two or more items. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone.

[0256] The term "comprising" and any variations thereof used in the embodiments of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the steps or units listed, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0257] In this application, examples may reference each other without logical contradiction. For example, methods and / or terms between method embodiments may reference each other, functions and / or terms between device embodiments may reference each other, and functions and / or terms between device examples and method examples may reference each other.

[0258] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0259] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0260] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

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

[0262] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for sending information, characterized in that, include: Obtain Channel State Information (CSI) reporting configuration information, wherein the CSI reporting configuration information includes rank constraint information, and the rank constraint information indicates one or more candidate values ​​for the rank; Send CSI, where, The CSI includes a rank indicator RI, which is associated with a first candidate value among the one or more candidate values; and The CSI also includes a first bitstream, which is obtained based on the discarding and quantization of CSI codewords, and the discarding process is related to the first candidate value.

2. The method according to claim 1, characterized in that, The CSI codeword is obtained by processing a matrix composed of channel feature vectors based on an artificial intelligence (AI) encoder. The channel feature vectors are determined based on the measured CSI.

3. The method according to claim 1 or 2, characterized in that, The method includes: Send a first message, which indicates the first candidate value.

4. The method according to any one of claims 1-3, characterized in that, The first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

5. The method according to claim 4, characterized in that, The CSI reporting configuration information also includes second information, which indicates the number of quantization bits.

6. The method according to claim 4 or 5, characterized in that, The CSI reporting configuration information also includes the number of reported codeword elements.

7. The method according to any one of claims 4-6, characterized in that, The method further includes: The first candidate value is 1. Based on the number of quantized bits, the first code stream is generated. The first code stream comes from M0 codeword elements out of the M codeword elements contained in the CSI codeword, where M0 is the number of reported codeword elements.

8. The method according to any one of claims 4-6, characterized in that, The method further includes: The first candidate value is r, where r is greater than 1. Based on the number of quantization bits, the first bitstream is generated. The first bitstream contains r sub-bitstreams, each of which corresponds to one of the r layers. The sub-bitstream of the i-th layer in the r layers comes from M0 codeword elements of the i-th layer. Each of the r layers contains M codeword elements, where M0 is the number of reported codeword elements.

9. The method according to any one of claims 4-6, characterized in that, The first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword, including: The first bitstream is obtained based on the first candidate value, the number of quantized bits, the type of the number of quantized bits, and the discarding and quantization of the CSI codeword.

10. The method according to claim 9, characterized in that, The CSI reporting configuration information also includes third information, which indicates the type of the number of quantization bits.

11. The method according to claim 9 or 10, characterized in that, The method further includes: The first candidate value is 1, and there are n types of quantization bit numbers, with x being the number of quantization bits corresponding to the CSI codeword. j M j Select from individual code elements The CSI codeword contains M codeword elements, ∑ j M j =M, j=1,2,…n, n is greater than or equal to 2; Based on the types n of quantization bit counts and the number of quantization bits corresponding one-to-one with the n types of quantization bit counts, a first bitstream is generated, wherein the first bitstream contains n sub-bitstreams, and the j-th sub-bitstream among the n sub-bitstreams corresponds to the... Each code element.

12. The method according to claim 9 or 10, characterized in that, The method further includes: The first candidate value is r, where r is greater than 1, and the type of the number of quantized bits is one. The first bitstream is generated, which contains r sub-bitstreams. The r sub-bitstreams correspond one-to-one with r layers. The bitstream of the i-th layer in the r layers comes from the M0 codeword elements of the i-th layer. Each of the r layers contains M codeword elements.

13. The method according to claim 9 or 10, characterized in that, The method further includes: The first candidate value is r, where r is greater than 1, and the type of quantization bit count is only one. A first bitstream is generated, comprising r sub-bitstreams. Each of the r sub-bitstreams corresponds to one of the r layers. The sub-bitstream of the i-th layer originates from the M-th layer. i There are M codeword elements, and the i-th layer of the r layers contains M codeword elements.

14. The method according to claim 9 or 10, characterized in that, The method further includes: The first candidate value is r, where r is greater than 1, and there are n possible types of quantization bits. A first bitstream is generated, containing r sub-bitstreams. Each of the r sub-bitstreams corresponds to one of the r layers. The sub-bitstream of the i-th layer originates from the i-th layer and has x quantization bits. j of There are codeword elements, wherein the i-th layer contains M. j There are 1, 2, ..., n codeword elements, where j = 1, 2, ..., n, and n is greater than or equal to 2.

15. The method according to claim 9 or 10, characterized in that, The method further includes: The first candidate value is r, where r is greater than 1, and there are n possible types of quantization bit counts. A first bitstream is generated, containing r sub-bitstreams. Each of the r sub-bitstreams corresponds to one of the r layers. The sub-bitstream of the i-th layer originates from the i-th layer and has a quantization bit count of x. j corresponding The i-th layer contains codeword elements. There are 1, 2, ..., n codeword elements, where j = 1, 2, ..., n, and n is greater than or equal to 2.

16. The method according to any one of claims 1-15, characterized in that, The CSI codeword is determined based on the reported configuration information.

17. A method for receiving information, characterized in that, include: The channel state information (CSI) reporting configuration information is sent, which includes rank constraint information, and the rank constraint information indicates one or more candidate values ​​for the rank. Receive CSI, where, The CSI includes a rank indicator RI, which is associated with a first candidate value among the one or more candidate values; and The CSI also includes a first bitstream, which is obtained based on the discarding and quantization of CSI codewords, and the discarding process is related to the first candidate value.

18. The method according to claim 17, characterized in that, The CSI codeword is obtained by processing a matrix composed of channel feature vectors based on an artificial intelligence (AI) encoder. The channel feature vectors are determined based on the measured CSI.

19. The method according to claim 17 or 18, characterized in that, The method includes: Receive first information, which indicates the first candidate value.

20. The method according to any one of claims 17-19, characterized in that, The first bitstream is obtained based on the first candidate value, the number of quantized bits of the codeword elements of the CSI codeword, and the discarding and quantization of the CSI codeword.

21. The method according to claim 20, characterized in that, The CSI reporting configuration information also includes second information, which indicates the number of quantization bits.

22. The method according to claim 20 or 21, characterized in that, The CSI reporting configuration information also includes the number of reported codeword elements.

23. A communication device, characterized in that, include: The processing module is used to obtain Channel State Information (CSI) reporting configuration information, wherein the CSI reporting configuration information includes rank constraint information, and the rank constraint information indicates one or more candidate values ​​for the rank; as well as A communication module is configured to transmit a CSI, wherein the CSI includes a rank indicator RI associated with a first candidate value among the one or more candidate values; and the CSI further includes a first bitstream obtained by discarding and quantizing CSI codewords, the discarding being related to the first candidate value.

24. A communication device, characterized in that, include: Communication module, used for: The system transmits Channel State Information (CSI) reporting configuration information, which includes rank constraint information indicating one or more candidate values ​​for the rank; and... Receive CSI, wherein the CSI includes a rank indicator RI associated with a first candidate value among the one or more candidate values; and the CSI further includes a first bitstream obtained by discarding and quantizing CSI codewords, the discarding being related to the first candidate value.

25. A communication device, characterized in that, The system includes a communication interface and circuitry. The communication interface is used to acquire information required to perform the method as described in any one of claims 1-16, and to send the information to the circuitry, which is used to perform the method as described in any one of claims 1-16 based on the received information; or... The communication interface is used to acquire information required to perform the method as described in any one of claims 17-22, and to send the information to the circuit, which is used to perform the method as described in any one of claims 17-22 based on the received information.

26. A communication device, characterized in that, It includes a module or unit for performing the method as described in any one of claims 1-16; or, it includes a module or unit for performing the method as described in any one of claims 17-22.

27. A communication device, characterized in that, The device includes a processor coupled to a memory, the processor being configured to execute a computer program or instructions stored in the memory to cause the communication device to perform the method as described in any one of claims 1-16, or to perform the method as described in any one of claims 17-22.

28. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, implement the method as described in any one of claims 1-16, or implement the method as described in any one of claims 17-22.

Images