CN111435862B

CN111435862B - Transmission method, terminal and network equipment for Channel State Information (CSI) report

Info

Publication number: CN111435862B
Application number: CN201910133911.4A
Authority: CN
Inventors: 施源
Original assignee: Vivo Mobile Communication Co Ltd
Current assignee: Vivo Mobile Communication Co Ltd
Priority date: 2019-02-22
Filing date: 2019-02-22
Publication date: 2023-07-21
Anticipated expiration: 2039-02-22
Also published as: CN111435862A

Abstract

The invention discloses a transmission method, a terminal and network equipment of Channel State Information (CSI) report, wherein the method comprises the following steps: transmitting a Channel State Information (CSI) report to a network device; wherein, in the case that at least two quantization accuracies are available, the CSI report carries: and indication information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of at least two quantization precision, the quantization precision being used for quantization of coefficients in the coefficient matrix. When the terminal reports the CSI report to the network equipment, the CSI report carries the indication information for indicating the quantity of the quantized coefficients adopting the first quantization precision, and the network equipment determines the size of the second partial load according to the indication information after receiving the CSI report, so that the network equipment can accurately acquire the channel state.

Description

Transmission method, terminal and network equipment for Channel State Information (CSI) report

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method, a terminal, and a network device for transmitting a CSI report.

Background

In a wireless communication system, feedback of channel state information (Channel State Information, CSI) is enhanced, and CSI feedback is in two ways, type one and type two. Wherein type two employs spatial orthogonal baseline combining (Linear Combination, LC) to approximate CSI, such as eigenvalue vectors of the channel. Specifically, L orthogonal beams are selected from the oversampled two-dimensional discrete fourier transform (2-Dimentional Discrete Fourier Transform,2D DFT) beams, the combination coefficients (complex numbers) of the L orthogonal beams corresponding to each layer (or each eigenvalue vector) are calculated, and the amplitude values, phase values, and/or phase angle values thereof are quantized. Where L is configured for the network device, the selection of orthogonal beams is bandwidth based and is applicable to all ranks (rank), i.e. to all layers. The amplitude quantization of the combined coefficients may be configured as bandwidth quantization or bandwidth quantization and subband quantization, wherein the bandwidth quantization is indicated when the subband amplitude (subband Amplitude) is false (false) and the bandwidth quantization and subband quantization are indicated when the subband amplitude is true (wire). Phase angle quantization of the combined coefficients is done on each subband.

Further, CSI reports corresponding to CSI feedback type two may be written as a matrix with codebook writing of 2 lxr at frequency domain granularity m.

If the combined coefficients at all frequency domain granularity are concatenated together, a precoding matrix of layer r at the frequency domain can be obtained, which can be written as a 2L M matrix.

In order to reduce CSI feedback overhead, the 2 lxm matrix may be compressed into a 2 lxk compressed matrix by using methods such as frequency domain compression of frequency domain correlation, time domain compression of sparsity of time domain impulse response, and frequency domain difference.

Specifically, the CSI report includes a first portion (part 1) and a second portion (part 2), in which part1 and part2 are encoded separately, and the payload size of part2 is determined by part 1. Wherein, part1 has fixed load size, specifically includes: rank Indication (RI), channel quality Indication (Channel Quality Indication, CQI), and a number of non-zero amplitude combining coefficients per layer bandwidth. part2 includes a precoding matrix indicator (Precoding Matrix Indicator, PMI). For the above compressed matrix, it is necessary to indicate which coefficients are needed to be fed back in the matrix by a two-dimensional bitmap (bitmap), where the number of coefficients needed to be fed back is K1. The dimension of a bitmap is consistent with the compressed matrix, wherein the bitmap may be 2lx (unrestricted bitmap) or l×k (polarization restricted bitmap). When the bitmap is l×k, the compression matrix is divided into a first L rows and a second L rows, and the bitmap of the second L rows is the same as the bitmap of the first L rows, so that the bitmap dimension is halved. The bitmaps of each layer can be the same or different.

The terminal needs to feed back K1 coefficients, and needs to dynamically quantize the K1 coefficients, but the number of the dynamically quantized coefficients is not a determined value, and the load size of part2 cannot be determined only according to K1 indicated by the number of non-zero amplitude combination coefficients of each layer of bandwidth.

Disclosure of Invention

The embodiment of the invention provides a transmission method, a terminal and network equipment of Channel State Information (CSI) reports, which are used for solving the problem that the size of part2 load cannot be determined after a coefficient compression matrix is dynamically quantized.

In a first aspect, an embodiment of the present invention provides a method for transmitting a CSI report, applied to a terminal, including:

transmitting a Channel State Information (CSI) report to a network device;

wherein, in case at least two quantization accuracies are available, the CSI report carries: and indication information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of at least two quantization precision, the quantization precision being used for quantization of coefficients in the coefficient matrix.

In a second aspect, an embodiment of the present invention provides a terminal, including:

a sending module, configured to send a channel state information CSI report to a network device; wherein, in case at least two quantization accuracies are available, the CSI report carries: and indication information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of at least two quantization precision, the quantization precision being used for quantization of coefficients in the coefficient matrix.

In a third aspect, an embodiment of the present invention provides a terminal, where the terminal includes a processor, a memory, and a computer program stored in the memory and running on the processor, and the computer program when executed by the processor implements the steps of the method for transmitting a CSI report.

In a fourth aspect, an embodiment of the present invention further provides a method for transmitting a CSI report, which is applied to a network device side, and includes:

receiving a Channel State Information (CSI) report; the CSI report includes: indication information indicating the number of quantized coefficients employing a first quantization accuracy for quantization of coefficients in the coefficient matrix.

In a fifth aspect, an embodiment of the present invention provides a network device, including:

a receiving module, configured to receive a CSI report; the CSI report includes: indication information indicating the number of quantized coefficients employing a first quantization accuracy for quantization of coefficients in the coefficient matrix.

In a sixth aspect, an embodiment of the present invention provides a network device, where the network device includes a processor, a memory, and a computer program stored on the memory and running on the processor, and the processor implements the steps of the method for transmitting a CSI report according to the channel state information when executing the computer program.

In a seventh aspect, an embodiment of the present invention provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of a method for transmitting channel state information CSI reports as described in the claims.

In this way, when the terminal in the embodiment of the invention reports the CSI report to the network device, the CSI report carries the indication information indicating the number of quantization coefficients adopting the first quantization precision, and the network device determines the second partial load size according to the indication information after receiving the CSI report, so as to be beneficial to the network device to accurately acquire the channel state.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments of the present invention will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 shows a block diagram of a mobile communication system to which an embodiment of the present invention is applicable;

fig. 2 is a flow chart illustrating a method for transmitting a CSI report according to an embodiment of the present invention;

FIG. 3 is a schematic block diagram of a terminal according to an embodiment of the present invention;

FIG. 4 shows a block diagram of a terminal according to an embodiment of the invention;

fig. 5 is a schematic diagram of a transmission method Liu Chenghai of a CSI report of a network device according to an embodiment of the present invention;

fig. 6 is a schematic block diagram of a network device according to an embodiment of the present invention;

fig. 7 shows a block diagram of a network device according to an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

The terms first, second and the like in the description and in the claims, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. "and/or" in the specification and claims means at least one of the connected objects.

The techniques described herein are not limited to long term evolution (Long Term Evolution, LTE)/LTE evolution (LTE-Advanced, LTE-a) systems and may also be used for various wireless communication systems such as code division multiple access (Code Division Multiple Access, CDMA), time division multiple access (Time Division Multiple Access, TDMA), frequency division multiple access (Frequency Division Multiple Access, FDMA), orthogonal frequency division multiple access (Orthogonal Frequency Division Multiple Access, OFDMA), single-carrier frequency division multiple access (Single-carrier Frequency-Division Multiple Access, SC-FDMA), and other systems. The terms "system" and "network" are often used interchangeably. A CDMA system may implement radio technologies such as CDMA2000, universal terrestrial radio access (Universal Terrestrial Radio Access, UTRA), and the like. UTRA includes wideband CDMA (Wideband Code Division Multiple Access, WCDMA) and other CDMA variants. TDMA systems may implement radio technologies such as the global system for mobile communications (Global System for Mobile Communication, GSM). OFDMA systems may implement radio technologies such as ultra mobile broadband (Ultra Mobile Broadband, UMB), evolved UTRA (E-UTRA), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, flash-OFDM, and the like. UTRA and E-UTRA are parts of the universal mobile telecommunications system (Universal Mobile Telecommunications System, UMTS). LTE and higher LTE (e.g., LTE-a) are new UMTS releases that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-a and GSM are described in the literature from an organization named "third generation partnership project" (3rd Generation Partnership Project,3GPP). CDMA2000 and UMB are described in the literature from an organization named "third generation partnership project 2" (3 GPP 2). The techniques described herein may be used for the systems and radio technologies mentioned above as well as for other systems and radio technologies. However, the following description describes an NR system for purposes of example, and NR terminology is used in much of the description below, although the techniques may also be applied to applications other than NR system applications.

The following description provides examples and does not limit the scope, applicability, or configuration as set forth in the claims. Changes may be made in the function and arrangement of elements discussed without departing from the spirit and scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For example, the described methods may be performed in an order different than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

Referring to fig. 1, fig. 1 is a block diagram of a wireless communication system to which an embodiment of the present invention is applicable. The wireless communication system includes a terminal 11 and a network device 12. The terminal 11 may also be referred to as a terminal Device or a User Equipment (UE), and the terminal 11 may be a terminal-side Device such as a mobile phone, a tablet (Tablet PersonalComputer), a Laptop (Laptop Computer), a personal digital assistant (Personal Digital Assistant, PDA), a mobile internet Device (Mobile Internet Device, MID), a Wearable Device (Wearable Device), or a vehicle-mounted Device, which is not limited to a specific type of the terminal 11 in the embodiment of the present invention. The network device 12 may be a base station or a core network, where the base station may be a 5G or later version base station (e.g., a gNB, a 5G NR NB, etc.), or a base station in other communication systems (e.g., an eNB, a WLAN access point, or other access points, etc.), where the base station may be referred to as a node B, an evolved node B, an access point, a base transceiver station (Base Transceiver Station, BTS), a radio base station, a radio transceiver, a basic service set (Basic Service Set, BSS), an extended service set (Extended Service Set, ESS), a node B, an evolved node B (eNB), a home node B, a home evolved node B, a WLAN access point, a WiFi node, or some other suitable terminology in the field, and the base station is not limited to a specific technical vocabulary, and it should be noted that, in the embodiment of the present invention, only the base station in the NR system is exemplified, but not limited to the specific type of the base station.

The base stations may communicate with the terminal 11 under the control of a base station controller, which may be part of the core network or some base stations in various examples. Some base stations may communicate control information or user data with the core network over a backhaul. In some examples, some of these base stations may communicate with each other directly or indirectly over a backhaul link, which may be a wired or wireless communication link. A wireless communication system may support operation on multiple carriers (waveform signals of different frequencies). A multicarrier transmitter may transmit modulated signals on the multiple carriers simultaneously. For example, each communication link may be a multicarrier signal modulated according to various radio technologies. Each modulated signal may be transmitted on a different carrier and may carry control information (e.g., reference signals, control channels, etc.), overhead information, data, and so on.

The base station may communicate wirelessly with the terminal 11 via one or more access point antennas. Each base station may provide communication coverage for a respective corresponding coverage area. The coverage area of an access point may be partitioned into sectors that form only a portion of that coverage area. A wireless communication system may include different types of base stations (e.g., macro base stations, micro base stations, or pico base stations). The base station may also utilize different radio technologies, such as cellular or WLAN radio access technologies. The base stations may be associated with the same or different access networks or operator deployments. The coverage areas of different base stations, including coverage areas of the same or different types of base stations, coverage areas utilizing the same or different radio technologies, or coverage areas belonging to the same or different access networks, may overlap.

The communication link in the wireless communication system may include an Uplink for carrying Uplink (UL) transmissions (e.g., from the terminal 11 to the network device 12) or a Downlink for carrying Downlink (DL) transmissions (e.g., from the network device 12 to the terminal 11). UL transmissions may also be referred to as reverse link transmissions, while DL transmissions may also be referred to as forward link transmissions. Downlink transmissions may be made using licensed bands, unlicensed bands, or both. Similarly, uplink transmissions may be made using licensed bands, unlicensed bands, or both.

The embodiment of the invention provides a transmission method of Channel State Information (CSI) reports, which is applied to a terminal side, as shown in fig. 2, and comprises the following steps:

step 21: and sending a Channel State Information (CSI) report to the network equipment.

Wherein, in case at least two quantization accuracies are available, the CSI report carries: and indication information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of at least two quantization precision, the quantization precision being used for quantization of coefficients in the coefficient matrix. Specifically, the CSI report includes a first portion (Part 1) and a second portion (Part 2), the payload size of the second portion being determined from the first portion; in the case where at least two quantization resolutions are available, the first portion includes: and adopting the indication information of the number of quantized coefficients of the first quantization precision, wherein the first quantization precision is one of at least two quantization precision, and the quantization precision is used for quantization of the coefficients in the coefficient matrix.

Wherein at least two quantization accuracy cases are available, including but not limited to:

1. the network equipment configures at least two quantization accuracies for the terminal; that is, the network device configures at least two quantization resolutions to the terminal, and then, when the terminal performs CSI feedback, the Part1 carries indication information indicating the number of quantization coefficients using a first quantization accuracy, which is one of the at least two quantization resolutions.

2. The network device configures dynamic quantization for the terminal, and at least two quantization accuracies are available in the dynamic quantization process. Specifically, dynamic quantization refers to quantization using more than one quantization precision when quantizing coefficients of the same set of coefficient matrices, where a method with higher quantization precision is referred to as high-precision quantization, and others are referred to as non-high-precision quantization. For example, 3bit amplitude quantization+16 PSK phase quantization is compared with 4bit amplitude quantization+16 PSK phase quantization, and 4bit amplitude quantization+16 PSK phase quantization is high-precision quantization. That is, the network side configures at least one dynamic quantization method for the terminal, and the terminal adopts the dynamic quantization method, so that when the terminal performs CSI feedback, the Part1 carries indication information indicating the number of quantization coefficients adopting a first quantization precision, where the first quantization precision is one of quantization precision adopted by dynamic quantization. Optionally, for the indication information of the high-precision quantized coefficient, if the number of the fed back coefficient is a value agreed by the protocol, for example, the agreed value may be 0, the coefficient in the coefficient matrix is quantized in a dynamic quantization mode, and the high-precision quantization or the low-precision quantization may be used in the dynamic quantization process, where the high-precision quantization may be 4bit amplitude quantization+16 PSK quantization, and the low-precision quantization may be 3bit amplitude quantization+16 PSK quantization.

3. The network equipment simultaneously configures dynamic quantization and at least two quantization accuracies for the terminal; that is, the network device configures at least two quantization resolutions for the terminal, and the terminal adopts a dynamic quantization method, so that when the terminal performs CSI feedback, the Part1 carries indication information indicating the number of quantization coefficients adopting a first quantization precision, where the first quantization precision is one of the at least two quantization resolutions.

4. The network device does not configure quantization precision or quantization method for the terminal, and the terminal autonomously selects quantization precision of coefficient quantization, i.e. the terminal autonomously selects a certain quantization precision to quantize the coefficients in the coefficient matrix. That is, the network device does not configure quantization precision or quantization method for the terminal, the terminal needs to autonomously select the quantization method and quantization precision, and when the terminal performs CSI feedback, the Part1 carries indication information indicating the number of quantization coefficients adopting the first quantization precision, where the first quantization precision is one of at least two quantization precision.

In addition, in the case where only one quantization accuracy is available, the above-described indication information is not carried in the first section. For example: the network equipment configures a quantization precision for the terminal, and the terminal defaults to use a quantization method with a single quantization precision, so that the terminal does not carry the indication information in Part1 during CSI feedback, namely, the terminal does not need to feed back the quantity of quantization coefficients quantized by the terminal with a certain quantization precision. In this case the terminal quantizes the coefficients with a single quantization precision without indicating the number of quantized coefficients quantized with a certain quantization precision.

Or for example: the network equipment configures static quantization for the terminal, and the terminal defaults to use a single-precision quantization method, so that the terminal does not carry the indication information in Part1 during CSI feedback, namely the terminal does not need to feed back the quantity of quantized coefficients quantized by adopting a certain quantization precision. Wherein, the static quantization refers to quantization using only one quantization precision when quantizing coefficients of the same group of coefficient matrices.

Further, the first portion has a fixed load size and carries information indicative of the load size of the second portion, optionally the first portion may further comprise at least one of the following information:

1. first indication information indicating a precoding matrix indicator subband size, e.g. the first indication information is a precoding matrix PMI subband size indication (PMI subband size indication). The frequency domain granularity of the wideband may be a subband, an RB, or the like, and in this embodiment, the subband is taken as an example, but it can be understood by those skilled in the art that the first indication information may also be first indication information indicating the number of RBs included in the frequency domain granularity corresponding to the precoding matrix.

2. Second indication information indicating the number of orthogonal bases, the second indication information specifically indicating: the codebook is subjected to frequency domain compression, and the number of DFT (discrete Fourier transform) bases can be selected. The orthogonal basis may include, but is not limited to, a DFT orthogonal basis and/or an IDFT orthogonal basis.

3. Third indication information indicating a selection manner (or called a selection scheme) of the orthogonal base, wherein the selection scheme of the orthogonal base comprises independent selection or common selection, and the optional combination manner comprises but is not limited to the following four manners:

selecting mode one, hierarchical independent selection and beam level independent selection (Layer level independent with beam level independent);

selecting mode two, selecting the layers independently and selecting the beam levels together (Layer level independent with beam level common);

selecting a mode three, selecting the layers together and selecting the beam levels independently (Layer level common with beam level independent);

selection mode four, hierarchical common cull and beam level common cull (Layer level common with beam level common).

The selection mode of the orthogonal base of the terminal influences the selection of the initial vector matrix of the orthogonal base. That is, the selection and determination of the initial vector matrix of the orthogonal basis is related to the manner in which the orthogonal basis is selected. For example, the selection and determination of the initial vector matrix of the DFT orthogonal basis is related to the selection mode of the DFT orthogonal basis; the selection and determination of the initial vector matrix of the IDFT orthogonal basis is related to the manner in which the IDFT orthogonal basis is selected.

4. Fourth indication information indicating the number of coefficients in the coefficient matrix, wherein the coefficient matrix may be a coefficient matrix before compression or a coefficient matrix subset after compression, and the coefficient matrix subset is: and selecting a subset of 2L multiplied by R constructed by coefficients from the coefficient matrix. Wherein the coefficient matrix refers to a combined coefficient matrix of orthogonal beam vectors of a certain layer on the frequency domain granularity.

5. An indication bitmap indicating the coefficient matrix, the indication bitmap being used to indicate which coefficients are selected as subsets in the coefficient matrix in particular. Alternatively, the indication bitmap may be a 2-dimensional bitmap (bitmap) of a 2l×m-dimensional matrix, where L is the number of selected orthogonal beams, its value may be configured by the network device, and M is the number of frequency domains in which the frequency domain wideband is divisible in units of frequency domain granularity.

6. The oversampling coefficient information of the orthogonal basis, which specifically refers to the oversampling coefficient of the vector matrix of the orthogonal basis, is worth noting that when the terminal needs to autonomously determine the magnitude of the oversampling coefficient value, the oversampling coefficient information should be carried in the first portion.

7. Quantization types (or quantization schemes) employed, wherein quantization types include, but are not limited to: wideband quantization and subband quantization.

It should be noted that the first portion in the CSI report may include only one of the above information, or may include different combinations of the above information, for example, a combination of any two of the above information, a combination of any three information, a combination of any four information, and so on. In addition, the CSI report may further include other information in addition to the above information, such as rank indication RI, channel quality indication CQI information, or other information that may be used to indicate the second part payload size, etc.

In one embodiment of the invention, the two-level codebook for CSI reporting at frequency domain granularity m is written as:

wherein N is ₁ 、N ₂ The port numbers of the CSI reference signals (CSI Reference Signal, CSI-RS) in two dimensions are respectively, and R is the rank or the layer number; b' _l C is an orthogonal vector composed of 2D-DFT beam vectors _l,r (m) is the combination coefficient of the first orthogonal beam vector of layer R on the frequency domain granularity m, r=1, 2, …, R, l=1, 2, …,2l, l is the number of orthogonal beams selected. Wherein the frequency domain granularity can beThe wideband may be divided into M frequency domain resources in units of frequency domain granularity in subbands or Resource Blocks (RBs).

If the combined coefficients of all the sub-bands are cascaded together, a precoding matrix of a layer r on a frequency domain can be obtained, wherein the precoding matrix is a precoding matrix of a certain layer on a broadband (or called frequency domain), that is, the combined coefficients on all the frequency domain granularity are cascaded together, and a precoding matrix of the layer r on the frequency domain can be obtained, and the precoding matrix can be written as a 2L×M matrix and is expressed as follows:

Wherein c _l,r (m) is the combining coefficient of the first orthogonal beam vector of layer r at frequency domain granularity m. W (W) _2,r The first line in (b) represents the beam vector b' _l The combined coefficient matrix at all frequency domain granularity is represented as follows:

further, the compressed matrix of CSI refers to a matrix formed by compressing a precoding matrix in the time domain or the frequency domain. The compression matrix is: extracting elements in the product of the precoding matrix and the initial vector matrix of the orthogonal base, wherein K is a value smaller than M, and K can be configured by network equipment, agreed by a protocol or autonomously determined by a terminal. For example, using spatial compression of CSI feedback type two, for W _2,r Transform W ₃ I.e.From W ₃ Is->

Let W be ₃ Inverse discrete fourier transform (Inverse discrete) determined as M x M dimensionste Fourier Transform, IDFT) matrix corresponding to transforming the combined coefficients of the frequency domain into the time domain, i.e. to W _2,r And (3) performing transformation:

if the spatial compressed frequency domain coefficient has sparsity in the time domain, only a small amount of time domain coefficients with larger amplitude can be fed back, and other time domain coefficients are zero. Assuming that only K time domain coefficients with maximum amplitude after IDFT transformation are fed back, then Extracting K columns to obtain ∈>

The coefficient matrix according to the embodiment of the present invention may be the matrix to be quantized, which is mentioned above: combination coefficient matrix W _2,r Compression matrixOr compression matrix +.>And extracting the matrix after the elements. For example, the matrix to be quantized is:

wherein r represents rank or layer, Q represents the number of rows of the matrix to be quantized, and Q may be 2L rows, i.e. the coefficient matrix is a compressed matrix; q may also be the number of further compressed rows (Q < 2L), e.g. q=2l—2, i.e. the coefficient matrix is a matrix after the compressed matrix has extracted the elements.

The indication information in Part1 in the embodiment of the present invention may indicate the number of quantization coefficients quantized with the first quantization precision by, but not limited to, the following ways:

mode one, the indication information indicates by means of an indication bit

In this way, the number of indicator bits in the indicator information is related to the strongest coefficient in the coefficient matrix. In the embodiment of the present invention, the coefficient matrix refers to a matrix to be quantized, and the number of indication bits in the indication information is related to the strongest coefficient in the coefficient matrix. Further, the number of the indication bits in the indication information is also related to an indication bitmap of the coefficient matrix, where the indication bitmap is carried in the CSI report, that is, the CSI report reported by the terminal also carries the indication bitmap of the coefficient matrix. For example, part1 in the CSI report carries an indication bitmap of the coefficient matrix, or Part2 in the CSI report carries an indication bitmap of the coefficient matrix.

Wherein the manner indicates the number of quantization coefficients quantized with the first quantization precision by indicating the value of the bit. Specifically, the value of the indication bit in the indication information is used to: indicating the number P of first coefficients needing feedback in a column or a row where the strongest coefficient in the coefficient matrix is located; or, the number Z of second coefficients in the column or row in which the strongest coefficient in the coefficient matrix is located, which does not need feedback.

It is worth noting that the first coefficient number P or the second coefficient number Z may include the strongest coefficient in the coefficient matrix. Alternatively, the first coefficient number P or the second coefficient number Z may not include the strongest coefficient in the coefficient matrix.

The following embodiments of the present invention will further describe the indication information in Part1 in conjunction with a specific application scenario.

Example one in the case where the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1)); wherein Y is the number of coefficients in the column where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located, or Y is the number of coefficients in the row where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located; the coefficient matrix subset is obtained by extracting rows or columns in the coefficient matrix, for example, the coefficient matrix subset is a matrix obtained by extracting elements from the compressed matrix.

Taking Y as a coefficientThe number of coefficients in the column of the strongest coefficient in the matrix is taken as an example, the value of the indication bit in the indication information is used for indicating the number P of first coefficients to be fed back in the column of the strongest coefficient in the coefficient matrix, and P includes the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y)，ceil(log ₂ Y) indicating bits are used to indicate P, indicating that the number of coefficients to be quantized for the column in which the strongest coefficient is located is P-1. For exampleThe matrix is a 4 row 8 column matrix, wherein +.>The column of coefficients at which the maximum coefficient is located is [0.0125 1 0.5 0.02 0.1 0.6 0.2 0.3 ]]The magnitude of the strongest coefficient is 1, then the corresponding non-limiting bitmap for this column is [ 01 1 0 01 01 ]]. In the CSI report reported by the terminal, the number of indication bits of the indication information in Part1 is 3, the value p=4 of the 3 bits, and then the number of coefficients to be quantized in the column is 4-1=3.

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the first number of coefficients P in the column in which the strongest coefficient in the coefficient matrix is located, which needs feedback, and P does not include the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1)), the number of bits indicated in the indication information is preferably ceil (log) in order to save bit overhead ₂ (Y-1)) number of the cells ₂ (Y-1)) indicating bits are used to indicate P, and the number of coefficients to be quantized for the column in which the strongest coefficient is located is P.

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the second number Z of coefficients in the column in which the strongest coefficient in the coefficient matrix is located, where feedback is not required, and Z includes the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1)), without saving bitsOverhead, preferably the number of bits in the indication information is ceil (log ₂ (Y-1)) number of the cells ₂ The value of (Y-1)) indicating bits is used to indicate Z, and the number of coefficients that need not be quantized for the column in which the strongest coefficient is located is Z, and the number of coefficients that need to be quantized is (Y-Z).

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the second number of coefficients Z in the column in which the strongest coefficient in the coefficient matrix is located, which needs feedback, and Z does not include the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1)), the number of bits indicated in the indication information is preferably ceil (log) in order to save bit overhead ₂ (Y-1)) number of the cells ₂ The value of (Y-1)) indicating bits is used to indicate Z, and the number of coefficients that need not be quantized for the column in which the strongest coefficient is located is Z, and the number of coefficients that need to be quantized is (Y-Z-1).

Example two, in the case where the indication bitmap is a polarization-limited bitmap, the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or

Wherein Y is the number of coefficients in the column where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located, or Y is the number of coefficients in the row where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located; the coefficient matrix subset is obtained by extracting rows or columns in the coefficient matrix.

Also, taking Y as an example of the number of coefficients in the column in which the strongest coefficient in the coefficient matrix is located, the value of the indication bit in the indication information is used to indicate the number P of first coefficients in the column in which the strongest coefficient in the coefficient matrix is located, which need to be fed back, and P includes the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ (Y/2)) number of the cells (log) ₂ The value of (Y/2)) indicating bits is used to indicate P, and the number of coefficients to be quantized for the column in which the strongest coefficient is located is P x 2-1. For exampleThe matrix is a 4 row 8 column matrix, wherein +.>The column of coefficients at which the maximum coefficient is located is [0.0125 1 0.5 0.02 0.1 0.6 0.2 0.3 ]]The magnitude of the strongest coefficient is 1, and the corresponding polarization limit bitmap is [ 01 1 0 ]]. In the CSI report reported by the terminal, the number of indication bits of the indication information in Part1 is 3, the value p=2 of the 3 bits, and then the number of coefficients to be quantized in the column is 2×2-1=3.

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the first number of coefficients P in the column in which the strongest coefficient in the coefficient matrix is located, which needs feedback, and P does not include the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a polarization-limited bitmap, the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or ceil (log) ₂ (Y/2-1)), in order to save bit overhead, preferably the number of bits in the indication information is ceil (log) ₂ (Y/2-1)) number of such ceils (log) ₂ The value of (Y/2-1)) indicating bits is used to indicate P, and the number of coefficients to be quantized for the column in which the strongest coefficient is located is 2×p+1.

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the second number Z of coefficients in the column in which the strongest coefficient in the coefficient matrix is located, where feedback is not required, and Z includes the strongest coefficient. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is eil (log ₂ (Y/2)) or ceil (log) ₂ (Y/2-1)), in order to save bit overhead, preferably the number of bits in the indication information is ceil (log) ₂ (Y/2-1)) number of such ceils (log) ₂ The value of (Y/2-1)) indicating bits is used to indicate Z, and the number of coefficients that need not be quantized for the column in which the strongest coefficient is located is Z, and then the number of coefficients that need to be quantized is 2 x (Y/2-Z) +1.

Alternatively, it is assumed that the value of the indication bit in the indication information is used to indicate the second number of coefficients Z in the column in which the strongest coefficient in the coefficient matrix is located, which needs feedback, and Z is notIncluding the strongest coefficients. Then when the indication bitmap of the coefficient matrix is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or ceil (log) ₂ (Y/2-1)), in order to save bit overhead, preferably the number of bits in the indication information is ceil (log) ₂ (Y/2-1)) number of such ceils (log) ₂ The value of (Y/2-1)) indicating bits is used to indicate Z, and the number of coefficients to be quantized is 2 x (Y/2-Z) -1, indicating that the column in which the strongest coefficient is located does not need to be quantized is Z.

It should be noted that, in the first mode, in the case that at least two layers correspond to the same indication bitmap, the indication information is used to indicate the number of quantization coefficients corresponding to each indication bitmap. That is, if the multiple layers share the same indication bitmap, that is, the indication bitmaps of the multiple layers select the same coefficient position, only the number of quantized coefficients corresponding to the indication bitmap needs to be fed back in the indication information, and accordingly, the network device considers that the number of quantized coefficients needed to be quantized is equal to the number of layers multiplied by the number of quantized coefficients of one layer.

Alternatively, in the case that each layer corresponds to an indication bitmap alone, the indication information is used to indicate: each layer corresponds to the number of quantized coefficients, or the sum of the numbers of quantized coefficients for all layers. That is, if the indication bitmaps corresponding to the layers in the multiple layers are independent, that is, the coefficient positions selected by the indication bitmaps of the multiple layers are independently selected among the layers, the indication information may indicate the quantization coefficient number Pr of the r-th layer, where r represents the r-th layer. Or in the scene, indicating information feeds back the total number P of quantization coefficient numbers of each layer _tot ，P _tot Equal to the sum of the number of quantized coefficients of all layers.

Further, taking the case where the indication information indicates the sum of the quantization coefficient numbers corresponding to all layers as an example, in the case where the indication bitmap is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log ₂ Y+log ₂ R) or ceil (log) ₂ (Y-1)+log ₂ R)；

Wherein R is the number of layers, Y is the number of coefficients in the column where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located, or Y is the number of coefficients in the row where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located; the coefficient matrix subset is obtained by extracting rows or columns in the coefficient matrix.

For exampleThe matrix is a matrix of 4 rows and 8 columns, wherein +_of the first layer >The column of coefficients at which the maximum coefficient is located is [0.0125 1 0.5 0.02 0.1 0.6 0.2 0.3 ]]The magnitude of the strongest coefficient is 1, then the corresponding non-limiting bitmap for this column is [ 01 1 00 1 01 ]]The method comprises the steps of carrying out a first treatment on the surface of the Second layer->The column of coefficients where the largest coefficient is located is assumed to be [0.0023 0.234 0.35 0.75 0.1 1 0.3 0.02 ]]The maximum coefficient amplitude is 1, and the corresponding non-limiting bitmap of the column is [ 01 1 1 01 1 0 ]]. In the CSI report reported by the terminal, if the indication information indicates the number Pr of quantization coefficients of the r-th layer, the number of indication bits of the indication information in Part1 is 3+3, and p1=4 and p2=5 are indicated respectively, and if P1 and P2 both contain the strongest coefficient, the total number of coefficients to be quantized is 4+5-2=3.

Alternatively, in the case where the indication bitmap is a polarization-limited bitmap, the number of indication bits in the indication information is ceil (log ₂ (Y/2)+log ₂ R) or

For exampleThe matrix is a matrix of 4 rows and 8 columns, wherein +_of the first layer>The column of coefficients at which the maximum coefficient is located is [0.0125 1 0.5 0.02 0.1 0.6 0.2 0.3 ]]The magnitude of the strongest coefficient is 1, and the corresponding polarization limit bitmap is [ 01 1 0 ]]The method comprises the steps of carrying out a first treatment on the surface of the Second layer->The column of coefficients where the largest coefficient is located is assumed to be [0.0023 0.234 0.35 0.75 0.1 1 0.3 0.02 ]]The maximum coefficient amplitude is 1, and the polarization limit bitmap corresponding to the column is [ 01 1 0 ]]. The two layers correspond to the same indication bitmap, in the CSI report reported by the terminal, the indication information indicates the number of quantized coefficients 2 corresponding to the indication bitmap, and if the number of the reported quantized coefficients includes the strongest coefficient, the total number of the coefficients to be quantized is 2 x (2 x 2-1) =6.

Mode two, the indication information indicates by bitmap mode

In the method, the terminal indicates the quantity of quantized coefficients in Part1 of the CSI report in a bitmap mode, and specifically, the indication information is a bitmap of a column or a row where the strongest coefficient in the coefficient matrix is located. The coefficient matrix is a matrix that needs to be quantized, and may be mentioned above: combination coefficient matrix W _2, Compression matrixOr compression matrix +.>And extracting the matrix after the elements.

When the bitmap of the column or row of the strongest coefficient in the coefficient matrix is a non-limiting bitmap, the number of bits in the bitmap is Y, where Y is the number of coefficients in the column or row of the strongest coefficient in the coefficient matrix. The number of 1 in the bitmap can be used for indicating the number P of the first coefficients needing feedback in the column or row where the strongest coefficient in the coefficient matrix is located; or, the second number of coefficients Z in the column or row of the coefficient matrix where the strongest coefficient is located, which does not need feedback. Or conversely, the number P of the first coefficients needing to be fed back in the column or row where the strongest coefficient in the coefficient matrix is located can be indicated by the number with the value of 0 in the bitmap; or, the second number of coefficients Z in the column or row of the coefficient matrix where the strongest coefficient is located, which does not need feedback. When the bitmap is an unlimited bitmap, determining the quantity of quantized coefficients as P when the quantity P of 1 in the bitmap does not comprise the strongest coefficients; when the number P of 1 in the bitmap includes the strongest coefficient, the number of quantized coefficients is determined to be P-1.

Or when the bitmap of the column or row of the strongest coefficient in the coefficient matrix is the polarization restriction bitmap, the bit number in the bitmap is Y/2, wherein Y is the coefficient number in the column or row of the strongest coefficient in the coefficient matrix. The number of 1 in the bitmap can be used for indicating the number P of the first coefficients needing feedback in the column or row where the strongest coefficient in the coefficient matrix is located; or, the second number of coefficients Z in the column or row of the coefficient matrix where the strongest coefficient is located, which does not need feedback. Or conversely, the number P of the first coefficients needing to be fed back in the column or row where the strongest coefficient in the coefficient matrix is located can be indicated by the number with the value of 0 in the bitmap; or, the second number of coefficients Z in the column or row of the coefficient matrix where the strongest coefficient is located, which does not need feedback. When the bitmap is a polarization limiting bitmap, determining that the quantization coefficient number is 2 x P+1 when the number P of 1 in the bitmap does not comprise the strongest coefficient; when the number P of 1 in the bitmap includes the strongest coefficient, the number of quantized coefficients is determined to be 2*P-1.

Further, similar to the above-described first mode, in the second mode, there may be a case where at least two layers correspond to the same bitmap, or each layer corresponds to a respective independent bitmap. Accordingly, in case that at least two layers correspond to the same bitmap, the indication information includes the bitmap. That is, the bitmaps of the columns where the strongest coefficients of the multiple layers are located select the same coefficient position, so that only one bitmap is indicated in Part1, and the corresponding network device considers that the number of quantized coefficients is equal to the number of layers multiplied by the number of quantized coefficients indicated by the bitmap of one layer. Alternatively, in the case where each layer alone corresponds to a set of bitmaps, the indication information includes the bitmap to which each layer corresponds. That is, if the bitmaps of the columns of the strongest coefficients in the multiple layers are independent, that is, the bitmaps between the different layers select the coefficient positions that are independently selected between the layers, the bitmap corresponding to each layer needs to be carried in Part1 to indicate the number of quantized coefficients of the different layers.

In the transmission method of the Channel State Information (CSI) report, when the terminal reports the CSI report to the network equipment, the CSI report carries the indication information for indicating the quantity of quantization coefficients adopting the first quantization precision, and the network equipment determines the second partial load according to the indication information after receiving the CSI report so as to be beneficial to the network equipment to accurately acquire the channel state.

The above embodiments describe a transmission method of channel state information CSI reports in different scenarios, and the following will further describe a terminal corresponding to the transmission method with reference to the accompanying drawings.

As shown in fig. 3, the terminal 300 according to the embodiment of the present invention can send a CSI report to the network device in the above embodiment; wherein, in case at least two quantization accuracies are available, the CSI report carries: the terminal 300 specifically includes the following functional modules:

a sending module 310, configured to send a channel state information CSI report to a network device;

Wherein the CSI report comprises a first portion and a second portion, the payload size of the second portion being determined from the first portion, the first portion comprising the indication information.

On the other hand, in the case where only one quantization accuracy is available, the first part does not include the indication information.

Wherein the at least two cases where quantization accuracy is available include one of:

the network equipment configures at least two quantization accuracies for the terminal;

the network equipment configures dynamic quantization for the terminal, wherein the dynamic quantization corresponds to at least two quantization accuracies;

the network equipment configures dynamic quantization and at least two quantization accuracies for the terminal;

the terminal autonomously selects the quantization precision of the coefficient quantization.

Wherein the number of indication bits in the indication information is related to the strongest coefficient in the coefficient matrix.

Wherein the value of the indication bit is used to: indicating the number P of first coefficients needing feedback in a column or a row where the strongest coefficient in the coefficient matrix is located; or, the number Z of second coefficients in the column or row in which the strongest coefficient in the coefficient matrix is located, which does not need feedback.

Wherein the first coefficient number P or the second coefficient number Z comprises the strongest coefficient in the coefficient matrix.

Wherein the first coefficient number P or the second coefficient number Z does not comprise the strongest coefficient of the coefficient matrix.

Wherein, the CSI report carries an indication bitmap of the coefficient matrix.

Wherein the indication bitmap is a non-limiting bitmap, and the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1))；

Wherein the indication bit map is a polarization-limited bit map, and the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or

And the indication information is used for indicating the quantity of the quantization coefficients corresponding to each indication bitmap under the condition that at least two layers correspond to the same indication bitmap.

Wherein, in the case that each layer solely corresponds to an indication bitmap, the indication information is used for indicating: each layer corresponds to the number of quantized coefficients, or the sum of the numbers of quantized coefficients for all layers.

Wherein the indication bitmap is a non-limiting bitmap, and the number of indication bits in the indication information is ceil (log ₂ Y+log ₂ R) or ceil (log) ₂ (Y-1)+log ₂ R)；

Wherein the indication bit map is a polarization-limited bit map, and the number of indication bits in the indication information is ceil (log ₂ (Y/2)+log ₂ R) or

The indication information is a bitmap of a column or a row where the strongest coefficient in the coefficient matrix is located.

When the bitmap is a non-limiting bitmap, the number of bits in the bitmap is Y, where Y is the number of coefficients in the column where the strongest coefficient in the coefficient matrix is located.

When the bitmap is a polarization restriction bitmap, the number of bits in the bitmap is Y/2, wherein Y is the number of coefficients in a column where the strongest coefficient in the coefficient matrix is located.

Wherein, in case that at least two layers correspond to the same bitmap, the indication information includes the bitmap.

Wherein, in the case that each layer solely corresponds to a set of bitmaps, the indication information includes the bitmaps corresponding to each layer.

It is worth pointing out that, when the terminal in the embodiment of the invention reports the CSI report to the network device, the CSI report carries indication information indicating the number of quantization coefficients adopting the first quantization precision, and the network device determines the second partial load size according to the indication information after receiving the CSI report, so as to be beneficial to the network device to accurately acquire the channel state.

To better achieve the above objects, further, fig. 4 is a schematic hardware structure of a terminal for implementing various embodiments of the present invention, where the terminal 40 includes, but is not limited to: radio frequency unit 41, network module 42, audio output unit 43, input unit 44, sensor 45, display unit 46, user input unit 47, interface unit 48, memory 49, processor 410, and power source 411. Those skilled in the art will appreciate that the terminal structure shown in fig. 4 is not limiting of the terminal and that the terminal may include more or fewer components than shown, or may combine certain components, or a different arrangement of components. In the embodiment of the invention, the terminal comprises, but is not limited to, a mobile phone, a tablet computer, a notebook computer, a palm computer, a vehicle-mounted terminal, a wearable device, a pedometer and the like.

Wherein, the radio frequency unit 41 is configured to send a channel state information CSI report to the network device; wherein, in case at least two quantization accuracies are available, the CSI report carries: indication information indicating the number of quantized coefficients employing a first quantization accuracy, the first quantization accuracy being one of at least two quantization accuracies, the quantization accuracy being used for quantization of coefficients in the coefficient matrix;

a processor 410 for controlling the radio frequency unit 41 to transmit and receive data;

when reporting the CSI report to the network equipment by the terminal, the first part of the fixed load size carries the indication information for indicating the quantity of the quantization coefficients adopting the first quantization precision, and the network equipment determines the second part of the load size according to the indication information of the first part after receiving the CSI report, so that the network equipment can accurately acquire the channel state.

It should be understood that, in the embodiment of the present invention, the radio frequency unit 41 may be used for receiving and transmitting signals during the process of receiving and transmitting information or communication, specifically, receiving downlink data from the base station and then processing the received downlink data by the processor 410; and, the uplink data is transmitted to the base station. Typically, the radio frequency unit 41 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like. In addition, the radio frequency unit 41 may also communicate with networks and other devices via a wireless communication system.

The terminal provides wireless broadband internet access to the user via the network module 42, such as helping the user to send and receive e-mail, browse web pages, access streaming media, etc.

The audio output unit 43 may convert audio data received by the radio frequency unit 41 or the network module 42 or stored in the memory 49 into an audio signal and output as sound. Also, the audio output unit 43 may also provide audio output (e.g., a call signal reception sound, a message reception sound, etc.) related to a specific function performed by the terminal 40. The audio output unit 43 includes a speaker, a buzzer, a receiver, and the like.

The input unit 44 is for receiving an audio or video signal. The input unit 44 may include a graphics processor (Graphics Processing Unit, GPU) 441 and a microphone 442, the graphics processor 441 processing image data of still pictures or video obtained by an image capturing device (e.g., a camera) in a video capturing mode or an image capturing mode. The processed image frames may be displayed on the display unit 46. The image frames processed by the graphics processor 441 may be stored in the memory 49 (or other storage medium) or transmitted via the radio frequency unit 41 or the network module 42. The microphone 442 may receive sound and may be capable of processing such sound into audio data. The processed audio data may be converted into a format output that can be transmitted to the mobile communication base station via the radio frequency unit 41 in the case of a telephone call mode.

The terminal 40 further comprises at least one sensor 45, such as a light sensor, a motion sensor and other sensors. Specifically, the light sensor includes an ambient light sensor and a proximity sensor, wherein the ambient light sensor can adjust the brightness of the display panel 461 according to the brightness of the ambient light, and the proximity sensor can turn off the display panel 461 and/or the backlight when the terminal 40 moves to the ear. As one of the motion sensors, the accelerometer sensor can detect the acceleration in all directions (generally three axes), and can detect the gravity and direction when the accelerometer sensor is stationary, and can be used for recognizing the terminal gesture (such as horizontal and vertical screen switching, related games, magnetometer gesture calibration), vibration recognition related functions (such as pedometer and knocking), and the like; the sensor 45 may further include a fingerprint sensor, a pressure sensor, an iris sensor, a molecular sensor, a gyroscope, a barometer, a hygrometer, a thermometer, an infrared sensor, etc., which will not be described herein.

The display unit 46 is used to display information input by a user or information provided to the user. The display unit 46 may include a display panel 461, and the display panel 461 may be configured in the form of a liquid crystal display (Liquid Crystal Display, LCD), an Organic Light-Emitting Diode (OLED), or the like.

The user input unit 47 may be used to receive input numeric or character information and to generate key signal inputs related to user settings and function control of the terminal. Specifically, the user input unit 47 includes a touch panel 471 and other input devices 472. The touch panel 471, also referred to as a touch screen, may collect touch operations thereon or thereabout by a user (e.g., operations of the user on the touch panel 471 or thereabout using any suitable object or accessory such as a finger, stylus, etc.). The touch panel 471 may include two parts of a touch detection device and a touch controller. The touch detection device detects the touch azimuth of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device, converts it into touch point coordinates, and sends the touch point coordinates to the processor 410, and receives and executes commands sent from the processor 410. In addition, the touch panel 471 may be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. The user input unit 47 may include other input devices 472 in addition to the touch panel 471. In particular, other input devices 472 may include, but are not limited to, physical keyboards, function keys (e.g., volume control keys, switch keys, etc.), trackballs, mice, joysticks, and so forth, which are not described in detail herein.

Further, the touch panel 471 may be overlaid on the display panel 461, and when the touch panel 471 detects a touch operation thereon or thereabout, the touch panel 471 is transmitted to the processor 410 to determine the type of touch event, and then the processor 410 provides a corresponding visual output on the display panel 461 according to the type of touch event. Although in fig. 4, the touch panel 471 and the display panel 461 are provided as two separate components to implement the input and output functions of the terminal, in some embodiments, the touch panel 471 may be integrated with the display panel 461 to implement the input and output functions of the terminal, which is not limited herein.

The interface unit 48 is an interface to which an external device is connected to the terminal 40. For example, the external devices may include a wired or wireless headset port, an external power (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device having an identification module, an audio input/output (I/O) port, a video I/O port, an earphone port, and the like. The interface unit 48 may be used to receive input (e.g., data information, power, etc.) from an external device and transmit the received input to one or more elements within the terminal 40 or may be used to transmit data between the terminal 40 and an external device.

The memory 49 may be used to store software programs as well as various data. The memory 49 may mainly include a storage program area that may store an operating system, application programs required for at least one function (such as a sound playing function, an image playing function, etc.), and a storage data area; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, memory 49 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.

The processor 410 is a control center of the terminal, connects various parts of the entire terminal using various interfaces and lines, and performs various functions of the terminal and processes data by running or executing software programs and/or modules stored in the memory 49 and calling data stored in the memory 49, thereby performing overall monitoring of the terminal. Processor 410 may include one or more processing units; preferably, the processor 410 may integrate an application processor that primarily handles operating systems, user interfaces, applications, etc., with a modem processor that primarily handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 410.

The terminal 40 may further include a power source 411 (e.g., a battery) for supplying power to the respective components, and preferably, the power source 411 may be logically connected to the processor 410 through a power management system, so as to perform functions of managing charging, discharging, and power consumption management through the power management system.

In addition, the terminal 40 includes some functional modules, which are not shown, and will not be described herein.

Preferably, the embodiment of the present invention further provides a terminal, which includes a processor 410, a memory 49, and a computer program stored in the memory 49 and capable of running on the processor 410, where the computer program when executed by the processor 410 implements the respective processes of the above-mentioned transmission method embodiment of the CSI report, and can achieve the same technical effects, and for avoiding repetition, a detailed description is omitted herein. The terminal may be a wireless terminal or a wired terminal, and the wireless terminal may be a device that provides voice and/or other service data connectivity to a user, a handheld device with wireless connection functionality, or other processing device connected to a wireless modem. The wireless terminals may communicate with one or more core networks via a radio access network (Radio Access Network, RAN), which may be mobile terminals such as mobile phones (or "cellular" phones) and computers with mobile terminals, e.g., portable, pocket, hand-held, computer-built-in or vehicle-mounted mobile devices that exchange voice and/or data with the radio access network. Such as personal communication services (Personal Communication Service, PCS) phones, cordless phones, session initiation protocol (Session Initiation Protocol, SIP) phones, wireless local loop (Wireless Local Loop, WLL) stations, personal digital assistants (Personal Digital Assistant, PDAs), and the like. A wireless Terminal may also be referred to as a system, subscriber Unit (Subscriber Unit), subscriber Station (Subscriber Station), mobile Station (Mobile Station), mobile Station (Mobile), remote Station (Remote Station), remote Terminal (Remote Terminal), access Terminal (Access Terminal), user Terminal (User Terminal), user Agent (User Agent), user equipment (User Device or User Equipment), without limitation.

The embodiment of the invention also provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the processes of the above-mentioned transmission method embodiment of the channel state information CSI report, and can achieve the same technical effects, so that repetition is avoided, and no further description is given here. Wherein the computer readable storage medium is selected from Read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.

The above embodiments introduce the transmission method of the CSI report of the present invention from the terminal side, and the following embodiments will further describe the transmission method of the CSI report of the network device side with reference to the accompanying drawings.

As shown in fig. 5, a transmission method of a channel state information CSI report according to an embodiment of the present invention is applied to a network device side, and the method includes the following steps:

step 51: a channel state information CSI report is received.

Wherein the CSI report includes: and using the indication information of the number of quantized coefficients of the first quantization precision, wherein the first quantization precision is used for coefficient quantization of the coefficient matrix. Specifically, the CSI report includes a first portion and a second portion, the payload size of the second portion being determined from the first portion, the first portion comprising: indication information indicating the number of quantization coefficients with the first quantization accuracy. Wherein, the terminal is in the case that at least two kinds of quantization accuracy are available, and the first part includes: and adopting the indication information of the number of quantized coefficients of the first quantization precision, wherein the first quantization precision is one of at least two quantization precision, and the quantization precision is used for quantization of the coefficients in the coefficient matrix. In case only one quantization accuracy is available, the above indicated information is not carried in the first part.

The number of indication bits in the indication information corresponds to the strongest coefficient in the coefficient matrix, corresponding to the first mode in the terminal-side embodiment. The coefficient matrix according to the embodiment of the present invention may be the matrix to be quantized, which is mentioned above: combination coefficient matrix W _2,r Compression matrixOr compression matrix +.>And extracting the matrix after the elements.

Optionally, the value of the indication bit is used to: indicating the number P of first coefficients needing feedback in a column or a row where the strongest coefficient in the coefficient matrix is located; or, the number Z of second coefficients in the column or row in which the strongest coefficient in the coefficient matrix is located, which does not need feedback.

It is worth noting that the first coefficient number P or the second coefficient number Z may include the strongest coefficient in the coefficient matrix. Alternatively, the first coefficient number P or the second coefficient number Z may not include the strongest coefficient in the coefficient matrix. Further, the CSI report carries an indication bitmap of the coefficient matrix, and the number of indication bits in the indication information is also related to the indication bitmap of the coefficient matrix. Specifically, the indication bitmap is a non-limiting bitmap, indicating informationThe number of indication bits in (a) is ceil (log ₂ Y) or ceil (log) ₂ (Y-1))；

Alternatively, the indication bitmap is a polarization-limited bitmap, and the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or

And under the condition that at least two layers correspond to the same indication bitmap, the indication information is used for indicating the quantity of quantization coefficients corresponding to each indication bitmap. That is, if the multiple layers share the same indication bitmap, that is, the indication bitmaps of the multiple layers select the same coefficient position, only the number of quantized coefficients corresponding to the indication bitmap needs to be fed back in the indication information, and accordingly, the network device considers that the number of quantized coefficients needed to be quantized is equal to the number of layers multiplied by the number of quantized coefficients of one layer.

Specifically, toThe indication information indicates the sum of the numbers of quantization coefficients corresponding to all layers as an example, and in the case where the indication bitmap is a non-limiting bitmap, the number of indication bits in the indication information is ceil (log) ₂ Y+log ₂ R) or ceil (log) ₂ (Y-1)+log ₂ R)；

The manner in which the indication information indicates the number of quantized coefficients by means of the indication bits is described above, and the indication information may also indicate the number of quantized coefficients by means of a bitmap. Specifically, the indication information is a bitmap of a column or a row where the strongest coefficient in the coefficient matrix is located. The coefficient matrix is a matrix that needs to be quantized, and may be mentioned above: combination coefficient matrix W _2,r Compression matrixOr compression matrix +.>And extracting the matrix after the elements.

Optionally, when the bitmap is a non-limiting bitmap, the number of bits in the bitmap is Y, where Y is the number of coefficients in a column or row in which the strongest coefficient in the coefficient matrix is located.

Or when the bitmap is a polarization restriction bitmap, the bit number in the bitmap is Y/2, where Y is the number of coefficients in the column or row where the strongest coefficient in the coefficient matrix is located.

It is worth noting that, in case at least two layers correspond to the same bitmap, the indication information comprises a bitmap. That is, the bitmaps of the columns where the strongest coefficients of the multiple layers are located select the same coefficient position, so that only one bitmap is indicated in Part1, and the corresponding network device considers that the number of quantized coefficients is equal to the number of layers multiplied by the number of quantized coefficients indicated by the bitmap of one layer.

Alternatively, in the case where each layer alone corresponds to a set of bitmaps, the indication information includes the bitmap to which each layer corresponds. That is, if the bitmaps of the columns of the strongest coefficients in the multiple layers are independent, that is, the bitmaps between the different layers select the coefficient positions that are independently selected between the layers, the bitmap corresponding to each layer needs to be carried in Part1 to indicate the number of quantized coefficients of the different layers.

It should be noted that the network device side embodiment corresponds to the terminal side embodiment, and all implementation manners of the indication information in the terminal side embodiment are applicable to the network device side receiving the indication information, so they are not illustrated herein.

In the transmission method of the Channel State Information (CSI) report, after receiving the CSI report, the network equipment determines the load size of the second part in the CSI report according to the indication information carried in the CSI report, so that the network equipment can accurately acquire the channel state.

The foregoing embodiments respectively describe the transmission methods of the CSI reports in detail in different scenarios, and the following embodiments will further describe the corresponding network devices with reference to the accompanying drawings.

As shown in fig. 6, the network device 600 according to the embodiment of the present invention can implement the above-mentioned embodiment to receive the CSI report; the CSI report includes: the network device 600 specifically includes the following functional modules:

a receiving module 610, configured to receive a CSI report; the CSI report includes: indication information indicating the number of quantized coefficients employing a first quantization accuracy for coefficient quantization of the coefficient matrix.

Wherein the CSI report includes a first portion in which the indication information is carried and a second portion of which a payload size is determined based on the first portion.

Wherein, the CSI report carries an indication bitmap of the coefficient matrix.

It is worth to be noted that, after the network device in the embodiment of the present invention receives the CSI report, the load size of the second portion in the CSI report is determined according to the indication information carried in the CSI report, so that the network device can accurately acquire the channel state.

It should be noted that, it should be understood that the above division of the respective modules of the network device and the terminal is only a division of a logic function, and may be integrated in whole or in part into a physical entity or may be physically separated. And these modules may all be implemented in software in the form of calls by the processing element; or can be realized in hardware; the method can also be realized in a form of calling software by a processing element, and the method can be realized in a form of hardware by a part of modules. For example, the determining module may be a processing element that is set up separately, may be implemented in a chip of the above apparatus, or may be stored in a memory of the above apparatus in the form of program code, and may be called by a processing element of the above apparatus and execute the functions of the determining module. The implementation of the other modules is similar. In addition, all or part of the modules can be integrated together or can be independently implemented. The processing element described herein may be an integrated circuit having signal processing capabilities. In implementation, each step of the above method or each module above may be implemented by an integrated logic circuit of hardware in a processor element or an instruction in a software form.

For example, the modules above may be one or more integrated circuits configured to implement the methods above, such as: one or more specific integrated circuits (Application Specific Integrated Circuit, ASIC), or one or more microprocessors (digital signal processor, DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), or the like. For another example, when a module above is implemented in the form of a processing element scheduler code, the processing element may be a general purpose processor, such as a central processing unit (Central Processing Unit, CPU) or other processor that may invoke the program code. For another example, the modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

To better achieve the above object, an embodiment of the present invention further provides a network device, which includes a processor, a memory, and a computer program stored on the memory and executable on the processor, where the processor implements the steps in the transmission method of channel state information CSI reports as described above when executing the computer program. The inventive embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of transmitting channel state information CSI reports as described above.

Specifically, the embodiment of the invention also provides a network device. As shown in fig. 7, the network device 700 includes: an antenna 71, a radio frequency device 72, a baseband device 73. The antenna 71 is connected to a radio frequency device 72. In the uplink direction, the radio frequency device 72 receives information via the antenna 71, and transmits the received information to the baseband device 73 for processing. In the downlink direction, the baseband device 73 processes information to be transmitted, and transmits the processed information to the radio frequency device 72, and the radio frequency device 72 processes the received information and transmits the processed information through the antenna 71.

The above-described band processing means may be located in a baseband apparatus 73, and the method performed by the network device in the above embodiment may be implemented in the baseband apparatus 73, the baseband apparatus 73 including a processor 74 and a memory 75.

The baseband device 73 may, for example, comprise at least one baseband board, on which a plurality of chips are disposed, as shown in fig. 7, where one chip, for example, a processor 74, is connected to the memory 75 to invoke a program in the memory 75 to perform the network device operations shown in the above method embodiment.

The baseband device 73 may also include a network interface 76 for interacting with the radio frequency device 72, such as a common public radio interface (common public radio interface, CPRI).

The processor may be a processor, or may be a generic term for a plurality of processing elements, e.g., the processor may be a CPU, an ASIC, or one or more integrated circuits configured to implement the methods performed by the network devices described above, e.g.: one or more microprocessor DSPs, or one or more field programmable gate array FPGAs, etc. The memory element may be one memory or may be a collective term for a plurality of memory elements.

The memory 75 may be volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable EPROM (EEPROM), or a flash Memory. The volatile memory may be random access memory (Random Access Memory, RAM) which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (Double Data Rate SDRAM), enhanced SDRAM (ESDRAM), synchronous DRAM (SLDRAM), and Direct RAM (DRRAM). The memory 75 described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

Specifically, the network device of the embodiment of the present invention further includes: a computer program stored on the memory 75 and executable on the processor 74, the processor 74 invoking the computer program in the memory 75 to perform the method performed by the modules shown in fig. 6.

In particular, the computer program, when invoked by the processor 74, is operable to perform: receiving a Channel State Information (CSI) report; the CSI report includes: indication information indicating the number of quantized coefficients employing a first quantization accuracy for coefficient quantization of the coefficient matrix.

After receiving the CSI report, the network device in the embodiment of the present invention determines the load size of the second portion in the CSI report according to the indication information carried in the CSI report, so as to facilitate the network device to accurately acquire the channel state.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk, etc.

Furthermore, it should be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. Also, the steps of performing the series of processes described above may naturally be performed in chronological order in the order of description, but are not necessarily performed in chronological order, and some steps may be performed in parallel or independently of each other. It will be appreciated by those of ordinary skill in the art that all or any of the steps or components of the methods and apparatus of the present invention may be implemented in hardware, firmware, software, or a combination thereof in any computing device (including processors, storage media, etc.) or network of computing devices, as would be apparent to one of ordinary skill in the art after reading this description of the invention.

The object of the invention can thus also be achieved by running a program or a set of programs on any computing device. The computing device may be a well-known general purpose device. The object of the invention can thus also be achieved by merely providing a program product containing program code for implementing said method or apparatus. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is apparent that the storage medium may be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. The steps of executing the series of processes may naturally be executed in chronological order in the order described, but are not necessarily executed in chronological order. Some steps may be performed in parallel or independently of each other.

While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that various modifications and changes can be made without departing from the principles of the present invention, and such modifications and changes are intended to be within the scope of the present invention.

Claims

1. A transmission method of a CSI report applied to a terminal, comprising:

transmitting a Channel State Information (CSI) report to a network device;

wherein, in case at least two quantization accuracies are available, the CSI report carries: and indicating information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of the at least two quantization precision, the first quantization precision being used for quantization of coefficients in the coefficient matrix.

2. The method of transmitting a channel state information, CSI, report according to claim 1, wherein said CSI report comprises a first portion and a second portion, wherein a payload size of said second portion is determined from said first portion, and wherein said first portion comprises said indication information.

3. The transmission method of channel state information CSI reports according to claim 1, characterized in that said at least two cases where quantization accuracy is available comprise one of:

and the terminal autonomously selects the quantization precision of coefficient quantization.

4. A transmission method of a channel state information CSI report, applied to a network device side, comprising:

receiving a Channel State Information (CSI) report; the CSI report includes a first portion and a second portion, the CSI report including: indication information indicating the number of quantized coefficients employing a first quantization accuracy for quantization of coefficients in a coefficient matrix; the first portion includes the indication information.

5. The transmission method of channel state information CSI reports according to claim 4, wherein the number of indicated bits in said indication information is related to the strongest coefficient in the coefficient matrix.

6. The transmission method of channel state information CSI reports according to claim 5, wherein the value of the indication bit is used to: indicating the number P of first coefficients needing feedback in a column or a row where the strongest coefficient in the coefficient matrix is located; or, the second number of coefficients Z in the column or row where the strongest coefficient in the coefficient matrix is located, where feedback is not required.

7. The transmission method of channel state information CSI reports according to claim 6, wherein said first number of coefficients P or said second number of coefficients Z comprises the strongest coefficient of said coefficient matrix.

8. The transmission method of channel state information CSI reports according to claim 6, wherein said first number of coefficients P or said second number of coefficients Z does not comprise the strongest coefficient of said coefficient matrix.

9. The method according to claim 5, wherein the CSI report carries an indication bitmap of the coefficient matrix.

10. The transmission method of the channel state information CSI report according to claim 9, wherein the indication bitmap is a non-limiting bitmap, and the number of indication bits in the indication information is ceil (log ₂ Y) or ceil (log) ₂ (Y-1))；

11. The transmission method of the channel state information CSI report according to claim 9, wherein the indication bitmap is a polarization-limited bitmap, and the number of indication bits in the indication information is ceil (log ₂ (Y/2)) or

12. The transmission method of the CSI report according to claim 9, wherein in the case that at least two layers correspond to the same indication bitmap, the indication information is used to indicate the number of quantization coefficients corresponding to each indication bitmap.

13. The method for transmitting CSI reports according to claim 9, wherein said indication information is used for indicating that each layer corresponds to an indication bitmap alone: each layer corresponds to the number of quantized coefficients, or the sum of the numbers of quantized coefficients for all layers.

14. The transmission method of channel state information CSI reports according to claim 13, wherein said indication bitmap is a non-limiting bitmap, and the number of indication bits in said indication information is ceil (log ₂ Y+log ₂ R) or ceil (log) ₂ (Y-1)+log ₂ R)；

Wherein R is the number of layers, and Y is the number of coefficients in the column where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located, or Y is the number of coefficients in the row where the strongest coefficient in the coefficient matrix or coefficient matrix subset is located; the coefficient matrix subset is obtained by extracting rows or columns in the coefficient matrix.

15. The transmission method of the CSI report according to claim 13, wherein the indication bitmap is a polarization-limited bitmap, and the number of indication bits in the indication information is ceil (log ₂ (Y/2)+log ₂ R) or

16. The method for transmitting a CSI report according to claim 4, wherein the indication information is a bitmap of a column or a row in which a strongest coefficient in the coefficient matrix is located.

17. The method according to claim 16, wherein when the bitmap is an unrestricted bitmap, the number of bits in the bitmap is Y, where Y is the number of coefficients in a column or row in which the strongest coefficient in the coefficient matrix is located.

18. The transmission method of the CSI report according to claim 16, wherein when the bitmap is a polarization restriction bitmap, the number of bits in the bitmap is Y/2, where Y is the number of coefficients in a column or a row where the strongest coefficient in the coefficient matrix is located.

19. The transmission method of channel state information CSI reports according to claim 16, wherein said indication information comprises a same bitmap in case at least two layers correspond to said bitmap.

20. The transmission method of channel state information CSI reports according to claim 16, wherein said indication information comprises a bitmap corresponding to each layer in case that each layer solely corresponds to a set of bitmaps.

21. A terminal, comprising:

a sending module, configured to send a channel state information CSI report to a network device; wherein, in case at least two quantization accuracies are available, the CSI report carries: and indicating information indicating the number of quantized coefficients employing a first quantization precision, the first quantization precision being one of the at least two quantization precision, the first quantization precision being used for quantization of coefficients in the coefficient matrix.

22. A terminal comprising a processor, a memory and a computer program stored on the memory and running on the processor, which when executed by the processor performs the steps of the method of transmitting channel state information, CSI, reports according to any of claims 1 to 3, 5 to 20.

23. A network device, comprising:

a receiving module, configured to receive a CSI report; the CSI report includes a first portion and a second portion, the CSI report including: indication information indicating the number of quantized coefficients employing a first quantization accuracy for quantization of coefficients in a coefficient matrix; the first portion includes the indication information.

24. A network device, characterized in that it comprises a processor, a memory and a computer program stored on the memory and running on the processor, which when executed implements the steps of the method for transmitting channel state information CSI reports according to any of claims 4 to 20.

25. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the method for transmitting channel state information CSI reports according to any of claims 1 to 20.