WO2020142882A1 - 一种码本处理方法、终端设备及网络设备 - Google Patents

一种码本处理方法、终端设备及网络设备 Download PDF

Info

Publication number
WO2020142882A1
WO2020142882A1 PCT/CN2019/070708 CN2019070708W WO2020142882A1 WO 2020142882 A1 WO2020142882 A1 WO 2020142882A1 CN 2019070708 W CN2019070708 W CN 2019070708W WO 2020142882 A1 WO2020142882 A1 WO 2020142882A1
Authority
WO
WIPO (PCT)
Prior art keywords
quantized weighting
quantized
value
amplitude
weighting coefficient
Prior art date
Application number
PCT/CN2019/070708
Other languages
English (en)
French (fr)
Inventor
陈文洪
方昀
史志华
Original Assignee
Oppo广东移动通信有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Oppo广东移动通信有限公司 filed Critical Oppo广东移动通信有限公司
Priority to CN201980073999.3A priority Critical patent/CN112997419A/zh
Priority to CN202110723937.1A priority patent/CN113346936B/zh
Priority to EP19909475.6A priority patent/EP3879716A4/en
Priority to PCT/CN2019/070708 priority patent/WO2020142882A1/zh
Publication of WO2020142882A1 publication Critical patent/WO2020142882A1/zh
Priority to US17/361,777 priority patent/US11575418B2/en
Priority to US18/147,697 priority patent/US11894896B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/0486—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking channel rank into account
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0408—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas using two or more beams, i.e. beam diversity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • H04L5/0057—Physical resource allocation for CQI

Definitions

  • the present invention relates to the field of information processing technology, and in particular to a codebook processing method, terminal device, network device, and computer storage medium, chip, computer-readable storage medium, computer program product, and computer program.
  • the existing NR type II codebook is independently coded in the frequency domain. Due to the high spatial quantization accuracy, the total feedback volume is too large.
  • the feedback frequency-space joint codebook can greatly save the feedback volume under the condition of ensuring NR performance.
  • the R16 NR type II codebook can be expressed as Where W 1 indicates 2L spatial beams (beam), Used to indicate M discrete Fourier transform (Discrete Fourier Transform, DFT) basis vectors; Is the weighting factor.
  • W 1 indicates 2L spatial beams (beam), Used to indicate M discrete Fourier transform (Discrete Fourier Transform, DFT) basis vectors; Is the weighting factor.
  • embodiments of the present invention provide a codebook processing method, terminal device, network device, and computer storage medium, chip, computer readable storage medium, computer program product, and computer program.
  • a codebook processing method which is applied to a terminal device, and the method includes:
  • a codebook processing method is provided, which is applied to a network device.
  • the method includes:
  • a corresponding codebook is determined based on the quantized weighting coefficient information, and downlink channel information of the terminal device is determined based on the determined codebook.
  • a terminal device including:
  • the first processing unit determines at least non-quantized weighting coefficients used for codebook calculation based on the first quantity and the second quantity; quantizes the non-quantized weighting coefficients to obtain quantized weighting coefficients;
  • the first communication unit sends at least the quantized weighting coefficient used for codebook calculation to the network side.
  • a network device including:
  • the second communication unit receives information from the terminal device that contains the quantized weighting coefficients used for codebook calculation
  • the second processing unit determines a corresponding codebook based on the quantized weighting coefficient information, and determines downlink channel information of the terminal device based on the determined codebook.
  • a terminal device including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory to execute the method in the first aspect or its various implementations.
  • a network device including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory to execute the method in the above-mentioned second aspect or various implementations thereof.
  • a chip is provided for implementing any one of the above-mentioned first and third aspects or the method in each of the implementation manners.
  • the chip includes: a processor, for calling and running a computer program from the memory, so that the device installed with the chip executes the method as described in the first aspect, the second aspect, or various implementations thereof.
  • a computer-readable storage medium for storing a computer program that causes a computer to execute the method in any one of the above-mentioned first and second aspects or various implementations thereof.
  • a computer program product which includes computer program instructions, which cause the computer to execute the method in any one of the above-mentioned first and second aspects or various implementations thereof.
  • a computer program which, when run on a computer, causes the computer to execute the method in any one of the above-mentioned first and second aspects or various implementations thereof.
  • the weighting coefficients required for codebook calculation can be quantized, and the weighted coefficients after the quantization can be reported, so that when reporting the relevant parameters of the codebook calculation, the length of the reported message is saved, and the performance overhead is obtained. Compromise effect.
  • FIG. 1 is a schematic diagram 1 of a communication system architecture provided by an embodiment of the present application.
  • FIG. 2 is a schematic flowchart 1 of a codebook processing method provided by an embodiment of the present application.
  • FIG. 3 is a schematic diagram of a non-quantized weighting coefficient list according to an embodiment of the present application.
  • FIG. 4 is a schematic diagram of a first amplitude quantization level table provided by an embodiment of this application.
  • FIG. 5 is a schematic diagram 1 of a quantization result provided by an embodiment of the present application.
  • FIG. 6 is a schematic diagram of a second amplitude quantization level table provided by an embodiment of this application.
  • FIG. 7 is a schematic diagram 2 of a quantization result provided by an embodiment of the present application.
  • FIG. 8 is a schematic diagram of a third amplitude quantization level table provided by an embodiment of this application.
  • FIG. 9 is a second schematic flowchart of a codebook processing method provided by an embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of a terminal device provided by an embodiment of the present application.
  • FIG. 11 is a schematic structural diagram of a network device composition provided by an embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of a composition of a communication device according to an embodiment of the present invention.
  • FIG. 13 is a schematic block diagram of a chip provided by an embodiment of the present application.
  • FIG. 14 is a schematic diagram 2 of a communication system architecture provided by an embodiment of the present application.
  • Figure 15 is a schematic diagram of an effect comparison.
  • GSM Global System of Mobile
  • CDMA Code Division Multiple Access
  • WCDMA broadband code division multiple access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Freq terminal equipment ncy Division Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • WiMAX Global Interoperability for Microwave Access
  • the communication system 100 applied in the embodiments of the present application may be as shown in FIG. 1.
  • the communication system 100 may include a network device 110, and the network device 110 may be a device that communicates with a terminal device 120 (or referred to as a communication terminal, terminal).
  • the network device 110 can provide communication coverage for a specific geographic area, and can communicate with terminal devices located within the coverage area.
  • the network device 110 may be a base station (Base Transceiver Station, BTS) in a GSM system or a CDMA system, a base station (NodeB, NB) in a WCDMA system, or an evolved base station in an LTE system (Evolutional Node B, eNB or eNodeB), or a wireless controller in the Cloud Radio Access Network (CRAN), or the network equipment can be a mobile switching center, a relay station, an access point, an in-vehicle device, Wearable devices, hubs, switches, bridges, routers, network-side devices in 5G networks or network devices in future public land mobile networks (Public Land Mobile Network, PLMN), etc.
  • BTS Base Transceiver Station
  • NodeB, NB base station
  • LTE Long Term Evolutional Node B
  • eNodeB evolved base station in an LTE system
  • CRAN Cloud Radio Access Network
  • the network equipment can be a mobile switching center, a relay station, an access point, an in-veh
  • the communication system 100 also includes at least one terminal device 120 within the coverage of the network device 110.
  • terminal equipment includes, but is not limited to, connections via wired lines, such as via Public Switched Telephone Networks (PSTN), Digital Subscriber Lines (DSL), digital cables, and direct cable connections ; And/or another data connection/network; and/or via wireless interfaces, such as for cellular networks, wireless local area networks (Wireless Local Area Network, WLAN), digital TV networks such as DVB-H networks, satellite networks, AM- FM broadcast transmitter; and/or another terminal device configured to receive/transmit communication signals; and/or Internet of Things (IoT) equipment.
  • PSTN Public Switched Telephone Networks
  • DSL Digital Subscriber Lines
  • WLAN wireless local area networks
  • digital TV networks such as DVB-H networks, satellite networks, AM- FM broadcast transmitter
  • IoT Internet of Things
  • a terminal device set to communicate through a wireless interface may be referred to as a "wireless communication terminal", “wireless terminal”, or “mobile terminal”.
  • mobile terminals include, but are not limited to, satellite or cellular telephones; Personal Communication Systems (PCS) terminals that can combine cellular radiotelephones with data processing, facsimile, and data communication capabilities; may include radiotelephones, pagers, Internet/internal PDA with networked access, web browser, notepad, calendar, and/or Global Positioning System (GPS) receiver; and conventional laptop and/or palm-type receivers or others including radiotelephone transceivers Electronic device.
  • PCS Personal Communication Systems
  • GPS Global Positioning System
  • Terminal equipment can refer to access terminal, user equipment (User Equipment), user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent Or user device.
  • Access terminals can be cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, wireless local loop (Wireless Local Loop, WLL) stations, personal digital processing (Personal Digital Assistant (PDA), wireless communication Functional handheld devices, computing devices, or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in 5G networks, or terminal devices in PLMNs that will evolve in the future, etc.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • terminal device 120 may perform terminal direct connection (Device to Device, D2D) communication.
  • D2D Terminal Direct connection
  • the 5G system or 5G network may also be referred to as a New Radio (NR) system or NR network.
  • NR New Radio
  • FIG. 1 exemplarily shows one network device and two terminal devices.
  • the communication system 100 may include multiple network devices and each network device may include other numbers of terminal devices within the coverage area. This application The embodiment does not limit this.
  • the communication system 100 may further include other network entities such as a network controller, a mobility management entity, etc. This embodiment of the present application does not limit this.
  • the devices with communication functions in the network/system in the embodiments of the present application may be referred to as communication devices.
  • the communication device may include a network device 110 and a terminal device 120 with a communication function, and the network device 110 and the terminal device 120 may be the specific devices described above, which will not be repeated here.
  • the communication device may also include other devices in the communication system 100, such as network controllers, mobility management entities, and other network entities, which are not limited in the embodiments of the present application.
  • This embodiment provides a codebook processing method, which is applied to a terminal device, as shown in FIG. 2, and includes:
  • Step 21 Based on the first quantity and the second quantity, at least determine the non-quantized weighting coefficients used for codebook calculation;
  • Step 22 Quantize the non-quantized weighting coefficients to obtain quantized weighting coefficients
  • Step 23 At least send the quantized weighting coefficients used for codebook calculation to the network side.
  • the foregoing first quantity and second quantity may be L and M values, respectively, L value is half the number of spatial beams, and M value is the number of DFT base vectors. Both L and M are integers.
  • step 21 based on the first quantity and the second quantity, at least determining the non-quantized weighting coefficient for the codebook calculation may include:
  • W 1 indicates 2L spatial beams (beam), Used to indicate M DFT basis vectors,
  • the non-quantized weighting coefficient may be That is, (2L*M) indicates the weighting coefficient of any spatial beam and frequency domain DFT vector pair.
  • non-quantized weighting coefficients need to be quantized, and the following three processing scenarios can be specifically implemented:
  • Performing quantization processing on the non-quantization weighting coefficients includes: sequentially determining whether the amplitude corresponding to the non-quantization weighting coefficients to be processed is 0 based on a preset order;
  • the non-zero amplitude of the non-quantized weighting coefficient is quantized as the encoded value; otherwise, the zero amplitude of the non-quantized weighting coefficient is quantized as the first value of 1 bit.
  • the quantizing the non-zero amplitude of the non-quantized weighting coefficients into coded values includes:
  • the first bit in the non-zero amplitude coded value of the non-quantized weighting coefficient is a second value; the second value is different from the first value.
  • non-zero amplitudes are quantized with A bits, phase B quantization, and amplitude 0 (lowest level) with 1 bit quantization.
  • the order of quantization may be one by one, followed by columns, or followed by columns.
  • the line may be a 2L line, and each line contains M non-quantized weighting coefficients.
  • the order of precedence followed by columns means that the quantization starts from the leftmost (or first) non-quantized weighting coefficient of the first row until the Mth non-quantized weighting coefficient of the 2Lth row.
  • the quantization processing is performed on the amplitude and phase of each non-quantized weighting coefficient, and the phase is not described in detail in this embodiment. The following focuses on the quantification of amplitude.
  • the corresponding encoded value is determined by the preset first amplitude quantization level table; where each encoded value can pass the first Binary values indicate that the quantized element is a non-zero quantized element. If the amplitude of the non-quantized weighting coefficient to be quantized corresponding to the current non-quantization weighting coefficient is 0, then the first value is used for representation.
  • the first value is different from the second value.
  • the first value can be 0 and the second value can be 1.
  • the reverse is also possible, but it is not exhaustive.
  • bit 0 is added.
  • both A and B are integers, and the specific number of bits is used to indicate that it can be set according to the actual situation, which will not be repeated in this embodiment.
  • the quantized weighting coefficients used for codebook calculation are sent to the network side.
  • the terminal device may report the total CSI message length (contained in CSI part1) and the sequence containing the quantized weighting coefficients. Among them, the reported message can be set according to the actual situation.
  • FIG. 4 shows a first amplitude quantization level table, which shows code values corresponding to various non-quantized amplitudes.
  • FIG. 5 shows that after quantizing each non-quantization weighting coefficient in FIG. 3 using the first amplitude quantization level table of FIG. 4, corresponding quantization weighting coefficients are obtained, wherein non-zero amplitudes correspond to encoded values, and each encoding The first bit of the value is the second value; for the amplitude of 0, it is directly set to the first value, which is 0.
  • the amplitude quantization sequence finally reported may include:
  • Performing quantization processing on the non-quantization weighting coefficients includes: sequentially determining whether the amplitude corresponding to the non-quantization weighting coefficients to be processed is 0 based on a preset order;
  • the non-zero amplitude of the non-quantized weighting coefficient is quantized as the encoded value; otherwise, the zero amplitude of the non-quantized weighting coefficient is quantized as the first value of 1 bit.
  • the quantization of non-zero amplitudes into coded values includes:
  • the second amplitude quantization level table satisfies the different pre-precedence.
  • processing scenario 1 The difference from processing scenario 1 is that different quantization level tables are used in this scenario, and the quantization level tables used in this scenario satisfy the different preposition, that is to say, different quantization levels in the second amplitude quantization level table Corresponding to different encoding values, any element in any codeword set is not a prefix of other elements.
  • the order of quantization may be one by one, followed by columns, or followed by columns.
  • the line may be a 2L line, and each line contains M non-quantized weighting coefficients.
  • the order of precedence followed by columns means that the quantization starts from the leftmost (or first) non-quantized weighting coefficient of the first row until the Mth non-quantized weighting coefficient of the 2Lth row.
  • the quantization processing is performed on the amplitude and phase of each non-quantized weighting coefficient, and the phase is not described in detail in this embodiment. The following focuses on the quantification of amplitude.
  • the terminal equipment The quantization process is performed, and the amplitude-phase quantization level table satisfies the heterogeneity.
  • the quantization lengths of amplitude A bit and phase B bit need not be the same, and amplitude 0 (lowest level) is quantized with 1 bit.
  • the quantized weighting coefficients used for codebook calculation are sent to the network side.
  • the terminal device may report the total CSI message length (contained in CSI part1) and the sequence containing the quantized weighting coefficients. Among them, the reported message can be set according to the actual situation.
  • the pre-configured second amplitude quantization level table in this processing scenario is shown in FIG. 6.
  • the first N bits of the encoded value corresponding to different non-zero amplitudes are different, that is, the first 3 bits in the figure are different.
  • the final report sequence is (only the amplitude) [1110][101]0000000000[100]000; and the total sequence length is reported in the first part of the CSI.
  • This processing scene is different from the previous two processing scenes. In this scene, processing is not performed on 0 amplitude, but only on non-zero elements, that is, non-zero amplitude. Specifically:
  • the quantizing the non-quantized weighting coefficients to obtain quantized weighting coefficients includes:
  • K non-zero amplitude quantized weighting coefficients are selected; K is an integer greater than or equal to 1.
  • the sending at least the quantized weighting coefficient used for codebook calculation to the network side includes:
  • Add K to the first part of the CSI add the K coded values and their positions to the second part of the CSI; send the CSI to the network side.
  • the terminal device selects K non-zero elements for reporting according to the degree of sparsity of the non-quantized weighting coefficients.
  • the terminal device reports K in CSI part1 (part 1) (K may be a specific value or an indication). Report the position of K non-zero elements in the 2LM in CSI part 2 (Part 2), and report K (non-zero) amplitude-phase quantization values in sequence.
  • the aforementioned K may be long-term feedback.
  • the K value is reported every time it is reported.
  • the K code values and corresponding positions may not be sent every time they are reported.
  • the positions of K non-zero elements in 2LM can be similarly combined.
  • the third amplitude quantization level table may be the same as the first amplitude quantization level table provided in Scene 1, or it may be the same as the second amplitude quantization level table provided in Scene 2; or, it may be another type of table. It is just not exhaustive in this embodiment.
  • FIG. 8 is a corresponding list of code values corresponding to non-zero amplitudes of different non-quantized weighting coefficients.
  • the weighting coefficients required for codebook calculation can be quantized, so that when reporting the relevant parameters of the codebook calculation, the length of the reported message is saved, and a compromise effect of performance overhead is obtained.
  • This embodiment provides a codebook processing method, which is applied to a network device, as shown in FIG. 9, and includes:
  • Step 31 Receive information from the terminal device that contains the quantized weighting coefficients used for codebook calculation
  • Step 32 Determine a corresponding codebook based on the quantized weighting coefficient information, and determine downlink channel information of the terminal device based on the determined codebook.
  • the information sent by the receiving terminal device and containing the quantized weighting coefficients used for codebook calculation may include:
  • W 1 indicates 2L spatial beams (beam), Used to indicate M DFT basis vectors,
  • the non-quantized weighting coefficient may be That is, (2L*M) indicates the weighting coefficient of any spatial beam and frequency domain DFT vector pair.
  • non-quantized weighting coefficients need to be quantized, and the following three processing scenarios can be specifically implemented:
  • the corresponding non-quantized weighting coefficient is determined based on the encoded value of the quantized weighting coefficient and the first amplitude quantization level table;
  • bits are sequentially extracted from the sequence, and the extracted bits are determined to be the first value or the second value;
  • the currently parsed bit is the second value, it means that the A+B bit behind the bit is the non-zero amplitude code value and the corresponding phase value; for example, if the bit is 1, then the A+ B bits represent the amplitude and phase message of the position (in accordance with the first row and the second column); A and B are both integers, and A and B are not necessarily the same.
  • the currently parsed bit is the first value, it means that the amplitude of the non-quantized weighting coefficient corresponding to the bit is 0; for example, if the bit is 0, it means that the position is filled with zero;
  • the above processing is executed cyclically until the code values in the sequence are all parsed. For example, when 2L*M elements are included, all translations are required.
  • the foregoing analysis method for the encoded value of the non-zero amplitude may be determined based on the first amplitude quantization level table.
  • the first amplitude quantization level table is the same as that in Embodiment 1, and is not described in detail.
  • the relationship between the sequence of weighting coefficients and the positions of non-quantized weighting coefficients may be from left to right and from top to bottom.
  • the first non-quantized weighting coefficient obtained by analysis is the first line.
  • the first amplitude value; the second is the second amplitude value in the first row.
  • the corresponding non-quantized weighting coefficient is determined based on the target code value.
  • the second amplitude quantization level table satisfies the different pre-precedence.
  • processing scenario 1 The difference from processing scenario 1 is that different quantization level tables are used in this scenario, and the quantization level tables used in this scenario satisfy the different preposition, that is to say, different quantization levels in the second amplitude quantization level table Corresponding to different encoding values, any element in any codeword set is not a prefix of other elements.
  • the corresponding quantization sequence can be translated through the reported CSI message length.
  • Each bit is read into the buffer until the read bit sequence is a coded value in the second amplitude quantization level table; the amplitude value corresponding to the coded value is determined based on the second amplitude quantization level table;
  • the relationship between the sequence of weighting coefficients and the positions of non-quantized weighting coefficients may be from left to right and from top to bottom.
  • the first non-quantized weighting coefficient obtained by analysis is the first line.
  • the first amplitude value; the second is the second amplitude value in the first row.
  • This processing scene is different from the previous two processing scenes. In this scene, processing is not performed on 0 amplitude, but only on non-zero elements, that is, non-zero amplitude. Specifically:
  • non-quantized weighting coefficients and their corresponding positions are determined.
  • the third amplitude quantization level table may be the same as the first amplitude quantization level table provided in Scene 1, or it may be the same as the second amplitude quantization level table provided in Scene 2; or, it may be another type of table. It is just not exhaustive in this embodiment.
  • the network device receives the K value; and receives the position of the K elements; and determines the amplitude value of the non-quantized weighting coefficient corresponding to each coded value according to a preset quantization level table.
  • the positions of the K elements may correspond to the encoded values one by one; that is, the first resolved position indicates the position of the first acquired encoded value; Furthermore, the amplitude value corresponding to the encoded value is determined based on the third amplitude quantization level table, and the amplitude value is added to the corresponding position.
  • network equipment can The downlink channel information; the specific calculation method is not repeated in this embodiment.
  • the weighting coefficients required for codebook calculation can be quantized, so that when reporting the relevant parameters of the codebook calculation, the length of the reported message is saved, and a compromise effect of performance overhead is obtained.
  • This embodiment provides a terminal device, as shown in FIG. 10, including:
  • the first processing unit 41 determines at least non-quantized weighting coefficients for codebook calculation based on the first quantity and the second quantity; performs quantization processing on the non-quantized weighting coefficients to obtain quantized weighting coefficients;
  • the first communication unit 42 sends at least the quantized weighting coefficient used for codebook calculation to the network side.
  • the foregoing first quantity and second quantity may be L and M values, respectively, L value is half the number of spatial beams, and M value is the number of DFT base vectors.
  • the aforementioned first processing unit 41 calculates W 1 based on the first quantity and the second quantity (ie, L and M values), And non-quantized weighting coefficients
  • W 1 indicates 2L spatial beams (beam), Used to indicate M DFT basis vectors,
  • the non-quantized weighting coefficient may be That is, (2L*M) indicates the weighting coefficient of any spatial beam and frequency domain DFT vector pair.
  • non-quantized weighting coefficients need to be quantized, and the following three processing scenarios can be specifically implemented:
  • the first processing unit 41 based on the preset order, sequentially determines whether the amplitude corresponding to the non-quantized weighting coefficient to be processed is 0;
  • the non-zero amplitude of the non-quantized weighting coefficient is quantized as the encoded value; otherwise, the zero amplitude of the non-quantized weighting coefficient is quantized as the first value of 1 bit.
  • the first processing unit 41 determines the non-zero amplitude coding value of the non-quantized weighting coefficient based on the preset first amplitude quantization level table;
  • the first bit in the non-zero amplitude coded value of the non-quantized weighting coefficient is a second value; the second value is different from the first value.
  • non-zero amplitudes are quantized using A bits, phase B-bit quantization, and amplitude 0 (lowest level) are quantized with 1 bit.
  • the order of quantization may be one by one, followed by columns, or followed by columns.
  • the line may be a 2L line, and each line contains M non-quantized weighting coefficients.
  • the order of precedence followed by columns means that the quantization starts from the leftmost (or first) non-quantized weighting coefficient of the first row until the Mth non-quantized weighting coefficient of the 2Lth row.
  • the quantization processing is performed on the amplitude and phase of each non-quantized weighting coefficient, and the phase is not described in detail in this embodiment. The following focuses on the quantification of amplitude.
  • the corresponding encoded value is determined by the preset first amplitude quantization level table; where each encoded value can pass the first Binary values indicate that the quantized element is a non-zero quantized element. If the amplitude of the non-quantized weighting coefficient to be quantized corresponding to the current non-quantization weighting coefficient is 0, then the first value is used for representation.
  • the first value is different from the second value.
  • the first value can be 0 and the second value can be 1.
  • the reverse is also possible, but it is not exhaustive.
  • bit 0 is added.
  • both A and B are integers, and the specific number of bits is used to indicate that it can be set according to the actual situation, which will not be repeated in this embodiment.
  • the first communication unit 42 sends at least the quantized weighting coefficients used for codebook calculation to the network side.
  • the terminal device may report the total CSI message length (contained in CSI part1) and the sequence containing the quantized weighting coefficients. Among them, the reported message can be set according to the actual situation.
  • FIG. 4 shows a first amplitude quantization level table, which shows code values corresponding to various non-quantized amplitudes.
  • FIG. 5 shows that after quantizing each non-quantization weighting coefficient in FIG. 3 using the first amplitude quantization level table of FIG. 4, corresponding quantization weighting coefficients are obtained, wherein non-zero amplitudes correspond to encoded values, and each encoding The first bit of the value is the second value; for the amplitude of 0, it is directly set to the first value, which is 0.
  • the amplitude quantization sequence finally reported may include:
  • the first processing unit 41 based on the preset order, sequentially determines whether the amplitude corresponding to the non-quantized weighting coefficient to be processed is 0;
  • the non-zero amplitude of the non-quantized weighting coefficient is quantized as the encoded value; otherwise, the zero amplitude of the non-quantized weighting coefficient is quantized as the first value of 1 bit.
  • the first processing unit 41 determines a non-zero amplitude coding value based on a preset second amplitude quantization level table
  • the second amplitude quantization level table satisfies the different pre-precedence.
  • processing scenario 1 The difference from processing scenario 1 is that different quantization level tables are used in this scenario, and the quantization level tables used in this scenario satisfy the different preposition, that is to say, different quantization levels in the second amplitude quantization level table Corresponding to different encoding values, and the first N of each different encoding value is different encoding; for example, the first 3 bits of the encoding value may be different for each encoding value.
  • the order of quantization may be one by one, followed by columns, or followed by columns.
  • the line may be a 2L line, and each line contains M non-quantized weighting coefficients.
  • the order of precedence followed by columns means that the quantization starts from the leftmost (or first) non-quantized weighting coefficient of the first row until the Mth non-quantized weighting coefficient of the 2Lth row.
  • the quantization processing is performed on the amplitude and phase of each non-quantized weighting coefficient, and the phase is not described in detail in this embodiment. The following focuses on the quantification of amplitude.
  • the amplitude-phase quantization level table satisfies the heterogeneity.
  • the quantization lengths of amplitude A bit and phase B bit need not be the same, and amplitude 0 (lowest level) is quantized with 1 bit.
  • the first communication unit 42 sends at least the quantized weighting coefficients used for codebook calculation to the network side. It may be a sequence reporting the total CSI message length (contained in CSI part1) and containing quantized weighting coefficients. Among them, the reported message can be set according to the actual situation.
  • the pre-configured second amplitude quantization level table in this processing scenario is shown in FIG. 6.
  • the first N bits of the encoded value corresponding to different non-zero amplitudes are different, that is, the first 3 bits in the figure are different.
  • the final reported sequence is (only the amplitude) [1110][101]0000000000[100]000; and the total sequence length is reported in CSI part1.
  • This processing scene is different from the previous two processing scenes. In this scene, processing is not performed on 0 amplitude, but only on non-zero elements, that is, non-zero amplitude. Specifically:
  • the first processing unit 41 determines, based on a preset third amplitude quantization level table, the encoded value of the non-quantized weighting coefficient used for codebook calculation, and uses the encoded value as the quantized weighting coefficient;
  • K non-zero amplitude quantized weighting coefficients are selected; K is an integer greater than or equal to 1.
  • the first communication unit 42 adds K to the first part of the CSI, adds the K coded values and their positions to the second part of the CSI, and sends the CSI to the network side.
  • the terminal device selects K non-zero elements for reporting according to the degree of sparsity of the non-quantized weighting coefficients.
  • the terminal device reports K in CSI part1 (part 1) (K may be a specific value or an indication). Report the position of K non-zero elements in the 2LM in CSI part 2 (Part 2), and report K (non-zero) amplitude-phase quantization values in sequence.
  • the aforementioned K may be long-term feedback. That is to say, the K value is reported every time it is reported; and the K coded values and corresponding positions may not be sent every time they are reported.
  • the positions of K non-zero elements in 2LM can be similarly combined.
  • the third amplitude quantization level table may be the same as the first amplitude quantization level table provided in Scene 1, or it may be the same as the second amplitude quantization level table provided in Scene 2; or, it may be another type of table. It is just not exhaustive in this embodiment.
  • FIG. 8 is a corresponding list of code values corresponding to non-zero amplitudes of different non-quantized weighting coefficients.
  • the weighting coefficients required for codebook calculation can be quantized, so that when reporting the relevant parameters of the codebook calculation, the length of the reported message is saved, and a compromise effect of performance overhead is obtained.
  • This embodiment provides a network device, as shown in FIG. 11, including:
  • the second communication unit 51 receives information from the terminal device that contains the quantized weighting coefficients used for codebook calculation;
  • the second processing unit 52 determines a corresponding codebook based on the quantized weighting coefficient information, and determines downlink channel information of the terminal device based on the determined codebook.
  • the second communication unit 51 receives W 1 from the terminal device, And non-quantized weighting coefficients;
  • W 1 indicates 2L spatial beams (beam), Used to indicate M DFT basis vectors,
  • the non-quantized weighting coefficient may be That is, (2L*M) indicates the weighting coefficient of any spatial beam and frequency domain DFT vector pair.
  • non-quantized weighting coefficients need to be quantized, and the following three processing scenarios can be specifically implemented:
  • the second processing unit 52 sequentially analyzes the bits of the sequence containing the quantized weighting coefficients used for codebook calculation
  • the corresponding non-quantized weighting coefficient is determined based on the encoded value of the quantized weighting coefficient and the first amplitude quantization level table;
  • bits are sequentially extracted from the sequence, and the extracted bits are determined to be the first value or the second value;
  • the currently parsed bit is the second value, it means that the A+B bit behind the bit is the non-zero amplitude code value and the corresponding phase value; for example, if the bit is 1, then the A+ B bits represent the amplitude and phase message of the position (in accordance with the first row and the second column); A and B are both integers, and A and B are not necessarily the same.
  • the currently parsed bit is the first value, it means that the amplitude of the non-quantized weighting coefficient corresponding to the bit is 0; for example, if the bit is 0, it means that the position is filled with zero;
  • the above processing is executed cyclically until the code values in the sequence are all parsed. For example, when 2L*M elements are included, all translations are required.
  • the foregoing analysis method for the encoded value of the non-zero amplitude may be determined based on the first amplitude quantization level table.
  • the first amplitude quantization level table is the same as that in Embodiment 1, and is not described in detail.
  • the relationship between the sequence of weighting coefficients and the positions of non-quantized weighting coefficients may be from left to right and from top to bottom.
  • the first non-quantized weighting coefficient obtained by analysis is the first line.
  • the first amplitude value; the second is the second amplitude value in the first row.
  • the second processing unit 52 obtains the sequence containing the quantized weighting coefficients used for codebook calculation according to the length of the CSI message;
  • the corresponding non-quantized weighting coefficient is determined based on the target code value.
  • the second amplitude quantization level table satisfies the different pre-precedence.
  • processing scenario 1 The difference from processing scenario 1 is that different quantization level tables are used in this scenario, and the quantization level tables used in this scenario satisfy the different preposition, that is to say, different quantization levels in the second amplitude quantization level table Corresponding to different encoding values, any element in any codeword set is not a prefix of other elements.
  • the corresponding quantization sequence can be translated through the reported CSI message length.
  • Each bit is read into the buffer until the read bit sequence is a coded value in the second amplitude quantization level table; the amplitude value corresponding to the coded value is determined based on the second amplitude quantization level table;
  • the relationship between the sequence of weighting coefficients and the positions of non-quantized weighting coefficients may be from left to right and from top to bottom.
  • the first non-quantized weighting coefficient obtained by analysis is the first line.
  • the first amplitude value; the second is the second amplitude value in the first row.
  • This processing scene is different from the previous two processing scenes. In this scene, processing is not performed on 0 amplitude, but only on non-zero elements, that is, non-zero amplitude. Specifically:
  • the second processing unit 52 parses the positions corresponding to the K code values; and obtains the K code values corresponding to each position;
  • non-quantized weighting coefficients and their corresponding positions are determined.
  • the third amplitude quantization level table may be the same as the first amplitude quantization level table provided in Scene 1, or it may be the same as the second amplitude quantization level table provided in Scene 2; or, it may be another type of table. It is just not exhaustive in this embodiment.
  • the network device receives the K value; and receives the position of the K elements; and determines the amplitude value of the non-quantized weighting coefficient corresponding to each coded value according to a preset quantization level table.
  • the positions of the K elements may correspond to the encoded values one by one; that is, the first resolved position indicates the position of the first acquired encoded value; Furthermore, the amplitude value corresponding to the encoded value is determined based on the third amplitude quantization level table, and the amplitude value is added to the corresponding position.
  • network equipment can The downlink channel information; the specific calculation method is not repeated in this embodiment.
  • the weighting coefficients required for codebook calculation can be quantized, so that when reporting the relevant parameters of the codebook calculation, the length of the reported message is saved, and a compromise effect of performance overhead is obtained.
  • FIG. 12 is a schematic structural diagram of a communication device 600 provided by an embodiment of the present application.
  • the communication device may be the foregoing terminal device or network device of this embodiment.
  • the communication device 600 shown in FIG. 6 includes a processor 610, and the processor 610 can call and run a computer program from the memory to implement the method in the embodiments of the present application.
  • the communication device 600 may further include a memory 620.
  • the processor 610 can call and run a computer program from the memory 620 to implement the method in the embodiments of the present application.
  • the memory 620 may be a separate device independent of the processor 610, or may be integrated in the processor 610.
  • the communication device 600 may further include a transceiver 630, and the processor 610 may control the transceiver 630 to communicate with other devices, specifically, may send information or data to other devices, or receive other Information or data sent by the device.
  • the transceiver 630 may include a transmitter and a receiver.
  • the transceiver 630 may further include antennas, and the number of antennas may be one or more.
  • the communication device 600 may specifically be a network device according to an embodiment of the present application, and the communication device 600 may implement the corresponding process implemented by the network device in each method of the embodiment of the present application. .
  • the communication device 600 may specifically be a terminal device or a network device according to an embodiment of the present application, and the communication device 600 may implement the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiment of the present application. It is concise and will not be repeated here.
  • FIG. 13 is a schematic structural diagram of a chip according to an embodiment of the present application.
  • the chip 700 shown in FIG. 13 includes a processor 710, and the processor 710 can call and run a computer program from the memory to implement the method in the embodiment of the present application.
  • the chip 700 may further include a memory 720.
  • the processor 710 can call and run a computer program from the memory 720 to implement the method in the embodiments of the present application.
  • the memory 720 may be a separate device independent of the processor 710, or may be integrated in the processor 710.
  • the chip 700 may further include an input interface 730.
  • the processor 710 can control the input interface 730 to communicate with other devices or chips. Specifically, it can obtain information or data sent by other devices or chips.
  • the chip 700 may further include an output interface 740.
  • the processor 710 can control the output interface 740 to communicate with other devices or chips. Specifically, it can output information or data to other devices or chips.
  • the chip may be applied to the network device in the embodiment of the present application, and the chip may implement the corresponding process implemented by the network device in each method of the embodiment of the present application.
  • the chip may be applied to the network device in the embodiment of the present application, and the chip may implement the corresponding process implemented by the network device in each method of the embodiment of the present application.
  • the chip can be applied to the terminal device in the embodiment of the present application, and the chip can implement the corresponding process implemented by the terminal device in each method of the embodiment of the present application.
  • the chip can implement the corresponding process implemented by the terminal device in each method of the embodiment of the present application.
  • chips mentioned in the embodiments of the present application may also be referred to as system-level chips, system chips, chip systems, or system-on-chip chips.
  • the communication system 800 includes a terminal device 810 and a network device 820.
  • the terminal device 810 can be used to implement the corresponding function implemented by the terminal device in the above method
  • the network device 820 can be used to implement the corresponding function implemented by the network device in the above method.
  • FIG. 15 shows the effect obtained by the solution provided by the above embodiment.
  • the horizontal axis represents the number of bits and the vertical axis represents the power saved.
  • the triangle connection represents the solution provided by this embodiment. It can be seen that the solution provided by this embodiment The scheme can use fewer bits and save more power.
  • the processor in the embodiment of the present application may be an integrated circuit chip, which has signal processing capabilities.
  • the steps of the foregoing method embodiments may be completed by instructions in the form of hardware integrated logic circuits or software in the processor.
  • the aforementioned processor may be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), an existing programmable gate array (Field Programmable Gate Array, FPGA), or other available Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application may be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied and executed by a hardware decoding processor, or may be executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, and a register.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiments of the present application may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electronically Erase Programmable Read Only Memory (Electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data Rate SDRAM DDR SDRAM
  • enhanced SDRAM ESDRAM
  • Synchlink DRAM SLDRAM
  • Direct Rambus RAM Direct Rambus RAM
  • the memory in the embodiments of the present application may also be static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), Synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data) SDRAM (DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection Dynamic random access memory (synch link DRAM, SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DR RAM) and so on. That is to say, the memories in the embodiments of the present application are intended to include but are not limited to these and any other suitable types of memories.
  • Embodiments of the present application also provide a computer-readable storage medium for storing computer programs.
  • the computer-readable storage medium may be applied to the network device in the embodiments of the present application, and the computer program causes the computer to execute the corresponding process implemented by the network device in each method of the embodiments of the present application.
  • the computer program causes the computer to execute the corresponding process implemented by the network device in each method of the embodiments of the present application.
  • the computer-readable storage medium can be applied to the terminal device in the embodiments of the present application, and the computer program enables the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiments of the present application, for simplicity And will not be repeated here.
  • An embodiment of the present application also provides a computer program product, including computer program instructions.
  • the computer program product may be applied to the network device in the embodiments of the present application, and the computer program instructions cause the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present application. Repeat again.
  • the computer program product can be applied to the mobile terminal/terminal device in the embodiments of the present application, and the computer program instructions cause the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiments of the present application, For brevity, I will not repeat them here.
  • An embodiment of the present application also provides a computer program.
  • the computer program can be applied to the network device in the embodiment of the present application.
  • the computer program runs on the computer, the computer is allowed to execute the corresponding process implemented by the network device in each method of the embodiment of the present application. And will not be repeated here.
  • the computer program can be applied to the mobile terminal/terminal device in the embodiments of the present application, and when the computer program runs on the computer, the computer is implemented by the mobile terminal/terminal device in performing various methods of the embodiments of the present application For the sake of brevity, I will not repeat them here.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the unit is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical, or other forms.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or may be distributed on multiple 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.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • the technical solution of the present application essentially or part of the contribution to the existing technology or part of the technical solution can be embodied in the form of a software product
  • the computer software product is stored in a storage medium, including Several instructions are used to enable a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, Read-Only Memory (ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code .

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

本发明公开了一种码本处理方法、终端设备、网络设备、芯片、计算机可读存储介质、计算机程序产品以及计算机程序，所述方法包括：基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；对所述非量化加权系数进行量化处理，得到量化后的加权系数；至少将用于码本计算的量化后的加权系数发送至网络侧。

Description

一种码本处理方法、终端设备及网络设备 技术领域
本发明涉及信息处理技术领域，尤其涉及一种码本处理方法、终端设备、网络设备及计算机存储介质、芯片、计算机可读存储介质、计算机程序产品以及计算机程序。
背景技术
现有NR type II码本在频域独立编码，由于空间量化精度高，导致总的反馈量太大,通过反馈频域-空间联合码本，在保证NR性能的条件下，可以大大节省反馈量。R16 NR type II码本可以表示为
Figure PCTCN2019070708-appb-000001
其中W 1指示2L个空间波束(beam)，
Figure PCTCN2019070708-appb-000002
用来指示M个离散傅里叶变换(Discrete Fourier Transform，DFT)基向量；
Figure PCTCN2019070708-appb-000003
为加权系数。目前，针对如何对终端设备向网络侧上报的参数中，尤其是非量化加权系数进行处理，以节省上报消息的长度是需要解决的问题。
发明内容
为解决上述技术问题，本发明实施例提供了一种码本处理方法、终端设备、网络设备及计算机存储介质、芯片、计算机可读存储介质、计算机程序产品以及计算机程序。
第一方面，提供了一种码本处理方法，应用于终端设备，所述方法包括：
基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；
对所述非量化加权系数进行量化处理，得到量化后的加权系数；
至少将用于码本计算的量化后的加权系数发送至网络侧。
第二方面，提供了一种码本处理方法，应用于网络设备，所述方法包括：
接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
第三方面，提供了一种终端设备，包括：
第一处理单元，基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；对所述非量化加权系数进行量化处理，得到量化后的加权系数；
第一通信单元，至少将用于码本计算的量化后的加权系数发送至网络侧。
第四方面，提供了一种网络设备，包括：
第二通信单元，接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
第二处理单元，基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
第五方面，提供了一种终端设备，包括处理器和存储器。该存储器用于存储计算机程序，该处理器用于调用并运行该存储器中存储的计算机程序，执行上述第一方面或其各实现方式中的方法。
第六方面，提供了一种网络设备，包括处理器和存储器。该存储器用于存储计算机 程序，该处理器用于调用并运行该存储器中存储的计算机程序，执行上述第二方面或其各实现方式中的方法。
第七方面，提供了一种芯片，用于实现上述第一方面、第三方面中的任一方面或其各实现方式中的方法。
具体地，该芯片包括：处理器，用于从存储器中调用并运行计算机程序，使得安装有该芯片的设备执行如上述第一方面、第二方面或其各实现方式中的方法。
第八方面，提供了一种计算机可读存储介质，用于存储计算机程序，该计算机程序使得计算机执行上述第一方面、第二方面中的任一方面或其各实现方式中的方法。
第九方面，提供了一种计算机程序产品，包括计算机程序指令，该计算机程序指令使得计算机执行上述第一方面、第二方面中的任一方面或其各实现方式中的方法。
第十方面，提供了一种计算机程序，当其在计算机上运行时，使得计算机执行上述第一方面、第二方面中的任一方面或其各实现方式中的方法。
通过采用上述方案，能够对码本计算所需要的加权系数进行量化处理，并上报量化处理后的加权系数，从而使得上报码本计算的相关参数的时候，节省上报消息的长度，得到性能开销的折中效果。
附图说明
图1是本申请实施例提供的一种通信系统架构的示意性图一；
图2是本申请实施例提供的一种码本处理方法流程示意图一；
图3为本申请实施例的一种非量化加权系数列表示意图；
图4为本申请实施例提供的第一幅度量化等级表示意图；
图5为本申请实施例提供的一种量化结果示意图一；
图6为本申请实施例提供的第二幅度量化等级表示意图；
图7为本申请实施例提供的一种量化结果示意图二；
图8为本申请实施例提供的第三幅度量化等级表示意图；
图9是本申请实施例提供的一种码本处理方法流程示意图二；
图10是本申请实施例提供的一种终端设备组成结构示意图；
图11是本申请实施例提供的一种网络设备组成结构示意图；
图12为本发明实施例提供的一种通信设备组成结构示意图；
图13是本申请实施例提供的一种芯片的示意性框图；
图14是本申请实施例提供的一种通信系统架构的示意性图二；
图15为一种效果对比示意图。
具体实施方式
为了能够更加详尽地了解本发明实施例的特点与技术内容，下面结合附图对本发明实施例的实现进行详细阐述，所附附图仅供参考说明之用，并非用来限定本发明实施例。
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行描述，显然，所描述的实施例是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
本申请实施例的技术方案可以应用于各种通信系统，例如：全球移动通讯(Global System of Mobile communication，GSM)系统、码分多址(Code Division Multiple Access， CDMA)系统、宽带码分多址(Wideband Code Division Multiple Access，WCDMA)系统、通用分组无线业务(General Packet Radio Service，GPRS)、长期演进(Long Term Evolution，LTE)系统、LTE频分双工(Freq终端设备ncy Division Duplex，FDD)系统、LTE时分双工(Time Division Duplex，TDD)、通用移动通信系统(Universal Mobile Telecommunication System，UMTS)、全球互联微波接入(Worldwide Interoperability for Microwave Access，WiMAX)通信系统或5G系统等。
示例性的，本申请实施例应用的通信系统100可以如图1所示。该通信系统100可以包括网络设备110，网络设备110可以是与终端设备120(或称为通信终端、终端)通信的设备。网络设备110可以为特定的地理区域提供通信覆盖，并且可以与位于该覆盖区域内的终端设备进行通信。可选地，该网络设备110可以是GSM系统或CDMA系统中的基站(Base Transceiver Station，BTS)，也可以是WCDMA系统中的基站(NodeB，NB)，还可以是LTE系统中的演进型基站(Evolutional Node B，eNB或eNodeB)，或者是云无线接入网络(Cloud Radio Access Network，CRAN)中的无线控制器，或者该网络设备可以为移动交换中心、中继站、接入点、车载设备、可穿戴设备、集线器、交换机、网桥、路由器、5G网络中的网络侧设备或者未来演进的公共陆地移动网络(Public Land Mobile Network，PLMN)中的网络设备等。
该通信系统100还包括位于网络设备110覆盖范围内的至少一个终端设备120。作为在此使用的“终端设备”包括但不限于经由有线线路连接，如经由公共交换电话网络(Public Switched Telephone Networks，PSTN)、数字用户线路(Digital Subscriber Line，DSL)、数字电缆、直接电缆连接；和/或另一数据连接/网络；和/或经由无线接口，如，针对蜂窝网络、无线局域网(Wireless Local Area Network，WLAN)、诸如DVB-H网络的数字电视网络、卫星网络、AM-FM广播发送器；和/或另一终端设备的被设置成接收/发送通信信号的装置；和/或物联网(Internet of Things，IoT)设备。被设置成通过无线接口通信的终端设备可以被称为“无线通信终端”、“无线终端”或“移动终端”。移动终端的示例包括但不限于卫星或蜂窝电话；可以组合蜂窝无线电电话与数据处理、传真以及数据通信能力的个人通信系统(Personal Communications System，PCS)终端；可以包括无线电电话、寻呼机、因特网/内联网接入、Web浏览器、记事簿、日历以及/或全球定位系统(Global Positioning System，GPS)接收器的PDA；以及常规膝上型和/或掌上型接收器或包括无线电电话收发器的其它电子装置。终端设备可以指接入终端、用户设备(User Equipment，终端设备)、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、无线本地环路(Wireless Local Loop，WLL)站、个人数字处理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备、5G网络中的终端设备或者未来演进的PLMN中的终端设备等。
可选地，终端设备120之间可以进行终端直连(Device to Device，D2D)通信。
可选地，5G系统或5G网络还可以称为新无线(New Radio，NR)系统或NR网络。
图1示例性地示出了一个网络设备和两个终端设备，可选地，该通信系统100可以包括多个网络设备并且每个网络设备的覆盖范围内可以包括其它数量的终端设备，本申请实施例对此不做限定。
可选地，该通信系统100还可以包括网络控制器、移动管理实体等其他网络实体，本申请实施例对此不作限定。
应理解，本申请实施例中网络/系统中具有通信功能的设备可称为通信设备。以图3 示出的通信系统100为例，通信设备可包括具有通信功能的网络设备110和终端设备120，网络设备110和终端设备120可以为上文所述的具体设备，此处不再赘述；通信设备还可包括通信系统100中的其他设备，例如网络控制器、移动管理实体等其他网络实体，本申请实施例中对此不做限定。
应理解，本文中术语“系统”和“网络”在本文中常被可互换使用。本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
为了能够更加详尽地了解本发明实施例的特点与技术内容，下面结合附图对本发明实施例的实现进行详细阐述，所附附图仅供参考说明之用，并非用来限定本发明实施例。
实施例一、
本实施例提供一种码本处理方法，应用于终端设备，如图2所示，包括：
步骤21：基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；
步骤22：对所述非量化加权系数进行量化处理，得到量化后的加权系数；
步骤23：至少将用于码本计算的量化后的加权系数发送至网络侧。
前述第一数量以及第二数量，分别可以为L和M值，L值为空间波束的数量的一半，M值为DFT基向量的个数。L和M均为整数。
前述步骤21，基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数，可以包括：
基于第一数量以及第二数量(即L和M值)，计算W 1，
Figure PCTCN2019070708-appb-000004
以及非量化加权系数
其中，其中W 1指示2L个空间波束(beam)，
Figure PCTCN2019070708-appb-000005
用来指示M个DFT基向量，
所述非量化加权系数，可以为
Figure PCTCN2019070708-appb-000006
即(2L*M)指示任意空间beam、频域DFT向量对的加权系数。
本实施例中，需要对非量化加权系数进行量化，具体的可以有以下三种处理场景：
处理场景1、
对所述非量化加权系数进行量化处理，包括：基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
其中，所述将非量化加权系数的非0幅度量化为编码值，包括：
基于预设的第一幅度量化等级表，确定非量化加权系数的非0幅度的编码值；
其中，所述非量化加权系数的非0幅度的编码值中的第一比特位为第二值；所述第二值与所述第一值不同。
也就是说，对应不同的量化等级，非0幅度采用A比特量化，相位B比特量化，幅度0(最低等级)用1比特量化。
关于量化的顺序，可以为采用先行后列、或者先列后行的顺序来逐个进行量化。其中，行可以为2L行，每行中包含有M个非量化加权系数。先行后列的顺序就是指的先从第一行的最左边(或第一个)非量化加权系数开始量化，直至第2L行的第M个非量化加权系数为止。
针对每一个非量化加权系数的幅度以及相位进行量化处理，其中，相位在本实施例中不做赘述。以下重点针对幅度的量化进行说明。
如果当前所要处理的非量化加权系数为非0量化元素，则上报消息时，通过预设的第一幅度量化等级表来确定对应的编码值；其中，每一个编码值可以通过第一位的第二 值来表示所量化的元素为非0量化元素。如果当前非量化加权系数对应的所要量化的非量化后的加权系数的幅度为0，那么就采用第一值来表示。
其中，第一值与第二值不同，比如，第一值可以为0，第二值可以为1，当然，反之亦可，只是不再穷举。
假设，第一值为0、第二值为1，则表示量化后的加权系数为非0幅度时，第一位比特为1，并对应量化幅度A和相位B；如果该位置不存在非0量化元素则追加比特0。
其中，A和B均为整数，具体采用几位来表示可以根据实际情况进行设置，本实施例不做赘述。
相应的，至少将用于码本计算的量化后的加权系数发送至网络侧。可以为终端设备上报总的CSI消息长度(包含在CSI part1中)以及包含有量化后的加权系数的序列。其中，上报的消息可以根据实际情况进行设置。
举例来说，参见图3、4、5，假设L＝4，M＝2；图3中示出
Figure PCTCN2019070708-appb-000007
即非量化加权系数，包含有2*8个元素。
图4示出第一幅度量化等级表，其中示出多种非量化的幅度所对应的编码值。
图5示出，采用图4的第一幅度量化等级表对图3中的各个非量化加权系数进行量化之后，得到对应的量化加权系数，其中，非0幅度对应有编码值，并且每一个编码值的第一比特位为第二值；针对0幅度则直接设置为第一值，即0。
相应的，最终上报的幅度量化序列可以包括：
[1010]0000000000[1001]000以及在CSI第一部分中上报总的序列长度。
处理场景2、
对所述非量化加权系数进行量化处理，包括：基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
其中，所述将非0幅度量化为编码值，包括：
基于预设的第二幅度量化等级表，确定非0幅度的编码值；
其中，所述第二幅度量化等级表，满足异前置性。
与处理场景1不同之处在于，本场景中采用不同的量化等级表，本场景中采用的量化等级表满足了异前置性，也就是说，第二幅度量化等级表中，不同的量化等级对应不同的编码值，任意码字集合中任意元素都不是其他元素的前缀。
关于量化的顺序，可以为采用先行后列、或者先列后行的顺序来逐个进行量化。其中，行可以为2L行，每行中包含有M个非量化加权系数。先行后列的顺序就是指的先从第一行的最左边(或第一个)非量化加权系数开始量化，直至第2L行的第M个非量化加权系数为止。
针对每一个非量化加权系数的幅度以及相位进行量化处理，其中，相位在本实施例中不做赘述。以下重点针对幅度的量化进行说明。
终端设备按照预先定义的第二幅度量化等级表，对
Figure PCTCN2019070708-appb-000008
进行量化处理，幅度-相位量化等级表满足异前置性。
对应不同的量化等级，幅度A比特和相位B bit量化长度不需要一致，幅度0(最低等级)用1比特量化。
采用先行后列(或者先列后行)，追加每个元素的量化信息。
相应的，至少将用于码本计算的量化后的加权系数发送至网络侧。可以为终端设备上报总的CSI消息长度(包含在CSI part1中)以及包含有量化后的加权系数的序列。 其中，上报的消息可以根据实际情况进行设置。
举例来说，参见图3、6、7；非量化加权系数矩阵可以同样参见图3，假设L＝4，M＝2，
Figure PCTCN2019070708-appb-000009
与图3相同，即与处理场景1中的示例说明是一致的，不再赘述。
本处理场景中预先配置的第二幅度量化等级表如图6所示，图6中，不同的非0幅度所对应的编码值的前N位不同，图中即前3位是不同的。
结合图6所示的第二幅度量化等级表，对图3所处的非量化加权系数进行处理之后，得到图7所示的编码值，
最终上报序列为(只含幅度)[1110][101]0000000000[100]000；以及在CSI第一部分中上报总的序列长度。
处理场景3、
本处理场景与前两个处理场景不同，本场景中不针对0幅度进行处理，仅针对非0元素，即非0幅度进行处理。具体来说：
所述对所述非量化加权系数进行量化处理，得到量化后的加权系数，包括：
基于预设的第三幅度量化等级表，确定用于码本计算的非量化加权系数的编码值，将所述编码值作为量化后的加权系数；
从量化后的加权系数中，选取K个非0幅度的量化后的加权系数；K为大于等于1的整数。
所述至少将用于码本计算的量化后的加权系数发送至网络侧，包括：
将K添加在CSI的第一部分，将所述K个编码值及其位置添加在所述CSI的第二部分；发送CSI至网络侧。
也就是说，终端设备根据非量化加权系数的稀疏程度选择K个非零元素上报。
对其K个上报元素，按照幅度A和相位B比特进行量化。
终端设备在CSI part1(第一部分)中上报K(K可以是具体的值也可以是个指示)。在CSI part 2(第二部分)中上报K个非0元素在2LM中的位置，并且按序上报K个(非0)幅度-相位量化值。
进一步地，前述K可以是长时反馈。也就是说在每次上报的时候均上报K值。而K个编码值以及对应的位置，可以不在每次上报的时候均发送。K个非0元素在2LM中的位置，可以类似组合数。
本场景中第三幅度量化等级表可以与场景1中提供的第一幅度量化等级表一致，或者，还可以与场景2提供的第二幅度量化等级表一样；或者，还可以为其他类型的表，只是本实施例中不再穷举。
举例来说，参见图3、8；非量化加权系数可以为图3，即L＝4，M＝2，
Figure PCTCN2019070708-appb-000010
与前述一致，不再赘述。
图8则为不同的非量化加权系数的非0幅度所对应的编码值的对应列表。
基于图3、8，可以确定所要上报的K＝3；K个非0元素在2LM中的位置，比如[0,1,12]＝>549；K＝3个幅度值[101][010][000]。
可见，通过采用上述方案，就能够对码本计算所需要的加权系数进行量化处理，从而使得上报码本计算的相关参数的时候，节省上报消息的长度，得到性能开销的折中效果。
实施例二、
本实施例提供一种码本处理方法，应用于网络设备，如图9所示，包括：
步骤31：接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
步骤32：基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息可以包括：
接收终端设备发来的W 1，
Figure PCTCN2019070708-appb-000011
以及非量化加权系数；
其中，其中W 1指示2L个空间波束(beam)，
Figure PCTCN2019070708-appb-000012
用来指示M个DFT基向量，
所述非量化加权系数，可以为
Figure PCTCN2019070708-appb-000013
即(2L*M)指示任意空间beam、频域DFT向量对的加权系数。
本实施例中，需要对非量化加权系数进行量化，具体的可以有以下三种处理场景：
处理场景1、
依次解析所述包含有用于码本计算的量化后的加权系数的序列的比特位；
当解析的比特位为第二值时，基于量化后的加权系数的编码值、以及第一幅度量化等级表确定对应的非量化加权系数；
当解析的比特位为第一值时，确定对应的非量化加权系数为0幅度。
也就是说，从序列中依次提取比特位，判断提取的比特位为第一值或第二值；
若当前解析的比特位为第二值，则说明该比特位后面的A+B比特，分别为非0幅度的编码值以及对应的相位值；比如，如果该比特位为1，则后面A+B个比特表示该位置(按照先行后列)的幅度和相位消息；其中A和B均为整数，且A与B不一定相同。
若当前解析的比特位为第一值，则说明该比特位所对应的非量化加权系数的幅度为0幅度；比如，如果该比特位为0，则表示在该位置补零；
循环执行上述处理，直至序列中的编码值全部解析完成。比如，当包含有2L*M个元素时，则需要全部译出为止。
还需要指出的是，前述针对非0幅度的编码值的解析方式可以为基于第一幅度量化等级表来确定，关于第一幅度量化等级表与实施例一相同，不再赘述。
另外，关于加权系数的序列与非量化加权系数的位置之间的关系，可以为由左至右、从上到下的顺序，比如，第一个解析得到的非量化加权系数，为第一行第一个幅度值；第二个则为第一行第二个幅度值。
处理场景2、
根据CSI消息长度，获取包含有用于码本计算的量化后的加权系数的序列；
从所述序列中依次提取至少一个比特，直至提取的至少一个比特与预设的第二幅度量化等级表中存在匹配的目标编码值；
基于所述目标编码值确定对应的非量化加权系数。
其中，所述第二幅度量化等级表，满足异前置性。
与处理场景1不同之处在于，本场景中采用不同的量化等级表，本场景中采用的量化等级表满足了异前置性，也就是说，第二幅度量化等级表中，不同的量化等级对应不同的编码值，任意码字集合中任意元素都不是其他元素的前缀。
具体来说，可以通过上报的CSI消息长度，译出其对应的量化序列。
缓存中读入每一个比特，直到已读比特序列为第二幅度量化等级表中某一个编码值；基于第二幅度量化等级表确定编码值所对应的幅度值；
译得其幅度(以及相位值)后，清空缓存，继续执行前述处理，直至序列中的全部内容解析译出为止。
另外，关于加权系数的序列与非量化加权系数的位置之间的关系，可以为由左至右、从上到下的顺序，比如，第一个解析得到的非量化加权系数，为第一行第一个幅度值；第二个则为第一行第二个幅度值。
处理场景3、
本处理场景与前两个处理场景不同，本场景中不针对0幅度进行处理，仅针对非0元素，即非0幅度进行处理。具体来说：
解析K个编码值对应的位置；并获取每一个位置对应的K个编码值；
基于所述K个编码值、以及第三幅度量化等级表，确定非量化加权系数以及其对应的位置。
本场景中第三幅度量化等级表可以与场景1中提供的第一幅度量化等级表一致，或者，还可以与场景2提供的第二幅度量化等级表一样；或者，还可以为其他类型的表，只是本实施例中不再穷举。
比如，网络设备收到K值；并接收到K个元素的位置；根据预设的量化等级表来确定每一个编码值对应的非量化加权系数的幅度值。
关于K个元素(即量化后的加权系数)的位置与编码值之间可以为一一对应的；也就是说，第一个解析到的位置，指示了第一个获取的编码值的位置；进而，基于第三幅度量化等级表确定编码值所对应的幅度值，将该幅度值添加至对应的位置处。
最后需要指出的是，网络设备可以通过
Figure PCTCN2019070708-appb-000014
计算得到下行信道信息；其中具体的计算方法本实施例中不再赘述。
可见，通过采用上述方案，就能够对码本计算所需要的加权系数进行量化处理，从而使得上报码本计算的相关参数的时候，节省上报消息的长度，得到性能开销的折中效果。
实施例三、
本实施例提供一种终端设备，如图10所示，包括：
第一处理单元41，基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；对所述非量化加权系数进行量化处理，得到量化后的加权系数；
第一通信单元42，至少将用于码本计算的量化后的加权系数发送至网络侧。
前述第一数量以及第二数量，分别可以为L和M值，L值为空间波束的数量的一半，M值为DFT基向量的个数。
前述第一处理单元41，基于第一数量以及第二数量(即L和M值)，计算W 1，
Figure PCTCN2019070708-appb-000015
以及非量化加权系数
其中，其中W 1指示2L个空间波束(beam)，
Figure PCTCN2019070708-appb-000016
用来指示M个DFT基向量，
所述非量化加权系数，可以为
Figure PCTCN2019070708-appb-000017
即(2L*M)指示任意空间beam、频域DFT向量对的加权系数。
本实施例中，需要对非量化加权系数进行量化，具体的可以有以下三种处理场景：
处理场景1、
第一处理单元41，基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
其中，所述第一处理单元41，基于预设的第一幅度量化等级表，确定非量化加权系数的非0幅度的编码值；
其中，所述非量化加权系数的非0幅度的编码值中的第一比特位为第二值；所述第二值与所述第一值不同。
也就是说，对应不同的量化等级，非0幅度采用A比特量化，相位B比特量化， 幅度0(最低等级)用1比特量化。
关于量化的顺序，可以为采用先行后列、或者先列后行的顺序来逐个进行量化。其中，行可以为2L行，每行中包含有M个非量化加权系数。先行后列的顺序就是指的先从第一行的最左边(或第一个)非量化加权系数开始量化，直至第2L行的第M个非量化加权系数为止。
针对每一个非量化加权系数的幅度以及相位进行量化处理，其中，相位在本实施例中不做赘述。以下重点针对幅度的量化进行说明。
如果当前所要处理的非量化加权系数为非0量化元素、则上报消息时，通过预设的第一幅度量化等级表来确定对应的编码值；其中，每一个编码值可以通过第一位的第二值来表示所量化的元素为非0量化元素。如果当前非量化加权系数对应的所要量化的非量化后的加权系数的幅度为0，那么就采用第一值来表示。
其中，第一值与第二值不同，比如，第一值可以为0，第二值可以为1，当然，反之亦可，只是不再穷举。
假设，第一值为0、第二值为1，则表示量化后的加权系数为非0幅度时，第一位比特为1，并对应量化幅度A和相位B；如果该位置不存在非0量化元素则追加比特0。
其中，A和B均为整数，具体采用几位来表示可以根据实际情况进行设置，本实施例不做赘述。
相应的，第一通信单元42，至少将用于码本计算的量化后的加权系数发送至网络侧。可以为终端设备上报总的CSI消息长度(包含在CSI part1中)以及包含有量化后的加权系数的序列。其中，上报的消息可以根据实际情况进行设置。
举例来说，参见图3、4、5，假设L＝4，M＝2；图3中示出
Figure PCTCN2019070708-appb-000018
即非量化加权系数，包含有2*8个元素。
图4示出第一幅度量化等级表，其中示出多种非量化的幅度所对应的编码值。
图5示出，采用图4的第一幅度量化等级表对图3中的各个非量化加权系数进行量化之后，得到对应的量化加权系数，其中，非0幅度对应有编码值，并且每一个编码值的第一比特位为第二值；针对0幅度则直接设置为第一值，即0。
相应的，最终上报的幅度量化序列可以包括：
[1010]0000000000[1001]000以及在CSI part1中上报总的序列长度。
处理场景2、
第一处理单元41，基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
其中，所述第一处理单元41，基于预设的第二幅度量化等级表，确定非0幅度的编码值；
其中，所述第二幅度量化等级表，满足异前置性。
与处理场景1不同之处在于，本场景中采用不同的量化等级表，本场景中采用的量化等级表满足了异前置性，也就是说，第二幅度量化等级表中，不同的量化等级对应不同的编码值，并且每一个不同的编码值的前N为编码不同；比如，编码值的前3位可以每一个编码值均不相同。
关于量化的顺序，可以为采用先行后列、或者先列后行的顺序来逐个进行量化。其中，行可以为2L行，每行中包含有M个非量化加权系数。先行后列的顺序就是指的先从第一行的最左边(或第一个)非量化加权系数开始量化，直至第2L行的第M个非量化加权系数为止。
针对每一个非量化加权系数的幅度以及相位进行量化处理，其中，相位在本实施例中不做赘述。以下重点针对幅度的量化进行说明。
按照预先定义的第二幅度量化等级表，对
Figure PCTCN2019070708-appb-000019
进行量化处理，幅度-相位量化等级表满足异前置性。
对应不同的量化等级，幅度A比特和相位B bit量化长度不需要一致，幅度0(最低等级)用1比特量化。
采用先行后列(或者先列后行)，追加每个元素的量化信息。
相应的，第一通信单元42，至少将用于码本计算的量化后的加权系数发送至网络侧。可以为上报总的CSI消息长度(包含在CSI part1中)以及包含有量化后的加权系数的序列。其中，上报的消息可以根据实际情况进行设置。
举例来说，参见图3、6、7；非量化加权系数矩阵可以同样参见图3，假设L＝4，M＝2，
Figure PCTCN2019070708-appb-000020
与图3相同，即与处理场景1中的示例说明是一致的，不再赘述。
本处理场景中预先配置的第二幅度量化等级表如图6所示，图6中，不同的非0幅度所对应的编码值的前N位不同，图中即前3位是不同的。
结合图6所示的第二幅度量化等级表，对图3所处的非量化加权系数进行处理之后，得到图7所示的编码值，
最终上报序列为(只含幅度)[1110][101]0000000000[100]000；以及在CSI part1中上报总的序列长度。
处理场景3、
本处理场景与前两个处理场景不同，本场景中不针对0幅度进行处理，仅针对非0元素，即非0幅度进行处理。具体来说：
第一处理单元41，基于预设的第三幅度量化等级表，确定用于码本计算的非量化加权系数的编码值，将所述编码值作为量化后的加权系数；
从量化后的加权系数中，选取K个非0幅度的量化后的加权系数；K为大于等于1的整数。
所述第一通信单元42，将K添加在CSI的第一部分，将所述K个编码值及其位置添加在所述CSI的第二部分；发送CSI至网络侧。
也就是说，终端设备根据非量化加权系数的稀疏程度选择K个非零元素上报。
对其K个上报元素，按照幅度A和相位B比特进行量化。
终端设备在CSI part1(第一部分)中上报K(K可以是具体的值也可以是个指示)。在CSI part 2(第二部分)中上报K个非0元素在2LM中的位置，并且按序上报K个(非0)幅度-相位量化值。
进一步地，前述K可以是长时反馈。也就是说在每次上报的时候均上报K值；而K个编码值以及对应的位置，可以不在每次上报的时候均发送。K个非0元素在2LM中的位置，可以类似组合数。
本场景中第三幅度量化等级表可以与场景1中提供的第一幅度量化等级表一致，或者，还可以与场景2提供的第二幅度量化等级表一样；或者，还可以为其他类型的表，只是本实施例中不再穷举。
举例来说，参见图3、8；非量化加权系数可以为图3，即L＝4，M＝2，
Figure PCTCN2019070708-appb-000021
与前述一致，不再赘述。
图8则为不同的非量化加权系数的非0幅度所对应的编码值的对应列表。
基于图3、8，可以确定所要上报的K＝3；K个非0元素在2LM中的位置，比如[0,1,12]＝>549；K＝3个幅度值[101][010][000]。
可见，通过采用上述方案，就能够对码本计算所需要的加权系数进行量化处理，从而使得上报码本计算的相关参数的时候，节省上报消息的长度，得到性能开销的折中效果。
实施例四、
本实施例提供一种网络设备，如图11所示，包括：
第二通信单元51，接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
第二处理单元52，基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
第二通信单元51，接收终端设备发来的W 1，
Figure PCTCN2019070708-appb-000022
以及非量化加权系数；
其中，其中W 1指示2L个空间波束(beam)，
Figure PCTCN2019070708-appb-000023
用来指示M个DFT基向量，
所述非量化加权系数，可以为
Figure PCTCN2019070708-appb-000024
即(2L*M)指示任意空间beam、频域DFT向量对的加权系数。
本实施例中，需要对非量化加权系数进行量化，具体的可以有以下三种处理场景：
处理场景1、
第二处理单元52，依次解析所述包含有用于码本计算的量化后的加权系数的序列的比特位；
当解析的比特位为第二值时，基于量化后的加权系数的编码值、以及第一幅度量化等级表确定对应的非量化加权系数；
当解析的比特位为第一值时，确定对应的非量化加权系数为0幅度。
也就是说，从序列中依次提取比特位，判断提取的比特位为第一值或第二值；
若当前解析的比特位为第二值，则说明该比特位后面的A+B比特，分别为非0幅度的编码值以及对应的相位值；比如，如果该比特位为1，则后面A+B个比特表示该位置(按照先行后列)的幅度和相位消息；其中A和B均为整数，且A与B不一定相同。
若当前解析的比特位为第一值，则说明该比特位所对应的非量化加权系数的幅度为0幅度；比如，如果该比特位为0，则表示在该位置补零；
循环执行上述处理，直至序列中的编码值全部解析完成。比如，当包含有2L*M个元素时，则需要全部译出为止。
还需要指出的是，前述针对非0幅度的编码值的解析方式可以为基于第一幅度量化等级表来确定，关于第一幅度量化等级表与实施例一相同，不再赘述。
另外，关于加权系数的序列与非量化加权系数的位置之间的关系，可以为由左至右、从上到下的顺序，比如，第一个解析得到的非量化加权系数，为第一行第一个幅度值；第二个则为第一行第二个幅度值。
处理场景2、
第二处理单元52，根据CSI消息长度，获取包含有用于码本计算的量化后的加权系数的序列；
从所述序列中依次提取至少一个比特，直至提取的至少一个比特与预设的第二幅度量化等级表中存在匹配的目标编码值；
基于所述目标编码值确定对应的非量化加权系数。
其中，所述第二幅度量化等级表，满足异前置性。
与处理场景1不同之处在于，本场景中采用不同的量化等级表，本场景中采用的量化等级表满足了异前置性，也就是说，第二幅度量化等级表中，不同的量化等级对应不 同的编码值，任意码字集合中任意元素都不是其他元素的前缀。
具体来说，可以通过上报的CSI消息长度，译出其对应的量化序列。
缓存中读入每一个比特，直到已读比特序列为第二幅度量化等级表中某一个编码值；基于第二幅度量化等级表确定编码值所对应的幅度值；
译得其幅度(以及相位值)后，清空缓存，继续执行前述处理，直至序列中的全部内容解析译出为止。
另外，关于加权系数的序列与非量化加权系数的位置之间的关系，可以为由左至右、从上到下的顺序，比如，第一个解析得到的非量化加权系数，为第一行第一个幅度值；第二个则为第一行第二个幅度值。
处理场景3、
本处理场景与前两个处理场景不同，本场景中不针对0幅度进行处理，仅针对非0元素，即非0幅度进行处理。具体来说：
第二处理单元52，解析K个编码值对应的位置；并获取每一个位置对应的K个编码值；
基于所述K个编码值、以及第三幅度量化等级表，确定非量化加权系数以及其对应的位置。
本场景中第三幅度量化等级表可以与场景1中提供的第一幅度量化等级表一致，或者，还可以与场景2提供的第二幅度量化等级表一样；或者，还可以为其他类型的表，只是本实施例中不再穷举。
比如，网络设备收到K值；并接收到K个元素的位置；根据预设的量化等级表来确定每一个编码值对应的非量化加权系数的幅度值。
关于K个元素(即量化后的加权系数)的位置与编码值之间可以为一一对应的；也就是说，第一个解析到的位置，指示了第一个获取的编码值的位置；进而，基于第三幅度量化等级表确定编码值所对应的幅度值，将该幅度值添加至对应的位置处。
最后需要指出的是，网络设备可以通过
Figure PCTCN2019070708-appb-000025
计算得到下行信道信息；其中具体的计算方法本实施例中不再赘述。
可见，通过采用上述方案，就能够对码本计算所需要的加权系数进行量化处理，从而使得上报码本计算的相关参数的时候，节省上报消息的长度，得到性能开销的折中效果。
图12是本申请实施例提供的一种通信设备600示意性结构图，通信设备可以为本实施例前述的终端设备或者网络设备。图6所示的通信设备600包括处理器610，处理器610可以从存储器中调用并运行计算机程序，以实现本申请实施例中的方法。
可选地，如图12所示，通信设备600还可以包括存储器620。其中，处理器610可以从存储器620中调用并运行计算机程序，以实现本申请实施例中的方法。
其中，存储器620可以是独立于处理器610的一个单独的器件，也可以集成在处理器610中。
可选地，如图12所示，通信设备600还可以包括收发器630，处理器610可以控制该收发器630与其他设备进行通信，具体地，可以向其他设备发送信息或数据，或接收其他设备发送的信息或数据。
其中，收发器630可以包括发射机和接收机。收发器630还可以进一步包括天线，天线的数量可以为一个或多个。
可选地，该通信设备600具体可为本申请实施例的网络设备，并且该通信设备600可以实现本申请实施例的各个方法中由网络设备实现的相应流程，为了简洁，在此不再赘述。
可选地，该通信设备600具体可为本申请实施例的终端设备、或者网络设备，并且该通信设备600可以实现本申请实施例的各个方法中由移动终端/终端设备实现的相应流程，为了简洁，在此不再赘述。
图13是本申请实施例的芯片的示意性结构图。图13所示的芯片700包括处理器710，处理器710可以从存储器中调用并运行计算机程序，以实现本申请实施例中的方法。
可选地，如图13所示，芯片700还可以包括存储器720。其中，处理器710可以从存储器720中调用并运行计算机程序，以实现本申请实施例中的方法。
其中，存储器720可以是独立于处理器710的一个单独的器件，也可以集成在处理器710中。
可选地，该芯片700还可以包括输入接口730。其中，处理器710可以控制该输入接口730与其他设备或芯片进行通信，具体地，可以获取其他设备或芯片发送的信息或数据。
可选地，该芯片700还可以包括输出接口740。其中，处理器710可以控制该输出接口740与其他设备或芯片进行通信，具体地，可以向其他设备或芯片输出信息或数据。
可选地，该芯片可应用于本申请实施例中的网络设备，并且该芯片可以实现本申请实施例的各个方法中由网络设备实现的相应流程，为了简洁，在此不再赘述。
可选地，该芯片可应用于本申请实施例中的终端设备，并且该芯片可以实现本申请实施例的各个方法中由终端设备实现的相应流程，为了简洁，在此不再赘述。
应理解，本申请实施例提到的芯片还可以称为系统级芯片，系统芯片，芯片系统或片上系统芯片等。
图14是本申请实施例提供的一种通信系统800的示意性框图。如图14所示，该通信系统800包括终端设备810和网络设备820。
其中，该终端设备810可以用于实现上述方法中由终端设备实现的相应的功能，以及该网络设备820可以用于实现上述方法中由网络设备实现的相应的功能为了简洁，在此不再赘述。
图15示出上述实施例提供的方案处理得到的效果，横轴表示比特位的数量，竖轴表示节省的功率，其中三角形连线表示本实施例提供的方案，可以看出本实施例提供的方案能够采用更少的比特位并节省更大的功率。
应理解，本申请实施例的处理器可能是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现成可编程门阵列(Field Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
可以理解，本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可 擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器(Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
应理解，上述存储器为示例性但不是限制性说明，例如，本申请实施例中的存储器还可以是静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synch link DRAM，SLDRAM)以及直接内存总线随机存取存储器(Direct Rambus RAM，DR RAM)等等。也就是说，本申请实施例中的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本申请实施例还提供了一种计算机可读存储介质，用于存储计算机程序。
可选的，该计算机可读存储介质可应用于本申请实施例中的网络设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由网络设备实现的相应流程，为了简洁，在此不再赘述。
可选地，该计算机可读存储介质可应用于本申请实施例中的终端设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由移动终端/终端设备实现的相应流程，为了简洁，在此不再赘述。
本申请实施例还提供了一种计算机程序产品，包括计算机程序指令。
可选的，该计算机程序产品可应用于本申请实施例中的网络设备，并且该计算机程序指令使得计算机执行本申请实施例的各个方法中由网络设备实现的相应流程，为了简洁，在此不再赘述。
可选地，该计算机程序产品可应用于本申请实施例中的移动终端/终端设备，并且该计算机程序指令使得计算机执行本申请实施例的各个方法中由移动终端/终端设备实现的相应流程，为了简洁，在此不再赘述。
本申请实施例还提供了一种计算机程序。
可选的，该计算机程序可应用于本申请实施例中的网络设备，当该计算机程序在计算机上运行时，使得计算机执行本申请实施例的各个方法中由网络设备实现的相应流程，为了简洁，在此不再赘述。
可选地，该计算机程序可应用于本申请实施例中的移动终端/终端设备，当该计算机程序在计算机上运行时，使得计算机执行本申请实施例的各个方法中由移动终端/终端设备实现的相应流程，为了简洁，在此不再赘述。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，)ROM、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应所述以权利要求的保护范围为准。

Claims (29)

  1. 一种码本处理方法，应用于终端设备，所述方法包括：
    基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；
    对所述非量化加权系数进行量化处理，得到量化后的加权系数；
    至少将用于码本计算的量化后的加权系数发送至网络侧。
  2. 根据权利要求1所述的方法，其中，所述对所述非量化加权系数进行量化处理，得到量化后的加权系数，包括：
    基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
    若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
  3. 根据权利要求2所述的方法，其中，所述将非量化加权系数的非0幅度量化为编码值，包括：
    基于预设的第一幅度量化等级表，确定非量化加权系数的非0幅度的编码值；
    其中，所述非量化加权系数的非0幅度的编码值中的第一比特位为第二值；所述第二值与所述第一值不同。
  4. 根据权利要求2所述的方法，其中，所述将非0幅度量化为编码值，包括：
    基于预设的第二幅度量化等级表，确定非0幅度的编码值；
    其中，所述第二幅度量化等级表，满足异前置性。
  5. 根据权利要求2-4任一项所述的方法，其中，所述至少将用于码本计算的量化后的加权系数发送至网络侧，包括：
    向网络侧发送CSI消息长度以及包含有量化后的加权系数的序列。
  6. 根据权利要求1所述的方法，其中，所述对所述非量化加权系数进行量化处理，得到量化后的加权系数，包括：
    基于预设的第三幅度量化等级表，确定用于码本计算的非量化加权系数的编码值，将所述编码值作为量化后的加权系数；
    从量化后的加权系数中，选取K个非0幅度的量化后的加权系数；K为大于等于1的整数。
  7. 根据权利要求6所述的方法，其中，所述至少将用于码本计算的量化后的加权系数发送至网络侧，包括：
    将K添加在CSI的第一部分，将所述K个编码值及其位置添加在所述CSI的第二部分；
    发送CSI至网络侧。
  8. 一种码本处理方法，应用于网络设备，所述方法包括：
    接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
    基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
  9. 根据权利要求8所述的方法，其中，所述接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息之后，所述方法还包括：
    依次解析所述包含有用于码本计算的量化后的加权系数的序列的比特位；
    当解析的比特位为第二值时，基于量化后的加权系数的编码值、以及第一幅度量化等级表确定对应的非量化加权系数；
    当解析的比特位为第一值时，确定对应的非量化加权系数为0幅度。
  10. 根据权利要求8所述的方法，其中，所述接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息之后，所述方法还包括：
    根据CSI消息长度，获取包含有用于码本计算的量化后的加权系数的序列；
    从所述序列中依次提取至少一个比特，直至提取的至少一个比特与预设的第二幅度量化等级表中存在匹配的目标编码值；
    基于所述目标编码值确定对应的非量化加权系数。
  11. 根据权利要求8所述的方法，其中，所述接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息之后，所述方法还包括：
    解析K个编码值对应的位置；并获取每一个位置对应的K个编码值；
    基于所述K个编码值、以及第三幅度量化等级表，确定非量化加权系数以及其对应的位置。
  12. 一种终端设备，包括：
    第一处理单元，基于第一数量以及第二数量，至少确定用于码本计算的非量化加权系数；对所述非量化加权系数进行量化处理，得到量化后的加权系数；
    第一通信单元，至少将用于码本计算的量化后的加权系数发送至网络侧。
  13. 根据权利要求12所述的终端设备，其中，所述第一处理单元，基于预设顺序，依次判断所要处理的非量化加权系数所对应的幅度是否为0；
    若非0，则将非量化加权系数的非0幅度量化为编码值；否则，将非量化加权系数的0幅度量化为1比特的第一值。
  14. 根据权利要求13所述的终端设备，其中，所述第一处理单元，基于预设的第一幅度量化等级表，确定非量化加权系数的非0幅度的编码值；
    其中，所述非量化加权系数的非0幅度的编码值中的第一比特位为第二值；所述第二值与所述第一值不同。
  15. 根据权利要求13所述的终端设备，其中，所述第一处理单元，基于预设的第二幅度量化等级表，确定非0幅度的编码值；
    其中，所述第二幅度量化等级表，满足异前置性。
  16. 根据权利要求12-15任一项所述的终端设备，其中，所述第一通信单元，向网络侧发送CSI消息长度以及包含有量化后的加权系数的序列。
  17. 根据权利要求12所述的终端设备，其中，所述第一处理单元，基于预设的第三幅度量化等级表，确定用于码本计算的非量化加权系数的编码值，将所述编码值作为量化后的加权系数；
    从量化后的加权系数中，选取K个非0幅度的量化后的加权系数；K为大于等于1的整数。
  18. 根据权利要求17所述的终端设备，其中，所述第一通信单元，将K添加在CSI的第一部分，将所述K个编码值及其位置添加在所述CSI的第二部分；发送CSI至网络侧。
  19. 一种网络设备，包括：
    第二通信单元，接收终端设备发来的包含有用于码本计算的量化后的加权系数的信息；
    第二处理单元，基于所述量化后的加权系数的信息确定对应的码本，基于确定的所述码本确定所述终端设备的下行信道信息。
  20. 根据权利要求19所述的网络设备，其中，所述第二处理单元，依次解析所述包含有用于码本计算的量化后的加权系数的序列的比特位；当解析的比特位为第二值时，基于量化后的加权系数的编码值、以及第一幅度量化等级表确定对应的非量化加权系 数；当解析的比特位为第一值时，确定对应的非量化加权系数为0幅度。
  21. 根据权利要求19所述的网络设备，其中，所述第二处理单元，根据CSI消息长度，获取包含有用于码本计算的量化后的加权系数的序列；从所述序列中依次提取至少一个比特，直至提取的至少一个比特与预设的第二幅度量化等级表中存在匹配的目标编码值；基于所述目标编码值确定对应的非量化加权系数。
  22. 根据权利要求19所述的网络设备，其中，所述第二处理单元，解析K个编码值对应的位置；并获取每一个位置对应的K个编码值；基于所述K个编码值、以及第三幅度量化等级表，确定非量化加权系数以及其对应的位置。
  23. 一种终端设备，包括：处理器和用于存储能够在处理器上运行的计算机程序的存储器，
    其中，该存储器用于存储计算机程序，所述处理器用于调用并运行所述存储器中存储的计算机程序，执行如权利要求1-7任一项所述方法的步骤。
  24. 一种网络设备，包括：处理器和用于存储能够在处理器上运行的计算机程序的存储器，
    其中，该存储器用于存储计算机程序，所述处理器用于调用并运行所述存储器中存储的计算机程序，执行如权利要求8-11任一项所述方法的步骤。
  25. 一种芯片，包括：处理器，用于从存储器中调用并运行计算机程序，使得安装有所述芯片的设备执行如权利要求1-7中任一项所述的方法。
  26. 一种芯片，包括：处理器，用于从存储器中调用并运行计算机程序，使得安装有所述芯片的设备执行如权利要求8-11中任一项所述的方法。
  27. 一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机程序，所述计算机程序使得计算机执行如权利要求1-11任一项所述方法的步骤。
  28. 一种计算机程序产品，包括计算机程序指令，该计算机程序指令使得计算机执行如权利要求1-11中任一项所述的方法。
  29. 一种计算机程序，所述计算机程序使得计算机执行如权利要求1-11中任一项所述的方法。
PCT/CN2019/070708 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备 WO2020142882A1 (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CN201980073999.3A CN112997419A (zh) 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备
CN202110723937.1A CN113346936B (zh) 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备
EP19909475.6A EP3879716A4 (en) 2019-01-07 2019-01-07 CODES BOOK PROCESSING PROCESS, TERMINAL DEVICE AND NETWORK DEVICE
PCT/CN2019/070708 WO2020142882A1 (zh) 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备
US17/361,777 US11575418B2 (en) 2019-01-07 2021-06-29 Codebook processing method, terminal device and network device
US18/147,697 US11894896B2 (en) 2019-01-07 2022-12-28 Codebook processing method, terminal device and network device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/070708 WO2020142882A1 (zh) 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/361,777 Continuation US11575418B2 (en) 2019-01-07 2021-06-29 Codebook processing method, terminal device and network device

Publications (1)

Publication Number Publication Date
WO2020142882A1 true WO2020142882A1 (zh) 2020-07-16

Family

ID=71520572

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/070708 WO2020142882A1 (zh) 2019-01-07 2019-01-07 一种码本处理方法、终端设备及网络设备

Country Status (4)

Country Link
US (2) US11575418B2 (zh)
EP (1) EP3879716A4 (zh)
CN (2) CN112997419A (zh)
WO (1) WO2020142882A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113839698A (zh) * 2021-09-24 2021-12-24 Oppo广东移动通信有限公司 一种量化方法及通信装置、存储介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110535512B (zh) * 2018-10-31 2023-06-30 中兴通讯股份有限公司 一种报告天线端口加权矢量的方法、装置和系统
CN112533295B (zh) * 2019-01-09 2021-11-19 华为技术有限公司 参数配置方法和通信装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103701571A (zh) * 2013-09-28 2014-04-02 河北工业大学 用于td-lte-a中继系统的八天线双码本设计方法
WO2018164537A1 (en) * 2017-03-09 2018-09-13 Samsung Electronics Co., Ltd. Method and apparatus for covariance matrix feedback in advanced wireless communication systems
WO2018202134A1 (en) * 2017-05-05 2018-11-08 Qualcomm Incorporated Procedures for differential channel state information (csi) reporting

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004032679A (ja) * 2002-02-28 2004-01-29 Matsushita Electric Ind Co Ltd 通信装置及び通信システム
CN110545130B (zh) * 2016-11-04 2020-08-07 华为技术有限公司 信道状态信息接收方法、用户设备和网络设备
US10200103B2 (en) 2016-11-23 2019-02-05 Samsung Electronics Co., Ltd. Method and apparatus to enable multi-resolution CSI reporting in advanced wireless communication systems
US10340989B2 (en) * 2016-12-09 2019-07-02 Samsung Electronics Co., Ltd. Codebook for CSI reporting in advanced wireless communication system
CN108282207B (zh) * 2017-01-06 2021-06-15 华为技术有限公司 一种预编码矩阵指示方法、装置和系统
US11316571B2 (en) * 2018-11-01 2022-04-26 Lenovo (Singapore) Pte. Ltd. Transform domain channel state information feedback
ES2925188T3 (es) * 2018-11-13 2022-10-14 Fraunhofer Ges Forschung Métodos y aparatos para reducir la sobrecarga de retroalimentación
US12073545B2 (en) * 2021-10-22 2024-08-27 The Boeing Company Method for large area inspection

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103701571A (zh) * 2013-09-28 2014-04-02 河北工业大学 用于td-lte-a中继系统的八天线双码本设计方法
WO2018164537A1 (en) * 2017-03-09 2018-09-13 Samsung Electronics Co., Ltd. Method and apparatus for covariance matrix feedback in advanced wireless communication systems
WO2018202134A1 (en) * 2017-05-05 2018-11-08 Qualcomm Incorporated Procedures for differential channel state information (csi) reporting

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
QUALCOMM INCORPORATED: "On Type I CSI Feedback", 3GPP DRAFT; R1-1708592, 19 May 2017 (2017-05-19), Hangzhou, China, pages 1 - 7, XP051263231 *
See also references of EP3879716A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113839698A (zh) * 2021-09-24 2021-12-24 Oppo广东移动通信有限公司 一种量化方法及通信装置、存储介质
CN113839698B (zh) * 2021-09-24 2022-07-26 Oppo广东移动通信有限公司 一种量化方法及通信装置、存储介质

Also Published As

Publication number Publication date
EP3879716A1 (en) 2021-09-15
CN112997419A (zh) 2021-06-18
CN113346936A (zh) 2021-09-03
US11894896B2 (en) 2024-02-06
EP3879716A4 (en) 2021-12-15
CN113346936B (zh) 2022-09-13
US20210328637A1 (en) 2021-10-21
US11575418B2 (en) 2023-02-07
US20230170954A1 (en) 2023-06-01

Similar Documents

Publication Publication Date Title
US11894896B2 (en) Codebook processing method, terminal device and network device
EP3907898B1 (en) Codebook information processing method, terminal device, and network device
WO2020001579A1 (zh) 控制信息传输方法、网络设备、终端和计算机存储介质
US12107648B2 (en) Method for feeding back and receiving information, and device
WO2020029160A1 (zh) 信号上报的方法、终端设备和网络设备
WO2021087908A1 (zh) 无线通信的方法和终端设备
JP7199516B2 (ja) 上り制御情報の決定方法及び通信デバイス
WO2020220333A1 (zh) 通信方法和设备
WO2020124506A1 (zh) 确定天线的发射功率的方法、终端设备和网络设备
WO2020029296A1 (zh) 一种信道状态信息上报方法、终端设备及网络设备
US11576071B2 (en) Method for determining trigger state, terminal device, and network device
US11368242B2 (en) Information transmission method and device, and computer storage medium
CN112262589B (zh) 一种信息传输方法、设备及存储介质
WO2020147135A1 (zh) 一种码本处理方法及装置、终端、网络设备
US20210337521A1 (en) Repeat transmission method and apparatus, chip and computer program
WO2020056719A1 (zh) 一种信息传输时间的确定方法、终端设备及网络设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19909475

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019909475

Country of ref document: EP

Effective date: 20210609

NENP Non-entry into the national phase

Ref country code: DE