EP3780470B1 - Method for determining precoding matrix set and transmission apparatus - Google Patents

Method for determining precoding matrix set and transmission apparatus Download PDF

Info

Publication number
EP3780470B1
EP3780470B1 EP20178654.8A EP20178654A EP3780470B1 EP 3780470 B1 EP3780470 B1 EP 3780470B1 EP 20178654 A EP20178654 A EP 20178654A EP 3780470 B1 EP3780470 B1 EP 3780470B1
Authority
EP
European Patent Office
Prior art keywords
precoding matrix
vector
indication information
satisfies
matrix set
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP20178654.8A
Other languages
German (de)
French (fr)
Other versions
EP3780470A1 (en
Inventor
Ruiqi Zhang
Xueru LI
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of EP3780470A1 publication Critical patent/EP3780470A1/en
Application granted granted Critical
Publication of EP3780470B1 publication Critical patent/EP3780470B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/0486Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking channel rank into account
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053Allocation of signaling, i.e. of overhead other than pilot signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0417Feedback systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/0478Special codebook structures directed to feedback optimisation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/0482Adaptive codebooks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0619Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal using feedback from receiving side
    • H04B7/0636Feedback format
    • H04B7/0639Using selective indices, e.g. of a codebook, e.g. pre-distortion matrix index [PMI] or for beam selection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0026Transmission of channel quality indication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048Allocation of pilot signals, i.e. of signals known to the receiver
    • H04L5/0051Allocation of pilot signals, i.e. of signals known to the receiver of dedicated pilots, i.e. pilots destined for a single user or terminal
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0426Power distribution
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0456Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/046Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking physical layer constraints into account
    • H04B7/0469Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking physical layer constraints into account taking special antenna structures, e.g. cross polarized antennas into account
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0686Hybrid systems, i.e. switching and simultaneous transmission
    • H04B7/0695Hybrid systems, i.e. switching and simultaneous transmission using beam selection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0003Two-dimensional division
    • H04L5/0005Time-frequency
    • H04L5/0007Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT

Definitions

  • This application relates to the communications field, and more specifically, to a method for determining a precoding matrix set and a transmission apparatus.
  • a manner of restricting a precoding matrix subset in a Long Term Evolution (long term evolution, LTE) system is restricting vectors that can be selected for W 1 .
  • a network device notifies a terminal of vectors that can be used by the terminal. If a specific vector is restricted, for example, a first vector is restricted, the first vector cannot appear in W 1 when the terminal selects a precoding matrix. However, because vectors close to the first vector have relatively strong energy in a direction of the first vector, the network device usually cannot restrict use of only the first vector but also needs to restrict the vectors close to the first vector. If a prior-art method is used, vectors close to (or near) the first vector cannot appear in W 1 , either. In this case, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • w w 1 ⁇ w 2 .
  • R1-1709232 discloses a structure of Type II single-panel codebook. According to R1-1709232, Type II single-panel codebook supports rank 1 and 2 transmission. R1-1709232 further discloses bit allocation solution for coefficients which are used to combine several vectors to generate a precoding matrix.
  • R1-1711028 discloses a codebook subset restriction solution for Type II codebook. According to R1-1711028, when any beam in a codeword is a restricted beam, the codeword is not used in CSI (Channel State Information) feedback.
  • CSI Channel State Information
  • This application provides a method for determining a precoding matrix set, so as to avoid a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used, thereby improving system performance.
  • a method for determining a precoding matrix set including:
  • a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of a beam vector, thereby improving system performance.
  • a method for determining a precoding matrix set including:
  • the indication information of the S sets D 0 to D S-1 includes S bit fields, the S bit fields are in one-to-one correspondence with D 0 to D S-1 , each bit field includes at least one bit, a bit field corresponding to D j indicates an element g j of A 0 , and any element of D j is greater than g j .
  • any vector c j of C and any element D j ( v ) of D j satisfy the following condition: D j ⁇ ⁇ b f h H ⁇ c j > k h
  • b f h is a vector of B
  • k h is a real number
  • H is an integer.
  • C includes at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j 0 , , c j 1 , ⁇ , c jM -1 , and elements D j 0 ( v 0 ), D j 1 ( v 1 ), ⁇ , D jM- 1 ,(v M-1 ) satisfy the following condition: D j 0 ⁇ 0 ⁇ b f h H ⁇ c j 0 2 + D j 1 ⁇ 1 ⁇ b f h H ⁇ c j 1 2 + ⁇ , + D j M ⁇ 1 ⁇ M ⁇ 1 ⁇ b f h H ⁇ c j M ⁇ 1 2 D j 0 ⁇ 0 2 + D j 1 ⁇ 1 2 + ⁇ + D j M ⁇ 1 ⁇ M ⁇ 1 2 > k
  • the indication information of the S sets D 0 to D S-1 includes H bit fields, and an h th bit field is used to indicate k h .
  • the vector set C and D j can be determined by using indication information including a relatively small quantity of bits.
  • indication information including a relatively small quantity of bits.
  • the indication information further includes indication information of the vector set C , the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a t th bit in the T bits is used to indicate whether a vector b t -1 belongs to the vector set C , where 1 ⁇ t ⁇ T.
  • a bitmap of the T bits is used to determine a restricted vector, and the indication information of the S sets D 0 to D S-1 includes only S or H bit fields. In this way, when S is relatively small, a quantity of bits required for indicating the S sets D 0 to D S-1 can be reduced.
  • the indication information of the S sets D 0 to D S-1 is further used to indicate the vector set C
  • the indication information of the S sets D 0 to D S-1 is T bit fields
  • the T bit fields are in one-to-one correspondence with T vectors included in B
  • each of the T bit fields includes E bits
  • E is greater than or equal to 1
  • a t th bit field in the T bit fields is used to indicate whether a vector b t -1 belongs to the vector set C , where 1 ⁇ t ⁇ T.
  • a value range of p z , y ⁇ 1 , x ⁇ 1 1 is a set A 1 ;
  • more refined codebook restriction can be achieved by restricting both a wideband amplitude and a subband amplitude.
  • a communications apparatus has functions of implementing the terminal device in the method designs of the first aspect. These functions may be implemented by hardware, or may be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more units that correspond to the foregoing functions.
  • a communications apparatus has functions of implementing the network device in the method designs of the second aspect. These functions may be implemented by hardware, or may be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more units that correspond to the foregoing functions.
  • a communications apparatus including a transceiver, a processor, and a memory.
  • the processor is configured to control the transceiver to send and receive signals;
  • the memory is configured to store a computer program; and the processor is configured to invoke the computer program from the memory and run the computer program, so that a terminal device performs the method according to the first aspect.
  • a communications apparatus including a transceiver, a processor, and a memory.
  • the processor is configured to control the transceiver to send and receive signals;
  • the memory is configured to store a computer program; and the processor is configured to invoke the computer program from the memory and run the computer program, so that a network device performs the method according to the second aspect.
  • a computer program product includes computer program code, and when the computer program code runs on a computer, the computer performs the methods according to the foregoing aspects.
  • a computer readable medium stores program code, and when the computer program code runs on a computer, the computer performs the methods according to the foregoing aspects.
  • a chip system includes a processor, and is used by a communications apparatus to implement functions in the foregoing aspects, such as generating, receiving, sending, or processing data and/or information related to the foregoing methods.
  • the chip system further includes a memory, and the memory is configured to store a program instruction and data that are necessary for a terminal device.
  • the chip system may include a chip, or may include a chip and another discrete device.
  • a chip system includes a processor, configured to support a communications apparatus in implementing functions in the foregoing aspects, such as generating, receiving, sending, or processing data and/or information related to the foregoing methods.
  • the chip system further includes a memory, and the memory is configured to store a program instruction and data that are necessary for a network device.
  • the chip system may include a chip, or may include a chip and another discrete device.
  • a Global System for Mobile Communications Global System of Mobile communication, GSM
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • Universal Mobile Telecommunications System Universal Mobile Telecommunication System, UMTS
  • Worldwide Interoperability for Microwave Access Worldwide Interoperability for Microwave Access
  • WiMAX Worldwide Interoperability for Microwave Access
  • 5G 5th Generation
  • 5G 5th Generation
  • NR new radio
  • FIG. 1 is a schematic architectural diagram of a mobile communications system applied to an embodiment of this application.
  • the mobile communications system includes a core network device 110, an access network device 120, and at least one terminal (such as a terminal device 130 and a terminal device 140 in FIG. 1 ).
  • the terminal is connected to the access network device 120 in a wireless manner
  • the access network device 120 is connected to the core network device 110 in a wireless or wired manner.
  • the core network device 110 and the access network device 120 may be different independent physical devices, or functions of the core network device 110 and logical functions of the access network device may be integrated into a same physical device, or one physical device may integrate some functions of the core network device 210 and some functions of the access network device 120.
  • the terminal may be at a fixed location, or may be mobile.
  • FIG. 1 is merely a schematic diagram, and the communications system may further include another network device, for example, may further include a wireless relay device and a wireless backhaul device (which are not drawn in FIG. 1 ).
  • This embodiment of this application imposes no limitation on quantities of core network devices, access network devices, and terminals included in the mobile communications system.
  • the terminal in this embodiment of this application may be referred to as user equipment (User Equipment, UE), a terminal device, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communications device, a user agent, a user apparatus, or the like.
  • UE user equipment
  • UE User Equipment
  • the terminal may alternatively be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a wireless local loop (Wireless Local Loop, WLL) station, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device or a computing device having a wireless communications function, another processing device connected to a wireless modem, an in-vehicle device, or a wearable device, a terminal in a future 5G network, a terminal in a future evolved public land mobile network (Public Land Mobile Network, PLMN), or the like. This is not limited in this embodiment of this application.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • PLMN Public Land Mobile Network
  • a network device in this embodiment of this application may be a device configured to communicate with the terminal.
  • the network device may be a base transceiver station (Base Transceiver Station, BTS) in a Global System for Mobile Communications (Global System of Mobile communication, GSM) or in Code Division Multiple Access (Code Division Multiple Access, CDMA), a NodeB (NodeB, NB) in a Wideband Code Division Multiple Access (Wideband Code Division Multiple Access, WCDMA) system, an evolved NodeB (Evolutional Node B, eNB or eNodeB) in a Long Term Evolution (Long Term Evolution, LTE) system, or a wireless controller in a cloud radio access network (Cloud Radio Access Network, CRAN) scenario.
  • BTS Base Transceiver Station
  • GSM Global System of Mobile Communications
  • CDMA Code Division Multiple Access
  • NodeB NodeB
  • WCDMA Wideband Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • the network device may be a relay station, an access point, an in-vehicle device, a wearable device, a network device in a future 5G network, a network device in a future evolved PLMN network, or the like. This is not limited in this embodiment of this application.
  • a manner of restricting a precoding matrix subset in an LTE system is restricting vectors that can be selected for W 1 .
  • a network device notifies a terminal of vectors that can be used by the terminal. If a specific vector is restricted, for example, a first vector is restricted, the first vector cannot appear in W 1 when the terminal selects a precoding matrix. However, because vectors close to the first vector have relatively strong energy in a direction of the first vector, the network device usually cannot restrict use of only the first vector but also needs to restrict the vectors close to the first vector. If a prior-art method is used, vectors close to (or near) the first vector cannot appear in W 1 , either. In this case, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • W W 1 ⁇ W 2 .
  • this application provides a method for determining a precoding matrix set.
  • a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of the vector, thereby improving system performance.
  • the method for determining a precoding matrix set in an embodiment of this application may be applied to the Type II precoding matrix W in the NR, or applied to a precoding matrix W that satisfies the following condition:
  • a terminal device may determine, from the first precoding matrix set based on indication information sent by a network device, a second precoding matrix set that can be used.
  • p z , y ⁇ 1 , x ⁇ 1 0 may represent a wideband amplitude
  • p 1 , y ⁇ 1 , x ⁇ 1 2 may represent a subband amplitude
  • p z , y ⁇ 1 , x ⁇ 1 2 may represent a phase.
  • the phase is represented by a complex number whose modulus is 1.
  • FIG. 2 is a schematic flowchart of a method for determining a precoding matrix set according to an embodiment of this application. The method may be applied to the precoding matrix W described above. The following describes, with reference to FIG. 2 , in detail the method for determining a precoding matrix set in this embodiment of this application.
  • a network device sends indication information to a terminal.
  • the indication information includes indication information of S sets D 0 to D S-1 .
  • D 0 to D S-1 are respectively in one-to-one correspondence with Co to C S-1 , any vector c j in C belongs to B, D j is a proper subset of A 0 , S - 1 ⁇ j ⁇ 0, and j is an integer.
  • the terminal device determines, based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • the terminal device can determine, based on the indication information sent by the network device, D 0 to D S-1 that are in one-to-one correspondence with c 0 to c S - 1 in the vector set C.
  • the precoding vector cannot be used.
  • W 1 1 b 0 b 1 0 0 b 0 b 1
  • a vector b 0 in column 1 of W 1 1 belongs to the vector set C , and a product factor 0.5 of elements in row 1 of W 2 1 belongs to D 0 . Therefore, it may be determined that the second precoding matrix set does not include W 1 . In other words, W 1 does not belong to the second precoding matrix set.
  • W 2 For W 2 , although a vector b 0 in column 1 and column 3 of W 1 2 belongs to the vector set C , a product factor 0.125 of elements in row 1 and row 3 of W 2 2 does not belong to D 0 . A vector b 1 in column 2 and column 4 of W 1 2 belongs to the vector set C , but neither a product factor 0.0625 nor a product factor 0.125 of elements in row 2 and row 4 of W 2 2 belongs to D 1 . Therefore, it may be determined that W 2 belongs to the second precoding matrix set.
  • W 1 1 and W 1 2 are two specific examples of W 1
  • W 2 1 and W 2 2 are two specific examples of W 2 .
  • the following describes in detail the indication information sent by the network device.
  • indication information #1 of the S sets D 0 to D S-1 . It should be understood that a manner of determining the vector set C by the terminal device is not limited in this embodiment of this application.
  • Indication information #1 includes S bit fields, the S bit fields are in one-to-one correspondence with D 0 to D S-1 , each bit field includes at least one bit, and a bit field corresponding to D j indicates an element (denoted as g j ) of A 0 . Any element of D j is greater than g j .
  • the indication information sent by the network device includes seven bit fields (denoted as a bit field #1 to a bit field #7).
  • the bit field #1 to the bit field #7 are in one-to-one correspondence with seven vectors in the vector set C. To be specific, the bit field #1 corresponds to b 0 , the bit field #2 corresponds to b 1 , ..., and the bit field #7 corresponds to b 6 .
  • Each bit field includes three bits, and each bit field indicates an element of A 0 .
  • the terminal device can determine D 0 to D 6 based on the bit field #1 to the bit field #7. Description is given with reference to Table 1.
  • Table 1 b 0 b 1 b 2 b 3 b 4 b 5 b 6 Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 Bit field #7 [001] [010] [011] [100] [101] [110] [111] ⁇ 0.0156 ⁇ 0.0313 ⁇ 0.0625 ⁇ 0.125 ⁇ 0.25 ⁇ 0.5 1
  • bit field #1 is 001, indicating an element ⁇ 0.0156 of A 0 .
  • D 0 to D 6 may be determined respectively based on the bit field #2 to the bit field #5.
  • bitmap manner is used for indication.
  • the bitmap manner may be used to indicate each available amplitude of each restricted vector. For example, if A0 has eight amplitudes to be selected, each vector needs eight bits to indicate a restricted amplitude of the vector.
  • a manner of indicating one of amplitudes of A0 may be used for restriction. In this way, each vector needs only three bits to determine a restricted amplitude value of the vector.
  • a 0 includes F elements.
  • Indication information #1 includes S bit fields, the S bit fields are in one-to-one correspondence with D 0 to D S-1 , each bit field includes F bits, and the F bits are used respectively to indicate the F elements of A 0 .
  • the F bits of a bit field corresponding to D j an element of A 0 indicated by a bit that is 0 or 1 belongs to D j .
  • the indication information #1 includes seven bit fields (denoted as a bit field #1 to a bit field #7).
  • the bit field #1 to the bit field #7 are in one-to-one correspondence with seven vectors in the vector set C .
  • the bit field #1 corresponds to b 0
  • the bit field #2 corresponds to b 1
  • ... and the bit field #7 corresponds to b 6 .
  • Each bit field includes eight bits.
  • bits of a bit field respectively indicate a first element to an eighth element of A0.
  • a value indicated by a bit that is 0 or 1 belongs to D j .
  • D 0 to D 6 may be determined based on the bit field #1 to the bit field #7. Description is given with reference to Table 2.
  • Table 2 b 0 b 1 b 2 b 3 b 4 b 5 b 6 Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 Bit field #7 11000000 11100000 11100000 11010000 00001100 00000110 11011000
  • the indication information of the S sets D 0 to D S-1 is T bit fields, the T bit fields correspond to T vectors in a vector set B, and S ⁇ T.
  • a t th bit field in the T bit fields is used to indicate whether a vector b t belongs to the vector set C , where 0 ⁇ t ⁇ T - 1.
  • S bit fields in the T bit fields determine both S vectors in the vector set C and D 0 to D S-1 .
  • a t th bit field in the S bit fields is 111.
  • a value determined by the bit field is 1, indicating that all elements of A 0 can be used. Therefore, it may be determined that a vector b t -1 does not belong to C.
  • the indication information #1 may further include indication information (denoted as indication information #2) of the vector set C .
  • the indication information #2 includes T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a t th bit in the T bits is used to indicate whether a vector b t -1 belongs to the vector set C , where 1 ⁇ t ⁇ T.
  • the indication information #2 includes eight bits, the eight bits, in an order a most significant bit to a least significant bit, respectively correspond to b 0 , b 1 ⁇ , b 7 , and a bit that is 0 indicates that the vector b t belongs to the vector set C. If the indication information #2 is 00111111, it may be determined that b 0 and b 1 belong to the vector set C .
  • the indication information #2 herein is different from the indication information #1.
  • the indication information may be used to indicate b fh and k h
  • the terminal may determine the vector set C and the sets D 0 to D S-1 based on b fh and k h
  • the terminal may determine the second precoding matrix set.
  • the terminal may determine C and the sets D 0 to D S-1 based on b fh and k h in the following two manners.
  • Any vector c j of C and any element D j ( v ) of D j satisfy the following condition: D j ⁇ ⁇ b fh H ⁇ c j > k h
  • b fh is a vector of B
  • k h is a real number
  • H is an integer.
  • the terminal device can obtain b fh and k h based on the indication information sent by the network device; determine, based on b fh and k h , the vector set C and the sets D 0 to D S-1 that satisfy the foregoing relational expression; and then determine the second precoding matrix set.
  • C includes at least M mutually orthogonal vectors, and any mutually M orthogonal vectors c j 0 , c j 1 , ⁇ , c jM -1 and elements D j 0 ( v 0 ), D j 1 ( v 1 ), ⁇ , D jM- 1 ( v M -1 ) satisfy the following condition: D j 0 ⁇ 0 ⁇ b fh H ⁇ c j 0 2 + D j 1 ⁇ 1 ⁇ b fh H ⁇ c j 1 2 + ⁇ , + D j M ⁇ 1 ⁇ M ⁇ 1 ⁇ b fh H ⁇ c j M ⁇ 1 2 D j 0 ⁇ 0 2 + D j 1 ⁇ 1 2 + ⁇ + D j M ⁇ 1 ⁇ M ⁇ 1 2 > k h
  • D j 0 ( v 0 ) D j 1 ( v 1 ), ⁇ , D j
  • the terminal device can obtain b fh and k h based on the indication information sent by the network device; determine, based on b fh and k h , the vector set C and the sets D 0 to D S-1 that satisfy the foregoing relational expression; and then determine the second precoding matrix set.
  • a first product factor corresponding to b 0 is ao
  • a first product factor corresponding to b 1 is ai
  • ao belongs to A 0
  • a 1 belongs to A 0
  • the vectors b 0 and b 1 belong to C
  • ao belongs to D 0
  • a 1 belongs to D 1 .
  • All first product factors in A 0 are traversed. All ao satisfying the foregoing formula belong to the set D 0 , and all a 1 satisfying the foregoing formula belong to the set D 1 .
  • the indication information sent by the network device may include indication information (denoted as indication information #3) of k h .
  • the indication information #3 may include H bit fields, and an h th bit field in the H bit fields is used to indicate k h .
  • bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 00 01 10 11 10 11 0 0.25 0.5 1 0.5 1
  • an f 1 -1 th vector, an f 2 -1 th vector, an f 3 -1 th vector, an f 4 -1 th vector, an f 5- 1 th vector, and an f 6 -1 th vector are b f 1 , b f 2 , b f 3 , b f 4 , b f 5 , b f 6 respectively, which correspond to the bit field #1, the bit field #2, the bit field #3, the bit field #4, the bit field $5, and the bit field #6.
  • the vector set C and D j can be determined by using indication information including a relatively small quantity of bits.
  • indication information including a relatively small quantity of bits.
  • the indication information sent by the network device may include indication information (denoted as indication information #4) of b fh , and the terminal device may determine b fh based on the indication information #4.
  • the indication information #4 includes H bits, and an h th bit is used to indicate b fh .
  • the indication information sent by the network device includes T bits, and the T bits are in one-to-one correspondence with T vectors in T vector sets B.
  • T 8
  • a bitmap is 00001111
  • the indication information #4 includes four least significant bits of the bitmap, and an h th bit in the four least significant bits indicates b h .
  • the indication information may alternatively be indication information #5.
  • the indication information #5 may indicate both the vector set C and D 0 to D S-1 .
  • the indication information #5 is T bit fields.
  • the T bit fields are in one-to-one correspondence with T vectors included in B, each of the T bit fields includes E bits, E is greater than or equal to 1, and a t th bit field in the T bit fields is used to indicate whether a vector b t -1 belongs to the vector set C , where 1 ⁇ t ⁇ T.
  • a bitmap of the T bits is used to determine a restricted vector, and the indication information of the S sets D 0 to D S-1 includes only S or H bit fields. In this way, when S is relatively small, a quantity of bits required for indicating the S sets D 0 to D S-1 can be reduced.
  • each bit field indicates an element of A 0 , and if a set including elements greater than or equal to an element indicated by a specific bit group is a proper subset of A 0 , a vector indicated by the bit group belongs to the vector set C.
  • the indication information sent by the network device includes eight bit fields (denoted as a bit field #1 to a bit field #8).
  • the bit field #1 to the bit field #8 are in one-to-one correspondence with T vectors in the vector set B.
  • the bit field #1 corresponds to b 0
  • the bit field #2 corresponds to b 1
  • ... the bit field #8 corresponds to b 7 .
  • Each bit field includes three bits, and each bit field indicates an element of A 0 . Description is given with reference to Table 4.
  • each of the bit field #2 to the bit field #8 is used to indicate a non-zero element of A 0 .
  • the bit field #2 to the bit field #8 are in one-to-one correspondence with vectors in the set C, and the bit field #2 to the bit field #8 may be used to indicate D 0 to D 6 .
  • bit field #2 is 001, indicating an element ⁇ 0.0156 of A 0 .
  • D 1 to D 6 may be determined respectively based on the bit field #3 to the bit field #8.
  • the bit field #1 is 000, indicating an element 0 of A 0 . All elements greater than 0 in A 0 form b 0 , which corresponds to a set ⁇ 1, ⁇ 0.5, ⁇ 0.25, ⁇ 0.125, ⁇ 0.0625, ⁇ 0.0313, ⁇ 0.0156 ⁇ .
  • the set is A 0 ; therefore, b 0 does not belong to the vector set C.
  • the E bits are respectively used to indicate E elements of A 0 . If bits of a specific bit field are all zeros or all ones, it indicates that a vector corresponding to the bit field does not belong to the vector set C, and a vector corresponding to a bit field whose bits are not all zeros or ones belongs to the vector set C.
  • the indication information sent by the network device includes eight bit fields (denoted as a bit field #1 to a bit field #8).
  • the bit field #1 to the bit field #8 are in one-to-one correspondence with T vectors in the vector set B. To be specific, the bit field #1 corresponds to b 0 , the bit field #2 corresponds to b 1 ... and the bit field #8 corresponds to b 7 .
  • Each bit field includes eight bits. In an order from a most significant bit to a least significant bit, bits of a bit field respectively indicate a first element to an eighth element of A0.
  • a bit that is 0 or 1 indicates that a corresponding element belongs to D j .
  • bit field #8 is 11111111, it indicates that all elements in A 0 can be used and then b 7 corresponding to the bit field #8 does not belong to the vector set C. Bit fields separately corresponding to the bit field #3 to the bit field #7 are not all ones, and D 1 to D 6 may be determined respectively based on the bit field #3 to the bit field #7.
  • a value range of p z , y ⁇ 1 , x ⁇ 1 1 is a set A 1
  • the indication information is further used to indicate S sets E 0 to E S-1 , E 0 to E S-1 are respectively in one-to-one correspondence with c 0 to c S -1
  • E j is a proper subset of A 1 .
  • the S sets E 0 to E S-1 may be indicated with reference to the foregoing described method.
  • the terminal device may determine the second precoding matrix set based on the set C, the sets D 0 to D S-1 , and the sets E 0 to E S-1 .
  • details about how the indication information indicates the sets E 0 to E S-1 are not described herein again.
  • more refined codebook restriction can be achieved by restricting both a wideband amplitude and a subband amplitude.
  • the network device may send the plurality of pieces of indication information by using higher layer signaling.
  • the higher layer signaling may carry the plurality of pieces of indication information.
  • the higher layer signaling may be radio resource control (Radio Resource Control, RRC) signaling or a Media Access Control-control element (Media Access Control-Control Element, MAC CE).
  • RRC Radio Resource Control
  • MAC CE Media Access Control-Control Element
  • the method may further include:
  • the network device sends a CSI-RS to the terminal device.
  • the terminal device determines a channel matrix based on the CSI-RS, and determines, based on the channel matrix, a first PMI used to indicate W 1 and a second PMI used to indicate W 2 .
  • the network device may determine, based on the first PMI and the second PMI, a precoding matrix to be used when the network device sends data to the terminal device.
  • FIG. 3 is a schematic block diagram of a communications apparatus according to an embodiment of this application.
  • the communications apparatus 300 shown in FIG. 3 includes a receiving unit 310 and a processing unit 320.
  • the receiving unit 310 is configured to receive indication information.
  • the processing unit 320 is configured to determine, based on the indication information received by the receiving unit, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • W is a matrix of N t rows and R columns, N t is greater than or equal to R
  • X [ b k 0 ⁇ b kM- 1 ]
  • b ki is an N t /2 ⁇ 1 vector
  • T is a quantity of vectors in B
  • T is an integer
  • W 2 is a matrix of 2M rows and R columns
  • FIG 4 is a schematic block diagram of a communications apparatus according to an embodiment of this application.
  • the communications apparatus 400 shown in FIG 4 includes a processing unit 410 and a sending unit 420.
  • the processing unit 410 is configured to generate indication information, where the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R.
  • the sending unit 420 is configured to send the indication information generated by the generation unit.
  • W is a matrix of N t rows and R columns, N t is greater than or equal to R
  • X [b k 0 ⁇ b k M- 1 ]
  • b ki is an N t /2 ⁇ 1 vector
  • T is a quantity of vectors in B
  • T is an integer
  • W 2 is a matrix of 2M rows and R columns
  • the indication information of the S sets D 0 to D S-1 includes S bit fields, the S bit fields are in one-to-one correspondence with D 0 to D S-1 , each bit field includes at least one bit, a bit field corresponding to D j indicates an element g j of A 0 , and any element of D j is greater than g j .
  • any vector c j of C and any element D j ( v ) of D j satisfy the following condition: D j ⁇ ⁇ b ⁇ h H ⁇ c j > k h
  • b fh is a vector of B
  • k h is a real number
  • H is an integer.
  • C includes at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j 0 , c j 1 , ..., c j M-1 , and elements D j 0 ( v 0 ), D j 1 ( v 1 ), ..., D jM -1 ( v M -1 ) satisfy the following condition: D j 0 ⁇ 0 ⁇ b ⁇ h H ⁇ c j 0 2 + D j 1 ⁇ 1 ⁇ b ⁇ h H ⁇ c j 1 2 + ⁇ , + D j M ⁇ 1 ⁇ M ⁇ 1 ⁇ b ⁇ h H ⁇ c j M ⁇ 1 2 D j 0 ⁇ 0 2 + D j 1 ⁇ 1 2 + ⁇ + D j M ⁇ 1 ⁇ M ⁇ 1 2 > k h
  • D j 0 ( v 0 ) D j 1 ( v )
  • the indication information of the S sets D 0 to D S-1 includes H bit fields, and an h th bit field is used to indicate k h .
  • the indication information further includes indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a t th bit in the T bits is used to indicate whether a vector b t -1 belongs to the vector set C, where 1 ⁇ t ⁇ T.
  • the indication information of the S sets D 0 to D S-1 is further used to indicate the vector set C
  • the indication information of the S sets D 0 to D S-1 is T bit fields
  • the T bit fields are in one-to-one correspondence with T vectors included in B
  • each of the T bit fields includes E bits
  • E is greater than or equal to 1
  • a t th bit field in the T bit fields is used to indicate whether a vector b t -1 belongs to the vector set C, where 1 ⁇ t ⁇ T.
  • a value range of p z , y ⁇ 1 , x ⁇ 1 1 is a set A 1 ;
  • the receiving unit 310 may be a transceiver 540
  • the determining unit 320 may be a processor 520
  • the communications apparatus may further include an input/output interface 530 and a memory 510, specifically as shown in FIG 5 .
  • FIG 5 is a schematic block diagram of a terminal device according to another embodiment of this application.
  • the terminal device can perform all the methods in the foregoing embodiments; therefore, for specific details, refer to descriptions in the foregoing embodiments. Details are not described herein again to avoid repetition.
  • the terminal device 500 shown in FIG 5 may include: a memory 510, a processor 520, an input/output interface 530, and a transceiver 540.
  • the memory 510, the processor 520, the input/output interface 530, and the transceiver 540 are connected to each other by using an internal connection path.
  • the memory 510 is configured to store an instruction.
  • the processor 520 is configured to execute the instruction stored in the memory 510, to control the input/output interface 530 to receive data and information that are input, and output data such as an operation result, and to control the transceiver 540 to send a signal.
  • the transceiver 540 is configured to receive indication information.
  • the processor 520 is configured to determine, based on the indication information received by the receiving unit, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • W is a matrix of N t rows and R columns, N t is greater than or equal to R
  • x [ b k 0 ⁇ b k M-1 ]
  • b k i is an N t /2 ⁇ 1 vector
  • T is a quantity of vectors in B
  • T is an integer
  • W 2 is a matrix of 2M rows and R columns
  • the processor 520 may use a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), or one or more integrated circuits to execute a related program to implement the technical solutions provided in this embodiment of this application.
  • CPU Central Processing Unit
  • ASIC Application-Specific Integrated Circuit
  • the transceiver 540 is also referred to as a communications interface, and uses a transceiver apparatus, for example but not limited to a transceiver, to implement communication between the terminal 500 and another device or a communications network.
  • the memory 510 may include a read-only memory and a random access memory, and provides the processor 520 with data and an instruction.
  • a part of the processor 520 may further include a non-volatile random access memory.
  • the processor 520 may further store device type information.
  • the steps in the foregoing methods may be completed by an integrated logic circuit of hardware in the processor 520 or by an instruction in a software form.
  • the methods for determining a precoding matrix set disclosed in the embodiments of this application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware of a processor and a software module.
  • 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 or an electrically erasable programmable memory, or a register.
  • the storage medium is located in the memory 510.
  • the processor 520 reads information in the memory 510, to complete the steps of the methods in combination with hardware of the processor 520. Details are not described herein again to avoid repetition.
  • the processor may be a central processing unit (central processing unit, CPU), or the processor may be another general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (application-specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or another programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like.
  • the general purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.
  • the sending unit 420 may be a transceiver 640
  • the processing unit 410 may be a processor 620
  • the communications apparatus may further include an input/output interface 630 and a memory 610, specifically as shown in FIG 6 .
  • FIG 6 is a schematic block diagram of a network device according to another embodiment of this application.
  • the network device can perform all the methods in the foregoing embodiments; therefore, for specific details, refer to descriptions in the foregoing embodiments. Details are not described herein again to avoid repetition.
  • the network device 600 shown in FIG 6 may include: a memory 610, a processor 620, an input/output interface 630, and a transceiver 640.
  • the memory 610, the processor 620, the input/output interface 630, and the transceiver 640 are connected to each other by using an internal connection path.
  • the memory 610 is configured to store an instruction.
  • the processor 620 is configured to execute the instruction stored in the memory 610, to control the input/output interface 630 to receive data and information that are input, and output data such as an operation result, and to control the transceiver 640 to send a signal.
  • the processor 620 is configured to generate indication information, where the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R.
  • the transceiver 640 is configured to send the indication information generated by the processor.
  • W is a matrix of N t rows and R columns, N t is greater than or equal to R
  • X [ b k 0 ⁇ b k M -1 ]
  • b k i is an N t /2 ⁇ 1 vector
  • T is a quantity of vectors in B
  • T is an integer
  • W 2 is a matrix of 2M rows and R columns
  • the processor 620 may use a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), or one or more integrated circuits to execute a related program to implement the technical solutions provided in this embodiment of this application.
  • CPU Central Processing Unit
  • ASIC Application-Specific Integrated Circuit
  • the transceiver 640 is also referred to as a communications interface, and uses a transceiver apparatus, for example but not limited to a transceiver, to implement communication between the terminal 600 and another device or a communications network.
  • the memory 610 may include a read-only memory and a random access memory, and provides the processor 620 with data and an instruction.
  • a part of the processor 620 may further include a non-volatile random access memory.
  • the processor 620 may further store device type information.
  • the steps in the foregoing methods may be completed by an integrated logic circuit of hardware in the processor 620 or by an instruction in a software form.
  • the methods for determining a precoding matrix set disclosed in the embodiments of this application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware of a processor and a software module.
  • 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 or an electrically erasable programmable memory, or a register.
  • the storage medium is located in the memory 610.
  • the processor 620 reads information in the memory 610, to complete the steps of the methods in combination with hardware of the processor 620. Details are not described herein again to avoid repetition.
  • the processor may be a central processing unit (central processing unit, CPU), or the processor may be another general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (application-specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or another programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like.
  • the general purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.
  • the disclosed systems, apparatuses, and methods may be implemented in other manners.
  • the described apparatus embodiments are merely examples.
  • the unit division is merely logical function division and may be other division in actual implementation.
  • a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces.
  • the indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
  • the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual requirements to achieve the objectives of the solutions of the embodiments.
  • the functions When the functions are implemented in the form of a software functional unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of this application essentially, or the part contributing to the prior art, or some of the technical solutions may be implemented in a form of a software product.
  • the software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform all or some of the steps of the methods described in the embodiments of this application.
  • the foregoing storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk, an optical disc, or the like.
  • program code such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk, an optical disc, or the like.

Description

    TECHNICAL FIELD
  • This application relates to the communications field, and more specifically, to a method for determining a precoding matrix set and a transmission apparatus.
  • BACKGROUND
  • A manner of restricting a precoding matrix subset in a Long Term Evolution (long term evolution, LTE) system is restricting vectors that can be selected for W 1, To be specific, a network device notifies a terminal of vectors that can be used by the terminal. If a specific vector is restricted, for example, a first vector is restricted, the first vector cannot appear in W 1 when the terminal selects a precoding matrix. However, because vectors close to the first vector have relatively strong energy in a direction of the first vector, the network device usually cannot restrict use of only the first vector but also needs to restrict the vectors close to the first vector. If a prior-art method is used, vectors close to (or near) the first vector cannot appear in W 1, either. In this case, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • In the New Radio Access Technology (New Radio Access Technology, NR), a type II (Type II) precoding matrix is defined: w = w 1 × w 2 . Currently, no technology is related to a solution for restricting a precoding matrix subset of the Type II precoding matrix w = w × w 2 . However, if the manner of restricting a precoding matrix in the LTE system is used, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • 3GPP (3rd Generation Partnership Project) contribution R1-1709232 discloses a structure of Type II single-panel codebook. According to R1-1709232, Type II single-panel codebook supports rank 1 and 2 transmission. R1-1709232 further discloses bit allocation solution for coefficients which are used to combine several vectors to generate a precoding matrix.
  • 3GPP contribution R1-1711028 discloses a codebook subset restriction solution for Type II codebook. According to R1-1711028, when any beam in a codeword is a restricted beam, the codeword is not used in CSI (Channel State Information) feedback.
  • SUMMARY
  • This application provides a method for determining a precoding matrix set, so as to avoid a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used, thereby improving system performance.
  • According to a first aspect, a method for determining a precoding matrix set is provided, including:
    • receiving, by a terminal device, indication information; and
    • determining, by the terminal device based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R, where
    • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
      Figure imgb0001
      , X = [b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
      Figure imgb0002
      , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
      Figure imgb0003
      , p z , y 1 , x 1 0
      Figure imgb0004
      is a first product factor, p z , y 1 , x 1 1
      Figure imgb0005
      is a second product factor, p 1 , y 1 , x 1 2
      Figure imgb0006
      is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
      Figure imgb0007
      is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
      Figure imgb0008
      , p z , y 1 , x 1 0
      Figure imgb0009
      is a real number, 1 p z , y 1 , x 1 1 0
      Figure imgb0010
      , p z , y 1 , x 1 1
      Figure imgb0011
      is a real number, and p z , y 1 , x 1 2
      Figure imgb0012
      is a complex number whose modulus is 1;
    • the indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W=W 1×W 2 that satisfies the following condition in the first precoding matrix set:
      an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
      Figure imgb0013
      of at least one of elements in row x and row x+M of W2 belongs to D j .
  • According to the method for determining a precoding matrix set in this application, a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of a beam vector, thereby improving system performance.
  • According to a second aspect, a method for determining a precoding matrix set is provided, including:
    • generating, by a network device, indication information, where the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
    • sending, by the network device, the indication information, where
    • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
      Figure imgb0014
      , X = [b k 0 ··· b kM-1], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
      Figure imgb0015
      , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
      Figure imgb0016
      , p z , y 1 , x 1 0
      Figure imgb0017
      is a first product factor, p z , y 1 , x 1 1
      Figure imgb0018
      is a second product factor, p 1 , y 1 , x 1 2
      Figure imgb0019
      is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
      Figure imgb0020
      is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
      Figure imgb0021
      , p z , y 1 , x 1 0
      Figure imgb0022
      is a real number, 1 p z , y 1 , x 1 1 0
      Figure imgb0023
      , p z , y 1 , x 1 1
      Figure imgb0024
      is a real number, and p z , y 1 , x 1 2
      Figure imgb0025
      is a complex number whose modulus is 1;
    • the indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
      an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
      Figure imgb0026
      of at least one of elements in row x and row x+M of W2 belongs to D j .
  • According to the method for determining a precoding matrix set in this application, a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of the vector, thereby improving system performance.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, the indication information of the S sets D0 to DS-1 includes S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field includes at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than gj.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, any vector c j of C and any element D j(v) of D j satisfy the following condition: D j ν × b f h H × c j > k h
    Figure imgb0027
    where b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, C includes at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j 0 , , c j1, ···, c jM-1, and elements D j0(v 0), D j1(v 1), ···, D jM-1,(vM-1) satisfy the following condition: D j 0 ν 0 × b f h H × c j 0 2 + D j 1 ν 1 × b f h H × c j 1 2 + , + D j M 1 ν M 1 × b f h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
    Figure imgb0028
    where D j 0(v 0), D j1(v1), ···, D jM-1(v M-1) are elements of sets D j0, D j1, ···, D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • In this manner, at least M orthogonal vectors are simultaneously restricted. Because X in W1 includes M vectors, this manner actually restricts the M vectors included in W1. Because a codebook is formed by a linear combination of the vectors in W1, this manner can achieve more accurate restriction of the codebook.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, the indication information of the S sets D0 to DS-1 includes H bit fields, and an hth bit field is used to indicate kh.
  • In this manner, the vector set C and Dj can be determined by using indication information including a relatively small quantity of bits. In an extreme case, at least two vectors and Dj that corresponds to each of the at least two vectors can be determined by using only one bit field (H = 1).
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, the indication information further includes indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t ≤ T.
  • In this manner, a bitmap of the T bits is used to determine a restricted vector, and the indication information of the S sets D0 to DS-1 includes only S or H bit fields. In this way, when S is relatively small, a quantity of bits required for indicating the S sets D0 to DS-1 can be reduced.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, the indication information of the S sets D0 to DS-1 is further used to indicate the vector set C, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields are in one-to-one correspondence with T vectors included in B, each of the T bit fields includes E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t ≤ T.
  • With reference to the first aspect or the second aspect, in a possible implementation of the first aspect or the second aspect, a value range of p z , y 1 , x 1 1
    Figure imgb0029
    is a set A1;
    • the indication information further includes indication information of S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1 in the vector set C = {c 0, c 1, ···, c S-1}, and Ej is a proper subset of A1; and
    • the second precoding matrix set still does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    • the xth column vector included in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
      Figure imgb0030
      of at least one element of the elements in row x and row x+M of W2 that corresponds to c j belongs to E j .
  • According to the method in this embodiment of this application, more refined codebook restriction can be achieved by restricting both a wideband amplitude and a subband amplitude.
  • According to a third aspect, a communications apparatus is provided, and the communications apparatus has functions of implementing the terminal device in the method designs of the first aspect. These functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more units that correspond to the foregoing functions.
  • According to a fourth aspect, a communications apparatus is provided, and the communications apparatus has functions of implementing the network device in the method designs of the second aspect. These functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more units that correspond to the foregoing functions.
  • According to a fifth aspect, a communications apparatus is provided, including a transceiver, a processor, and a memory. The processor is configured to control the transceiver to send and receive signals; the memory is configured to store a computer program; and the processor is configured to invoke the computer program from the memory and run the computer program, so that a terminal device performs the method according to the first aspect.
  • According to a sixth aspect, a communications apparatus is provided, including a transceiver, a processor, and a memory. The processor is configured to control the transceiver to send and receive signals; the memory is configured to store a computer program; and the processor is configured to invoke the computer program from the memory and run the computer program, so that a network device performs the method according to the second aspect.
  • According to a seventh aspect, a computer program product is provided, the computer program product includes computer program code, and when the computer program code runs on a computer, the computer performs the methods according to the foregoing aspects.
  • According to an eighth aspect, a computer readable medium is provided, the computer readable medium stores program code, and when the computer program code runs on a computer, the computer performs the methods according to the foregoing aspects.
  • According to a ninth aspect, a chip system is provided, and the chip system includes a processor, and is used by a communications apparatus to implement functions in the foregoing aspects, such as generating, receiving, sending, or processing data and/or information related to the foregoing methods. In a possible design, the chip system further includes a memory, and the memory is configured to store a program instruction and data that are necessary for a terminal device. The chip system may include a chip, or may include a chip and another discrete device.
  • According to a tenth aspect, a chip system is provided, and the chip system includes a processor, configured to support a communications apparatus in implementing functions in the foregoing aspects, such as generating, receiving, sending, or processing data and/or information related to the foregoing methods. In a possible design, the chip system further includes a memory, and the memory is configured to store a program instruction and data that are necessary for a network device. The chip system may include a chip, or may include a chip and another discrete device.
  • BRIEF DESCRIPTION OF DRAWINGS
    • FIG. 1 is a schematic architectural diagram of a mobile communications system applied to an embodiment of this application;
    • FIG. 2 is a schematic flowchart of a method for determining a precoding matrix set according to an embodiment of this application;
    • FIG. 3 is a schematic block diagram of a transmission apparatus according to an embodiment of this application;
    • FIG. 4 is a schematic block diagram of a transmission apparatus according to an embodiment of this application;
    • FIG. 5 is a schematic block diagram of a transmission apparatus according to another embodiment of this application; and
    • FIG. 6 is a schematic block diagram of a transmission apparatus according to still another embodiment of this application.
    DESCRIPTION OF EMBODIMENTS
  • The following describes the technical solutions of this application with reference to the accompanying drawings.
  • The technical solutions of the embodiments of this application may be applied to various communications systems, such as: a Global System for Mobile Communications (Global System of Mobile communication, GSM) system, a Code Division Multiple Access (Code Division Multiple Access, CDMA) system, a Wideband Code Division Multiple Access (Wideband Code Division Multiple Access, WCDMA) system, a general packet radio service (General Packet Radio Service, GPRS) system, a Long Term Evolution (Long Term Evolution, LTE) system, an LTE frequency division duplex (Frequency Division Duplex, FDD) system, an LTE time division duplex (Time Division Duplex, TDD) system, a Universal Mobile Telecommunications System (Universal Mobile Telecommunication System, UMTS), a Worldwide Interoperability for Microwave Access (Worldwide Interoperability for Microwave Access, WiMAX) communications system, a future 5th generation (5th Generation, 5G) system, or a new radio (New Radio, NR) system.
  • FIG. 1 is a schematic architectural diagram of a mobile communications system applied to an embodiment of this application. As shown in FIG. 1, the mobile communications system includes a core network device 110, an access network device 120, and at least one terminal (such as a terminal device 130 and a terminal device 140 in FIG. 1). The terminal is connected to the access network device 120 in a wireless manner, and the access network device 120 is connected to the core network device 110 in a wireless or wired manner. The core network device 110 and the access network device 120 may be different independent physical devices, or functions of the core network device 110 and logical functions of the access network device may be integrated into a same physical device, or one physical device may integrate some functions of the core network device 210 and some functions of the access network device 120. The terminal may be at a fixed location, or may be mobile. FIG. 1 is merely a schematic diagram, and the communications system may further include another network device, for example, may further include a wireless relay device and a wireless backhaul device (which are not drawn in FIG. 1). This embodiment of this application imposes no limitation on quantities of core network devices, access network devices, and terminals included in the mobile communications system.
  • The terminal in this embodiment of this application, such as the terminal 130 or the terminal 140, may be referred to as user equipment (User Equipment, UE), a terminal device, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communications device, a user agent, a user apparatus, or the like. The terminal may alternatively be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a wireless local loop (Wireless Local Loop, WLL) station, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device or a computing device having a wireless communications function, another processing device connected to a wireless modem, an in-vehicle device, or a wearable device, a terminal in a future 5G network, a terminal in a future evolved public land mobile network (Public Land Mobile Network, PLMN), or the like. This is not limited in this embodiment of this application.
  • A network device in this embodiment of this application, such as the access network device 120, may be a device configured to communicate with the terminal. The network device may be a base transceiver station (Base Transceiver Station, BTS) in a Global System for Mobile Communications (Global System of Mobile communication, GSM) or in Code Division Multiple Access (Code Division Multiple Access, CDMA), a NodeB (NodeB, NB) in a Wideband Code Division Multiple Access (Wideband Code Division Multiple Access, WCDMA) system, an evolved NodeB (Evolutional Node B, eNB or eNodeB) in a Long Term Evolution (Long Term Evolution, LTE) system, or a wireless controller in a cloud radio access network (Cloud Radio Access Network, CRAN) scenario. Alternatively, the network device may be a relay station, an access point, an in-vehicle device, a wearable device, a network device in a future 5G network, a network device in a future evolved PLMN network, or the like. This is not limited in this embodiment of this application.
  • A manner of restricting a precoding matrix subset in an LTE system is restricting vectors that can be selected for W 1. To be specific, a network device notifies a terminal of vectors that can be used by the terminal. If a specific vector is restricted, for example, a first vector is restricted, the first vector cannot appear in W 1 when the terminal selects a precoding matrix. However, because vectors close to the first vector have relatively strong energy in a direction of the first vector, the network device usually cannot restrict use of only the first vector but also needs to restrict the vectors close to the first vector. If a prior-art method is used, vectors close to (or near) the first vector cannot appear in W 1, either. In this case, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • In the New Radio Access Technology (New Radio Access Technology, NR), a type II (Type II) precoding matrix is defined: W = W 1 × W 2 . Currently, no technology is related to a solution for restricting a precoding matrix subset of the Type II precoding matrix W = W 1 × W 2 . If the manner of restricting a precoding matrix in the LTE system is used, a relatively large quantity of precoding matrices cannot be used, and consequently, system performance deteriorates.
  • In view of this, this application provides a method for determining a precoding matrix set. A case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of the vector, thereby improving system performance.
  • The method for determining a precoding matrix set in an embodiment of this application may be applied to the Type II precoding matrix W in the NR, or applied to a precoding matrix W that satisfies the following condition:
    • W = W 1 × W 2, where W is a matrix of Nt rows and R columns, Nt is a quantity of antenna ports, Nt is greater than or equal to R, R is a value of a rank, and W 1 satisfies the following: W 1 = X 0 0 X
      Figure imgb0031
    • where X = [b k 0 ··· b kM-1 ] b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, and T is an integer; and
    • W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
      Figure imgb0032
      , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
      Figure imgb0033
      , p z , y 1 , x 1 0
      Figure imgb0034
      is a first product factor, p z , y 1 , x 1 1
      Figure imgb0035
      is a second product factor, p 1 , y 1 , x 1 2
      Figure imgb0036
      is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
      Figure imgb0037
      is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
      Figure imgb0038
      , p z , y 1 , x 1 0
      Figure imgb0039
      is a real number, 1 p z , y 1 , x 1 1 0
      Figure imgb0040
      , p z , y 1 , x 1 1
      Figure imgb0041
      is a real number, and p z , y 1 , x 1 2
      Figure imgb0042
      is a complex number whose modulus is 1.
  • For a precoding matrix set (denoted as a first precoding matrix set) including the precoding matrix W that satisfies the foregoing condition, according to the method for determining a precoding matrix set in this application, a terminal device may determine, from the first precoding matrix set based on indication information sent by a network device, a second precoding matrix set that can be used.
  • In this application, p z , y 1 , x 1 0
    Figure imgb0043
    may represent a wideband amplitude, p 1 , y 1 , x 1 2
    Figure imgb0044
    may represent a subband amplitude, and p z , y 1 , x 1 2
    Figure imgb0045
    may represent a phase. The phase is represented by a complex number whose modulus is 1. When the element W 2(x,y) in row x and column y of W 2 is represented only by a product of p 0 , y 1 , x 1 0
    Figure imgb0046
    and p 0 , y 1 , x 1 2
    Figure imgb0047
    , it may be considered that p 0 , y 1 , x 1 1 = 1
    Figure imgb0048
    . Likewise, for W 2(x+M,y), when W 2(x+M,y) is represented only by a product of p 1 , y 1 , x 1 0
    Figure imgb0049
    and the phase p 1 , y 1 , x 1 2
    Figure imgb0050
    , p 1 , y 1 , x 1 1 = 1
    Figure imgb0051
    .
  • FIG. 2 is a schematic flowchart of a method for determining a precoding matrix set according to an embodiment of this application. The method may be applied to the precoding matrix W described above. The following describes, with reference to FIG. 2, in detail the method for determining a precoding matrix set in this embodiment of this application.
  • S210. A network device sends indication information to a terminal.
  • The indication information includes indication information of S sets D0 to DS-1. D0 to DS-1 are respectively in one-to-one correspondence with Co to CS-1, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer.
  • S220. The terminal device determines, based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • The second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0052
    of at least one of elements in row x and row x+M of W 2 belongs to D j .
  • Specifically, the terminal device can determine, based on the indication information sent by the network device, D0 to DS-1 that are in one-to-one correspondence with c 0 to c S -1 in the vector set C. The terminal device determines, based on the vector set C and the sets D0 to DS-1, that if the xth column vector included in X of W = W 1 × W 2 in the first precoding matrix set is the vector c j and the first product factor p z , y 1 , x 1 0
    Figure imgb0053
    of at least one of elements in row x and row x+M of W 2 belongs to D j , then W = W 1 × W 2 is a prohibited precoding vector. In other words, the precoding vector cannot be used. After the prohibited precoding vector is removed from the first precoding matrix set, remaining precoding vectors form the second precoding matrix set. Alternatively, the terminal device determines, based on the vector set C and the sets D0 to DS-1, that if X in W = W 1 × W 2 does not belong to the vector set C, or the xth column vector included in X of W = W 1 × W 2 is the vector c j but the first product factor p z , y 1 , x 1 0
    Figure imgb0054
    of both the elements in row x and row x+M of W 2 do not belong to D j , then W = W 1 × W 2 belongs to the second precoding matrix set.
  • According to the method for determining a precoding matrix set in this application, a case in which a relatively large quantity of precoding matrices in a precoding matrix set cannot be used can be avoided by restricting product factors in W 2 that correspond to vectors instead of directly prohibiting use of the vector, thereby improving system performance.
  • The following describes this embodiment of this application by using A 0 = 1 0.5 0.25 0.125 0.0625 0.0313 0.0156 0
    Figure imgb0055
    as an example.
  • For example, R = 1 and T = 32. Because T = 32, B = {b 0, b 1 ···, b 31}. The vector set C is C = {b 0, b 1}, and a set corresponding to b 0 is D 0 = 1 0.5
    Figure imgb0056
    , a set corresponding to b 1 is D 1 = 1 0.5 0.25 ,
    Figure imgb0057
    , and elements of D0 do not include 0.125
    Figure imgb0058
    and 0.25
    Figure imgb0059
    . Assuming that, in a first codebook set, a precoding matrix (denoted as W 1) satisfies W 1 = W 1 1 × W 2 1
    Figure imgb0060
    , another precoding matrix (denoted as W 2 ) satisfies W 2 = W 1 2 × W 2 2
    Figure imgb0061
    , and: W 1 1 = b 0 b 1 0 0 b 0 b 1 , W 2 1 = p 0 , 0,0 0 p 0 , 0,0 1 p 0 , 0,0 2 p 0 , 0,1 0 p 0 , 0,1 1 p 0 , 0,1 2 p 1 , 0,0 0 p 1 , 0,0 1 p 1 , 0,0 2 p 1 , 0,1 0 p 1 , 0,1 1 p 1 , 0,1 2 = 0.5 p 0 , 0,0 1 p 0 , 0,0 2 0.25 p 0 , 0,1 1 p 0 , 0,1 2 0.5 p 1 , 0,0 1 p 1 , 0,0 2 0.125 p 1 , 0,1 1 p 1 , 0,1 2
    Figure imgb0062
    W 1 1 = b 0 b 1 0 0 b 0 b 1 , W 2 1 = p 0 , 0,0 0 p 0 , 0,0 1 p 0 , 0,0 2 p 0 , 0,1 0 p 0 , 0,1 1 p 0 , 0,1 2 p 1 , 0,0 0 p 1 , 0,0 1 p 1 , 0,0 2 p 1 , 0,1 0 p 1 , 0,1 1 p 1 , 0,1 2 = 0.125 p 0 , 0,0 1 p 0 , 0,0 2 0.0625 p 0 , 0,1 1 p 0 , 0,1 2 0.125 p 1 , 0,0 1 p 1 , 0,0 2 0.125 p 1 , 0,1 1 p 1 , 0,1 2
    Figure imgb0063
  • Therefore, W 1 may be expressed as follows: W 1 = W 1 1 × W 2 1 = b 0 × p 0 , 0,0 0 p 0 , 0,0 1 p 0 , 0,0 2 b 0 × p 1 , 0,0 0 p 1 , 0,0 1 p 1 , 0,0 2 + b 1 × p 0 , 0,1 0 p 0 , 0,1 1 p 0 , 0,1 2 b 1 × p 1 , 0,1 0 p 1 , 0,1 1 p 1 , 0,1 2
    Figure imgb0064
    W 2 has a same expression form. Correspondences exist between a vector b 0 and first product factors p 0 , 0,0 0
    Figure imgb0065
    and p 1 , 0,0 0
    Figure imgb0066
    , between b 0 and second product factors p 0 , 0,0 1
    Figure imgb0067
    and p 1 , 0,0 1
    Figure imgb0068
    , and between b 0 and third product factors p 0 , 0,0 2
    Figure imgb0069
    and p 1 , 0,0 2
    Figure imgb0070
    . Correspondences exist between a vector b 1 and the first product factors p 0 , 0,1 0
    Figure imgb0071
    and p 1 , 0,1 0
    Figure imgb0072
    , between b 1 and the second product factors p 0 , 0,1 1
    Figure imgb0073
    and p 1 , 0,1 1
    Figure imgb0074
    , and between b 1 and the third product factors p 0 , 0,1 2
    Figure imgb0075
    and p 1 , 0,1 2
    Figure imgb0076
    .
  • For W 1, a vector b 0 in column 1 of W 1 1
    Figure imgb0077
    belongs to the vector set C, and a product factor 0.5
    Figure imgb0078
    of elements in row 1 of W 2 1
    Figure imgb0079
    belongs to D0. Therefore, it may be determined that the second precoding matrix set does not include W 1. In other words, W 1 does not belong to the second precoding matrix set.
  • For W 2, although a vector b 0 in column 1 and column 3 of W 1 2
    Figure imgb0080
    belongs to the vector set C, a product factor 0.125
    Figure imgb0081
    of elements in row 1 and row 3 of W 2 2
    Figure imgb0082
    does not belong to D0. A vector b 1 in column 2 and column 4 of W1 2 belongs to the vector set C, but neither a product factor 0.0625
    Figure imgb0083
    nor a product factor 0.125
    Figure imgb0084
    of elements in row 2 and row 4 of W 2 2
    Figure imgb0085
    belongs to D1. Therefore, it may be determined that W 2 belongs to the second precoding matrix set.
  • It should be understood that the foregoing W 1 and W 2 are a specific example of a matrix that satisfies W = W 1 × W 2 in the first precoding matrix set, W1 1 and W1 2 are two specific examples of W 1, and W 2 1
    Figure imgb0086
    and W 2 2
    Figure imgb0087
    are two specific examples of W 2.
  • The following describes in detail the indication information sent by the network device.
  • The following describes in detail several possible formats of the indication information (denoted as indication information #1) of the S sets D0 to DS-1. It should be understood that a manner of determining the vector set C by the terminal device is not limited in this embodiment of this application.
  • Format 1
  • Indication information #1 includes S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field includes at least one bit, and a bit field corresponding to D j indicates an element (denoted as gj) of A0. Any element of D j is greater than gj.
  • For example, the terminal device may determine, based on the indication information, that the vector set C satisfies: C = {c 0, c 1, ···, c S-1} = {b 0, b 1 ···, b 6} and S = 7. The indication information sent by the network device includes seven bit fields (denoted as a bit field #1 to a bit field #7). The bit field #1 to the bit field #7 are in one-to-one correspondence with seven vectors in the vector set C. To be specific, the bit field #1 corresponds to b 0, the bit field #2 corresponds to b 1, ..., and the bit field #7 corresponds to b 6. Each bit field includes three bits, and each bit field indicates an element of A0. The terminal device can determine D0 to D6 based on the bit field #1 to the bit field #7. Description is given with reference to Table 1. Table 1
    b 0 b 1 b 2 b 3 b 4 b 5 b 6
    Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 Bit field #7
    [001] [010] [011] [100] [101] [110] [111]
    √0.0156 √0.0313 √0.0625 √0.125 √0.25 √0.5 1
  • Referring to Table 1, the bit field #1 is 001, indicating an element √0.0156 of A0. All elements greater than √0.0156 in A0 form D0, that is: D 0 = 1 , 0,5 , 0,25 , 0.125 , 0.0625 , 0.0313
    Figure imgb0088
  • Likewise, D0 to D6 may be determined respectively based on the bit field #2 to the bit field #5.
  • In the prior art, usually a bitmap manner is used for indication. In the present invention, the bitmap manner may be used to indicate each available amplitude of each restricted vector. For example, if A0 has eight amplitudes to be selected, each vector needs eight bits to indicate a restricted amplitude of the vector. However, in the present invention, once an amplitude is restricted for use, usually all amplitudes greater than or equal to the amplitude are restricted for use. Therefore, a manner of indicating one of amplitudes of A0 may be used for restriction. In this way, each vector needs only three bits to determine a restricted amplitude value of the vector.
  • Format 2
  • A0 includes F elements. Indication information #1 includes S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field includes F bits, and the F bits are used respectively to indicate the F elements of A0. In the F bits of a bit field corresponding to D j , an element of A0 indicated by a bit that is 0 or 1 belongs to D j .
  • For example, the terminal device may determine, based on the indication information, that the vector set C satisfies: C = {c 0, c 1, ···, c S-1} = {b 0, b 1, ···, b 6}, S = 7, and F = 8. The indication information #1 includes seven bit fields (denoted as a bit field #1 to a bit field #7). The bit field #1 to the bit field #7 are in one-to-one correspondence with seven vectors in the vector set C. To be specific, the bit field #1 corresponds to b 0, the bit field #2 corresponds to b 1, ..., and the bit field #7 corresponds to b 6. Each bit field includes eight bits. In an order from a most significant bit to a least significant bit, bits of a bit field respectively indicate a first element to an eighth element of A0. A value indicated by a bit that is 0 or 1 belongs to D j . For example, if a bit that is 0 indicates that a value indicated by the bit belongs to D j , D0 to D6 may be determined based on the bit field #1 to the bit field #7. Description is given with reference to Table 2. Table 2
    b 0 b 1 b 2 b 3 b 4 b 5 b 6
    Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 Bit field #7
    11000000 11100000 11100000 11010000 00001100 00000110 11011000
  • Referring to Table 2, the bit field #1 is 11000000. It may be determined that a set D 0 corresponding to the bit field #1 is D 0 = {1, √0.5, √0.25, √0.125, √0.0625, √0.03131}. If the bit field #2 is 11100000, it may be determined that a set D 1 corresponding to the bit field #2 is D 1 = {1, √0.5, √0.25, √0.125, √0.0625}. Likewise, D2 to D6 may be determined respectively based on the bit field #3 to the bit field #7.
  • For the foregoing Format 1 and Format 2, further, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields correspond to T vectors in a vector set B, and S ≤ T. A tth bit field in the T bit fields is used to indicate whether a vector b t belongs to the vector set C, where 0 ≤ t ≤ T - 1. S bit fields in the T bit fields determine both S vectors in the vector set C and D0 to DS-1.
  • For example, in the foregoing Format 1, a tth bit field in the S bit fields is 111. A value determined by the bit field is 1, indicating that all elements of A0 can be used. Therefore, it may be determined that a vector b t-1 does not belong to C.
  • Optionally, the indication information #1 may further include indication information (denoted as indication information #2) of the vector set C. The indication information #2 includes T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t ≤ T.
  • For example, T = 8, the indication information #2 includes eight bits, the eight bits, in an order a most significant bit to a least significant bit, respectively correspond to b 0, b 1 ···, b 7, and a bit that is 0 indicates that the vector b t belongs to the vector set C. If the indication information #2 is 00111111, it may be determined that b 0 and b 1 belong to the vector set C.
  • It should be understood that the indication information #2 herein is different from the indication information #1.
  • Optionally, the indication information may be used to indicate b fh and kh, the terminal may determine the vector set C and the sets D0 to DS-1 based on b fh and kh, and further the terminal may determine the second precoding matrix set. For example, the terminal may determine C and the sets D0 to DS-1 based on b fh and kh in the following two manners.
  • Manner 1
  • Any vector c j of C and any element D j (v) of D j satisfy the following condition: D j ν × b fh H × c j > k h
    Figure imgb0089
    where b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • Specifically, the terminal device can obtain b fh and kh based on the indication information sent by the network device; determine, based on b fh and kh, the vector set C and the sets D0 to DS-1 that satisfy the foregoing relational expression; and then determine the second precoding matrix set.
  • Manner 2
  • C includes at least M mutually orthogonal vectors, and any mutually M orthogonal vectors c j0, c j1, ···, c jM-1 and elements D j0(v 0), D j1(v 1), ···, D jM-1 (v M-1) satisfy the following condition: D j 0 ν 0 × b fh H × c j 0 2 + D j 1 ν 1 × b fh H × c j 1 2 + , + D j M 1 ν M 1 × b fh H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
    Figure imgb0090
    where D j0(v 0), D j1(v 1), ···, D jM-1(v M-1) are elements of sets D j0, D j1 ···, D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • Specifically, the terminal device can obtain b fh and kh based on the indication information sent by the network device; determine, based on b fh and kh, the vector set C and the sets D0 to DS-1 that satisfy the foregoing relational expression; and then determine the second precoding matrix set.
  • In this manner, at least M orthogonal vectors are simultaneously restricted. Because X in W1 includes M vectors, this manner actually restricts the M vectors included in W1. Because a codebook is formed by a linear combination of the vectors in W1, this manner can achieve more accurate restriction of the codebook.
  • For example, T = 8, the vector set B includes eight vectors b 0, b 1, ···, b 7, and M = 2, where the vector b 0 is orthogonal to the vector b 4, the vector b 1 is orthogonal to b 5, the vector b 2 is orthogonal to b 6, and the vector b 3 is orthogonal to the vector b 7. The network device notifies the terminal device of b f1, = b 0, k1 = 0.5, and H = 1 by using the indication information; and the terminal device sequentially substitutes (b0, b4), (b1, b5), (b2, b6), and (b3, b7) into the formula in Manner 2. The following uses (b0, b4) as an example:
  • A first product factor corresponding to b0 is ao, a first product factor corresponding to b1 is ai, ao belongs to A0, and a1 belongs to A0. If a 0 × b 0 H × b 0 2 + a 1 × b 0 H × b 1 2 a 0 2 + a 1 2 > 0.5 ,
    Figure imgb0091
    the vectors b0 and b1 belong to C, ao belongs to D0, and a1 belongs to D1. All first product factors in A0 are traversed. All ao satisfying the foregoing formula belong to the set D0, and all a1 satisfying the foregoing formula belong to the set D1.
  • (b1, b5), (b2, b6), and (b3, b7) are traversed, and all first factors in A0 that correspond to each pair of orthogonal vectors are traversed. Vectors satisfying the foregoing formula belong to the set C, and a first product factor corresponding to each vector and satisfying the condition belongs to a set Dj corresponding to the vector.
  • The following specifically describes how the terminal device determines b fh and kh.
  • Optionally, the indication information sent by the network device may include indication information (denoted as indication information #3) of kh.
  • In a possible implementation, the indication information #3 may include H bit fields, and an hth bit field in the H bit fields is used to indicate kh.
  • For example, kh ∈ {1,0.5,0.25,0}. Each bit field includes two bits used to indicate a value of {1,0.5,0.25,0}. Assuming that H = 6, six bit fields included in the indication information are denoted as a bit field #1 to a bit field #6. Description is given with reference to Table 3. Table 3
    Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6
    00 01 10 11 10 11
    0 0.25 0.5 1 0.5 1
  • The bit field #1 to the bit field #6 respectively indicate k1 = 0, k2 = 0.25, k3 = 0.5 , k4 =1, k5 = 0.5, and k6 = 1. In the vector set B, an f1-1th vector, an f2-1th vector, an f3-1th vector, an f4-1th vector, an f5-1th vector, and an f6-1th vector are b f1, b f2, b f3, b f4, b f5, b f6 respectively, which correspond to the bit field #1, the bit field #2, the bit field #3, the bit field #4, the bit field $5, and the bit field #6. For example, for the bit field #2 corresponding to b f2, a threshold of the bit field #2 is k2 = 0.25 .
  • In this manner, the vector set C and Dj can be determined by using indication information including a relatively small quantity of bits. In an extreme case, at least two vectors and Dj that corresponds to each of the at least two vectors can be determined by using only one bit field (H = 1).
  • Optionally, the indication information sent by the network device may include indication information (denoted as indication information #4) of b fh , and the terminal device may determine b fh based on the indication information #4.
  • In a possible implementation, the indication information #4 includes H bits, and an hth bit is used to indicate b fh .
  • For example, H = 4, the indication information sent by the network device includes T bits, and the T bits are in one-to-one correspondence with T vectors in T vector sets B. For example, T = 8, a bitmap is 00001111, the indication information #4 includes four least significant bits of the bitmap, and an hth bit in the four least significant bits indicates b h .
  • Optionally, in this embodiment of this application, the indication information may alternatively be indication information #5. The indication information #5 may indicate both the vector set C and D0 to DS-1.
  • Specifically, the indication information #5 is T bit fields. The T bit fields are in one-to-one correspondence with T vectors included in B, each of the T bit fields includes E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t ≤ T.
  • In this manner, a bitmap of the T bits is used to determine a restricted vector, and the indication information of the S sets D0 to DS-1 includes only S or H bit fields. In this way, when S is relatively small, a quantity of bits required for indicating the S sets D0 to DS-1 can be reduced.
  • In a possible implementation, each bit field indicates an element of A0, and if a set including elements greater than or equal to an element indicated by a specific bit group is a proper subset of A0, a vector indicated by the bit group belongs to the vector set C.
  • For example, E = 3, T = 8, and S = 7. The indication information sent by the network device includes eight bit fields (denoted as a bit field #1 to a bit field #8). The bit field #1 to the bit field #8 are in one-to-one correspondence with T vectors in the vector set B. To be specific, the bit field #1 corresponds to b 0, the bit field #2 corresponds to b 1, ..., and the bit field #8 corresponds to b 7. Each bit field includes three bits, and each bit field indicates an element of A0. Description is given with reference to Table 4. Table 4
    b 0 b 1 b 2 b 3 b 4 b 5 b 6 b 7
    Bit field #1 Bit field #2 Bit field #3 Bit field #4 Bit field #5 Bit field #6 Bit field #7 Bit field #8
    [000] [001] [010] [011] [100] [101] [110] [111]
    0 √0.0156 √0.0313 √0.0625 √0.125 √0.25 √0.5 1
  • Referring to Table 1, each of the bit field #2 to the bit field #8 is used to indicate a non-zero element of A0. The bit field #2 to the bit field #8 are in one-to-one correspondence with vectors in the set C, and the bit field #2 to the bit field #8 may be used to indicate D0 to D6.
  • For example, the bit field #2 is 001, indicating an element √0.0156 of A0. All elements greater than √0.0156 in A0 form D 0, that is: D 0 = 1 0.5 0.25 0.125 0.0625 0.0313
    Figure imgb0092
  • Likewise, D1 to D6 may be determined respectively based on the bit field #3 to the bit field #8.
  • The bit field #1 is 000, indicating an element 0 of A0. All elements greater than 0 in A0 form b 0, which corresponds to a set {1, √0.5, √0.25, √0.125, √0.0625, √0.0313, √0.0156}. The set is A0; therefore, b 0 does not belong to the vector set C.
  • In another possible implementation, the E bits are respectively used to indicate E elements of A0. If bits of a specific bit field are all zeros or all ones, it indicates that a vector corresponding to the bit field does not belong to the vector set C, and a vector corresponding to a bit field whose bits are not all zeros or ones belongs to the vector set C.
  • For example, E = 8, T = 8, and S = 7. The indication information sent by the network device includes eight bit fields (denoted as a bit field #1 to a bit field #8). The bit field #1 to the bit field #8 are in one-to-one correspondence with T vectors in the vector set B. To be specific, the bit field #1 corresponds to b0 , the bit field #2 corresponds to b 1... and the bit field #8 corresponds to b 7.
  • Each bit field includes eight bits. In an order from a most significant bit to a least significant bit, bits of a bit field respectively indicate a first element to an eighth element of A0. A bit that is 0 or 1 indicates that a corresponding element belongs to D j . For example, a bit that is 0 indicates that a corresponding element belongs to D j. If the bit field #1 is 11000000, it may be determined that a set D 0 corresponding to the bit field #1 is D 0 = 1 0.5 0.25 0.125 0.0625 0.0313
    Figure imgb0093
    . If the bit field #2 is 11100000, it may be determined that a set D 1 corresponding to the bit field #2 is D 1 = 1 0.5 0.25 0.125 0.0625
    Figure imgb0094
    . If the bit field #8 is 11111111, it indicates that all elements in A0 can be used and then b 7 corresponding to the bit field #8 does not belong to the vector set C. Bit fields separately corresponding to the bit field #3 to the bit field #7 are not all ones, and D1 to D6 may be determined respectively based on the bit field #3 to the bit field #7.
  • Optionally, a value range of p z , y 1 , x 1 1
    Figure imgb0095
    is a set A1, the indication information is further used to indicate S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1, and Ej is a proper subset of A1.
  • The second precoding matrix set still does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    the xth column vector included in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
    Figure imgb0096
    of at least one of elements in row x and row x+M of W2 that corresponds to c j belongs to E j .
  • Specifically, the S sets E0 to ES-1 may be indicated with reference to the foregoing described method. The terminal device may determine the second precoding matrix set based on the set C, the sets D0 to DS-1, and the sets E0 to ES-1. For brevity, details about how the indication information indicates the sets E0 to ES-1 are not described herein again.
  • According to the method in this embodiment of this application, more refined codebook restriction can be achieved by restricting both a wideband amplitude and a subband amplitude.
  • It should be understood that, in this embodiment of this application, p z , y 1 , x 1 1
    Figure imgb0097
    may be 1, and the element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 2
    Figure imgb0098
    , and the element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 2
    Figure imgb0099
    .
  • Optionally, in this embodiment of this application, the network device may send the plurality of pieces of indication information by using higher layer signaling. In other words, the higher layer signaling may carry the plurality of pieces of indication information.
  • For example, the higher layer signaling may be radio resource control (Radio Resource Control, RRC) signaling or a Media Access Control-control element (Media Access Control-Control Element, MAC CE).
  • Optionally, the method may further include:
  • S230. The network device sends a CSI-RS to the terminal device.
  • S240. The terminal device determines a channel matrix based on the CSI-RS, and determines, based on the channel matrix, a first PMI used to indicate W 1 and a second PMI used to indicate W 2.
  • The network device may determine, based on the first PMI and the second PMI, a precoding matrix to be used when the network device sends data to the terminal device.
  • FIG. 3 is a schematic block diagram of a communications apparatus according to an embodiment of this application. The communications apparatus 300 shown in FIG. 3 includes a receiving unit 310 and a processing unit 320.
  • The receiving unit 310 is configured to receive indication information.
  • The processing unit 320 is configured to determine, based on the indication information received by the receiving unit, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • Each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0100
    , X = [b k 0 ··· b kM-1], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0101
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0102
    , p z , y 1 , x 1 0
    Figure imgb0103
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0104
    is a second product factor, p 1 , y 1 , x 1 2
    Figure imgb0105
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0106
    is a set A0, z belongs to {0,1}, 1 1 p z , y 1 , x 1 0 0
    Figure imgb0107
    , p z , y 1 , x 1 0
    Figure imgb0108
    is a real number, 1 p z , y 1 , x 1 1 0
    Figure imgb0109
    , p z , y 1 , x 1 1
    Figure imgb0110
    is a real number, and p z , y 1 , x 1 2
    Figure imgb0111
    is a complex number whose modulus is 1.
  • The indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer.
  • The second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0112
    of at least one of elements in row x and row x+M of W2 belongs to D j .
  • FIG 4 is a schematic block diagram of a communications apparatus according to an embodiment of this application. The communications apparatus 400 shown in FIG 4 includes a processing unit 410 and a sending unit 420.
  • The processing unit 410 is configured to generate indication information, where the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R.
  • The sending unit 420 is configured to send the indication information generated by the generation unit.
  • Each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0113
    , X = [b k 0 ··· b kM-1], b ki is an Nt/2×1 vector, b ki , belongs to a vector set B = {b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0114
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0115
    , p z , y 1 , x 1 0
    Figure imgb0116
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0117
    is a second product factor, p 1 , y 1 , x 1 2
    Figure imgb0118
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0119
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0120
    , p z , y 1 , x 1 0
    Figure imgb0121
    is a real number, 1 p z , y 1 , x 1 1 0
    Figure imgb0122
    , p z , y 1 , x 1 1
    Figure imgb0123
    is a real number, and p z , y 1 , x 1 2
    Figure imgb0124
    is a complex number whose modulus is 1.
  • The indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0 , c 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer.
  • The second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W=W 1×W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0125
    of at least one of elements in row x and row x+M of W2 belongs to D j .
  • Optionally, in an embodiment, the indication information of the S sets D0 to DS-1 includes S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field includes at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than gj.
  • Optionally, in an embodiment, any vector c j of C and any element D j (v) of D j satisfy the following condition: D j ν × b ƒh H × c j > k h
    Figure imgb0126
    where b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • Optionally, in an embodiment, C includes at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j0, c j 1 , ..., cjM-1 , and elements D j 0 (v 0), D j 1 (v 1), ..., D jM-1 (v M-1) satisfy the following condition: D j 0 ν 0 × b ƒ h H × c j 0 2 + D j 1 ν 1 × b ƒ h H × c j 1 2 + , + D j M 1 ν M 1 × b ƒ h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
    Figure imgb0127
    where D j 0 (v 0), D j 1 (v 1) , ..., D jM-1 (v M-1) are elements of sets D j 0 , D j 1 , ···, D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  • Optionally, in an embodiment, the indication information of the S sets D0 to DS-1 includes H bit fields, and an hth bit field is used to indicate kh.
  • Optionally, in an embodiment, the indication information further includes indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors included in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t≤ T.
  • Optionally, in an embodiment, the indication information of the S sets D0 to DS-1 is further used to indicate the vector set C, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields are in one-to-one correspondence with T vectors included in B, each of the T bit fields includes E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, where 1 ≤ t ≤ T.
  • Optionally, in an embodiment, a value range of p z , y 1 , x 1 1
    Figure imgb0128
    is a set A1;
    • the indication information further includes indication information of S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1 in the vector set C = {c 0, c 1, ..., c S-1}, and E j is a proper subset of A1; and
    • the second precoding matrix set still does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
      the xth column vector included in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
      Figure imgb0129
      of at least one of elements in row x and row x+M of W2 that corresponds to c j belongs to E j .
  • In an optional embodiment, the receiving unit 310 may be a transceiver 540, the determining unit 320 may be a processor 520, and the communications apparatus may further include an input/output interface 530 and a memory 510, specifically as shown in FIG 5.
  • FIG 5 is a schematic block diagram of a terminal device according to another embodiment of this application. The terminal device can perform all the methods in the foregoing embodiments; therefore, for specific details, refer to descriptions in the foregoing embodiments. Details are not described herein again to avoid repetition. The terminal device 500 shown in FIG 5 may include: a memory 510, a processor 520, an input/output interface 530, and a transceiver 540. The memory 510, the processor 520, the input/output interface 530, and the transceiver 540 are connected to each other by using an internal connection path. The memory 510 is configured to store an instruction. The processor 520 is configured to execute the instruction stored in the memory 510, to control the input/output interface 530 to receive data and information that are input, and output data such as an operation result, and to control the transceiver 540 to send a signal.
  • The transceiver 540 is configured to receive indication information.
  • The processor 520 is configured to determine, based on the indication information received by the receiving unit, a second precoding matrix set from a first precoding matrix set whose rank is R.
  • Each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0130
    , x=[b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1, ···, b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0131
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0132
    , p z , y 1 , x 1 0
    Figure imgb0133
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0134
    is a second product factor, p 1 , y 1 , x 1 2
    Figure imgb0135
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0136
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0137
    , p z , y 1 , x 1 0
    Figure imgb0138
    is a real number, 1 p z , y 1 , x 1 1 0 , p z , y 1 , x 1 1
    Figure imgb0139
    is a real number, and p z , y 1 , x 1 2
    Figure imgb0140
    is a complex number whose modulus is 1.
  • The indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, c 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A 0, S - 1 ≥ j ≥ 0, and j is an integer.
  • The second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0141
    of at least one of elements in row x and row x+M of W2 belongs to D j
  • It should be understood that, in this embodiment of this application, the processor 520 may use a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), or one or more integrated circuits to execute a related program to implement the technical solutions provided in this embodiment of this application.
  • It should be further understood that the transceiver 540 is also referred to as a communications interface, and uses a transceiver apparatus, for example but not limited to a transceiver, to implement communication between the terminal 500 and another device or a communications network.
  • The memory 510 may include a read-only memory and a random access memory, and provides the processor 520 with data and an instruction. A part of the processor 520 may further include a non-volatile random access memory. For example, the processor 520 may further store device type information.
  • During implementation, the steps in the foregoing methods may be completed by an integrated logic circuit of hardware in the processor 520 or by an instruction in a software form. The methods for determining a precoding matrix set disclosed in the embodiments of this application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware of a processor and a software module. 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 or an electrically erasable programmable memory, or a register. The storage medium is located in the memory 510. The processor 520 reads information in the memory 510, to complete the steps of the methods in combination with hardware of the processor 520. Details are not described herein again to avoid repetition.
  • It should be understood that, in this embodiment of this application, the processor may be a central processing unit (central processing unit, CPU), or the processor may be another general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (application-specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or another programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like. The general purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.
  • In an optional embodiment, the sending unit 420 may be a transceiver 640, the processing unit 410 may be a processor 620, and the communications apparatus may further include an input/output interface 630 and a memory 610, specifically as shown in FIG 6.
  • FIG 6 is a schematic block diagram of a network device according to another embodiment of this application. The network device can perform all the methods in the foregoing embodiments; therefore, for specific details, refer to descriptions in the foregoing embodiments. Details are not described herein again to avoid repetition. The network device 600 shown in FIG 6 may include: a memory 610, a processor 620, an input/output interface 630, and a transceiver 640. The memory 610, the processor 620, the input/output interface 630, and the transceiver 640 are connected to each other by using an internal connection path. The memory 610 is configured to store an instruction. The processor 620 is configured to execute the instruction stored in the memory 610, to control the input/output interface 630 to receive data and information that are input, and output data such as an operation result, and to control the transceiver 640 to send a signal.
  • The processor 620 is configured to generate indication information, where the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R.
  • The transceiver 640 is configured to send the indication information generated by the processor.
  • Each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies W 1 = X 0 0 X
    Figure imgb0142
    , X = [b k 0 ··· b k M-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2 ,
    Figure imgb0143
    an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0144
    , p z , y 1 , x 1 0
    Figure imgb0145
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0146
    is a second product factor, p 1 , y 1 , x 1 2
    Figure imgb0147
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0148
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0149
    , p z , y 1 , x 1 0
    Figure imgb0150
    is a real number, 1 p z , y 1 , x 1 1 0
    Figure imgb0151
    , p z , y 1 , x 1 1
    Figure imgb0152
    is a real number, and p z , y 1 , x 1 2
    Figure imgb0153
    is a complex number whose modulus is 1.
  • The indication information includes indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, c 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer.
  • The second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not include W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector included in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0154
    of at least one of elements in row x and row x+M of W2 belongs to D j .
  • It should be understood that, in this embodiment of this application, the processor 620 may use a general-purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), or one or more integrated circuits to execute a related program to implement the technical solutions provided in this embodiment of this application.
  • It should be further understood that the transceiver 640 is also referred to as a communications interface, and uses a transceiver apparatus, for example but not limited to a transceiver, to implement communication between the terminal 600 and another device or a communications network.
  • The memory 610 may include a read-only memory and a random access memory, and provides the processor 620 with data and an instruction. A part of the processor 620 may further include a non-volatile random access memory. For example, the processor 620 may further store device type information.
  • During implementation, the steps in the foregoing methods may be completed by an integrated logic circuit of hardware in the processor 620 or by an instruction in a software form. The methods for determining a precoding matrix set disclosed in the embodiments of this application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware of a processor and a software module. 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 or an electrically erasable programmable memory, or a register. The storage medium is located in the memory 610. The processor 620 reads information in the memory 610, to complete the steps of the methods in combination with hardware of the processor 620. Details are not described herein again to avoid repetition.
  • It should be understood that, in this embodiment of this application, the processor may be a central processing unit (central processing unit, CPU), or the processor may be another general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (application-specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or another programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like. The general purpose processor may be a microprocessor, or the processor may be any conventional processor or the like.
  • The present application also provides following embodiments. It should be noted that it is not necessary that reference numbers of the following embodiments comply with the order of numbers of the above embodiments.
    • Embodiment 1. A method for determining a precoding matrix set, comprising:
      • receiving, by a terminal device, indication information; and
      • determining, by the terminal device based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies
        W 1 = X 0 0 X
        Figure imgb0155
        , X = b k 0 b k M 1
        Figure imgb0156
        , b ki is an Nt/2×1 vector, bki belongs to a vector set B={b 0, b 1, ···, b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2 ,
        Figure imgb0157
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0158
        , p z , y 1 , x 1 0
        Figure imgb0159
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0160
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0161
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0162
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0163
        , p z , y 1 , x 1 0
        Figure imgb0164
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0165
        , p z , y 1 , x 1 1
        Figure imgb0166
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0167
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W1 × W 2 that satisfies the following condition in the first precoding matrix set:
        an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0168
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 2. A method for determining a precoding matrix set, comprising:
      • generating, by a network device, indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
      • sending, by the network device, the indication information, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies
        W 1 = X 0 0 X
        Figure imgb0169
        , X = b k 0 b k M 1
        Figure imgb0170
        , b ki is an Nt/2×1 vector, b ki belongs to a vector set B ={b 0, b 1, ···, b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
        Figure imgb0171
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0172
        , p z , y 1 , x 1 0
        Figure imgb0173
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0174
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0175
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0176
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0177
        , p z , y 1 , x 1 0
        Figure imgb0178
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0179
        , p z , y 1 , x 1 1
        Figure imgb0180
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0181
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, C 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W1 × W 2 that satisfies the following condition in the first precoding matrix set:
        an xth column vector comprised in X of W1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0182
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 3. The method according to embodiment1 or 2, wherein the indication information of the S sets D0 to DS-1 comprises S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field comprises at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than
    • gj. Embodiment 4. The method according to embodiment1 1 or 2, wherein any vector c j of C and any element D j (v) of D j satisfy the following condition: D j ν × b ƒ h H × c j > k h
      Figure imgb0183
      wherein b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 5. The method according to embodiment 1 or 2, wherein C comprises at least M mutually orthogonal vectors, and any mutually M orthogonal vectors c j 0 , c j 1 , ···, c jM-1 and elements D j 0 (v 0), D j1 (v 1), ···, D jM-1(v M-1) satisfy the following condition: D j 0 ν 0 × b ƒ h H × c j 0 2 + D j 1 ν 1 × b ƒ h H × c j 1 2 + , + D j M 1 ν M 1 × b ƒ h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
      Figure imgb0184
      wherein D j 0(v 0), D j1,(v 1), ···, D jM-1(v M-1) are elements of sets D j 0 , D j1, ···, D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 6. The method according to embodiment 5, wherein the indication information of the S sets D0 to DS-1 comprises H bit fields, and an hth bit field is used to indicate kh.
    • Embodiment 7. The method according to any one of embodiments 1 to 3, wherein the indication information further comprises indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors comprised in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 8. The method according to any one of embodiments 1 to 3, wherein the indication information of the S sets D0 to DS-1 is further used to indicate the vector set C, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields are in one-to-one correspondence with T vectors comprised in B, each of the T bit fields comprises E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 9. The method according to any one of embodiments 1 to 8, wherein a value range of p z , y 1 , x 1 1
      Figure imgb0185
      is a set A1;
      • the indication information further comprises indication information of S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1 in the vector set C = {c 0, c 1, ..., c S-1}, and E j is a proper subset of A1; and
      • the second precoding matrix set still does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
        the xth column vector comprised in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
        Figure imgb0186
        of at least one element of the elements in row x and row x+M of W 2 that corresponds to c j belongs to E j .
    • Embodiment 10. A communications apparatus, comprising:
      • a receiving unit, configured to receive indication information; and
      • a processing unit, configured to determine, based on the indication information received by the receiving unit, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies W 1 = X 0 0 X
        Figure imgb0187
        , X = b k 0 b k M 1
        Figure imgb0188
        , b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1, ···, b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2 ,
        Figure imgb0189
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0190
        , p z , y 1 , x 1 0
        Figure imgb0191
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0192
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0193
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0194
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0195
        , p z , y 1 , x 1 0
        Figure imgb0196
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0197
        , p z , y 1 , x 1 1
        Figure imgb0198
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0199
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W1 × W 2 that satisfies the following condition in the first precoding matrix set:
        an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0200
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 11. A communications apparatus, comprising:
      • a processing unit, configured to generate indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
      • a sending unit, configured to send the indication information generated by the generation unit, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies W 1 = X 0 0 X
        Figure imgb0201
        , X = b k 0 b k M 1
        Figure imgb0202
        , b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2 ,
        Figure imgb0203
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0204
        , p z , y 1 , x 1 0
        Figure imgb0205
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0206
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0207
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0208
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0209
        , p z , y 1 , x 1 0
        Figure imgb0210
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0211
        , p z , y 1 , x 1 1
        Figure imgb0212
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0213
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0, c 1, ···, c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W1 × W 2 that satisfies the following condition in the first precoding matrix set:
        an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0214
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 12. The communications apparatus according to embodiment 10 or 11, wherein the indication information of the S sets D0 to DS-1 comprises S bit fields, the S bit fields in one-to-one correspondence with D0 to DS-1, each bit field comprises at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than gj.
    • Embodiment 13. The communications apparatus according to embodiment 10 or 11, wherein any vector c j of C and any element D j (v) of D j satisfy the following condition: D j ν × b ƒ h H × c j > k h
      Figure imgb0215
      wherein b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 14. The communications apparatus according to embodiment 10 or 11, wherein C comprises at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j 0 c j1, ..., c jM-1 and elements D j 0 (v 0), D j1(v 1), ···, D jM-1(v M-1) satisfy the following condition: D j 0 ν 0 × b ƒ h H × c j 0 2 + D j 1 ν 1 × b ƒ h H × c j 1 2 + , + D j M 1 ν M 1 × b ƒ h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
      Figure imgb0216
      wherein D j0(v 0), D j1, (v1 ) , ···, D jM-1 (v M-1) are elements of sets D j0, D j1, ..., D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 15. The communications apparatus according to embodiment 14, wherein the indication information of the S sets D0 to DS-1 comprises H bit fields, and an hth bit field is used to indicate kh.
    • Embodiment 16. The communications apparatus according to any one of embodiments 10 to 15, wherein the indication information further comprises indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors comprised in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 17. The communications apparatus according to any one of embodiments 10 to 15, wherein the indication information of the S sets D0 to DS-1 is further used to indicate the vector set C, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields are in one-to-one correspondence with T vectors comprised in B, each of the T bit fields comprises E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 18. The communications apparatus according to any one of embodiments 10 to 17, wherein a value range of p z , y 1 , x 1 1
      Figure imgb0217
      is a set A1;
      • the indication information further comprises indication information of S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1 in the vector set C={c 0 , c 1, ···, c S-1}, and E j is a proper subset of A1; and
      • the second precoding matrix set still does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
        the xth column vector comprised in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
        Figure imgb0218
        of at least one element of the elements in row x and row x+M of W 2 that corresponds to c j belongs to E j .
    • Embodiment 19. A communications apparatus, comprising:
      • a transceiver, configured to receive indication information; and
      • a processor, configured to determine, based on the indication information received by the transceiver, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies W 1 = X 0 0 X
        Figure imgb0219
        , X = b k 0 b k M 1
        Figure imgb0220
        , b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1, ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2 ,
        Figure imgb0221
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0222
        , p z , y 1 , x 1 0
        Figure imgb0223
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0224
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0225
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0226
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0227
        , p z , y 1 , x 1 0
        Figure imgb0228
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0229
        , p z , y 1 , x 1 1
        Figure imgb0230
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0231
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0 , c 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W1 × W 2 that satisfies the following condition in the first precoding matrix set:
        an xth column vector comprised in X of W1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0232
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 20. A communications apparatus, comprising:
      • a processor, configured to generate indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
      • a transceiver, configured to send the indication information generated by the processor, wherein
      • each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W1 satisfies W 1 = X 0 0 X
        Figure imgb0233
        , X = b k 0 b k M 1
        Figure imgb0234
        , b ki is an Nt/2×1 vector, b ki belongs to a vector set B={b 0, b 1 ···, b T-1}, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
        Figure imgb0235
        , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
        Figure imgb0236
        , p z , y 1 , x 1 0
        Figure imgb0237
        is a first product factor, p z , y 1 , x 1 1
        Figure imgb0238
        is a second product factor, p 1 , y 1 , x 1 2
        Figure imgb0239
        is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
        Figure imgb0240
        is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
        Figure imgb0241
        , p z , y 1 , x 1 0
        Figure imgb0242
        is a real number, 1 p z , y 1 , x 1 1 0
        Figure imgb0243
        , p z , y 1 , x 1 1
        Figure imgb0244
        is a real number, and p z , y 1 , x 1 2
        Figure imgb0245
        is a complex number whose modulus is 1;
      • the indication information comprises indication information of S sets D0 to DS-1, D0 to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C={c 0 , c 1, ..., c S-1}, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
      • the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1× W 2 that satisfies the following condition in the first precoding matrix set: an xth column vector comprised in X of W1 is the vector c j , and a first product factor p z , y 1 , x 1 0
        Figure imgb0246
        of at least one of elements in row x and row x+M of W2 belongs to D j .
    • Embodiment 21. The communications apparatus according to embodiment 19 or 20, wherein the indication information of the S sets D0 to DS-1 comprises S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field comprises at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than gj.
    • Embodiment 22. The communications apparatus according to embodiment 19 or 20, wherein any vector c j of C and any element D j (v) of D j satisfy the following condition: D j ν × b ƒ h H × c j > k h
      Figure imgb0247
      wherein b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 23. The communications apparatus according to embodiment 19 or 20, wherein C comprises at least M mutually orthogonal vectors, and any M mutually orthogonal vectors c j0, c j1, ..., c jM-1 and elements D j0(v 0), D j1(v 1), ···, D jM-1(v M-1) satisfy the following condition: D j 0 ν 0 × b ƒ h H × c j 0 2 + D j 1 ν 1 × b ƒ h H × c j 1 2 + , + D j M 1 ν M 1 × b ƒ h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D j M 1 ν M 1 2 > k h
      Figure imgb0248
      wherein D j 0 (v 0), D j1(v 1), ···, D jM-1(v M-1) are elements of sets D j 0 , D j1, ..., D jM-1 respectively, b fh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
    • Embodiment 24. The communications apparatus according to embodiment 23, wherein the indication information of the S sets D0 to DS-1 comprises H bit fields, and an hth bit field is used to indicate kh.
    • Embodiment 25. The communications apparatus according to any one of embodiments 19 to 24, wherein the indication information further comprises indication information of the vector set C, the indication information of the vector set C is T bits, the T bits are in one-to-one correspondence with T vectors comprised in B, and a tth bit in the T bits is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 26. The communications apparatus according to any one of embodiments 19 to 24, wherein the indication information of the S sets D0 to DS-1 is further used to indicate the vector set C, the indication information of the S sets D0 to DS-1 is T bit fields, the T bit fields are in one-to-one correspondence with T vectors comprised in B, each of the T bit fields comprises E bits, E is greater than or equal to 1, and a tth bit field in the T bit fields is used to indicate whether a vector b t-1 belongs to the vector set C, wherein 1 ≤ t ≤ T.
    • Embodiment 27. The communications apparatus according to any one of embodiments 19 to 26, wherein a value range of p z , y 1 , x 1 1
      Figure imgb0249
      is a set A1;
      • the indication information further comprises indication information of S sets E0 to ES-1, E0 to ES-1 are respectively in one-to-one correspondence with c 0 to c S-1 in the vector set C={c 0 , c 1, ···, c S-1}, and E j is a proper subset of A1; and
      • the second precoding matrix set still does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
      • the xth column vector comprised in X of W 1 is the vector c j , and a second product factor p z , y 1 , x 1 1
        Figure imgb0250
        of at least one element of the elements in row x and row x+M of W 2 that corresponds to c j belongs to E j .
    • Embodiment 28. A chip system, comprising:
      • a memory, configured to store a computer program; and
      • a processor, configured to invoke the computer program from the memory and run the computer program, so that a communications apparatus on which the chip system is installed performs the method according to any one of embodiment 1 and embodiments 3 to 9.
    • Embodiment 29. A chip system, comprising:
      • a memory, configured to store a computer program; and
      • a processor, configured to invoke the computer program from the memory and run the computer program, so that a communications apparatus on which the chip system is installed performs the method according to any one of embodiments 2 to 9.
    • Embodiment 30. A computer readable storage medium, comprising a computer program, wherein when the computer program runs on a computer, the computer performs the method according to any one of embodiment 1 and embodiments 3 to 9.
    • Embodiment 31. A computer readable storage medium, comprising a computer program, wherein when the computer program runs on a computer, the computer performs the method according to any one of embodiments 2 to 9.
    • Embodiment 32. A computer program product, comprising a computer program, wherein when the computer program is run, the method according to any one of embodiment 1 and embodiments 3 to 9 is performed.
    • Embodiment 33. A computer program product, comprising a computer program, wherein when the computer program is run, the method according to any one of embodiments 2 to 9 is performed.
  • A person of ordinary skill in the art may be aware that, in combination with the examples described in the embodiments disclosed in this specification, units and algorithm steps may be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed by hardware or software depends on particular applications and design constraint conditions of the technical solutions. A person skilled in the art may use different methods to implement the described functions for each particular application, but it should not be considered that the implementation goes beyond the scope of this application.
  • It may be clearly understood by a person skilled in the art that, for the purpose of convenient and brief description, for a detailed working process of each foregoing system, apparatus, or unit, reference may be made to a corresponding process in the foregoing method embodiments, and details are not described herein again.
  • In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other manners. For example, the described apparatus embodiments are merely examples. For example, the unit division is merely logical function division and may be other division in actual implementation. For example, a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not performed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections may be implemented by using some interfaces. The indirect couplings or communication connections between the apparatuses or units may be implemented in electronic, mechanical, or other forms.
  • The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual requirements to achieve the objectives of the solutions of the embodiments.
  • In addition, functional units in the embodiments of this application may be integrated into one processing unit, or each of the units may exist alone physically, or two or more units are integrated into one unit.
  • When the functions are implemented in the form of a software functional unit and sold or used as an independent product, the functions may be stored in a computer-readable storage medium. Based on such an understanding, the technical solutions of this application essentially, or the part contributing to the prior art, or some of the technical solutions may be implemented in a form of a software product. The software product is stored in a storage medium, and includes several instructions for instructing a computer device (which may be a personal computer, a server, or a network device) to perform all or some of the steps of the methods described in the embodiments of this application. The foregoing storage medium includes: any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk, an optical disc, or the like.
  • The foregoing descriptions are merely specific implementations of this application, but are not intended to limit the protection scope of this application. Any variation or replacement readily figured out by a person skilled in the art within the technical scope disclosed in this application shall fall within the protection scope of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.

Claims (12)

  1. A communications apparatus, comprising:
    a transceiver, configured to receive indication information; and
    a processor, configured to determine, based on the indication information received by the transceiver, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0251
    , X = [b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0252
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0253
    , p z , y 1 , x 1 0
    Figure imgb0254
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0255
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0256
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0257
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0258
    , p z , y 1 , x 1 0
    Figure imgb0259
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0260
    , and p z , y 1 , x 1 2
    Figure imgb0261
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets D0 to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0262
    of at least one of elements in row x and row x+M of W2 belongs to D j .
  2. A communications apparatus, comprising:
    a processor, configured to generate indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
    a transceiver, configured to send the indication information generated by the processor, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0263
    , X = [b k 0 ··· bkM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0264
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0265
    , p z , y 1 , x 1 0
    Figure imgb0266
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0267
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0268
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0269
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0270
    , p z , y 1 , x 1 0
    Figure imgb0271
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0272
    , and p z , y 1 , x 1 2
    Figure imgb0273
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set: an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0274
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  3. A chip system, comprising:
    a memory, configured to store a computer program; and
    a processor, configured to invoke the computer program from the memory and run the computer program, so that a communications apparatus on which the chip system is installed performs following method:
    receiving, indication information; and
    determining, based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies
    W 1 = X 0 0 X
    Figure imgb0275
    , X = [b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ···, b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0276
    an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0277
    , p z , y 1 , x 1 0
    Figure imgb0278
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0279
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0280
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0281
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0282
    , p z , y 1 , x 1 0
    Figure imgb0283
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0284
    , and p z , y 1 , x 1 2
    Figure imgb0285
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0286
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  4. A chip system, comprising:
    a memory, configured to store a computer program; and
    a processor, configured to invoke the computer program from the memory and run the computer program, so that a communications apparatus on which the chip system is installed performs following method:
    generating, indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
    sending, the indication information, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0287
    , X = [b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0288
    an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0289
    , p z , y 1 , x 1 0
    Figure imgb0290
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0291
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0292
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0293
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0294
    , p z , y 1 , x 1 0
    Figure imgb0295
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0296
    , and p z , y 1 , x 1 2
    Figure imgb0297
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets D0 to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0298
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  5. A computer readable storage medium, comprising a computer program, wherein when the computer program runs on a computer, the computer performs following method:
    receiving, indication information; and
    determining, based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0299
    , X = [b k 0 ··· b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0300
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0301
    , p z , y 1 , x 1 0
    Figure imgb0302
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0303
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0304
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0305
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0306
    , p z , y 1 , x 1 0
    Figure imgb0307
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0308
    , and p z , y 1 , x 1 2
    Figure imgb0309
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set: an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0310
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  6. A computer readable storage medium, comprising a computer program, wherein when the computer program runs on a computer, the computer performs following method:
    generating, indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
    sending, the indication information, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0311
    , X = [b k 0 ... b kM-1 ], b ki is an Nt/2×1 vector, b ki belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0312
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0313
    , p z , y 1 , x 1 0
    Figure imgb0314
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0315
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0316
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0317
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0318
    , p z , y 1 , x 1 0
    Figure imgb0319
    is a real number, p z , y 1 , x 1 1
    Figure imgb0320
    , and p z , y 1 , x 1 2
    Figure imgb0321
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0322
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  7. A computer program product, comprising a computer program, wherein when the computer program runs on a computer, the computer performs the following method:
    receiving, indication information; and
    determining, based on the indication information, a second precoding matrix set from a first precoding matrix set whose rank is R, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0323
    , X = [b k 0 ... b kM-1 ], b ki is an Nt/2×1 vector, b ki , belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0324
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0325
    , p z , y 1 , x 1 0
    Figure imgb0326
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0327
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0328
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0329
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0330
    , p z , y 1 , x 1 0
    Figure imgb0331
    is a real number, p z , y 1 , x 1 1 = 1
    Figure imgb0332
    , and p z , y 1 , x 1 2
    Figure imgb0333
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0334
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  8. A computer program product, comprising a computer program, wherein when the computer program runs on a computer, the computer performs the following method:
    generating, indication information, wherein the indication information is used by a terminal device to determine a second precoding matrix set from a first precoding matrix set whose rank is R; and
    sending, the indication information, wherein
    each precoding matrix W in the first precoding matrix set satisfies W = W 1 × W 2, W is a matrix of Nt rows and R columns, Nt is greater than or equal to R, W 1 satisfies W 1 = X 0 0 X
    Figure imgb0335
    , X = [b k 0 ... b k M-1 ], b ki is an Nt/2×1 vector, b ki , belongs to a vector set B = {b 0, b 1, ..., b T-1 }, T is a quantity of vectors in B, T ≥ M, T is an integer, W 2 is a matrix of 2M rows and R columns, an element W 2(x,y) in row x and column y of W 2 satisfies W 2 x y = p 0 , y 1 , x 1 0 × p 0 , y 1 , x 1 1 × p 0 , y 1 , x 1 2
    Figure imgb0336
    , an element W 2(x+M,y) in row x+M and column y of W 2 satisfies W 2 x + M , y = p 1 , y 1 , x 1 0 × p 1 , y 1 , x 1 1 × p 1 , y 1 , x 1 2
    Figure imgb0337
    , p z , y 1 , x 1 0
    Figure imgb0338
    is a first product factor, p z , y 1 , x 1 1
    Figure imgb0339
    is a second product factor, p z , y 1 , x 1 2
    Figure imgb0340
    is a third product factor, 0 < x ≤ M, 0 < y ≤ R, a value range of p z , y 1 , x 1 0
    Figure imgb0341
    is a set A0, z belongs to {0,1}, 1 p z , y 1 , x 1 0 0
    Figure imgb0342
    , p z , y 1 , x 1 0
    Figure imgb0343
    is a real number, p z , y 1 , x 1 1
    Figure imgb0344
    , and p z , y 1 , x 1 2
    Figure imgb0345
    is a complex number whose modulus is 1;
    the indication information comprises indication information of S sets Do to DS-1, Do to DS-1 are respectively in one-to-one correspondence with c 0 to c S-1 in a vector set C = {c 0, c 1, ..., c S-1 }, any vector c j in C belongs to B, D j is a proper subset of A0, S - 1 ≥ j ≥ 0, and j is an integer; and
    the second precoding matrix set is a proper subset of the first precoding matrix set, and the second precoding matrix set does not comprise W = W 1 × W 2 that satisfies the following condition in the first precoding matrix set:
    an xth column vector comprised in X of W 1 is the vector c j , and a first product factor p z , y 1 , x 1 0
    Figure imgb0346
    of at least one of elements in row x and row x+M of W2 belongs to D j.
  9. The apparatus, system, medium or product according to anyone of claims 1-8, wherein the indication information of the S sets Do to DS-1 comprises S bit fields, the S bit fields are in one-to-one correspondence with D0 to DS-1, each bit field comprises at least one bit, a bit field corresponding to D j indicates an element gj of A0, and any element of D j is greater than gj.
  10. The apparatus, system, medium or product according to anyone of claims 1-8, wherein any vector c j of C and any element D j (ν) of D j satisfy the following condition: D j ν × b ƒ h H × c j > k h
    Figure imgb0347
    wherein b ƒh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  11. The apparatus, system, medium or product according to anyone of claims 1-8, wherein C comprises at least M mutually orthogonal vectors, and any mutually M orthogonal vectors c j 0 , c j 1 , ..., c jM-1 and elements D j 0 (ν 0), D j 1 (ν 1), ..., D jM-1 (ν M-1) satisfy the following condition: D j 0 ν 0 × b f h H × c j 0 2 + D j 1 ν 1 × b f h H × c j 1 2 + , + D j M 1 ν M 1 × b f h H × c j M 1 2 D j 0 ν 0 2 + D j 1 ν 1 2 + + D jM 1 ν M 1 2 > k h
    Figure imgb0348
    wherein D j 0 (ν 0), D j 1 (ν 1), ..., DjM-1 ,( ν M-1) are elements of sets D j0, D j1, ..., D jM-1 respectively, b ƒh is a vector of B, kh ≥ 0, kh is a real number, H ≥ h ≥ 1, T - 1 ≥ fh ≥ 0, H ≥ 1, and H is an integer.
  12. The apparatus, system, medium or product according to claim 11, wherein the indication information of the S sets D0 to DS-1 comprises H bit fields, and an hth bit field is used to indicate kh.
EP20178654.8A 2017-08-12 2018-07-04 Method for determining precoding matrix set and transmission apparatus Active EP3780470B1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201710687817.4A CN109391436B (en) 2017-08-12 2017-08-12 Method for precoding matrix subset restriction and transmission device
PCT/CN2018/094446 WO2019033868A1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device
EP18807542.8A EP3468094B1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device

Related Parent Applications (2)

Application Number Title Priority Date Filing Date
EP18807542.8A Division-Into EP3468094B1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device
EP18807542.8A Division EP3468094B1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device

Publications (2)

Publication Number Publication Date
EP3780470A1 EP3780470A1 (en) 2021-02-17
EP3780470B1 true EP3780470B1 (en) 2021-12-29

Family

ID=65080173

Family Applications (2)

Application Number Title Priority Date Filing Date
EP20178654.8A Active EP3780470B1 (en) 2017-08-12 2018-07-04 Method for determining precoding matrix set and transmission apparatus
EP18807542.8A Active EP3468094B1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP18807542.8A Active EP3468094B1 (en) 2017-08-12 2018-07-04 Precoding matrix set determination method and transmission device

Country Status (8)

Country Link
US (2) US10476568B2 (en)
EP (2) EP3780470B1 (en)
JP (1) JP6977048B2 (en)
KR (1) KR102213035B1 (en)
CN (4) CN109245875B (en)
BR (1) BR112018073773A2 (en)
CA (1) CA3052996C (en)
WO (1) WO2019033868A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109245875B (en) * 2017-08-12 2019-09-13 华为技术有限公司 The method and transmitting device of pre-coding matrix subset limitation
US11347788B2 (en) * 2019-01-16 2022-05-31 Toyota Research Institute, Inc. Systems and methods for generating a requested image view

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SG10201503104PA (en) * 2007-04-20 2015-06-29 Interdigital Tech Corp Method and apparatus for efficient precoding information validation for mimo communications
KR20090030200A (en) * 2007-09-19 2009-03-24 엘지전자 주식회사 Data transmitting and receiving method using phase shift based precoding and transceiver supporting the same
CN101399798B (en) * 2007-09-27 2011-07-06 北京信威通信技术股份有限公司 Steady signal transmission method and device for OFDMA radio communication system
PL2232726T3 (en) 2008-01-14 2017-08-31 Telefonaktiebolaget Lm Ericsson (Publ) Open loop precoder cycling in mimo communications
CN101834613B (en) * 2009-03-09 2012-11-21 电信科学技术研究院 Encoding method of LDPC (Low Density Parity Check) code and encoder
US8711716B2 (en) * 2009-06-19 2014-04-29 Texas Instruments Incorporated Multiple CQI feedback for cellular networks
RU2559292C2 (en) * 2009-10-05 2015-08-10 Конинклейке Филипс Электроникс Н.В. Method of signalling precoding in cooperative beamforming transmission mode
US20110103493A1 (en) * 2009-11-02 2011-05-05 Futurewei Technologies, Inc. System and Method for Wireless Communications with Adaptive Codebooks
ES2639770T3 (en) * 2010-04-07 2017-10-30 Telefonaktiebolaget Lm Ericsson (Publ) A precoder structure for MIMO precoding
CN102237974B (en) * 2010-05-07 2013-12-18 华为技术有限公司 Method and device for acquiring pre-coding matrix
CN101877627B (en) * 2010-06-21 2015-09-16 中兴通讯股份有限公司 The feedback method of channel condition information and terminal
EP2692069B1 (en) * 2011-03-31 2019-08-07 Huawei Technologies Co., Ltd. Method in a wireless communication system
CN102957467B (en) * 2011-08-24 2018-01-30 中兴通讯股份有限公司 The signal processing method and system of multiple antennas in a kind of downlink system
CN103947249B (en) * 2011-09-30 2018-04-27 英特尔公司 The method that internet service is simultaneously transmitted by multiple wireless networks
EP3651375A1 (en) 2012-06-14 2020-05-13 Huawei Technologies Co., Ltd. Method for determining precoding matrix indicator, user equipment, and base station evolved node b
US9614599B2 (en) * 2012-08-03 2017-04-04 Agency For Science, Technology And Research Method for determining precoding matrixes for communication and a system therefrom
CA2910459C (en) * 2013-04-28 2018-07-17 Huawei Technologies Co., Ltd. Precoding matrix indicator feedback method, receive end, and transmit end
CN104144006A (en) * 2013-05-07 2014-11-12 北京三星通信技术研究有限公司 Channel state information transmission method, user equipment and base station in MIMO system
BR112015029739B1 (en) * 2013-06-04 2022-08-23 Huawei Technologies Co., Ltd METHOD FOR TRANSMITTING 4 ANTENNA PRE-CODING MATRIX, USER EQUIPMENT AND BASE STATION
WO2015018030A1 (en) 2013-08-08 2015-02-12 华为技术有限公司 Method for determining precoding matrix indicator, receiving device and transmitting device
KR102023671B1 (en) * 2013-11-01 2019-09-20 이노스카이 주식회사 Method and apparatus of controlling periodic csi reporting
CN103731385B (en) * 2014-01-09 2016-09-28 中国科学院计算技术研究所 Interference alignment method for precoding and system
US9872242B2 (en) * 2014-01-31 2018-01-16 Qualcomm Incorporated Joint transmission of CSI-RS for channel state feedback and transmission point selection
US10498405B2 (en) * 2014-10-29 2019-12-03 Telefonaktiebolaget L M Ericsson (Publ) Codebook restriction
CN107113037A (en) * 2014-11-14 2017-08-29 交互数字专利控股公司 Antenna virtualization in two-dimensional antenna array
US10110286B2 (en) * 2015-03-30 2018-10-23 Samsung Electronics Co., Ltd. Method and apparatus for codebook design and signaling
US10205499B2 (en) * 2015-06-18 2019-02-12 Telefonaktiebolaget Lm Ericsson (Publ) Systems and methods for adapting a codebook for use with multiple antenna configurations
EP3327945B1 (en) * 2015-07-23 2021-03-31 LG Electronics Inc. Codebook-based signal transmission and reception method in multi-antenna wireless communication system and apparatus therefor
CN107925466B (en) * 2015-07-23 2021-04-20 Lg 电子株式会社 Codebook-based signal transmission/reception method in multi-antenna wireless communication system
CN106559232B (en) * 2015-09-25 2020-09-11 中兴通讯股份有限公司 Information notification method and execution method of Channel State Information (CSI) process
WO2017054192A1 (en) * 2015-09-30 2017-04-06 华为技术有限公司 Communication method and apparatus based on codebook feedback
US20170180020A1 (en) * 2015-12-18 2017-06-22 Qualcomm Incorporated Per-tone precoding for downlink mimo transmission
TWI632796B (en) * 2016-03-04 2018-08-11 國立清華大學 Method of joint clustering and precoding and base station using the same
CN106936485B (en) * 2017-04-05 2020-06-16 浙江大学 Hybrid precoding design method for large-scale MIMO multicast system
CN109245875B (en) * 2017-08-12 2019-09-13 华为技术有限公司 The method and transmitting device of pre-coding matrix subset limitation

Also Published As

Publication number Publication date
WO2019033868A1 (en) 2019-02-21
EP3468094B1 (en) 2020-09-09
CA3052996C (en) 2022-01-11
KR20190116423A (en) 2019-10-14
CN109361498A (en) 2019-02-19
CN109391436B (en) 2021-12-03
US20190238198A1 (en) 2019-08-01
CN109245875B (en) 2019-09-13
EP3468094A4 (en) 2019-06-26
EP3780470A1 (en) 2021-02-17
JP6977048B2 (en) 2021-12-08
US20190393941A1 (en) 2019-12-26
CN109245875A (en) 2019-01-18
CN109361498B (en) 2019-09-20
KR102213035B1 (en) 2021-02-04
JP2020508006A (en) 2020-03-12
CA3052996A1 (en) 2019-02-21
US10476568B2 (en) 2019-11-12
US10897293B2 (en) 2021-01-19
CN110892668B (en) 2021-07-20
CN110892668A (en) 2020-03-17
CN109391436A (en) 2019-02-26
EP3468094A1 (en) 2019-04-10
BR112018073773A2 (en) 2019-04-09

Similar Documents

Publication Publication Date Title
EP3605863A1 (en) Information transmission method and device
EP3691212A1 (en) Uplink transmission and configuration method, terminal, and base station
EP3849126B1 (en) Phase tracking reference signal sending method and apparatus
EP3890202A1 (en) Communication method and device
EP3576334A1 (en) Method for transmitting dmrs, and communication device
EP3758246A1 (en) Method and apparatus for selecting uplink antenna
EP3780470B1 (en) Method for determining precoding matrix set and transmission apparatus
EP3416445A1 (en) Data transmission method and apparatus
EP3614583A1 (en) Channel correction method and network device
US11303328B2 (en) Communication method and apparatus, network device, terminal device, and system
US20200382193A1 (en) Method for calculating channel quality indicator cqi, terminal device, and network device
EP2811780A1 (en) Data transmission method and system, base station and user equipment
CN111587543B (en) Channel state information matrix information processing method and communication device
US20170251470A1 (en) Data transmission method and user equipment
WO2020227873A1 (en) Channel state information transmission method, device, and storage medium
EP4319016A1 (en) Port indication information reporting method and terminal
EP4362342A1 (en) Channel state information sending method and apparatus, and channel state information receiving method and apparatus
WO2024067346A1 (en) Information transmission method and apparatus, and storage medium
WO2021128370A1 (en) Information sending method, receiving method and apparatus
EP3013106A1 (en) Control information transmission method, user equipment and base station

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20200608

AC Divisional application: reference to earlier application

Ref document number: 3468094

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 5/00 20060101AFI20210722BHEP

Ipc: H04B 7/0417 20170101ALI20210722BHEP

Ipc: H04B 7/0456 20170101ALI20210722BHEP

Ipc: H04B 7/0426 20170101ALN20210722BHEP

Ipc: H04B 7/06 20060101ALN20210722BHEP

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 5/00 20060101AFI20210726BHEP

Ipc: H04B 7/0417 20170101ALI20210726BHEP

Ipc: H04B 7/0456 20170101ALI20210726BHEP

Ipc: H04B 7/0426 20170101ALN20210726BHEP

Ipc: H04B 7/06 20060101ALN20210726BHEP

INTG Intention to grant announced

Effective date: 20210818

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AC Divisional application: reference to earlier application

Ref document number: 3468094

Country of ref document: EP

Kind code of ref document: P

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602018028987

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1459490

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220115

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220329

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1459490

Country of ref document: AT

Kind code of ref document: T

Effective date: 20211229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220329

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220330

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220429

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220429

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602018028987

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20220930

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220704

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220731

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220731

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20211229

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220704

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20230614

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230601

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230531

Year of fee payment: 6