WO2020135534A1 - 预编码方法和装置及信息传输方法和装置 - Google Patents

预编码方法和装置及信息传输方法和装置 Download PDF

Info

Publication number
WO2020135534A1
WO2020135534A1 PCT/CN2019/128474 CN2019128474W WO2020135534A1 WO 2020135534 A1 WO2020135534 A1 WO 2020135534A1 CN 2019128474 W CN2019128474 W CN 2019128474W WO 2020135534 A1 WO2020135534 A1 WO 2020135534A1
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
receiving
end device
sending
algorithm
Prior art date
Application number
PCT/CN2019/128474
Other languages
English (en)
French (fr)
Inventor
夏欣
张珍兵
刘云
官鹭
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP19903747.4A priority Critical patent/EP3886332A4/en
Publication of WO2020135534A1 publication Critical patent/WO2020135534A1/zh
Priority to US17/357,392 priority patent/US11943017B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0426—Power distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
    • H04W8/24—Transfer of terminal data

Definitions

  • the present application relates to the field of communication technology, and in particular, to a precoding method and device and an information transmission method and device.
  • MIMO systems usually use precoding technology to improve the channel to enhance the effect of spatial multiplexing.
  • the precoding technology uses a precoding matrix that matches the channel to process the spatially multiplexed data stream, thereby realizing the precoding of the channel and improving the reception quality of the data stream.
  • the precoding matrix is usually obtained by performing singular value decomposition (SVD) on the channel matrix.
  • SVD singular value decomposition
  • existing communication standards such as 3GPP 5G NR stipulate: For a terminal, when the number of space-division multiplexed data streams is less than or equal to 4, a codeword is used, that is, the same modulation and coding method (modulation) is used and coding (MCS). Therefore, the equivalent channel gain of each data stream is proportional to the singular value of the channel matrix obtained by SVD, which may lead to a large difference in performance of different data streams. Take the 4 data streams of space division multiplexing as an example. Generally, the performance of the third and fourth data streams is poor, which will drag down the overall performance of the data stream corresponding to one codeword.
  • Embodiments of the present application provide a precoding method and device, and an information transmission method and device, which help to improve the overall performance of multiple data streams corresponding to the same codeword.
  • an embodiment of the present application provides a precoding method, including: decomposing a channel matrix into a product of matrix Q, matrix R, and matrix P H ; where matrix P H is a conjugate transposed matrix of matrix P, The matrix Q and the matrix P are both unitary matrices, and the matrix R is an upper triangular matrix; the data to be transmitted is pre-coded according to the matrix P.
  • the at least two diagonal elements may be any multiple diagonal elements in the matrix R.
  • the execution subject of the method may be a sending-end device (such as a network device or a terminal).
  • Precoding based on this technical solution helps to make the equivalent channel gain of multiple data streams in space division multiplexing (specifically embodied as the diagonal elements of matrix R) meet a certain ratio, and by setting this ratio reasonably, Helps to improve the overall performance of the data stream corresponding to a codeword.
  • space division multiplexing specifically embodied as the diagonal elements of matrix R
  • the equivalent channel gain of multiple data streams of space division multiplexing can be set, so that the performance difference of the four data streams is not large, thereby improving the overall performance.
  • the ratio of at least two diagonal elements of the matrix R is the target ratio, which is determined based on the code rate. The higher the code rate, the closer the target ratio is to 1:1:...:1. This helps to improve the overall performance of multiple data streams corresponding to the same codeword.
  • the target ratio is specifically A 1 :A 2 :...:A k :...:A t .
  • the non-zero singular value obtained by SVD of the channel matrix and the diagonal elements in the diagonal matrix obtained by SVD of the channel matrix satisfy the following conditions:
  • ⁇ k is the k-th non-zero singular value obtained by SVD of the channel matrix
  • ⁇ k is the above A k ⁇ , and 1 ⁇ k ⁇ t ⁇ K.
  • decomposing the channel matrix into the product of matrix Q, matrix R and matrix P H includes: performing SVD on the channel matrix to decompose the channel matrix into matrix U, matrix ⁇ and matrix V H The product of; where matrix V H is the conjugate transpose matrix of matrix V, matrix U and matrix V are unitary matrices, matrix ⁇ is the diagonal matrix; transform matrix U, matrix ⁇ and matrix V H to obtain the matrix Q, matrix R and matrix P H.
  • the target ratio is the ratio of the 1st to tth diagonal elements in the matrix R; 1 ⁇ k ⁇ t ⁇ K, both k and t are integers, and K is the diagonal of the matrix R The number of line elements.
  • the matrix U, matrix ⁇ and matrix V H are transformed to obtain matrix Q, matrix R and matrix P H , including:
  • Step 1 According to the relationship between ⁇ k and the k- th diagonal element r k , k in the matrix R k-1 , find the diagonal elements r p, p from the matrix R k-1 ; where k ⁇ p ⁇ K, p is an integer, and ⁇ k is the above A k ⁇ ; if r k,k ⁇ k , then r p,p ⁇ k ; if r k,k ⁇ k , then r p,p > ⁇ k ;
  • Step 2 Exchange the diagonal elements r k+1,k+1 and r p,p in the matrix R k-1 to obtain the matrix R re_k ;
  • Step 3 According to ⁇ k , the kth diagonal element and the k+ 1th diagonal element in the matrix R re_k , construct the matrix G 1 and the matrix G 2 ; where the matrix G 1 and the matrix G 2 make The sub-matrix formed by the intersection of the k-th, k+1-th row and the k-th, k+1-th column in is an upper triangular matrix, and the first diagonal element of the sub-matrix is ⁇ k ; Is the transposed matrix of matrix G 2 ;
  • Step 4 According to the formula Obtain the matrix R k ;
  • the matrix R t-1 obtained after performing steps 1 to 4 at the t-1th time is taken as the matrix R.
  • the matrix G 1 and the matrix G 2 are constructed according to ⁇ k , the kth diagonal element and the k+ 1th diagonal element in the matrix R re_k , including: Matrix G 1 and matrix G 2 : among them, ⁇ 1 is R re_k matrix in the k-th diagonal element, ⁇ 2 is the matrix R re_k k + 1-th diagonal element.
  • This possible design provides a specific implementation for constructing the matrix G 1 and the matrix G 2 :.
  • an embodiment of the present application provides an information transmission method, including: a sending device receives receiving capability information from a receiving device, and the receiving capability information is used to indicate that the receiving device supports a nonlinear receiving algorithm; the sending device According to the receiving capability information, the pre-coding method provided by the first aspect or any one of the possible designs of the first aspect is used to pre-code the data to be sent; the device at the sending end sends the pre-coded data to be sent.
  • the matrix R obtained by channel matrix decomposition is an upper triangular matrix, that is, after the precoding method is used to encode multiple data streams , Will bring certain inter-stream interference.
  • the receiving end device may cooperate with a non-linear receiving algorithm to receive data, thereby reducing or eliminating these inter-stream interferences and increasing the probability of correct demodulation of multi-stream data.
  • the transmitting end device adopts the precoding method provided above, which allows certain inter-stream interference, and this inter-stream interference can be reduced or eliminated at the receiving end device, so when this technical solution is adopted for information transmission , Can increase the number of space division multiplexing of multiple antenna systems, thereby providing system capacity.
  • the method further includes: the sending end device sends indication information to the receiving end device, where the indication information is used to instruct the sending end device to adopt the first aspect or any one of the possible designs provided in the first aspect
  • the precoding method is to precode the data to be sent. In this way, it helps the receiving device to use the non-linear receiving algorithm supported by the receiving device to receive the pre-encoded data to be transmitted, thereby reducing or eliminating these inter-stream interferences and increasing the probability of correct demodulation of multi-stream data; In addition, it helps to increase the number of space division multiplexed streams in a multi-antenna system, thereby providing system capacity.
  • the method further includes: the sending end device sends instruction information to the receiving end device, where the instruction information is used to instruct the receiving end device to use a non-linear receiving algorithm to receive the data to be sent.
  • the sending end device sends instruction information to the receiving end device, where the instruction information is used to instruct the receiving end device to use a non-linear receiving algorithm to receive the data to be sent.
  • any one of the above-mentioned indication information is carried in radio resource control (RRC) signaling and media access control (media access control (MAC) signaling or downlink control information (downlink control information, DCI).
  • RRC radio resource control
  • MAC media access control
  • DCI downlink control information
  • any of the above indication information is carried in RRC signaling, MAC signaling, or uplink control information (uplink control information, UCI) in.
  • the non-linear receiving algorithm includes a serial interference cancellation (SIC) algorithm or a maximum likelihood detection (MLD) algorithm.
  • SIC serial interference cancellation
  • MLD maximum likelihood detection
  • an embodiment of the present application provides an information transmission method, including: a receiving device receives instruction information sent by a sending device, and the indicating information is used to instruct the sending device to adopt the first aspect or any one of the first aspects
  • a possible design provides a precoding method to precode the data to be sent; the receiving end device uses the non-linear receiving algorithm supported by the receiving end device to receive the pre-encoded data to be sent according to the instruction information.
  • the method further includes: the receiving end device sends receiving capability information to the sending end device, and the receiving capability information is used to indicate that the receiving end device supports a non-linear receiving algorithm.
  • non-linear receiving algorithms include SIC algorithm or MLD algorithm.
  • an embodiment of the present application provides an information transmission method, including: a receiving device receives instruction information sent by a sending device, and the indicating information is used to instruct the receiving device to receive data using a non-linear receiving algorithm; the receiving device according to The instruction information uses a non-linear receiving algorithm to receive data from the sending device.
  • this technical solution can be used in combination with the precoding method provided in the first aspect or any one of the possible designs in the first aspect, thereby reducing or eliminating the use of the precoding method by the sending end device Inter-stream interference due to pre-coding improves the probability of correct demodulation of multi-stream data.
  • the method before the receiving end device receives the indication information sent by the sending end device, the method further includes: the receiving end device sends receiving capability information to the sending end device, and the receiving capability information is used to indicate that the receiving end device supports non- Linear receiving algorithm.
  • non-linear receiving algorithms include SIC algorithm or MLD algorithm.
  • an embodiment of the present application provides a precoding apparatus, configured to perform the precoding method provided in the first aspect or any possible design of the first aspect.
  • the precoding device may specifically be a sending-end device (such as a network device or a terminal), or a chip.
  • the precoding device includes various modules for performing the precoding method provided in the first aspect or any possible design in the first aspect.
  • the precoding device includes a memory and a processor.
  • the memory is used to store computer-executed instructions.
  • the processor executes the computer-executed instructions in the memory to use the device.
  • the hardware resource executes the operation steps of the precoding method provided in the first aspect or any possible design of the first aspect.
  • an embodiment of the present application provides a sending end device, configured to perform the information transmission method provided in the second aspect or any possible design of the second aspect.
  • the sending end device may specifically be a network device or a terminal, or a chip.
  • the sending end device includes various modules for performing the information transmission method provided in the second aspect or any one of the possible designs in the second aspect.
  • the sending-end device includes a memory and a processor, and the memory is used to store computer-executed instructions.
  • the processor executes the computer-executing instructions in the memory to utilize the sending
  • the hardware resources in the end device perform the operation steps of the information transmission method provided in the second aspect or any possible design of the second aspect.
  • an embodiment of the present application provides a receiving end device, configured to perform the information transmission method provided in the third aspect or any possible design of the third aspect.
  • the receiving device may specifically be a network device or a terminal, or a chip.
  • the receiving end device includes various modules for performing the information transmission method provided in the third aspect or any of the possible designs in the third aspect.
  • the receiving device includes a memory and a processor.
  • the memory is used to store computer-executed instructions.
  • the processor executes the computer-executed instructions in the memory to utilize the receiving
  • the hardware resources in the end device perform the operation steps of the information transmission method provided in the third aspect or any possible design of the third aspect.
  • an embodiment of the present application provides a receiving end device, configured to perform the information transmission method provided in the fourth aspect or any one of the possible designs of the fourth aspect.
  • the receiving device may specifically be a network device or a terminal, or a chip.
  • the receiving end device includes various modules for performing the information transmission method provided by the fourth aspect or any one of the possible designs of the fourth aspect.
  • the receiving device includes a memory and a processor.
  • the memory is used to store computer-executed instructions.
  • the processor executes the computer-executed instructions in the memory to utilize the receiving
  • the hardware resources in the end device perform the operation steps of the information transmission method provided in the fourth aspect or any possible design of the fourth aspect.
  • An embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored, and when the computer program is run on a computer, the computer is caused to perform the first aspect or any possible design of the first aspect. Operation steps of the precoding method.
  • An embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored, and when the computer program is run on a computer, the computer is caused to perform the above second to fourth aspects or any possible design thereof Operation steps of the provided information transmission method.
  • An embodiment of the present application further provides a computer program product which, when run on a computer, causes the operation steps of the precoding method provided in the first aspect or any possible design of the first aspect to be executed.
  • An embodiment of the present application also provides a computer program product, which when executed on a computer, causes the operation steps of the information transmission method provided by the second to fourth aspects or any one of its possible designs to be executed.
  • any of the precoding apparatus, the sending end device, the receiving end device, or the computer-readable storage medium or computer program product provided above are used to perform the corresponding method provided above.
  • beneficial effects that can be achieved refer to the beneficial effects in the corresponding method, which will not be repeated here.
  • FIG. 1 is a schematic diagram of a communication system applicable to embodiments of the present application
  • FIG. 2 is a schematic diagram of a hardware structure of a communication device applicable to embodiments of the present application.
  • FIG. 3 is a schematic flowchart of a precoding method provided by an embodiment of this application.
  • FIG. 4 is an interactive schematic diagram of an information transmission method provided by an embodiment of the present application.
  • FIG. 5 is an interactive schematic diagram of an information transmission method provided by an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of a precoding device according to an embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of a sending end device according to an embodiment of this application.
  • FIG. 8 is a schematic structural diagram of a receiving end device according to an embodiment of the present application.
  • the technical solutions provided in the embodiments of the present application may be applied to various communication systems, such as 5G communication systems, future evolution systems, or multiple communication fusion systems, and may also be applied to existing communication systems.
  • the application scenarios of the technical solutions provided in this application may include multiple types, for example, machine-to-machine (M2M), macro-micro communications, enhanced mobile Internet (enhanced mobile (broadband, eMBB), ultra-high reliability and ultra-low Scenarios such as ultra-reliable & low latency (uRLLC) and massive IoT communication (mass machine type communication (mMTC)).
  • M2M machine-to-machine
  • macro-micro communications enhanced mobile Internet (enhanced mobile (broadband, eMBB), ultra-high reliability and ultra-low Scenarios such as ultra-reliable & low latency (uRLLC) and massive IoT communication (mass machine type communication (mMTC)
  • These scenarios may include, but are not limited to: communication scenarios between terminals and terminals, communication
  • FIG. 1 it is a schematic diagram of a communication system applicable to embodiments of the present application.
  • the communication system may include one or more network devices 10 (only one is shown) and connected to each network device 10 One or more terminals 20.
  • FIG. 1 is only a schematic diagram, and does not constitute a limitation on the applicable scenario of the technical solution provided by the present application.
  • the network device 10 may be a transmission and reception node (transmission reception point, TRP), a base station, a relay station, an access point, or the like.
  • the network device 10 may be a network device in a 5G communication system or a network device in a future evolution network; it may also be a wearable device or a vehicle-mounted device.
  • it can be: a global mobile communication system (global system for mobile communication (GSM) or code division multiple access (CDMA) network) base station transceiver station (base transceiver station (BTS), or broadband NB (NodeB) in wideband code division multiple access (WCDMA) may also be eNB or eNodeB (evolutional NodeB) in long term evolution (LTE).
  • GSM global system for mobile communication
  • CDMA code division multiple access
  • BTS base transceiver station
  • NodeB broadband NB
  • WCDMA wideband code division multiple access
  • WCDMA wideband code division multiple access
  • the network device 10 may also
  • the terminal 20 may be user equipment (UE), client equipment (CPE), access terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal, mobile device, UE Terminal, wireless communication equipment, UE agent or UE device, etc.
  • the access terminal may be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital processing (personal digital assistant, PDA), or wireless communication Functional handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminals in 5G networks or terminals in future public land mobile networks (PLMN) networks, etc. .
  • Each network element in FIG. 1 may be implemented by the communication device 200 in FIG. 2.
  • the communication device 200 includes at least one processor 201, a communication line 202, a memory 203, and at least one communication interface 204.
  • the processor 201 may be a general-purpose central processing unit (central processing unit, CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more used to control the execution of the program program of the present application integrated circuit.
  • CPU central processing unit
  • ASIC application-specific integrated circuit
  • the communication line 202 may include a path for transferring information between the above components.
  • the communication interface 204 uses any device such as a transceiver to communicate with other devices or communication networks, such as Ethernet, RAN, wireless local area networks (WLAN), and so on.
  • a transceiver to communicate with other devices or communication networks, such as Ethernet, RAN, wireless local area networks (WLAN), and so on.
  • the memory 203 may be read-only memory (ROM) or other types of static storage devices that can store static information and instructions, random access memory (random access memory, RAM), or other types that can store information and instructions
  • the dynamic storage device can also be electrically erasable programmable read-only memory (electrically erasable programmable-read-only memory (EEPROM), read-only compact disc (compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (Including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), disk storage media or other magnetic storage devices, or can be used to carry or store the desired program code in the form of instructions or data structures and can be used by a computer Access to any other media, but not limited to this.
  • EEPROM electrically erasable programmable read-only memory
  • CD-ROM compact disc read-only memory
  • optical disc storage including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.
  • the memory may exist independently and be connected to the processor through the communication line 202.
  • the memory can also be integrated with the processor.
  • the memory provided by the embodiments of the present application may generally be non-volatile.
  • the memory 203 is used to store computer execution instructions for executing the solution of the present application, and the processor 201 controls the execution.
  • the processor 201 is used to execute computer-executed instructions stored in the memory 203, thereby implementing the method provided by the following embodiments of the present application.
  • the computer execution instructions in the embodiments of the present application may also be called application program codes, which are not specifically limited in the embodiments of the present application.
  • the communication device 200 may include multiple processors, such as the processor 201 and the processor 207 in FIG. 2. Each of these processors can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor.
  • the processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • the communication device 200 may further include an output device 205 and an input device 206.
  • the output device 205 communicates with the processor 201 and can display information in various ways.
  • the output device 205 may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or a projector. Wait.
  • the input device 206 communicates with the processor 201 and can receive user input in a variety of ways.
  • the input device 206 may be a mouse, a keyboard, a touch screen device, or a sensing device.
  • any of the technical solutions provided by the embodiments of the present application can be applied in a downlink transmission scenario, and can also be applied in an uplink transmission scenario.
  • the sending device When applied to a downlink transmission scenario, the sending device may be a network device, and the receiving device may be a terminal.
  • the embodiment of the present application does not limit the type of the communication device 200.
  • the technical solution provided by the embodiments of the present application may be applied in a downlink transmission scenario, and may also be applied in an uplink transmission scenario.
  • the sending device When applied to a downlink transmission scenario, the sending device may be a network device, and the receiving device may be a terminal.
  • the sending device When applied to an uplink transmission scenario, the sending device may be a terminal, and the receiving device may be a network device.
  • the network device involved in this embodiment and the replaced network device may represent the same network device.
  • the sending-end device (or the receiving-end device) is replaced with a terminal
  • the terminal involved in this embodiment and the replaced terminal may represent the same terminal, which is described here in a unified manner and will not be described in detail below.
  • the technical solution provided by the embodiments of the present application may be applied to a time division duplex (time division duplexing, TDD) system, and may also be applied to a frequency division duplex (frequency division duplex) system.
  • TDD time division duplexing
  • frequency division duplex frequency division duplex
  • the technical solutions provided in the embodiments of the present application are all directed to a terminal dispatched by a network device, and multiple data streams are spatially multiplexed by the terminal as an example for description.
  • the embodiments of the present application do not limit the manner in which the terminal and other terminals multiplex transmission resources (such as time-frequency resources or space resources).
  • the diagonal elements of the matrix involved in the embodiments of the present application all refer to the elements on the main diagonal of the matrix, which will be described here in a unified manner and will not be described in detail below.
  • FIG. 3 it is a schematic flowchart of a precoding method provided by an embodiment of the present application.
  • the execution subject of this embodiment is the sending end device.
  • the method shown in FIG. 3 may include the following steps:
  • the matrix V H is a conjugate transposed matrix of the matrix V
  • both the matrix U and the matrix V are unitary matrices
  • the matrix ⁇ is a diagonal matrix.
  • the matrix A is a unitary matrix.
  • a H is the conjugate transposed matrix of matrix A.
  • E is the identity matrix.
  • a diagonal matrix is a matrix whose elements outside the main diagonal are all 0, and the elements on the diagonal can be 0 or non-zero values.
  • the upper triangular matrix is a square matrix with zeros below the main diagonal.
  • the matrix P is a precoding matrix.
  • a column vector in the precoding matrix corresponds to a data stream, and the column vector is used for precoding the data in the data stream.
  • the number of columns of the precoding matrix P may be the number of data streams for the terminal determined by the network device in this scheduling period.
  • the column vector here can be replaced with a row vector, and accordingly, the number of columns can be replaced with the number of rows.
  • All data streams corresponding to the precoding matrix P may correspond to the same code word, or may correspond to multiple different code words.
  • the embodiments of the present application do not limit the number of data streams corresponding to the same codeword.
  • the 5GNR protocol stipulates that when the number of data streams is less than or equal to 4, the same codeword is used.
  • each diagonal element of the matrix R represents the equivalent channel gain of a data stream.
  • the ratio of at least two diagonal elements of the matrix R is the target ratio, and the target ratio is determined based on the code rate.
  • the code rate is a concept in the channel coding and decoding, which is used to indicate the redundancy of the channel coding, and the code rate ranges from 0 to 1. Generally, the lower the code rate, the higher the redundancy of channel coding; the higher the code rate, the lower the redundancy of coding.
  • the target ratio is closer to 1:1:...:1, that is, the closer the values of A1, A2... and At are.
  • the smaller the bit rate the more the target ratio deviates from 1:1:...:1, that is, the greater the difference between A1, A2... and At. This helps to improve the overall performance of multiple data streams corresponding to the same codeword.
  • the "at least two diagonal elements” may be any plurality of diagonal elements of the matrix R.
  • the “at least two diagonal elements” are the first to tth in the matrix R Diagonal elements, t ⁇ K, K is the number of diagonal elements of matrix R. Both t and K are integers.
  • the at least two diagonal elements are the first to tth diagonal elements in the matrix R as an example for description.
  • the embodiment of the present application does not limit the acquisition method of the target ratio, for example, it may be determined based on the overall performance of multiple data streams corresponding to a single codeword.
  • the embodiment of the present application does not limit the acquisition method of the target ratio, for example, it may be pre-defined or determined by the transmitter device according to the channel decoder model, where the target ratio is different under different code rates .
  • the non-zero singular values obtained by the SVD of the channel matrix H and the diagonal elements in the diagonal matrix obtained by the SVD of the channel matrix H satisfy the following conditions:
  • ⁇ k is the k-th non-zero singular value obtained by SVD of the channel matrix H
  • ⁇ k is the above A k ⁇ , 1 ⁇ k ⁇ t ⁇ K.
  • the embodiments of the present application are not limited to this.
  • the above S101 to S102 are a specific implementation manner of “obtaining the channel matrix H and decomposing the channel matrix H to obtain QRP H ”.
  • the embodiments of the present application are not limited to this.
  • the process of decomposing the channel matrix to obtain QRP H may be referred to as performing a diagonal element arbitrary ratio decomposition (DEAR) on the channel matrix.
  • DEAR diagonal element arbitrary ratio decomposition
  • the data to be sent refers to data to be sent in multiple data streams corresponding to the matrix P.
  • the ratio of at least two diagonal elements of the matrix R obtained by channel matrix decomposition can be achieved as the target ratio.
  • precoding is performed by the precoding method provided in the embodiment of the present application, so that the equivalent channel gain of multiple data streams of space division multiplexing can meet a certain ratio, that is, multiple space division multiplexing can be performed.
  • the performance of the data stream is adjusted to the target ratio. Therefore, by setting the target ratio reasonably, the overall performance of the data stream corresponding to one codeword can be improved. Taking space division multiplexing 4 data streams as an example, the target ratio can be set so that the performance difference of these 4 data streams is not large, thereby improving the overall performance.
  • S102 may include:
  • the matrix ⁇ is used as the initialization matrix R 0 of the matrix R
  • the matrix U is used as the initialization matrix Q 0 of the matrix Q
  • the matrix V is used as the initialization matrix P 0 of the matrix P.
  • Step 1 According to the relationship between ⁇ k and the k- th diagonal element r k,k in the matrix R k-1 , find the diagonal elements r p,p from the matrix R k-1 ; where k ⁇ p ⁇ K, p is an integer, and ⁇ k is the above A k ⁇ ; if r k,k ⁇ ⁇ k , then r p,p ⁇ k ; if r k,k ⁇ k , then r p,p > ⁇ k .
  • r p,p can satisfy the condition "k ⁇ p ⁇ K; if r k,k ⁇ k , then r p,p ⁇ k ; if r k,k ⁇ k , then r p,p > Any element of ⁇ k ”may also be the element with the smallest value of p that satisfies this condition.
  • Step 2 Exchange the diagonal elements r k+1,k+1 and r p,p in the matrix R k-1 to obtain the matrix R re_k .
  • the embodiment of the present application does not limit the execution order of the three exchange operations in step 2.
  • Step 3 According to ⁇ k , the kth diagonal element and the k+ 1th diagonal element in the matrix R re_k , construct the matrix G 1 and the matrix G 2 ; where the matrix G 1 and the matrix G 2 make The sub-matrix formed by the intersection of the k-th, k+1-th row and the k-th, k+1-th column in (hereinafter referred to as the target sub-matrix, the target sub-matrix is a 2*2 sub-matrix) is an upper triangular matrix, and The 1st diagonal element of the sub-matrix (ie the kth diagonal element in R re_k , which is also the kth diagonal element of the matrix R k ) is ⁇ k ; Is the transposed matrix of matrix G 2 .
  • the kth diagonal element in the matrix R re_k is the kth diagonal element in the matrix R k-1 (ie r k,k ), and the k+ 1th diagonal element in the matrix R re_k is The p-th diagonal element in the matrix R k-1 (ie, r p,p ). It can be seen that step 3 can be executed after step 1 is executed. That is to say, the embodiment of the present application does not limit the execution order of step 2 and step 3.
  • Step 4 According to the formula Obtain the matrix R k .
  • the matrix R K-1 obtained after performing steps 1 to 4 at the K-1th time may be used as the matrix R
  • the matrix Q K-1 obtained after performing steps 1 to 4 at the K-1th time may be used as the matrix Q
  • the matrix P K-1 obtained after performing steps 1 to 4 at the K-1th time is taken as the matrix P.
  • each diagonal element of the matrix R satisfies the target ratio.
  • the ratio of the first to tth diagonal elements of the matrix R is the target ratio, t ⁇ K, t is an integer, and K is the number of diagonal elements of the matrix R.
  • the sending-end device may perform the above steps 1 to 4 only t-1 times.
  • the first t columns of the matrix P t-1 obtained after the t-1th time may be used as the precoding matrix.
  • the matrix G 1 and the matrix G 2 may be constructed according to the following formula: among them, ⁇ 1 is the kth diagonal element in the matrix R re_k (that is, the kth diagonal element r k,k in the matrix R k-1 ), ⁇ 2 is the k+ 1th element in the matrix R re_k Diagonal elements (ie the p-th diagonal element r p,p in the matrix R k-1 ).
  • the target sub-matrix be the first triangular matrix whose diagonal elements are ⁇ k .
  • the following formula can be obtained:
  • the right side of the equation is the target sub-matrix.
  • y is the k+ 1th diagonal element in the matrix R re_k , that is, the pth diagonal element r p,p in the matrix R k-1 .
  • the value of x is determined by the formula on the left side of the equation.
  • the optional implementation manner is only one implementation manner for constructing the target sub-matrix, and the target sub-matrix may also be constructed in other ways.
  • FIG. 4 it is an interaction schematic diagram of an information transmission method provided by an embodiment of the present application.
  • the method shown in Figure 4 includes the following steps:
  • the receiving end device sends receiving capability information to the sending end device, and the receiving capability information is used to indicate that the receiving end device supports a non-linear receiving algorithm.
  • the non-linear receiving algorithm includes SIC algorithm or MLD algorithm.
  • the reception capability information may be carried in RRC signaling, MAC signaling, or DCI.
  • the reception capability information may be carried in RRC signaling, MAC signaling, or UCI. It can be understood that, since the receiving capability information of the receiving end device usually remains unchanged for a period of time, the optional receiving capability information can usually be carried in RRC signaling or MAC signaling for transmission.
  • the receiving-end device may support one or more receiving algorithms, which may include a non-linear receiving algorithm or a linear receiving algorithm.
  • the receiving device supports MLD, SIC, minimum mean squared error (MMSE), and interference suppression combining (IRC).
  • the receiving end device only supports MMSE, etc.
  • the receiving capability information in S201 is specifically used to indicate that the receiving device supports a non-linear receiving algorithm. For example, assuming that the receiving capability information of the receiving device is carried through RRC signaling, you can pass Set a flag bit in the RRC. If the receiving device supports a non-linear receiving algorithm, set the flag position to 1. If the receiving device supports a linear receiving algorithm, set the flag position to 0. Of course, this application is implemented Examples are not limited to this.
  • the receiving capability information in S201 above is specifically used to indicate the identification information of the non-linear receiving algorithm supported by the receiving device.
  • the receiving capability information may be used to indicate that the receiving device supports MLD and SIC These two nonlinear receiving algorithms.
  • the sending-end device uses the precoding method provided in the embodiment of the present application (such as the precoding method described in FIG. 3) to precode the data to be transmitted.
  • the transmitting device may retain some inter-stream interference when pre-coding the data to be transmitted, and these inter-stream interference may be nonlinearly received by the receiving device
  • the algorithm reduces or eliminates these inter-stream interferences.
  • the matrix R obtained by channel matrix decomposition (that is, the matrix R described above) is an upper triangular matrix, not necessarily a diagonal matrix. Therefore, the sending device may use the precoding method provided in the embodiment of the present application to precode the data to be transmitted.
  • S203 The sending end device sends the pre-encoded data to be sent.
  • S203 may include: the sending-end device sends pre-encoded data to be sent through a physical downlink shared channel (physical downlink shared channel, PDSCH). Or, if the sending-end device is a terminal and the receiving-end device is a network device, S203 may include: the sending-end device sends pre-encoded data to be sent through a physical uplink shared channel (physical uplink shared channel, PDSCH).
  • a physical downlink shared channel physical downlink shared channel
  • PDSCH physical uplink shared channel
  • the sending end device sends indication information to the receiving end device, where the indication information is used to instruct the sending end device to use the precoding method provided in the embodiment of the present application (such as the precoding method described in FIG. 3) to precode the data to be sent.
  • the indication information is used to instruct the sending end device to use the precoding method provided in the embodiment of the present application (such as the precoding method described in FIG. 3) to precode the data to be sent.
  • the indication information is carried in radio resource control RRC signaling, media access control MAC signaling, or downlink control information DCI.
  • the sending end device is a terminal and the receiving end device is a network device, the indication information is carried in RRC signaling, MAC signaling, or uplink control information UCI.
  • S203 may be executed before S204, or S204 may be executed before S203, or S203 and S204 may be executed simultaneously.
  • the receiving end device uses the non-linear receiving algorithm supported by the receiving end device to receive the pre-encoded data to be sent from the sending end device according to the instruction information. For example, the received data is equalized based on the non-linear receiving algorithm supported by the receiving device, so that the data streams mixed together at the transmitting device are separated into independent data streams, and the flow is reduced or eliminated in the process Interference. Subsequently, operations such as demodulation and channel decoding can be performed on each data stream.
  • S204 to S205 are not executed, then: in one implementation, when the receiving device supports only a nonlinear receiving algorithm, it can directly use the supported receiving algorithm to receive data; in another implementation, when the receiving end When the device also supports a linear receiving algorithm, you can choose to use a nonlinear receiving algorithm to receive data by comparing the performance gain of receiving data with a nonlinear receiving algorithm and receiving data with a linear receiving algorithm.
  • the embodiments of the present application are not limited to this.
  • the method shown in FIG. 5 may be used to make the receiving social department use a non-linear receiving algorithm to receive data.
  • the matrix R obtained by the channel matrix decomposition in the precoding method provided above is an upper triangular matrix, that is to say, after encoding multiple data streams using the precoding method, it will bring a certain amount of inter-stream interference.
  • the receiving end device can cooperate with the non-linear receiving algorithm to receive data, so that the inter-stream interference can be reduced or eliminated, thereby increasing the probability of correct demodulation of multi-stream data.
  • the transmitting end device uses the precoding method provided above, a certain inter-stream interference is allowed, and this inter-stream interference can be reduced or eliminated at the receiving end device, so when this embodiment is used for information transmission , Can increase the number of space division multiplexing of multiple antenna systems, thereby providing system capacity.
  • FIG. 5 it is an interactive schematic diagram of an information transmission method provided by an embodiment of the present application.
  • the method shown in Figure 5 includes the following steps:
  • S301 The receiving end device sends receiving capability information to the sending end device, where the receiving capability information is used to indicate that the receiving end device supports a nonlinear receiving algorithm.
  • the receiving capability information is used to indicate that the receiving end device supports a nonlinear receiving algorithm.
  • the sending-end device sends indication information to the receiving-end device according to the receiving capability information, where the indication information is used to instruct the receiving-end device to use a non-linear receiving algorithm to receive data.
  • the non-linear receiving algorithm may include the SIC algorithm or the MLD algorithm.
  • the indication information is specifically used to instruct the receiving end device to use a non-linear receiving algorithm instead of a linear receiving algorithm to receive data.
  • the embodiments of the present application support the sending device to configure the receiving device whether the receiving device uses a non-linear receiving algorithm to receive data.
  • the method can be applied to a scenario where the receiving device supports a linear receiving algorithm and a nonlinear receiving algorithm. Based on the scenario, the receiving device can support one or more nonlinear receiving algorithms.
  • the indication information is specifically used to indicate which nonlinear receiving algorithm is used by the receiving end device to receive data. This method can be applied to a scenario where the receiving device supports at least two nonlinear receiving algorithms.
  • the receiving end device uses the non-linear receiving algorithm to receive data from the sending end device according to the instruction information.
  • the data is data obtained by pre-coding by the sending-end device using the pre-coding method provided in the embodiment of the present application.
  • the indication information is carried in RRC signaling, MAC signaling, or DCI. Or, if the sending end device is a terminal and the receiving end device is a network device, the indication information is carried in RRC signaling, MAC signaling, or uplink control information UCI.
  • the sending device indicates the non-linear receiving algorithm used by the receiving device by sending instruction information to the receiving device, which helps the receiving device to select a suitable receiving algorithm, thereby improving data demodulation Probability.
  • This method can be used in combination with the precoding method provided by the embodiment of the present application, thereby reducing or eliminating the inter-stream interference generated by the transmitting end device due to the precoding method provided by the embodiment of the present application, thereby improving multi-stream data The probability of correct demodulation.
  • the above mainly introduces the solutions provided by the embodiments of the present application from the perspective of a method.
  • it includes hardware structures and/or software modules corresponding to performing each function.
  • the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is performed by hardware or computer software driven hardware depends on the specific application of the technical solution and design constraints. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
  • the embodiments of the present application may divide the functional modules of the precoding apparatus, the sending end device, or the receiving end device according to the above method examples, for example, each function module may be divided corresponding to each function, or two or more functions may be integrated in In a processing module.
  • the above integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of the modules in the embodiments of the present application is schematic, and is only a division of logical functions. In actual implementation, there may be another division manner.
  • the precoding apparatus 60 may be a sending-end device (such as a network device or a terminal).
  • the precoding device 60 may be used to perform the precoding method shown in FIG. 3.
  • the precoding device 60 may include a processing unit 601 and a transmission unit 602.
  • the processing unit 601 is used to decompose the channel matrix into the product of matrix Q, matrix R and matrix P H ; where matrix P H is the conjugate transposed matrix of matrix P, matrix Q and matrix P are both unitary matrix, matrix R is the upper triangular matrix.
  • the sending unit 602 is used for precoding the data to be sent according to the matrix P. For example, referring to FIG. 3, the processing unit 601 may be used to perform S102, and the sending unit 602 may be used to perform S103.
  • the ratio of at least two diagonal elements of the matrix R is the target ratio, and the target ratio is determined based on the code rate.
  • the non-zero singular value obtained by SVD of the channel matrix and the diagonal elements in the diagonal matrix obtained by SVD of the channel matrix satisfy the following conditions:
  • ⁇ k is the k-th non-zero singular value obtained by SVD of the channel matrix
  • ⁇ k is the above A k ⁇ , and 1 ⁇ k ⁇ t ⁇ K.
  • the processing unit 601 is specifically configured to: perform SVD on the channel matrix to decompose the channel matrix into a product of the matrix U, the matrix ⁇ , and the matrix V H ; where the matrix V H is the conjugate transposed matrix of the matrix V, Matrix U and matrix V are both unitary matrices, and matrix ⁇ is a diagonal matrix; matrix U, matrix ⁇ , and matrix V H are transformed to obtain matrix Q, matrix R, and matrix P H.
  • the processing unit 601 may be used to perform S101 and S102.
  • the target ratio is the ratio of the first to tth diagonal elements in the matrix R; 1 ⁇ k ⁇ t ⁇ K, k and t are both integers, and K is the diagonal element of the matrix R Of the number.
  • the processing unit 601 performs transformation on the matrix U, the matrix ⁇ , and the matrix V H to obtain the matrix Q, the matrix R, and the matrix P H , which are specifically used for:
  • the matrix ⁇ be the initialization matrix R 0 of the matrix R.
  • Step 1 According to the relationship between ⁇ k and the k- th diagonal element r k,k in the matrix R k-1 , find the diagonal elements r p,p from the matrix R k-1 ; where k ⁇ p ⁇ K, p is an integer, and ⁇ k is the above A k ⁇ ; if r k,k ⁇ k , then r p,p ⁇ k ; if r k,k ⁇ k , then r p,p > ⁇ k ;
  • Step 2 Exchange the diagonal elements r k+1,k+1 and r p,p in the matrix R k-1 to obtain the matrix R re_k ;
  • Step 3 According to ⁇ k , the kth diagonal element and the k+ 1th diagonal element in the matrix R re_k , construct the matrix G 1 and the matrix G 2 ; where the matrix G 1 and the matrix G 2 make The sub-matrix formed by the intersection of the k-th, k+1-th row and the k-th, k+1-th column in is an upper triangular matrix, and the first diagonal element of the sub-matrix is ⁇ k ; Is the transposed matrix of matrix G 2 ;
  • Step 4 According to the formula Obtain the matrix R k .
  • the matrix R t-1 obtained after performing steps 1 to 4 at the t-1th time is taken as the matrix R.
  • the processing unit 601 performs the construction of the matrix G 1 and the matrix G 2 according to ⁇ k , the kth diagonal element and the k+ 1th diagonal element in the matrix R re_k , which are specifically used to:
  • the matrix G 1 and matrix G 2 are constructed as follows: among them, ⁇ 1 is R re_k matrix in the k-th diagonal element, ⁇ 2 is the matrix R re_k k + 1-th diagonal element.
  • the above processing unit 601 may be implemented by the processor 201 or the processor 207 in FIG. 2.
  • the sending unit 602 may be implemented through the communication interface 204 in FIG. 2.
  • FIG. 7 it is a schematic structural diagram of a sending end device 70 provided by an embodiment of the present application.
  • the sending end device 70 may be used to perform the steps performed by the sending end device in the method of FIG. 4 or FIG. 5.
  • the sending end device 70 may include a receiving unit 701, a processing unit 702, and a sending unit 703.
  • the receiving unit 701 is used to receive receiving capability information from the receiving end device, and the receiving capability information is used to instruct the receiving end device to support the nonlinear receiving algorithm.
  • the processing unit 702 is configured to pre-code the data to be sent according to the receiving capability information, using any of the precoding methods provided in the embodiments of the present application (such as the precoding method shown in FIG. 3).
  • the sending unit 703 is used to send the pre-encoded data to be sent. For example, referring to FIG. 4, the receiving unit 701 may be used to perform the receiving step corresponding to S201, the processing unit 702 may be used to perform S202, and the sending unit 703 may be used to perform S203.
  • the sending unit 703 is further configured to send indication information to the receiving end device.
  • the indication information is used to instruct the sending end device to use any of the precoding methods provided in the embodiments of the present application (such as the precoding shown in FIG. 3).
  • Method Pre-encode the data to be sent.
  • the sending unit 703 may be used to execute S204.
  • the sending unit 703 is further configured to send indication information to the receiving end device, where the indication information is used to instruct the receiving end device to use the non-linear receiving algorithm to receive the data to be sent.
  • the sending unit 703 may be used to execute S302.
  • any one of the above indication information is carried in RRC signaling, MAC signaling, or DCI; or, if the sending end device is a terminal and receiving If the end device is a network device, any of the above indication information is carried in RRC signaling, MAC signaling, or UCI.
  • the non-linear receiving algorithm includes a SIC algorithm or algorithm.
  • the above processing unit 702 may be implemented by the processor 201 or the processor 207 in FIG. 2.
  • the receiving unit 701 and the sending unit 703 may be implemented through the communication interface 204 in FIG. 2.
  • FIG. 8 it is a schematic structural diagram of a receiving end device 80 provided by an embodiment of the present application.
  • the receiving end device 80 may be used to perform the steps performed by the sending end device in the method of FIG. 4 or FIG. 5.
  • the receiving device 80 may include a receiving unit 801 and a processing unit 802.
  • the sending unit 803 may also be included.
  • the receiving unit 801 is used to receive indication information sent by the sending end device, and the indication information is used to instruct the sending end device to adopt any of the precoding methods provided in the embodiments of the present application (as shown in FIG. Precoding method) precoding the data to be sent.
  • the processing unit 802 is configured to receive the pre-encoded data to be sent using a non-linear receiving algorithm supported by the receiving device according to the instruction information. For example, referring to FIG. 4, the receiving unit 801 may be used to perform the receiving step corresponding to S204, and the processing unit 802 may be used to perform S205.
  • the sending unit 803 is used to send receiving capability information to the sending end device, and the receiving capability information is used to indicate that the receiving end device supports a non-linear receiving algorithm.
  • the sending unit 803 may be used to perform S201.
  • the nonlinear receiving algorithm includes SIC algorithm or MLD algorithm.
  • the receiving unit 801 is used to receive indication information sent by the sending end device, and the indication information is used to instruct the receiving end device to use a non-linear receiving algorithm to receive data.
  • the processing unit 802 is used to receive data from the sending-end device using a nonlinear receiving algorithm according to the instruction information.
  • the receiving unit 801 may be used to perform the receiving step corresponding to S302, and the processing unit 802 may be used to perform S303.
  • the sending unit 803 is used to send receiving capability information to the sending end device, and the receiving capability information is used to indicate that the receiving end device supports a nonlinear receiving algorithm.
  • the sending unit 803 may be used to perform S301.
  • the nonlinear receiving algorithm includes SIC algorithm or MLD algorithm.
  • the above processing unit 802 may be implemented by the processor 201 or the processor 207 in FIG. 2.
  • the receiving unit 801 and the sending unit 803 may be implemented through the communication interface 204 in FIG. 2.
  • An embodiment of the present application further provides a communication system.
  • the communication system may include any precoding device 60 provided above, and a receiving end device that receives data pre-encoded by the precoding device 60.
  • An embodiment of the present application further provides a communication system.
  • the communication system may include any one of the sending end devices 70 provided above, and the corresponding receiving end device 80 provided above.
  • An embodiment of the present application further provides a communication system, which may include any one of the receiving end devices 80 in the second embodiment provided above, and communicate with the receiving end device 80 to complete the configuration of the receiving end The sending device of the receiving algorithm used by the device.
  • the computer program product includes one or more computer instructions.
  • the computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable devices.
  • the computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions can be transmitted from a website, computer, server, or data center via wire (e.g.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device including one or more servers and data centers that can be integrated with the medium.
  • Usable media may be magnetic media (eg, floppy disk, hard disk, magnetic tape), optical media (eg, DVD), or semiconductor media (eg, solid state disk (SSD)), etc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Databases & Information Systems (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请公开了预编码方法和装置及信息传输方法和装置，涉及通信技术领域，有助于提高同一个码字对应的多个数据流的整体性能。预编码方法包括：将信道矩阵分解成矩阵Q、矩阵R和矩阵PH的乘积；其中，矩阵PH是矩阵P的共轭转置矩阵，矩阵Q和矩阵P均是酉矩阵，矩阵R是上三角矩阵；根据矩阵P对待发送数据进行预编码。

Description

预编码方法和装置及信息传输方法和装置
本申请要求于2018年12月26日提交国家知识产权局、申请号为201811603975.8、申请名称为“预编码方法和装置及信息传输方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及预编码方法和装置及信息传输方法和装置。
背景技术
多入多出(multiple input multiple output，MIMO)系统通常使用预编码(precoding)技术来改善信道，以提升空间复用(spatial multiplexing)的效果。预编码技术使用与信道相匹配的预编码矩阵来对空间复用的数据流进行处理，借此来实现对信道的预编码，提升数据流的接收质量。
目前，通常通过对信道矩阵进行奇异值分解(singular value decomposition，SVD)的方法获得预编码矩阵。然而，现有通信标准如3GPP 5G NR规定：对一个终端来说，当空分复用的数据流数小于或等于4时，均采用一个码字(codeword)，即采用相同的调制编码方式(modulation and coding scheme，MCS)。因此，每个数据流的等效信道增益正比于信道矩阵经SVD得到的奇异值，这可能导致不同数据流的性能差异较大。以空分复用4个数据流为例，通常，第3个和第4个数据流的性能较差，这会拖低一个码字对应的数据流的整体性能。
发明内容
本申请实施例提供一种预编码方法和装置及信息传输方法和装置，有助于提高同一个码字对应的多个数据流的整体性能。
第一方面，本申请实施例提供了一种预编码方法，包括：将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积；其中，矩阵P H是矩阵P的共轭转置矩阵，矩阵Q和矩阵P均是酉矩阵，矩阵R是上三角矩阵；根据矩阵P对待发送数据进行预编码。其中，该至少两个对角线元素可以是矩阵R中的任意多个对角线元素。该方法的执行主体可以是发送端设备(如网络设备或终端)。基于该技术方案进行预编码，有助于使空分复用的多个数据流的等效信道增益(具体可以体现为矩阵R的对角线元素)满足某一比例，通过合理设置该比例，有助于提高一个码字对应的数据流的整体性能。以空分复用4个数据流为例，可以通过设置空分复用的多个数据流的等效信道增益，可以使得这4个数据流的性能差异不大，从而提高整体性能。
在一种可能的设计中，矩阵R的至少两个对角线元素之比为目标比例，该目标比例是基于码率所确定的。码率越大时，目标比例越接近1：1:…:1。这样，有助于提高同一码字对应的多个数据流的整体性能。
在一种可能的设计中，如果矩阵R的对角线元素之比r 1,1:r 2,2:…:r k,k:…:r t,t＝A 1:A 2:…:A k:…:A t，r k,k是矩阵R的第k个对角线元素，1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数；那么r k,k＝A kθ， θ是基于该信道矩阵经SVD得到的非零奇异值所确定的。也就是说，上述“矩阵R的至少两个对角线元素”具体为矩阵R中的第1至第t个元素。目标比例具体是A 1:A 2:…:A k:…:A t。
在一种可能的设计中，
Figure PCTCN2019128474-appb-000001
其中，λ j是该信道矩阵经SVD得到的第j个非零奇异值，j＝1、2、……t。∏表示求积运算，
Figure PCTCN2019128474-appb-000002
表示对A 1、A 2……A t进行求积运算。
在一种可能的设计中，t≥2，该信道矩阵经SVD得到的非零奇异值与该信道矩阵经SVD得到的对角矩阵中的对角线元素之间满足如下条件：
Figure PCTCN2019128474-appb-000003
其中，λ k是该信道矩阵经SVD得到的第k个非零奇异值，σ k是上述A kθ，1≤k≤t≤K。该可能的设计提供了一种目标比例所满足的条件的具体实现方式，当然本申请实施例不限于此。
在一种可能的设计中，将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积，包括：对该信道矩阵进行SVD，以将该信道矩阵分解成矩阵U、矩阵∑和矩阵V H的乘积；其中，矩阵V H是矩阵V的共轭转置矩阵，矩阵U和矩阵V均是酉矩阵，矩阵∑是对角矩阵；对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H。
在一种可能的设计中，目标比例是矩阵R中的第1至第t个对角线元素之比；1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数。基于此，对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H，包括：
将矩阵∑作为矩阵R的初始化矩阵R 0；
遍历k＝1、2、……、t-1中的每个值，1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数；执行以下步骤1～4：
步骤1：根据σ k和矩阵R k-1中的第k个对角线元素r k, k的大小关系，从矩阵R k-1中寻找对角线元素r p,p；其中，k＜p≤K，p是整数，σ k是上述A kθ；若r k,k≥σ k，则r p,p≤σ k；若r k,k＜σ k，则r p,p＞σ k；
步骤2：将矩阵R k-1中的对角线元素r k+1,k+1与r p,p交换位置，获得矩阵R re_k；
步骤3：根据σ k、矩阵R re_k中的第k个对角线元素和第k+1个对角线元素，构建矩阵G 1和矩阵G 2；其中，矩阵G 1和矩阵G 2使得
Figure PCTCN2019128474-appb-000004
中的第k、k+1行与第k、k+1列的交集构成的子矩阵为上三角矩阵，且子矩阵的第1个对角线元素为σ k；
Figure PCTCN2019128474-appb-000005
是矩阵G 2的转置矩阵；
步骤4：根据公式
Figure PCTCN2019128474-appb-000006
获得矩阵R k；
将第t-1次执行步骤1～4之后获得的矩阵R t-1作为矩阵R。
在一种可能的设计中，根据σ k、矩阵R re_k中的第k个对角线元素和第k+1个对 角线元素，构建矩阵G 1和矩阵G 2，包括：根据如下公式构建矩阵G 1和矩阵G 2：
Figure PCTCN2019128474-appb-000007
其中，
Figure PCTCN2019128474-appb-000008
δ 1是矩阵R re_k中的第k个对角线元素，δ 2是矩阵R re_k中的第k+1个对角线元素。该可能的设计提供了一种构建矩阵G 1和矩阵G 2：的具体实现方式。
在一种可能的设计中，对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H，还包括：将矩阵U作为矩阵Q的初始化矩阵Q 0，并将矩阵V分别矩阵P的初始化矩阵P 0；在第k次执行步骤1～4的过程中：交换矩阵Q k-1中的第k+1列元素与第p列元素，获得矩阵Q re_k，并交换矩阵P k-1中的第k+1列元素与第p列元素，获得矩阵P re_k；根据公式Q k＝Q re_kG 2获得矩阵Q k，并根据公式P k＝P re_kG 1获得矩阵P k；将第t-1次执行步骤1～4之后获得的矩阵Q t-1作为矩阵Q，并将第K-1次执行步骤1～4之后获得的矩阵P t-1作为矩阵P。
第二方面，本申请实施例提供了一种信息传输方法，包括：发送端设备接收来自接收端设备的接收能力信息，该接收能力信息用于指示接收端设备支持非线性接收算法；发送端设备根据该接收能力信息，采用上述第一方面或第一方面的任一种可能的设计提供的预编码方法对待发送数据进行预编码；发送端设备发送预编码后的待发送数据。上述第一方面或第一方面的任一种可能的设计提供的预编码方法中信道矩阵分解得到的矩阵R是上三角矩阵，也就是说，采用该预编码方法对多个数据流进行编码后，会带来一定的流间干扰。结合本技术方案，接收端设备可以配合采用非线性接收算法接收数据，从而减小或消除这些流间干扰，提高多流数据的正确解调的概率。另外，正因为发送端设备采用上文提供的预编码方法时，允许一定的流间干扰，而这种流间干扰可以在接收端设备被减小或消除，因此采用本技术方案进行信息传输时，可以提高多天线系统的空分复用的流数，从而提供系统容量。
在一种可能的设计中，该方法还包括：发送端设备向接收端设备发送指示信息，该指示信息用于指示发送端设备采用上述第一方面或第一方面的任一种可能的设计提供的预编码方法对待发送数据进行预编码。这样，有助于接收端设备采用该接收端设备所支持的非线性接收算法接收预编码后的待发送数据，从而减小或消除这些流间干扰，提高多流数据的正确解调的概率；并且，有助于提高多天线系统的空分复用的流数，从而提供系统容量。
在一种可能的设计中，该方法还包括：发送端设备向接收端设备发送指示信息，该指示信息用于指示接收端设备采用非线性接收算法接收待发送数据。这样，有助于接收端设备选择合适的接收算法，从而提高数据的解调概率。
在一种可能的设计中，若发送端设备是网络设备，且接收端设备是终端，则上述任一种指示信息携带在无线资源控制(radio resource control，RRC)信令、媒体接入控制(media access control，MAC)信令或下行控制信息(downlink control information，DCI)中。
在一种可能的设计中，若发送端设备是终端，且接收端设备是网络设备，则上述任一种指示信息携带在RRC信令、MAC信令或上行控制信息(uplink control information，UCI)中。
在一种可能的设计中，非线性接收算法包括串行干扰消除(successive interference cancellation，SIC)算法或最大似然检测(maximum likelihood detection，MLD)算法等。
第三方面，本申请实施例提供了一种信息传输方法，包括：接收端设备接收发送端设备发送的指示信息，指示信息用于指示发送端设备采用上述第一方面或第一方面的任一种可能的设计提供的预编码方法对待发送数据进行预编码；接收端设备根据该指示信息，采用接收端设备所支持的非线性接收算法接收预编码后的待发送数据。该技术方案的有益效果可以参考上述第二方面中对应的技术方案的有益效果。
在一种可能的设计中，该方法还包括：接收端设备向发送端设备发送接收能力信息，该接收能力信息用于指示接收端设备支持非线性接收算法。例如，非线性接收算法包括SIC算法或MLD算法。
第四方面，本申请实施例提供了一种信息传输方法，包括：接收端设备接收发送端设备发送的指示信息，指示信息用于指示接收端设备采用非线性接收算法接收数据；接收端设备根据指示信息，采用非线性接收算法接收来自发送端设备的数据。该技术方案的有益效果可以参考上述第二方面中对应的技术方案的有益效果。
在一种可能的设计中，本技术方案与上述第一方面或第一方面的任一种可能的设计提供的预编码方法可以结合使用，从而减小或消除发送端设备因采用该预编码方法进行预编码而产生的流间干扰，从而提高多流数据的正确解调的概率。
在一种可能的设计中，在接收端设备接收发送端设备发送的指示信息之前，该方法还包括：接收端设备向发送端设备发送接收能力信息，接收能力信息用于指示接收端设备支持非线性接收算法。例如，非线性接收算法包括SIC算法或MLD算法。
第五方面，本申请实施例提供了一种预编码装置，用于执行第一方面或第一方面任一种可能的设计提供的预编码方法。该预编码装置具体可以是发送端设备(如网络设备或终端)，或者是一个芯片。
在一种可能的设计中，该预编码装置包括用于执行第一方面或第一方面任一种可能的设计提供的预编码方法的各个模块。
在另一种可能的设计中，该预编码装置包括存储器和处理器，存储器用于用于存储计算机执行指令，该装置运行时，该处理器执行存储器中的计算机执行指令以利用该装置中的硬件资源执行第一方面或第一方面任一种可能的设计所提供的预编码方法的操作步骤。
第六方面，本申请实施例提供了一种发送端设备，用于执行第二方面或第二方面任一种可能的设计提供的信息传输方法。该发送端设备具体可以是网络设备或终端，或是一个芯片。
在一种可能的设计中，该发送端设备包括用于执行第二方面或第二方面任一种可能的设计提供的信息传输方法的各个模块。
在另一种可能的设计中，该发送端设备包括存储器和处理器，存储器用于用于存储计算机执行指令，该发送端设备运行时，该处理器执行存储器中的计算机执行指令以利用该发送端设备中的硬件资源执行第二方面或第二方面任一种可能的设计所提供的信息传输方法的操作步骤。
第七方面，本申请实施例提供了一种接收端设备，用于执行第三方面或第三方面任一种可能的设计提供的信息传输方法。该接收端设备具体可以是网络设备或终端，或是一个芯片。
在一种可能的设计中，该接收端设备包括用于执行第三方面或第三方面任一种可能的设计提供的信息传输方法的各个模块。
在另一种可能的设计中，该接收端设备包括存储器和处理器，存储器用于用于存储计算机执行指令，该接收端设备运行时，该处理器执行存储器中的计算机执行指令以利用该接收端设备中的硬件资源执行第三方面或第三方面任一种可能的设计所提供的信息传输方法的操作步骤。
第八方面，本申请实施例提供了一种接收端设备，用于执行第四方面或第四方面任一种可能的设计提供的信息传输方法。该接收端设备具体可以是网络设备或终端，或是一个芯片。
在一种可能的设计中，该接收端设备包括用于执行第四方面或第四方面任一种可能的设计提供的信息传输方法的各个模块。
在另一种可能的设计中，该接收端设备包括存储器和处理器，存储器用于用于存储计算机执行指令，该接收端设备运行时，该处理器执行存储器中的计算机执行指令以利用该接收端设备中的硬件资源执行第四方面或第四方面任一种可能的设计所提供的信息传输方法的操作步骤。
本申请实施例还提供了一种计算机可读存储介质，其上储存有计算机程序，当该计算机程序在计算机上运行时，使得计算机执行上述第一方面或第一方面任一种可能的设计提供的预编码方法的操作步骤。
本申请实施例还提供了一种计算机可读存储介质，其上储存有计算机程序，当该计算机程序在计算机上运行时，使得计算机执行上述第二至第四方面或其任一种可能的设计提供的信息传输方法的操作步骤。
本申请实施例还提供了一种计算机程序产品，当其在计算机上运行时，使得第一方面或第一方面任一种可能的设计提供的预编码方法的操作步骤被执行。
本申请实施例还提供了一种计算机程序产品，当其在计算机上运行时，使得第二至第四方面或其任一种可能的设计提供的信息传输方法的操作步骤被执行。
可以理解的是，上述提供的任一种预编码装置、发送端设备、接收端设备或计算机可读存储介质或计算机程序产品等均用于执行上文所提供的对应的方法，因此，其所能达到的有益效果可参考对应的方法中的有益效果，此处不再赘述。
附图说明
图1为可适用于本申请实施例的一种通信系统的示意图；
图2为可适用于本申请实施例的一种通信设备的硬件结构示意图；
图3为本申请实施例提供的一种预编码方法的流程示意图；
图4为本申请实施例提供的一种信息传输方法的交互示意图；
图5为本申请实施例提供的一种信息传输方法的交互示意图；
图6为本申请实施例提供的一种预编码装置的结构示意图；
图7为本申请实施例提供的一种发送端设备的结构示意图；
图8为本申请实施例提供的一种接收端设备的结构示意图。
具体实施方式
本申请实施例提供的技术方案可以应用于各种通信系统，如5G通信系统，未来演进系统或多种通信融合系统等中，也可以应用于在现有通信系统等。本申请提供的技术方案的应用场景可以包括多种，例如，机器对机器(machine to machine，M2M)、宏微通信、增强型移动互联网(enhanced mobile broadband，eMBB)、超高可靠性与超低时延通信(ultra reliable&low latency communication，uRLLC)以及海量物联网通信(massive machine type communication，mMTC)等场景。这些场景可以包括但不限于：终端与终端之间的通信场景，网络设备与网络设备之间的通信场景，网络设备与终端之间的通信场景等。下文中均是以应用于网络设备和终端通信的场景中为例进行说明的。
如图1所示，为可适用于本申请实施例的一种通信系统的示意图，该通信系统可以包括一个或多个网络设备10(仅示出了1个)以及与每一网络设备10连接的一个或多个终端20。图1仅为示意图，并不构成对本申请提供的技术方案的适用场景的限定。
网络设备10可以是传输接收节点(transmission reception point，TRP)、基站、中继站或接入点等。网络设备10可以是5G通信系统中的网络设备或未来演进网络中的网络设备；还可以是可穿戴设备或车载设备等。另外还可以是：全球移动通信系统(global system for mobile communication，GSM)或码分多址(code division multiple access，CDMA)网络中的基站收发信台(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)中的NB(NodeB)，还可以是长期演进(long term evolution，LTE)中的eNB或eNodeB(evolutional NodeB)。网络设备10还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器。
终端20可以是用户设备(user equipment，UE)、客户端设备(customer premise equipment，CPE)、接入终端、UE单元、UE站、移动站、移动台、远方站、远程终端、移动设备、UE终端、无线通信设备、UE代理或UE装置等。接入终端可以是蜂窝电话、无绳电话、会话发起协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字处理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，5G网络中的终端或未来演进的公共陆地移动网络(public land mobile network，PLMN)网络中的终端等。
图1中的各网元均可以通过图2中的通信设备200来实现。该通信设备200包括至少一个处理器201，通信线路202，存储器203以及至少一个通信接口204。
处理器201可以是一个通用中央处理器(central processing unit，CPU)，微处理器，特定应用集成电路(application-specific integrated circuit，ASIC)，或一个或多个用于控制本申请方案程序执行的集成电路。
通信线路202可包括一通路，在上述组件之间传送信息。
通信接口204，使用任何收发器一类的装置，用于与其他设备或通信网络通信， 如以太网，RAN，无线局域网(wireless local area networks，WLAN)等。
存储器203可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、只读光盘(compact disc read-only memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器可以是独立存在，通过通信线路202与处理器相连接。存储器也可以和处理器集成在一起。本申请实施例提供的存储器通常可以具有非易失性。其中，存储器203用于存储执行本申请方案的计算机执行指令，并由处理器201来控制执行。处理器201用于执行存储器203中存储的计算机执行指令，从而实现本申请下述实施例提供的方法。
可选的，本申请实施例中的计算机执行指令也可以称之为应用程序代码，本申请实施例对此不作具体限定。
在具体实现中，作为一种实施例，通信设备200可以包括多个处理器，例如图2中的处理器201和处理器207。这些处理器中的每一个可以是一个单核(single-CPU)处理器，也可以是一个多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
在具体实现中，作为一种实施例，通信设备200还可以包括输出设备205和输入设备206。输出设备205和处理器201通信，可以以多种方式来显示信息。例如，输出设备205可以是液晶显示器(liquid crystal display，LCD)，发光二级管(light emitting diode，LED)显示设备，阴极射线管(cathode ray tube，CRT)显示设备，或投影仪(projector)等。输入设备206和处理器201通信，可以以多种方式接收用户的输入。例如，输入设备206可以是鼠标、键盘、触摸屏设备或传感设备等。
需要说明的是，本申请实施例提供的任一种技术方案均可以应用于下行传输场景中，也可以应用于上行传输场景中。应用于下行传输场景中时，发送端设备可以是网络设备，接收端设备可以是终端。应用图2中类似结构的设备。本申请实施例不限定通信设备200的类型。
本申请实施例提供的技术方案可以应用于下行传输场景中，也可以应用于上行传输场景中。应用于下行传输场景中时，发送端设备可以是网络设备，接收端设备可以是终端。应用于上行传输场景中时，发送端设备可以是终端，接收端设备以是网络设备。对于以下任一实施例来说，当发送端设备(或接收端设备)被替代为网络设备后，该实施例中所涉及到的网络设备与该被替代后的网络设备可以表示同一网络设备。当发送端设备(或接收端设备)被替代为终端后，该实施例中所涉及到的终端与该被替代后的终端可以表示同一终端，在此统一说明，下文不再赘述。
本申请实施例提供的技术方案可以应用于时分双工(time division duplexing，TDD)系统中，也可以应用于频分双工(frequency division duplex)系统中。
本申请实施例提供的技术方案均是针对网络设备调度一个终端，且以该终端空分 复用多个数据流为例进行说明的。并且，本申请实施例不限定该终端与其他终端通过何种方式复用传输资源(如时频资源或空间资源)。
需要说明的是，如果不加说明，本申请实施例中所涉及的矩阵的对角线元素均是指该矩阵的主对角线上的元素，在此统一说明，下文不再赘述。
如图3所示，为本申请实施例提供的一种预编码方法的流程示意图。本实施例的执行主体是发送端设备。图3所示的方法可以包括如下步骤：
S101：获取信道矩阵H，并对该信道矩阵H进行SVD，以将该信道矩阵分解成矩阵U、矩阵∑和矩阵V H的乘积，即H＝U∑V H。矩阵V H是矩阵V的共轭转置矩阵，矩阵U和矩阵V均是酉矩阵(unitary matrix)，矩阵∑是对角矩阵(diagonal matrix)。S101的具体实现过程可以参考现有技术，此处不再赘述。
若n阶复矩阵A满足A HA＝AA H＝E，则矩阵A是酉矩阵。A H是矩阵A的共轭转置矩阵。E是单位矩阵。
对角矩阵是一个主对角线之外的元素都为0的矩阵，对角线上的元素可以为0或非0值。
S102：对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H，以使得H＝QRP H。其中，矩阵P H是矩阵P的共轭转置矩阵，矩阵Q和矩阵P均是酉矩阵，矩阵R是上三角矩阵(upper triangular matrix)。
上三角矩阵是主对角线以下都是零的方阵。
矩阵P是预编码矩阵。通常，预编码矩阵中的一个列向量对应一个数据流，该列向量用于对该数据流中的数据进行预编码。基于此，应用于本申请实施例提供的技术方案时，作为一个示例，预编码矩阵P的列数可以是本次调度周期内网络设备所确定的针对该终端的数据流数。此处的列向量可以替换为行向量，相应地，列数可以替换为行数。
预编码矩阵P对应的所有数据流可以对应同一个码字，也可以对应多个不同的码字。另外，本申请实施例不限定同一码字对应的数据流的个数，例如在5G NR协议中规定当数据流数小于或等于4时，均使用同一码字。
矩阵R的每个对角线元素的值表示一个数据流的等效信道增益。
可选的，矩阵R的至少两个对角线元素之比为目标比例，该目标比例是基于码率(code rate)所确定的。其中，码率是信道编译码里面的概念，用于表示信道编码的冗余度，码率取值在0到1之间。通常，码率越小，信道编码的冗余度越高；码率越大，编码的冗余度低。
可选的，码率越大时，目标比例越接近1：1:…:1,即A1、A2……与At的值越接近。同理，码率越小，目标比例越偏离1：1:…:1，即A1、A2……与At的值相差越大。这样，有助于提高同一码字对应的多个数据流的整体性能。
其中，该“至少两个对角线元素”可以是矩阵R的任意多个对角线元素，可选的，该“至少两个对角线元素”是矩阵R中的第1至第t个对角线元素，t≤K，K是矩阵R的对角线元素的个数。t和K均是整数。下文中均以该至少两个对角线元素是矩阵R中的第1至第t个对角线元素为例进行说明。
示例的，如果矩阵R的第1个至第t个对角线元素之比为： r 1,1:r 2,2:…:r k,k:…:r t,t＝A 1:A 2:…:A k:…:A t，其中，r k,k是矩阵R的第k个对角线元素，1≤k≤t，k是整数，则r k,k＝A kθ，θ是基于信道矩阵H经SVD得到的非零奇异值所确定的。例如，θ是基于信道矩阵H经SVD得到的前t个非零奇异值之积的平均值即
Figure PCTCN2019128474-appb-000009
得到的，其中，λ j是信道矩阵H经SVD得到的第j个非零奇异值，j＝1、2、……t。例如，
Figure PCTCN2019128474-appb-000010
当然本申请实施例不限于此。
在本申请的一些实施例中，矩阵R的所有对角线元素之比为一个目标比例。即上述t＝K。
本申请实施例对该目标比例的获取方式不进行限定，例如可以基于单码字对应的多个数据流的整体性能来确定。
本申请实施例对目标比例的获取方式不进行限定，例如可以是预定义的，或者是发送端设备根据信道译码器模型确定的，其中，在不同码率(code rate)下，目标比例不同。
可选的，信道矩阵H经SVD得到的非零奇异值与信道矩阵H经SVD得到的对角矩阵(即矩阵∑)中的对角线元素之间满足如下条件：
Figure PCTCN2019128474-appb-000011
其中，λ k是信道矩阵H经SVD得到的第k个非零奇异值，σ k是上述A kθ，1≤k≤t≤K。当然，本申请实施例不限于此。
上述S101～S102是“获取信道矩阵H，并将该信道矩阵H分解得到QRP H”的一种具体实现方式。当然具体实现时，本申请实施例不限于此。本申请实施例中，可以将信道矩阵分解得到QRP H的过程称为是对信道矩阵进行对角元任意比例分解(diagonal element arbitary ratio decomposition，DEAR)。
S103：根据矩阵P对待发送数据进行预编码。其中，待发送数据是指属于矩阵P对应的多个数据流中的待发送数据。
本申请实施例提供的预编码方法中，可以实现信道矩阵分解得到的矩阵R的至少两个对角线元素之比为目标比例。这样，通过本申请实施例提供的预编码方法进行预编码，可以使空分复用的多个数据流的等效信道增益满足某一比例，也就是说，可以将空分复用的多个数据流的性能调节为目标比例，因此，通过合理设置该目标比例，即可提高一个码字对应的数据流的整体性能。以空分复用4个数据流为例，可以通过设置目标比例，使得这4个数据流的性能差异不大，从而提高整体性能。
在一些实现方式中，假设矩阵R中的K个对角线元素满足目标比例，即t＝K，那么，S102可以包括：
首先，将矩阵∑作为矩阵R的初始化矩阵R 0，将矩阵U作为矩阵Q的初始化矩阵Q 0，并将矩阵V作为矩阵P的初始化矩阵P 0。
其次，通过将σ k赋值给矩阵R k-1中的第k个对角线元素r k,k，并遍历k＝1、2、……、 K-1中的每个值，其中，σ k是上述A kθ，从而实现矩阵R的对角线元素为A 1θ、A 2θ、……、A Kθ，也就是说，实现矩阵R的各对角线元素满足目标比例A 1:A 2:…:A K。并且，在遍历k＝1、2、……、K-1中的每个值的过程中，通过实现第k、k+1行与第k、k+1列的交集构成的子矩阵为上三角矩阵，从而获得使得等式H＝QRP H成立的矩阵R(标记为矩阵R k)、矩阵Q(标记为矩阵Q k)和矩阵P(标记为矩阵P k)。
可以理解的是，k＝K-1时所获得的R K-1、Q K-1和P K-1分别为矩阵R、矩阵Q和矩阵P。
可选的，遍历k＝1、2、……、K-1中的每个值所执行的步骤可以包括以下步骤1～4：
步骤1：根据σ k和矩阵R k-1中的第k个对角线元素r k,k的大小关系，从矩阵R k-1中寻找对角线元素r p,p；其中，k＜p≤K，p是整数，σ k是上述A kθ；若r k,k ≥σ k，则r p,p≤σ k；若r k,k＜σ k，则r p,p＞σ k。
其中，r p,p可以是满足条件“k＜p≤K；若r k,k≥σ k，则r p,p≤σ k；若r k,k＜σ k，则r p,p＞σ k”的任意一个元素，也可以是满足该条件的p的取值最小的元素。
步骤2：交换矩阵R k-1中的对角线元素r k+1,k+1与r p,p，获得矩阵R re_k。交换矩阵Q k-1中的第k+1列元素与第p列元素，获得矩阵Q re_k；交换矩阵P k-1中的第k+1列元素与第p列元素，获得矩阵P re_k。
假设r k+1,k+1＝a，r p,p＝b，也就是说，矩阵R k-1中的第r+1个对角线元素是a，第p个对角线元素是b，则交换r k+1,k+1与r p,p之后得到：r k+1,k+1＝b，r p,p＝a，也就是说，矩阵R re_k中的第r+1个对角线元素是b，第p个对角线元素是a。同理，可以获得交换两列元素的含义。可以理解的是，交换一个矩阵中的元素(包括两个元素或两列元素等)，可以通过将该矩阵乘以一个“交换矩阵”得到。其具体实现方式可以参考现有技术，此处不再赘述。
本申请实施例对步骤2中的三个交换操作的执行顺序不进行限定。
执行步骤1和步骤2中的“交换矩阵R k-1中的对角线元素r k+1,k+1与r p,p”的原理为：由于本次执行步骤1～4的目的是将σ k赋值给矩阵R k-1中的元素r k,k，且保证H＝Q kR kP k H，因此，如果r k,k≥σ k，则通过使得矩阵R k中第k+1个对角线元素小于或等于σ k，有助于实现H＝Q kR kP k H；同理，如果r k,k＜σ k，则通过使得矩阵R k中第k+1个对角线元素大于σ k，有助于实现H＝Q kR kP k H。执行步骤2中的“交换矩阵Q k-1中的第k+1列元素与第p列元素；以及交换矩阵P k-1中的第k+1列元素与第p列元素”有助于实现H＝Q kR kP k H。
步骤3：根据σ k、矩阵R re_k中的第k个对角线元素和第k+1个对角线元素，构建矩阵G 1和矩阵G 2；其中，矩阵G 1和矩阵G 2使得
Figure PCTCN2019128474-appb-000012
中的第k、k+1行与第k、k+1列的交集构成的子矩阵(下文中称为目标子矩阵，目标子矩阵是一个2*2的子矩阵)为上三角矩阵，且子矩阵的第1个对角线元素(即R re_k中的第k个对角线元素，该元素也是矩阵R k的第k个对角线元素)为σ k；
Figure PCTCN2019128474-appb-000013
是矩阵G 2的转置矩阵。
矩阵R re_k中的第k个对角线元素是矩阵R k-1中的第k个对角线元素(即r k,k)，矩阵R re_k中的第k+1个对角线元素是矩阵R k-1中的第p个对角线元素(即r p,p)。由此可知，在执行步骤1之后即可执行步骤3。也就是说，本申请实施例不限定步骤2 和步骤3的执行顺序。
步骤4：根据公式
Figure PCTCN2019128474-appb-000014
获得矩阵R k。根据公式Q k＝Q re_kG 2，获得矩阵Q k。根据公式P k＝P re_kG 1，获得矩阵P k。
后续，可以将第K-1次执行步骤1～4之后获得的矩阵R K-1作为矩阵R，将第K-1次执行步骤1～4之后获得的矩阵Q K-1作为矩阵Q，以及将第K-1次执行步骤1～4之后获得的矩阵P K-1作为矩阵P。
可以理解的是，上述对S102的具体实现方式的说明均是基于为了实现矩阵R的各对角线元素满足目标比例为例进行说明的。实际实现时，如果要实现矩阵R的第1个至第t个对角线元素之比是目标比例，t≤K，t是整数，K是矩阵R的对角线元素的个数，那么，发送端设备可以仅执行t-1次上述步骤1～4，可选的，可以将第t-1次的之后获得的矩阵P t-1的前t列作为预编码矩阵。
可选的，在执行上述步骤3时，可以根据如下公式构建矩阵G 1和矩阵G 2：
Figure PCTCN2019128474-appb-000015
其中，
Figure PCTCN2019128474-appb-000016
δ 1是矩阵R re_k中的第k个对角线元素(即矩阵R k-1中的第k个对角线元素r k,k)，δ 2是矩阵R re_k中的第k+1个对角线元素(即矩阵R k-1中的第p个对角线元素r p,p)。
以下，分析该可选的实现方式中，构建矩阵G 1和矩阵G 2的合理性：
为了使得目标子矩阵是第1个对角线元素为σ k的上三角矩阵。利用Givens旋转，可以得到如下公式：
Figure PCTCN2019128474-appb-000017
其中，该等式右侧为目标子矩阵。y是矩阵R re_k中的第k+1个对角线元素，即矩阵R k-1中的第p个对角线元素r p,p。x的取值由等式左侧的公式所确定的。
基于此可知，根据σ k、矩阵R re_k中的第k个对角线元素(即δ 1)和第k+1个对角线元素(即δ 2)，构建
Figure PCTCN2019128474-appb-000018
可以构建得到目标子矩阵。
可以理解的是，该可选的实现方式，仅为构建目标子矩阵的一种实现方式，还可以通过其他方式构建目标子矩阵。
如图4所示，为本申请实施例提供的一种信息传输方法的交互示意图。图4所示的方法包括如下步骤：
S201：接收端设备向发送端设备发送接收能力信息，该接收能力信息用于指示该接收端设备支持非线性接收算法。
例如，该非线性接收算法包括SIC算法或MLD算法等。
本申请实施例，对接收能力信息携带在何种消息中不进行具体限定。例如，如果发送端设备是网络设备，且接收端设备是终端，则接收能力信息可以携带在RRC信令、MAC信令或DCI中。又如，如果发送端设备是终端，且接收端设备是网络设备，则 接收能力信息可以携带在RRC信令、MAC信令或UCI中。可以理解的是，由于接收端设备的接收能力信息通常在一段时间内保持不变，因此，可选的接收能力信息通常可以携带在RRC信令或MAC信令中进行传输。
可以理解的是，接收端设备可以支持一种或多种接收算法，其中，可以包括非线性接收算法，也可以包括线性接收算法。例如，接收端设备同时支持MLD、SIC、最小均方误差(minimum mean squared error，MMSE)和干扰抑制合并(interference rejection combining，IRC)等。又如，接收端设备仅支持MMSE等。
在一种实现方式中，上述S201中的接收能力信息，具体用于指示该接收端设备支持非线性接收算法的信息，例如，假设通过RRC信令携带接收端设备的接收能力信息，则可以通过在该RRC中设置一个标志位，如果该接收端设备支持非线性接收算法，则将该标志位置为1；如果该接收端设备支持线性接收算法，则将该标志位置为0，当然本申请实施例不限于此。
在另一种实现方式中，上述S201中的接收能力信息，具体用于指示该接收端设备支持的非线性接收算法的标识信息，例如，接收能力信息可以用于指示接收端设备支持MLD和SIC这两种非线性接收算法。
S202：发送端设备根据该接收能力信息，采用本申请实施例提供的预编码方法(如图3所描述的预编码方法)对待发送数据进行预编码。
可以理解的是，由于如果接收端设备采用非线性接收算法接收数据，则发送端设备对待发送数据进行预编码时，可以保留一些流间干扰，这些流间干扰可以由接收端设备执行非线性接收算法时来减小或消除，这些流间干扰可以体现为信道矩阵分解得到的矩阵R(即上文中描述的矩阵R)是上三角矩阵，而不必需是对角矩阵。因此，发送端设备可以采用本申请实施例提供的预编码方法对待发送数据进行预编码。
S203：发送端设备发送预编码后的待发送数据。
如果发送端设备是网络设备，且接收端设备是终端，则S203可以包括：发送端设备通过物理下行共享信道(physical downlink shared channel，PDSCH)发送预编码后的待发送数据。或者，如果发送端设备是终端，且接收端设备是网络设备，则S203可以包括：发送端设备通过物理上行共享信道(physical uplink shared channel，PDSCH)发送预编码后的待发送数据。
S204：发送端设备向接收端设备发送指示信息，该指示信息用于指示发送端设备采用本申请实施例提供的预编码方法(如图3所描述的预编码方法)对待发送数据进行预编码。
如果发送端设备是网络设备，且接收端设备是终端，则指示信息携带在无线资源控制RRC信令、媒体接入控制MAC信令或下行控制信息DCI中。或者，如果发送端设备是终端，且接收端设备是网络设备，则指示信息携带在RRC信令、MAC信令或上行控制信息UCI中。
本申请实施例对S203和S204的执行顺序不进行限定，例如，可以先执行S203再执行S204，或者可以先执行S204再执行S203，或者可以同时执行S203和S204等。
S205：接收端设备根据该指示信息，采用该接收端设备所支持的非线性接收算法接收来自发送端设备的预编码后的待发送数据。例如，基于该接收端设备所支持的非 线性接收算法对接收到的数据进行均衡，使得在发送端设备混合到一起的各数据流分成独立的数据流，并在该过程中减小或消除流间干扰。后续，可以对每个数据流进行解调和信道译码等操作。
上述S204～S205是可选的步骤。
如果不执行S204～S205，那么：在一种实现方式中，当接收端设备仅支持非线性接收算法时，可以直接采用所支持的接收算法接收数据；在另一种实现方式中，当接收端设备还支持线性接收算法时，可以通过对比采用非线性接收算法接收数据和采用线性接收算法接收数据的性能增益，从而选择采用非线性接收算法接收数据。当然本申请实施例不限于此。例如，还可以通过以下图5所示的方法使得接收端社会部采用非线性接收算法接收数据。
可以理解的是，上文提供的预编码方法中信道矩阵分解得到的矩阵R是上三角矩阵，也就是说，采用该预编码方法对多个数据流进行编码后，会带来一定的流间干扰。本实施例中，接收端设备可以配合采用非线性接收算法接收数据，则可以减小或消除这些流间干扰，从而提高多流数据的正确解调的概率。另外，正因为发送端设备采用上文提供的预编码方法时，允许一定的流间干扰，而这种流间干扰可以在接收端设备被减小或消除，因此采用本实施例进行信息传输时，可以提高多天线系统的空分复用的流数，从而提供系统容量。
如图5所示，为本申请实施例提供的一种信息传输方法的交互示意图。图5所示的方法包括如下步骤：
S301：接收端设备向发送端设备发送接收能力信息，该接收能力信息用于指示该接收端设备支持非线性接收算法。S301的具体实现方式可以参考上述S201，此处不再赘述。
S302：发送端设备根据该接收能力信息，向接收端设备发送指示信息，该指示信息用于指示接收端设备采用非线性接收算法接收数据。
其中，非线性接收算法可以包括SIC算法或MLD算法等。
在一种实现方式中，该指示信息具体用于指示接收端设备采用非线性接收算法，而非采用线性接收算法接收数据。也就是说，本申请实施例支持发送端设备向接收端设备配置接收端设备是否采用非线性接收算法接收数据。该方法可以应用于接收端设备支持线性接收算法和非线性接收算法的场景中，基于该场景，接收端设备可以支持一种或多种非线性接收算法。
在另一种实现方式中，该指示信息具体用于指示接收端设备采用哪一种非线性接收算法接收数据。该方式可以应用于接收端设备支持至少两种非线性接收算法的场景中。
S303：接收端设备根据该指示信息，采用非线性接收算法接收来自发送端设备的数据。可选的，该数据是发送端设备采用本申请实施例提供的预编码方法进行预编码得到的数据。
如果发送端设备是网络设备，且接收端设备是终端，则指示信息携带在RRC信令、MAC信令或DCI中。或者，如果发送端设备是终端，且接收端设备是网络设备，则指示信息携带在RRC信令、MAC信令或上行控制信息UCI中。
本实施例中，发送端设备通过向接收端设备发送指示信息，来指示接收端设备所采用的非线性接收算法，这样，有助于接收端设备选择合适的接收算法，从而提高数据的解调概率。该方法与本申请实施例提供的预编码方法可以结合使用，从而减小或消除发送端设备因采用本申请实施例提供的预编码方法进行预编码而产生的流间干扰，从而提高多流数据的正确解调的概率。
上述主要从方法的角度对本申请实施例提供的方案进行了介绍。为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对预编码装置、发送端设备或接收端设备进行功能模块的划分，例如可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
如图6所示，为本申请实施例提供的一种预编码装置60的结构示意图。作为一个示例，预编码装置60可以是发送端设备(如网络设备或终端)。作为一个示例，预编码装置60可以用于执行图3所示的预编码方法。预编码装置60可以包括处理单元601和发送单元602。
其中，处理单元601用于将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积；其中，矩阵P H是矩阵P的共轭转置矩阵，矩阵Q和矩阵P均是酉矩阵，矩阵R是上三角矩阵。发送单元602用于根据矩阵P对待发送数据进行预编码。例如结合图3，处理单元601可以用于执行S102，发送单元602可以用于执行S103。
可选的，矩阵R的至少两个对角线元素之比为目标比例，目标比例是基于码率所确定的。
可选的，如果矩阵R的对角线元素之比r 1,1:r 2,2:…:r k,k:…:r t,t＝A 1:A 2:…:A k:…:A t，r k,k是矩阵R的第k个对角线元素，1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数；那么r k,k＝A kθ，θ是基于信道矩阵经SVD得到的非零奇异值所确定的。
可选的，
Figure PCTCN2019128474-appb-000019
其中，λ j是信道矩阵经SVD得到的第j个非零奇异值，j＝1、2、……t。∏表示求积运算。
可选的，t≥2，信道矩阵经SVD得到的非零奇异值与信道矩阵经SVD得到的对角矩阵中的对角线元素之间满足如下条件：
Figure PCTCN2019128474-appb-000020
其中，λ k是信道矩阵经SVD得到的第k个非零奇异值，σ k是上述A kθ，1≤k≤t≤K。
可选的，处理单元601具体用于：对信道矩阵进行SVD，以将信道矩阵分解成矩阵U、矩阵∑和矩阵V H的乘积；其中，矩阵V H是矩阵V的共轭转置矩阵，矩阵U和矩阵V均是酉矩阵，矩阵∑是对角矩阵；对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H。例如，结合图3，处理单元601可以用于执行S101和S102。
可选的，目标比例是所述矩阵R中的第1至第t个对角线元素之比；1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数。基于此，处理单元601执行对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H时，具体用于：
首先，将矩阵∑作为矩阵R的初始化矩阵R 0。
其次，遍历k＝1、2、……、t-1中的每个值，1≤k≤t≤K，k和t均是整数，K是矩阵R的对角线元素的个数，执行以下步骤1～4：
步骤1：根据σ k和矩阵R k-1中的第k个对角线元素r k,k的大小关系，从矩阵R k-1中寻找对角线元素r p,p；其中，k＜p≤K，p是整数，σ k是上述A kθ；若r k,k≥σ k，则r p,p≤σ k；若r k,k＜σ k，则r p,p＞σ k；
步骤2：将矩阵R k-1中的对角线元素r k+1,k+1与r p,p交换位置，获得矩阵R re_k；
步骤3：根据σ k、矩阵R re_k中的第k个对角线元素和第k+1个对角线元素，构建矩阵G 1和矩阵G 2；其中，矩阵G 1和矩阵G 2使得
Figure PCTCN2019128474-appb-000021
中的第k、k+1行与第k、k+1列的交集构成的子矩阵为上三角矩阵，且子矩阵的第1个对角线元素为σ k；
Figure PCTCN2019128474-appb-000022
是矩阵G 2的转置矩阵；
步骤4：根据公式
Figure PCTCN2019128474-appb-000023
获得矩阵R k。
接着，将第t-1次执行步骤1～4之后获得的矩阵R t-1作为矩阵R。
可选的，处理单元601执行根据σ k、矩阵R re_k中的第k个对角线元素和第k+1个对角线元素，构建矩阵G 1和矩阵G 2时，具体用于：根据如下公式构建矩阵G 1和矩阵G 2：
Figure PCTCN2019128474-appb-000024
其中，
Figure PCTCN2019128474-appb-000025
δ 1是矩阵R re_k中的第k个对角线元素，δ 2是矩阵R re_k中的第k+1个对角线元素。
可选的，处理单元601执行对矩阵U、矩阵∑和矩阵V H进行变换，得到矩阵Q、矩阵R和矩阵P H时，具体还用于：将矩阵U作为矩阵Q的初始化矩阵Q 0，并将矩阵V分别矩阵P的初始化矩阵P 0；在第k次执行步骤1～4的过程中：交换矩阵Q k-1中的第k+1列元素与第p列元素，获得矩阵Q re_k，并交换矩阵P k-1中的第k+1列元素与第p列元素，获得矩阵P re_k；根据公式Q k＝Q re_kG 2获得矩阵Q k，并根据公式P k＝P re_kG 1 获得矩阵P k；将第t-1次执行步骤1～4之后获得的矩阵Q t-1作为矩阵Q，并将第t-1次执行步骤1～4之后获得的矩阵P t-1作为矩阵P。
上述提供的任一种预编码装置60中相关内容的解释以及有益效果的描述等均可参考上述对应的方法实施例，此处不再赘述。
作为一示例，结合图2所示的通信设备，上述处理单元601可以通过图2中的处理器201或处理器207实现。发送单元602可以通过图2中的通信接口204实现。
如图7所示，为本申请实施例提供的一种发送端设备70的结构示意图。作为一个示例，发送端设备70可以用于执行图4或图5的方法中发送端设备所执行的步骤。发送端设备70可以包括接收单元701、处理单元702和发送单元703。
其中，接收单元701用于接收来自接收端设备的接收能力信息，接收能力信息用于指示接收端设备支持非线性接收算法。处理单元702用于根据接收能力信息，采用本申请实施例提供的任一种预编码方法(如图3所示的预编码方法)对待发送数据进行预编码。发送单元703用于发送预编码后的待发送数据。例如，结合图4，接收单元701可以用于执行S201对应的接收步骤，处理单元702可以用于执行S202，发送单元703可以用于执行S203。
可选的，发送单元703还用于，向接收端设备发送指示信息，该指示信息用于指示发送端设备采用本申请实施例提供的任一种预编码方法(如图3所示的预编码方法)对待发送数据进行预编码。例如，结合图4，发送单元703可以用于执行S204。
可选的，发送单元703还用于，向接收端设备发送指示信息，该指示信息用于指示接收端设备采用非线性接收算法接收待发送数据。例如结合图5，发送单元703可以用于执行S302。
可选的，如果发送端设备是网络设备，且接收端设备是终端，则上述任一种指示信息携带在RRC信令、MAC信令或DCI中；或者，如果发送端设备是终端，且接收端设备是网络设备，则上述任一种指示信息携带在RRC信令、MAC信令或UCI中。
可选的，非线性接收算法包括SIC算法或算法。
上述提供的任一种发送端设备70中相关内容的解释以及有益效果的描述等均可参考上述对应的方法实施例，此处不再赘述。
作为一示例，结合图2所示的通信设备，上述处理单元702可以通过图2中的处理器201或处理器207实现。接收单元701和发送单元703可以通过图2中的通信接口204实现。
如图8所示，为本申请实施例提供的一种接收端设备80的结构示意图。作为一个示例，接收端设备80可以用于执行图4或图5的方法中发送端设备所执行的步骤。接收端设备80可以包括接收单元801和处理单元802。可选的，还可以包括发送单元803。
在第一种实施例中：接收单元801用于接收发送端设备发送的指示信息，该指示信息用于指示发送端设备采用本申请实施例提供的任一种预编码方法(如图3所示的预编码方法)对待发送数据进行预编码。处理单元802用于根据该指示信息，采用接收端设备所支持的非线性接收算法接收预编码后的待发送数据。例如，结合图4，接收单元801可以用于执行S204对应的接收步骤，处理单元802用于执行S205。可选的，发送单元803用于向发送端设备发送接收能力信息，接收能力信息用于指示接收 端设备支持非线性接收算法。例如，结合图4，发送单元803可以用于执行S201。可选的，非线性接收算法包括SIC算法或MLD算法等。
在第二种实施例中：接收单元801用于接收发送端设备发送的指示信息，该指示信息用于指示接收端设备采用非线性接收算法接收数据。处理单元802用于根据指示信息，采用非线性接收算法接收来自发送端设备的数据。例如，结合图5，接收单元801可以用于执行S302对应的接收步骤，处理单元802可以用于执行S303。可选的，发送单元803用于向发送端设备发送接收能力信息，该接收能力信息用于指示接收端设备支持非线性接收算法。例如，结合图5，发送单元803可以用于执行S301。可选的，非线性接收算法包括SIC算法或MLD算法等。
上述提供的任一种接收端设备80中相关内容的解释以及有益效果的描述等均可参考上述对应的方法实施例，此处不再赘述。
作为一示例，结合图2所示的通信设备，上述处理单元802可以通过图2中的处理器201或处理器207实现。接收单元801和发送单元803可以通过图2中的通信接口204实现。
本申请实施例还提供了一种通信系统，该通信系统可以包括上文中提供的任一种预编码装置60，以及，与接收该预编码装置60预编码后的数据的接收端设备。
本申请实施例还提供了一种通信系统，该通信系统可以包括上文中提供的任一种发送端设备70，以及上文中提供的相对应的接收端设备80。
本申请实施例还提供了一种通信系统，该通信系统可以包括上文中提供的第二种实施例中的任一种接收端设备80，以及与该接收端设备80通信以完成配置该接收端设备所采用的接收算法的发送端设备。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件程序实现时，可以全部或部分地以计算机程序产品的形式来实现。该计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行计算机执行指令时，全部或部分地产生按照本申请实施例的流程或功能。计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，计算机指令可以从一个网站站点、计算机、服务器或者数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可以用介质集成的服务器、数据中心等数据存储设备。可用介质可以是磁性介质(例如，软盘、硬盘、磁带)，光介质(例如，DVD)、或者半导体介质(例如固态硬盘(solid state disk，SSD))等。
尽管在此结合各实施例对本申请进行了描述，然而，在实施所要求保护的本申请过程中，本领域技术人员通过查看附图、公开内容、以及所附权利要求书，可理解并实现公开实施例的其他变化。在权利要求中，“包括”(comprising)一词不排除其他组成部分或步骤，“一”或“一个”不排除多个的情况。单个处理器或其他单元可以实现权利要求中列举的若干项功能。相互不同的从属权利要求中记载了某些措施，但 这并不表示这些措施不能组合起来产生良好的效果。
尽管结合具体特征及其实施例对本申请进行了描述，显而易见的，在不脱离本申请的精神和范围的情况下，可对其进行各种修改和组合。相应地，本说明书和附图仅仅是所附权利要求所界定的本申请的示例性说明，且视为已覆盖本申请范围内的任意和所有修改、变化、组合或等同物。显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的精神和范围。这样，倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (31)

  1. 一种预编码方法，其特征在于，包括：
    将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积；其中，所述矩阵P H是矩阵P的共轭转置矩阵，所述矩阵Q和所述矩阵P均是酉矩阵，所述矩阵R是上三角矩阵；
    根据所述矩阵P对待发送数据进行预编码。
  2. 根据权利要求1所述的方法，其特征在于，所述矩阵R的至少两个对角线元素之比为目标比例，所述目标比例是基于码率所确定的。
  3. 根据权利要求2所述的方法，其特征在于，如果所述矩阵R的对角线元素之比r 1,1:r 2,2:…:r k,k:…:r t,t＝A 1:A 2:…:A k:…:A t，所述r k,k是所述矩阵R的第k个对角线元素，1≤k≤t≤K，所述k和t均是整数，所述K是所述矩阵R的对角线元素的个数；那么r k,k＝A kθ，所述θ是基于所述信道矩阵经奇异值分解SVD得到的非零奇异值所确定的。
  4. 根据权利要求3所述的方法，其特征在于，
    Figure PCTCN2019128474-appb-100001
    所述λ j是所述信道矩阵经SVD得到的第j个非零奇异值，j＝1、2、……t，所述∏表示求积运算。
  5. 根据权利要求4所述的方法，其特征在于，t≥2，所述信道矩阵经SVD得到的非零奇异值与所述信道矩阵经SVD得到的对角矩阵中的对角线元素之间满足如下条件：
    Figure PCTCN2019128474-appb-100002
    其中，λ k是所述信道矩阵经SVD得到的第k个非零奇异值，σ k是所述A kθ，1≤k≤t≤K。
  6. 根据权利要求1至5任一项所述的方法，其特征在于，所述将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积，包括：
    对所述信道矩阵进行SVD，以将所述信道矩阵分解成矩阵U、矩阵∑和矩阵V H的乘积；其中，所述矩阵V H是矩阵V的共轭转置矩阵，所述矩阵U和所述矩阵V均是酉矩阵，所述矩阵∑是对角矩阵；
    对所述矩阵U、所述矩阵∑和所述矩阵V H进行变换，得到所述矩阵Q、所述矩阵R和所述矩阵P H。
  7. 一种信息传输方法，其特征在于，包括：
    发送端设备接收来自接收端设备的接收能力信息，所述接收能力信息用于指示所述接收端设备支持非线性接收算法；
    所述发送端设备根据所述接收能力信息，采用权利要求1至6任一项所述的方法对待发送数据进行预编码；
    所述发送端设备发送所述预编码后的所述待发送数据。
  8. 根据权利要求7所述的方法，其特征在于，所述方法还包括：
    所述发送端设备向所述接收端设备发送指示信息，所述指示信息用于指示所述发送端设备采用如权利要求1至6任一项所述的方法对所述待发送数据进行预编码；
    或者，所述发送端设备向所述接收端设备发送指示信息，所述指示信息用于指示所述接收端设备采用所述非线性接收算法接收所述待发送数据。
  9. 根据权利要求8所述的方法，其特征在于，
    如果所述发送端设备是网络设备，且所述接收端设备是终端，则所述指示信息携带在无线资源控制RRC信令、媒体接入控制MAC信令或下行控制信息DCI中；
    或者，如果所述发送端设备是终端，且所述接收端设备是网络设备，则所述指示信息携带在RRC信令、MAC信令或上行控制信息UCI中。
  10. 根据权利要求7至9任一项所述的方法，其特征在于，所述非线性接收算法包括串行干扰消除SIC算法或最大似然检测MLD算法。
  11. 一种信息传输方法，其特征在于，包括：
    接收端设备接收发送端设备发送的指示信息，所述指示信息用于指示所述发送端设备采用如权利要求1至6任一项所述的方法对待发送数据进行预编码；
    所述接收端设备根据所述指示信息，采用所述接收端设备所支持的非线性接收算法接收所述预编码后的所述待发送数据。
  12. 根据权利要求11所述的方法，其特征在于，所述方法还包括：
    所述接收端设备向所述发送端设备发送接收能力信息，所述接收能力信息用于指示所述接收端设备支持所述非线性接收算法。
  13. 根据权利要求11或12所述的方法，其特征在于，所述非线性接收算法包括串行干扰消除SIC算法或最大似然检测MLD算法。
  14. 一种预编码装置，其特征在于，包括：
    处理单元，用于将信道矩阵分解成矩阵Q、矩阵R和矩阵P H的乘积；其中，所述矩阵P H是矩阵P的共轭转置矩阵，所述矩阵Q和所述矩阵P均是酉矩阵，所述矩阵R是上三角矩阵；
    发送单元，用于根据所述矩阵P对待发送数据进行预编码。
  15. 根据权利要求14所述的装置，其特征在于，所述矩阵R的至少两个对角线元素之比为目标比例，所述目标比例是基于码率所确定的。
  16. 根据权利要求15所述的装置，其特征在于，如果所述矩阵R的对角线元素之比r 1,1:r 2,2:…:r k,k:…:r t,t＝A 1:A 2:…:A k:…:A t，所述r k,k是所述矩阵R的第k个对角线元素，1≤k≤t≤K，所述k和t均是整数，所述K是所述矩阵R的对角线元素的个数；那么r k,k＝A kθ，所述θ是基于所述信道矩阵经奇异值分解SVD得到的非零奇异值所确定的。
  17. 根据权利要求16所述的装置，其特征在于，
    Figure PCTCN2019128474-appb-100003
    所述λ j是所述信道矩阵经SVD得到的第j个非零奇异值，j＝1、2、……t，所述∏表示求积运算。
  18. 根据权利要求17所述的装置，其特征在于，t≥2，所述信道矩阵经SVD得 到的非零奇异值与所述信道矩阵经SVD得到的对角矩阵中的对角线元素之间满足如下条件：
    Figure PCTCN2019128474-appb-100004
    其中，λ k是所述信道矩阵经SVD得到的第k个非零奇异值，σ k是所述A kθ，1≤k≤t≤K。
  19. 根据权利要求14至18任一项所述的装置，其特征在于，所述处理单元具体用于：
    对所述信道矩阵进行SVD，以将所述信道矩阵分解成矩阵U、矩阵∑和矩阵V H的乘积；其中，所述矩阵V H是矩阵V的共轭转置矩阵，所述矩阵U和所述矩阵V均是酉矩阵，所述矩阵∑是对角矩阵；
    对所述矩阵U、所述矩阵∑和所述矩阵V H进行变换，得到所述矩阵Q、所述矩阵R和所述矩阵P H。
  20. 一种发送端设备，其特征在于，包括：
    接收单元，用于接收来自接收端设备的接收能力信息，所述接收能力信息用于指示所述接收端设备支持非线性接收算法；
    处理单元，用于根据所述接收能力信息，采用权利要求1至8任一项所述的方法对待发送数据进行预编码；
    发送单元，用于发送所述预编码后的所述待发送数据。
  21. 根据权利要求20所述的发送端设备，其特征在于，
    所述发送单元还用于，向所述接收端设备发送指示信息，所述指示信息用于指示所述发送端设备采用如权利要求1至6任一项所述的方法对所述待发送数据进行预编码；
    或者，所述发送单元还用于，向所述接收端设备发送指示信息，所述指示信息用于指示所述接收端设备采用所述非线性接收算法接收所述待发送数据。
  22. 根据权利要求21所述的发送端设备，其特征在于，
    如果所述发送端设备是网络设备，且所述接收端设备是终端，则所述指示信息携带在无线资源控制RRC信令、媒体接入控制MAC信令或下行控制信息DCI中；
    或者，如果所述发送端设备是终端，且所述接收端设备是网络设备，则所述指示信息携带在RRC信令、MAC信令或上行控制信息UCI中。
  23. 根据权利要求20至22任一项所述的发送端设备，其特征在于，所述非线性接收算法包括串行干扰消除SIC算法或最大似然检测MLD算法。
  24. 一种接收端设备，其特征在于，包括：
    接收单元，用于接收发送端设备发送的指示信息，所述指示信息用于指示所述发 送端设备采用如权利要求1至6任一项所述的方法对待发送数据进行预编码；
    处理单元，用于根据所述指示信息，采用所述接收端设备所支持的非线性接收算法接收所述预编码后的所述待发送数据。
  25. 根据权利要求24所述的接收端设备，其特征在于，所述接收端设备还包括：
    发送单元，用于向所述发送端设备发送接收能力信息，所述接收能力信息用于指示所述接收端设备支持所述非线性接收算法。
  26. 根据权利要求24或25所述的接收端设备，其特征在于，所述非线性接收算法包括串行干扰消除SIC算法或最大似然检测MLD算法。
  27. 一种预编码装置，其特征在于，包括：存储器和处理器，所述存储器用于存储计算机指令，所述处理器用于调用所述计算机指令，以执行权利要求1至6任一项所述的方法。
  28. 一种发送端设备，其特征在于，包括：存储器和处理器，所述存储器用于存储计算机指令，所述处理器用于调用所述计算机指令，以执行权利要求7至10任一项所述的方法。
  29. 一种接收端设备，其特征在于，包括：存储器和处理器，所述存储器用于存储计算机指令，所述处理器用于调用所述计算机指令，以执行权利要求11至13任一项所述的方法。
  30. 一种计算机可读存储介质，其特征在于，包括计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行权利要求1至13任一项所述的方法。
  31. 一种计算机程序产品，其特征在于，当所述计算机程序产品在计算机上运行时，使得权利要求1至13任一项所述的方法的操作步骤被执行。
PCT/CN2019/128474 2018-12-26 2019-12-25 预编码方法和装置及信息传输方法和装置 WO2020135534A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19903747.4A EP3886332A4 (en) 2018-12-26 2019-12-25 PRECODING METHOD AND DEVICE, AND INFORMATION TRANSFER METHOD AND DEVICE
US17/357,392 US11943017B2 (en) 2018-12-26 2021-06-24 Precoding method and apparatus, and information transmission method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811603975.8 2018-12-26
CN201811603975.8A CN111371478B (zh) 2018-12-26 2018-12-26 预编码方法和装置及信息传输方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/357,392 Continuation US11943017B2 (en) 2018-12-26 2021-06-24 Precoding method and apparatus, and information transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2020135534A1 true WO2020135534A1 (zh) 2020-07-02

Family

ID=71128754

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/128474 WO2020135534A1 (zh) 2018-12-26 2019-12-25 预编码方法和装置及信息传输方法和装置

Country Status (4)

Country Link
US (1) US11943017B2 (zh)
EP (1) EP3886332A4 (zh)
CN (1) CN111371478B (zh)
WO (1) WO2020135534A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117097376A (zh) * 2022-05-11 2023-11-21 华为技术有限公司 一种通信方法及装置
CN115102591B (zh) * 2022-08-25 2023-01-20 北京智芯微电子科技有限公司 基于反注水的波束赋形方法、装置、设备及可读存储介质

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986575A (zh) * 2010-10-28 2011-03-16 北京邮电大学 多用户mimo系统的预编码方法
US20110286502A1 (en) * 2008-09-12 2011-11-24 Panasonic Corporation Wireless transmitter and precoding method
CN102447537A (zh) * 2010-10-12 2012-05-09 中兴通讯股份有限公司 数据发送方法及基站
CN102546088A (zh) * 2010-12-28 2012-07-04 电子科技大学 一种块对角化预编码方法及装置
US8229017B1 (en) * 2007-12-13 2012-07-24 Marvell International Ltd. Transmit beamforming utilizing channel estimation matrix decomposition feedback in a wireless MIMO communication system
CN103220033A (zh) * 2013-05-13 2013-07-24 电子科技大学 一种双向中继mimo系统的矩阵信道并行化方法
CN105162504A (zh) * 2015-09-21 2015-12-16 华南理工大学 一种快速mimo系统发射端预编码方法
CN105703813A (zh) * 2016-02-04 2016-06-22 东南大学 一种mimo系统的预编码方法
CN107332596A (zh) * 2017-05-26 2017-11-07 南京邮电大学 一种基于迫零的毫米波通信系统混合预编码方法

Family Cites Families (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6628844B1 (en) * 1997-02-19 2003-09-30 Massachusetts Institute Of Technology High definition imaging apparatus and method
US6985534B1 (en) * 1998-10-27 2006-01-10 Siemens Aktiengesellschaft Channel allocation method and device for coded and combined information sets
US7477703B2 (en) * 2000-02-22 2009-01-13 Nokia Mobile Phones, Limited Method and radio system for digital signal transmission using complex space-time codes
JP4680008B2 (ja) * 2004-08-31 2011-05-11 株式会社エヌ・ティ・ティ・ドコモ 通信システム、通信ノード及び通信方法
JP4754906B2 (ja) * 2004-08-31 2011-08-24 株式会社エヌ・ティ・ティ・ドコモ 通信システム、通信ノード及び通信方法
US7289770B2 (en) * 2004-09-28 2007-10-30 Intel Corporation Compact feedback for closed loop MIMO
CA2587770A1 (en) 2004-11-05 2006-05-18 University Of Florida Research Foundation, Inc. Uniform channel decomposition for mimo communications
KR101049440B1 (ko) * 2005-04-13 2011-07-15 연세대학교 산학협력단 공간 분할 다중화 심볼 검출 장치 및 그 방법
US7817745B2 (en) * 2005-06-02 2010-10-19 Adaptive Spectrum And Signal Alignment, Inc. Tonal precoding
KR100992418B1 (ko) * 2006-07-12 2010-11-05 삼성전자주식회사 다중 안테나 시스템의 송신단에서 간섭을 제거하기 위한장치 및 방법
US7680205B2 (en) 2006-07-28 2010-03-16 Broadcom Corporation Method and system for transmitter beamforming for reduced complexity multiple input multiple output (MIMO) transceivers
CN101136659B (zh) * 2006-08-28 2012-01-25 华为技术有限公司 一种xDSL多线对串扰消除的方法、系统及设备
WO2008038626A1 (fr) * 2006-09-25 2008-04-03 Panasonic Corporation Dispositif et procédé de séparation de signal
US7830978B2 (en) * 2007-08-31 2010-11-09 Alcatel Lucent Determining channel matrices by correlated transmissions to different channels
US8121220B1 (en) * 2008-06-06 2012-02-21 Qualcomm Atheros, Inc. Apparatus and method for reduced complexity maximum likelihood MIMO detection
WO2010002319A2 (en) * 2008-07-03 2010-01-07 Telefonaktiebolaget L M Ericsson (Publ) Methods and arrangements in a wireless communication system
CN101848174B (zh) 2009-03-24 2013-01-16 鼎桥通信技术有限公司 发射预处理方法和发射预处理信号的数据解调方法
US8145223B2 (en) * 2009-04-09 2012-03-27 Telefonaktiebolaget L M Ericsson (Publ) Inter-cell interference mitigation
JP5450819B2 (ja) * 2009-08-18 2014-03-26 アルカテル−ルーセント プリコーディング方法および装置
CN102025405A (zh) * 2009-09-17 2011-04-20 中兴通讯股份有限公司 一种基于联合收发端信息的多路波束形成方法及系统
JP5691245B2 (ja) * 2010-05-27 2015-04-01 富士通株式会社 受信装置、及び受信方法
US9209874B2 (en) * 2010-11-01 2015-12-08 Sharp Kabushiki Kaisha Wireless transmission apparatus, wireless reception apparatus, wireless communication system, control program and integrated circuit
US9281880B2 (en) * 2011-08-15 2016-03-08 Sharp Kabushiki Kaisha Wireless transmission device and wireless reception device
CN103907303A (zh) * 2011-11-02 2014-07-02 富士通株式会社 无线通信装置和通信方法
US8908815B2 (en) * 2012-05-16 2014-12-09 Dsp Group Ltd. Demapper for a multiple-input, multiple-output symbol receiver
JP2016131262A (ja) * 2013-04-26 2016-07-21 国立大学法人東京工業大学 受信装置、受信方法および受信プログラム
EP2800283B1 (en) * 2013-04-30 2019-07-10 Alcatel Lucent Non-linear precoder with separate modulo decision
CN103647620A (zh) * 2013-11-27 2014-03-19 重庆邮电大学 Lte-a网络中基于qr分解法的信道预编码方法
EP2919392B1 (en) * 2014-03-11 2017-03-08 Alcatel Lucent Non-linear precoder with separate tracking
EP3032789B1 (en) * 2014-12-11 2018-11-14 Alcatel Lucent Non-linear precoding with a mix of NLP capable and NLP non-capable lines
CN106664263A (zh) * 2014-12-11 2017-05-10 华为技术有限公司 用于无线通信网络中的干扰估计的方法和装置
US9800720B2 (en) * 2014-12-12 2017-10-24 Telefonaktiebolaget L M Ericsson (Publ) Systems and methods for determining non-linear precoding coefficients
US9544423B2 (en) * 2015-03-31 2017-01-10 Futurewei Technologies, Inc. Channel ordering for multi-channel multi-carrier communication systems
EP3317976B1 (en) * 2015-07-03 2019-03-20 Telefonaktiebolaget LM Ericsson (publ) Wireless device, radio network node, methods performed therein
US20170180020A1 (en) * 2015-12-18 2017-06-22 Qualcomm Incorporated Per-tone precoding for downlink mimo transmission
CN109302856B (zh) * 2016-06-20 2021-06-01 三菱电机株式会社 发送装置、通信系统和预编码运算方法
US10153817B2 (en) * 2016-10-25 2018-12-11 Nxp Usa, Inc. Complexity reduction for transmitter precoding
US10924166B2 (en) * 2016-10-25 2021-02-16 Nxp Usa, Inc. Complexity reduction for transmitter precoding
US10749584B2 (en) * 2016-12-22 2020-08-18 Samsung Electronics Co., Ltd. Uplink MIMO codebook for advanced wireless communication systems
CN108599821B (zh) * 2018-05-08 2021-01-22 电子科技大学 一种基于qr分解的预编码方法
CN109039400B (zh) * 2018-08-14 2020-11-17 西安科技大学 一种基于矩阵分解的混合预编码/合并器设计方法

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8229017B1 (en) * 2007-12-13 2012-07-24 Marvell International Ltd. Transmit beamforming utilizing channel estimation matrix decomposition feedback in a wireless MIMO communication system
US20110286502A1 (en) * 2008-09-12 2011-11-24 Panasonic Corporation Wireless transmitter and precoding method
CN102447537A (zh) * 2010-10-12 2012-05-09 中兴通讯股份有限公司 数据发送方法及基站
CN101986575A (zh) * 2010-10-28 2011-03-16 北京邮电大学 多用户mimo系统的预编码方法
CN102546088A (zh) * 2010-12-28 2012-07-04 电子科技大学 一种块对角化预编码方法及装置
CN103220033A (zh) * 2013-05-13 2013-07-24 电子科技大学 一种双向中继mimo系统的矩阵信道并行化方法
CN105162504A (zh) * 2015-09-21 2015-12-16 华南理工大学 一种快速mimo系统发射端预编码方法
CN105703813A (zh) * 2016-02-04 2016-06-22 东南大学 一种mimo系统的预编码方法
CN107332596A (zh) * 2017-05-26 2017-11-07 南京邮电大学 一种基于迫零的毫米波通信系统混合预编码方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3886332A4

Also Published As

Publication number Publication date
CN111371478A (zh) 2020-07-03
EP3886332A4 (en) 2022-01-26
US20210328632A1 (en) 2021-10-21
EP3886332A1 (en) 2021-09-29
US11943017B2 (en) 2024-03-26
CN111371478B (zh) 2021-10-15

Similar Documents

Publication Publication Date Title
US20240073914A1 (en) Methods, apparatuses and systems directed to phase-continuous frequency selective precoding
JP6526206B2 (ja) 無線ローカルエリアネットワークにおいて半直交多元接続を使用するためのシステムおよび方法
CN111771340B (zh) 用于高级无线通信系统中的宽带csi报告的方法和装置
CN110574304A (zh) 用于高级无线通信系统中的高级别csi报告的方法和装置
CN114503449A (zh) 用于复用部分信道状态信息的方法和装置
US11101866B2 (en) Rank indication reporting method and apparatus, and indication method and apparatus
US10772074B2 (en) Facilitation of reporting sub-band channel quality indicators for 5G or other next generation network
CN105794257B (zh) Ofdma资源分配的系统和方法
EP3800945B1 (en) Power allocation method and related device
WO2021238634A1 (zh) 一种下行预编码方法、装置及基站
US12068822B2 (en) Facilitating fast channel state information computation for 5G wireless communication systems
EP3846560B1 (en) Resource allocation method and communication device
WO2020173493A1 (zh) 确定波束赋形的加权参数的方法及wlan中的ap
US11943017B2 (en) Precoding method and apparatus, and information transmission method and apparatus
US20240097753A1 (en) Determining a precoder for wireless communications
WO2017101586A1 (en) System and method for quantization of angles for beamforming feedback
KR20230135090A (ko) 무선 통신 시스템에서 csi 보고를 위한 방법 및 장치
WO2021104020A1 (zh) 数据传输方法、发送设备和接收设备
US20230345483A1 (en) Method and device for transmitting and receiving hybrid automatic retransmission request acknowledgement information
JP2018537041A (ja) 高度な受信機のためのチャネル状態情報フレームワーク
US20220330319A1 (en) Facilitation of frequency selective scheduling for 5g or other next generation network
CN115866776A (zh) 用于上行链路频率选择性预编码的控制信令
CN110830090B (zh) 信号处理方法和装置
WO2023124943A1 (zh) 一种预编码指示方式的确定方法和装置
US20240364404A1 (en) Facilitating fast channel state information computation for 5g wireless communication systems

Legal Events

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

Ref document number: 19903747

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019903747

Country of ref document: EP

Effective date: 20210621

NENP Non-entry into the national phase

Ref country code: DE