Uplink feedback method, device and equipment

Abstract

Provided are an uplink feedback method, apparatus and device, the method comprising: a station receiving a first frame sent by an access point, the first frame comprising first information, the first information being used for instructing the station to feed back compressed channel state information; the station receives a second frame sent by the access point, wherein the second frame is used for the station to perform channel estimation; and the station sends a third frame to the access point, the third frame comprising the compressed channel state information, the compressed channel state information being obtained by performing m times of polynomial fitting processing on the channel state information, the channel state information being obtained by performing channel estimation based on the second frame, m being a positive integer.

Description

Technical Field

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

[0002] In related technologies, the station 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 station can feed back the V matrix to the access point. However, the feedback overhead of the V matrix is ​​relatively large. Therefore, how to feed back channel information to reduce the feedback overhead of the station is an urgent problem to be solved. Summary of the Invention

[0003] This application provides an uplink feedback method, apparatus, and device that can reduce the feedback overhead of a site.

[0004] Firstly, an uplink feedback method is provided, including:

[0005] The station receives a first frame sent by the access point. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information.

[0006] The station receives a second frame sent by the access point, the second frame being used by the station to perform channel estimation;

[0007] The station sends a third frame to the access point. The third frame includes the compressed channel state information, which is obtained by performing an m-th degree polynomial fitting process on the channel state information. The channel state information is obtained by channel estimation based on the second frame, where m is a positive integer.

[0008] Secondly, an uplink feedback method is provided, including:

[0009] The access point sends a first frame to the station. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information.

[0010] The access point sends the second frame to the station, and the second frame is used by the station to perform channel estimation.

[0011] The access point receives a third frame sent by the station, wherein the third frame includes the compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information, and the channel state information is obtained by channel estimation based on the second frame, wherein m is a positive integer;

[0012] The channel state information is estimated based on the compressed channel state information.

[0013] In some implementations, a second mapping relationship is pre-stored on the access point, which includes a mapping relationship between different combinations of L and m and the corresponding values ​​of A.

[0014] Thirdly, a site is provided, including:

[0015] The receiving module is configured to receive a first frame sent by the access point, the first frame including first information, the first information being used to instruct the station to feed back compressed channel state information; and to receive a second frame sent by the access point, the second frame being used by the station to perform channel estimation.

[0016] The sending module is used to send a first frame to the access point. The first frame includes the compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information. The channel state information is obtained by channel estimation based on the second frame, where m is a positive integer.

[0017] Fourthly, an access point is provided, including:

[0018] The transmitting module is configured to transmit a first frame to the station, the first frame including first information, the first information being used to instruct the station to return compressed channel state information; and to transmit a second frame to the station, the second frame being used by the station to perform channel estimation.

[0019] A receiving module is used to receive a third frame sent by a station, wherein the third frame includes the compressed channel state information, the compressed channel state information is obtained by performing m-th degree polynomial fitting processing on the channel state information, and the channel state information is obtained by channel estimation based on the second frame, wherein m is a positive integer;

[0020] The processing module is used to estimate the channel state information based on the compressed channel state information.

[0021] Fifthly, a site is provided, including a processor and a memory. The memory is used to store computer programs, and the processor is used to invoke and run the computer programs stored in the memory, performing the methods described in the first aspect or its various implementations.

[0022] Sixthly, 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 in the second aspect or its implementations described above.

[0023] In a seventh aspect, a chip is provided 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 on which the chip is installed to perform the methods of any one of the first to second aspects or their respective implementations.

[0024] Eighthly, 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 second aspects or their respective implementations.

[0025] Ninthly, 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 second aspects or their respective implementations.

[0026] In a tenth 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 second aspects or their respective implementations.

[0027] Through the above technical solution, the access point can instruct the station to feed back compressed channel state information through the first frame. The station can perform channel estimation on the second frame sent by the access point to obtain channel state information. Furthermore, the station can perform m-th degree polynomial fitting processing on the channel state information to obtain compressed channel state information, and then send a third frame to the access point, which includes the compressed channel state information. This feedback method can reduce the amount of feedback from the station and reduce the bandwidth requirements for uplink feedback from the station. Attached Figure Description

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

[0029] Figure 2 This is a schematic diagram of the channel detection process in 802.11ac.

[0030] Figure 3 This is a schematic diagram of C-BF measurement feedback.

[0031] Figure 4 This is a frame interaction diagram of C-BF measurement feedback provided in an embodiment of this application.

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

[0033] Figure 6 This is a schematic format diagram of an NDPA frame provided in an embodiment of this application.

[0034] Figure 7 This is a schematic format diagram of the STA info field of an NDPA frame provided in an embodiment of this application.

[0035] Figure 8 This is a schematic diagram of the format of the MIMO control field in a third frame provided in an embodiment of this application.

[0036] Figure 9 This is a schematic frame interaction diagram of an uplink feedback method provided in an embodiment of this application.

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

[0038] Figure 11 This is a schematic flowchart of the uplink feedback method provided in the embodiments of this application.

[0039] Figure 12 yes Figure 11 A schematic diagram of the sub-process of step S33 in the process.

[0040] Figure 13 This is a schematic diagram of the frequency domain response of a channel on a subcarrier packet.

[0041] Figure 14 This is a schematic diagram of the frequency domain response of another channel on a subcarrier packet.

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

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

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

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

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

[0047] 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.

[0048] 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.

[0049] 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".

[0050] 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.

[0051] 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.

[0052] The embodiments of this application can be applied to WLAN systems, and can be applied 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 method provided in this application can be implemented by a communication device in a wireless communication system or a chip or processor within that device. Accordingly, the communication device supports IEEE...

[0053] Communication is conducted using the 802.11 series of protocols. While this application primarily uses 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 LANs (HIPERLANs) (a wireless standard similar to IEEE 802.11, primarily used in Europe), wide area networks (WANs), WLANs, personal area networks (PANs), 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.

[0054] 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).

[0055] Figure 1 A 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.

[0056] Access points can support communication or sensing based on WiFi protocols, such as those based on the 802.11b protocol.

[0057] 802.11a protocol, 802.11g protocol, 802.11n protocol, 802.11ac protocol, 802.11ax, 802.11be,

[0058] Communication or sensing is performed using the 802.11bn protocol or next-generation protocols or protocols after that.

[0059] The site can support communication or sensing based on WiFi protocols, for example, it can support protocols based on 802.11b.

[0060] 802.11a protocol, 802.11g protocol, 802.11n protocol, 802.11ac protocol, 802.11ax, 802.11be,

[0061] Communication or sensing is performed using the 802.11bn protocol or next-generation protocols or protocols after that.

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

[0063] 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.

[0064] 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.

[0065] 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).

[0066] 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.

[0067] 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.

[0068] 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.

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

[0070] 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.

[0071] 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.

[0072] Multi-AP cooperation includes the following cooperation 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).

[0073] C-BF (Channel-Based Signal Transmission) is a technology that uses channel state information to adjust antenna arrays, 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.

[0074] Taking the 802.11ac channel sounding process as an example, a channel sounding process is illustrated. Figure 2 As shown, the specific process includes the following steps:

[0075] Step 1: The AP sends a Null Data Packet Announcement (NDPA) frame to notify the target STA that it needs to perform channel sensing and the parameters required to perform channel sensing;

[0076] Step 2: The AP sends a null data packet (NDP) to the aforementioned destination STA;

[0077] Step 3: After the target STA identifies itself as a STA that needs to perform channel sounding through the NDPA frame and obtains the indicated channel sounding parameters, it performs channel estimation through the monitored NDPA and then feeds back the CSI between the target STA and the AP through the Beamforming Report (BFR).

[0078] It should be noted that in 802.11ac, the first destination STA to send a BFR to the AP by default is the first STA indicated by the site field in the NDPA frame mentioned above. For BFRs of other STAs, the AP needs to request them through the Beamforming Report Poll (BFRP) frame.

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

[0080] exist Figure 3 In the illustrated embodiment, the multi-AP cooperative set may include AP1 and AP2, where AP1 is the master AP or sharing AP, and AP2 is the slave AP or shared AP. STA1 is associated with AP1, and STA2 is associated with AP2. STA1 measures the NDP frames transmitted by AP1 to obtain the data channel matrix H11, and performs channel estimation on the NDP frames transmitted by AP2 to obtain the interference channel matrix H12. Then, the data channel matrix H11 and the interference channel matrix H12 are processed (e.g., singular value decomposition) to obtain the beam weight matrix V11 and the equivalent interference matrix / spatial zero interference weight matrix H. eq,12 Similarly, STA2 calculates the beam weight matrix V22 and the equivalent interference matrix / spatial zero interference weight matrix H based on the NDP transmitted by AP1 and AP2. eq,21 .

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

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

[0083] 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.

[0084] Step 2: Beamformer (e.g.) Figure 3 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.

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

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

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

[0088] Therefore, in C-BF feedback, the site needs to perform channel estimation on the NDP to obtain the H matrix, and then perform singular value decomposition on the H matrix to obtain the beam weight V matrix, and then feed the V matrix back to the access point. However, the feedback overhead of the V matrix is ​​relatively large. Therefore, how to feed back channel state information to reduce the feedback overhead of the site is an urgent problem to be solved.

[0089] 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.

[0090] Figure 5 This is a schematic diagram of the uplink feedback method 200 according to an embodiment of this application, as shown below. Figure 5 As shown, the method 200 includes at least the following:

[0091] S210, the access point sends a first frame, the first frame including first information, the first information being used to instruct the station to feed back compressed channel state information;

[0092] Correspondingly, the site receives the first frame sent by the access point;

[0093] S220, the access point sends the second frame; correspondingly, the station receives the second frame, and the station performs channel estimation based on the second frame to obtain channel state information;

[0094] S230, the station sends a third frame to the access point. The third frame includes compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information, where m is a positive integer.

[0095] Correspondingly, the access point receives the third frame and estimates the channel state information based on the compressed channel state information in the third frame.

[0096] For ease of distinction and explanation, the channel state information obtained by the station based on the second frame through channel estimation is denoted as the first channel state information, and the compressed channel state information is denoted as the second channel state information. That is, the second channel state information is obtained by the station performing m-th degree polynomial fitting processing on the first channel state information.

[0097] In some embodiments, the first frame may include first information, which may be configuration information for the station to feed back channel state information. For example, the first information may indicate the type of channel state information fed back by the station (e.g., whether it is the compressed channel state information provided in the embodiments of this application or the beam weight matrix, etc.), and the specific configuration used to feed back the channel state information.

[0098] In some embodiments, the first information may include a first indication for indicating the type of information status information fed back by the station, such as compressed channel status information.

[0099] In some embodiments, the first information may further include configuration information used by the access point to expect the site compression channel state information.

[0100] In some specific embodiments, the first information may further include at least one of the following:

[0101] The second indication is used to indicate the polynomial information used to compress the first channel state information, such as the polynomial degree m.

[0102] The third indication is used to indicate the size of the subcarrier group used to compress the first channel state information, for example, the number of subcarriers L included in a subcarrier group.

[0103] Optionally, the first information can be configured per site, that is, a corresponding compression configuration is configured for each site's feedback channel status information access point, or the same compression configuration is configured for all sites' feedback channel status information access points.

[0104] 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.

[0105] 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.

[0106] 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.

[0107] Figure 6 This is a schematic format diagram of an NDPA frame provided in an embodiment of this application. The NDPA 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 to feed back channel status information for the station corresponding to the STA info field.

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

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

[0110] In some embodiments, the first 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 first indication. For example, it can be carried through a reserved field in the STA info field, such as the reserved field corresponding to B20. Optionally, B20 can be used to indicate the type of channel state information requested by the access point from the site, such as whether it is a V matrix or compressed channel state information (i.e., a type of channel state information provided in the embodiments of this application). Optionally, a value of 0 for B20 indicates a V matrix feedback, and a value of 1 indicates compressed channel state information feedback.

[0111] Optionally, the station may, upon receiving the compressed channel state information from the B20 instruction feedback, perform an m-th degree polynomial fitting process on the first channel state information to obtain compressed channel state information, and then further feed back the compressed channel state information.

[0112] In some embodiments, the second 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 second indication. For example, the second indication can be carried through the Feedback Type And Ng field in the STA info field. Specifically, different values ​​of the Feedback Type And Ng field are used to indicate different values ​​of m. As an example and not a limitation, a value of 0 for the Feedback Type And Ng field indicates performing a first-order polynomial fitting process (i.e., m = 1), a value of 1 indicates performing a second-order polynomial fitting process (i.e., m = 2), and a value of 2 indicates performing a third-order polynomial fitting process (i.e., m = 3).

[0113] In some embodiments, the third 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 indication. For example, the third indication can be carried through reserved fields in the STA info field, for instance, by using different values ​​of the reserved fields corresponding to B29-B31 to indicate different subcarrier group sizes L.

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

[0115] In some embodiments, the third frame may include second information, which may include at least one of the following:

[0116] The fourth indication is used to indicate that the channel state information fed back in the first frame is compressed channel state information;

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

[0118] The sixth indication is used to indicate the size of the subcarrier packets used to compress the first channel state information, namely L.

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

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

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

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

[0123] 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.

[0124] 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.

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

[0126] 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.

[0127] In some embodiments, the fourth indication may be carried in the MIMO control field of the third frame, for example, in the first field of the MIMO control field. This first field may be an existing field in the MIMO control or a newly added field. Specifically, for example, the first 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 compressed channel state information. Optionally, the first value may be a reserved value for the feedback type field, such as 3.

[0128] In some embodiments, the fifth 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 field, or a newly added field. Specifically, the second field may include at least one of the following fields: a grouping field, codebook information, or a reserved field. Optionally, when the second field takes different values, it indicates that the channel state information is compressed in a linear or non-linear manner, or it indicates the degree of the polynomial used to compress the channel state information, such as first-order, second-order, third-order, or more.

[0129] In some embodiments, the sixth 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 be a reserved field. Optionally, different values ​​of the third field represent different sizes of subcarrier packets used to compress the channel state information.

[0130] The following, combined with Figure 9 The first frame is designated as the NDAP frame, and the second frame as the NDP frame. Figure 2 Taking the scenario shown as an example, the uplink feedback method provided in the embodiments of this application is described. For example, the method may include the following steps.

[0131] Step 1: The access point sends an NPDA frame;

[0132] For example, AP1 and AP2 can send NDPA frames simultaneously or sequentially, or only AP1 can send NDPA frames. Figure 9 This example only uses the simultaneous transmission of NDPA frames by AP1 and AP2 as an example, but this application is not limited to this.

[0133] In some embodiments, the NPDA frame may include first information, which may include at least one of the following:

[0134] The first indication is used to indicate that the station feeds back compressed channel state information;

[0135] The second indication is used to indicate the polynomial information used to compress the channel state information;

[0136] The third indication is used to indicate the size of the subcarrier packets used to compress the channel state information.

[0137] Step 2: The access point sends the NDP.

[0138] For example, AP1 and AP2 can send NDP frames simultaneously or sequentially, or only one AP can send NDPA frames that can cross the Overlapping Basic Service Set (OBSS). In this application... Figure 9 This example only illustrates sequential transmission, but the application is not limited to this.

[0139] Furthermore, the station performs channel estimation based on the NDP frame to obtain channel state information, such as the H matrix.

[0140] For example, STA1 can perform channel estimation on the NDP transmitted by AP1 to obtain the H11 matrix, and STA1 can perform channel estimation on the NDP transmitted by AP2 to obtain the H12 matrix.

[0141] For example, STA2 can perform channel estimation on the NDP transmitted by AP1 to obtain the H21 matrix, and STA2 can perform channel estimation on the NDP transmitted by AP2 to obtain the H22 matrix.

[0142] Furthermore, the station performs m-th degree polynomial fitting on the channel state information to obtain compressed channel state information.

[0143] For example, STA1 can perform an m-th degree polynomial fitting on the H11 matrix to obtain a compressed H11 matrix. STA1 can also perform an m-th degree polynomial fitting on the H12 matrix to obtain a compressed H12 matrix.

[0144] For example, STA2 can perform an m-th degree polynomial fitting on the estimated H22 matrix to obtain a compressed H22 matrix. STA2 can also perform an m-th degree polynomial fitting on the H21 matrix to obtain a compressed H21 matrix.

[0145] Step 3: The station sends a third frame to the access point, which includes compressed channel state information.

[0146] Optionally, the station may send a third frame to the access point based on the access point's BFRP frame, which carries compressed channel state information.

[0147] For example, STA1 can send a third frame to AP1, which carries a compressed H11 matrix; or, send a third frame to AP2, which carries a compressed H12 matrix.

[0148] For example, STA2 can send a third frame to AP2, which carries a compressed H22 matrix; or send a third frame to AP1, which carries a compressed H21 matrix.

[0149] In some embodiments, the third frame may also carry second information, such as at least one of the following:

[0150] The fourth indication is used to indicate that the feedback from the first frame is uncompressed channel state information;

[0151] The fifth indication is used to indicate the polynomial information used in the station's compressed channel state information, such as the polynomial degree m;

[0152] The sixth indicator is used to indicate the size of the subcarrier packets used for compressed channel state information, i.e., L.

[0153] In some embodiments, the first channel state information may include the CSI matrix obtained by the station performing channel estimation on the second frame, and the compressed channel state information (i.e. the second channel state information) may include the polynomial coefficient matrix obtained by performing m-th degree polynomial fitting on the CSI matrix.

[0154] The following describes, with reference to specific embodiments, the specific implementation of m-polynomial fitting processing of channel state information provided in the embodiments of this application.

[0155] 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.

[0156] Meanwhile, the site performs m-th degree polynomial fitting on the CSI matrix and further 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 CSI matrix to obtain the beam weight V matrix, which can reduce the computing power requirements and power consumption of the site.

[0157] Furthermore, since the polynomial coefficient matrix is ​​obtained by fitting the CSI 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.

[0158] In some embodiments, the frequency domain response of the channel may include, but is not limited to, the CSI matrix obtained by the site based on the downlink signal (e.g., the second frame) sent by the access point, such as the H matrix or the U*H matrix, where the U matrix is ​​the left singular value matrix obtained by performing singular value decomposition on the H matrix, and the beam weight V matrix is ​​the right singular value matrix obtained by performing singular value decomposition on the H matrix.

[0159] 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.

[0160] 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.

[0161] 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.

[0162] 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 CSI vector corresponding to the subcarrier group, and x is the intra-group index of the subcarrier in a subcarrier group.

[0163] 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. 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.

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

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

[0166] 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 10 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 10 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.

[0167] 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.

[0168] 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.

[0169] For example, when m=2, the frequency domain response of the channel on a subcarrier packet can be approximated as H=ax. 2 +bx+

[0170] c, where H is the CSI vector corresponding to the subcarrier group, and x is the intra-group index of the subcarrier in a subcarrier group. The setting method for x is described in the previous section and will not be repeated here.

[0171] In some embodiments of this application, the CSI matrix includes N1×N2 CSI vectors, wherein each CSI vector includes N scN1 represents the number of receive antennas or streams at the site, and N2 represents the number of transmit antennas at the access point. sc This indicates the number of subcarriers occupied by the downlink signal. Each CSI corresponds to one subcarrier, and one CSI vector corresponds to a pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas.

[0172] In this embodiment, N1 can also be represented by Nr, and N2 can also be represented by N. C express.

[0173] In some embodiments, the CSI matrix (i.e., the first channel state information) comprises N1×N2 CSI vectors, wherein each CSI vector comprises N sc N1 represents the number of receive antennas or streams at the site, and N2 represents the number of transmit antennas at the access point. sc This indicates the number of subcarriers occupied by the downlink signal. Each CSI corresponds to one subcarrier, and one CSI vector corresponds to a pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas.

[0174] In some embodiments, the polynomial coefficient matrix comprises polynomial coefficient vectors corresponding to K subcarrier groups for each pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas, where L is a positive integer, and K = ceil(N sc / L), ceil means round up.

[0175] For example, the polynomial coefficient matrix may include N1×N2×K polynomial coefficient vectors, and each polynomial coefficient vector may include m+1 coefficients of an m-th degree polynomial. In some embodiments of this application, the method further includes:

[0176] The site performs m-th degree polynomial fitting on the CSI matrix to obtain the polynomial coefficient matrix.

[0177] In this way, when the site makes uplink feedback, it only needs to feed back the polynomial coefficient matrix corresponding to the CSI matrix, instead of the CSI matrix itself. This reduces the amount of feedback required by the site and also reduces the bandwidth occupied by the site's uplink feedback.

[0178] The following describes the m-th degree polynomial fitting processing method provided in the embodiments of this application with reference to specific examples.

[0179] In some embodiments of this application, S220 may include:

[0180] Iterate through each pair of the N1 receiving antennas or streams and the N2 transmitting antennas, taking L subcarriers as a subcarrier group, and perform m-fold polynomial fitting on the L CSIs corresponding to the subcarrier group in the CSI vector corresponding to the combination to obtain the polynomial coefficient vector corresponding to the subcarrier group. The polynomial coefficient matrix is ​​composed of the polynomial coefficient vectors corresponding to multiple subcarrier groups under each of the N1×N2 combinations, where L is a positive integer.

[0181] Optionally, the polynomial coefficient matrix consists of polynomial coefficient vectors corresponding to the K subcarrier groups for each pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas, where K = ceil(N sc / L), ceil means round up.

[0182] 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.

[0183] Specifically, each combination can correspond to a CSI vector, which can include N sc There are 1 CSIs, each corresponding to a subcarrier. For each combination, the site can group the L subcarriers into a subcarrier group. The L CSIs corresponding to the subcarrier group in the CSI vector corresponding to the combination are subjected to m-fold polynomial fitting to obtain the polynomial coefficient vector corresponding to the subcarrier group (or the polynomial coefficient vector corresponding to the L CSIs). Finally, the polynomial coefficient vectors corresponding to the N1×N2×K subcarrier groups are obtained. The polynomial coefficient matrix is ​​composed of the polynomial coefficient vectors corresponding to the N1×N2×K subcarrier groups.

[0184] In some embodiments, based on N sc When performing m-th order polynomial fitting on the CSI corresponding to each subcarrier, the CSI corresponding to the DC subcarrier (or, the zeroth subcarrier) can be skipped. In this case, when performing m-th order polynomial fitting on the CSI within the subcarrier group corresponding to the DC subcarrier, the number of CSIs used is less than L, and the indices within the subcarrier group used for m-th order polynomial fitting may be discontinuous.

[0185] In some embodiments, performing m-order polynomial fitting on the L CSIs corresponding to the subcarrier group in the CSI vector corresponding to the combination to obtain the polynomial coefficient vector corresponding to the subcarrier group includes:

[0186] The polynomial coefficient vector corresponding to the subcarrier group is obtained by performing m-th degree polynomial fitting on the L CSIs according to the following formula (1):

[0187] H = A·F (Formula 1)

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

[0189] F = (A H A) -1 A H Formula (2)

[0190] Where A represents the equivalent matrix of the m-th degree polynomial, H represents the vector composed of the L CSIs corresponding to the L subcarriers in a subcarrier group, and F represents the polynomial coefficient vector corresponding to the subcarrier group.

[0191] 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.

[0192] 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 sites and access points, given that L, m, and the group index setting method are known, A is a fixed value.

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

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

[0195] Optionally, the first frame may carry a seventh indication to indicate the algorithm used by the site to calculate A. This algorithm can be understood as the algorithm that the access point requests (or expects, notifies) the site to use to calculate A. Optionally, the seventh indication may be used to instruct the site to calculate A according to formula (4), formula (5), or formula (6).

[0196] Optionally, the third frame may carry an eighth indicator to indicate the algorithm used by the station to calculate A, that is, the algorithm actually used by the station to calculate A. Optionally, the eighth indicator may be used to indicate that A used by the station is calculated according to formula (4), formula (5), or formula (6).

[0197] Optionally, the site can pre-store a first mapping relationship. 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 (4)-(6) 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 the F vector, the site can directly obtain (A) from L and m. H A) -1 A H Then directly based on (A) H A) -1 A H Calculate the F vector from the H vector, without needing to calculate (A) again. H A) -1 A H This can reduce the computing power consumption of the site.

[0198] The H vector can be obtained by the station through channel estimation. Then the station can calculate the F vector using formula (2). Furthermore, the station can feed back the F matrix composed of N1×N2×K F vectors to the access point. Correspondingly, the access point can estimate the H vector based on the F vector and A matrix in the F matrix, thereby obtaining the H matrix, i.e., the CSI matrix.

[0199] For example, the access point can estimate the H vector using the following formula (3):

[0200]

[0201] in, Let A represent the CSI vector corresponding to the estimated subcarrier group, A represent the equivalent matrix of the m-th degree polynomial, and F represent the polynomial coefficient vector corresponding to the subcarrier group.

[0202] Optionally, a second mapping relationship can be pre-stored at the access point. In some implementations, this second mapping relationship can include the mapping relationship between L and m and the corresponding A. For example, the calculation formula of A is determined based on L and m, as shown in formulas (4)-(6) below. In another implementation, the second mapping relationship can 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 (7)-(10) below. In this way, when calculating the F vector, the access point can directly obtain A based on L and m, and then directly estimate the H vector based on the A matrix and the F vector, without having to calculate the A matrix again, which can reduce the computing power overhead of the access point.

[0203] 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 CSI vectors of that last subcarrier group. In other words, the last subcarrier group can be considered to include N subcarriers. sc The last L subcarriers out of the total L subcarriers.

[0204] 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 (4):

[0205]

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

[0207] 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 (5):

[0208]

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

[0210] 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 (6):

[0211]

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

[0213] 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 (7):

[0214]

[0215] Optionally, when L=5 and m=1, the intra-group indexes 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 (8):

[0216]

[0217] 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 (9):

[0218]

[0219] Optionally, when L=5 and m=2, the intra-group indexes corresponding to 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 (10):

[0220]

[0221] The following, combined with Figure 11 The uplink feedback method provided in the embodiments of this application will be described.

[0222] Step S31: Obtain the CSI vector H(p,q,k=1:N) corresponding to a combination (p,q) of a receive antenna or a stream and transmit antenna in the CSI matrix. sc ), where p = 1, q = 1, and the block length L of the subcarrier block used for fitting the m-th order polynomial is selected.

[0223] Step S32: Determine A based on the block length L and m.

[0224] Step S33: Calculate the F vectors corresponding to the K subcarrier groups under the combination (p,q) according to A.

[0225] For example, according to the formula F = (A H A) -1 A H H calculates the F vector corresponding to each subcarrier group.

[0226] Step S34: Increment p by one.

[0227] Step S35: Determine whether p is less than N1.

[0228] If yes, return to step S33; otherwise, proceed to step S35.

[0229] Step S36: Increment q by one.

[0230] Step S37: Determine whether q is less than N2.

[0231] If yes, return to step S33; otherwise, proceed to step S38.

[0232] Step S38: Feed back the F matrix, which is composed of N1×N2×K F vectors, to the access point. This matrix is ​​the polynomial coefficient matrix.

[0233] The following, combined with Figure 7 right Figure 6 Step S33 will be explained in detail. For example, it may include the following steps:

[0234] Step S331: Set i = 1.

[0235] Step S332: Determine whether i is less than or equal to K, that is, whether the F vector corresponding to all K subcarrier groups under a combination has been calculated.

[0236] If not, the process ends; if yes, step S333 is executed.

[0237] Step S333: Determine whether i is equal to K.

[0238] If yes, proceed to step S3341; otherwise, proceed to step 35.

[0239] Step S3341: Calculate the remaining number of subcarriers Resi = N sc -i*L.

[0240] Step 3342: Determine whether the remaining number of subcarriers Resi is equal to 0.

[0241] If yes, proceed to step S335; otherwise, proceed to step S3343.

[0242] Step S3343: Obtain the H vector corresponding to the last subcarrier packet, denoted as H. L , where H L =H(p,q,N) sc -L+1:N sc )).

[0243] Step S335: Obtain the H vector corresponding to the next subcarrier packet, denoted as H. L , where H L =H(p,q,(i-1)*L+1:(i-1)*L+L)).

[0244] Step S336: Based on A and H L Calculate the F vector corresponding to the subcarrier group.

[0245] Step S337: Increment i by one, then return to step S332.

[0246] In some embodiments of this application, the access point can obtain second information from the third frame and determine the polynomial equivalent matrix A based on the second information. For example, the access point obtains the corresponding polynomial equivalent matrix A based on m indicated by the fifth indication and L indicated by the sixth indication obtained in the third frame, and further estimates the CSI matrix based on A and the polynomial coefficient matrix. For example, the corresponding A can be obtained based on m and L and the second mapping relationship pre-stored on the access point. In this way, the access point does not need to calculate the A matrix, which helps to reduce the computing power overhead of the access point.

[0247] The following describes, with reference to an embodiment, the specific implementation of the access point estimating the CSI matrix (i.e., the first channel state information) based on the polynomial coefficient matrix.

[0248] In some embodiments, the access point estimating the CSI matrix based on the polynomial coefficient matrix may include:

[0249] Iterate through each pair of the N1 receive antennas or streams and the N2 transmit antennas, and estimate the CSI vector corresponding to each subcarrier group based on the polynomial coefficient vector corresponding to each subcarrier group in the K subcarrier groups. The CSI matrix is ​​composed of the CSI vectors corresponding to the K subcarrier groups for each pair of the N1 receive antennas or streams and the N2 transmit antennas.

[0250] For example, the access point can estimate the CSI vector corresponding to each subcarrier group using the following formula:

[0251]

[0252] in, Let A represent the CSI vector corresponding to the estimated subcarrier group, A represent the equivalent matrix of the m-th degree polynomial, and F represent the polynomial coefficient vector corresponding to the subcarrier group.

[0253] Taking m=1 as an example, on an Orthogonal Frequency-Division Multiplexing (OFDM) symbol, such as on 56 subcarriers in a 20MHz bandwidth system, the frequency domain response of the channel can be regarded as a combination of multiple linear frequency responses. Therefore, after grouping the 56 subcarriers on an OFDM symbol, the frequency domain response of the channel on the subcarrier group can be approximated as a linear envelope. Figure 13 The diagram shows the frequency domain response of a channel with 5 subcarriers as a group. The frequency response of a 20MHz bandwidth channel can be approximated by the synthesis of the frequency responses of the channels with 11 subcarrier groups.

[0254] Taking a block length of 5 as an example, x = -2, -1, 0, 1, 2, the frequency domain response of the channel on a subcarrier packet (i.e., the CSI vector corresponding to a subcarrier packet) can be expressed as:

[0255]

[0256] Optionally, when a subcarrier group includes a DC subcarrier, the frequency domain response of the channel on the DC subcarrier can be skipped when fitting the frequency domain response of the channel on the subcarrier group.

[0257] Continuing from the previous example, if... Figure 13 As shown, if the subcarrier with index 1 within the group is a DC subcarrier, then the CSI corresponding to the subcarrier with index 1 within the group can be skipped. In this case, the frequency domain response of the channel on this subcarrier group (i.e., the CSI vector corresponding to a subcarrier group) can be expressed as:

[0258]

[0259] Taking a block length of 5 as an example, x = -2, -1, 0, 1, 2, the frequency domain response of the channel on a subcarrier packet (i.e., the CSI vector corresponding to a subcarrier packet) can be expressed as:

[0260]

[0261] Similarly, if a subcarrier group includes a DC subcarrier, the frequency domain response of the channel on the DC subcarrier can be skipped when fitting the frequency domain response of the channel on that subcarrier group, which will not be elaborated here.

[0262] The H matrix has been estimated at the site by channel estimation. The site can use the above linear relationship to calculate the linear fitting coefficients a and b, i.e. the F vector. For example, the F vector can be calculated according to the above formula (2).

[0263] When L and m are known, A is known and is a constant. H A) -1 A H It can also be calculated in advance, and it is a fixed value, so there is no need for real-time calculation.

[0264] Taking m=1 and L=5 as an example, (A H A) -1 A H It can be:

[0265]

[0266] Taking m=2 and L=5 as an example, (A H A) -1 A H It can be:

[0267]

[0268] For each CSI vector corresponding to a receive antenna or a combination of stream and transmit antennas in the CSI matrix, the site can calculate K F matrices, where K = ceil(N sc If / L), then the station can calculate N1×N2×K F vectors, which form a polynomial coefficient matrix.

[0269] Taking N1=4 and N2=2 as an example, the feedback amount and compression ratio of the uplink feedback method provided based on the embodiments of this application and the feedback method of beam weight V matrix in the existing standard are compared.

[0270] In related technologies, the feedback quantity of the V matrix on 5 subcarriers (i.e., one subcarrier group) is 50 numbers. For 8 combinations, each of the 5 subcarriers needs to feed back 2 numbers, so a total of 2*8*5=80 numbers need to be fed back. Therefore, when using the feedback method of the V matrix, the compression ratio is 50 / 80=0.625.

[0271] Based on the uplink feedback method provided in this application, when the block length L = 5, each subcarrier group can feed back 2 complex numbers, i.e., 4 numbers. For 8 combinations, a total of 4 * 8 = 32 numbers need to be fed back. If 2 complex numbers are fed back for each subcarrier, for 5 subcarriers, a total of 2 * 2 * 5 * 8 = 160 numbers need to be fed back. Therefore, when using a block length L = 5, the compression ratio of the uplink feedback method provided in this application is 32 / 160 = 0.2. Similarly, when using a block length L = 7, the compression ratio of the uplink feedback method provided in this application is (2 * 8 * 2) / (2 * 8 * 2 * 7) =

[0272] 0.1429. When using a block length L=9, the compression ratio using the uplink feedback method provided in this application is (2*8*2).

[0273] / (2*8*2*14)=0.0714.

[0274] As can be seen from the comparison, for the same number of subcarriers, compared with the feedback method of the V matrix, the uplink feedback method provided in this application embodiment can reduce the feedback amount by about 40% (1-32 / 50) and the compression ratio by 1 / 3 when L=5; reduce the feedback amount by about 55% (1-32 / 70) and the compression ratio by 1 / 4 when L=7; and reduce the feedback amount by about 65% (1-32 / 90) and the compression ratio by 1 / 8 when L=9.

[0275] Therefore, the uplink feedback method provided in this application embodiment significantly improves the uplink feedback compression ratio, reduces the uplink feedback amount, and lowers the uplink feedback bandwidth requirements. Furthermore, with the same compression ratio, the uplink feedback method provided in this application embodiment can feed back more channel state information, allowing the access point to obtain richer channel state information. This is beneficial for optimizing the access point's scheduling performance; for example, the access point can use this rich channel state information to design beamforming algorithms, such as power control or spatial zero-interference (Nulling) algorithms, improving C-BF-based transmission performance. Moreover, based on the uplink feedback method in this application embodiment, the site does not need to perform singular value decomposition on the H matrix; it only needs to perform matrix operations to obtain the F matrix, reducing the site's computing power requirements and power consumption.

[0276] The above text combined Figures 2 to 14 The method embodiments of this application are described in detail below, in conjunction with... Figures 15 to 19 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.

[0277] Figure 15 A schematic block diagram of a communication device 500 according to an embodiment of this application is shown. The communication device 500 can be a station, or it can be disposed within a station; for example, the communication device 500 can be a component within the station, such as a chip, circuit, or module.

[0278] like Figure 15 As shown, the communication device 500 includes:

[0279] The receiving module 510 is configured to receive a first frame sent by the access point, the first frame including first information, the first information being used to instruct the station to feed back compressed channel state information; and to receive a second frame sent by the access point, the second frame being used by the station to perform channel estimation.

[0280] The sending module 520 is used to send a third frame to the access point. The third frame includes the compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information. The channel state information is obtained by channel estimation based on the second frame, where m is a positive integer.

[0281] In some embodiments, the first information includes a first indication, which is used to indicate that the station feeds back compressed channel state information.

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

[0283] The second indication is used to indicate the polynomial information used to compress the channel state information;

[0284] The third indication is used to indicate the size of the subcarrier packets used to compress the channel state information.

[0285] In some embodiments, the third frame further includes second information, the second information including a fourth indication, the fourth indication being used to indicate that the third frame feeds back compressed channel state information.

[0286] In some embodiments, the second information further includes at least one of the following:

[0287] The fifth instruction is used to indicate the polynomial information used by the station to compress the channel state information;

[0288] The sixth indication is used to indicate the size of the subcarrier packets used by the site to compress the channel state information.

[0289] In some embodiments, the third frame includes a multiple-input multiple-output (MIMO) control field, and the fourth indication is carried in the MIMO control field; and / or, the fifth indication is carried in the MIMO control field; and / or

[0290] Alternatively, the sixth indication may be carried in the MIMO control field.

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

[0292] In some embodiments, the channel state information includes N1×N2 channel state information vectors, wherein each channel state information vector includes N sc N1 represents the number of receive antennas or streams of the site, and N2 represents the number of transmit antennas of the access point. sc This indicates the number of subcarriers occupied by the second frame. Each channel state information corresponds to one subcarrier, and one channel state information vector corresponds to a pair of combinations of the N1 receiving antennas or streams and the N2 transmitting antennas.

[0293] The compressed channel state information is a polynomial coefficient matrix obtained by performing m-order polynomial fitting on the N1×N2 channel state information vectors. This polynomial coefficient matrix comprises polynomial coefficient vectors corresponding to K subcarrier groups for each pair of combinations of the N1 receiving antennas or streams and the N2 transmitting antennas, where L is a positive integer, and K = ceil(N sc / L), ceil means round up.

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

[0295] F = (A H A) -1 A H ·H

[0296] Where A represents the m-th degree polynomial equivalent matrix, H represents the vector composed of channel state information corresponding to L subcarriers in a subcarrier group, and F represents the polynomial coefficient vector corresponding to the subcarrier group. The m-th degree polynomial equivalent matrix is ​​composed of m+1 vectors obtained by calculating the in-group indices corresponding to the L subcarriers in the subcarrier group from m to 0.

[0297] In some embodiments, L is an even number, and the m-degree polynomial equivalent matrix A is...

[0298]

[0299] Where L is an odd number, and the m-degree polynomial equivalent matrix A is

[0300]

[0301] Where A has L rows and m+1 columns.

[0302] In some embodiments, a first mapping relationship is pre-stored on the site, the first mapping relationship including different combinations of L and m and the corresponding values ​​of A and (A H A) -1 A H The mapping relationship.

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

[0304] It should be understood that the apparatus 500 according to the embodiments of this application may correspond to the station in the method embodiments of this application, and the above and other operations and / or functions of each unit in the apparatus 500 are respectively for implementing Figures 2 to 14 The corresponding processes of the sites described in the embodiments will not be elaborated here for the sake of brevity.

[0305] Figure 16 This is a schematic block diagram of another communication device 600 according to an embodiment of this application. The communication device 600 can be an access point, or it can be disposed within an access point, such as a component within the access point, like a chip, circuit, or module. Figure 15 The communication device 600 includes:

[0306] The transmitting module 610 is configured to transmit a first frame to the station, the first frame including first information, the first information being used to instruct the station to feed back compressed channel state information; and to transmit a second frame to the station, the second frame being used by the station to perform channel estimation.

[0307] The receiving module 620 is used to receive a third frame sent by the station, wherein the third frame includes the compressed channel state information, the compressed channel state information is obtained by performing m-th degree polynomial fitting processing on the channel state information, and the channel state information is obtained by channel estimation based on the second frame, wherein m is a positive integer;

[0308] The processing module is used to estimate the channel state information based on the compressed channel state information.

[0309] In some embodiments, the first information includes a first indication, which is used to indicate that the station feeds back compressed channel state information.

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

[0311] The second indication is used to indicate the polynomial information used to compress the channel state information;

[0312] The third indication is used to indicate the size of the subcarrier packets used to compress the channel state information.

[0313] In some embodiments, the third frame further includes second information, the second information including a fourth indication, the fourth indication being used to indicate that the third frame feeds back compressed channel state information.

[0314] In some embodiments, the second information further includes at least one of the following:

[0315] The fifth instruction is used to indicate the polynomial information used by the station to compress the channel state information;

[0316] The sixth indication is used to indicate the size of the subcarrier packets used by the site to compress the channel state information.

[0317] In some embodiments, the third frame includes a multiple-input multiple-output (MIMO) control field, and the fourth indication is carried in the MIMO control field; and / or, the fifth indication is carried in the MIMO control field; and / or

[0318] Alternatively, the sixth indication may be carried in the MIMO control field.

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

[0320] In some embodiments, the compressed channel state information is a polynomial coefficient matrix obtained by performing m-order polynomial fitting on the N1×N2 channel state information vectors. The polynomial coefficient matrix comprises polynomial coefficient vectors corresponding to K subcarrier groups for each pair of combinations of N1 receive antennas or streams and N2 transmit antennas, where L is a positive integer, and K = ceil(N sc / L), ceil means round up, where N1 represents the number of receiving antennas or streams of the site, and N2 represents the number of transmitting antennas of the access point;

[0321] The channel state information includes N1×N2 channel state information vectors, where each CSI vector includes N scN channel state information, wherein the N sc This indicates the number of subcarriers occupied by the second frame. Each channel state information corresponds to one subcarrier, and one channel state information vector corresponds to a pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas.

[0322] In some embodiments, the channel state information vector corresponding to each subcarrier group is determined according to the following formula:

[0323]

[0324] in, Let A represent the channel state information vector corresponding to the estimated subcarrier group, let F represent the equivalent matrix of the m-th degree polynomial, and let F represent the polynomial coefficient vector corresponding to the subcarrier group.

[0325] In some embodiments, a second mapping relationship is pre-stored on the access point, the second mapping relationship including a mapping relationship between different combinations of L and m and the corresponding values ​​of A.

[0326] Optionally, in some embodiments, the receiving module may be a communication interface or transceiver, or an input / output interface of a communication chip or system-on-a-chip.

[0327] It should be understood that the apparatus 600 according to the embodiments of this application may correspond to the access point 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 2 to 14 The corresponding process of the access point in the method embodiment shown will not be described in detail here for the sake of simplicity.

[0328] Figure 17 This is a schematic structural diagram of a communication device 700 provided in an embodiment of this application. Figure 17 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.

[0329] Optionally, such as Figure 17 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.

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

[0331] Optionally, such as Figure 17 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.

[0332] 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.

[0333] Figure 18 This is a schematic structural diagram of the chip according to an embodiment of this application. Figure 18 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.

[0334] Optionally, such as Figure 18 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.

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

[0336] 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.

[0337] 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.

[0338] 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.

[0339] 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.

[0340] 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.

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

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

[0343] 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.

[0344] 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.

[0345] 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.

[0346] 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.

[0347] 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.

[0348] 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.

[0349] 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.

[0350] 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.

[0351] 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.

[0352] 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.

[0353] 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.

[0354] 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.

[0355] 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.

[0356] 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.

[0357] 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.

[0358] 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.

[0359] 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.

[0360] 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.

[0361] 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. An uplink feedback method, characterized in that, include: The station receives a first frame sent by the access point. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information. The station receives a second frame sent by the access point, the second frame being used by the station to perform channel estimation; The station sends a third frame to the access point. The third frame includes the compressed channel state information, which is obtained by performing an m-th degree polynomial fitting process on the channel state information. The channel state information is obtained by channel estimation based on the second frame, where m is a positive integer.

2. The method according to claim 1, characterized in that, The first information includes a first indication, which is used to instruct the station to feed back compressed channel state information.

3. The method according to claim 2, characterized in that, The first information also includes at least one of the following: The second indication is used to indicate the polynomial information used to compress the channel state information; The third indication is used to indicate the size of the subcarrier packets used to compress the channel state information.

4. The method according to any one of claims 1-3, characterized in that, The third frame also includes second information, which includes a fourth indication, which indicates that the third frame feeds back compressed channel state information.

5. The method according to claim 4, characterized in that, The second information also includes at least one of the following: The fifth instruction is used to indicate the polynomial information used by the station to compress the channel state information; The sixth indication is used to indicate the size of the subcarrier packets used by the site to compress the channel state information.

6. The method according to claim 5, characterized in that, The third frame includes a multiple-input multiple-output (MIMO) control field, and the fourth indication is carried in the MIMO control field; and / or, the fifth indication is carried in the MIMO control field; And / or, the sixth indication is carried in the MIMO control field.

7. The method according to claim 6, characterized in that, The MIMO control field includes a feedback type field, which is used to carry the fourth instruction.

8. The method according to any one of claims 1-7, characterized in that, The channel state information includes N1×N2 channel state information vectors, where each channel state information vector includes N sc N1 represents the number of receive antennas or streams of the site, and N2 represents the number of transmit antennas of the access point. sc This indicates the number of subcarriers occupied by the second frame. Each channel state information corresponds to one subcarrier, and one channel state information vector corresponds to a pair of combinations of the N1 receiving antennas or streams and the N2 transmitting antennas. The compressed channel state information is a polynomial coefficient matrix obtained by performing m-order polynomial fitting on the N1×N2 channel state information vectors. This polynomial coefficient matrix comprises polynomial coefficient vectors corresponding to K subcarrier groups for each pair of combinations of the N1 receiving antennas or streams and the N2 transmitting antennas, where L is a positive integer, and K = ceil(N sc / L), ceil means round up.

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: F=(A H A) -1 A H ·H Where A represents the m-th degree polynomial equivalent matrix, H represents the vector composed of L channel state information corresponding to L subcarriers in a subcarrier group, and F represents the polynomial coefficient vector corresponding to the subcarrier group. The m-th degree polynomial equivalent matrix is ​​composed of m+1 vectors obtained by calculating the in-group indices corresponding to the L subcarriers in the subcarrier group from m to 0.

10. The method according to claim 9, characterized in that, Where L is an even number, and the m-th degree polynomial equivalent matrix A is: Where L is an odd number, and the m-degree polynomial equivalent matrix A is Where A has L rows and m+1 columns.

11. The method according to any one of claims 7-10, characterized in that, The site pre-stores a first mapping relationship, which includes different combinations of L and m and the corresponding values ​​of A, as well as (A... H A) -1 A H The mapping relationship.

12. An uplink feedback method, characterized in that, include: The access point sends a first frame to the station. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information. The access point sends a second frame to the station, the second frame being used by the station to perform channel estimation; The access point receives a third frame sent by the station, wherein the third frame includes the compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information, and the channel state information is obtained by channel estimation based on the second frame, wherein m is a positive integer; The channel state information is estimated based on the compressed channel state information.

13. The method according to claim 12, characterized in that, The first information includes a first indication, which is used to instruct the station to feed back compressed channel state information.

14. The method according to claim 13, characterized in that, The first information also includes at least one of the following: The second indication is used to indicate the polynomial information used to compress the channel state information; The third indication is used to indicate the size of the subcarrier packets used to compress the channel state information.

15. The method according to any one of claims 12-14, characterized in that, The third frame also includes second information, which includes a fourth indication, which indicates that the third frame feeds back compressed channel state information.

16. The method according to claim 15, characterized in that, The second information also includes at least one of the following: The fifth instruction is used to indicate the polynomial information used by the station to compress the channel state information; The sixth indication is used to indicate the size of the subcarrier packets used by the site to compress the channel state information.

17. The method according to claim 16, characterized in that, The third frame includes a multiple-input multiple-output (MIMO) control field, and the fourth indication is carried in the MIMO control field; and / or, the fifth indication is carried in the MIMO control field; And / or, the sixth indication is carried in the MIMO control field.

18. The method according to claim 17, characterized in that, The MIMO control field includes a feedback type field, which is used to carry the fourth instruction.

19. The method according to any one of claims 12-18, characterized in that, The compressed channel state information is a polynomial coefficient matrix obtained by performing m-order polynomial fitting on N1×N2 channel state information vectors. This polynomial coefficient matrix consists of polynomial coefficient vectors corresponding to K subcarrier groups for each pair of combinations of N1 receive antennas or streams and N2 transmit antennas, where L is a positive integer, and K = ceil(N sc / L), ceil means round up, where N1 represents the number of receiving antennas or streams of the site, and N2 represents the number of transmitting antennas of the access point; The channel state information includes N1×N2 channel state information vectors, where each CSI vector includes N sc N channel state information, wherein the N sc This indicates the number of subcarriers occupied by the second frame. Each channel state information corresponds to one subcarrier, and one channel state information vector corresponds to a pair of combinations of the N1 receive antennas or streams and the N2 transmit antennas.

20. The method according to claim 19, characterized in that, The channel state information vector corresponding to each subcarrier group is determined according to the following formula: in, Let A represent the channel state information vector corresponding to the estimated subcarrier group, let F represent the equivalent matrix of the m-th degree polynomial, and let F represent the polynomial coefficient vector corresponding to the subcarrier group.

21. A communication device, characterized in that, include: The receiving module is used to receive a first frame sent by the access point. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information. And receive a second frame sent by the access point, the second frame being used by the site to perform channel estimation; The sending module is used to send a first frame to the access point. The first frame includes the compressed channel state information, which is obtained by performing m-th degree polynomial fitting on the channel state information. The channel state information is obtained by channel estimation based on the second frame, where m is a positive integer.

22. A communication device, characterized in that, include: The sending module is used to send a first frame to the station. The first frame includes first information, which is used to instruct the station to feed back compressed channel state information. And send a second frame to the station, the second frame being used by the station to perform channel estimation; A receiving module is used to receive a third frame sent by a station, wherein the third frame includes the compressed channel state information, the compressed channel state information is obtained by performing m-th degree polynomial fitting processing on the channel state information, and the channel state information is obtained by channel estimation based on the second frame, wherein m is a positive integer; The processing module is used to estimate the channel state information based on the compressed channel state information.

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 11, or the method as claimed in any one of claims 12 to 20.

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 11, or the method as claimed in any one of claims 12 to 20.

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 11, or the method as claimed in any one of claims 12 to 20.

Images