WO2023041045A1 - 多天线信号传输中的用户调度方法、电子设备及存储介质 - Google Patents

多天线信号传输中的用户调度方法、电子设备及存储介质 Download PDF

Info

Publication number
WO2023041045A1
WO2023041045A1 PCT/CN2022/119342 CN2022119342W WO2023041045A1 WO 2023041045 A1 WO2023041045 A1 WO 2023041045A1 CN 2022119342 W CN2022119342 W CN 2022119342W WO 2023041045 A1 WO2023041045 A1 WO 2023041045A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
users
candidate
channel information
channel
Prior art date
Application number
PCT/CN2022/119342
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 EP22869411.3A priority Critical patent/EP4383636A1/en
Publication of WO2023041045A1 publication Critical patent/WO2023041045A1/zh

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/022—Site diversity; Macro-diversity
    • H04B7/024—Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [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/0452—Multi-user 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/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space
    • 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/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • 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/0091—Signaling for the administration of the divided path
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the field of communication technology, and in particular to a user scheduling method, electronic equipment and storage medium in multi-antenna signal transmission.
  • Base Station can serve multiple users simultaneously on the same time-frequency resource, that is, multi-user multi-antenna transmission technology . Therefore, it is more and more important to make full use of wireless spectrum resources for reasonable scheduling and resource allocation among users to achieve better system capacity.
  • the industry adopts the method that the base station performs user classification and scheduling according to schemes such as system reachability and rate, orthogonality between users, and spatial distance grouping clustering, which requires a lot of complex matrix decomposition and iteration
  • the search calculation process is very complex to implement.
  • the purpose of the embodiments of this application is to provide a user scheduling method, electronic equipment, and storage medium in multi-antenna signal transmission, to solve the problem of high complexity in the design of user transmission scheduling by the base station in multi-user multi-antenna signal transmission communication. question.
  • the embodiment of the present application provides a user scheduling method in multi-antenna signal transmission, the method is applied to the base station, including: acquiring channel information of channels used by multiple users, and according to the channel information of each user Using the channel information of the channel to construct the channel information covariance corresponding to each user; according to the channel information covariance of each user, calculate the correlation coefficient between every two users; The correlation coefficient between, select the scheduling user.
  • the embodiment of the present application also provides an electronic device, including: at least one processor; and a memory connected in communication with the at least one processor; wherein, the memory stores information that can be executed by the at least one processor. instructions, the instructions are executed by the at least one processor, so that the at least one processor can execute the user scheduling method in multi-antenna signal transmission as described above.
  • Embodiments of the present application further provide a computer-readable storage medium, storing a computer program, and implementing the user scheduling method in multi-antenna signal transmission as described above when the computer program is executed by a processor.
  • FIG. 1 is a specific flow chart 1 of a user scheduling method in multi-antenna signal transmission according to an embodiment of the present application
  • FIG. 2 is a specific flow chart II of a user scheduling method in multi-antenna signal transmission according to an embodiment of the present application
  • FIG. 3 is a specific flowchart three of a user scheduling method in multi-antenna signal transmission according to an embodiment of the present application
  • FIG. 4 is a specific flowchart 4 of a user scheduling method in multi-antenna signal transmission according to an embodiment of the present application
  • FIG. 5 is a specific flowchart five of a user scheduling method in multi-antenna signal transmission according to an embodiment of the present application
  • Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
  • An embodiment of the present application relates to a user scheduling method in multi-antenna signal transmission, and the method can be applied to a base station (BS).
  • BS base station
  • the user scheduling method in multi-antenna signal transmission includes the following steps.
  • Step 101 Obtain channel information of channels used by multiple users, and construct channel information covariance corresponding to each user according to the channel information of channels used by each user.
  • the channel used by the user is the transmission path used for transmitting signals between the user equipment (User Equipment, UE) and the BS.
  • BS adopts multi-user multi-antenna transmission technology, and can serve multiple users simultaneously on the same time-frequency resource. Multiple antennas for transmitting signals are respectively configured on each UE and BS.
  • the channel information may include but not limited to any one of the uplink channel coefficient matrix, the channel shaping vector and its corresponding channel power value, and the matrix codebook of the downlink channel.
  • the acquired channel information may be described in the form of a matrix.
  • the channel information covariance of the channel used by each user is calculated, and the channel information covariance is recorded as the channel information covariance corresponding to the corresponding user.
  • Each user corresponds to a channel information covariance, and as the channel information changes, the channel information covariance is constantly updated.
  • Step 102 Calculate the correlation coefficient between every two users according to the channel information covariance of each user.
  • a correlation coefficient between the two channel information covariances is calculated, and then the correlation coefficient is used as a correlation coefficient between the two users.
  • the calculation method for calculating the correlation coefficient between two channel information covariances is not limited.
  • Step 103 Select a scheduling user based on the number of scheduling users and the correlation coefficient between every two users.
  • the principle of selecting scheduling users is to select users with low correlation among users as scheduling users for scheduling. On the basis of a given number of scheduling users, one with a given number of scheduling users can be selected from existing users and Users with low correlation among users are scheduled as scheduling users.
  • the calculation method for selecting scheduling users based on the number of scheduling users and the correlation coefficient between every two users is not limited, as long as the overall selection of scheduling users has a low correlation.
  • this embodiment obtains the channel information of the channels used by multiple users, and constructs the channel information covariance corresponding to each user according to the channel information of the channels used by each user; according to the channel information covariance of each user , calculate the correlation coefficient between every two users; select the scheduling user based on the number of scheduling users and the correlation coefficient between every two users.
  • the candidate scheduling scheme is simple to implement and can effectively save computing resources.
  • the uplink channel coefficient matrix is used as the channel information
  • the base station estimates the uplink channel based on the pilot signal sent by the user to obtain the channel information covariance corresponding to each user.
  • the above step 101 may specifically include the following sub-steps.
  • Sub-step 1011 Perform uplink channel estimation based on the pilot signal sent by the kth user to obtain the uplink channel coefficient matrix
  • N BS is the number of antennas configured on the base station
  • N UE is the number of antennas configured on the user equipment.
  • the uplink channel coefficient matrix is obtained as Where 0 ⁇ N k ⁇ N UE indicates that the number of antennas used by the kth user for uplink transmission of pilot signals may be smaller than the number of antennas actually configured by the UE.
  • the uplink channel coefficient matrix H k is used as the channel coefficient matrix corresponding to the corresponding user.
  • Sub-step 1012 Based on the uplink channel coefficient matrix H k , construct the channel coefficient covariance matrix of the kth user in: is the conjugate transpose matrix of H k .
  • the base station constructs the channel information covariance matrix of the kth user as in: is the conjugate transpose matrix of H k .
  • this embodiment performs uplink channel estimation based on the pilot signal sent by the kth user to obtain the uplink channel coefficient matrix H k , and then constructs the channel coefficient agreement of the kth user based on the uplink channel coefficient matrix H k .
  • the variance matrix R k thus providing a specific way to calculate the channel coefficient covariance matrix R k .
  • Another embodiment of the present application relates to a user scheduling method in multi-antenna signal transmission.
  • the channel shaping vector and its corresponding channel power value are used as channel information, and the base station obtains the channel power value fed back by the user by sending a broadcast beam to the user, and then obtains based on the channel power value and the shaping vector of the broadcast beam
  • the channel coefficient covariance matrix corresponding to each user may specifically include the following sub-steps.
  • Sub-step 1013 based on sending Q k shaped vectors to the kth user as broadcast beam, receiving the channel power value fed back by the user for receiving the broadcast beam
  • N BS is the number of antennas configured on the base station.
  • the base station sends Q k broadcast beams to the kth user
  • its shaping vector is
  • N BS is the number of antennas configured on the base station
  • Q k is the shaping vector of the i-th broadcast beam.
  • the user feeds back the corresponding received channel power value
  • Q k is the received channel power value vector for receiving the i-th broadcast beam
  • diag( ⁇ ) is a diagonal matrix.
  • the channel power value U k is used as the channel coefficient matrix of the channel used by the corresponding user.
  • Sub-step 1014 Based on the channel power value U k and the shaping vector A k , construct the channel coefficient covariance matrix of the kth user in: is the conjugate transpose matrix of A k . Specifically, based on the received channel power value U k fed back by the kth user after receiving the broadcast beam, the base station constructs the channel information covariance matrix of the kth user as in: is the conjugate transpose matrix of A k .
  • this embodiment is based on the channel power value U k of receiving the broadcast beam fed back by the user after sending the broadcast beam A k to the kth user, and then based on the broadcast beam A k and the channel power value U k , construct The channel coefficient covariance matrix R k of the kth user, thus providing a specific method for calculating the channel coefficient covariance matrix R k .
  • the matrix codebook of the downlink channel is used as the channel information
  • the base station obtains the matrix codebook of the downlink channel fed back by the user by sending the downlink channel measurement pilot signal to the user, thereby obtaining the matrix codebook of each user based on the matrix codebook of the downlink channel.
  • the corresponding channel coefficient covariance matrix may specifically include the following sub-steps.
  • Sub-step 1015 Based on sending the downlink channel measurement pilot signal to the kth user, receive the matrix codebook of the downlink channel fed back by the user
  • N BS is the number of antennas configured on the base station
  • N UE is the number of antennas configured on the user equipment.
  • the corresponding downlink channel matrix codebook fed back by the user is Where 0 ⁇ L k ⁇ N UE indicates that the number of matrix direction vectors fed back by the kth user may be smaller than the number of antennas actually configured by the UE.
  • the downlink channel matrix codebook V k is used as the channel coefficient matrix of the corresponding user channel.
  • Sub-step 1016 Construct the channel coefficient covariance matrix of the kth user based on the matrix codebook V k in: is the conjugate transpose matrix of V k .
  • the base station constructs the channel information covariance matrix of the kth user as Specifically, based on the downlink channel matrix codebook V k fed back by the kth user after receiving the downlink channel measurement pilot signal, the base station constructs the channel information covariance matrix of the kth user as in: is the conjugate transpose matrix of V k .
  • this embodiment is based on sending the downlink channel measurement pilot signal to the kth user to obtain the downlink channel matrix codebook V k fed back by the user, and then construct the kth channel matrix codebook V k based on the downlink channel matrix codebook V k
  • the user's channel coefficient covariance matrix R k thus providing a specific method for calculating the channel coefficient covariance matrix R k .
  • Another embodiment of the present application relates to a user scheduling method in multi-antenna signal transmission.
  • a specific calculation method of calculating the correlation coefficient between every two users and how to select the scheduling user is shown according to the channel information covariance of each user (such as the channel coefficient covariance matrix).
  • the above step 102 may specifically include the following sub-steps.
  • Sub-step 1021 Calculate the correlation coefficient ⁇ i,j between the i-th user and the j-th user according to the following formula (1).
  • tr( ⁇ ) represents the trace of the matrix
  • F represents the norm of the matrix
  • R i and R j are the channel information covariance corresponding to the i-th user and the j-th user respectively.
  • the base station calculates the correlation coefficient between any two users according to the correlation of the channel coefficient covariance matrix.
  • the correlation coefficient between the i-th user and the j-th user can be expressed by formula (1).
  • R i and R j are the channel coefficient covariance matrices corresponding to the i-th user and the j-th user respectively.
  • ⁇ i,j ⁇ j,i .
  • the above step 103 may specifically include the following sub-steps.
  • Sub-step 1031 Select the two users with the smallest correlation coefficients as scheduling users.
  • the number of scheduled users is not greater than 2, at most two users may be selected as scheduled users in order to achieve utilization of time-frequency resources.
  • two users with the smallest correlation coefficients calculated according to the channel coefficient covariance matrix corresponding to each user can be selected as calling users.
  • Sub-step 1032 Calculate the correlation coefficient of each candidate user set based on the correlation coefficient between every two users, and select the user in the candidate user set with the smallest correlation coefficient as the scheduling user.
  • all candidate user sets can be constructed first according to the current existing number of users and the number of scheduled users, and the number of users included in each candidate user set is the number of scheduled users. Then, for the users contained in each candidate user set, the correlation coefficient between every two users is calculated, and then the correlation coefficient of the corresponding candidate user set is calculated according to the correlation coefficient between every two users. The lower the correlation coefficient corresponds to the lower the overall correlation among the users in the candidate user set. Selecting the user in the candidate user set with the smallest correlation coefficient as the scheduling user can reduce the interference between calling users in signal transmission.
  • calculating the correlation coefficient of each candidate user set based on the correlation coefficient between every two users may include the following steps.
  • Step 1 Construct based on the total number of existing users K and the number of scheduled users D There are several candidate scheduling schemes, and the users contained in each candidate scheduling scheme form a candidate user set.
  • Step 2 Collect the candidate users corresponding to the d-th candidate scheduling scheme
  • the geometric mean of the correlation coefficient between every two users set of candidate users The correlation coefficient of , where is the number of correlation coefficients between any two users included in the candidate user set.
  • the correlation coefficient is calculated as The method is to calculate the geometric mean value of the correlation coefficients between all two users in the candidate user set to represent the correlation coefficient of the candidate user set. This method can balance the impact of each user in the candidate user set on the overall relevance of the candidate user set, reflected in the correlation coefficient of the candidate user set. Therefore, users in the candidate user set with the smallest correlation coefficient can be selected as the scheme for scheduling users, that is,
  • formula (2) can be used for calculation, thereby saving computing resources and improving computing speed.
  • This method is to add the correlation coefficient between each user of the original candidate user set and the two users of the newly added user to the correlation coefficient of the previously calculated candidate user set, and then calculate all the two users in the candidate user set after the new user is added.
  • the geometric mean of the correlation coefficients between users is used as the correlation coefficient of the candidate user set, which reduces the amount of calculation and improves the calculation speed.
  • the set of candidate users with the smallest correlation coefficient can be selected as the scheme for scheduling users, that is,
  • this embodiment shows a specific way to calculate the correlation coefficient between every two users; at the same time, through the difference in the number of scheduled users, two implementation schemes for selecting and scheduling users are given; in addition, based on candidate Correlation coefficient of the user set
  • the previously calculated correlation coefficient of the candidate user set whose number of scheduling users is smaller than the current number of scheduling users can be used, thereby saving computing resources for calculating the correlation coefficient of the current candidate user set and improving the efficiency of selecting and calling users. s efficiency.
  • FIG. 6 Another embodiment of the present application relates to an electronic device, as shown in FIG. 6 , including at least one processor 202; and a memory 201 communicatively connected to at least one processor 202; Instructions executed by the processor 202, the instructions are executed by at least one processor 202, so that the at least one processor 202 can execute any one of the foregoing method embodiments.
  • the memory 201 and the processor 202 are connected by a bus, and the bus may include any number of interconnected buses and bridges, and the bus connects one or more processors 202 and various circuits of the memory 201 together.
  • the bus may also connect together various other circuits such as peripherals, voltage regulators, and power management circuits, all of which are well known in the art and therefore will not be further described herein.
  • the bus interface provides an interface between the bus and the transceivers.
  • a transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing means for communicating with various other devices over a transmission medium.
  • the data processed by the processor 202 is transmitted on the wireless medium through the antenna, and further, the antenna also receives the data and transmits the data to the processor 202 .
  • Processor 202 is responsible for managing the bus and general processing, and may also provide various functions including timing, peripheral interfacing, voltage regulation, power management, and other control functions. And the memory 201 may be used to store data used by the processor 202 when performing operations.
  • Another embodiment of the present application relates to a computer-readable storage medium storing a computer program.
  • the computer program is executed by the processor, any one of the above method embodiments is implemented.
  • a storage medium includes several instructions to make a device ( It may be a single-chip microcomputer, a chip, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disc, etc., which can store program codes. .
  • an embodiment of the present application also provides a computer program product, the computer program product includes a computer program stored on a non-transitory computer-readable storage medium, the computer program includes program instructions, and when the program instructions are executed When executed by a computer, the computer is made to execute the method in any of the above method embodiments.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)

Abstract

本申请实施例涉及通信技术领域，公开了一种多天线信号传输中的用户调度方法、电子设备及存储介质。通过获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差；根据各用户的信道信息协方差，计算每两个用户之间的相关系数；基于调度用户数和每两个用户之间的相关系数，选择调度用户。

Description

多天线信号传输中的用户调度方法、电子设备及存储介质
相关申请的交叉引用
本申请要求在2021年09月18日提交的中国专利申请第202111101818.9号的优先权，该中国专利申请的全部内容通过引用包含于此。
技术领域
本申请涉及通信技术领域，特别涉及一种多天线信号传输中的用户调度方法、电子设备及存储介质。
背景技术
为达到更高频谱使用效率，多天线技术在无线通信中得到了广泛的应用，基站(Base Station，BS)可以在同一个时频资源上，同时服务多个用户，即多用户多天线传输技术。因此，对用户之间的合理调度和资源分配，以达到较好的***容量，充分利用无线频谱资源就显得愈发重要。
在一些实例中，业界采用的方式是，基站根据***可达和速率、用户之间的正交性、以及空间距离分组聚类等方案来进行用户分类和调度，需要大量复杂的矩阵分解和迭代搜索计算过程，实现复杂度很高。
发明内容
本申请实施方式的目的在于提供一种多天线信号传输中的用户调度方法、电子设备及存储介质，用以解决多用户多天线信号传输通信中，基站在用户的传输调度上设计复杂度高的问题。
为解决上述技术问题，本申请的实施方式提供了一种多天线信号传输中的用户调度方法，所述方法应用于基站，包括：获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信 息协方差；根据所述各用户的信道信息协方差，计算每两个用户之间的相关系数；基于调度用户数和所述每两个用户之间的相关系数，选择调度用户。
本申请的实施方式还提供了一种电子设备，包括：至少一个处理器；以及，与所述至少一个处理器通信连接的存储器；其中，所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如上所述的多天线信号传输中的用户调度方法。
本申请的实施方式还提供了一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现如上所述的多天线信号传输中的用户调度方法。
附图说明
图1是根据本申请实施方式的多天线信号传输中的用户调度方法的具体流程图一；
图2是根据本申请实施方式的多天线信号传输中的用户调度方法的具体流程图二；
图3是根据本申请实施方式的多天线信号传输中的用户调度方法的具体流程图三；
图4是根据本申请实施方式的多天线信号传输中的用户调度方法的具体流程图四；
图5是根据本申请实施方式的多天线信号传输中的用户调度方法的具体流程图五；
图6是根据本申请实施方式的电子设备的结构示意图。
具体实施方式
为使本申请实施例的目的、技术方案和优点更加清楚，下面将结合附图 对本申请的各实施方式进行详细的阐述。然而，本领域的普通技术人员可以理解，在本申请各实施方式中，为了使读者更好地理解本申请而提出了许多技术细节。但是，即使没有这些技术细节和基于以下各实施方式的种种变化和修改，也可以实现本申请所要求保护的技术方案。
本申请的一实施方式涉及一种多天线信号传输中的用户调度方法，该方法可应用于基站(BS)。
如图1所示，本实施例提供的多天线信号传输中的用户调度方法，包括如下步骤。
步骤101：获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差。
其中，用户所使用信道为用户设备(User Equipment，UE)与BS之间为传输信号所使用的传输通路。BS采用多用户多天线传输技术，可以在同一个时频资源上同时服务多个用户。每个UE和BS上分别配置有多根用于传输信号的天线。
其中，信道信息可以包括但不局限于上行信道系数矩阵、信道赋形矢量及其相应信道功率值，和下行信道的矩阵码本中任一种。
具体地，本实施例中的对获取信道信息的方式不做限定，所获取的信道信息可采用矩阵的形式进行描述。在获取信道信息后，计算各用户所使用信道的信道信息协方差，并将该信道信息协方差记为对应于相应用户的信道信息协方差。每个用户对应一信道信息协方差，且随着信道信息的变化，信道信息协方差也在不断更新。
步骤102：根据各用户的信道信息协方差，计算每两个用户之间的相关系数。
具体地，对两个用户所对应的两个信道信息协方差，计算该两个信道信息协方差之间的相关系数，然后将该相关性系数作为这两个用户之间的相关系数。本实施例中对计算两个信道信息协方差之间的相关系数的计算方法不 做限定。
步骤103：基于调度用户数和每两个用户之间的相关系数，选择调度用户。
具体地，选择调度用户的原则为尽量选择用户之间相关性较低的用户作为调度用户进行调度，在给定调度用户数的基础上，可以从已有用户中选择给定调度用户数的且用户之间相关性较低的用户作为调度用户进行调度。本实施例对基于调度用户数和每两个用户之间的相关系数来选择调度用户的计算方法不做限定，只要遵循整体上所选择的调度用户的相关性低的原则即可。
与相关技术相比，本实施例通过获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差；根据各用户的信道信息协方差，计算每两个用户之间的相关系数；基于调度用户数和每两个用户之间的相关系数，选择调度用户。通过采用各用户所使用信道的信道信息协方差的统计信息计算用户之间的相关系数，可以得到较为稳定的用户之间的相关性结果，从而基于用户之间的相关性选择调度用户进行调度，同时该候选调度方案实现简单，能够有效节省计算资源。
本申请的另一实施方式涉及一种多天线信号传输中的用户调度方法。在本实施方式中，以上行信道系数矩阵作为信道信息，基站基于用户发送的导频信号对上行信道进行估计，得到各用户对应的信道信息协方差。相应的，如图2所示，上述步骤101可具体包括如下子步骤。
子步骤1011：基于第k个用户发送的导频信号进行上行信道估计，得到上行信道系数矩阵
Figure PCTCN2022119342-appb-000001
其中：0＜N k≤N UE，N BS为基站上配置的天线数量，N UE为用户设备上配置的天线数量。
例如，设UE的数量为K＝8，每个UE配置N UE＝4根天线，BS配置N BS＝64根天线。调度用户的数量为D＝2。
假设基站根据第k个用户发送的导频信号对UE到BS的上行信道进行估 计，得到上行信道系数矩阵为
Figure PCTCN2022119342-appb-000002
其中0＜N k≤N UE表示第k个用户上行发送导频信号的天线数可能小于UE实际配置的天线数。本实施例中将上行信道系数矩阵H k作为相应用户对应的信道系数矩阵。
子步骤1012：基于上行信道系数矩阵H k，构建第k个用户的信道系数协方差矩阵
Figure PCTCN2022119342-appb-000003
其中：
Figure PCTCN2022119342-appb-000004
为H k的共轭转置矩阵。
具体地，基站基于第k个用户的用户设备对应的上行信道系数矩阵，构造第k个用户的信道信息协方差矩阵为
Figure PCTCN2022119342-appb-000005
其中：
Figure PCTCN2022119342-appb-000006
为H k的共轭转置矩阵。
与相关技术相比，本实施例基于第k个用户发送的导频信号进行上行信道估计，得到上行信道系数矩阵H k，然后基于上行信道系数矩阵H k，构建第k个用户的信道系数协方差矩阵R k，从而提供一种计算信道系数协方差矩阵R k的具体方式。
本申请的另一实施方式涉及一种多天线信号传输中的用户调度方法。在本实施方式中，以信道赋形矢量及其相应的信道功率值作为信道信息，基站通过向用户发送广播波束得到用户反馈的信道功率值，从而基于信道功率值以及广播波束的赋形矢量得到各用户对应的信道系数协方差矩阵。相应的，如图3所示，上述步骤101可具体包括如下子步骤。
子步骤1013：基于向第k个用户发送Q k个赋形矢量为
Figure PCTCN2022119342-appb-000007
的广播波束，接收用户反馈的接收所述广播波束的信道功率值
Figure PCTCN2022119342-appb-000008
其中：N BS为基站上配置的天线数量。
例如，设UE的数量为K＝8，每个UE配置N UE＝4根天线，BS配置N BS＝64根天线。调度用户的数量为D＝2。
具体地，假设基站向第k个用户发送Q k个广播波束，其赋形矢量为
Figure PCTCN2022119342-appb-000009
其中：N BS为基站上配置的天线数量，a t,i＝1,2,...,Q k为第i个广播波束的赋形矢量。用户接收到广播波束后分别反馈对应的接收信道功率值
Figure PCTCN2022119342-appb-000010
其中，u t,i＝1,2,...,Q k为接收第i个广播波束的接收信道功率值矢量，diag(·)为对角矩阵。本实施例中将信道功率值U k作为相应用户所使用信道的信道系数矩阵。
子步骤1014：基于信道功率值U k和赋形矢量A k，构建第k个用户的信道系数协方差矩阵
Figure PCTCN2022119342-appb-000011
其中：
Figure PCTCN2022119342-appb-000012
为A k的共轭转置矩阵。具体地，基站基于第k个用户接收到广播波束后反馈的接收信道功率值U k，构造第k个用户的信道信息协方差矩阵为
Figure PCTCN2022119342-appb-000013
其中：
Figure PCTCN2022119342-appb-000014
为A k的共轭转置矩阵。
与相关技术相比，本实施例基于向第k个用户发送广播波束A k后，得到用户反馈的接收广播波束的信道功率值U k，然后基于广播波束A k和信道功率值U k，构建第k个用户的信道系数协方差矩阵R k，从而提供一种计算信道系数协方差矩阵R k的具体方式。
本申请的另一实施方式涉及一种多天线信号传输中的用户调度方法。在本实施方式中，以下行信道的矩阵码本作为信道信息，基站通过向用户发送下行信道测量导频信号得到用户反馈的下行信道的矩阵码本，从而基于下行信道的矩阵码本得到各用户对应的信道系数协方差矩阵。相应的，如图4所示，上述步骤101可具体包括如下子步骤。
子步骤1015：基于向第k个用户发送下行信道测量导频信号，接收用户反馈的下行信道的矩阵码本
Figure PCTCN2022119342-appb-000015
其中：0＜L k≤N UE，N BS为基站上配置的天线数量，N UE为用户设备上配置的天线数量。
例如，设UE的数量为K＝8，每个UE配置N UE＝4根天线，BS配置N BS＝64根天线。调度用户的数量为D＝2。
具体地，假设基站向第k个用户发送下行信道测量导频信号，用户反馈对应的下行信道矩阵码本为
Figure PCTCN2022119342-appb-000016
其中0＜L k≤N UE表示第k个用户反馈的矩阵方向矢量数可能小于UE实际配置的天线数。本实施例中将下行信道矩阵码本V k作为相应用户信道的信道系数矩阵。
子步骤1016：基于矩阵码本V k，构建第k个用户的信道系数协方差矩阵
Figure PCTCN2022119342-appb-000017
其中：
Figure PCTCN2022119342-appb-000018
为V k的共轭转置矩阵。
基站基于用户信道信息，构造第k个用户的信道信息协方差矩阵为
Figure PCTCN2022119342-appb-000019
具体地，基站基于第k个用户接收到下行信道测量导频信号后反馈的下行信道矩阵码本V k，构造第k个用户的信道信息协方差矩阵为
Figure PCTCN2022119342-appb-000020
其中：
Figure PCTCN2022119342-appb-000021
为V k的共轭转置矩阵。
与相关技术相比，本实施例基于向第k个用户发送下行信道测量导频信号后，得到用户反馈的下行信道矩阵码本V k，然后基于下行信道矩阵码本V k，构建第k个用户的信道系数协方差矩阵R k，从而提供一种计算信道系数协方差矩阵R k的具体方式。
本申请的另一实施方式涉及一种多天线信号传输中的用户调度方法。在本实施方式中，示出了一种根据各用户的信道信息协方差(如信道系数协方差矩阵)，计算每两个用户之间的相关系数，以及如何选择调度用户的具体计算方式。相应的，如图5所示，上述步骤102可具体包括如下子步骤。
子步骤1021：根据如下公式(1)计算第i个用户与第j个用户之间的相关系数ρ i,j。
Figure PCTCN2022119342-appb-000022
其中，tr(·)表示矩阵的迹，||·|| F表示矩阵的范数，R i、R j分别为第i个用户 和第j个用户对应的信道信息协方差。
具体地，基站得到各用户对应的信道系数协方差矩阵后，根据信道系数协方差矩阵的相关性，计算任意两个用户之间的相关系数。第i个用户与第j个用户之间的相关系数可通过公式(1)表示。其中，R i、R j分别为第i个用户与第j个用户对应的信道系数协方差矩阵。同时有ρ i,j＝ρ j,i。采用信道系数协方差矩阵的统计信息计算用户之间的相关系数，可以得到较为稳定的结果。
在此基础上，如图5中所示，上述步骤103可具体包括如下子步骤。
判断调度用户数是否不大于2；如果判断结果为是，则进入子步骤1031；如果判断结果为否，则进入子步骤1032。
子步骤1031：选择相关系数最小的两个用户作为调度用户。
具体地，当调度用户数不大于2时，为了实现时频资源的利用率可以选择至多两个用户作为调度用户。遵照调度用户之间相关性低的原则，可以选择根据各用户对应的信道系数协方差矩阵，计算的相关系数最小的两个用户作为调用用户。
子步骤1032：基于每两个用户之间的相关系数计算各候选用户集合的相关系数，并选择相关系数最小的候选用户集合中的用户作为调度用户。
具体地，当调度用户数大于2时，可以先根据当前已有的用户数和调度用户数构建出全部的候选用户集合，每个候选用户集合中包含的用户数为调度用户数。然后针对各候选用户集合中所包含的用户，计算每两个用户之间的相关系数，再根据每两个用户之间的相关系数，计算相应候选用户集合的相关系数。该相关系数越低对应候选用户集合中各用户之间的整体相关性越低。选择相关系数最小的候选用户集合中的用户作为调度用户，可以降低调用用户之间在信号传输上的干扰。
在一个例子中，子步骤1032中，基于每两个用户之间的相关系数计算各候选用户集合的相关系数可包括以下步骤。
步骤1：基于已有用户总数K和调度用户数D构建
Figure PCTCN2022119342-appb-000023
种候选调度方案， 每种候选调度方案所包含的用户组成一个候选用户集合。
例如，设UE的数量为K＝8，每个UE配置N UE＝4根天线，BS配置N BS＝64根天线。调度用户的数量为D＝3。根据概率中的排列组合可以得到
Figure PCTCN2022119342-appb-000024
种用户组合，每种用户组合对应一种候选调度方案，每种候选调度方案所包含的用户组成一个候选用户集合。
步骤2：将第d种候选调度方案对应的候选用户集合
Figure PCTCN2022119342-appb-000025
中，每两个用户之间的相关系数的几何平均值
Figure PCTCN2022119342-appb-000026
作为候选用户集合
Figure PCTCN2022119342-appb-000027
的相关系数，其中
Figure PCTCN2022119342-appb-000028
为候选用户集合所包含的任意两个用户之间的相关系数的个数。
具体地，假设
Figure PCTCN2022119342-appb-000029
Figure PCTCN2022119342-appb-000030
是第d个候选调度方案中的用户集合，于是
Figure PCTCN2022119342-appb-000031
的相关系数计算为
Figure PCTCN2022119342-appb-000032
该方法是计算候选用户集合中所有两用户之间相关系数的几何平均值，来表示该候选用户集合的相关系数。这种方法可以均衡的将候选用户集合中的每个用户对于候选用户集合的整体相关性影响，体现在候选用户集合的相关系数中。于是，可以选择相关系数最小的候选用户集合中的用户作为调度用户的方案，即
Figure PCTCN2022119342-appb-000033
在一个例子中，在计算上述几何平均值
Figure PCTCN2022119342-appb-000034
之前，如果已经计算完成调度用户数为E的
Figure PCTCN2022119342-appb-000035
种候选调度方案对应的各候选用户集合的相关系数，其中E＜D，则计算几何平均值
Figure PCTCN2022119342-appb-000036
包括：
通过如下公式
Figure PCTCN2022119342-appb-000037
计算几何平均值
Figure PCTCN2022119342-appb-000038
其中，
Figure PCTCN2022119342-appb-000039
为候选用户集合
Figure PCTCN2022119342-appb-000040
中所包含的候选用户集合
Figure PCTCN2022119342-appb-000041
的相关系数。
例如，设UE的数量为K＝8，每个UE配置N UE＝4根天线，BS配置N BS＝64根天线。当前调度用户的数量为D＝4。根据概率中的排列组合可以得到
Figure PCTCN2022119342-appb-000042
种用户组合，每种用户组合对应一种候选调度方案，每种候选调度方案所包含的用户组成一个候选用户集合，候选用户集合中包含的用户数为D。
假设
Figure PCTCN2022119342-appb-000043
Figure PCTCN2022119342-appb-000044
是第d个候选调度方案中的用户集合，于是
Figure PCTCN2022119342-appb-000045
的相关系数计算为
Figure PCTCN2022119342-appb-000046
在计算
Figure PCTCN2022119342-appb-000047
之前，已计算完成第d个候选调度方案中用户数小于D的E(如E＝3)个用户所形成的用户集合的相关系数
Figure PCTCN2022119342-appb-000048
这样在计算当前第d个候选调度方案对应的候选用户集合的相关系数
Figure PCTCN2022119342-appb-000049
时，可以采用公式(2)进行计算，从而节省计算资源，提高计算速度。其中，
Figure PCTCN2022119342-appb-000050
可以为距离当前用户调度时间较近的一次用户调度对应计算出的候选用户集合的相关系数
Figure PCTCN2022119342-appb-000051
该方法是在之前计算的候选用户集合的相关系数中，加入原候选用户集合每一个用户与新增用户的两用户之间的相关系数，再总体计算新增用户后候选用户集合中的所有两用户之间的相关系数的几何平均值作为候选用户集合的相关系数，减少了计算量，提高了计算速度。最后，可以选择相关系数最小的候选用户集合作为调度用户的方案，即
Figure PCTCN2022119342-appb-000052
与相关技术相比，本实施例示出了计算每两个用户之间的相关系数的具体方式；同时，通过调度用户数的不同，给出两种选择调度用户的实现方案；另外，在基于候选用户集合的相关系数选择调度用户时，可以沿用之前已计算的调度用户数小于当前调度用户数的候选用户集合的相关系数，从而节省计算当前候选用户集合的相关系数的计算资源，提高选择调用用户的效率。
本申请的另一实施方式涉及一种电子设备，如图6所示，包括至少一个处理器202；以及，与至少一个处理器202通信连接的存储器201；其中，存储器201存储有可被至少一个处理器202执行的指令，指令被至少一个处理器202执行，以使至少一个处理器202能够执行上述任一方法实施例。
其中，存储器201和处理器202采用总线方式连接，总线可以包括任意数量的互联的总线和桥，总线将一个或多个处理器202和存储器201的各种电路连接在一起。总线还可以将诸如***设备、稳压器和功率管理电路等之类的各种其他电路连接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口在总线和收发机之间提供接口。收发机可以是一个元件，也可以是多个元件，比如多个接收器和发送器，提供用于在传输介质上与各种其他装置通信的单元。经处理器202处理的数据通过天线在无线介质上进行传输，进一步，天线还接收数据并将数据传送给处理器202。
处理器202负责管理总线和通常的处理，还可以提供各种功能，包括定时，***接口，电压调节、电源管理以及其他控制功能。而存储器201可以被用于存储处理器202在执行操作时所使用的数据。
本申请的另一实施方式涉及一种计算机可读存储介质，存储有计算机程序。计算机程序被处理器执行时实现上述任一方法实施例。
即，本领域技术人员可以理解，实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，该程序存储在一个存储介质中，包括若干指令用以使得一个设备(可以是单片机，芯片等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
此外，本申请实施例还提供了一种计算机程序产品，所述计算机程序产品包括存储在非暂态计算机可读存储介质上的计算机程序，所述计算机程序 包括程序指令，当所述程序指令被计算机执行时，使所述计算机执行上述任意方法实施例中的方法。
本领域的普通技术人员可以理解，上述各实施方式是实现本申请的具体实施例，而在实际应用中，可以在形式上和细节上对其作各种改变，而不偏离本申请的精神和范围。

Claims (10)

  1. 一种多天线信号传输中的用户调度方法，所述方法应用于基站，包括：
    获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差；
    根据所述各用户的信道信息协方差，计算每两个用户之间的相关系数；
    基于调度用户数和所述每两个用户之间的相关系数，选择调度用户。
  2. 根据权利要求1所述的方法，其中，所述获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差，包括：
    基于第k个用户发送的导频信号进行上行信道估计，得到上行信道系数矩阵
    Figure PCTCN2022119342-appb-100001
    其中：0＜N k≤N UE，N BS为基站上配置的天线数量，N UE为用户设备上配置的天线数量；
    基于所述上行信道系数矩阵H k，构建第k个用户的信道系数协方差矩阵
    Figure PCTCN2022119342-appb-100002
    其中：
    Figure PCTCN2022119342-appb-100003
    为H k的共轭转置矩阵。
  3. 根据权利要求1所述的方法，其中，所述获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信息协方差，包括：
    基于向第k个用户发送Q k个赋形矢量为
    Figure PCTCN2022119342-appb-100004
    的广播波束，接收所述用户反馈的接收所述广播波束的信道功率值
    Figure PCTCN2022119342-appb-100005
    其中：N BS为基站上配置的天线数量；
    基于所述信道功率值U k和所述赋形矢量A k，构建第k个用户的信道系数协方差矩阵
    Figure PCTCN2022119342-appb-100006
    其中：
    Figure PCTCN2022119342-appb-100007
    为A k的共轭转置矩阵。
  4. 根据权利要求1所述的方法，其中，所述获取多个用户所使用信道的信道信息，并根据各用户所使用信道的信道信息构建对应于各用户的信道信 息协方差，包括：
    基于向第k个用户发送下行信道测量导频信号，接收用户反馈的所述下行信道的矩阵码本
    Figure PCTCN2022119342-appb-100008
    其中：0＜L k≤N UE，N BS为基站上配置的天线数量，N UE为用户设备上配置的天线数量；
    基于所述矩阵码本V k，构建第k个用户的信道系数协方差矩阵
    Figure PCTCN2022119342-appb-100009
    其中：
    Figure PCTCN2022119342-appb-100010
    为V k的共轭转置矩阵。
  5. 根据权利要求1-4中任一项所述的方法，其中，所述根据所述各用户的信道信息协方差，计算每两个用户之间的相关系数，包括：
    根据
    Figure PCTCN2022119342-appb-100011
    计算第i个用户与第j个用户之间的相关系数ρ i,j；
    其中，tr(·)表示矩阵的迹，||·|| F表示矩阵的范数，R i、R j分别为第i个用户和第j个用户对应的信道信息协方差。
  6. 根据权利要求5所述的方法，其中，所述基于调度用户数和所述每两个用户之间的相关系数，选择调度用户，包括：
    当调度用户数不大于2时，则选择所述相关系数最小的两个用户作为调度用户；
    当调度用户数大于2时，则基于所述每两个用户之间的相关系数计算各候选用户集合的相关系数，并选择所述相关系数最小的候选用户集合中的用户作为调度用户。
  7. 根据权利要求6所述的方法，其中，所述当调度用户数大于2时，则基于所述每两个用户之间的相关系数计算各候选用户集合的相关系数，包括：
    基于已有用户总数K和所述调度用户数D构建
    Figure PCTCN2022119342-appb-100012
    种候选调度方案，每种所述候选调度方案所包含的用户组成一个所述候选用户集合；
    将第d种候选调度方案对应的候选用户集合
    Figure PCTCN2022119342-appb-100013
    中，每两个用户之间的相 关系数的几何平均值
    Figure PCTCN2022119342-appb-100014
    作为所述候选用户集合
    Figure PCTCN2022119342-appb-100015
    的相关系数，其中
    Figure PCTCN2022119342-appb-100016
    为所述候选用户集合所包含的任意两个用户之间的相关系数的个数。
  8. 根据权利要求7所述的方法，其中，在计算所述几何平均值
    Figure PCTCN2022119342-appb-100017
    之前，如果已经计算完成调度用户数为E的
    Figure PCTCN2022119342-appb-100018
    种候选调度方案对应的各候选用户集合的相关系数，其中E＜D，则计算所述几何平均值
    Figure PCTCN2022119342-appb-100019
    包括：
    通过
    Figure PCTCN2022119342-appb-100020
    计算所述几何平均值
    Figure PCTCN2022119342-appb-100021
    其中，
    Figure PCTCN2022119342-appb-100022
    为候选用户集合
    Figure PCTCN2022119342-appb-100023
    中所包含的候选用户集合
    Figure PCTCN2022119342-appb-100024
    的相关系数。
  9. 一种电子设备，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如权利要求1至8中任一项所述的多天线信号传输中的用户调度方法。
  10. 一种计算机可读存储介质，存储有计算机程序，其中，所述计算机程序被处理器执行时实现根据权利要求1至8中任一项所述的多天线信号传输中的用户调度方法。
PCT/CN2022/119342 2021-09-18 2022-09-16 多天线信号传输中的用户调度方法、电子设备及存储介质 WO2023041045A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP22869411.3A EP4383636A1 (en) 2021-09-18 2022-09-16 User scheduling method in multi-antenna signal transmission, and electronic device and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111101818.9A CN115843121A (zh) 2021-09-18 2021-09-18 多天线信号传输中的用户调度方法、电子设备及存储介质
CN202111101818.9 2021-09-18

Publications (1)

Publication Number Publication Date
WO2023041045A1 true WO2023041045A1 (zh) 2023-03-23

Family

ID=85575189

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/119342 WO2023041045A1 (zh) 2021-09-18 2022-09-16 多天线信号传输中的用户调度方法、电子设备及存储介质

Country Status (3)

Country Link
EP (1) EP4383636A1 (zh)
CN (1) CN115843121A (zh)
WO (1) WO2023041045A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829113A (zh) * 2005-03-04 2006-09-06 松下电器产业株式会社 一种信道自适应的多用户多输入多输出传输调度方法
CN103532607A (zh) * 2013-10-23 2014-01-22 东南大学 大规模mimo***的选择基站天线和用户终端方法
US20150372727A1 (en) * 2014-06-23 2015-12-24 Nokia Corporation Joint precoder and receiver design for mu-mimo downlink
CN105262524A (zh) * 2015-09-06 2016-01-20 西安电子科技大学 基于反馈补偿的mimo***的多用户调度方法
CN107070624A (zh) * 2017-03-23 2017-08-18 东南大学 一种基于大尺度衰落和多路径到达角的多用户导频调度方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1829113A (zh) * 2005-03-04 2006-09-06 松下电器产业株式会社 一种信道自适应的多用户多输入多输出传输调度方法
CN103532607A (zh) * 2013-10-23 2014-01-22 东南大学 大规模mimo***的选择基站天线和用户终端方法
US20150372727A1 (en) * 2014-06-23 2015-12-24 Nokia Corporation Joint precoder and receiver design for mu-mimo downlink
CN105262524A (zh) * 2015-09-06 2016-01-20 西安电子科技大学 基于反馈补偿的mimo***的多用户调度方法
CN107070624A (zh) * 2017-03-23 2017-08-18 东南大学 一种基于大尺度衰落和多路径到达角的多用户导频调度方法

Also Published As

Publication number Publication date
CN115843121A (zh) 2023-03-24
EP4383636A1 (en) 2024-06-12

Similar Documents

Publication Publication Date Title
US8464105B2 (en) Method of multiuser precoding and scheduling and base station for implementing the same
KR101524689B1 (ko) 간섭 정렬을 위하여 선택적으로 간섭 채널들에 대한 정보를피드백하는 통신 시스템 및 그 방법
WO2021008477A1 (zh) 预编码处理方法和装置
US10171267B2 (en) Uplink pilot sequence allocation method in massive MIMO system and base station thereof
CN110808765B (zh) 一种基于不完全信道信息的大规模mimo***频谱效率优化的功率分配方法
KR101576915B1 (ko) 낮은 복잡도의 공동의 유출 억압 기법을 사용하는 통신 시스템
US10666329B2 (en) Method and device for beam forming
CN114169243B (zh) Mimo干扰信道下空中计算多任务联邦学习方法
CN109905917B (zh) 基于无线携能的noma通信***中无线资源分配方法
CN112994762B (zh) 基于统计csi的mimo-noma下行自适应无线传输方法
Li et al. IRS-based MEC for delay-constrained QoS over RF-powered 6G mobile wireless networks
CN109818887A (zh) 基于evd-ilsp的半盲信道估计方法
US20220321187A1 (en) Channel State Information Processing Method and Apparatus, and Channel State Information Receiving Method and Apparatus
WO2023041045A1 (zh) 多天线信号传输中的用户调度方法、电子设备及存储介质
US11411600B2 (en) Processing of uplink data streams
WO2020118728A1 (zh) 通信方法及装置
CN103929224A (zh) 蜂窝网络中干扰抑制方法及装置
US9288029B2 (en) Method and apparatus for adaptive channel direction information feedback in a heterogeneous system
US20230361820A1 (en) Downlink symbol-level precoding as part of multiuser miso communication
WO2020259138A1 (zh) 一种预编码方法及装置
CN111277307B (zh) 一种有限反馈欠秩信道时mu-mimo***的资源分配方法
WO2023030074A1 (zh) 用户配对方法、装置、电子设备和存储介质
CN115378767A (zh) 延迟多普勒域信道信息反馈方法、装置及电子设备
WO2023116703A1 (zh) 预编码矩阵获取方法、装置、电子设备和存储介质
WO2023231639A1 (zh) 发射天线选择方法及装置、计算机设备及计算机存储介质

Legal Events

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

Ref document number: 22869411

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022869411

Country of ref document: EP

Effective date: 20240306

NENP Non-entry into the national phase

Ref country code: DE