A method and device for obtaining a precoding matrix
By calculating the statistical autocorrelation matrix of the terminal, the joint precoding matrix is obtained, which solves the problem of inter-stream interference caused by channel aging and improves the downlink transmission performance of the 5G New Radio network.
Patent Information
- Application Number
- CN202110738192.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-06-30
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2041-06-30
AI Technical Summary
In precoding technology, existing technologies struggle to effectively address how to reduce inter-stream interference and improve downlink throughput performance in 5G New Radio networks, especially under channel aging conditions.
By calculating the statistical autocorrelation matrix of the terminal, a joint precoding matrix is obtained. Considering channel aging factors, inter-stream interference is reduced, and downlink transmission performance is improved.
It effectively reduces inter-stream interference, improves downlink transmission performance, and enhances the throughput and robustness of the communication system.
Smart Images

Figure CN115549739B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a method and device for obtaining a precoding matrix. Background Art
[0002] The fifth generation (5G) new radio (NR) is a new wireless access technology developed by the 3rd Generation Partnership Project (3GPP) for 5G mobile communication networks. The 5G mobile communication network is designed to achieve the following functions:
[0003] Enhanced mobile broadband (eMBB): for data-intensive applications such as augmented reality (AR), three-dimensional (3D) video conferencing, two-dimensional (2D) streaming video, fixed wireless Internet access points, and other high-bandwidth applications.
[0004] Massive machine-type communications (mMTC): for large-scale Internet of Things (IoT) connections, including high-density arrays of sensors and devices in connected cities and connected homes, devices used to monitor complex global supply chains, and connected devices moving at high speeds.
[0005] Ultra-reliable low-latency communication (URLLC): Suitable for mission-critical real-time applications such as industrial control systems, autonomous vehicles, and applications such as remote real-time surgery that require high bandwidth, high reliability, and low latency.
[0006] In order to achieve the above functions, one technology is to use a large-scale antenna array and different precoding technologies to achieve the function of simultaneous transmission of different users and improve the throughput of the entire network. However, in precoding technology, how to reduce the interference between streams and improve the downlink throughput performance is an urgent problem to be solved. Summary of the invention
[0007] The embodiments of the present application provide a method, a communication device, and a communication system for obtaining a precoding matrix. By calculating the joint precoding matrix of M terminals based on the statistical autocorrelation matrix of N terminals, the channel aging factor can be considered in advance, thereby improving the robustness of the precoding matrix, reducing interference between downlink streams, and improving downlink transmission performance.
[0008] In a first aspect, the present application provides a method for obtaining a precoding matrix, which can be performed by a network device or a chip in the network device. The network device can be a network device in an architecture where a centralized unit (CU) and a distributed unit (DU) are not separated, or can be a CU or DU in an architecture where a CU and DU are separated, or can be a CU control plane (CU control plane, CU-CP) and a CU user plane (CU user plane, CU-UP) separated architecture. CU-CP or CU-UP, or DU and radio unit (radio unit, RU) can be separated under an architecture where a DU or RU is in a separated architecture, or can be a centralized controller, etc.
[0009] The method comprises: firstly obtaining a joint precoding matrix of the M terminals according to statistical autocorrelation matrices respectively corresponding to N terminals among the M terminals, where M and N are positive integers, M≥2, 1≤N≤M; and then outputting information indicating the joint precoding matrix.
[0010] For the convenience of description, the terminal among the M terminals is referred to as m. i , i is a positive integer, 1≤i≤M. The terminal among the N terminals is called terminal n j , j is a positive integer, 1≤j≤N.
[0011] Among them, in the above method, the terminal n j The corresponding statistical autocorrelation matrix For this terminal n j The corresponding autocorrelation matrix The terminal n is obtained by filtering in the frequency domain and / or time domain. j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result Got it.
[0012] The statistical autocorrelation matrix is a matrix obtained after processing the autocorrelation matrix. The statistical autocorrelation matrix in this application can be called a filtered autocorrelation matrix, a cumulative autocorrelation matrix, an average autocorrelation matrix, a historical autocorrelation matrix or a processed autocorrelation matrix, etc., or the statistical autocorrelation matrix can have other names, which are not limited in this application.
[0013] Since the terminal n j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result The terminal n j The corresponding statistical autocorrelation matrix For this terminal n j The corresponding autocorrelation matrix After filtering in the frequency domain and / or time domain, it can be understood that the terminal n j The corresponding statistical autocorrelation matrix Indicates the terminal n j The channel estimation results on multiple resources (frequency domain resources and / or time domain resources) in history. The historical channel estimation results can predict the future channel conditions to a certain extent and reflect the general direction of the future channel. Therefore, in the calculation process of the joint precoding matrix, by considering the statistical autocorrelation matrix of the N terminals, that is, the historical channel estimation results of the N terminals, the future channel conditions of the N terminals can be considered in advance, which helps to alleviate the impact of channel aging, improve the robustness of the precoding matrix, reduce inter-stream interference, and increase downlink throughput, thereby improving downlink transmission performance.
[0014] In one possible implementation, Can include Wherein, r is the number of the subcarrier, r = 1, 2 ... R, r and R are integers greater than or equal to 1, t is the number of the time, t = 1, 2 ... T, t and T are integers greater than or equal to 1, Indicates the network device and terminal n at time t and subcarrier r j The channel estimation result of the channel between .
[0015] Autocorrelation matrix Can include Autocorrelation matrix The channel estimation result The relationship between can be expressed as in, express The conjugate transposed matrix of .
[0016] In a possible implementation, filtering in the frequency domain and / or time domain includes 1) filtering in the frequency domain, 2) filtering in the time domain, and 3) filtering in the frequency domain and filtering in the time domain. This is described below with reference to several examples.
[0017] 1) For the autocorrelation matrix The filtering in the frequency domain can be expressed as
[0018] Optionally, the value of R may be determined according to the RBG or the scheduling bandwidth. For example, one RBG may include 48 subcarriers, that is, R may be 48. For another example, R may be the number of subcarriers included in the scheduling bandwidth. For example, the scheduling bandwidth may include 4 RBGs, that is, the scheduling bandwidth includes 4*48=192 subcarriers, and R is 192.
[0019] By increasing the value of Q, a frequency domain autocorrelation matrix over a sufficiently wide bandwidth can be obtained, which can be closer to the channel space in the time domain and improve the accuracy of calculating the statistical autocorrelation matrix, thereby better avoiding inter-stream interference and improving downlink performance.
[0020] 2) For the autocorrelation matrix The filtering in the time domain can be expressed as γ and β represent filter coefficients and can be scalars. When t = 1, When t = 2, When t=3, And so on.
[0021] 3) For the autocorrelation matrix Filtering in the frequency domain and filtering in the time domain can be expressed as in, As mentioned above, γ and β represent filter coefficients and can be scalars. When t = 1, When t = 2, When t=3, And so on.
[0022] Statistical Autocorrelation Matrix Can be the above or
[0023] In one possible implementation, the statistical autocorrelation matrix It includes T main diagonal blocks and zero elements outside the T main diagonal blocks, where T is an integer greater than or equal to 2. Optionally, the zero element may be one or more.
[0024] Optionally, the statistical autocorrelation matrix It may be composed of the T main diagonal blocks and zero elements outside the T main diagonal blocks, that is, all elements outside the T main diagonal blocks are zero elements.
[0025] In the present application, the value of T may be determined according to the number of polarization directions of the antenna of the network device. As an example, T may be the number of polarization directions. The number of polarization directions may be 2, 3, 4 or a larger integer.
[0026] The main diagonal block can represent the autocorrelation value of the same polarization direction, and the non-main diagonal block represents the cross-correlation value between different polarization directions. By setting one or more elements outside the main diagonal block to zero and ignoring the correlation between polarizations, the calculation can be simplified, the complexity can be reduced, and resources can be saved.
[0027] In a possible implementation, the N terminals may be terminals whose channel correlations satisfy a first preset condition among the M terminals. An example of the channel correlation satisfying the first preset condition is that the channel correlation is lower than a threshold. The higher the channel correlation, the smaller the change in the channel. Conversely, the smaller the channel correlation, the larger the change in the channel.
[0028] By performing the statistical autocorrelation matrix operation on the terminal with a larger channel variation, and not performing the statistical autocorrelation matrix operation on the terminal with a smaller channel variation, processing resources can be saved and complexity can be reduced.
[0029] In a possible implementation, in the method of the first aspect above, the output may be output by the network device to other network devices.
[0030] As an implementation method, the output may be output from a module in the network device to other modules of the network device, for example, output through an interface, etc., and the interface may be a circuit. The module may be referred to as a unit, which may be a physical unit or a logical unit, and this application does not limit this.
[0031] The information indicating the joint precoding matrix can be understood as the information according to which the joint precoding matrix can be obtained. There are many ways to implement the information, which are described below.
[0032] As an implementation manner, the information may be the joint precoding matrix itself.
[0033] As another implementation manner, the information may be information indicating a compression matrix, where the compression matrix corresponds to the joint precoding matrix.
[0034] By outputting information indicating the compression matrix, the overhead of the output information can be saved and communication resources can be saved.
[0035] As another implementation, the information may be an index of the joint precoding matrix. By outputting the index, the overhead of the information can be saved, and communication resources can be saved.
[0036] In a possible implementation, the joint precoding matrix includes precoding matrices corresponding to the M terminals respectively. Here, the precoding matrices corresponding to the M terminals respectively may be referred to as multi-user precoding matrices. Assuming that the M terminals include a first terminal, there may be multiple possibilities for the relationship between the precoding matrix corresponding to the first terminal and the statistical autocorrelation matrix corresponding to the N terminals respectively. Two examples are described below:
[0037] In the first example, the M terminals include the N terminals and the first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to the statistical autocorrelation matrices corresponding to the N terminals respectively. That is, the first terminal does not belong to the N terminals, and the precoding matrix corresponding to the first terminal is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively.
[0038] In the second example, N≥2, the N terminals include a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to statistical autocorrelation matrices corresponding to N-1 terminals other than the first terminal in the N terminals. That is, the first terminal belongs to the N terminals, and the precoding matrix corresponding to the first terminal is obtained based on statistical autocorrelation matrices corresponding to N-1 terminals other than the first terminal.
[0039] Optionally, in the second example, the precoding matrix corresponding to the first terminal is also related to the statistical autocorrelation matrix corresponding to the first terminal. That is, the precoding matrix corresponding to the first terminal is obtained based on the statistical autocorrelation matrices corresponding to N-1 terminals except the first terminal, and the statistical autocorrelation matrix corresponding to the first terminal.
[0040] In a possible implementation, a single-user precoding matrix of each of the M terminals may be calculated first, and then a multi-user precoding matrix of the terminal may be calculated. Then, the multi-user precoding matrices of the terminals may be concatenated to obtain the joint precoding matrix.
[0041] Terminal m i The single-user precoding matrix can be expressed as Terminal m i The single-user precoding matrix It can be based on the terminal m i The channel estimation result of Got it, It can represent the network device and terminal m at time t and subcarrier r i The channel estimation result of the channel between , the meanings of r and t can refer to the above description.
[0042] Assume that M and N are the same, that is, the N terminals are the M terminals. The following combines two examples to calculate each terminal m k Assume that the terminal m k For terminal n l , 1≤l≤N, can be replaced by each other, and M and N can be replaced by each other.
[0043] As a first example, first calculate the number of terminals except terminal m among the N terminals. k The sum of the statistical autocorrelation matrices of other terminals other than in, Indicates terminal n j The channel correlation of Can be a number between 0 and 1. For terminal n j The corresponding channel estimation noise, I is the unit matrix. Then, calculate the terminal m k The multi-user precoding matrix For terminal m k The channel correlation of For terminal m i The single-user precoding matrix is For terminal m k The single-user precoding matrix is
[0044] In the first example above, The formula can be understood as, terminal m k The precoding matrix not only avoids the M terminals except terminal m k The channel space of other terminals other than ), and also avoid the possible channel space of other terminals in the future (which can be represented by ), thereby increasing the dimension of weight avoidance, which can reduce the interference between downlink flows and improve the performance of downlink data transmission.
[0045] From the first example above, we can see that terminal m k The corresponding multi-user precoding is the same as that of the N terminals except for terminal m k The statistical autocorrelation matrix of the terminals other than k It can be understood as the first terminal mentioned above.
[0046] In the first example above, each terminal m can be k , calculate separately except terminal m k The sum of the statistical autocorrelation matrices of the terminals other than k The multi-user precoding matrix
[0047] As a second example, the sum of the statistical autocorrelation matrices of the N terminals is first calculated, for example, Then, calculate the terminal m k The multi-user precoding matrix The meaning of the formula can refer to the first example above.
[0048] In the second example above, the sum of the statistical autocorrelation matrices of the N terminals may be calculated, and then the sum of the statistical autocorrelation matrices of the N terminals may be inverted. k , supplement terminal m k Thus, the statistical autocorrelation matrices of N terminals can be summed up and inverted once, which can reduce the number of summations and inversions of the statistical autocorrelation matrices, reduce computational complexity, and save processing resources.
[0049] In the second example above, The formula can be understood as, terminal m k The precoding matrix not only avoids the M terminals except terminal m k The channel space of other terminals other than denoted), and also avoids the possible channel space of the N terminals in the future (which can be represented by Φ N Indicates), and supplements terminal m k Own channel space (can be The dimension of weight avoidance is increased, thereby reducing the interference between downlink flows and improving the performance of downlink data transmission.
[0050] From the second example above, we can see that terminal m k The corresponding multi-user precoding is the same as that of the N terminals except for terminal m k The statistical autocorrelation matrix of other terminals other than k The statistical autocorrelation matrix of the terminal m k It can be understood as the first terminal mentioned above.
[0051] In the first and second examples above, the joint precoding matrix can be expressed as:
[0052] In order to improve the accuracy of the joint precoding matrix, a coefficient matrix may be introduced to perform correction in the calculation process of the joint precoding matrix. The correction scheme is introduced below and can be used for reference with the above content.
[0053] The M terminals include P terminals, and the P terminals include terminal px , the terminal p x Corresponding coefficient matrix is related to the channel estimation result corresponding to each terminal in the P terminals, P and x are positive integers, 1≤P≤M, 1≤x≤P. It can be understood that there is a coefficient matrix for P terminals in the M terminals, and terminal p x The coefficient matrix of It is obtained based on the channel estimation results corresponding to P terminals.
[0054] Optionally, the P terminals may be terminals among the M terminals, wherein the relationship between their channels and the channels of other terminals satisfies a second preset condition. For example, the second preset condition may be that the correlation between the channel of a certain terminal and the channels of other terminals is large, or that the channel of a certain terminal causes a certain degree of interference to the channels of other terminals.
[0055] Optionally, terminal m among the M terminals i The single-user precoding matrix is The initial joint precoding matrix W of the P terminals can be calculated, W = U (U H U+σ 2 I) -1 , U H is the conjugate transposed matrix of U, σ 2 is the downlink noise floor power, and I is the unit matrix. Understandably, It is obtained according to the channel estimation result of each terminal in the P terminals.
[0056] Optional, terminal p x The equivalent channel can be expressed as in, for The conjugate transposed matrix of . For terminal p x The channel estimation result.
[0057] Exemplarily, the terminal p x The coefficient matrix can satisfy Satisfies the following formula: in, For terminal p x The corresponding channel estimated noise. I is the identity matrix.
[0058] Terminal p x The coefficient matrix is based on the terminal p x The equivalent channel The terminal p x The equivalent channel is based on Sure, It is obtained based on the channel estimation result of each terminal in the P terminals, so terminal p x The coefficient matrix of It is obtained based on the channel estimation results corresponding to P terminals.
[0059] In a first possible implementation manner, the N terminals include Q terminals among the P terminals, and the Q terminals include terminal q y It can be understood that the Q terminals are one or more terminals that overlap the P terminals and the N terminals.
[0060] According to the statistical autocorrelation matrices respectively corresponding to the N terminals, the joint precoding matrix is obtained, including:
[0061] The joint precoding matrix is obtained according to the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals. y The corresponding corrected statistical autocorrelation matrix This terminal is y The corresponding statistical autocorrelation matrix Through the terminal q y The corresponding coefficient matrix Modified, Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q.
[0062] That is to say, the statistical autocorrelation matrices of the Q terminals overlapping the N terminals and the P terminals may be corrected, and the statistical autocorrelation matrices of the terminals other than the Q terminals among the N terminals are not corrected.
[0063] Optional, via terminal q y The corresponding coefficient matrix Modified terminal q y The statistical autocorrelation matrix of can be expressed as For example,
[0064] Through the above-mentioned first possible implementation method, by correcting the statistical autocorrelation matrix of Q terminals, the statistical autocorrelation matrix can be made to more approximately represent the possible channel direction in the future, thereby improving the accuracy and robustness of the joint precoding matrix, reducing inter-stream interference, and increasing the downlink throughput, thereby improving the downlink transmission performance.
[0065] In a second possible implementation manner, in the method of the first aspect, obtaining the joint precoding matrix of the M terminals according to the statistical autocorrelation matrices respectively corresponding to the N terminals includes:
[0066] According to the terminal p x The corresponding corrected channel estimation result and the statistical autocorrelation matrices corresponding to the N terminals respectively, to obtain the joint precoding matrix;
[0067] The terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0068] The terminal p x The corresponding channel estimation result It can be the terminal p x The channel estimation result corresponding to the most recent time
[0069] That is to say, the joint precoding matrix of the M terminals is obtained according to the statistical autocorrelation matrices corresponding to the N terminals, which can be understood as obtaining the joint precoding matrix according to the statistical autocorrelation matrices corresponding to the N terminals and the corrected channel estimation results corresponding to some or all of the P terminals. Optionally, the joint precoding matrix can also be obtained according to the channel estimation results corresponding to other terminals among the M terminals except for the some or all of the terminals.
[0070] Optional, terminal p x The corrected channel estimation result can be expressed as For example, The following formula can be satisfied:
[0071] Through the above-mentioned second possible implementation method, in the calculation process of the joint precoding matrix, in addition to using the statistical autocorrelation matrix of the N terminals to represent the historical channel conditions of the N terminals, the corrected channel estimation results corresponding to the P terminals can also be used to represent the channel conditions of the P terminals at the most recent moment, thereby helping to improve the robustness of the joint precoding matrix, reduce inter-stream interference, and improve the transmission performance of downlink data.
[0072] In a third possible implementation, the first implementation and the second implementation may be combined. For details, reference may be made to the first implementation and the second implementation. In the first possible implementation, according to the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the terminals other than the Q terminals of the N terminals, the joint precoding matrix is obtained, including:
[0073] According to the terminal p x The corresponding corrected channel estimation result The joint precoding matrix is obtained by: x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0074] Optional, via terminal q y The corresponding coefficient matrix Modified terminal q y The statistical autocorrelation matrix of can be expressed as For example,
[0075] Optional, terminal p x The corrected channel estimation result can be expressed as For example, The following formula can be satisfied:
[0076] In the third implementation mode, it is assumed that M, N, P and Q are the same, that is, the N terminals, the M terminals, the P terminals and the Q terminals are all the same. k Assume that the terminal m k For terminal q s , can be replaced with each other, 1≤s≤Q, M, N, P and Q can be replaced with each other. The set of M terminals is A, the set of N terminals is B, the set of P terminals is C, the set of Q terminals is D, A=B=C=D.
[0077] As a first example, first calculate the number of the M terminals except the terminal m k The sum of the statistical autocorrelation matrices of other terminals other than in, Indicates terminal q y The channel correlation of Can be a number between 0 and 1. For terminal q y The corresponding channel estimation noise, I is the unit matrix. Then calculate the terminal m k The multi-user precoding matrix
[0078] From the first example above, we can see that terminal m k The corresponding multi-user precoding is the same as that of terminal m k The statistical autocorrelation matrix of the terminals other than k It can be understood as the first terminal mentioned above.
[0079] In the first example above, The formula can be understood as, terminal m k The precoding matrix not only avoids the M terminals except terminal m k The channel space of other terminals other than ), and also avoid the possible channel space of other terminals in the future (which can be represented by ), thereby increasing the dimension of weight avoidance, which can reduce the interference between downlink flows and improve the performance of downlink data transmission.
[0080] As a second example, the sum of the statistical autocorrelation matrices of the N terminals is first calculated, for example, Then, according to the sum of the statistical autocorrelation matrices of the N terminals and the channel estimation results of the M terminals, the channel estimation result of the terminal m is calculated. k The multi-user precoding matrix The meaning of the formula can refer to the above description.
[0081] From the second example above, we can see that terminal m k The corresponding multi-user precoding is the same as that of terminal m k The statistical autocorrelation matrix of other terminals other than k The statistical autocorrelation matrix of the terminal m k It can be understood as the first terminal mentioned above.
[0082] In the second example above, The formula can be understood as, terminal m k The precoding matrix not only avoids the M terminals except terminal m k The channel space of other terminals other than denoted), and also avoids the possible channel space of the N terminals in the future (which can be represented by φ N Indicates), and supplements terminal m k Own channel space (can be The dimension of weight avoidance is increased, thereby reducing the interference between downlink flows and improving the performance of downlink data transmission.
[0083] In the second example above, the sum of the statistical autocorrelation matrices of the N terminals can be calculated, and then the sum of the statistical autocorrelation matrices of the N terminals can be inverted, and then for each terminal m k , supplement terminal m k Thus, the statistical autocorrelation matrices of N terminals can be summed up and inverted once, which can reduce the number of summations and inversions of the statistical autocorrelation matrices, reduce computational complexity, and save processing resources.
[0084] In the first and second examples above, the joint precoding matrix can be expressed as:
[0085] In a second aspect, an embodiment of the present application provides a device that can implement the method in any possible implementation of the first aspect. The device includes corresponding units or components for executing the above method. The units included in the device can be implemented by software and / or hardware.
[0086] In a third aspect, an embodiment of the present application provides a device, comprising: a processor, the processor is coupled to a memory, the memory is used to store programs or instructions, when the program or instructions are executed by the processor, the device implements the method in the above-mentioned first aspect, or any possible implementation of the first aspect.
[0087] Optionally, the communication device may further include a communication unit, which is used to communicate with other devices or other components in the communication device. For example, the communication device is a network device, and the communication unit is an interface between the communication device and other network devices, or may be a transceiver between the communication device and a terminal. For example, the communication device is a chip in a network, and the communication unit is an input / output circuit or interface of the chip.
[0088] The device in the above-mentioned second aspect and third aspect may be, for example, a network device, a server or a centralized controller, or a chip, a chip system, or a processor that can support the network device, server or centralized controller to implement the above-mentioned method. The network device may be a network device under a CU-DU non-separation architecture, or may be a CU or DU under a CU and DU separation architecture, or may be a CU-CP or CU-UP under a CU-CP and CU-UP separation architecture, or may be a DU or RU under a DU and RU separation architecture.
[0089] In a fourth aspect, an embodiment of the present application provides a computer-readable medium having a computer program or instructions stored thereon, which, when executed, causes a computer to execute the method in the above-mentioned first aspect, or any possible implementation of the first aspect.
[0090] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes a computer program code. When the computer program code runs on a computer, it enables the computer to execute the method in the above-mentioned first aspect or any possible implementation manner of the first aspect.
[0091] In a sixth aspect, an embodiment of the present application provides a chip, comprising a processor and an interface circuit, wherein the interface circuit is coupled to the processor, the processor is used to run a computer program or instructions to implement the method of the first aspect, and the interface circuit is used to communicate with other modules outside the chip. BRIEF DESCRIPTION OF THE DRAWINGS
[0092] Figure 1 A schematic diagram of a communication system used in the embodiments provided in this application;
[0093] Figure 2 is a schematic diagram of a possible architecture of a communication system provided by the present application;
[0094] Figure 3A It is a schematic diagram of channel aging provided by the present application;
[0095] Figure 3B is a schematic diagram of a base station provided in an embodiment of the present application;
[0096] Figure 4A is a schematic diagram of a method for obtaining a joint precoding matrix provided by the present application;
[0097] Figure 4B A schematic diagram of a main diagonal line and a main diagonal block provided in this application;
[0098] Figure 4C It is a schematic diagram of a collection provided by the present application;
[0099] Figure 5 This is a method for obtaining a joint precoding matrix provided by the present application;
[0100] Figure 6 It is a schematic diagram of another method for obtaining a joint precoding matrix provided in the present application.
[0101] Figure 7 is a schematic diagram of a method for updating a joint precoding matrix provided by the present application;
[0102] Figure 8 is a schematic diagram of the structure of a device 800 provided in the present application;
[0103] Fig. 9 It is a structural schematic diagram of a device 900 provided in this application. DETAILED DESCRIPTION
[0104] The method and device provided in the embodiments of the present application can be applied to a communication system. Figure 1 The communication system 100 includes one or more network devices (network device 110 and network device 120 are shown in the figure), and one or more terminals communicating with the one or more network devices. Figure 1 The terminals 114 and 118 shown in the figure communicate with the network device 110, and the terminals 124 and 128 shown in the figure communicate with the network device 120. It can be understood that the network devices and the terminals can also be referred to as communication devices.
[0105] The technology described in the embodiments of the present application can be used in various communication systems, such as a fourth generation (4G) communication system, a 4.5 generation (G) communication system, a fifth generation (5G) communication system, a system integrating multiple communication systems, or a future evolving communication system, such as a 6G (6G) communication system. For example, a long term evolution (LTE) system, a new radio (NR) system, a wireless-fidelity (WiFi) system, a wireless self-organizing system, a device-to-device direct communication system, and a communication system related to the third generation partnership project (3GPP), as well as other such communication systems.
[0106] Figure 2 A schematic diagram showing a possible architecture of a communication system is shown in FIG. Figure 2 The network equipment in the radio access network (RAN) shown includes a base station (such as gNodeB or gNB) with a centralized unit (CU) and a distributed unit (DU) separated architecture. RAN can be connected to the core network (for example, it can be the core network of LTE, it can also be the core network of 5G, etc.). CU and DU can be understood as the division of base stations from the perspective of logical functions. CU and DU can be physically separated or deployed together. Multiple DUs can share one CU. One DU can also be connected to multiple CUs (not shown in the figure). CU and DU can be connected through an interface, such as an F1 interface.
[0107] CU and DU can be divided according to the protocol layer of the wireless network. For example, the functions of the packet data convergence protocol (PDCP) layer and the radio resource control (RRC) layer are set in the CU, while the functions of the radio link control (RLC) layer, the media access control (MAC) layer, the physical layer, etc. are set in the DU. It can be understood that the division of the CU and DU processing functions according to this protocol layer is only an example, or it can be divided in other ways. For example, the CU or DU can be divided into functions with more protocol layers. For example, the CU or DU can also be divided into partial processing functions with protocol layers. In one design, some functions of the RLC layer and the functions of the protocol layers above the RLC layer are set in the CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set in the DU. In another design, the functions of the CU or DU can also be divided according to the service type or other system requirements. For example, according to the delay division, the function that needs to meet the delay requirement for the processing time is set in the DU, and the function that does not need to meet the delay requirement is set in the CU. In one design, the CU may also have one or more functions of the core network. One or more CUs can be set up centrally or separately. For example, a CU can be set up on the network side for centralized management.
[0108] Figure 2 The network architecture shown may be applied to a 5G communication system, which may share one or more components or resources with an LTE system.
[0109] The function of the CU can be implemented by one entity, or the control plane (CP) and the user plane (UP) of the CU can be separated, that is, the control plane (CU-CP) and the user plane (CU-UP) of the CU can be implemented by different functional entities, and the CU-CP and CU-UP can be coupled with the DU to jointly complete the function of the base station.
[0110] The functions of a DU may be implemented by one entity or by multiple entities. A DU may have multiple radio functions, or the radio functions may be remotely located.
[0111] According to the division of protocol layers, the functions of the wireless protocol layer set in the DU can be further divided. For example, the radio frequency function and the lower layer functions of the physical layer are set in the radio unit (RU), and the higher layer functions of the RLC layer, MAC layer, and physical layer are set in the DU.
[0112] For the convenience of distinction and description, this application refers to the low layer and the high layer, wherein the low layer of the physical layer can implement part of the functions of the physical layer, and the high layer of the physical layer can implement another part of the functions of the physical layer.
[0113] For example, in the downlink, the lower layer of the physical layer can perform one or more of inverse fast Fourier transformation (IFFT) and digital beamforming; the upper layer of the physical layer can perform one or more of resource element (RE) mapping, precoding, layer mapping, modulation, scrambling, rate matching and coding. Alternatively, the lower layer of the physical layer can perform one or more of inverse fast Fourier transformation, digital beamforming, resource mapping and precoding; the upper layer of the physical layer can perform one or more of layer mapping, modulation, scrambling, rate matching and coding. Alternatively, in the downlink, the lower layer of the physical layer can perform one or more of inverse fast Fourier transformation, digital beamforming, resource mapping, precoding, layer mapping, modulation. The upper layers of the physical layer may perform one or more of scrambling, rate matching and coding.
[0114] In the uplink, the lower layer of the physical layer can perform one or more of fast Fourier transformation (FFT) and digital beamforming; the upper layer of the physical layer can perform resource demapping (demapping), channel estimation (channel estimation), equalization (equlization), inverse discrete Fourier transformation (IDFT), demodulation (demodulation), descrambling (descrambling), rate dematching (rate dematching), and decoding (decoding). Alternatively, the lower layer of the physical layer can perform one or more of fast Fourier transformation, digital beamforming, resource demapping, channel estimation, and equalization; the upper layer of the physical layer can perform one or more of inverse discrete Fourier transformation, demodulation, descrambling, rate dematching, and decoding.
[0115] It is understandable that the above-mentioned lower layer of the physical layer and the upper layer of the physical layer are examples of division of the physical layer, and the division can be performed in other ways. The "low" in "low layer" and the "high" in "high layer" have no limiting effect, and the "low layer" and "high layer" can be replaced by other names.
[0116] It is understandable that the embodiments provided in the present application may be applicable to an architecture where CU and DU are not separated, or may be applicable to an architecture where CU and DU are separated. When applicable to an architecture where CU and DU are separated, it may be applicable to an architecture where CU-CP and CU-UP are separated, and / or, an architecture where DU and RU are separated.
[0117] In this application, the network device can be any device with wireless transceiver function. Including but not limited to: evolved base station (NodeB or eNB or e-NodeB, evolutional Node B) in LTE, base station (gNodeB or gNB) or transceiver point (transmission receiving point / transmission reception point, TRP) in NR, base station of subsequent evolution of 3GPP, access node in WiFi system, wireless relay node, wireless backhaul node, core network equipment, etc. The base station can be: macro base station, micro base station, micro-micro base station, small station, relay station, or balloon station, etc. Multiple base stations can support the network of the same technology mentioned above, or they can support the network of different technologies mentioned above. The base station may include one or more co-station or non-co-station TRPs. The network device can also be a server (such as a cloud server), a wireless controller, CU, and / or DU in a cloud radio access network (CRAN) scenario. The network device can also be a server, a wearable device, a machine communication device, a vehicle-mounted device, or a smart screen, etc. The following is an example of a network device as a base station. The multiple network devices may be base stations of the same type or different types. The base station may communicate with the terminal device or communicate with the terminal device through a relay station. The terminal device may communicate with multiple base stations of different technologies. For example, the terminal device may communicate with a base station supporting an LTE network or a base station supporting a 5G network, and may also support dual connection with a base station of an LTE network and a base station of a 5G network.
[0118] It can be understood that all or part of the functions of the network device in the present application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (such as a cloud platform).
[0119] A terminal is a device with wireless transceiver function, which can be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it can also be deployed on the water surface (such as ships, etc.); it can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal can be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, a virtual reality (VR) terminal device, an AR terminal device, a mixed reality (MR) terminal device, a terminal in industrial control (industrial control), a vehicle-mounted terminal device, a terminal in self-driving, a terminal in assisted driving, a terminal in remote medical, a terminal in smart grid, a terminal in transportation safety, a terminal in smart city, a terminal in smart home, etc. The embodiments of the present application do not limit the application scenarios. A terminal may also be sometimes referred to as terminal equipment, user equipment (UE), access terminal equipment, vehicle-mounted terminal, industrial control terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal equipment, mobile equipment, UE terminal equipment, wireless communication equipment, machine terminal, UE agent or UE device, etc. A terminal may be fixed or mobile.
[0120] As an example but not limitation, in the present application, the terminal may be a wearable device. Wearable devices may also be referred to as wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not just hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include full-featured, large-sized, and independent of smartphones to achieve complete or partial functions, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various types of smart bracelets and smart jewelry for vital sign monitoring.
[0121] In the present application, the terminal may be a terminal in an Internet of Things (IoT) system. IoT is an important part of the future development of information technology. Its main technical feature is to connect objects to the network through communication technology, thereby realizing an intelligent network of human-machine interconnection and object-to-object interconnection. The terminal in the present application may be a terminal in a machine type communication (MTC). The terminal of the present application may be a vehicle-mounted module, a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip or a vehicle-mounted unit built into a vehicle as one or more components or units. The vehicle may implement the method of the present application through the built-in vehicle-mounted module, vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip or vehicle-mounted unit. Therefore, the embodiments of the present application may be applied to vehicle networking, such as vehicle to everything (V2X), long term evolution vehicle (LTE-V), vehicle to vehicle (V2V), etc.
[0122] In the above communication systems, in order to adapt to the explosive growth of mobile data traffic, multiple-input multiple-output (MIMO) technology came into being. Through precoding technology and large-scale antenna arrays, different users can transmit simultaneously, thereby improving the throughput of the communication system.
[0123] In the precoding technology, the network equipment needs to calculate the precoding matrix according to the downlink channel information, and process the data through the precoding matrix and send it to the terminal.
[0124] Regarding the acquisition of downlink channel information, in a time division duplex (TDD) system, the network device can measure the channel sounding reference signal (SRS) to obtain the uplink channel information, and then the network device obtains the downlink channel information based on the reciprocity of the uplink and downlink channels. In a frequency division duplex (FDD) system, the terminal can measure the downlink reference signal, such as the channel state information reference signal (CSI-RS), and then the terminal feeds back the channel state information (CSI) to the network device, and the network device obtains the downlink channel information based on the CSI.
[0125] However, whether in a TDD system or an FDD system, since the measurement time of the reference signal is different from the time when the data is sent using the precoding matrix, the channel may change (this application refers to this phenomenon as channel aging) due to reasons such as terminal movement or environmental changes during the time range between these two moments. This will cause the precoding matrix to be unable to match the actual channel at the time of sending data, thereby greatly affecting the downlink transmission performance of the terminal. In addition, in multi-user MIMO (MU-MIMO), the precoding matrix is inaccurate due to channel aging, and the transmission of one stream of a terminal may interfere with the transmission of another stream, or the transmission of one stream of a terminal may interfere with the transmission of streams of other terminals, resulting in serious interference between streams. Streams can be called layers, or have other names, which are not limited in this application.
[0126] Figure 3A Schematic diagram of channel aging provided by an embodiment of the present application. Figure 3A As shown, the channel estimate obtained by the network device at time t by measuring SRS is h SRS (t), the channel estimate of the channel where the network device sends physical downlink shared channel (PDSCH) data to the terminal at time t+Δt is h PDSCH (t+Δt), from time t to time t+Δt, if the terminal does not move or the environment does not change, h SRS (t)≈h PDSCH (t+Δt), if the terminal moves or the environment changes, h SRS (t)≠h PDSCH (t+Δt).
[0127] Based on this, an embodiment of the present application provides a solution for calculating a precoding matrix. It can be applied in a TDD system or an FDD system. In this solution, statistics can be collected on the historical channels of multiple terminals, and the historical channels of multiple terminals can reflect the channels of multiple terminals in the future to a certain extent. By considering the historical channels of multiple terminals in the calculation of the precoding matrix, the channel aging factor can be considered in advance, the interference between downlink streams can be reduced, and the downlink transmission performance of the terminal can be improved.
[0128] Figure 3B It is a schematic diagram of a base station provided in an embodiment of the present application. Figure 3B The base station can implement the above solution for calculating the precoding matrix. Figure 3B As shown, the base station may include a channel estimation unit, a statistical autocorrelation matrix calculation unit, a joint precoding matrix calculation unit, a downlink weighting unit and a weighted data sending unit.
[0129] Specifically, the channel estimation unit is first used to calculate the channel estimation result, the statistical autocorrelation matrix calculation unit is used to calculate the statistical autocorrelation matrix based on the calculated channel estimation result, the joint precoding matrix calculation unit is used to calculate the joint precoding matrix based on the statistical autocorrelation matrix, the downlink weighting unit is used to weight the downlink data using the joint precoding matrix, and the weighted data sending unit is used to send the weighted data to the terminal device.
[0130] If the base station adopts an architecture in which the CU and DU are not separated, the functions of the above five units can be integrated into the base station.
[0131] If the base station adopts a CU and DU separation architecture, the functions of the above multiple units can be implemented by different network devices within the base station. For example, if the base station adopts a CU and DU separation architecture, the functions of the above five units can be implemented by CU and / or DU.
[0132] Optionally, if the base station adopts a DU and RU separated architecture, since the lower layer of the physical layer is deployed on the RU and the higher layer of the physical layer is deployed on the DU, the functions of the above five units may be implemented by the DU; or by the RU; or the functions of some of the above units may be implemented by the DU, and the functions of some of the units may be implemented by the RU. For example, the DU may include 301, and the RU includes 302, 303, 304, and 305. Alternatively, the DU includes 301 and 302, and the RU includes 303, 304, and 305. Alternatively, the DU includes 301, 302, and 303, and the RU includes 304 and 305. Alternatively, the DU includes 301, 302, 303, and 304, and the RU includes 305.
[0133] Figure 4A It is a schematic diagram of a method for obtaining a joint precoding matrix provided in an embodiment of the present application. Figure 4A The method can be applied to Figure 3B Unit 303 (i.e., joint precoding matrix calculation unit) in Figure 4A Can be used with Figure 3B The base stations reference and quote each other.
[0134] Figure 4A The execution subject of the method may be a network device, or may be a chip, a chip system or a processor that supports the network device to implement the method, or may be a logic module or software that can implement all or part of the network device functions. The network device may be a network device in an architecture where CU and DU are not separated, or may be a CU or DU in an architecture where CU and DU are separated, or may be a CU-CP or CU-UP in an architecture where CU-CP and CU-UP are separated, or may be a DU or RU in an architecture where DU and RU are separated, or may be a centralized controller, etc. Figure 4A The execution entities of each step in the above process may be the same or different. Figure 4A As shown, the method includes:
[0135] S401: According to the statistical autocorrelation matrices corresponding to N terminals among the M terminals, a joint precoding matrix of the M terminals is obtained. Wherein, M and N are positive integers, M≥2, 1≤N≤M. It can be understood that the N terminals are a subset of the M terminals, and optionally, the N terminals can be the M terminals.
[0136] For the sake of convenience in the following description, the terminal in the M terminals may be referred to as m i , i is a positive integer, 1≤i≤M. That is, m i ∈{m1,m2…m M}, the set {m1,m2…m M} is called set A, m i ∈A. The terminal among the N terminals can be called n j , j is a positive integer, 1≤j≤N. That is, n j ∈{n1,n2…n N}, the set {n1,n2…n N} is called set B, n j ∈B. It can be understood that B is a subset of A, that is
[0137] Among them, the terminal m i Corresponding channel estimation results
[0138] For example, the M terminals include terminal m1, terminal m2, terminal m3 and terminal m4. The N terminals include terminal n1, terminal n2 and terminal n3, wherein terminal n1 is terminal m1, terminal n2 is terminal m2, and terminal n3 is terminal m3.
[0139] The joint precoding matrix of the M terminals can be understood as a matrix used to process downlink data of the M terminals in the MU-MIMO scenario. The joint precoding matrix may include precoding matrices corresponding to the M terminals, where terminal m i The corresponding precoding matrix is used for the terminal m i The data of terminal m is precoded. i The corresponding precoding matrix can be called terminal m i The corresponding multi-user precoding matrix.
[0140] For example, the joint precoding matrix includes a precoding matrix corresponding to terminal m1, a precoding matrix corresponding to terminal m2, a precoding matrix corresponding to terminal m3, and a precoding matrix corresponding to terminal m4. The precoding matrix corresponding to terminal m1 is used to precode data corresponding to terminal m1, the precoding matrix corresponding to terminal m2 is used to precode data corresponding to terminal m2, the precoding matrix corresponding to terminal m3 is used to precode data corresponding to terminal m3, and the precoding matrix corresponding to terminal m4 is used to precode data corresponding to terminal m4.
[0141] Optionally, the N terminals are terminals whose channel correlations satisfy a first preset condition among the M terminals. For example, the channel correlations of terminal m1, terminal m2, and terminal m3 satisfy the first preset condition, and the channel correlation of terminal m4 does not satisfy the first preset condition, then the N terminals include terminal m1, terminal m2, and terminal m3 (i.e., terminal n1, terminal n2, and terminal n3).
[0142] Among them, the channel correlation of a certain terminal may be a channel correlation in the frequency domain and / or time domain. The channel correlation of the terminal in the frequency domain may reflect the change of the channel of the terminal in the frequency domain, and the channel correlation of the terminal in the time domain may reflect the change of the channel of the terminal in the time domain.
[0143] Optionally, the channel correlation may be represented by a numerical value, for example, the channel correlation may be a number greater than or equal to 0 and less than or equal to 1. The first preset condition may be that the channel correlation is greater than, greater than or equal to, less than, or less than or equal to a numerical value, or that the channel correlation falls within a numerical range. The embodiment of the present application does not limit the setting method of the first preset condition and the calculation method of the channel correlation.
[0144] Optionally, the higher the channel correlation is, the smaller the channel change is, and conversely, the smaller the channel correlation is, the larger the channel change is. The first preset condition can be set so that the N terminals are terminals with smaller channel correlation, that is, terminals with larger channel change, and the other terminals other than the N terminals in the M terminals are terminals with smaller channel change. By performing statistical autocorrelation matrix operations on terminals with larger channel change conditions, and not performing statistical autocorrelation matrix operations on terminals with smaller channel change conditions, processing resources can be saved and complexity can be reduced.
[0145] Among them, the terminal n j The corresponding statistical autocorrelation matrix For this terminal n j The corresponding autocorrelation matrix The filtering is performed in the frequency domain and / or the time domain, where j is a positive integer, 1≤j≤N. The following describes the method with reference to an example.
[0146] In the present application, the statistical autocorrelation matrix is a matrix obtained after processing the autocorrelation matrix. For the sake of ease of description, the matrix after the autocorrelation matrix is processed is called a statistical autocorrelation matrix. The present application takes the filtering in the frequency domain and / or time domain as an example for introduction, and there may be other statistical methods. The statistical autocorrelation matrix in the present application may be called a filtered autocorrelation matrix, a cumulative autocorrelation matrix, an average autocorrelation matrix, a historical autocorrelation matrix or a processed autocorrelation matrix, etc., or the statistical autocorrelation matrix may have other names, which are not limited in the present application. In the present application, "matrix" and "array" may be interchangeable.
[0147] The terminal j The statistical autocorrelation matrix of For this terminal n j The corresponding autocorrelation matrix Obtained through filtering in the frequency domain and / or time domain.
[0148] For example, the statistical autocorrelation matrix corresponding to terminal n1 is is the autocorrelation matrix corresponding to terminal n1 The statistical autocorrelation matrix corresponding to terminal n2 is obtained by filtering in the frequency domain and / or time domain. is the autocorrelation matrix corresponding to terminal n2 The statistical autocorrelation matrix corresponding to terminal n3 is obtained by filtering in the frequency domain and / or time domain. is the autocorrelation matrix corresponding to terminal n3 Obtained through filtering in the frequency domain and / or time domain.
[0149] The filtering in the frequency domain and / or time domain may include three cases: 1) filtering in the frequency domain, 2) filtering in the time domain, and 3) filtering in the frequency domain and filtering in the time domain. The present application does not limit the order between filtering in the frequency domain and filtering in the time domain. The filtering in the frequency domain may be performed first, and then filtering in the time domain, or filtering in the time domain may be performed first, and then filtering in the frequency domain, or filtering in the frequency domain and filtering in the time domain may be performed simultaneously.
[0150] Frequency domain filtering of the autocorrelation matrix corresponding to a terminal can be understood as operating the autocorrelation matrix of the terminal on different frequency domain resources. Exemplarily, the operation can be averaging, that is, summing the autocorrelation matrices on different frequency domain resources, and then dividing the sum by the number of frequency domain resources.
[0151] Performing time-domain filtering on the autocorrelation matrix corresponding to a terminal can be understood as performing operations on the autocorrelation matrix of the terminal on different time-domain resources. For example, the time-domain filtering can be alpha filtering.
[0152] For example, the statistical autocorrelation matrix corresponding to terminal n1 is This can be achieved by filtering the autocorrelation matrix of different frequency domain resources corresponding to the same time domain resource of terminal n1 in the frequency domain to obtain the result of frequency domain filtering, and then filtering the results of frequency domain filtering corresponding to different time domain resources in the time domain to obtain the statistical autocorrelation matrix corresponding to terminal n1. Similarly, the statistical autocorrelation matrix corresponding to terminal n2 can be obtained The statistical autocorrelation matrix corresponding to terminal n3
[0153] Among them, the terminal n j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result Got it.
[0154] That is to say, the autocorrelation matrices corresponding to the N terminals are respectively obtained according to the channel estimation results corresponding to the N terminals.
[0155] For example, the autocorrelation matrix corresponding to terminal n1 is It is based on the channel estimation result corresponding to terminal n1 The autocorrelation matrix corresponding to terminal n2 is obtained It is based on the channel estimation result corresponding to terminal n2 The autocorrelation matrix corresponding to terminal n3 is obtained It is based on the channel estimation result corresponding to terminal n3 Got it.
[0156] The terminal j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result It can be understood that the terminal n j The corresponding autocorrelation matrix With this terminal j The corresponding channel estimation result Related.
[0157] For example, in for The conjugate transposed matrix of . In this application, the autocorrelation matrix can be referred to as the autocorrelation matrix.
[0158] The terminal j The corresponding channel estimation result It can represent the terminal n jThe quality of the channel between the network device.
[0159] The channel estimation result in the present application may be a matrix. The channel estimation result may be referred to as a channel estimation, a channel characteristic matrix, a channel characteristic or a channel matrix, etc., which is not limited in the present application. The matrix in the present application may be X rows and Y columns, where X and Y are both integers greater than or equal to 1. It can be understood that when X is 1 and Y is greater than 1, or X is greater than 1 and Y is equal to 1, the matrix is a vector. That is, the matrix in the present application includes a vector.
[0160] In the present application, the channel estimation result may be obtained by measuring the uplink reference signal. For example, the terminal n j An uplink reference signal is sent to the network device, and the network device measures the uplink reference signal to obtain the channel estimation result Alternatively, the channel estimation result It can be based on terminal n j The information indicating the initial precoding matrix is obtained by feedback, for example, the network device sends the terminal n j Sending a downlink reference signal, the terminal n j The downlink reference signal is measured to obtain an initial precoding matrix, and then the terminal sends indication information to the network device to indicate the initial precoding matrix, and the network device obtains the channel estimation result according to the information indicating the initial precoding matrix
[0161] Since the terminal n j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result The terminal n j The corresponding statistical autocorrelation matrix For this terminal n j The corresponding autocorrelation matrix After filtering in the frequency domain and / or time domain, it can be understood that the terminal n j The corresponding statistical autocorrelation matrix This terminal is included j The channel estimation results on multiple resources (frequency domain resources and / or time domain resources) in history. The channel estimation results in history can reflect the future channel conditions to a certain extent and estimate the general direction of the future channel. Therefore, in the calculation process of the joint precoding matrix, by considering the channel estimation results in history of the N terminals, that is, considering the channel conditions of the N terminals in the future in advance, it helps to alleviate the impact of channel aging, reduce inter-stream interference, and improve downlink throughput, thereby improving downlink transmission performance.
[0162] Optionally, the statistical autocorrelation matrix corresponding to one or more terminals among the N terminals includes T main diagonal blocks and zero elements outside the T main diagonal blocks, where T is an integer greater than or equal to 2.
[0163] The following terminal n j Take this as an example to illustrate, there are two situations:
[0164] Case 1) The terminal n j The corresponding autocorrelation matrix The matrix obtained after filtering in the frequency domain and / or time domain includes T main diagonal blocks and one or more zero elements outside the T main diagonal blocks. The matrix is the terminal n j The corresponding statistical autocorrelation matrix
[0165] Case 2) The terminal n j The corresponding autocorrelation matrix The matrix obtained after filtering in the frequency domain and / or time domain does not include T main diagonal blocks and zero elements outside the T main diagonal blocks. One or more elements outside the T main diagonal blocks in the matrix can be set to zero, that is, become zero elements. The matrix after one or more elements outside the T main diagonal blocks in the matrix are set to zero is the terminal n j The corresponding statistical autocorrelation matrix
[0166] In the above case 2), by setting one or more elements outside the T main diagonal blocks to zero, the subsequent use of statistical autocorrelation can be reduced. The complexity of the joint precoding matrix is obtained by performing calculations, thus saving processor resources and reducing implementation complexity.
[0167] Optionally, in the above case 1) or case 2), the statistical autocorrelation matrix It may be composed of the T main diagonal blocks and zero elements outside the T main diagonal blocks, that is, all elements outside the T main diagonal blocks are zero elements.
[0168] In this application, the statistical autocorrelation matrix Can be N t Row N t The statistical autocorrelation matrix Divide into T rows and T columns, so that we can get T 2 blocks, where each block is N t / T rows, N t / T columns of the matrix. In this application, the main diagonal block can be located in the statistical autocorrelation matrix The blocks on the main diagonal of . Statistical autocorrelation matrix The main diagonal line of can be the diagonal line where the elements in the oblique direction from the upper left corner to the lower right corner are located.
[0169] Figure 4B A schematic diagram of a main diagonal line and a main diagonal block provided in this application. Figure 4B As shown, the left figure illustrates the main diagonal line and the main diagonal block when T is 2. The right figure illustrates the main diagonal line and the main diagonal block when T is 3. Optionally, except for the main diagonal block, the elements in other blocks are all 0.
[0170] In the present application, the value of T may be determined according to the number of polarization directions of the antenna of the network device. As an example, T may be the number of polarization directions. The number of polarization directions may be 2, 3, 4 or a larger integer.
[0171] For example, when the antenna of the network device is a dual-polarization antenna, that is, the antenna has two polarization directions, T is 2.
[0172] For another example, when the antenna of the network device has three polarization directions, T is 3.
[0173] For another example, when the antenna of the network device has four polarization directions, T is 4.
[0174] The main diagonal block can represent the autocorrelation value of the same polarization direction, and the non-main diagonal block represents the cross-correlation value between different polarization directions. By setting one or more elements outside the main diagonal block to zero and ignoring the correlation between polarizations, the calculation can be simplified, the complexity can be reduced, and resources can be saved.
[0175] Optionally, since the joint precoding matrix of the M terminals is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively, the joint precoding matrix includes the precoding matrices corresponding to the M terminals respectively. Assuming that the M terminals include the first terminal, there may be multiple possibilities for the relationship between the precoding matrix corresponding to the first terminal and the statistical autocorrelation matrices corresponding to the N terminals respectively. Different situations are described below:
[0176] Case 1) The M terminals include the N terminals and the first terminal, that is, the N terminals do not include the first terminal. In this case, the precoding matrix corresponding to the first terminal is correlated with the statistical autocorrelation matrices of the N terminals.
[0177] The fact that the precoding matrix corresponding to the first terminal is correlated with the statistical autocorrelation matrices of the N terminals can be understood as follows: the precoding matrix corresponding to the first terminal is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively.
[0178] Case 2) The N terminals include a first terminal, and the precoding matrix corresponding to the first terminal is related to the statistical autocorrelation matrices of N-1 terminals among the N terminals except the first terminal.
[0179] The correlation between the precoding matrix corresponding to the first terminal and the statistical autocorrelation matrices of N-1 terminals among the N terminals except the first terminal can be understood as follows: the precoding matrix corresponding to the first terminal is obtained according to the statistical autocorrelation matrices corresponding to the N-1 terminals respectively.
[0180] Optionally, in case 2), the precoding matrix corresponding to the first terminal may not be related to the statistical autocorrelation matrix of the first terminal. Alternatively, the precoding matrix corresponding to the first terminal may be related to the statistical autocorrelation matrix of the first terminal, that is, the precoding matrix corresponding to the first terminal is related to the statistical autocorrelation matrix of the N terminals.
[0181] Optionally, in S401, obtaining the joint precoding matrix of the M terminals according to the statistical autocorrelation matrices respectively corresponding to the N terminals includes: obtaining the joint precoding matrix according to the statistical autocorrelation matrices respectively corresponding to the N terminals, and the channel estimation results respectively corresponding to the M terminals or the channel estimation results respectively corresponding to the other terminals among the M terminals except the N terminals. That is to say, in the calculation process of the joint precoding matrix, in addition to using the statistical autocorrelation matrices of the N terminals to represent the historical channel conditions of the N terminals, the channel estimation results respectively corresponding to the M terminals or the other terminals can also be used to represent the channel conditions of the M terminals or the other terminals at the most recent moment, thereby helping to improve the robustness of the joint precoding matrix, reduce inter-stream interference, and improve the transmission performance of downlink data.
[0182] Optionally, in order to improve the accuracy of the joint precoding matrix, the coefficient matrix may be used to modify the statistical autocorrelation matrix and / or the channel estimation result, as described below.
[0183] The M terminals include P terminals. For the convenience of description below, the terminal in the P terminals may be referred to as p x , P and x are positive integers, 1≤P≤M, 1≤x≤P. That is, p x ∈{p1,p2…p P}, the set {p1,p2…p P} is called set C, p x ∈C. The set C is a subset of the set of M terminals (i.e., set A), i.e.
[0184] The terminal p x Corresponding coefficient matrix is related to the channel estimation result corresponding to each of the P terminals. x The corresponding coefficient matrix It is calculated based on the channel estimation result of each terminal in the P terminals.
[0185] For example, the P terminals include terminal p1, terminal p2, and terminal p3. Terminal p1 is terminal m1, terminal p2 is terminal m2, and terminal p3 is terminal m4. The coefficient matrix corresponding to terminal p1 is The terminal p2 corresponds to the coefficient matrix The coefficient matrix corresponding to terminal p3
[0186] in, and and Are relevant. and and Are relevant. and and Or it can be understood that according to and The coefficient matrices are calculated separately and
[0187] Optionally, the P terminals may be terminals among the M terminals, wherein the relationship between their channels and the channels of other terminals satisfies a second preset condition. For example, the second preset condition may be that the correlation between the channel of a certain terminal and the channels of other terminals is large, or that the channel of a certain terminal causes a certain degree of interference to the channels of other terminals.
[0188] It can be understood that, according to the above introduction, the N terminals are terminals whose channel correlations satisfy the first preset condition, and the P terminals are terminals whose channels and the channels between other terminals satisfy the second preset condition (the second preset condition may be the same as or different from the first preset condition, and the present application does not limit this), and there may be multiple possibilities for the relationship between the N terminals and the P terminals. For example, case 1) is completely non-overlapping, for example, there are no identical terminals between the P terminals and the Q terminals. Case 2) is partially overlapping, for example, some of the P terminals are the same as some of the Q terminals. Case 3) includes and is included, the N terminals include the P terminals, or the P terminals include the N terminals. Among them, in case 3), if the N terminals include the P terminals, and the P terminals include the N terminals, then the P terminals are the same as the N terminals.
[0189] Assume that the N terminals include Q terminals among the P terminals. It can be understood that the Q terminals are one or more terminals that overlap the P terminals and the N terminals.
[0190] For the sake of convenience in the following description, the terminal among the Q terminals may be referred to as q y , Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q. That is, q y ∈{q1,q2…q Q}, the set {q1,q2…q Q} is called set D, q y ∈D.
[0191] Figure 4C A schematic diagram of a collection provided in an embodiment of the present application, such as Figure 4C As shown, The set D is the intersection of the set of the P terminals (ie, set C) and the set of the N terminals (ie, set B), that is, D=C∩B.
[0192] For example, according to the above description, the N terminals include terminal n1 (i.e., terminal m1), terminal n2 (i.e., terminal m2), and terminal n3 (i.e., terminal m3). The P terminals include terminal p1 (i.e., terminal m1), terminal p2 (i.e., terminal m2), and terminal p3 (i.e., terminal m4), and the Q terminals include terminal m1 and terminal m2, which can be recorded as terminal q1 and terminal q2.
[0193] In a first possible implementation manner, the statistical autocorrelation matrix may be modified using a coefficient matrix.
[0194] Terminal q y The corresponding statistical autocorrelation matrix Through terminal q y The corresponding coefficient matrix To facilitate description, the coefficient matrix can be The modified statistical autocorrelation matrix is called
[0195] For example, the modified statistical autocorrelation matrix corresponding to terminal q1 is is the statistical autocorrelation matrix corresponding to terminal q1 The coefficient matrix corresponding to the terminal q1 Corrected, and / or, the corrected statistical autocorrelation matrix corresponding to terminal q2 is the statistical autocorrelation matrix corresponding to terminal q2 The coefficient matrix corresponding to terminal q2 Corrected.
[0196] In the first possible implementation, the joint precoding matrix of the M terminals is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively. This can be understood as obtaining the joint precoding matrix according to the modified statistical autocorrelation matrices corresponding to some or all of the Q terminals and the statistical autocorrelation matrices of the terminals among the N terminals except the above-mentioned some or all of the terminals.
[0197] For example, according to the modified statistical autocorrelation matrix corresponding to terminal q1 The corrected statistical autocorrelation matrix corresponding to terminal q1 The statistical autocorrelation matrix corresponding to terminal n3 The joint precoding matrix is obtained.
[0198] In a second possible implementation, the channel estimation result may be corrected using a coefficient matrix.
[0199] Among them, the terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0200] For example, the corrected channel estimation result corresponding to terminal p1 (i.e. terminal m1) is is the channel estimation result corresponding to terminal p1 After the coefficient matrix The corrected channel estimation result corresponding to terminal p2 (i.e. terminal m2) is is the channel estimation result corresponding to terminal p2 After the coefficient matrix Corrected, and / or, the corrected channel estimation result corresponding to terminal p3 (ie, terminal m4) is the channel estimation result corresponding to terminal p3 After the coefficient matrix Corrected.
[0201] In the second possible implementation, the joint precoding matrix of the M terminals is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively, which can be understood as obtaining the joint precoding matrix according to the statistical autocorrelation matrices corresponding to the N terminals respectively and the corrected channel estimation results corresponding to some or all of the P terminals. Optionally, the joint precoding matrix can also be obtained according to the channel estimation results corresponding to other terminals among the M terminals except the some or all of the terminals.
[0202] For example, according to 1) the corrected channel estimation result corresponding to terminal p1 (ie, terminal m1) The corrected channel estimation result corresponding to terminal p2 (i.e. terminal m2) The corrected channel estimation result corresponding to terminal p3 (i.e. terminal m4) And, 2) the statistical autocorrelation matrix corresponding to terminal n1 (i.e. terminal m1 or q1) The statistical autocorrelation matrix corresponding to terminal n2 (i.e. terminal m2 or q2) The statistical autocorrelation matrix corresponding to terminal n3 (i.e. terminal m3) The joint precoding matrix is obtained. Optionally, the channel estimation result corresponding to the terminal m3 can also be used. The joint precoding matrix is obtained.
[0203] In a third possible implementation, the first possible implementation and the second possible implementation may be combined to modify the statistical autocorrelation matrix and the channel estimation result using a coefficient matrix.
[0204] Terminal q among the Q terminals above y The corresponding modified statistical autocorrelation matrix It is terminal q y The corresponding statistical autocorrelation matrix Through terminal q y The corresponding coefficient matrix Modified, terminal p among the above P terminals x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0205] For example, the modified statistical autocorrelation matrix corresponding to terminal q1 (i.e., terminal m1, n1, or p1) is is the statistical autocorrelation matrix corresponding to terminal q1 The coefficient matrix corresponding to the terminal q1 The corrected statistical autocorrelation matrix corresponding to the terminal q2 (i.e., the terminal m2, n2, or p2) is / are obtained. is the statistical autocorrelation matrix corresponding to terminal q2 The coefficient matrix corresponding to terminal q2 Corrected. The corrected channel estimation result corresponding to terminal p1 (i.e. terminal m1) is the channel estimation result corresponding to terminal p1 After the coefficient matrix The corrected channel estimation result corresponding to terminal p2 (i.e. terminal m2) is is the channel estimation result corresponding to terminal p2 After the coefficient matrix Corrected, and / or, the corrected channel estimation result corresponding to terminal p3 (ie, terminal m4) is the channel estimation result corresponding to terminal p3 After the coefficient matrix Corrected.
[0206] In the third possible implementation, the joint precoding matrix of the M terminals is obtained according to the statistical autocorrelation matrices corresponding to the N terminals respectively, which can be understood as obtaining the joint precoding matrix according to the modified statistical autocorrelation matrices corresponding to some or all of the Q terminals, and the statistical autocorrelation matrices of the terminals among the N terminals except for some or all of the Q terminals, and the modified channel estimation results corresponding to some or all of the P terminals. Optionally, the joint precoding matrix can also be obtained according to the channel estimation results corresponding to other terminals among the M terminals except for the some or all of the P terminals.
[0207] For example, according to and The joint precoding matrix is obtained. Optionally, the channel estimation result corresponding to the terminal m3 can also be used. The joint precoding matrix is obtained.
[0208] S402: Output information indicating the joint precoding matrix.
[0209] The output may be the output of the network device to other network devices or the internal output of the network device. The network device may be a network device in an architecture where CU and DU are not separated, or may be a CU or DU in an architecture where CU and DU are separated, or may be a CU-CP or CU-UP in an architecture where CU-CP and CU-UP are separated, or may be a DU or RU in an architecture where DU and RU are separated, or may be a centralized controller, etc. For details, please refer to the above description. The output method is described below in combination with several implementation methods.
[0210] As a first implementation manner, the output may be output by the network device to other network devices.
[0211] In the first embodiment above, optionally, Figure 4A The method may further include: the other network device may process the data of the M terminals according to the joint precoding matrix. Optionally, Figure 4AThe method also includes: the other network device can send the data processed by the joint precoding matrix to the terminal, or the other network device can send the data processed by the joint precoding matrix to the network device, and the network device sends it to the terminal.
[0212] For example, the network device is a DU in a DU and RU separated architecture, and the DU can send information indicating the joint precoding matrix to the RU. The RU can process the data of the M terminals according to the joint precoding matrix, and then send the processed data to the terminal through the radio frequency unit.
[0213] For another example, the network device is an RU in a DU and RU separation architecture, and the RU can send information indicating the joint precoding matrix to the DU. The DU can process the data of the M terminals according to the joint precoding matrix, and then the DU sends the processed data to the RU, which sends it to the terminal through the radio frequency unit.
[0214] As a second implementation, the output may be output from a module in the network device to other modules of the network device, for example, output through an interface, etc., and the interface may be a circuit. The module may be referred to as a unit, specifically a physical unit, or a logical unit, which is not limited in this application.
[0215] For example, the output may be output from a processor in the network device to a memory, or may be output from a unit in the network device for calculating the joint precoding matrix to other units, etc. The other units may be units that use the joint precoding matrix. For example, the other units may process the data of the M terminals according to the joint precoding matrix.
[0216] For example, the network device is a network device under an architecture where CU and DU are not separated, and the output can be understood as an output from one unit in the network device to another unit, and the other unit can process the data of the M terminals according to the joint precoding matrix. For another example, the network device is a DU under an architecture where CU and DU are separated, and the output can be understood as an output from one unit in the DU to another unit, and the other unit can process the data of the M terminals according to the joint precoding matrix. For another example, the network device is a DU under an architecture where DU and RU are separated, and the output can be understood as an output from one unit in the DU to another unit, and the other unit can process the data of the M terminals according to the joint precoding matrix. For another example, the network device is an RU under an architecture where DU and RU are separated, and the output can be understood as an output from one unit in the RU to another unit, and the other unit can process the data of the M terminals according to the joint precoding matrix.
[0217] Optionally, in the second implementation manner, the method may further include: the network device sends the data processed by the joint precoding matrix to the terminal, and specifically, the data processed by the joint precoding matrix may be sent to the terminal through the above-mentioned unit or the above-mentioned another unit of the network device, or other units. Alternatively, the network device may send the data processed by the joint precoding matrix to other network devices, which may send the data to the terminal. This embodiment of the present application is not limited to this.
[0218] The information indicating the joint precoding matrix can be understood as the information according to which the joint precoding matrix can be obtained. There are many ways to implement the information, which are described below.
[0219] As an implementation manner, the information may be the joint precoding matrix itself.
[0220] As another implementation, the information may be information indicating a compression matrix, where the compression matrix corresponds to the joint precoding matrix. In this case, S402 may include: outputting information indicating the compression matrix.
[0221] Since the joint precoding matrix may include many elements, directly outputting the joint precoding matrix may occupy a large communication resource, resulting in a large overhead. By outputting information indicating the compressed matrix, the overhead of the output information can be saved, saving communication resources.
[0222] As another implementation manner, the information may be an index of the joint precoding matrix. The receiving end of the index may determine the joint precoding matrix according to a relationship between the joint precoding matrix and the index.
[0223] By outputting the index, the information overhead and communication resources can be saved.
[0224] Combined with the above Figure 3B , Figure 4A , Figure 4B A method for obtaining a precoding matrix is introduced in the present application. Figures 5 to 7 right Figure 3B , Figure 4A , Figure 4B and Figure 4C further explanation of the content. Figure 3B , Figure 4A , Figure 4B , Figure 4C , Figure 5 , Figure 6 and Figure 7 The contents can be quoted and referenced from each other.
[0225] This application is executed by the base station Figures 5 to 7 The method is described as an example, but the base station may include multiple network elements (ie, network devices). Figures 5 to 7 The method can be implemented by different network elements. For details, please refer to Figure 3B Description. Figure 5 A method for obtaining a joint precoding matrix is provided in an embodiment of the present application. Figure 5 The method specifically describes how to obtain the joint precoding matrix. Figure 5 The method can be used with Figure 3B and Figure 4A The methods are combined and referenced with each other. For example, S501 can be composed of Figure 3B S502 and S503 can be executed by 302 in FIG. 3 , and S504 and S505 can be executed by 303 in FIG. 3 . S505 can be referenced to S401 .
[0226] Combine the following Figure 5 Provide explanation.
[0227] S501: The base station obtains channel estimation results of M terminals.
[0228] As a first implementation manner of S501, the base station receives SRSs sent by M terminals, and performs channel estimation to obtain a channel estimation result.
[0229] It can be understood that each of the M terminals can send an SRS to the base station on an SRS resource, wherein the SRS resource may include one or more resource elements (RE).
[0230] This application is introduced by taking the reference signal SRS as an example. It should be noted that the base station can receive other reference signals sent by the terminal, and perform channel estimation to obtain a channel estimation result.
[0231] The base station can perform channel estimation on the SRS received on each RE with RE as the granularity, or can perform channel estimation on the SRS received on multiple REs (for example, resource blocks (resource block, RB) or resource block groups (resource block group, RBG)) with multiple REs as the granularity. The embodiment of the present application does not limit the granularity of the SRS for channel estimation, and introduces the example of the base station performing channel estimation on the SRS received on each RE.
[0232] refer to Figure 4A The description of the M terminals can be referred to as m i , i is a positive integer, 1≤i≤M. That is, m i ∈{m1,m2…m M}, the set {m1,m2…m M} is called set A, m i ∈A.
[0233] For example, the M terminals include terminal m1, terminal m2, terminal m3 and terminal m4.
[0234] At SRS time t, the base station receives a signal from terminal m on subcarrier r. i The channel estimation result of the received SRS can be expressed as
[0235] Among them: r is the number of the subcarrier, r = 1, 2...R, one subcarrier can correspond to one RE, r and R are integers greater than or equal to 1, i = 1, 2...M, M is an integer greater than or equal to 1; t is the number of the SRS time, t = 1, 2...T, t and T are integers greater than or equal to 1.
[0236] Can be N t Line M t A matrix of columns, where N t is the number of antennas of the base station, M t For terminal m i Optionally, the subcarriers corresponding to the SRS at different times may be the same. In addition, one RE may include one subcarrier on one symbol in the time domain, and the above SRS time t may be understood as one symbol corresponding to RE r.
[0237] For example, the base station receives the SRS of terminal m1 on subcarrier 1 and subcarrier 2 at time 1. The base station can perform channel estimation on the SRS received from terminal 1 on subcarrier 1 and subcarrier 2 at time 1, respectively. The channel estimation results can be expressed as and The base station receives the SRS of terminal m1 on subcarrier 1 and subcarrier 2 at time 2. The base station can perform channel estimation on the SRS received from terminal 1 on subcarrier 1 and subcarrier 2 at time 2, respectively. The channel estimation results can be expressed as and That is to say, the subcarriers corresponding to the SRS at time 1 and time 2 are the same, and both correspond to subcarrier 1 and subcarrier 2.
[0238] For another example, the base station receives the SRS of the terminal m2 on subcarrier 1 and subcarrier 2 at time 1. The base station can perform channel estimation on the SRS received from the terminal m2 on subcarrier 1 and subcarrier 2 at time 2. The channel estimation can be expressed as and The base station receives the SRS of the terminal m2 on subcarrier 1 and subcarrier 2 at time 2. The base station can perform channel estimation on the SRS received from the terminal m2 on subcarrier 1 and subcarrier 2 at time 2. The channel estimation can be expressed as and That is to say, the subcarriers corresponding to the SRS at time 1 and time 2 are the same, and both correspond to subcarrier 1 and subcarrier 2.
[0239] Similarly, the base station obtains the channel estimation results corresponding to the SRS of terminal m3 on subcarrier 1 and subcarrier 2 at time 1: and Channel estimation results of SRS of terminal m3 on subcarrier 1 and subcarrier 2 at time 2 and
[0240] Similarly, the base station obtains the channel estimation results corresponding to the SRS of terminal m4 on subcarrier 1 and subcarrier 2 at time 1. and Channel estimation results of SRS of terminal m4 on subcarrier 1 and subcarrier 2 at time 2 and
[0241] Optionally, space division technology may be used to enable different terminals to send SRS to the base station at the same time and on the same subcarrier.
[0242] As a second implementation of S501, the base station can send a reference signal, such as CSI-RS, to the terminal. The terminal feeds back CSI to the base station, and then the base station obtains the initial precoding matrix expected by the terminal according to the CSI. The base station can obtain the channel estimation result according to the number of antennas of the base station and the number of antennas of the terminal. At time t, the base station and the terminal m on subcarrier r i The channel estimation result of the channel between can be expressed as Can be N t Line M t Matrix of columns, r, m i ,t,N t and M t The meaning of can refer to the first embodiment mentioned above. The other contents of the second embodiment can refer to the first embodiment mentioned above, and will not be repeated here.
[0243] S502: The base station selects N terminals from the M terminals.
[0244] The base station may determine the channel correlation of each of the M terminals according to the channel estimation results of each of the M terminals, and then select a terminal whose channel correlation satisfies the first preset condition. Optionally, the channel correlation of a terminal may be the correlation between channels of the terminal at different times corresponding to the same subcarrier. For details, please refer to the description of S401.
[0245] Refer to above Figure 4A The description of the N terminals can be referred to as n j , j is a positive integer, 1≤j≤N. That is, n j ∈{n1,n2…n N}, the set {n1,n2…n N} is called set B, n j ∈B. It can be understood that B is a subset of A, that is
[0246] For example, the base station selects terminal m1, terminal m2 and terminal m3 among terminal m1, terminal m2, terminal m3 and terminal m4, that is, the N terminals include terminal n1, terminal n2 and terminal n3, among which terminal n1 is terminal m1, terminal n2 is terminal m2, and terminal n3 is terminal m3.
[0247] S502 is optional. When S502 does not exist, it can be understood that in S503, the base station calculates the statistical autocorrelation matrix of each of the M terminals.
[0248] S503: The base station calculates the statistical autocorrelation matrix of each of the N terminals.
[0249] At time t, the base station receives a signal from terminal n on subcarrier r. j The received SRS (or the base station sends the signal to the terminal n on subcarrier r) j The channel estimation result corresponding to the sent CSI-RS The autocorrelation matrix can be expressed as in, express The conjugate transposed matrix of . It can be understood that Can be N t Line M t A matrix of columns, M t Row N t A matrix of columns, N t Row N t The matrix of columns, M t For terminal m i The number of antennas, N t is the number of antennas of the base station.
[0250] Calculating the statistical autocorrelation matrix may include: filtering the autocorrelation matrix in the frequency domain, and / or filtering in the time domain. For the convenience of description, the autocorrelation matrix after filtering in the frequency domain may be referred to as the frequency domain autocorrelation matrix, the autocorrelation matrix after filtering in the time domain may be referred to as the time domain autocorrelation matrix, and the autocorrelation matrix after filtering in the frequency domain and filtering in the time domain may be referred to as the time-frequency domain autocorrelation matrix, that is, the statistical autocorrelation matrix is a frequency domain autocorrelation matrix, a time domain autocorrelation matrix or a time-frequency domain autocorrelation matrix, which are introduced below respectively. The following content may be combined with and referenced to the content in S401.
[0251] (1) Filtering in the frequency domain:
[0252] The filtering in the frequency domain may include filtering a plurality of autocorrelation matrices corresponding to a plurality of subcarriers in the frequency domain.
[0253] At time t, terminal n j The frequency domain autocorrelation matrix can be expressed as Wherein, R is an integer greater than 1.
[0254] It can be understood that there are many possibilities for the value of R. For example, the channel estimation of each subcarrier in an RBG at a certain SRS time t can be statistically analyzed in the frequency domain. An RBG can include 48 subcarriers, that is, R can be 48. Alternatively, the channel estimation on one or more subcarriers in the scheduling bandwidth can be statistically analyzed in the frequency domain, that is, R can be the number of subcarriers included in the scheduling bandwidth. For example, the scheduling bandwidth may include 4 RBGs, that is, the scheduling bandwidth includes 4*48=192 subcarriers, and R is 192, or the scheduling bandwidth may include 8 RBGs, that is, 8*48=384 subcarriers, and R is 384.
[0255] For example, at time 1, the frequency domain autocorrelation matrix of terminal n1 can be expressed as At time 2, the frequency domain autocorrelation matrix of terminal n1 can be expressed as
[0256] Similarly, it can be obtained that at time 1, the frequency domain autocorrelation matrix of terminal n2 can be expressed as And at time 2, the frequency domain autocorrelation matrix of terminal n2 can be expressed as
[0257] Similarly, it can be obtained that at time 1, the frequency domain autocorrelation matrix of terminal n3 can be expressed as And at time 2, the frequency domain autocorrelation matrix of terminal n3 can be expressed as
[0258] It can be understood that the statistical autocorrelation matrix of a terminal at time t is a second-order statistic, which can be expressed as N of the base station at time t. t The energy distribution of each antenna in the channel space between the terminal and the base station. When Q is large, a frequency domain autocorrelation matrix over a wider bandwidth can be obtained, which can approximately represent the channel space in the time domain, and thus can represent the channel space between the terminal and the base station in history. By increasing the value of the above Q, a frequency domain autocorrelation matrix over a sufficiently wide bandwidth can be obtained, which can be closer to the channel space in the time domain, and the accuracy of calculating the statistical autocorrelation matrix can be improved, thereby better avoiding inter-stream interference and improving downlink performance.
[0259] (2) Filtering in the time-frequency domain:
[0260] The filtering in the time-frequency domain may include filtering the frequency-domain autocorrelation matrix corresponding to different moments in the time domain to obtain the time-frequency domain autocorrelation matrix.
[0261] At time t, terminal n j The time-frequency domain autocorrelation matrix can be expressed as
[0262] Among them, γ and β represent the filter coefficients and can be scalars. At time t, terminal n j The frequency domain autocorrelation matrix of , for details, please refer to the above frequency domain statistics.
[0263] Among them, when t = 1, When t = 2, When t=3, And so on.
[0264] For example, at time 1, the time domain autocorrelation matrix of terminal n1 is At time 2, the time domain autocorrelation matrix of terminal n1 is
[0265] Similarly, at time 1, the time domain autocorrelation matrix of terminal n2 is At time 2, the time domain autocorrelation matrix of terminal n2 is
[0266] Similarly, at time 1, the time domain autocorrelation matrix of terminal n3 is At time 2, the time domain autocorrelation matrix of terminal n3 is
[0267] By filtering the frequency domain autocorrelation matrix of the terminal at different times, statistical sample points can be increased, making the statistical results more accurate and true.
[0268] Optionally, the above is introduced by taking the example of first performing filtering in the frequency domain and then performing filtering in the time domain. In the present application, filtering in the time domain can be performed first and then filtering in the frequency domain. For example, the result after time domain filtering can be used as The result after frequency domain filtering is expressed as Indicates. Among them,
[0269] 3) Filtering in the time domain
[0270] The filtering in the time domain may include filtering the autocorrelation matrices corresponding to different moments in the time domain to obtain the time domain autocorrelation matrix.
[0271] At time t, terminal n j The time domain autocorrelation matrix can be expressed as
[0272] Among them, γ and β represent the filter coefficients and can be scalars. At time t-1, terminal n j The time domain autocorrelation matrix of .
[0273] Among them, when t = 1, When t = 2, When t=3, And so on.
[0274] Optionally, if there is only one autocorrelation matrix corresponding to a subcarrier in the frequency domain, then is the autocorrelation matrix corresponding to the subcarrier, or, if there are multiple autocorrelation matrices corresponding to subcarriers in the frequency domain, a subcarrier can be selected from the multiple subcarriers, and the autocorrelation matrix corresponding to the subcarrier is
[0275] Terminal j The statistical autocorrelation matrix of can be expressed as Right now or
[0276] For example, the statistical autocorrelation matrix of terminal n1 can be obtained Statistical autocorrelation matrix of terminal n2 Statistical autocorrelation matrix of terminal n3
[0277] The above describes how to perform channel estimation and calculate the statistical autocorrelation matrix in combination with S501 to S503, which can be used with Figure 4A For example, Figure 4A In Can be Figure 5 In Figure 4A In Can be Figure 5 In Figure 4A In Can be Figure 5 In
[0278] Optionally, the base station may execute S503 each time it receives an SRS signal or CSI of a terminal, and then execute S503 again the next time it receives an SRS signal or CSI of the terminal, thereby obtaining a statistical autocorrelation matrix of the terminal at different times.
[0279] Optionally, when the antenna of the base station is a dual-polarized antenna and the polarization spacing is high, the statistical autocorrelation matrix can be polarized and merged. N t Row N t The matrix of columns, N t is the number of antennas in the base station, polarization combined for:
[0280]
[0281] In the table, rows 1 to N t / 2 rows, columns 1 to N t / 2 column block (hereinafter referred to as block 1 for convenience of description) and the Nth t / 2+1 row to Nth t Row, No. N t / 2+1 column to Nth t The blocks in the first column (called block 2) can be called main diagonal blocks; the blocks in the first row to the Nth row can be called main diagonal blocks; t / 2 lines, Nth t / 2+1 column to Nth t The block of columns (called block 3), and the Nth t / 2+1 row to Nth t Row, Column 1 to N t The block of / 2 columns (referred to as block 4) can be called a non-main diagonal block.
[0282] The above The polarization merging can be understood as maintaining The values of the main diagonal blocks of remain unchanged, The values of the non-main diagonal blocks are set to 0.
[0283] It is understandable that the above The values on the main diagonal blocks are the autocorrelation values of the same polarization direction, and the values on the non-main diagonal blocks are the cross-correlation values of different polarization directions. For example, if the antenna is a ±45° antenna, block 1 is the autocorrelation value of the polarization direction of +45°, block 2 is the autocorrelation value of the polarization direction of -45°, block 3 is the cross-correlation value between the polarization direction of +45° and -45°, and block 4 is the cross-correlation value between the polarization direction of -45° and +45°.
[0284] By setting the cross-correlation values of different polarization directions to 0, the correlation between polarizations can be ignored, thereby reducing the subsequent utilization The complexity of the calculation is reduced, the processor resources are saved, and the complexity of the implementation is reduced.
[0285] S504: The base station calculates a single-user precoding matrix for each of the M terminals.
[0286] In this application, the single-user precoding matrix of each terminal can be understood as the precoding matrix of the terminal in the case of single-user MIMO (SU-MIMO). A single user can be understood as a single user device or terminal, and the base station transmits with the terminal on the same time-frequency resources and does not communicate with other terminals. The precoding matrix can be called a transmission weight, and the single-user precoding matrix can be called a single-user transmission weight.
[0287] The single-user precoding matrix of each terminal among the multiple terminals may be calculated with RE as the granularity, or may be calculated with RBG (including multiple REs) as the granularity, and the following describes the two implementation modes as examples.
[0288] As an implementation method, at time t, terminal m i Channel estimation on a certain subcarrier r Perform singular value decomposition (SVD) to obtain the single-user precoding matrix
[0289] in, N t is the number of antennas of the base station, N f For terminal m i The number of flows, Indicates U k N t ×N f The complex space of .
[0290] Optionally, in this implementation, the channel estimates of the M terminals on the same subcarrier may be subjected to SVD decomposition respectively to obtain a single-user precoding matrix for each of the M terminals.
[0291] As another implementation, at time t, terminal m i The channel estimates on multiple subcarriers are concatenated, and the concatenated matrix is decomposed by SVD to obtain the terminal m i The single-user precoding matrix Splicing can be understood as connecting the terminal m i The matrices corresponding to the channel estimation on each subcarrier are concatenated into one matrix, wherein the matrix corresponding to the channel estimation on each subcarrier is a submatrix in the concatenated matrix.
[0292] in, N t is the number of antennas of the base station, N f For terminal m i The number of flows, Indicates U k N t ×N f The complex space of .
[0293] Optionally, in this implementation, the channel estimates of the M terminals on the same multiple subcarriers may be spliced respectively, and then the spliced matrices are decomposed by SVD to obtain a single-user precoding matrix for each terminal.
[0294] The above description uses two implementation modes as examples. It can be seen that the single-user precoding matrix of each terminal in the M terminals is obtained according to the channel estimation result of the terminal. In addition to the above two implementation modes, there may be other ways to obtain the single-user precoding matrix of each terminal in the M terminals, which is not limited in the embodiments of the present application.
[0295] For example, through the above multiple implementations, the single-user precoding matrix of terminal m1 can be obtained: The single-user precoding matrix of terminal m2 Single-user precoding matrix of terminal m3 Single-user precoding matrix of terminal m4
[0296] S505: The base station calculates a joint precoding matrix of the M terminals according to the statistical autocorrelation matrices of the N terminals and the single-user precoding matrix of each terminal in the M terminals.
[0297] Since the single-user precoding matrix of each of the M terminals is obtained based on the channel estimation result of the terminal, S505 can be understood as calculating the joint precoding matrix of the M terminals based on the statistical autocorrelation matrices of the N terminals and the channel estimation result of each of the M terminals.
[0298] Specifically, for each terminal in the M terminals, a multi-user precoding matrix of the terminal may be calculated, and then the multi-user precoding matrices of the terminals may be concatenated to obtain the joint precoding matrix, which may be expressed as:
[0299] In this application, the multi-user precoding matrix of each terminal can be understood as the precoding matrix of the terminal in the case of MU-MIMO. Multi-user can be understood as multiple user devices or terminals. The base station not only transmits with the terminal on the same time-frequency resource, but also communicates with other terminals. Through the multi-user initial precoding matrix, each terminal can reduce the interference from other terminals when receiving its own data. The precoding matrix can be called the transmission weight, and the multi-user precoding matrix can be called the multi-user transmission weight.
[0300] As a first implementation method, Figure 5 The method further includes the following step A1, and S505 may include the following step A2.
[0301] A1 and A2 may be performed for each of the M terminals. The following example uses a method for performing the operation on a terminal m among the M terminals. k Take an example to illustrate, 1≤k≤M.
[0302] A1: Calculate the number of terminals except terminal m k The sum of the statistical autocorrelation matrices of other terminals except .
[0303] As a possibility, the terminal m k A terminal among the N terminals, that is, the terminal m k Has its own corresponding statistical autocorrelation matrix, assuming that the terminal m k is the terminal n of the N terminals l , 1≤l≤N. Then A1 can be understood as calculating the N terminals except the terminal n l The sum of the statistical autocorrelation matrices of other terminals except .
[0304] The N terminals except terminal n l The statistical autocorrelation matrix and the sum of noise of other terminals except
[0305]
[0306] in, Indicates terminal n j The channel correlation. Can be a number between 0 and 1. The terminal n obtained in S503 j The statistical autocorrelation matrix of For terminal n j The noise of the corresponding channel estimation. Optionally, the noise of the channel estimation corresponding to each terminal in the N terminals may be the same. I is the unit matrix.
[0307] Optional, It may be the correlation between the channel corresponding to the time when the downlink data is sent and the channel corresponding to the time when the reference signal is sent.
[0308] For example, in the present application, downlink data may have been sent once or more times between two SRS moments in history. The correlation between the channels at the two SRS moments in history can be calculated by first finding the correlation between the channels at the two SRS moments in history, and then using the correlation between the channels at the two SRS moments to calculate the linear difference, thereby obtaining the correlation between the channel corresponding to the moment when the downlink data is sent and the channel corresponding to the moment when the reference signal is sent.
[0309] As another possibility, terminal m k A terminal that does not belong to the N terminals, that is, terminal m k There is no corresponding statistical autocorrelation matrix. A1 can be understood as calculating the sum of the statistical autocorrelation matrices of the N terminals.
[0310] The statistical autocorrelation matrix of the N terminals and the sum of the noise can be expressed as
[0311]
[0312] in, Indicates terminal n j The channel correlation. For terminal n j The statistical autocorrelation matrix of For terminal n j The noise of the corresponding channel estimation. Optionally, the noise of the channel estimation corresponding to each terminal in the N terminals may be the same. I is the unit matrix.
[0313] A1 may occur before S504 or after S504, which is not limited in the embodiment of the present application.
[0314] A2: According to the addition of terminal mk The statistical autocorrelation matrix of other terminals except M terminals, and the single-user precoding matrix of each terminal in the M terminals, are obtained. k The multi-user precoding matrix is
[0315] Terminal m k The multi-user precoding matrix can be expressed as satisfy:
[0316]
[0317] in, For terminal m k The channel correlation of For terminal m i The single-user precoding matrix is For terminal m k The single-user precoding matrix is
[0318] Through A1 and A2, we can understand that In It can be said that historically, terminal n j The channel space between the base station and the Approximately represents the future terminal n j The channel space between the base station and the In is not 1, so in The calculation of
[0319] Above The formula can be understood as, terminal m k The precoding matrix not only avoids the M terminals except terminal m k The channel space of other terminals other than ), and also avoid the possible channel space of other terminals in the future (which can be represented by ), thereby increasing the dimension of weight avoidance, which can reduce the interference between downlink flows and improve the performance of downlink data transmission.
[0320] From A1 and A2 above, it can be seen that if terminal m k belongs to the terminal among the N terminals, then terminal m k The multi-user initial precoding matrix is k The statistical autocorrelation matrix is related. If the terminal m k A terminal that does not belong to the N terminals (that is, the M terminals include the N terminals and the terminal m k ), then terminal m kThe multi-user initial precoding matrix is related to the statistical autocorrelation matrices of the N terminals.
[0321] Optionally, when the values of M and N are equal, that is, when the N terminals are the M terminals, the above set A=B, and the formulas in A1 and A2 can be simplified to:
[0322]
[0323]
[0324] The meaning of the formula can be found in the previous Figure 5 The description will not be repeated here.
[0325] The above introduces the calculation terminal m in combination with A1 and A2. k A1 and A2 can be performed for each of the M terminals. Finally, the joint precoding matrix of the M terminals can be expressed as:
[0326] As a second implementation method, Figure 5 The method further includes the following step B1, and S505 may include the following step B2. B1: Calculate the sum of the statistical autocorrelation matrices of the N terminals.
[0327] The sum of the statistical autocorrelation matrix and noise of the N terminals can be expressed as Φ N ,
[0328]
[0329] The meaning of the formula can be found in the previous Figure 5 The description will not be repeated here.
[0330] The above step B1 can be executed only once for the N terminals, and does not need to be executed for different terminals respectively, thereby saving processing resources.
[0331] B2 may be executed for each of the M terminals. The following example uses a terminal m among the M terminals as an example. k Take an example to illustrate, 1≤k≤M.
[0332] B2: According to the statistical autocorrelation matrix of the N terminals and the single-user precoding matrix of each terminal in the M terminals, obtain the terminal m k The multi-user precoding matrix is
[0333] As a possibility, if terminal m k A terminal among the N terminals, that is, the terminal m khas its own corresponding statistical autocorrelation matrix. Terminal m k The multi-user precoding matrix can be expressed as satisfy:
[0334]
[0335] As another possibility, terminal m k Terminal m is not one of the N terminals. k The multi-user precoding matrix can be expressed as satisfy:
[0336]
[0337] Optionally, when the values of M and N are equal, that is, when the N terminals are the M terminals, the formulas in B1 and B2 above can be simplified to:
[0338]
[0339]
[0340] The above introduces the computing terminal m in combination with B2 k The multi-user precoding matrix of can be used to perform B2 for each of the M terminals. Finally, the joint precoding matrix of the M terminals can be expressed as:
[0341] The meanings of the formulas involved in B1 and B2 above can be found in the previous description and will not be repeated here.
[0342] From the above B1 and B2, it can be seen that if terminal m k belongs to the terminal among the N terminals, then terminal m k The multi-user initial precoding matrix is in addition to the N terminals except the terminal m k The statistical autocorrelation matrix of the terminal m k Its own statistical autocorrelation matrix is related. If the terminal m k A terminal that does not belong to the N terminals (that is, the M terminals include the N terminals and the terminal m k ), then terminal m k The multi-user initial precoding matrix is related to the statistical autocorrelation matrices of the N terminals.
[0343] Terminal m among A1 to A2, B1 to B2 k It can be the first terminal in S401, and the contents can quote and refer to each other.
[0344] The difference between A1 to A2 and B1 to B2 is that if the N terminals include terminal m k In A1, for each terminal in the N terminals, it is necessary to exclude the terminal, sum the statistical autocorrelation matrices of the other terminals in the N terminals except the terminal, and then in A2, k The statistical autocorrelation matrix of other terminals other than m is inverted to calculate the terminal m k In B1, there is no need to set the terminal m k Eliminate, calculate the sum of the statistical autocorrelation matrices of the N terminals, then invert the sum of the statistical autocorrelation matrices of the N terminals in B2, and then add the terminal m k Through B1 to B2, the statistical autocorrelation matrices of N terminals can be summed up and inverted once, which can reduce the number of summations and inversions of the statistical autocorrelation matrices, reduce computational complexity, and save processing resources.
[0345] Figure 6 It is a schematic diagram of another method for obtaining a joint precoding matrix provided in an embodiment of the present application. Figure 6 The method specifically describes how to obtain the joint precoding matrix. Figure 5 The difference is that Figure 6 The statistical autocorrelation matrix and / or the channel estimation result can be modified. Figure 6 The method can be used with Figure 3B , Figure 4A and Figure 5 The methods are combined and referenced with each other. For example, S601 can be composed of Figure 3B S602 and S603 can be executed by 302 in FIG. 3 , and S604 to S607 can be executed by 303 in FIG. 3 . S607 can be cross-referenced with S401 . S601 to S604 can be cross-referenced with S501 to S504 .
[0346] Combine the following Figure 6 Provide explanation.
[0347] S601: The base station obtains channel estimation results of M terminals.
[0348] Please refer to the content in S501.
[0349] For example, the M terminals include terminal m1, terminal m2, terminal m3 and terminal m4.
[0350] S602: The base station selects N terminals from the M terminals.
[0351] Please refer to the content in S502.
[0352] For example, the N terminals include terminal n1, terminal n2 and terminal n3, wherein terminal n1 is terminal m1, terminal n2 is terminal m2, and terminal n3 is terminal m3.
[0353] S602 is optional. When S602 does not exist, it can be understood that in S603, the base station calculates the statistical autocorrelation matrix of each of the M terminals.
[0354] S603: The base station calculates the statistical autocorrelation matrix of each of the N terminals.
[0355] Please refer to the content in S503.
[0356] For example, the statistical autocorrelation matrix of terminal n1 can be obtained Statistical autocorrelation matrix of terminal n2 Statistical autocorrelation matrix of terminal n3
[0357] S604: The base station calculates a single-user precoding matrix for each of the M terminals.
[0358] Please refer to the content in S504.
[0359] Terminal m among the M terminals i The single-user precoding matrix is in, N t is the number of antennas of the base station, N f For terminal m i The number of flows, express N t ×N f The complex space of .
[0360] For example, the single-user precoding matrix of terminal m1 can be obtained The single-user precoding matrix of terminal m2 Single-user precoding matrix of terminal m3 Single-user precoding matrix of terminal m4
[0361] S604 may occur before S603, S604 may occur after S603, or S604 and S603 may occur simultaneously, which is not limited in the embodiment of the present application.
[0362] S605: Select P terminals from the M terminals.
[0363] The P terminals may be terminals among the M terminals, wherein the relationship between their channels and the channels of other terminals satisfies a second preset condition. For example, the second preset condition may be that the correlation between the channel of a certain terminal and the channels of other terminals is large, or that the channel of a certain terminal causes a certain degree of interference to the channels of other terminals.
[0364] Referring to the content in S401, for the convenience of description, the terminal in the P terminals may be referred to as p x , P and x are positive integers, 1≤P≤M, 1≤x≤P. That is, p x ∈{p1,p2…p P}, the set {p1,p2…p P} is called set C, p x ∈C. The set C is the set of the M terminals, that is, a subset of the set A, that is,
[0365] For example, the P terminals include terminal p1, terminal p2, and terminal p3. Terminal p1 is terminal m1, terminal p2 is terminal m2, and terminal p3 is terminal m4.
[0366] S605 is optional. When S605 does not exist, it can be understood that in S606, the base station calculates the joint initial precoding matrix of the M terminals according to the single-user precoding matrix of the M terminals.
[0367] S606: Calculate the initial joint precoding matrix W of the P terminals.
[0368] In order to distinguish S606 from the step of calculating the joint precoding matrix, the matrix in S606 is referred to as the initial joint precoding matrix. The initial joint precoding matrix of the P terminals includes the initial multi-user precoding matrix of each terminal in the P terminals. The multi-user precoding matrix can refer to the description of S505, which will not be repeated here.
[0369] There are multiple methods for calculating the initial joint precoding matrix, which are described below with examples in the embodiments of the present application, but are not limited to the following examples.
[0370] First, the single-user precoding matrices of the P terminals obtained in S604 and S605 can be concatenated to obtain a precoding matrix
[0371] For example, the single-user precoding matrix of terminal p1 is The single-user precoding matrix of terminal p2 is and the single-user precoding matrix of terminal p3 Splice and get
[0372] Then, the initial joint precoding matrix can be expressed as W, W = U (U H U+σ 2 I) -1 , where U H is the conjugate transposed matrix of U, σ 2 is the downlink noise floor power, I is the unit matrix, where the downlink noise floor power of the P terminals may be the same, then σ 2 is the same downlink noise floor power. If the downlink noise floor powers of the P terminals are different, we can get x of Then Splice and get σ 2 I. Among them, For terminal p x The initial multi-user precoding matrix.
[0373] For example, the initial joint precoding matrix of terminal p1, terminal p2 and terminal p3 can be obtained:
[0374] The above (U H U+σ 2 I) -1 It can be understood as avoiding the channel space of each terminal in the P terminals. It can be understood that, except for terminal p among the P terminals, x The other terminals are in the channel space corresponding to the channel estimation.
[0375] It can be understood that W is obtained based on the single-user precoding matrix of each terminal in the P terminals, and the single-user precoding matrix of each terminal is obtained based on the channel estimation of the terminal, so W is obtained based on the channel estimation of each terminal in the P terminals. It is obtained based on the channel estimation of each terminal in the P terminals.
[0376] It can be understood that if the single-user precoding matrix of each terminal in S604 is of RE granularity, then W obtained in S606 is also of RE granularity; if the single-user precoding matrix of each terminal in S604 is of RBG granularity, then W obtained in S606 is also of RBG granularity.
[0377] S607: Update the joint precoding matrix of the M terminals according to the statistical autocorrelation matrices of the N terminals and the initial joint precoding matrix of the P terminals.
[0378] Figure 7 is a schematic diagram of a method for updating a joint precoding matrix provided in an embodiment of the present application. Figure 7S607 will be described.
[0379] Figure 6 The method may further include S701 to S704, and S705 may be mutually referenced with S607. S701 to S705 are first described below. S701 to S705 is an iterative process, and the number of iterations can be represented by parameter g. Initially, g=0, and S701 to S705 are executed.
[0380] S701: Calculate the equivalent channel of each of the P terminals according to W.
[0381] Terminal p x The equivalent channel can be expressed as in, for The conjugate transposed matrix of . For terminal p x The channel estimation result.
[0382] For example, the equivalent channel of terminal p1 is The equivalent channel of terminal p2 is The equivalent channel of terminal p3 is
[0383] The terminal p x The equivalent channel can be understood as the channel from the terminal p x From the perspective of x The channel between the base station.
[0384] It can be based on S501 or S601 We can understand the terminal p x Belongs to terminal m i , the following is explained in combination with several implementation methods. It can be understood that the following content is also applicable to
[0385] As an implementation method, Wherein, r is a certain subcarrier.
[0386] For example, for terminal p1, or
[0387] Optionally, in this implementation, different terminals correspond to The corresponding subcarriers may be the same or different.
[0388] As another embodiment, It can be understood that the channel matrix corresponding to each RE in R REs at time t is summed and averaged to obtain
[0389] For example,
[0390] The above describes two implementation modes as examples. It can be seen that the terminal p x At time t, the channel estimation on one or more REs is obtained In addition to the above two methods, there are other ways to get This embodiment of the present application is not limited to this.
[0391] It can be seen from S701 that since terminal p x The equivalent channel is based on and Sure, According to the terminal p x The channel estimation result of Got it, It is obtained based on the channel estimation result of each terminal in the P terminals, so terminal p x The equivalent channel It is obtained according to the channel estimation result of each terminal in the P terminals.
[0392] S701 may occur before S603, or may occur after S603, or may occur simultaneously with S603, which is not limited in the embodiment of the present application.
[0393] S702: Calculate a coefficient matrix of each terminal in the P terminals according to an equivalent channel of the terminal.
[0394] Terminal p x The coefficient matrix of can be called terminal p x The equalizer coefficient or receiving weight can be expressed as The coefficient matrix may have other names, which are not limited in the embodiments of the present application.
[0395] As an implementation method, Satisfies the following formula:
[0396]
[0397] in, For terminal p x The corresponding channel estimation noise. I is the identity matrix.
[0398] As another implementation, if the terminal p x A terminal among the N terminals, that is, terminal p xThere is a statistical autocorrelation matrix Satisfies the following formula:
[0399]
[0400] in, For the matrix Trace of.
[0401] If the terminal p x is not a terminal among the N terminals, then Satisfies the formula in the first implementation above:
[0402]
[0403] In this other embodiment, by Finding the trace can make the receiving weight The receiving direction of the representative becomes larger and the receiving beam becomes wider, so that more channel energy can be received, which is convenient for subsequent Make more accurate corrections.
[0404] It can be seen from S702 that the terminal p of the P terminals x The coefficient matrix is based on the terminal p x The equivalent channel The terminal p x The equivalent channel It is obtained based on the channel estimation of each terminal in the P terminals, so terminal p x The coefficient matrix of is obtained based on the channel estimation of each terminal in the P terminals, that is, terminal p x The coefficient matrix of is related to the channel estimation result of each terminal in the P terminals.
[0405] Assuming that the P terminals include Q terminals among the N terminals, it can be understood that each of the Q terminals has both a statistical autocorrelation matrix and a coefficient matrix, and the coefficient matrix of the Q terminals can be used to modify the statistical autocorrelation matrix of the Q terminals. Figure 4A and Figure 4C The description of Q terminals can be referred to as q y , Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q. That is, q y ∈{q1,q2…q Q}, the set {q1,q2…q Q} is called set D, q y∈ D. The set D is the intersection of the set of the P terminals (ie, set C) and the set of the N terminals (ie, set B), that is, D = C ∩ B.
[0406] For example, according to the above description, the N terminals include terminal n1 (i.e., terminal m1), terminal n2 (i.e., terminal m2), and terminal n3 (i.e., terminal m3). The P terminals include terminal p1 (i.e., terminal m1), terminal p2 (i.e., terminal m2), and terminal p3 (i.e., terminal m4), and the Q terminals include terminal m1 and terminal m2, which can be recorded as terminal q1 and terminal q2.
[0407] S702 may occur before S603, or may occur after S603, or may occur simultaneously with S603, which is not limited in the embodiment of the present application.
[0408] S703: Modify the statistical autocorrelation matrix of each terminal in the Q terminals according to the coefficient matrix of the terminal.
[0409] Modified terminal q y The statistical autocorrelation matrix of can be expressed as
[0410]
[0411] in, for The conjugate transposed matrix of .
[0412] Optionally, for terminals that belong to the N terminals but do not belong to the Q terminals, since these terminals do not have their own coefficient matrices, the statistical autocorrelation matrix does not need to be corrected.
[0413] S703 is optional, and the statistical autocorrelation matrix of the Q terminals may not be modified.
[0414] S704: Correct the channel estimation result of each terminal in the P terminals according to the coefficient matrix of the terminal.
[0415] Terminal p x The corrected channel estimation result can be expressed as Satisfies the following formula:
[0416]
[0417] By using the above formula, the sending direction of the base station and the receiving direction of the terminal can be more closely matched.
[0418] Terminal p x The corrected channel estimation result can be understood as the equivalent channel of the base station. The equivalent channel of the base station can be understood as the distance between the base station and the terminal p from the perspective of the base station.x The channel between.
[0419] S704 is optional, and the channel estimates of the P terminals may not be corrected.
[0420] S705: Update the joint precoding matrix W′ of the M terminals according to the statistical autocorrelation matrices of the N terminals and the channel estimation result of each terminal in the M terminals.
[0421] Specifically, for each terminal in the M terminals, the multi-user precoding matrix of the terminal may be updated, and then the updated multi-user precoding matrices of the terminals may be concatenated to obtain an updated joint precoding matrix. The updated joint precoding matrix may be expressed as:
[0422] As a first implementation method, Figure 7 The method further includes the following step C1, and S705 may include the following step C2.
[0423] C1 and C2 may be performed for each of the M terminals. The following example uses a terminal m among the M terminals as an example. k Take an example to illustrate, 1≤k≤M.
[0424] C1: Calculate the number of terminals except terminal m k The sum of the statistical autocorrelation matrices of other terminals except .
[0425] As a possibility, the terminal m k A terminal among the Q terminals, that is, the terminal m k It has its own corresponding modified statistical autocorrelation matrix. Assume that the terminal m k For terminal q s , 1≤s≤Q. Then C1 can be understood as calculating the Q terminals except the terminal q s The sum of the statistical autocorrelation matrices of the other terminals except the Q terminals among the N terminals and the statistical autocorrelation matrices of the other terminals except the Q terminals.
[0426] Referring to the above, the set of Q terminals can be expressed as set D,q y ∈D. The set of N terminals can be represented as set B, n j ∈B.
[0427] The M terminals except terminal m k The sum of the autocorrelation matrices of the terminals other than
[0428]
[0429] As another possibility, the terminal m k A terminal that does not belong to the Q terminals but belongs to the N terminals, that is, the terminal m k There is a statistical autocorrelation matrix, assuming that the terminal m k For terminal n l , 1≤l≤N. Then C1 can be understood as calculating the modified statistical autocorrelation matrix of the Q terminals and the N terminals except the Q terminals and the terminal m k The sum of the statistical autocorrelation matrices other than .
[0430] Referring to the above, the set of Q terminals can be expressed as set D,q y ∈D. The set of N terminals can be represented as set B, n j ∈B.
[0431] The M terminals except terminal m k The sum of the autocorrelation matrices of the terminals other than
[0432]
[0433] As another possibility, the terminal m k A terminal that does not belong to the N terminals, that is, terminal m k There is no corresponding statistical autocorrelation matrix. C1 can be understood as calculating the sum of the statistical autocorrelation matrices of the N terminals.
[0434]
[0435] In this application, Indicates terminal q y The channel correlation of Indicates terminal q y The channel correlation. For terminal q y The corresponding channel estimate noise. For terminal n j The corresponding channel estimated noise, the meanings in the formulas refer to each other.
[0436] C1 may occur before S704 or after S704, which is not limited in the embodiment of the present application.
[0437] C2: Update the terminal m according to the sum of the statistical autocorrelation matrices of the other terminals and the channel estimation results of the M terminals. k The multi-user precoding matrix is
[0438] Updated terminal m kThe multi-user precoding matrix can be expressed as
[0439] As a possibility, the terminal m k A terminal among the P terminals, that is, the terminal m k There is a corresponding corrected channel estimation result Referring to the above, the set of M terminals can be represented as set A. The set of P terminals can be represented as set C. satisfy:
[0440]
[0441] As another possibility, the terminal m k The terminal that does not belong to the P terminals, that is, the terminal m k There is no corresponding corrected channel estimation result.
[0442]
[0443] From the above C1 and C2, it can be seen that if terminal m k belongs to the terminal among the N terminals, then terminal m k The multi-user precoding matrix is related to the N terminals except the terminal m k The statistical autocorrelation matrix is related. If the terminal m k A terminal that does not belong to the N terminals (that is, the M terminals include the N terminals and the terminal m k ), then terminal m k The multi-user precoding matrix is related to the statistical autocorrelation matrices of the N terminals.
[0444] Optionally, when the values of M, N, P and Q are equal, that is, the N terminals, the P terminals and the Q terminals are all the M terminals, Figure 4C In the set A=B=C=D, assume that terminal m k is the terminal q among the Q terminals s , the formulas in C1 and C2 above can be simplified to:
[0445]
[0446]
[0447] The above introduces the calculation terminal m in combination with C1 and C2. k The multi-user precoding matrix can be used to perform C1 and C2 for each of the M terminals. Finally, the joint precoding matrix of the M terminals can be expressed as:
[0448] S705 is introduced below in conjunction with the second implementation manner.
[0449] As a second implementation method, Figure 7 The method further includes the following step D1, and S705 may include the following step D2.
[0450] D1: Calculate the sum of the statistical autocorrelation matrix of each terminal in the N terminals.
[0451] The statistical autocorrelation matrices of the Q terminals are modified, and the statistical autocorrelation matrices of the N terminals other than the Q terminals are not modified.
[0452]
[0453] In this application, Indicates terminal q y The channel correlation of Indicates terminal q y The channel correlation. For terminal q y The corresponding channel estimate noise. For terminal n j The corresponding channel estimate noise.
[0454] The above step B1 can be executed only once for the N terminals, and does not need to be executed for different terminals respectively, thereby saving processing resources.
[0455] D2 is used for one terminal m among the M terminals. k Take an example to illustrate, 1≤k≤M.
[0456] D2: Calculate the channel estimation result of the terminal m according to the sum of the statistical autocorrelation matrices of the N terminals and the channel estimation result of the M terminals. k The multi-user precoding matrix is
[0457] Updated terminal m k The multi-user precoding matrix can be expressed as
[0458] As a possibility, the terminal m k belongs to the Q terminals, satisfy:
[0459]
[0460] As another possibility, the terminal m k does not belong to the Q terminals, but belongs to the N terminals, satisfy:
[0461]
[0462] As another possibility, the terminal m k does not belong to the N terminals, but belongs to the P terminals, satisfy:
[0463]
[0464] As another possibility, the terminal m k It does not belong to the N terminals, nor to the P terminals. satisfy:
[0465]
[0466] In this application, Indicates terminal p x The channel correlation of Indicates terminal m i The channel correlation of Indicates terminal m k The channel correlation.
[0467] Optionally, when the values of M, N, P and Q are equal, that is, the N terminals, the P terminals and the Q terminals are all the M terminals, the above set A=B=C=D, and the formulas in the above D1 and D2 can be simplified to:
[0468]
[0469]
[0470] The above introduces the calculation terminal m in combination with D2 k The multi-user precoding matrix can be used to perform D2 for each of the M terminals. Finally, the joint precoding matrix of the M terminals can be expressed as:
[0471] From the above D1 and D2, it can be seen that if terminal m k belongs to the terminal among the N terminals, then terminal m k The multi-user precoding matrix is in addition to the N terminals except the terminal m k The statistical autocorrelation matrix of the terminal m k Its own statistical autocorrelation matrix is related. If the terminal m k A terminal that does not belong to the N terminals (that is, the M terminals include the N terminals and the terminal m k ), then terminal m k The multi-user precoding matrix is related to the statistical autocorrelation matrices of the N terminals.
[0472] Terminal m in C1 to C2, D1 to D2 k It can be the first terminal in S401, and the contents can quote and refer to each other.
[0473] The difference between C1 to C2 and D1 to D2 is that if the N terminals include terminal m k , in C1, for each terminal in the N terminals, it is necessary to exclude the terminal, sum the statistical autocorrelation matrices of the other terminals in the N terminals except the terminal, and then in C2, k The statistical autocorrelation matrix of other terminals other than is inverted, and the terminal m is calculated. k In D1, there is no need to set the terminal m k Eliminate, calculate the sum of the statistical autocorrelation matrices of the N terminals, then invert the sum of the statistical autocorrelation matrices of the N terminals in D2, and then add terminal m k Through D1 to D2, the statistical autocorrelation matrices of N terminals can be summed up and inverted once, which can reduce the number of summations and inversions of the statistical autocorrelation matrices, reduce computational complexity, and save processing resources.
[0474] After executing S705, the number of iterations is replaced by g+1.
[0475] S706: Determine whether the number of iterations g is equal to a threshold.
[0476] The threshold may be set, and the larger the value of the threshold is, the more accurate the joint precoding matrix finally obtained may be.
[0477] When the number of iterations g is less than the threshold, the joint precoding matrix W′ calculated in S705 is used to replace W, and then S701 is executed.
[0478] It should be noted that, since W′ is the joint precoding matrix of the M terminals, W′ is used instead of W. After returning to S701, the equivalent channels of the M terminals are calculated based on W in S701. In S702, the coefficient matrix of each of the M terminals is calculated based on the equivalent channels of the M terminals. In S703, the statistical autocorrelation matrix of the terminal calculated in S603 is corrected by the coefficient matrix of each terminal in the N terminals. In S704, the channel estimation result of the terminal obtained according to S601 is corrected according to the coefficient matrix of each terminal in the M terminals. In S705, the joint precoding matrix W′ is updated again based on the corrected statistical autocorrelation matrix of the N terminals and the corrected channel estimation results of the M terminals.
[0479] When the number of iterations g is equal to the threshold, the joint precoding matrix W′ is output.
[0480] S707: Output the joint precoding matrix W′.
[0481] S707 can be combined with and referenced to the content of S402.
[0482] Corresponding to the method provided in the above method embodiment, the present application embodiment also provides a corresponding device, including a module for executing the corresponding module of the above embodiment. The module can be software, hardware, or a combination of software and hardware.
[0483] The device has the function of implementing the base station described in the embodiment of the present application, for example, the device includes a module or unit or means (means) corresponding to the terminal involved in the steps described in the embodiment of the present application, and the function or unit or means (means) can be implemented by software, or by hardware, or by hardware to execute the corresponding software implementation, or by a combination of software and hardware. For details, please refer to the corresponding description in the aforementioned corresponding method embodiment. Alternatively, the device has the function of implementing the network device described in the embodiment of the present application, for example, the device includes a module or unit or means (means) corresponding to the network device involved in the steps described in the embodiment of the present application, and the function or unit or means (means) can be implemented by software, or by hardware, or by hardware to execute the corresponding software implementation, or by a combination of software and hardware. For details, please refer to the corresponding description in the aforementioned corresponding method embodiment.
[0484] Figure 8 The present application provides a structural diagram of an apparatus 800. The apparatus may be a network device, a server or a centralized controller, or a component of a network device, a server or a centralized controller (e.g., an integrated circuit, a chip, etc.). The apparatus may also be other communication modules for implementing the method in the method embodiment of the present application. The network device may be a network device in an architecture where CU and DU are not separated, or may be a CU or DU in an architecture where CU and DU are separated, or may be a CU-CP or CU-UP in an architecture where CU-CP and CU-UP are separated, or may be a DU or RU in an architecture where DU and RU are separated.
[0485] The device 800 may include: an interface unit 801, a processing unit 802, and a storage unit 803, wherein the interface unit 801 and the storage unit 803 are optional.
[0486] In one possible design, Figure 8 The processing unit 802 in the embodiment may be implemented by one or more processors. The processing unit 802 may also be called a processing module, which can implement certain control functions.
[0487] The interface unit 801 may be implemented by one or more transceivers and / or communication interfaces, and the transceiver may implement communication with a terminal to implement a transceiver function. The communication interface may implement communication with other network devices. Alternatively, the communication interface may be a transceiver circuit, or an interface, or an interface circuit. The interface unit 801 may be referred to as a transceiver unit.
[0488] The storage unit 803 may be implemented by one or more memories.
[0489] Optionally, each module in the apparatus 800 in the embodiment of the present application can be used to execute the embodiment of the present application. Figure 4A , Figure 5 , Figure 6 or Figure 7 Specifically, the processing unit is used to perform processing-related actions, the interface unit 801 is used to perform information reception or information transmission between units in the network device, or to perform information reception or information transmission between the network device and other network devices, and the storage unit 803 is used to store information received from other units of the network device or other network devices, or to store information to be sent to other units or other network devices, or to store information generated by the processing unit during the processing.
[0490] In a possible implementation, the processing unit 802 is used to obtain a joint precoding matrix of the M terminals according to statistical autocorrelation matrices corresponding to N terminals among the M terminals, where M and N are positive integers, M≥2, 1≤N≤M. The interface unit 801 is used to output information indicating the joint precoding matrix.
[0491] The N terminals include terminal n j , the terminal n j The corresponding statistical autocorrelation matrix For this terminal n j The corresponding autocorrelation matrix After filtering in the frequency domain and / or time domain, j is a positive integer, 1≤j≤N, and the terminal n j The corresponding autocorrelation matrix According to the terminal n j The corresponding channel estimation result is obtained.
[0492] The storage unit 803 can store the terminal n j The corresponding channel estimation result, the terminal n j The corresponding autocorrelation matrix The terminal jThe corresponding statistical autocorrelation matrix One or more of the joint precoding matrices.
[0493] In a possible implementation, the statistical autocorrelation matrix It includes T main diagonal blocks and zero elements outside the T main diagonal blocks, where T is an integer greater than or equal to 2.
[0494] The M terminals include P terminals, and the P terminals include terminal p x , the terminal p x Corresponding coefficient matrix is related to the channel estimation result corresponding to each terminal in the P terminals, P and x are positive integers, 1≤P≤M, 1≤x≤P; and the N terminals include Q terminals in the P terminals, and the Q terminals include terminal q y .
[0495] In a possible implementation, the processing unit is configured to obtain the joint precoding matrix according to the modified statistical autocorrelation matrices corresponding to the Q terminals and the statistical autocorrelation matrices of the N terminals other than the Q terminals.
[0496] Among them, the terminal q y The corresponding corrected statistical autocorrelation matrix This terminal is y The corresponding statistical autocorrelation matrix Through the terminal q y The corresponding coefficient matrix Modified, Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q.
[0497] Optionally, in the above possible implementation manner, the processing unit is used to: x The corresponding corrected channel estimation result The joint precoding matrix is obtained by using the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals. x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0498] In another possible implementation manner, the processing unit is configured to: x The corresponding corrected channel estimation result The statistical autocorrelation matrix corresponding to the N terminals is obtained by: x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
[0499] In a possible implementation manner, the M terminals include the N terminals and a first terminal, and a precoding matrix corresponding to the first terminal in the joint precoding matrix is related to a statistical autocorrelation matrix of the N terminals.
[0500] In another possible implementation, N>1, the N terminals include a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to the statistical autocorrelation matrix of N-1 terminals of the N terminals excluding the first terminal.
[0501] Optionally, in this another possible implementation manner, the precoding matrix corresponding to the first terminal is also related to the statistical autocorrelation matrix of the first terminal.
[0502] In a possible implementation, the interface unit 801 is specifically configured to: output information indicating a compression matrix, where the compression matrix corresponds to the joint precoding matrix.
[0503] In a possible implementation manner, the channel estimation result is obtained by measuring an uplink reference signal or is obtained according to information indicating an initial precoding matrix fed back by a terminal.
[0504] The processor and transceiver described in the present application can be implemented in an integrated circuit (IC), an analog IC, a radio frequency integrated circuit RFIC, a mixed signal IC, an application specific integrated circuit (ASIC), a printed circuit board (PCB), an electronic device, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), N-type metal oxide semiconductor (NMOS), P-type metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.
[0505] The device described in the above embodiments may be a network device, but the scope of the device described in this application is not limited thereto, and the structure of the device may not be limited thereto. Figure 8 The device may be a stand-alone device or may be part of a larger device. For example, the device may be:
[0506] (1) Independent integrated circuit IC, or chip, or chip system or subsystem;
[0507] (2) having a set of one or more ICs, and optionally, the IC set may also include a storage component for storing data and / or instructions;
[0508] (3) ASIC, such as modem (MSM);
[0509] (4) Modules that can be embedded in other devices;
[0510] (5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, machine equipment, home equipment, medical equipment, industrial equipment, etc.;
[0511] (6)Others
[0512] Fig. 9A structural diagram of a device 900 is given. The device 900 can be used to implement the method described in the above method embodiment, and the details can be referred to the description in the above method embodiment. The device can be a network device, a server or a centralized controller, or a component of a network device, a server or a centralized controller (for example, an integrated circuit, a chip, etc.). The device can also be other communication modules for implementing the methods in the method embodiments of the present application. The network device can be a network device in an architecture where CU and DU are not separated, or it can be a CU or DU in an architecture where CU and DU are separated, or it can be a CU-CP or CU-UP in an architecture where CU-CP and CU-UP are separated, or it can be a DU or RU in an architecture where DU and RU are separated.
[0513] The device 900 may include one or more processors 901, which may also be referred to as a processing unit, and may implement certain control functions. The processor 901 may be a general-purpose processor or a dedicated processor, etc. For example, it may be a baseband processor or a central processing unit. The baseband processor may be used to process the communication protocol and the communication data, and the central processing unit may be used to control the communication device (such as a base station, a baseband chip, a DU, a CU or a RU, etc.), execute the software program, and process the data of the software program.
[0514] In an optional design, the processor 901 may also store instructions and / or data 903, which can be executed by the processor so that the device 900 executes the method described in the above method embodiment.
[0515] In another optional design, the processor 901 may include an interface unit for implementing the receiving and sending functions. For example, the interface unit may be a transceiver circuit, or an interface, or an interface circuit, or a communication interface. The transceiver circuit, interface, or interface circuit for implementing the receiving and sending functions may be separate or integrated. The above-mentioned transceiver circuit, interface, or interface circuit may be used for reading and writing code / data, or the above-mentioned transceiver circuit, interface, or interface circuit may be used for transmitting or delivering signals.
[0516] Optionally, the device 900 may include one or more memories 902, on which instructions 904 may be stored, and the instructions may be executed on the processor so that the device 900 performs the method described in the above method embodiment. Optionally, data may also be stored in the memory. Optionally, instructions and / or data may also be stored in the processor. The processor and memory may be provided separately or integrated together. For example, the corresponding relationship described in the above method embodiment may be stored in the memory or in the processor.
[0517] Optionally, the device 900 may further include a transceiver 905 and / or an antenna 906. The transceiver 905 may be referred to as a transceiver unit, a transceiver, a transceiver circuit, an interface unit, a transceiver device or a transceiver module, etc., and is used to implement a transceiver function, such as a transceiver function with a terminal.
[0518] Optionally, the device 900 may further include a communication interface, which may be used to communicate with other communication devices. For example, if the communication device is a CU, the CU may communicate with the DU through the communication interface.
[0519] For example, the device is a base station in a CU and DU non-separated architecture, and the device 900 may include a processor 901, a memory 902, a transceiver 905 and an antenna 906, and a communication interface 907. Among them, through the transceiver 905 and the antenna 906, the base station can transmit information with the terminal; through the communication interface 907, the base station can communicate with other base stations or network devices.
[0520] For example, when the device is a CU, the device 900 may include a processor 901, a memory 902, and a communication interface 907. Through the communication interface 907, the CU may transmit information with the DU.
[0521] Alternatively, for example, when the device is a DU (referring to a DU without separation of the DU and the RU), the communication device may include a processor 901, a memory 902, a transceiver 905 and an antenna 906, and a communication interface 907, wherein the DU may transmit information with the terminal through the transceiver 905 and the antenna 906, and the DU may transmit information with the CU through the communication interface 907. For example, the DU may implement the above Figure 4A , Figure 5 , Figure 6 to Figure 7 According to the method, after obtaining the joint precoding matrix, the DU can process the data of the M terminals through the joint precoding matrix, and then send it to the terminal through the transceiver 905 and the antenna 906.
[0522] Alternatively, for example, when the device is an RU in a DU and RU separation architecture, the device may include a processor 901, a memory 902, a transceiver 905 and an antenna 906, and a communication interface 907. The RU may transmit information with the terminal through the transceiver 905 and the antenna 906, and the RU may transmit information with the DU through the communication interface 907.
[0523] Or, for example, when the device is a DU in a DU and RU separation architecture, the device may include a processor 901, a memory 902, and a communication interface 907. The DU may transmit information with the RU through the communication interface 907.
[0524] It is understandable that some optional features in the embodiments of the present application may be implemented independently in certain scenarios without relying on other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects, or may be combined with other features according to needs in certain scenarios. Accordingly, the devices provided in the embodiments of the present application may also realize these features or functions accordingly, which will not be elaborated here.
[0525] Those skilled in the art can also understand that the various illustrative logical blocks and steps listed in the embodiments of the present application can be implemented by electronic hardware, computer software, or a combination of the two. Whether such functions are implemented by hardware or software depends on the specific application and the design requirements of the entire system. Those skilled in the art can use various methods to implement the functions for corresponding applications, but such implementation should not be understood as exceeding the scope of protection of the embodiments of the present application.
[0526] It is understood that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
[0527] The scheme described in the present application can be implemented in various ways. For example, these technologies can be implemented in a combination of hardware, software or hardware. For hardware implementation, the processing unit for executing these technologies at a communication device (for example, a base station, a terminal, a network entity or a chip) can be implemented in one or more general-purpose processors, DSPs, digital signal processing devices, ASICs, programmable logic devices, FPGAs, or other programmable logic devices, discrete gates or transistor logic, discrete hardware components, or any combination thereof. The general-purpose processor can be a microprocessor, and optionally, the general-purpose processor can also be any traditional processor, controller, microcontroller or state machine. The processor can also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration to implement.
[0528] It can be understood that the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.
[0529] The present application also provides a computer-readable medium on which a computer program is stored. When the computer program is executed by a computer, the functions of any of the above method embodiments are implemented.
[0530] The present application also provides a computer program product, which implements the functions of any of the above method embodiments when executed by a computer.
[0531] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instruction is loaded and executed on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instruction can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instruction can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more available media integrations. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a high-density digital video disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).
[0532] It is understood that the "embodiment" mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present application. Therefore, the various embodiments in the entire specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It is understood that in various embodiments of the present application, the size of the sequence number of the above-mentioned processes does not mean the order of execution, and the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.
[0533] It can be understood that in the present application, "when", "if" and "if" all mean that the device will take corresponding actions under certain objective circumstances, and do not limit the time, nor do they require that the device must have a judgment action when it is implemented, nor do they mean that there are other limitations.
[0534] The term “simultaneously” in the present application may be understood as at the same time point, within a period of time, or within the same cycle.
[0535] Those skilled in the art will appreciate that the first, second, and other various digital numbers involved in the present application are only for the convenience of description and are not intended to limit the scope of the embodiments of the present application. The specific values of the numbers (also referred to as indexes), the specific values of the quantities, and the positions in the present application are only for illustrative purposes, are not the only form of representation, and are not intended to limit the scope of the embodiments of the present application. The first, second, and other various digital numbers involved in the present application are also only for the convenience of description and are not intended to limit the scope of the embodiments of the present application.
[0536] In this application, elements expressed in the singular are intended to mean "one or more" rather than "one and only one", unless otherwise specified. In this application, "at least one" is intended to mean "one or more", and "more than one" is intended to mean "two or more", unless otherwise specified.
[0537] In addition, the terms "system" and "network" are often used interchangeably in this article. The term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. A can be singular or plural, and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.
[0538] In this document, the term "at least one of..." or "at least one of..." means all or any combination of the listed items. For example, "at least one of A, B, and C" may mean: A exists alone, B exists alone, C exists alone, A and B exist at the same time, B and C exist at the same time, and A, B, and C exist at the same time, where A may be singular or plural, B may be singular or plural, and C may be singular or plural.
[0539] It can be understood that in each embodiment of the present application, "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should also be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.
[0540] The corresponding relationships shown in each table in the present application can be configured or predefined. The values of the information in each table are only examples and can be configured as other values, which are not limited by the present application. When configuring the corresponding relationship between the information and each parameter, it is not necessarily required to configure all the corresponding relationships illustrated in each table. For example, in the table in the present application, the corresponding relationships shown in some rows may not be configured. For another example, appropriate deformation adjustments can be made based on the above table, such as splitting, merging, etc. The names of the parameters shown in the titles of the above tables can also use other names that can be understood by the communication device, and the values or representations of the parameters can also be other values or representations that can be understood by the communication device. When implementing the above tables, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables or hash tables.
[0541] The predefined in the present application may be understood as defined, predefined, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-burned.
[0542] It will be appreciated by those skilled in the art that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0543] Those skilled in the art will appreciate that, for the sake of convenience and brevity of description, the specific working processes of the systems, devices and units described above may refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0544] It is understood that the systems, devices and methods described in the present application can also be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the unit is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0545] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0546] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0547] If this function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program codes.
[0548] The same or similar parts between the various embodiments in this application can refer to each other. In the various embodiments in this application, and the various implementation methods / implementation methods / implementation methods in each embodiment, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments and the various implementation methods / implementation methods / implementation methods in each embodiment are consistent and can be referenced to each other. The technical features in different embodiments and the various implementation methods / implementation methods / implementation methods in each embodiment can be combined to form new embodiments, implementation methods, implementation methods, or implementation methods according to their inherent logical relationships. The above-described implementation methods of this application do not constitute a limitation on the scope of protection of this application.
[0549] The above description is only a specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application.
Claims
1. A method for obtaining a precoding matrix, It is characterized in that The method comprises: Obtaining a joint precoding matrix of the M terminals according to statistical autocorrelation matrices corresponding to N terminals among the M terminals, where M and N are positive integers, M≥2, 1≤N≤M; Outputting information indicating the joint precoding matrix; The N terminals include terminal n j , the terminal n j The corresponding statistical autocorrelation matrix For the terminal n j The corresponding autocorrelation matrix The terminal n is obtained by filtering in the frequency domain and / or time domain, j is a positive integer, 1≤j≤N, and j The corresponding autocorrelation matrix is based on the terminal n j The corresponding channel estimation result Got it.
2. The method according to claim 1, It is characterized in that The statistical autocorrelation matrix It includes T main diagonal blocks and zero elements outside the T main diagonal blocks, where T is an integer greater than or equal to 2.
3. The method according to claim 1 or 2, It is characterized in that The M terminals include P terminals, and the P terminals include terminal p x , the terminal p x Corresponding coefficient matrix is related to the channel estimation result corresponding to each of the P terminals, P and x are positive integers, 1≤P≤M, 1≤x≤P; and The N terminals include Q terminals among the P terminals, and the Q terminals include terminal q y , obtaining the joint precoding matrix according to the statistical autocorrelation matrices corresponding to the N terminals respectively includes: Obtaining the joint precoding matrix according to the modified statistical autocorrelation matrices corresponding to the Q terminals and the statistical autocorrelation matrices of the N terminals other than the Q terminals; Among them, the terminal q y The corresponding corrected statistical autocorrelation matrix is the terminal q y The corresponding statistical autocorrelation matrix Through the terminal q y The corresponding coefficient matrix Modified, Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q.
4. The method according to claim 3, It is characterized in that Obtaining the joint precoding matrix according to the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals includes: According to the terminal p x The corresponding corrected channel estimation result The joint precoding matrix is obtained by using the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals; Among them, the terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
5. The method according to claim 1 or 2, It is characterized in that The M terminals include P terminals, and the P terminals include terminal p x , the terminal p x Corresponding coefficient matrix is related to a channel estimation result corresponding to each of the P terminals, where P and x are positive integers, 1≤P≤M, 1≤x≤P; and Obtaining the joint precoding matrix of the M terminals according to the statistical autocorrelation matrices respectively corresponding to the N terminals includes: According to the terminal p x The corresponding corrected channel estimation result and the statistical autocorrelation matrices corresponding to the N terminals respectively, to obtain the joint precoding matrix; The terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
6. The method according to claim 1 or 2, It is characterized in that The M terminals include the N terminals and a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to statistical autocorrelation matrices corresponding to the N terminals respectively.
7. The method according to claim 1 or 2, It is characterized in that N≥2, the N terminals include a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to statistical autocorrelation matrices corresponding to N-1 terminals among the N terminals except the first terminal.
8. The method according to claim 7, It is characterized in that The precoding matrix corresponding to the first terminal is also related to the statistical autocorrelation matrix corresponding to the first terminal.
9. The method according to claim 1 or 2, It is characterized in that Outputting information indicating the joint precoding matrix includes: Information indicating a compression matrix is output, the compression matrix corresponding to the joint precoding matrix.
10. The method according to claim 1 or 2, It is characterized in that The channel estimation result is obtained by measuring the uplink reference signal or according to information indicating the initial precoding matrix fed back by the terminal.
11. A communication device, It is characterized in that The communication device comprises: A processing unit, configured to obtain a joint precoding matrix of the M terminals according to statistical autocorrelation matrices corresponding to N terminals among the M terminals, where M and N are positive integers, M≥2, 1≤N≤M; An interface unit, configured to output information indicating the joint precoding matrix; The N terminals include terminal n j , the terminal n j The corresponding statistical autocorrelation matrix For the terminal n j The corresponding autocorrelation matrix The terminal n is obtained by filtering in the frequency domain and / or time domain, j is a positive integer, 1≤j≤N, and j The corresponding autocorrelation matrix is based on the terminal n j The corresponding channel estimation result Got it.
12. The communication device according to claim 11, It is characterized in that The statistical autocorrelation matrix It includes T main diagonal blocks and zero elements outside the T main diagonal blocks, where T is an integer greater than or equal to 2.
13. The communication device according to claim 11 or 12, It is characterized in that The M terminals include P terminals, and the P terminals include terminal p x , the terminal p x Corresponding coefficient matrix is related to the channel estimation result corresponding to each of the P terminals, P and x are positive integers, 1≤P≤M, 1≤x≤P; and The N terminals include Q terminals among the P terminals, and the Q terminals include terminal q y The processing unit is used to obtain a joint precoding matrix of the M terminals according to statistical autocorrelation matrices corresponding to N terminals in the M terminals, including: The processing unit is used to obtain the joint precoding matrix according to the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals; Among them, the terminal q y The corresponding corrected statistical autocorrelation matrix is the terminal q y The corresponding statistical autocorrelation matrix Through the terminal q y The corresponding coefficient matrix Modified, Q and y are positive integers, 1≤Q≤P, 1≤Q≤N, 1≤y≤Q.
14. The communication device according to claim 13, It is characterized in that The processing unit is configured to obtain the joint precoding matrix according to the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals, including: The processing unit is used to x The corresponding corrected channel estimation result The joint precoding matrix is obtained by using the modified statistical autocorrelation matrix corresponding to the Q terminals and the statistical autocorrelation matrix of the N terminals other than the Q terminals; Among them, the terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
15. The communication device according to claim 11 or 12, It is characterized in that The M terminals include P terminals, and the P terminals include terminal p x , the terminal p x Corresponding coefficient matrix is related to a channel estimation result corresponding to each of the P terminals, where P and x are positive integers, 1≤P≤M, 1≤x≤P; and The processing unit is configured to obtain a joint precoding matrix for the M terminals according to the statistical autocorrelation matrices respectively corresponding to the N terminals, comprising: The processing unit is used to x The corresponding corrected channel estimation result and the statistical autocorrelation matrices corresponding to the N terminals respectively, to obtain the joint precoding matrix; The terminal p x The corresponding corrected channel estimation result is the terminal p x The corresponding channel estimation result Through the terminal p x The corresponding coefficient matrix Corrected.
16. The communication device according to claim 11 or 12, It is characterized in that The M terminals include the N terminals and a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to the statistical autocorrelation matrix of the N terminals.
17. The communication device according to claim 11 or 12, It is characterized in that The N>1, the N terminals include a first terminal, and the precoding matrix corresponding to the first terminal in the joint precoding matrix is related to the statistical autocorrelation matrix of N-1 terminals of the N terminals except the first terminal.
18. The communication device according to claim 17, It is characterized in that The precoding matrix corresponding to the first terminal is also related to the statistical autocorrelation matrix of the first terminal.
19. The communication device according to claim 11 or 12, It is characterized in that The interface unit is specifically used for: Information indicating a compression matrix is output, the compression matrix corresponding to the joint precoding matrix.
20. The communication device according to claim 11 or 12, It is characterized in that The channel estimation result is obtained by measuring the uplink reference signal or according to information indicating the initial precoding matrix fed back by the terminal.
21. A communication device, It is characterized in that The method comprises a processor, wherein the processor is coupled to a memory, the memory is used to store a computer program or an instruction, and the processor is used to execute the computer program or the instruction in the memory, so that the method according to any one of claims 1 to 10 is executed.
22. A computer-readable storage medium, It is characterized in that A program or instruction for implementing the method according to any one of claims 1 to 10 is stored.
23. A computer program product, It is characterized in that The computer program product comprises computer-executable instructions, and when the computer-executable instructions are executed, the method according to any one of claims 1 to 10 is implemented.
