Channel feedback method, device and equipment

Abstract

Provided are a channel feedback method, apparatus and device, the method comprising: a first station receiving a first frame sent by a first access point, the first frame being used for indicating the first station to feed back compressed channel information, the first station being associated with the first access point; the first station receives a second frame sent by the first access point, wherein the second frame is used for the first station to perform channel estimation to obtain first data channel information; the first station sends a third frame to the first access point, the third frame comprises compressed data channel information, the compressed data channel information is obtained by compressing first equivalent data channel information, and the first equivalent data channel information is determined according to the first data channel information and a first smooth left singular vector matrix; the first smooth left singular vector matrix is obtained by smoothing a first left singular vector matrix, and the first left singular vector matrix is obtained by performing singular value decomposition on the first data channel information.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to a channel feedback method, apparatus, and device. Background Technology

[0002] In related technologies, the site performs channel estimation based on Null Data Protocol Data Units (NDPs) to obtain the H matrix. The H matrix can then be further decomposed into singular value decomposition to obtain the beam weight V matrix. The site can feed back the V matrix to the access point. However, the fed-back V matrix is ​​not smoothed, which affects the downlink channel estimation performance. Therefore, how to perform channel information feedback to improve downlink channel estimation performance is an urgent problem to be solved. Summary of the Invention

[0003] This application provides a channel feedback method, apparatus, and device, which are beneficial for improving downlink channel estimation performance.

[0004] Firstly, a channel feedback method is provided, including:

[0005] The first station receives a first frame sent by the first access point. The first frame is used to instruct the first station to return compressed channel information. The first station and the first access point are associated.

[0006] The first station receives a second frame sent by the first access point. The second frame is used by the first station to perform channel estimation to obtain first data channel information.

[0007] The first station sends a third frame to the first access point. The third frame includes compressed data channel information, wherein the compressed data channel information is obtained by compressing first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing a first left singular vector matrix. The first left singular vector matrix is ​​obtained by performing singular value decomposition on the first data channel information.

[0008] In some embodiments, the MIMO control field includes a feedback type field, which carries the fourth indication.

[0009] In some embodiments, the method further includes:

[0010] The first station determines the first equivalent data channel information based on the first data channel information and the first smoothed left singular vector matrix.

[0011] Secondly, a channel feedback method is provided, including:

[0012] The second station receives a first frame sent by the first access point. The first frame is used to instruct the second station to feed back compressed channel information. The second station and the second access point are associated.

[0013] The second station receives a second frame sent by the first access point. The second frame is used by the second station to perform channel estimation to obtain first interference channel information.

[0014] The second station sends a fourth frame to the first access point. The fourth frame includes compressed interference channel information, wherein the compressed interference channel information is obtained by compressing a first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0015] In some implementations, the first frame includes third information, which includes at least one of the following:

[0016] The seventh instruction is used to instruct the second station to feed back compressed channel information;

[0017] The eighth indication is used to indicate the polynomial information used in the compression channel information of the second station;

[0018] The ninth indication is used to indicate the size of the subcarrier packets used for the second station's compressed channel information.

[0019] In some implementations, the fourth frame further includes fourth information, which includes at least one of the following:

[0020] The tenth indication is used to indicate that the feedback from the fourth frame is compressed channel information;

[0021] The eleventh instruction is used to indicate the polynomial information used in the compression channel information of the second station;

[0022] The twelfth instruction is used to indicate the size of the subcarrier packets used for the second station's compressed channel information.

[0023] In some implementations, the fourth frame includes a multiple-input multiple-output (MIMO) control field, and the fourth information is carried in the MIMO control field.

[0024] In some implementations, the MIMO control field includes a feedback type field, which carries the tenth instruction.

[0025] In some implementations, the polynomial coefficient vector corresponding to the subcarrier group is determined according to the following formula:

[0026]

[0027] Where B represents the equivalent matrix of an nth-degree polynomial, F represents a vector consisting of P equivalent interference channels corresponding to P subcarriers in a subcarrier group. 21 The vector represents the polynomial coefficients corresponding to the subcarrier group, wherein the equivalent matrix of the nth degree polynomial is composed of n+1 vectors obtained by raising the indices of the P subcarriers in the subcarrier group to the nth to the 0th power respectively.

[0028] In some implementations, P is an even number, and the equivalent matrix B of the nth-degree polynomial is...

[0029]

[0030] Wherein, P is an odd number, and the m-degree polynomial equivalent matrix B is...

[0031]

[0032] Where B has P rows and n+1 columns.

[0033] Thirdly, a channel feedback method is provided, including:

[0034] The first access point sends a first frame, which is used to instruct the first station and the second station to send compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point;

[0035] The first access point sends a second frame. The first frame is used by the first site to perform channel estimation to obtain first data channel information, and the first frame is used by the second site to perform channel estimation to obtain first interference channel information.

[0036] The first access point receives the third frame sent by the first site and the fourth frame sent by the second site;

[0037] The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix. The first left singular vector matrix is ​​obtained by performing singular value decomposition on the first data channel information. m is a positive integer.

[0038] The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0039] In some implementations, the first frame includes first information, which includes at least one of the following: a first indication for instructing the first station to feed back compressed channel information;

[0040] The second indication is used to indicate the polynomial information used in the compression channel information of the first station;

[0041] The third indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

[0042] In some implementations, the third frame further includes second information, which includes at least one of the following: a fourth indication, used to indicate that the third frame feeds back compressed channel information;

[0043] The fifth indication is used to indicate the polynomial information used in the compression channel information of the first station;

[0044] The sixth indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

[0045] In some implementations, the third frame includes a multiple-input multiple-output (MIMO) control field, and the second information is carried in the MIMO control field.

[0046] In some implementations, the MIMO control field includes a feedback type field, which carries the fourth indication.

[0047] In some implementations, the first frame includes third information, which includes at least one of the following:

[0048] The seventh instruction is used to instruct the second station to feed back compressed channel information;

[0049] The eighth indication is used to indicate the polynomial information used in the compression channel information of the second station;

[0050] The ninth indication is used to indicate the size of the subcarrier packets used for the second station's compressed channel information.

[0051] In some implementations, the fourth frame further includes fourth information, which includes at least one of the following:

[0052] The tenth indication is used to indicate that the feedback from the fourth frame is compressed channel information;

[0053] The eleventh instruction is used to indicate the polynomial information used in the compression channel information of the second station;

[0054] The twelfth instruction is used to indicate the size of the subcarrier packets used for the second station's compressed channel information.

[0055] In some implementations, the fourth frame includes a multiple-input multiple-output (MIMO) control field, and the fourth information is carried in the MIMO control field.

[0056] In some implementations, the MIMO control field includes a feedback type field, which carries the tenth instruction.

[0057] In some implementations, the first access point determines the precoded equivalent data channel information based on the first beam weight matrix and the recovered first equivalent data channel information, including:

[0058] The first access point uses the product of the recovered first equivalent data channel information and the first beam weight matrix as the precoded equivalent data channel information.

[0059] Fourthly, a communication device is provided, which is a first station, or is disposed in a first station, the communication device comprising:

[0060] The receiving module is configured to receive a first frame sent by a first access point, the first frame being used to instruct the first station to feed back compressed channel information, wherein the first station and the first access point are associated; and to receive a second frame sent by the first access point, the second frame being used by the first station to perform channel estimation to obtain first data channel information.

[0061] The transmitting module is configured to transmit a third frame to the first access point. The third frame includes compressed data channel information, wherein the compressed data channel information is obtained by compressing first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing a first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

[0062] Fifthly, a communication device is provided, characterized in that the communication device is a second station, or is disposed in a second station, the communication device comprising:

[0063] The receiving module is configured to receive a first frame sent by a first access point, wherein the first frame is used to instruct the second station to feed back compressed channel information, wherein the second station and the second access point are associated; and to receive a second frame sent by the first access point, wherein the second frame is used by the second station to perform channel estimation to obtain first interference channel information.

[0064] The transmitting module is configured to transmit a fourth frame to the first access point. The fourth frame includes compressed interference channel information, wherein the compressed interference channel information is obtained by compressing a first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame transmitted by the second access point.

[0065] Sixthly, a communication device is provided, which is a first access point, or is disposed in a first access point, the communication device comprising:

[0066] The transmitting module is configured to transmit a first frame, which instructs a first station and a second station to transmit compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point; and to transmit a second frame, wherein the first frame is used by the first station to perform channel estimation to obtain first data channel information and the second station to perform channel estimation to obtain first interference channel information.

[0067] The receiving module is used to receive the third frame sent by the first station and the fourth frame sent by the second station.

[0068] The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

[0069] The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0070] In a seventh aspect, a site is provided, including a processor and a memory. The memory is used to store a computer program, and the processor is used to invoke and run the computer program stored in the memory, performing the methods of any one of the first to second aspects or their respective implementations.

[0071] Eighthly, an access point is provided, including a processor and a memory. The memory is used to store computer programs, and the processor is used to call and run the computer programs stored in the memory, performing the methods described in the third aspect or its various implementations.

[0072] A ninth aspect provides a chip for implementing the methods of any one of the first to second aspects or their respective implementations. Specifically, the chip includes a processor for calling and running a computer program from a memory, causing a device equipped with the chip to perform the methods of any one of the first to third aspects or their respective implementations.

[0073] In a tenth aspect, a readable storage medium is provided for storing a computer program that causes a computer to perform the methods of any one of the first to third aspects or their respective implementations.

[0074] Eleventhly, a computer program product is provided, including computer program instructions that cause a computer to perform the methods of any one of the first to third aspects or their respective implementations.

[0075] In a twelfth aspect, a computer program is provided that, when run on a computer, causes the computer to perform the methods of any one of the first to third aspects or their respective implementations.

[0076] Through the above technical solution, the first station can smooth the first left singular matrix (i.e., the U matrix) obtained by singular value decomposition of the first data channel information, and then use the smoothed U matrix to smooth the first data channel information to obtain the first equivalent data channel information. The first equivalent data channel information is then compressed, and the compressed data channel information is fed back to the first access point. Since the first equivalent data channel information is obtained through smoothing, its phase in the frequency domain is continuous; that is, there are no discontinuous phase transitions. Thus, when compressing the first equivalent data channel information, the first station can ensure the compression performance of the channel, reduce the bandwidth requirement for channel feedback, and utilize the phase continuity of the channel for smoothing filtering during channel estimation, which is beneficial for improving channel estimation performance. Attached Figure Description

[0077] Figure 1 This is a schematic diagram of a communication system applicable to embodiments of this application.

[0078] Figure 2 This is a schematic diagram of the C-BF measurement feedback principle related to the embodiments of this application.

[0079] Figure 3 This is a schematic diagram of the C-BF measurement feedback process related to this application.

[0080] Figure 4 This is a schematic interactive diagram of a channel feedback method provided in an embodiment of this application.

[0081] Figure 5 This is a schematic interactive diagram of another channel feedback method provided in the embodiments of this application.

[0082] Figure 6 This is a performance comparison chart of channel feedback using a smoothed equivalent channel and channel feedback using an unsmoothed equivalent channel.

[0083] Figure 7 This is a schematic interactive diagram of another channel feedback method provided in the embodiments of this application.

[0084] Figure 8 This is a schematic diagram of a channel feedback method provided in an embodiment of this application.

[0085] Figure 9This is a schematic format diagram of a first frame provided in an embodiment of this application.

[0086] Figure 10 This is a schematic format diagram of the STA info field in the first frame provided in an embodiment of this application.

[0087] Figure 11 This is a schematic diagram of the format of a MIMO control field in a third or fourth frame provided in an embodiment of this application.

[0088] Figure 12 This is the frequency domain response diagram of a channel in a large office or open shopping mall scenario simulated under the 802.11ac channel model.

[0089] Figure 13 This is a schematic diagram of a communication device provided in an embodiment of this application.

[0090] Figure 14 This is a schematic diagram of another communication device provided in an embodiment of this application.

[0091] Figure 15 This is a schematic diagram of another communication device provided in the embodiments of this application.

[0092] Figure 16 This is a schematic block diagram of a communication device provided according to an embodiment of this application.

[0093] Figure 17 This is a schematic block diagram of a chip provided according to an embodiment of this application.

[0094] Figure 18 This is a schematic block diagram of a communication system provided according to an embodiment of this application. Detailed Implementation

[0095] The technical solutions of the embodiments of this application will now be described with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. All other embodiments obtained by those skilled in the art without creative effort regarding the embodiments of this application are within the scope of protection of this application.

[0096] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Furthermore, the terms "first" and "second," etc., used herein are used only to distinguish different objects and not to describe a particular order.

[0097] It should be noted that, in the embodiments of this application, "at least one item" refers to one item or more items, "more items" refers to two items or more, and "at least two items" refers to two items or more. "At least one of the following items" or similar expressions can refer to any combination of these items. For example, at least one item of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0098] It should be noted that in the embodiments of this application, "and / or" indicates that the connected objects can have three relationships. For example, "A and / or B" can represent three scenarios: only A exists, only B exists, and both A and B exist simultaneously. The character " / " generally indicates that the preceding and following objects have an "or" relationship.

[0099] It should be understood that the "instruction" mentioned in the embodiments of this application can be a direct instruction or an indirect instruction. For example, A instructing B can mean that A directly instructs B, such as B being obtainable through A; or it can mean that A indirectly instructs B, such as A instructing C, where B is obtainable through C, for example, B and C are related.

[0100] The technical solutions provided in this application can be applied to wireless local area network (WLAN) systems, and are applicable to any of the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series protocols used in WLANs, such as 802.11a / b / g, 802.11n, 802.11ac, 802.11ax, 802.11be, 802.11bn, and future 802.11 protocols. The methods provided in this application can be implemented by communication devices in a wireless communication system or by chips or processors within those devices. Accordingly, the communication device supports communication using the IEEE 802.11 series protocols. Although the embodiments of this application are primarily illustrated using a network deploying IEEE 802.11 as an example, those skilled in the art will readily understand that the various aspects of this application can be extended to other networks employing various standards or protocols, such as Bluetooth, high-performance radio LAN (HIPERLAN) (a wireless standard similar to IEEE 802.11, primarily used in Europe), wide area network (WAN), WLAN, personal area network (PAN), ultra-wideband (UWB) based wireless PAN systems, sensing systems, or other networks now known or to be developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in this application can be applied to any suitable wireless network.

[0101] In the WiFi protocol, a station (abbreviated as STA) includes access point stations (abbreviated as AP STA) and non-access point stations (abbreviated as non-AP station). For the sake of simplicity, access point stations are usually called access points (abbreviated as AP), and non-access point stations are called stations (abbreviated as STA).

[0102] Figure 1A schematic structural diagram of a communication system 100 applicable to embodiments of this application is shown. The communication system 100 may include an access point 110 and a station 120. The station 120 can access the network through the access point 110.

[0103] Access points can support communication or sensing based on WiFi protocols, such as 802.11b, 802.11a, 802.11g, 802.11n, 802.11ac, 802.11ax, 802.11be, 802.11bn, or next-generation or later protocols.

[0104] The site can support communication or sensing based on WiFi protocols, such as 802.11b, 802.11a, 802.11g, 802.11n, 802.11ac, 802.11ax, 802.11be, 802.11bn, or next-generation or later protocols.

[0105] The communication in the communication system 100 can be communication between access points and stations, or communication between stations, or communication between access points.

[0106] An access point acts as a bridge connecting wired and wireless networks. Its main function is to connect various wireless network clients together and then connect the wireless network to the Ethernet.

[0107] In some scenarios, access points and sites can be devices used in vehicle networking, IoT nodes and sensors in the Internet of Things (IoT), smart cameras, smart remote controls, smart water and electricity meters in smart homes, and sensors in smart cities.

[0108] In some scenarios, the access point can be a terminal device (such as a mobile phone) with a WiFi chip or a network device (such as a router).

[0109] In the embodiments of this application, the site may be a mobile phone, tablet computer, computer, virtual reality (VR) device, augmented reality (AR) device, wireless device in industrial control, set-top box, wireless device in self-driving, vehicle communication device, wireless device in remote medical care, wireless device in smart grid, wireless device in transportation safety, wireless device in smart city or smart home, wireless device, wireless communication chip, etc. that support WLAN or WiFi technology.

[0110] It should be understood that Figure 1 Only one access point and two sites are shown in the example. Optionally, the communication system 100 may include multiple access points or other numbers of sites. This application embodiment does not limit this.

[0111] Optionally, the communication system 100 may also include other devices, such as network controllers, gateways, and other network entities, which are not limited in this application.

[0112] To facilitate understanding of the embodiments of this application, the multi-AP collaboration (MAPC or MAP) technology related to this application will be described.

[0113] Traditional Wi-Fi networks typically rely on a single access point (AP) to serve multiple users. However, as the number of users increases and application demands rise, a single AP struggles to meet the performance requirements of high-density environments, often leading to network congestion, increased latency, and decreased throughput. To address this, multi-AP collaboration technology has been introduced, optimizing network performance through the coordinated work of multiple APs.

[0114] Multi-AP collaboration refers to a technology in a Wi-Fi network where multiple access points (APs) cooperate and share resources to improve overall network performance. By allowing multiple APs to share resources and information, such as Channel State Information (CSI), power control, and spectrum allocation, more efficient network management and data transmission can be achieved. The main goals of multi-AP collaboration technology are to reduce channel interference, improve spectrum utilization, and enhance user experience.

[0115] Multi-AP cooperation includes the following schemes: Joint Transmission (JT), Distributed Multiple-Input Multiple-Output (MIMO), Coordinate Beamforming (C-BF), Coordinate Spatial Reuse (C-SR), and Coordinate Orthogonal Frequency Division Multiple Access (OFDMA, C-OFDMA). C-BF is a technique that uses channel state information to adjust the antenna array, aiming to enhance signal quality and coverage through directional signal transmission. C-BF achieves higher signal strength and lower interference through spatial signal processing. Directional transmission significantly improves signal strength and network coverage, effectively suppresses interference from other directions, and enhances signal quality. Therefore, by optimizing signal transmission, users can enjoy faster network speeds and more stable connections.

[0116] Combination Figure 2 The principle of C-BF measurement feedback related to the embodiments of this application will be explained.

[0117] exist Figure 2 In the illustrated embodiment, the multi-AP cooperative set may include AP1 and AP2, wherein STA1 is associated with AP1 and STA2 is associated with AP2. STA1 measures the null data packet (NDP) frames sent by AP1 to obtain the data channel H. 11 STA1 performs channel estimation on the NDP transmitted by AP2 to obtain the interfering channel H. 12 STA2 measures the NDP frames sent by AP2 to obtain the data channel H. 22 STA2 performs channel estimation on the NDP transmitted by AP1 to obtain the interfering channel H. 21 Then STA1 connects to data channel H. 11 and interference channel H 12 Processing (e.g., Singular Value Decomposition (SVD)) yields the beam weight matrix V. 11 And equivalent interference matrix / spatial zero interference weight matrix H eq,12 Similarly, STA2 is based on data channel H 22 and interference channel H 21Calculate the beam weight matrix V 22 And equivalent interference matrix / spatial zero interference weight matrix H eq,21 .

[0118] For example, STA1 can perform the following singular value decomposition operation to obtain V. 11 : Among them, U 11 Let D represent the left singular vector matrix. 11 V represents a singular value matrix. 11 Describes a right singular vector matrix. V represents 11 The conjugate transpose of .

[0119] For example, STA2 can perform the following singular value decomposition operation to obtain V. 22 : Among them, U 22 Let D represent the left singular vector matrix. 22 V represents a singular value matrix. 22 This represents a right singular vector matrix.

[0120] To minimize or eliminate interference from downlink data transmission to associated STAs of neighboring APs, APs typically need to know the channels from non-associated STAs to themselves, such as... Figure 2 As shown, for AP1, it is necessary to know the interference channel H between AP1 and the non-associated STA2. 21 H 21 It is obtained by STA2 through the NDP sent to AP1, therefore, STA2 can feed back V to AP1. 21 In this way, AP1 can use the V feedback from STA1 11 V feedback from STA2 21 Together, calculate and determine the transmission weight W of AP1 to STA1. 11 .

[0121] When AP1 uses the transmission weight W 11 When transmitting downlink data, the received signal y of STA1 11 =H 11 W 11 +n, the received signal y of STA2 21 =H 21 W 11 A suitable W needs to be designed. 11 Reaching y 21 The purpose of setting 0 is to ensure that the interference of AP1's transmission on STA2 is 0.

[0122] exist Figure 2 In the example, it is assumed that AP1 has 4 antennas, STA1 has 3 antennas, and STA2 has 3 antennas.

[0123] Then the interference channel H 21 It can be a 3×4 matrix, for H 21 Perform SVD decomposition, that is, Among them, U 21 It is a 3×3 matrix, D 21 It is a 4×4 matrix, but only its diagonals contain non-zero singular values ​​(a total of 3 non-zero singular values ​​and 1 zero singular value). It has 4 degrees of freedom in space, V. 21 It is a 4×4 matrix, V 21 The first three column vectors correspond to D 21 The three non-zero singular values ​​in the vector are represented by the last column vector, which corresponds to the zero singular value and is also called the null space vector.

[0124] Data Channel H 11 It is a 3×4 matrix, for H 21 Perform SVD decomposition, that is, Among them, U 11 It is a 3×3 matrix, D 11 It is a 4×4 matrix, but only the diagonal lines contain non-zero values ​​(there are 3 non-zero singular values ​​and one 0 singular value), V 11 It is a 4×4 matrix, V 11 The four column vectors are respectively connected to D 11 The four singular values ​​on the diagonal correspond to four degrees of freedom in space.

[0125] When AP1 sends data to STA1, if it only sends one stream to STA1, then AP1 can utilize V. 21 Sending one stream using a null space vector ensures that AP1 does not interfere with STA2. However, if AP1 sends two streams to STA2, due to V... 21 With only one zero-space vector, AP1 lacks sufficient spatial degrees of freedom, which in turn means that the interference of AP1 on STA2 cannot be completely eliminated.

[0126] Combination Figure 3 This document describes the C-BF measurement feedback process related to this application. For example... Figure 3 As shown, it may include the following steps:

[0127] Step 1: Beamformer (e.g.) Figure 2 AP1 and AP2 in the network can send NDPA frames.

[0128] For example, AP1 and AP2 may send NDPA frames simultaneously or sequentially, or only AP1 may send NDPA frames while AP2 does not send NDPA frames. This application does not limit this.

[0129] Step 2: Beamformer (e.g.) Figure 2 AP1 and AP2 in the application can send NDP frames. For example, AP1 and AP2 can send NDP frames simultaneously or sequentially, which is not limited in this application.

[0130] Beamforming devices (e.g.) Figure 2 STA1 and STA2 in the beamforming device can perform channel estimation based on the NDP frames transmitted by the beamforming device to obtain the data channel matrix and the interference channel matrix. Further processing of the data channel matrix and the interference channel matrix yields the beam weight matrix and the equivalent interference matrix / spatial zero-interference weight matrix.

[0131] Step 3: The beamforming device sends BFRP, triggering beamformee to execute CSI feedback.

[0132] Step 4: Beamformed by a beamforming device (e.g., Figure 2 STA1 and STA2 in the beamforming device (e.g., STA1 and STA2) are directed to the beamformer (e.g., Figure 2 The feedback beam weight matrix V of AP1 and AP2 in the matrix.

[0133] For example, STA1 can feed back V11 to AP1, and it can also feed back V12 to AP2.

[0134] For example, STA2 can send V22 back to AP2, and it can also send V21 back to AP1.

[0135] However, in related technologies, the feedback V matrix is ​​not smoothed, which leads to a downlink equivalent channel Heq... i =H i *V i The phase discontinuity in the frequency domain, that is, the disruption of the smooth transition relationship between different subcarriers, results in Heq performance issues on the STA side. i The inability to utilize the phase continuity of the channel for smoothing filtering during estimation reduces the channel estimation performance of downlink beamforming, and also leads to a decrease in block error rate (BLER) or throughput performance.

[0136] In this embodiment of the application, U is considered to be fed back to AP. H *H, directly feeds back U to AP H *H also suffers from the aforementioned problems. Therefore, in this embodiment, a smoothed version of U can be obtained by smoothing the relative U matrix. smooth Matrix, then based on smooth U smooth*H provides feedback of channel information, which helps improve the channel estimation performance of downlink beamforming.

[0137] The technical solutions of this application are described in detail below through specific embodiments. The above-mentioned related technologies are optional solutions and can be combined with the technical solutions of the embodiments of this application in any way, all of which fall within the protection scope of the embodiments of this application.

[0138] Figure 4 This is a schematic interactive diagram of the channel feedback method 200 according to an embodiment of this application, such as... Figure 4 As shown, the method 200 includes at least the following:

[0139] S210, the first access point sends a first frame, the first frame being used to indicate that the first station is feeding back compressed channel information, wherein the first station and the first access point are associated;

[0140] Correspondingly, the first station receives the first frame sent by the first access point.

[0141] S220, the first access point sends a second frame, the second frame is used by the first site to perform channel estimation to obtain the first data channel information;

[0142] Correspondingly, the first station receives the second frame sent by the first access point.

[0143] S230, the first station sends a third frame to the first access point, the third frame including compressed data channel information.

[0144] Correspondingly, the first access point receives the third frame sent by the first site.

[0145] In some embodiments, the compressed data channel information is obtained by compressing the first equivalent data channel information. For example, the first station may perform an m-th degree polynomial fitting process on the first equivalent data channel information to obtain the compressed data channel information, where m is a positive integer. Alternatively, the first station may also use other compression methods in existing standards to compress the first equivalent data channel information to obtain the compressed data channel information, which is not limited in this application.

[0146] In some embodiments, the first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix, wherein the first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix, and the first left singular vector matrix is ​​obtained by performing singular value decomposition on the first data channel information.

[0147] Therefore, in this embodiment of the application, the first station can perform channel estimation based on the second frame sent by the first access point to obtain the first data channel information. It can further perform singular value decomposition on the first data channel information to obtain the first left singular vector matrix, and then perform smoothing processing on the first left singular matrix to obtain the first smoothed left singular vector matrix. It can further determine the first equivalent data channel information based on the first smoothed left singular matrix and the first data channel information, and perform compression processing on the first equivalent data channel information to obtain compressed data channel information. Then, it feeds back the compressed data channel information to the first access point. Since the first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular matrix, the first equivalent data channel information determined based on the first smoothed left singular matrix and the first data channel information can be considered as smoothed data channel information. In other words, the phase of the first equivalent data channel information in the frequency domain is continuous, meaning that there are no discontinuous phase transitions in the first equivalent data channel information. Thus, when the first station compresses the first equivalent data channel information, it can ensure the compression performance of the channel, reduce the bandwidth requirement of the first station for channel feedback, and the first station can use the phase continuity of the channel for smoothing filtering when performing channel estimation, which is beneficial to improving the channel estimation performance.

[0148] It should be noted that the singular value decomposition in the embodiments of this application can also be replaced by other processing methods, such as orthogonal triangular decomposition (QR decomposition), and this application does not limit it.

[0149] In some embodiments of this application, the method 200 further includes:

[0150] The first station performs smoothing on the first left singular vector matrix to obtain the first smoothed left singular vector matrix.

[0151] For example, the first station can use a diagonal matrix to smooth the first left singular vector matrix to obtain the first smoothed left singular vector matrix. Alternatively, the first station can use other methods to smooth the first left singular matrix, which is not limited in this application.

[0152] In one specific embodiment, the first station multiplies the first left singular vector matrix by the diagonal matrix to obtain the first smoothed left singular vector matrix, wherein the elements of the last row of the first smoothed left singular vector matrix are non-zero real numbers. That is, the last row of the first left singular matrix is ​​made real using the diagonal matrix.

[0153] For example, the first smooth left singular vector matrix can be determined according to the following formula (1):

[0154]

[0155] Among them, U 11,smooth Let U represent the first smooth left singular vector matrix. 11 U represents the first left singular vector matrix. 11 (end,:) indicates

[0156] U 11 In the last line, ∠ indicates taking U. 11 The complex angle in radians of (end,:). This represents a diagonal matrix.

[0157] In some embodiments of this application, the method 200 further includes:

[0158] The first station determines the first equivalent data channel information based on the first data channel information and the first smoothed left singular vector matrix.

[0159] That is, the first station can use the first smoothed left singular vector matrix to smooth the first data channel information to obtain the first equivalent data channel information. The first equivalent data channel information can be regarded as the smoothed data channel information. Compressing the smoothed data channel information can ensure the compression performance of the channel, thereby ensuring the beamforming performance.

[0160] In some embodiments, the first station determines the first equivalent data channel information based on the first data channel information and the first smoothed left singular vector matrix, including:

[0161] The product of the conjugate transpose of the first smooth left singular vector matrix and the first data channel information is taken as the first equivalent data channel information; or

[0162] In the conjugate transpose of the first smooth left singular vector matrix, the vector with the largest singular value in the Z rows is taken to form the second smooth left singular vector matrix. The product of the second smooth left singular vector matrix and the first data channel information is taken as the first equivalent data channel information, where Z is a positive integer.

[0163] Optionally, the value of Z can be less than or equal to Nss. 11 Nss 11 Z is the number of downlink data streams sent from the first access point to the first site. As a specific example, Z = Nss 11 .

[0164] In one specific embodiment, the first station can determine the first equivalent data channel information according to the following formula (2):

[0165]

[0166] in, This represents the first equivalent data channel information. H represents the conjugate transpose of the first smooth left singular vector matrix. 11 This indicates the first data channel information.

[0167] In another specific embodiment, the first station can determine the first equivalent data channel information according to the following formula (3):

[0168]

[0169] in, This represents the first equivalent data channel information. H represents the second smooth left singular vector matrix. 11 This indicates the first data channel information.

[0170] Figure 5 This is a schematic interactive diagram of the channel feedback method 300 according to an embodiment of this application, such as... Figure 5 As shown, the method 300 includes at least the following:

[0171] S310, the second station receives a first frame sent by the first access point, the first frame being used to instruct the second station to feed back compressed channel information, wherein the second station and the second access point are associated;

[0172] S320, the second station receives the second frame sent by the first access point, the second frame is used by the second station to perform channel estimation to obtain the first interference channel information;

[0173] S330, the second station sends a fourth frame to the first access point, the fourth frame including compressed interference channel information.

[0174] In some embodiments, the compressed interference channel information is obtained by compressing the first equivalent interference channel information. For example, the second station can perform an nth-order polynomial fitting process on the first equivalent interference channel information to obtain the compressed interference channel information, where n is a positive integer. Alternatively, the second station can also use other compression methods in existing standards to compress the first equivalent interference channel information to obtain the compressed interference channel information, which is not limited in this application.

[0175] In some embodiments, the first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0176] That is, in the embodiments of this application, the second station can perform channel estimation based on the second frame sent by the first access point to obtain the first interference channel information, and can also perform channel estimation based on the second frame sent by the second access point to obtain the second data channel information. Further, the second data channel information can be subjected to singular value decomposition to obtain the second left singular vector matrix, and then the second left singular matrix can be smoothed to obtain the third smoothed left singular vector matrix. Further, the first equivalent interference channel information can be determined based on the third smoothed left singular matrix and the first interference channel information, and the first equivalent interference channel information can be compressed to obtain the compressed interference channel information. Then, the compressed interference channel information is fed back.

[0177] Since the third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular matrix, the first equivalent interference channel information determined based on the third smoothed left singular matrix and the first interference channel information can be considered as smoothed interference channel information. In other words, the phase of the first equivalent interference channel information in the frequency domain is continuous, that is, there is no discontinuous phase jump in the first equivalent interference channel information. Thus, when the second station compresses the first equivalent interference channel information, it can avoid the problem of reduced compression ratio caused by phase jump, or ensure the compression ratio but cause certain performance loss.

[0178] In some embodiments, since the compressed interference channel information fed back by the second station is obtained by compressing the first equivalent interference channel information, the first access point can recover the first equivalent interference information using the compressed interference channel information. Furthermore, singular value decomposition can be performed on the recovered first equivalent channel information to obtain the null space weight matrix associated with the first access point and the second station. Using this null space weight matrix for downlink data transmission can ensure that the interference of the downlink data transmission of the first access point to the second station is 0.

[0179] In some embodiments of this application, the method 300 further includes:

[0180] The second station smooths the second left singular vector matrix to obtain the third smoothed left singular vector matrix.

[0181] For example, the second station can use a diagonal matrix to smooth the second left singular vector matrix to obtain the third smoothed left singular vector matrix.

[0182] In one specific embodiment, the second station multiplies the second left singular vector matrix by the diagonal matrix to obtain the third smoothed left singular vector matrix, wherein the elements of the last row of the third smoothed left singular vector matrix are non-zero real numbers. That is, the last row of the second left singular matrix is ​​made real using the diagonal matrix.

[0183] For example, the second station can determine the third smooth left singular vector moment according to the following formula (4):

[0184]

[0185] Among them, U 22,smppth U represents the third smooth left singular vector matrix. 22 Let U represent the second left singular vector matrix. 22 (end,:) represents U 22 In the last line, ∠ indicates taking U. 22 The complex angle in radians of (end,:). This represents a diagonal matrix.

[0186] In some embodiments of this application, the method 300 further includes:

[0187] The second station determines the first equivalent interference channel information based on the first interference channel information and the third smoothed left singular vector matrix.

[0188] That is, the second station can use the third smoothed left singular vector matrix to smooth the first interference channel information to obtain the first equivalent interference channel information. This first equivalent interference channel information can be regarded as the smoothed interference channel information. Compressing the smoothed data channel information can ensure the compression performance of the channel, thereby ensuring the beamforming performance.

[0189] In some embodiments, the second station determines the first equivalent interference channel information based on the first interference channel information and the third smoothed left singular vector matrix, including:

[0190] The product of the conjugate transpose of the third smooth left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information; or

[0191] In the conjugate transpose of the third smooth left singular vector matrix, the vector with the largest singular value in row C is taken to form the fourth smooth left singular vector matrix. The product of the fourth smooth left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information, where C is a positive integer.

[0192] In some embodiments, C is less than or equal to Nss 22 Nss 22 This is the number of downlink data streams sent from the second access point to the second site. As a concrete example, C equals Nss. 22 .

[0193] In one specific embodiment, the second station can determine the first equivalent interference channel information according to the following formula (5):

[0194]

[0195] in, This represents the first equivalent interference channel information. H represents the conjugate transpose of the third smooth left singular vector matrix. 21 This indicates the information of the first interference channel.

[0196] In another specific embodiment, the second station can determine the first equivalent interference channel information according to the following formula (6):

[0197]

[0198] in, This represents the first equivalent interference channel information. H represents the fourth smooth left singular vector matrix. 21 This indicates the information of the first interference channel.

[0199] In one specific embodiment, the first station can determine the second equivalent interference channel information according to the following formula (7):

[0200]

[0201] in, This represents the second equivalent interference smoothing channel information. H represents the fifth smooth left singular vector matrix. 12 This indicates the second interference channel information, which can be obtained by the first station performing channel estimation on the second frame sent by the second access point.

[0202] As mentioned earlier, when the total number of antennas at the first and second sites exceeds the number of transmitting antennas at the first access point, there is a problem of insufficient spatial degrees of freedom at the first access point. In this embodiment, to ensure the spatial degrees of freedom of the first access point, it is necessary to design the number of downlink data streams Nss sent from the first access point to the first site. 11 and first equivalent interference channel information The number of null space vectors in the first access point is less than the number of transmit antennas in the first access point; therefore, the first station can utilize... Nss in 11 The vector pair with the largest singular value H 11 After smoothing, the first equivalent data channel information is obtained, which the second station can then utilize. Nss in 22 The vector pair with the largest singular value H 21 Smoothing is performed to obtain the first equivalent interference channel information. In this way, the first access point can utilize the... Nss obtained by performing singular value decomposition 22 The zero-space vector is used as the beam weight matrix for the first access point to send downlink data to the first site, thereby ensuring that the interference of the first access point to the second site is zero.

[0203] Based on a similar principle, when the total number of antennas at the first and second stations exceeds the number of antennas at the second access point, there will be a problem of insufficient spatial degrees of freedom at the second access point. To ensure the spatial degrees of freedom of the second access point, it is necessary to design the number of downlink data streams Nss sent from the second access point to the second station. 11 Second equivalent interference channel information The number of null space vectors in the second access point is less than the number of transmit antennas in the second access point; therefore, the second station can utilize... Nss in 22 The vector pair with the largest singular value H 22 After smoothing, the second equivalent data channel information is obtained, which the first station can utilize. Nss in 22 The vector pair with the largest singular value H 12 Smoothing is performed to obtain the second equivalent interference channel information. In this way, the second access point can utilize the... Nss obtained by performing singular value decomposition 11 The zero-space vector is used as the beam weight matrix for the second access point to send downlink data to the second site, thereby ensuring that the interference of the second access point to the first site is zero.

[0204] For example, in Figure 2 In the example, STA2 can take The two singular value maximum row vector pairs H in 21 Perform equivalent processing, that is, so, There are two null space vectors, and STA2 will compress them. After feedback is sent to AP1, AP1 can recover... Then to Perform singular value decomposition, i.e. Then, take Veq. 21 The two null space vectors in the matrix are used as the beam weight matrix for AP1 to send downlink data to STA1. This ensures that the interference of AP1 to STA2 is zero, and the two streams sent by AP1 to STA1 will not interfere with STA2.

[0205] Figure 6 Based on or Perform channel feedback, compared to H-based eff21 or H eff11 Perform channel feedback (where, This is a comparison chart showing the impact of not smoothing the equivalent channel on the SINR of the STA side. Figure 6 It can be seen that using the smoothed equivalent channel for channel feedback results in a 7dB decrease in SINR compared to using the unprocessed equivalent channel for channel feedback, and most of the SINR performance loss occurs in the phase transition range.

[0206] Figure 7 This is a schematic interaction diagram of the channel feedback method 400 according to an embodiment of this application, such as... Figure 7 As shown, the method 400 includes at least the following:

[0207] S410, the first access point sends a first frame, the first frame being used to instruct the first station and the second station to send compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point;

[0208] S420, the first access point sends a second frame, the first frame is used by the first site to perform channel estimation to obtain first data channel information, and the first frame is used by the second site to perform channel estimation to obtain first interference channel information.

[0209] S430, the first access point receives the third frame sent by the first station and the fourth frame sent by the second station;

[0210] The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

[0211] The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0212] The specific implementation of compressed data channel information and compressed interference channel information is described in the relevant descriptions in method 200 and method 300, and will not be repeated here.

[0213] Since the compressed data channel information is obtained by compressing the first equivalent data channel information, and the compressed interference channel information is obtained by compressing the first equivalent interference channel information, compared with the beam weight V matrix fed back by the STA, the compressed data channel information and the compressed interference channel information carry richer channel information. That is, by using the channel feedback method provided in this application embodiment, the first access point can obtain richer channel information, which is beneficial for the first access point to optimize scheduling performance based on the rich channel information. For example, the first access point can design beam algorithms based on the rich channel information, such as power control or spatial zero-interference (Nulling) algorithm design, and determine the target beam weight matrix used by the first access point to send downlink data to the associated STA, which is beneficial to improving the demodulation performance of the site. Furthermore, since the site does not need to feed back the V matrix, the site does not need to compress the V matrix. In the existing standard, the V matrix is ​​compressed using phase compression, which requires singular value decomposition and Given transform, resulting in high algorithm complexity. Therefore, the channel feedback method provided in this application embodiment is beneficial to reducing the computational overhead of the site.

[0214] In some embodiments of this application, the method 400 further includes:

[0215] The first access point determines the target beam weight matrix used by the first access point to send downlink data to the first station based on the compressed data channel information and the compressed interference channel information.

[0216] Since the target beam weight matrix used by the first access point to send downlink data to the first site is determined by considering the data channel information between the first access point and the first site, as well as the interference information between the first access point and the second site, it is beneficial to reduce the interference of downlink data transmission between the first access point and the first site to the second site.

[0217] In some embodiments, the first access point determines the target beam weight matrix used by the first access point to transmit downlink data to the first site based on compressed data channel information and compressed interference channel information, including:

[0218] The first access point determines the recovered first equivalent interference channel information based on the compressed interference channel information;

[0219] The first access point performs singular value decomposition on the recovered first equivalent interference channel information to obtain the recovered first right singular vector matrix;

[0220] The first access point obtains X null space vectors from the conjugate transpose of the first right singular vector matrix as the first beam weight matrix, where X is a positive integer;

[0221] The first access point determines the recovered first equivalent data channel information based on the compressed data channel information;

[0222] The first access point determines the precoded equivalent data channel information based on the first beam weight matrix and the recovered first equivalent data channel information;

[0223] The first access point performs singular value decomposition on the precoded equivalent data channel information to obtain the precoded second right singular vector matrix;

[0224] The first access point obtains Y vectors from the conjugate transpose of the precoded second right singular vector matrix to form the target beam weight matrix, wherein the Y vectors are column vectors corresponding to the Y largest singular values ​​in the precoded singular value matrix, and the precoded singular value matrix is ​​obtained by performing singular value decomposition on the precoded equivalent data channel information.

[0225] In some embodiments, X can be a positive integer less than or equal to Nss1, where Nss1 represents the number of downlink data streams sent from the first access point to the first site.

[0226] In some embodiments, Y can be a positive integer less than or equal to Nss1, where Nss1 represents the number of downlink data streams sent from the first access point to the first site.

[0227] The following, combined with Figure 8 This application describes the behavior of the first station (STA1), the second station (STA2), and the first access point (AP1) in a channel feedback method provided in an embodiment of the present application. STA1 is associated with AP1, and STA2 is associated with AP2.

[0228] In some embodiments, the behavior on the STA1 side may include the following steps:

[0229] S51: STA1 calculates the first equivalent data channel information.

[0230] Specifically, S51 may include the following steps:

[0231] S51-1: STA1 performs channel estimation based on the NDP frame sent by AP1 to obtain the first data channel information, such as H. 11 .

[0232] S51-2: STA1 performs singular value decomposition on the first data channel information, i.e. Among them, U 11 This corresponds to the first left singular vector matrix mentioned earlier.

[0233] S51-3: STA1 smooths the first left singular vector matrix to obtain the first smoothed left singular matrix U. 11,smooth For example, the first smooth left singular matrix is ​​determined according to the above formula (1).

[0234] S51-4: STA1 is based on the first smooth left singular matrix U 11,smooth and the first data channel information H 11 Determine the first equivalent data channel information For example, the first equivalent data channel information can be determined according to formula (2) or formula (3) above.

[0235] S52: STA1 feeds back compressed data channel information to AP1.

[0236] Specifically, S52 may include the following steps:

[0237] S52-1: STA1 compresses the first equivalent data channel information, for example, by using an m-th degree polynomial fitting process to obtain compressed data channel information. This compressed data channel information (i.e., compressed data channel information) It can be the polynomial coefficient matrix obtained by performing m-th degree polynomial fitting on the first equivalent data channel information.

[0238] S52-2: STA1 sends a third frame to AP1, which includes compressed data channel information.

[0239] In some embodiments, the behavior on the STA2 side may include the following steps:

[0240] S61: STA2 calculates the second data channel information.

[0241] For example, STA2 performs channel estimation based on the NDP frames sent by AP2 to obtain the second data channel information between AP2 and STA2, such as H. 22 .

[0242] S62: STA2 calculates the first equivalent interference channel information.

[0243] Specifically, this may include the following steps:

[0244] S62-1: STA2 performs channel estimation based on the NDP frame sent by AP1 to obtain the first interference channel information between AP1 and STA2, such as H. 21 .

[0245] S62-2: STA2 performs singular value decomposition on the second data channel information, that is... Among them, U 22 This corresponds to the second left singular vector matrix mentioned earlier.

[0246] S62-3: STA2 on the second left singular matrix U 22 The third smoothed left singular matrix is ​​obtained by smoothing. For example, the third smooth left singular matrix is ​​determined according to the above formula (4).

[0247] S62-4: STA2 is based on the third smooth left singular matrix. and the first interference channel information H 21 Determine the first equivalent interference channel information For example, the first equivalent interference channel information can be determined according to formula (5) or formula (6) above.

[0248] S63: STA2 feeds back compressed interference channel information to AP.

[0249] Specifically, S63 may include the following steps:

[0250] S63-1: STA2 compresses the first equivalent interference channel information, for example, by using an nth-degree polynomial fitting process to obtain compressed interference channel information. This compressed interference channel information (i.e., compressed...) ) can be the polynomial coefficient matrix obtained by performing nth-order polynomial fitting on the first equivalent interference channel information.

[0251] S63-2: STA2 sends the fourth frame to AP1. The fourth frame includes compressed interference channel information.

[0252] In some embodiments, the behavior on the AP1 side may include the following steps:

[0253] S71: AP1 processes the compressed interference channel information in the received fourth frame.

[0254] Step 1 may include the following steps:

[0255] S71-1: AP1 determines the recovered first equivalent interference channel information from the compressed interference channel information received in the fourth frame.

[0256] S71-2: AP1 provides information on the recovered first equivalent interference channel. Perform singular value decomposition, i.e. in, This corresponds to the first right singular vector matrix mentioned earlier.

[0257] S71-3: AP1 in V eff21 X null space vectors are selected as the first beam weight matrix, denoted as PCorer11.

[0258] Optionally, X can be N. ss1 For example, N ss1 If the value is 2, then V can be taken. eff21 The last two columns form the first beam weight matrix. That is, PCoder 11 =V eff21 (:,end-1:end).

[0259] S72: AP1 processes the compressed data channel information in the received third frame to determine the recovered first equivalent data channel information.

[0260] S73: AP1 determines the target beam weight matrix.

[0261] Specifically, S73 may include the following steps:

[0262] S73-1: AP1 determines the precoded equivalent data channel information, denoted as HPreq, based on the first beam weight matrix and the recovered first equivalent data channel information. 11 .

[0263] Optionally, AP1 can be based on the formula Determine the equivalent data channel information for precoding.

[0264] S73-2: AP1 performs singular value decomposition on the precoded equivalent data channel information, i.e. in, DPreq represents the second right singular vector matrix of the pre-encoding. 11 This represents the singular value matrix of the pre-encoded matrix.

[0265] S73-3: In Verreq 11 Y vectors are selected to form the second beam weight matrix, denoted as VPreq. 11 (:,1:Nss 11 Y can be equal to N ss11 Optionally, the Y vectors can be DPreq. 11 The Y maximum singular values ​​in VPreq 11 The corresponding Y vectors in the matrix are then the target beam weight matrix.

[0266] The frame design in methods 200, 300 and 400 described below.

[0267] In some embodiments, the first frame may include first information, which may be configuration information for the first site to feed back channel information. For example, the first information may indicate the type of channel information fed back by the first site (e.g., whether it is the compressed channel information provided in the embodiments of this application or the beam weight matrix, etc.) and the specific configuration used to feed back the compressed channel information. This configuration may be considered as the configuration that the first access point expects the first site to use to compress the channel information.

[0268] In some embodiments, the first information includes at least one of the following:

[0269] The first indication is used to instruct the first station to feed back compressed channel information, such as compressed data channel information obtained by fitting an m-th degree polynomial.

[0270] The second indication is used to indicate the polynomial information used by the first station to compress the channel information, such as the polynomial degree m used to compress the first equivalent data channel information.

[0271] The third indication is used to indicate the size of the subcarrier group used by the first station to compress the channel information, such as the number L of subcarriers included in the subcarrier group used to compress the first equivalent data channel information.

[0272] In some embodiments, when the first information does not include the second indication, a preset polynomial information (e.g., default m) is used by default, or when the first information does not include the third indication, a default subcarrier packet size (e.g., default L) is used by default.

[0273] In some embodiments, the first frame includes a station information (STA info) field, and the first information may be carried in the station information field.

[0274] In some embodiments, the first frame may include, but is not limited to, an NDPA frame, and the second frame may include, but is not limited to, an NDP frame.

[0275] In some embodiments, the first frame may include third information, which may be configuration information for the second site to feed back channel information. For example, the third information may indicate the type of channel information fed back by the second site (e.g., whether it is the compressed channel information provided in the embodiments of this application or the beam weight matrix, etc.), and the specific configuration used to feed back the compressed channel information. This configuration may be considered as the configuration that the first access point expects the second site to use to compress the channel information, etc.

[0276] In some embodiments, the third information includes at least one of the following:

[0277] The seventh indication is used to indicate that the second station feeds back compressed channel information, such as compressed interference channel information obtained by fitting an nth-order polynomial.

[0278] The eighth indication is used to indicate the polynomial information used by the second station to compress the channel information, such as the polynomial degree n used to compress the first equivalent interference channel information.

[0279] The ninth indication is used to indicate the size of the subcarrier packets used to compress the channel information of the second station, for example, the number P of subcarriers included in the subcarrier packets used to compress the first equivalent interference channel information.

[0280] In some embodiments, when the third information does not include the eighth indication, a preset polynomial information (e.g., default n) is used by default, or when the first and third information do not include the ninth indication, a default subcarrier packet size (e.g., default P) is used by default.

[0281] In some embodiments, the first frame includes a station information (STA info) field, and the third information may be carried in the station information field.

[0282] Figure 9This is a schematic format diagram of a first frame provided in an embodiment of this application. The first frame may include at least one STA info field, wherein first information may be carried in the STA info field, used to indicate the configuration information used for the station feedback channel information corresponding to the STA info field.

[0283] Figure 10 This is a schematic format diagram of the STA info field in the first frame provided in an embodiment of this application, such as... Figure 10 As shown, the STA info field may include the following fields:

[0284] The fields include AID, Patial BW info, Reserved, Nc index, Feedback Type and Ng, Disambiguation, Codebook Size, and Reserved.

[0285] In some embodiments, the first indication or the seventh indication may be carried through the STA info field, for example, by utilizing existing or newly added fields in the STA info field, such as redefining existing fields in the STA info field to carry the first indication or the seventh indication. For example, it may be carried through the Feedback Type And Ng field in the STA info field, for example, by using a reserved value (e.g., 3) in the Feedback Type And Ng field to indicate the compressed channel information provided in the embodiments of this application.

[0286] Optionally, if the Feedback Type And Ng field indicates that the compressed channel information provided in the embodiments of this application is being fed back, the first station may further determine the first equivalent data channel information based on the first data channel information, and then perform m-th degree polynomial fitting processing on the first equivalent data channel information to obtain the compressed data channel information, and further feed back the compressed data channel information.

[0287] Optionally, if the Feedback Type And Ng field indicates that the compressed channel information provided in the embodiments of this application is being fed back, the second station may further determine the first equivalent interference channel information based on the first interference channel information, and then perform n-fold polynomial fitting processing on the first equivalent interference channel information to obtain the compressed interference channel information, and further feed back the compressed interference channel information.

[0288] In some embodiments, the second or eighth indication can be carried through the STA info field, for example, using existing or newly added fields in the STA info. For instance, the second or eighth indication can be carried through the first field (e.g., B20 and B28) in the STA info field. Specifically, different values ​​of the first field are used to indicate different m or n values. By way of example and not limitation, a value of 0 in the first field indicates performing a first-order polynomial fitting (i.e., m / n = 1), a value of 1 indicates performing a second-order polynomial fitting (i.e., m / n = 2), and a value of 2 indicates performing a third-order polynomial fitting (i.e., m / n = 3).

[0289] In some embodiments, the third or ninth indication can be carried through the STA info field, for example, by utilizing existing or newly added fields in the STA info field, such as redefining existing fields in the STA info field to carry the third or ninth indication. For instance, the third or ninth indication can be carried through reserved fields in the STA info field; for example, different values ​​of the reserved fields corresponding to B29-B31 can be used to indicate different subcarrier packet sizes. For example, if the minimum subcarrier packet size is 4, the target subcarrier packet size can be defined as equal to the value of the reserved field + 4. Alternatively, the subcarrier packet size can be indicated in exponential form; for example, if the minimum subcarrier packet size is 4, the target subcarrier packet size can be defined as 2. (2+i) , where i represents the value of the reserved field.

[0290] In some embodiments of this application, the first station may also indicate the relevant configuration of the feedback information to the first access point through the third frame. For example, the type of channel information fed back by the first station, the compression configuration used for the feedback channel information, such as whether linear compression or nonlinear compression is used to compress the channel information, the polynomial degree m used to compress the channel information, and the subcarrier group size L used to compress the channel information.

[0291] In some embodiments, the third frame further includes second information, which includes at least one of the following:

[0292] The fourth indication is used to indicate that the feedback of the third frame is compressed channel information, for example, compressed data channel information obtained by fitting an m-th degree polynomial.

[0293] The fifth indication is used to indicate the polynomial information used by the first station to compress the channel information, such as the polynomial degree m used to compress the first equivalent data channel information;

[0294] The sixth indication is used to indicate the size of the subcarrier group used by the first station to compress the channel information, such as the number L of subcarriers included in the subcarrier group used to compress the first equivalent data channel information.

[0295] The second information can be considered as the compression configuration actually used by the first site to generate the channel information in response. The second information and the first information can be the same or different; this application does not limit this. That is, the first site can generate compressed data channel information using the compression configuration indicated by the first access point, or it can generate compressed data channel information based on a compression configuration it determines itself.

[0296] Optionally, if the second information does not include the fifth indication, it means that the first station uses the polynomial information corresponding to the second indication to compress the first equivalent data channel information, or uses preset polynomial information (e.g., default m) to compress the first equivalent data channel information.

[0297] Optionally, if the second information does not include the sixth indication, it means that the first station uses the subcarrier group size corresponding to the third indication to compress the first equivalent data channel information, or uses a preset subcarrier group size (e.g., default L) to compress the first equivalent data channel information.

[0298] In some embodiments of this application, the second station may also indicate the relevant configuration of the feedback information to the first access point through the fourth frame. For example, the type of channel information fed back by the second station, the compression configuration used for the feedback channel information, such as whether to use linear compression or nonlinear compression of the channel information, the polynomial degree n used to compress the channel information, and the subcarrier group size P used to compress the channel information.

[0299] In some embodiments, the third frame further includes fourth information, which includes at least one of the following:

[0300] The tenth indication is used to indicate that the fourth frame feedback is compressed channel information, for example, compressed interference channel information obtained by nth-order polynomial fitting.

[0301] The eleventh instruction is used to indicate the polynomial information used by the second station to compress the channel information, such as the polynomial degree n used to compress the first equivalent interference channel information;

[0302] The twelfth instruction is used to indicate the size of the subcarrier packets used to compress the channel information of the second station, such as the number P of subcarriers included in the subcarrier packets used to compress the first equivalent interference channel information.

[0303] The fourth information can be considered as the compression configuration actually used by the second station to generate the feedback channel information. The fourth information and the third information can be the same or different; this application does not limit this. That is, the second station can generate compressed interference channel information using the compression configuration indicated by the first access point, or it can generate compressed interference channel information based on its own determined compression configuration.

[0304] Optionally, if the fourth information does not include the eleventh indication, it means that the second station uses the polynomial information corresponding to the fifth indication to compress the first equivalent interference channel information, or uses a preset polynomial information (e.g., default n) to compress the first equivalent interference channel information.

[0305] Optionally, if the fourth information does not include the twelfth indication, it means that the second station uses the subcarrier packet size corresponding to the sixth indication to compress the first equivalent interference channel information, or uses a preset subcarrier packet size (e.g., default P) to compress the first equivalent interference channel information.

[0306] In some embodiments, the third or fourth frame may be an action frame, such as a beamforming action frame or a BFR frame, etc., and this application does not limit it.

[0307] In some embodiments, the second information can be carried by existing or newly added fields in the third frame, for example, by redefining existing fields in the third frame to carry the second information.

[0308] In some embodiments, the fourth information can be carried by existing fields or newly added fields in the fourth frame, for example, by redefining existing fields in the fourth frame to carry the fourth information.

[0309] In some embodiments, the second information may be carried in a control field in the third frame. This control field may be, for example, a MIMO control field, or other control fields, which are not limited in this application.

[0310] In some embodiments, the fourth information may be carried in a control field in the fourth frame. This control field may be, for example, a MIMO control field, or other control fields, which are not limited in this application.

[0311] Figure 11 This illustration shows a schematic diagram of the format of a MIMO control field in a third or fourth frame according to an embodiment of this application. For example... Figure 11 As shown, the MIMO control field may include the following fields:

[0312] The following fields are used: Nc index field, Nr index field, Bandwidth (BW) field, Grouping field, Feedback Type field, Reserved field, Remaining FeedbackSegment field, First Feedback Segment field, PatialBW info field, Sounding Dialog Token Number, Codebook Information, and Reserved field.

[0313] In some embodiments, the fourth indication may be carried in the MIMO control field of the third frame, for example, in the second field of the MIMO control field. This second field may be an existing field in the MIMO control or a newly added field. Specifically, for example, the second field may be a feedback type field. Optionally, when the feedback type field is a first value, it indicates that the feedback in the fourth frame is the compressed data channel information provided in the embodiments of this application. Optionally, the first value may be a reserved value for the feedback type field, such as 3.

[0314] In some embodiments, the fifth indication may be carried in the MIMO control field of the third frame, for example, in the third field of the MIMO control field. This third field may be an existing field in the MIMO control field, or a newly added field. Specifically, the third field may include at least one of the following fields: a grouping field, codebook information, or a reserved field. Optionally, when the third field takes different values, it indicates whether the channel information is compressed in a linear or non-linear manner, or it indicates the degree of the polynomial used to compress the channel information, such as first-order, second-order, third-order, or more.

[0315] In some embodiments, the sixth indication can be carried in the MIMO control field of the third frame, for example, in the fourth field of the MIMO control field. This fourth field can be an existing field in the MIMO control field, or a newly added field; specifically, the fourth field can be a reserved field. Optionally, different values ​​of the fourth field represent different sizes of subcarrier packets used to compress the channel information. For example, if the minimum subcarrier packet size L is 4, then the target subcarrier packet size can be defined as equal to the value of the reserved field + 4. Alternatively, the subcarrier packet size L can be indicated in exponential form; for example, if the minimum subcarrier packet size L is 4, then the target subcarrier packet size can be defined as 2. (2+i) , where i represents the value of the reserved field.

[0316] In some embodiments, the tenth indication may be carried in the MIMO control field of the fourth frame, for example, in the fifth field of the MIMO control field. This fifth field may be an existing field in the MIMO control or a newly added field. Specifically, for example, the fifth field may be a feedback type field. Optionally, when the feedback type field has a second value, it indicates that the feedback in the fourth frame is the compressed channel information provided in the embodiments of this application. Optionally, the second value may be a reserved value for the feedback type field, such as 3.

[0317] In some embodiments, the eleventh indication may be carried in the MIMO control field of the fourth frame, for example, in the sixth field of the MIMO control field. This sixth field may be an existing field in the MIMO control field, or a newly added field. Specifically, the sixth field may include at least one of the following fields: a grouping field, codebook information, or a reserved field. Optionally, when the sixth field takes different values, it indicates whether the channel information is compressed in a linear or non-linear manner, or it indicates the degree of the polynomial used to compress the channel information, such as first-order, second-order, third-order, or more.

[0318] In some embodiments, the twelfth indication can be carried in the MIMO control field of the fourth frame, for example, in the seventh field of the MIMO control field. This seventh field can be an existing field in the MIMO control field, or a newly added field; specifically, the seventh field can be a reserved field. Optionally, different values ​​of the seventh field represent different sizes of subcarrier packets used to compress the channel information. For example, if the minimum subcarrier packet size is 4, the target subcarrier packet size can be defined as equal to the value of the reserved field + 4. Alternatively, the subcarrier packet size can be indicated in exponential form; for example, if the minimum subcarrier packet size is 4, the target subcarrier packet size can be defined as 2. (2+i) , where i represents the value of the reserved field.

[0319] The following describes the specific implementation of polynomial fitting processing of equivalent channel information provided in this application, with reference to specific embodiments. The following description uses m-th degree polynomial fitting processing of the first equivalent data channel information as an example. The implementation of n-th degree polynomial fitting processing of the first equivalent interference channel information is similar, and will not be repeated here for the sake of brevity.

[0320] In some scenarios, the frequency domain response of the channel and the subcarrier index can be considered to satisfy a certain functional relationship. For example, this functional relationship can be an m-th degree polynomial function. Therefore, the frequency domain response of the channel can be fitted to an m-th degree polynomial function of the subcarrier index. That is, the frequency domain response of the channel can be characterized by an m-th degree polynomial function of the subcarrier index. In this way, the station only needs to send the polynomial coefficient matrix of the m-th degree polynomial function to the access point, instead of sending the frequency domain response of the channel on each subcarrier. This reduces the amount of feedback from the station and also reduces the bandwidth requirement for uplink feedback.

[0321] Meanwhile, the site performs m-th degree polynomial fitting on the channel matrix and then feeds back the polynomial coefficient matrix to the access point. In this way, the site does not need to perform singular value decomposition on the channel matrix to obtain the beam weight V matrix, which can reduce the computing power requirements and power consumption of the site.

[0322] Furthermore, since the polynomial coefficient matrix is ​​obtained by fitting the channel matrix, it carries richer channel state information than the beam weight V matrix. That is, by using the uplink feedback method provided in this application, the access point can obtain richer channel state information, which is beneficial for the access point to optimize scheduling performance based on the rich channel state information. For example, the access point can design beaming algorithms based on the rich channel state information, such as power control or spatial nulling algorithm design, to improve the transmission performance based on C-BF.

[0323] In some embodiments, the frequency domain response of the channel may include, but is not limited to, the channel matrix obtained by the station performing channel estimation based on the downlink signal (e.g., the second frame) transmitted by the access point, for example, U H The H matrix is ​​a matrix where the U matrix is ​​the left singular value vector matrix obtained by performing singular value decomposition on the H matrix.

[0324] In some embodiments, the frequency domain response of the channel and the subcarrier index can be considered to satisfy a linear functional relationship, that is, a first-order polynomial can be used to fit the frequency domain response of the channel.

[0325] In some scenarios, such as those with weak frequency selectivity, specifically indoor scenarios, channels on one or more adjacent subcarriers can be considered correlated. Therefore, the frequency domain response of the channels on one or more adjacent subcarriers can be considered linear. Thus, the frequency domain response of the channels on one or more subcarriers can be fitted with a linear function, and the frequency domain response of the channels on one or more subcarriers can be regarded as a function of the subcarrier index.

[0326] Therefore, in some embodiments, the station can fit the frequency domain response of the channel in groups of L subcarriers, and the frequency domain response of the channel on these L subcarriers can be considered linear.

[0327] For example, when m=1, the frequency domain response of the channel on a subcarrier group can be approximated as H=ax+b, where H is the channel vector corresponding to the subcarrier group and x is the intra-group index of the subcarrier in a subcarrier group.

[0328] Optionally, the intra-group index of a subcarrier within a subcarrier group can be set from 1 to L (i.e., the intra-group index of the first subcarrier in the subcarrier group is 1, and the intra-group index of the last subcarrier is L). In this case, x = 1, 2, ..., L-1, L; or, the intra-group index of the subcarrier can be set symmetrically or approximately symmetrically, for example, when L is an odd number.

[0329] Or, when L is even, when L is even... Alternatively, other methods can be used to set the intra-group index of the subcarrier within the subcarrier group. This application does not impose any restrictions, as long as the understanding of the corresponding settings is consistent between the site and the access point.

[0330] The frequency domain response of a channel corresponding to a subcarrier group can be represented by two complex numbers a and b.

[0331] The following explains the principle of fitting the frequency domain response of a channel using linear fitting.

[0332] Due to the effects of multipath propagation, the response of indoor channels varies significantly across different frequencies. However, because channel delay is relatively small indoors, the coherence bandwidth is wide, and channels on one or more adjacent subcarriers are highly correlated. Therefore, the frequency domain response of the channel on one or more subcarriers can be considered linear. Figure 12 The image shows the frequency domain response of a channel in a simulated large office or open shopping mall scenario using the 802.11ac channel model. From... Figure 12 It can be seen that connecting the frequency domain responses of the channels on one or more adjacent subcarriers can be approximated as a straight line. Therefore, the frequency domain response of the channel can be regarded as a linear function of the subcarrier index.

[0333] In other scenarios, due to multipath propagation, different frequencies of WiFi signals will experience varying degrees of fading in indoor channels. This means that some frequencies may perform well in certain environments, while others may suffer severe attenuation. The bandwidth of the WiFi signal (e.g., 20MHz, 40MHz, 80MHz, or 160MHz) affects the frequency selectivity of the channel. Larger bandwidths may cause more pronounced frequency-selective fading in multipath environments.

[0334] For example, in scenarios with strong frequency selectivity, the linearity of the channel's frequency domain characteristics is poor. In this case, a quadratic polynomial or a higher-order polynomial can be used to fit the channel's frequency domain response.

[0335] For example, when m=2, the frequency domain response of the channel on a subcarrier packet can be approximated as H=ax. 2 +bx+c, where H is the channel matrix corresponding to the subcarrier group, and x is the intra-group index of the subcarrier in a subcarrier group. The setting method of x is described in the previous section and will not be repeated here.

[0336] In some embodiments of this application, the first equivalent data channel information includes N sc N equivalent data channel matrices sc This indicates the number of subcarriers occupied by the second frame. Each equivalent data channel matrix corresponds to one subcarrier, and the equivalent data channel matrix includes N. c ×N r1 N equivalent data channels r1 N represents the number of receiving antennas or data streams at the first site. c This represents the number of transmitting antennas at the first access point. Each equivalent data channel corresponds to one receiving antenna or a combination of a data stream and a transmitting antenna. The H mentioned in the foregoing embodiments... 11 It can be the equivalent data channel matrix corresponding to a subcarrier.

[0337] In some embodiments, the compressed data channel information may be a polynomial coefficient matrix obtained by performing an m-th degree polynomial fitting process on the first equivalent data channel information. This polynomial coefficient matrix can be derived from N... c ×N r1 The combination consists of a vector of polynomial coefficients corresponding to the K subcarrier groups under each combination, where K is a positive integer.

[0338] Optional, K = ceil(N) sc / L), ceil means rounding up, L is a positive integer, and L is the size of the subcarrier group.

[0339] For example, the polynomial coefficient matrix can include N c ×Nr1 There are ×K polynomial coefficient vectors, each of which can include m+1 coefficients of an m-th degree polynomial.

[0340] In some embodiments of this application, the method 200 further includes:

[0341] The first station performs m-th degree polynomial fitting on the first equivalent data channel information to obtain the compressed data channel information.

[0342] In some implementations, for each combination of the receiving antenna or data stream of the first site and the transmitting antenna of the first access point, L subcarriers are grouped into a subcarrier group. The first site can perform m-order polynomial fitting on the L equivalent data channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, wherein the compressed data channel information is composed of N c ×N r1 The vector consists of the polynomial coefficients of the K subcarrier groups under each combination, where L is a positive integer.

[0343] In this way, when the first station performs channel feedback, it only needs to feed back the polynomial coefficient matrix corresponding to the first equivalent data channel information, instead of feeding back the first equivalent data channel information. This reduces the amount of feedback from the first station and also reduces the bandwidth occupied by the uplink feedback from the first station.

[0344] In some embodiments, the subcarrier group is also called a subcarrier block, or a subcarrier segment, and L can be considered as the group size, block length, or segment length.

[0345] Specifically, each combination can correspond to an equivalent data channel vector, which can include N. sc There are L equivalent data channels, each corresponding to one subcarrier. For each combination, the first station can group L subcarriers into a subcarrier group, and then group the N subcarriers corresponding to that combination. sc The L equivalent data channels corresponding to the subcarrier group in the equivalent data channel vector are subjected to m-order polynomial fitting to obtain the polynomial coefficient vector corresponding to the subcarrier group (or, the polynomial coefficient vector corresponding to the L equivalent data channels), and finally N is obtained. c ×N r1 The polynomial coefficient vectors corresponding to the ×K subcarrier groups, and the polynomial coefficient matrix is ​​formed by the N c ×N r1 The vector consists of the polynomial coefficients of each of the ×K subcarrier groups.

[0346] In some embodiments, based on N scWhen performing m-th degree polynomial fitting on the equivalent data channel corresponding to each subcarrier, the equivalent data channel corresponding to the DC subcarrier (or, the zeroth subcarrier) can be skipped. In this case, when performing m-th degree polynomial fitting on the equivalent data channel within the subcarrier group corresponding to the DC subcarrier, the number of equivalent data channels used is less than L, and the intra-group index of the subcarrier used for m-th degree polynomial fitting within the subcarrier group may be discontinuous.

[0347] In some embodiments, the first station performs m-order polynomial fitting on the L equivalent data channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, including:

[0348] The polynomial coefficient vector corresponding to the subcarrier group is obtained by performing m-order polynomial fitting on the L equivalent data channels according to the following formula (8):

[0349]

[0350] Transforming formula (8) yields the polynomial coefficient vector corresponding to the subcarrier group, expressed as:

[0351]

[0352] Where A represents the equivalent matrix of a polynomial of degree m, F represents a vector consisting of L equivalent data channels corresponding to L subcarriers in a subcarrier group. 11 This represents the polynomial coefficient vector corresponding to the subcarrier group.

[0353] In some embodiments, the indices of the L subcarriers in a subcarrier group can be calculated to the power of m to the power of 0 to obtain m+1 vectors, and A can be composed of these m+1 vectors.

[0354] When L and m are fixed, and the setting method of the intra-group index of subcarriers within a subcarrier group is determined, A is a fixed value, then (A H A) -1 A H It is also a fixed value. That is, for the first site and the first access point, given that L and m are known and the group index setting method is known, A is a fixed value.

[0355] In some embodiments, the first station and the first access point can calculate A according to a preset algorithm. In this case, the first access point does not need to indicate to the first station the specific algorithm used to calculate A. Both the first station and the first access point can calculate A according to the preset algorithm, ensuring that the first station and the first access point have a consistent understanding of A. Optionally, the preset algorithm can be the calculation method shown in formulas (11)-(13) below.

[0356] In other embodiments, the first access point may also indicate to the first station the specific algorithm used to calculate A, such as the calculation method shown in formulas (11)-(13) below. Then the first station can calculate A based on the algorithm indicated by the first access point. Correspondingly, the first access point can also calculate A according to the algorithm, ensuring that the first station and the first access point have a consistent understanding of A.

[0357] Optionally, the first frame may carry a first algorithm indication, which indicates the algorithm used by the first site to calculate A. This algorithm can be understood as the algorithm that the first access point requests (or expects, or notifies) the first site to use to calculate A. Optionally, the first algorithm indication may be used to instruct the first site to calculate A according to formula (11), formula (12), or formula (13).

[0358] Optionally, the third frame may carry a second algorithm indicator to indicate the algorithm used by the first station to calculate A, that is, the algorithm actually used by the first station to calculate A. Optionally, the second algorithm indicator may be used to indicate that A used by the second station is calculated according to formula (11) or formula (12) or formula (13).

[0359] Optionally, a first mapping relationship can be pre-stored at the first site. In some implementations, this first mapping relationship may include L and m and their corresponding A and (A... H A) -1 A H The mapping relationship, for example, the calculation formula of A is determined according to L and m, as described in formulas (11)-(13) below, which determine (A) according to L and m. H A) -1 A H The calculation formula. In some other implementations, the first mapping relationship may include the A matrix corresponding to different L and m values ​​and (A... H A) -1 A H The results of the matrix, for example, the A matrix corresponding to different values ​​of L and m and (A H A) -1 A H A list of matrices, so that when calculating F... 11When using vectors, the first station can be directly determined from L and m (A H A) -1 A H Then directly based on Vector computation F 11 Vectors, without needing to calculate (A) H A) -1 A H This can reduce the computing power cost of the first site.

[0360] In some embodiments, the first access point can estimate the first equivalent data channel information based on the polynomial coefficient matrix and A matrix fed back by the first site.

[0361] For example, the first access point can be estimated using the following formula (10). vector:

[0362]

[0363] in, Let F represent the equivalent data channel vector corresponding to the estimated subcarrier group, A represent the equivalent matrix of the m-th degree polynomial, and F represent the equivalent data channel vector. 11 This represents the polynomial coefficient vector corresponding to the subcarrier group.

[0364] Optionally, a second mapping relationship can be pre-stored at the first access point. In some implementations, this second mapping relationship may include the mapping relationship between L and m and the corresponding A, for example, determining the calculation formula of A based on L and m, as shown in formulas (11)-(13) below. In another implementation, the second mapping relationship may include the results of the A matrix corresponding to different L and m values, for example, a list of A matrices corresponding to different L and m values, as shown in formulas (14)-(17) below. In this way, when calculating F... 11 When dealing with vectors, the first access point can directly obtain A from L and m, and then directly from the A matrix and F. 11 Vector estimation The vector can be used instead of calculating matrix A, which reduces the computational overhead of the first access point.

[0365] Optional, if N sc If N is divisible by L, then N can be calculated. sc / L F vectors corresponding to each subcarrier group, or, if N sc If dividing by L is not divisible, meaning the last subcarrier group has fewer than L subcarriers, then we can use N... sc The F vector corresponding to the last L subcarriers in a given set of subcarriers is calculated using the equivalent data channel vectors. In other words, the last subcarrier group can be considered to include N subcarriers. scThe last L subcarriers out of the total number of subcarriers.

[0366] In some embodiments, when L is an even number, the intra-group index corresponding to a subcarrier within a subcarrier group is set in the following manner: A can be expressed as the following formula (11):

[0367]

[0368] In this matrix, matrix A has L rows and m+1 columns.

[0369] In some embodiments, when L is an odd number, the intra-group index corresponding to a subcarrier within a subcarrier group is set in the following manner: A can be expressed as the following formula (12):

[0370]

[0371] In this matrix, matrix A has L rows and m+1 columns.

[0372] It should be noted that the calculation method of A given above is only an example. When the intra-group index corresponding to the subcarrier in a subcarrier group is set in other ways, A can also be calculated in other ways. This application does not limit this. For example, when the intra-group index corresponding to the subcarrier in a subcarrier group can be set from 1 to L, that is, x = 1, 2, ..., L-1, L, A can be calculated using the following formula (13):

[0373]

[0374] In this matrix, matrix A has L rows and m+1 columns.

[0375] Optionally, when L=5 and m=1, the intra-group indices of the 5 subcarriers within the subcarrier group are set as follows: x=-2,-1,0,1,2, and A can be expressed as the following formula (14):

[0376]

[0377] Optionally, when L=5 and m=1, the intra-group indices of the 5 subcarriers within the subcarrier group are set as follows: x=1,2,3,4,5, A can be expressed as the following formula (15):

[0378]

[0379] Optionally, when L=5 and m=2, the intra-group indices of the 5 subcarriers within the subcarrier group are set as follows: x=-2,-1,0,1,2, and A can be expressed as the following formula (16):

[0380]

[0381] Optionally, when L=5 and m=2, the intra-group indices of the 5 subcarriers within the subcarrier group are set as follows: x=1,2,3,4,5, A can be expressed as the following formula (17):

[0382]

[0383] In some embodiments of this application, the first equivalent interference channel information includes N sc N equivalent interference channel matrices sc This indicates the number of subcarriers occupied by the second frame. Each equivalent interference channel matrix corresponds to one subcarrier, and the equivalent interference channel matrix includes N. c ×N r2 There are N equivalent interference channels. r2 N represents the number of receiving antennas or data streams at the second station. c This represents the number of transmit antennas at the first access point, where each equivalent data channel corresponds to one receive antenna or a combination of a data stream and a transmit antenna. H in the aforementioned embodiments... 21 It can be the equivalent interference channel matrix corresponding to a subcarrier.

[0384] In some embodiments, the compressed interference channel information may be a polynomial coefficient matrix obtained by performing an nth-order polynomial fitting process on the first equivalent interference channel information. This polynomial coefficient matrix can be derived from N... c ×N r2 The combination consists of the polynomial coefficient vectors corresponding to the Q subcarrier groups under each combination.

[0385] Optional, Q = ceil(N) sc / P), ceil means rounding up, P is a positive integer, and P is the size of the subcarrier group.

[0386] For example, the polynomial coefficient matrix can include N c ×N r2 ×Q polynomial coefficient vectors, each polynomial coefficient vector may include n+1 coefficients of an nth degree polynomial.

[0387] In some embodiments of this application, the method 300 further includes:

[0388] The second station performs an nth-order polynomial fitting process on the first equivalent interference channel information to obtain the compressed interference channel information.

[0389] In some implementations, for each combination of the receiving antenna or data stream of the second site and the transmitting antenna of the first access point, P subcarriers are grouped into a subcarrier group. The second site performs n-order polynomial fitting on the P equivalent interference channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, wherein the compressed interference channel information is composed of N c ×N r2 The vector consists of polynomial coefficients corresponding to multiple subcarrier groups under each combination, where P is a positive integer.

[0390] In this way, when the second station performs channel feedback, it only needs to feed back the polynomial coefficient matrix corresponding to the first equivalent interference channel information, instead of feeding back the first equivalent interference channel information. This reduces the amount of feedback from the second station and also reduces the bandwidth occupied by the uplink feedback from the second station.

[0391] In some embodiments, the second station performs n-order polynomial fitting on the P equivalent interference channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, including:

[0392] The second station performs an nth-order polynomial fitting process on the P equivalent interference channels according to the following formula (18) to obtain the polynomial coefficient vector corresponding to the subcarrier group:

[0393]

[0394] Transforming formula (18) yields the polynomial coefficient vector corresponding to the subcarrier group, expressed as:

[0395]

[0396] Where B represents the equivalent matrix of an nth-degree polynomial, F represents a vector consisting of P equivalent interference channels corresponding to P subcarriers in a subcarrier group. 21 This represents the polynomial coefficient vector corresponding to the subcarrier group.

[0397] Optionally, m can be equal to n, L can be equal to P, and matrix A can be equal to matrix B.

[0398] In some embodiments, the indices of the P subcarriers within a subcarrier group can be calculated to the power of n up to the power of 0 to obtain n+1 vectors, and B can be composed of these n+1 vectors.

[0399] The design of B is similar to the design of A mentioned above, and will not be repeated here for the sake of simplicity.

[0400] In some embodiments, the first access point can estimate the first equivalent interference channel information based on the polynomial coefficient matrix and B matrix corresponding to the first equivalent interference channel information.

[0401] For example, the first access point can be estimated using the following formula (20). vector:

[0402]

[0403] in, Let F represent the estimated equivalent interference channel vector corresponding to the subcarrier group, B represent the equivalent matrix of the nth degree polynomial, and F represent the equivalent interference channel vector corresponding to the subcarrier group. 21 This represents the polynomial coefficient vector corresponding to the subcarrier group.

[0404] In some embodiments, a third mapping relationship may also be pre-stored on the second site. The implementation of the third mapping relationship is the same as that of the first mapping relationship, and will not be described in detail here for the sake of brevity.

[0405] In some embodiments, a fourth mapping relationship may also be pre-stored on the first access point. The implementation of the fourth mapping relationship is the same as that of the second mapping relationship, and will not be described in detail here for the sake of simplicity.

[0406] The following, in conjunction with embodiments, describes the specific implementation of the first access point estimating the first equivalent data channel information and the first equivalent interference channel information (i.e., the first channel state information) based on compressed data channel information and compressed interference information.

[0407] In some embodiments, the compressed data channel information may include a polynomial coefficient matrix obtained by performing an m-th degree polynomial fitting process on the first equivalent data channel information, wherein the polynomial coefficient matrix may include N c ×N r1 ×K polynomial coefficient vectors, each polynomial coefficient vector can include m+1 coefficients of an m-th degree polynomial, K = ceil(N sc If / L), then the first access point estimates the first equivalent data channel information based on the polynomial coefficient matrix.

[0408] For example, the first access point can traverse the N. c ×N r1 For each pair of combinations, based on the polynomial coefficient vector corresponding to each of the K subcarrier groups, the equivalent data channel vector corresponding to each subcarrier group is estimated, i.e. Wherein, the first equivalent data channel information can be derived from N c ×N r1 The K subcarrier groups in each combination form the equivalent data channel vectors.

[0409] In one specific embodiment, the first access point can estimate the equivalent data channel vector corresponding to each subcarrier group using the aforementioned formula (10).

[0410] In some embodiments, the compressed interference channel information may include a polynomial coefficient matrix obtained by performing an nth-order polynomial fitting process on the first equivalent interference channel information, wherein the polynomial coefficient matrix may include N c ×N r2 ×Q polynomial coefficient vectors, each polynomial coefficient vector can include n+1 coefficients of an nth-degree polynomial, Q = ceil(N sc If / P), then the first access point estimates the first equivalent interference channel information based on the polynomial coefficient matrix.

[0411] For example, the first access point can traverse the N. c ×N r2 For each pair of combinations, based on the polynomial coefficient vector corresponding to each of the Q subcarrier groups, the equivalent interference channel vector corresponding to each subcarrier group is estimated, i.e. Wherein, the first equivalent interference channel information can be derived from N c ×N r2 The equivalent interference channel vectors are composed of the Q subcarrier groups under each pair of combinations.

[0412] For example, the first access point can estimate the equivalent interference channel vector corresponding to each subcarrier group using the following formula (21):

[0413]

[0414] in, Let F represent the estimated equivalent interference channel vector corresponding to the subcarrier group, B represent the equivalent matrix of the nth degree polynomial, and F represent the equivalent interference channel vector corresponding to the subcarrier group. 21 This represents the polynomial coefficient vector corresponding to the subcarrier group.

[0415] In summary, in the embodiments of the application, the station can smooth the U matrix, and then use the smoothed U matrix to smooth the H matrix to obtain an equivalent H matrix. The equivalent H matrix is ​​then compressed. Since the equivalent H matrix is ​​obtained through smoothing, its phase in the frequency domain is continuous; that is, the equivalent H matrix does not have discontinuous phase transitions. Thus, when the station compresses the equivalent H matrix, it can ensure the compression performance of the channel, reduce the bandwidth requirements for channel feedback, and utilize the phase continuity of the channel for smoothing filtering during channel estimation, which is beneficial for improving channel estimation performance.

[0416] Furthermore, the site can perform m-th degree polynomial fitting on the equivalent H matrix to obtain compressed equivalent channel information. For example, the site only needs to send the polynomial coefficient matrix of the m-th degree polynomial function obtained by the fitting process to the access point. Compared with the feedback V matrix, this can reduce the amount of feedback from the site and reduce the bandwidth requirement of the site's uplink feedback.

[0417] Furthermore, since the polynomial coefficient matrix is ​​obtained by fitting the equivalent H matrix, it carries richer channel state information than the beam weight V matrix. That is, by using the uplink feedback method provided in this application, the access point can obtain richer channel state information, which is beneficial for the access point to optimize scheduling performance based on the rich channel state information. For example, the access point can design beaming algorithms based on the rich channel state information, such as power control or spatial nulling algorithm design, to improve the transmission performance based on C-BF.

[0418] Furthermore, the access point can determine the target beam weight matrix used for downlink transmission based on the equivalent data channel matrix and equivalent interference matrix fed back by the site, which is beneficial to enhancing downlink beamforming performance.

[0419] The above text combined Figures 4 to 12 The method embodiments of this application are described in detail below, in conjunction with... Figures 13 to 18 The present application describes the device embodiments in detail. It should be understood that the device embodiments correspond to the method embodiments, and similar descriptions can be referred to the method embodiments.

[0420] Figure 13 A schematic block diagram of a communication device 1000 according to an embodiment of this application is shown. The communication device 1000 may be a first station, or a component within the first station, such as a chip, circuit, or module.

[0421] like Figure 13 As shown, the communication device 1000 includes:

[0422] The receiving module 1010 is configured to receive a first frame sent by a first access point, wherein the first frame is used to instruct the first station to feed back compressed channel information, wherein the first station and the first access point are associated; and to receive a second frame sent by the first access point, wherein the second frame is used by the first station to perform channel estimation to obtain first data channel information.

[0423] The transmitting module 1020 is used to transmit a third frame to the first access point. The third frame includes compressed data channel information, wherein the compressed data channel information is obtained by compressing a first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing a first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

[0424] In some embodiments, the first frame includes first information, which includes at least one of the following:

[0425] The first indication is used to instruct the first station to return compressed channel information;

[0426] The second indication is used to indicate the polynomial information used in the compression channel information of the first station;

[0427] The third indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

[0428] In some embodiments, the third frame further includes second information, which includes at least one of the following:

[0429] The fourth indication is used to indicate that the feedback from the third frame is compressed channel information;

[0430] The fifth indication is used to indicate the polynomial information used in the compression channel information of the first station;

[0431] The sixth indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

[0432] In some embodiments, the third frame includes a multiple-input multiple-output (MIMO) control field, and the second information is carried in the MIMO control field.

[0433] In some embodiments, the MIMO control field includes a feedback type field, which carries the fourth indication.

[0434] In some embodiments, the communication device 1000 further includes:

[0435] The processing module is used to determine the first equivalent data channel information based on the first data channel information and the first smoothed left singular vector matrix.

[0436] In some embodiments, the processing module is further configured to:

[0437] The product of the conjugate transpose of the first smooth left singular vector matrix and the first data channel information is taken as the first equivalent data channel information; or

[0438] Take Nss from the conjugate transpose of the first smooth left singular vector matrix. 11 The vectors with the largest singular values ​​are used to form a second smoothed left singular vector matrix. The product of the second smoothed left singular vector matrix and the first data channel information is taken as the first equivalent data channel information, wherein Nss 11 It is the number of downlink data streams sent from the first access point to the first site.

[0439] In some embodiments, the processing module is further configured to: smooth the first left singular vector matrix using a diagonal matrix to obtain the first smoothed left singular vector matrix.

[0440] In some embodiments, the processing module is further configured to: perform m-th degree polynomial fitting processing on the first equivalent data channel information to obtain the compressed data channel information, where m is a positive integer.

[0441] In some embodiments, the first equivalent data channel information includes N sc N equivalent data channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent data channel matrix includes N. c ×N r1 N equivalent data channels r1 N represents the number of receiving antennas or data streams at the first site. c The processing module is further configured to: represent the number of transmitting antennas of the first access point;

[0442] For each combination of the receiving antenna or data stream of the first site and the transmitting antenna of the first access point, taking L subcarriers as a subcarrier group, perform m-order polynomial fitting on the L equivalent data channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, wherein the compressed data channel information is composed of N c ×N r1 The vector consists of polynomial coefficients corresponding to multiple subcarrier groups under each combination, where L is a positive integer.

[0443] In some embodiments, the polynomial coefficient vector corresponding to the subcarrier group is determined according to the following formula:

[0444]

[0445] Where A represents the equivalent matrix of a polynomial of degree m, F represents a vector consisting of L equivalent data channels corresponding to L subcarriers in a subcarrier group. 11 The vector represents the polynomial coefficients corresponding to the subcarrier group, wherein the m-th degree polynomial equivalent matrix A is composed of m+1 vectors obtained by raising the indices of the L subcarriers in the subcarrier group to the power of m to the power of 0.

[0446] Optionally, in some embodiments, the aforementioned transmitting or receiving module unit may be a communication interface or transceiver, or an input / output interface of a communication chip or system-on-a-chip. The aforementioned processing module may be one or more processors.

[0447] It should be understood that the apparatus 1000 according to the embodiments of this application may correspond to the first station in the method embodiments of this application, and the above and other operations and / or functions of each unit in the apparatus 600 are respectively for implementing Figures 4 to 12 The corresponding process of the first station in the method embodiment shown will not be described in detail here for the sake of simplicity.

[0448] Figure 14 This is a schematic block diagram of another communication device 1100 according to an embodiment of this application. The communication device 1100 can be a second station, or a component within the second station, such as a chip, circuit, or module. Figure 14 The communication device 1100 includes:

[0449] The receiving module 1110 is configured to receive a first frame sent by a first access point, wherein the first frame is used to instruct the second station to feed back compressed channel information, wherein the second station and the second access point are associated; and to receive a second frame sent by the first access point, wherein the second frame is used by the second station to perform channel estimation to obtain first interference channel information.

[0450] The transmitting module 1130 is used to transmit a fourth frame to the first access point. The fourth frame includes compressed interference channel information, wherein the compressed interference channel information is obtained by compressing a first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame transmitted by the second access point. n is a positive integer.

[0451] In some embodiments, the communication device 1100 further includes a processing module for smoothing the second left singular vector matrix using a diagonal matrix to obtain the third smoothed left singular vector matrix.

[0452] In some embodiments, the communication device 1100 further includes a processing module, configured to determine the first equivalent interference channel information based on the first interference channel information and the third smoothed left singular vector matrix.

[0453] In some embodiments, the processing module is further configured to:

[0454] The product of the conjugate transpose of the third smooth left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information; or

[0455] Take Nss in the conjugate transpose of the third smooth left singular vector matrix. 22 The vectors with the largest singular values ​​are used to form a fourth smoothed left singular vector matrix. The product of the fourth smoothed left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information, wherein Nss 22 It is the number of downlink data streams sent from the second access point to the second site.

[0456] In some embodiments, the processing module is further configured to:

[0457] The compressed interference channel information is obtained by performing an nth-order polynomial fitting process on the first equivalent interference channel information, where n is a positive integer.

[0458] In some embodiments, the first equivalent interference channel information includes N sc N equivalent interference channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent interference channel matrix includes N. c ×N r2 There are N equivalent interference channels. r2N represents the number of receiving antennas or data streams at the second station. c The processing module is further configured to: represent the number of transmitting antennas of the first access point;

[0459] For each combination of the receiving antenna or data stream of the second site and the transmitting antenna of the first access point, P subcarriers are grouped into one subcarrier group. An nth-order polynomial fitting process is performed on the P equivalent interference channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group. The compressed interference channel information is derived from N... c ×N r2 The vector consists of polynomial coefficients corresponding to multiple subcarrier groups under each combination, where P is a positive integer.

[0460] In some embodiments, the polynomial coefficient vector corresponding to the subcarrier group is determined according to the following formula:

[0461] Where B represents the equivalent matrix of an nth-degree polynomial, F represents a vector consisting of P equivalent interference channels corresponding to P subcarriers in a subcarrier group. 21 The vector represents the polynomial coefficients corresponding to the subcarrier group, wherein the equivalent matrix of the nth degree polynomial is composed of n+1 vectors obtained by raising the indices of the P subcarriers in the subcarrier group to the nth to the 0th power respectively.

[0462] Optionally, in some embodiments, the aforementioned transmitting or receiving module may be a communication interface or transceiver, or an input / output interface of a communication chip or system-on-a-chip. The aforementioned processing module may be one or more processors.

[0463] It should be understood that the apparatus 1100 according to the embodiments of this application may correspond to the second station in the method embodiments of this application, and the above and other operations and / or functions of each unit in the apparatus 1100 are respectively for implementing Figures 4 to 12 The corresponding process of the second station in the method embodiment shown will not be described in detail here for the sake of simplicity.

[0464] Figure 15 This is a schematic block diagram of another communication device 1200 according to an embodiment of this application. The communication device 1200 may be a first access point, or a component within the first access point, such as a chip, circuit, or module. Figure 15 The communication device 1200 includes:

[0465] The transmitting module 1210 is configured to transmit a first frame, wherein the first frame is used to instruct a first station and a second station to transmit compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point; and to transmit a second frame, wherein the first frame is used by the first station to perform channel estimation to obtain first data channel information and the second station to perform channel estimation to obtain first interference channel information.

[0466] The receiving module 1220 is used to receive the third frame sent by the first station and the fourth frame sent by the second station.

[0467] The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

[0468] The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

[0469] In some embodiments, the communication device 1200 further includes a processing module, configured to determine, based on the compressed data channel information and the compressed interference channel information, the target beam weight matrix used by the first access point to send downlink data to the first station.

[0470] In some embodiments, the processing module is further configured to:

[0471] The recovered first equivalent interference channel information is determined based on the compressed interference channel information;

[0472] Singular value decomposition is performed on the recovered first equivalent interference channel information to obtain the recovered first right singular vector matrix;

[0473] X null space vectors are obtained from the conjugate transpose of the first right singular vector matrix as the first beam weight matrix, where X is a positive integer;

[0474] The recovered first equivalent data channel information is determined based on the compressed data channel information;

[0475] Based on the first beam weight matrix and the recovered first equivalent data channel information, the precoded equivalent data channel information is determined;

[0476] Singular value decomposition is performed on the precoded equivalent data channel information to obtain the precoded second right singular vector matrix;

[0477] Y vectors are obtained from the conjugate transpose of the precoded second right singular vector matrix to form the second beam weight matrix. The Y vectors are column vectors corresponding to the Y largest singular values ​​in the precoded singular value matrix. The precoded singular value matrix is ​​obtained by performing singular value decomposition on the precoded equivalent data channel information.

[0478] The target beam weight matrix is ​​determined based on the second beam weight matrix and the first beam weight matrix.

[0479] In some embodiments, the first equivalent interference channel information includes N sc N equivalent interference channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent interference channel matrix includes N. c ×N r2 There are N equivalent interference channels. r2 N represents the number of receiving antennas or data streams at the second station. c This indicates the number of transmitting antennas at the first access point;

[0480] The compressed interference channel information is for the N sc The polynomial coefficient matrix is ​​obtained by performing n-degree polynomial fitting on an equivalent interference channel matrix. The polynomial coefficient matrix is ​​composed of N... c ×N r2 The combination consists of a polynomial coefficient vector corresponding to multiple subcarrier groups under each combination.

[0481] In some embodiments, the first equivalent data channel information includes N sc N equivalent data channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent data channel matrix includes N. c ×N r1 N equivalent data channels r1 N represents the number of receiving antennas or data streams at the first site. c This indicates the number of transmitting antennas at the first access point;

[0482] The compressed data channel information is for the N sc The polynomial coefficient matrix is ​​obtained by performing m-degree polynomial fitting on N equivalent data channel matrices. c ×N r1 The combination consists of a polynomial coefficient vector corresponding to multiple subcarrier groups under each combination.

[0483] Optionally, in some embodiments, the aforementioned transmitting or receiving module may be a communication interface or transceiver, or an input / output interface of a communication chip or system-on-a-chip. The aforementioned processing module may be one or more processors.

[0484] It should be understood that the apparatus 1200 according to the embodiments of this application may correspond to the first access point in the method embodiments of this application, and the above and other operations and / or functions of each unit in the apparatus 1200 are respectively for implementing Figures 4 to 12 The corresponding process of the first access point in the embodiment will not be described in detail here for the sake of simplicity.

[0485] Figure 16 This is a schematic structural diagram of a communication device 700 provided in an embodiment of this application. Figure 16 The communication device 700 shown includes a processor 710, which can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0486] Optionally, such as Figure 16 As shown, the communication device 700 may further include a memory 720. The processor 710 can call and run a computer program from the memory 720 to implement the methods in the embodiments of this application. For example, when the communication device 700 is a station, the processor 710 can call and run a computer program from the memory 720 to implement the various steps of the method embodiments executed by the station, achieving the same technical effect. When the communication device 700 is an access point, the processor 710 can call and run a computer program from the memory 720 to implement the various steps of the method embodiments executed by the access point, achieving the same technical effect.

[0487] Alternatively, the memory 720 may be a separate device independent of the processor 710, or it may be integrated into the processor 710.

[0488] Optionally, such as Figure 16 As shown, the communication device 700 may also include a transceiver 730, and the processor 710 may control the transceiver 730 to communicate with other devices. Specifically, it may send information or data to other devices or receive information or data sent by other devices.

[0489] Optionally, transceiver 730 may include a transmitter and a receiver. Transceiver 730 may further include antennas, and the number of antennas may be one or more.

[0490] Figure 17 This is a schematic structural diagram of the chip according to an embodiment of this application. Figure 17 The chip 800 shown includes a processor 810, which can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0491] Optionally, such as Figure 17 As shown, chip 800 may further include memory 820. Processor 810 can retrieve and run computer programs from memory 820 to implement the methods described in this embodiment.

[0492] Alternatively, the memory 820 may be a separate device independent of the processor 810, or it may be integrated into the processor 810.

[0493] Optionally, the chip 800 may also include an input interface 830. The processor 810 can control the input interface 830 to communicate with other devices or chips, for example, to acquire information or data sent by other devices or chips.

[0494] Optionally, the chip 800 may also include an output interface 840. The processor 810 can control the output interface 840 to communicate with other devices or chips, for example, to output information or data to other devices or chips.

[0495] Optionally, the chip can be applied to the access point in the embodiments of this application, and the chip can implement the corresponding processes implemented by the access point in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0496] Optionally, the chip can be applied to the site in the embodiments of this application, and the chip can implement the corresponding processes implemented by the site in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0497] It should be understood that the chip mentioned in the embodiments of this application may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.

[0498] Figure 18 This is a schematic block diagram of a communication system 900 provided in an embodiment of this application. Figure 18 As shown, the communication system 900 includes a site 910 and an access point 920.

[0499] The station 910 can be used to implement the corresponding functions implemented by the first station or the second station in the above method, and the access point 920 can be used to implement the corresponding functions implemented by the first access point in the above method. For the sake of brevity, these will not be elaborated here.

[0500] It should be understood that the processor in the embodiments of this application may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor described above can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied in the execution of a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0501] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced Synchronous DRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct Rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0502] It should be understood that the above-described memory is exemplary and not a limiting description. For example, the memory in the embodiments of this application may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct memory bus RAM (DR RAM), etc. That is to say, the memory in the embodiments of this application is intended to include, but is not limited to, these and any other suitable types of memory.

[0503] This application also provides a readable storage medium storing a computer program that, when executed by a processor, implements the various processes of the above method embodiments.

[0504] Optionally, the readable storage medium can be applied to the access point in the embodiments of this application, and the computer program causes the processor to execute the corresponding process implemented by the access point in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0505] Optionally, the readable storage medium can be applied to the site in the embodiments of this application, and the computer program causes the processor to execute the corresponding process implemented by the site in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0506] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the various processes of the above-described method embodiments.

[0507] Optionally, the computer program product can be applied to the access point in the embodiments of this application, and the computer program causes the processor to execute the corresponding process implemented by the access point in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0508] Optionally, the computer program product can be applied to the site in the embodiments of this application, and the computer program causes the processor to execute the corresponding process implemented by the site in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0509] This application also provides a computer program. When executed by a processor, this computer program implements the various processes of the above-described method embodiments.

[0510] Optionally, the computer program can be applied to the access point in the embodiments of this application. The computer program causes the processor to execute the corresponding process implemented by the access point in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0511] Optionally, the computer program can be applied to the site in the embodiments of this application. The computer program causes the processor to execute the corresponding process implemented by the site in the method embodiments of this application. To avoid repetition, it will not be described again here.

[0512] Those skilled in the art will recognize that the units and algorithm steps of the various examples 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 implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0513] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0514] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0515] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0516] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0517] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0518] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A channel feedback method, characterized in that, include: The first station receives a first frame sent by the first access point. The first frame is used to instruct the first station to return compressed channel information. The first station and the first access point are associated. The first station receives a second frame sent by the first access point. The second frame is used by the first station to perform channel estimation to obtain first data channel information. The first station sends a third frame to the first access point. The third frame includes compressed data channel information, wherein the compressed data channel information is obtained by compressing first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing a first left singular vector matrix. The first left singular vector matrix is ​​obtained by performing singular value decomposition on the first data channel information.

2. The method according to claim 1, characterized in that, The first frame includes first information, which includes at least one of the following: The first indication is used to instruct the first station to return compressed channel information; The second indication is used to indicate the polynomial information used in the compression channel information of the first station; The third indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

3. The method according to claim 1 or 2, characterized in that, The third frame also includes second information, which includes at least one of the following: The fourth indication is used to indicate that the feedback from the third frame is compressed channel information; The fifth indication is used to indicate the polynomial information used in the compression channel information of the first station; The sixth indication is used to indicate the size of the subcarrier packets used for compressing the channel information at the first station.

4. The method according to claim 3, characterized in that, The third frame includes a multiple-input multiple-output (MIMO) control field, and the second information is carried in the MIMO control field.

5. The method according to any one of claims 1-4, characterized in that, The method further includes: The product of the conjugate transpose of the first smooth left singular vector matrix and the first data channel information is taken as the first equivalent data channel information; or Take Nss from the conjugate transpose of the first smooth left singular vector matrix. 11 The vectors with the largest singular values ​​are used to form a second smoothed left singular vector matrix. The product of the second smoothed left singular vector matrix and the first data channel information is taken as the first equivalent data channel information, wherein Nss 11 It is the number of downlink data streams sent from the first access point to the first site.

6. The method according to any one of claims 1-5, characterized in that, The method further includes: The first station uses a diagonal matrix to smooth the first left singular vector matrix, resulting in the first smoothed left singular vector matrix.

7. The method according to any one of claims 1-6, characterized in that, The method further includes: The first station performs m-th degree polynomial fitting on the first equivalent data channel information to obtain the compressed data channel information, where m is a positive integer.

8. The method according to claim 7, characterized in that, The first equivalent data channel information includes N sc N equivalent data channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent data channel matrix includes N. c1 ×N r1 N equivalent data channels r1 N represents the number of receiving antennas or data streams at the first site. c1 This represents the number of transmit antennas at the first access point. The first station performs m-th degree polynomial fitting processing on the first equivalent data channel information to obtain the compressed data channel information, including: For each combination of the receiving antenna or data stream of the first site and the transmitting antenna of the first access point, taking L subcarriers as a subcarrier group, perform m-order polynomial fitting on the L equivalent data channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group, wherein the compressed data channel information is composed of N c1 ×N r1 The vector consists of polynomial coefficients corresponding to multiple subcarrier groups under each combination, where L is a positive integer.

9. The method according to claim 8, characterized in that, The polynomial coefficient vector corresponding to the subcarrier group is determined according to the following formula: Where A represents the equivalent matrix of a polynomial of degree m, F represents a vector consisting of L equivalent data channels corresponding to L subcarriers in a subcarrier group. 11 The vector represents the polynomial coefficients corresponding to the subcarrier group, wherein the m-th degree polynomial equivalent matrix A is composed of m+1 vectors obtained by raising the indices of the L subcarriers in the subcarrier group to the power of m to the power of 0.

10. A channel feedback method, characterized in that, include: The second station receives a first frame sent by the first access point. The first frame is used to instruct the second station to feed back compressed channel information. The second station and the second access point are associated. The second station receives a second frame sent by the first access point. The second frame is used by the second station to perform channel estimation to obtain first interference channel information. The second station sends a fourth frame to the first access point. The fourth frame includes compressed interference channel information, wherein the compressed interference channel information is obtained by compressing a first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

11. The method according to claim 10, characterized in that, The method further includes: The second station uses a diagonal matrix to smooth the second left singular vector matrix to obtain the third smoothed left singular vector matrix.

12. The method according to claim 10 or 11, characterized in that, The method further includes: The second station determines the first equivalent interference channel information based on the first interference channel information and the third smoothed left singular vector matrix.

13. The method according to claim 12, characterized in that, The second station determines the first equivalent interference channel information based on the first interference channel information and the third smoothed left singular vector matrix, including: The product of the conjugate transpose of the third smooth left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information; or Take Nss in the conjugate transpose of the third smooth left singular vector matrix. 22 The vectors with the largest singular values ​​are used to form a fourth smoothed left singular vector matrix. The product of the fourth smoothed left singular vector matrix and the first interference channel information is taken as the first equivalent interference channel information, wherein Nss 22 It is the number of downlink data streams sent from the second access point to the second site.

14. The method according to any one of claims 10-13, characterized in that, The method further includes: The second station performs an nth-order polynomial fitting process on the first equivalent interference channel information to obtain the compressed interference channel information, where n is a positive integer.

15. The method according to claim 14, characterized in that, The first equivalent interference channel information includes N sc N equivalent interference channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent interference channel matrix includes N. c1 ×N r2 There are N equivalent interference channels. r2 N represents the number of receiving antennas or data streams at the second station. c1 The number of transmitting antennas at the first access point is represented by the second station performing an nth-order polynomial fitting process on the first equivalent interference channel information to obtain the compressed interference channel information, including: For each combination of the receiving antenna or data stream of the second site and the transmitting antenna of the first access point, P subcarriers are grouped into one subcarrier group. An nth-order polynomial fitting process is performed on the P equivalent interference channels corresponding to the subcarrier group to obtain the polynomial coefficient vector corresponding to the subcarrier group. The compressed interference channel information is derived from N... c1 ×N r2 The vector consists of polynomial coefficients corresponding to multiple subcarrier groups under each combination, where P is a positive integer.

16. A channel feedback method, characterized in that, include: The first access point sends a first frame, which is used to instruct the first station and the second station to send compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point; The first access point sends a second frame. The first frame is used by the first site to perform channel estimation to obtain first data channel information, and the first frame is used by the second site to perform channel estimation to obtain first interference channel information. The first access point receives the third frame sent by the first site and the fourth frame sent by the second site; The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information. The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

17. The method according to claim 16, characterized in that, The method further includes: The first access point determines the target beam weight matrix used by the first access point to send downlink data to the first station based on the compressed data channel information and the compressed interference channel information.

18. The method according to claim 17, characterized in that, The first access point determines the target beam weight matrix used by the first access point to transmit downlink data to the first station based on the compressed data channel information and the compressed interference channel information, including: The first access point determines the recovered first equivalent interference channel information based on the compressed interference channel information; The first access point performs singular value decomposition on the recovered first equivalent interference channel information to obtain the recovered first right singular vector matrix; The first access point obtains X null space vectors from the conjugate transpose of the first right singular vector matrix as the first beam weight matrix, where X is a positive integer; The first access point determines the recovered first equivalent data channel information based on the compressed data channel information; The first access point determines the precoded equivalent data channel information based on the first beam weight matrix and the recovered first equivalent data channel information; The first access point performs singular value decomposition on the precoded equivalent data channel information to obtain the precoded second right singular vector matrix; The first access point obtains Y vectors from the conjugate transpose of the precoded second right singular vector matrix to form a second beam weight matrix. The Y vectors are column vectors corresponding to the Y largest singular values ​​in the precoded singular value matrix. The precoded singular value matrix is ​​obtained by performing singular value decomposition on the precoded equivalent data channel information. The first access point determines the target beam weight matrix based on the second beam weight matrix and the first beam weight matrix.

19. The method according to any one of claims 16-18, characterized in that, The first equivalent interference channel information includes N sc N equivalent interference channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent interference channel matrix includes N. c1 ×N r2 There are N equivalent interference channels. r2 N represents the number of receiving antennas or data streams at the second station. c1 This indicates the number of transmitting antennas at the first access point; The compressed interference channel information is for the N sc The polynomial coefficient matrix is ​​obtained by performing n-degree polynomial fitting on an equivalent interference channel matrix. The polynomial coefficient matrix is ​​composed of N... c1 ×N r2 The combination consists of a vector of polynomial coefficients corresponding to multiple subcarrier groups under each combination; The first equivalent data channel information includes N sc N equivalent data channel matrices sc This indicates the number of subcarriers occupied by the second frame, and the equivalent data channel matrix includes N. c1 ×N r1 N equivalent data channels r1 N represents the number of receiving antennas or data streams at the first site. c1 This indicates the number of transmitting antennas at the first access point; The compressed data channel information is for the N sc The polynomial coefficient matrix is ​​obtained by performing m-degree polynomial fitting on N equivalent data channel matrices. c1 ×N r1 The combination consists of a polynomial coefficient vector corresponding to multiple subcarrier groups under each combination.

20. A communication device, characterized in that, The communication device is a first station, or is located in a first station, and the communication device includes: The receiving module is configured to receive a first frame sent by a first access point, the first frame being used to instruct the first station to feed back compressed channel information, wherein the first station and the first access point are associated; and to receive a second frame sent by the first access point, the second frame being used by the first station to perform channel estimation to obtain first data channel information. The transmitting module is configured to transmit a third frame to the first access point. The third frame includes compressed data channel information, wherein the compressed data channel information is obtained by compressing first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and a first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing a first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information.

21. A communication device, characterized in that, The communication device is a second station, or is located in a second station, and the communication device includes: The receiving module is configured to receive a first frame sent by a first access point, wherein the first frame is used to instruct the second station to feed back compressed channel information, wherein the second station and the second access point are associated; and to receive a second frame sent by the first access point, wherein the second frame is used by the second station to perform channel estimation to obtain first interference channel information. The transmitting module is configured to transmit a fourth frame to the first access point. The fourth frame includes compressed interference channel information, wherein the compressed interference channel information is obtained by compressing a first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and a third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing a second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame transmitted by the second access point.

22. A communication device, characterized in that, The communication device is a first access point, or is set in a first access point, the communication device comprising: The transmitting module is configured to transmit a first frame, which instructs a first station and a second station to transmit compressed channel information, wherein the first station is associated with the first access point and the second station is associated with the second access point; and to transmit a second frame, wherein the first frame is used by the first station to perform channel estimation to obtain first data channel information and the second station to perform channel estimation to obtain first interference channel information. The receiving module is used to receive the third frame sent by the first station and the fourth frame sent by the second station. The third frame includes compressed data channel information, which is obtained by compressing the first equivalent data channel information. The first equivalent data channel information is determined based on the first data channel information and the first smoothed left singular vector matrix. The first smoothed left singular vector matrix is ​​obtained by smoothing the first left singular vector matrix and is obtained by performing singular value decomposition on the first data channel information. The fourth frame includes compressed interference channel information, which is obtained by compressing the first equivalent interference channel information. The first equivalent interference channel information is determined based on the first interference channel information and the third smoothed left singular vector matrix. The third smoothed left singular vector matrix is ​​obtained by smoothing the second left singular vector matrix. The second left singular vector is obtained by performing singular value decomposition on the second data channel information. The second data channel information is obtained by the second station performing channel estimation on the second frame sent by the second access point.

23. A communication device, characterized in that, include: A processor and a memory for storing a computer program, the processor for calling and running the computer program stored in the memory to perform the method as claimed in any one of claims 1 to 9, or the method as claimed in any one of claims 10 to 15, or the method as claimed in any one of claims 16 to 19.

24. A chip, characterized in that, include: A processor for retrieving and running a computer program from memory, causing a device having the chip mounted to perform the method as claimed in any one of claims 1 to 9, or the method as claimed in any one of claims 10 to 15, or the method as claimed in any one of claims 16 to 19.

25. A readable storage medium, characterized in that, Used to store a computer program that causes a computer to perform the method as claimed in any one of claims 1 to 9, or the method as claimed in any one of claims 10 to 15, or the method as claimed in any one of claims 16 to 19.

Images