Signal processing method and device

By using the Pn×n matrix in OFDM technology to process signals of multiple LTF symbols and set the sub-matrix to loop or Hankel matrix, the problem of insufficient estimation capability for channels greater than 8 in the prior art is solved, and the problem of insufficient estimation of channels greater than 8 is realized Efficient MIMO channel estimation and stream number adaptation.

CN118945018APending Publication Date: 2024-11-12HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411218273.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2020-12-11
Publication Date
2024-11-12

AI Technical Summary

Technical Problem

The existing OFDM technology is used in wireless local area networks for channel estimation, especially multi-input multiple output (MIMO) channel estimation, and there is a problem of insufficient channel estimation capability for greater than 8 streams, and the existing matrix structure is complex and has a high storage complexity. The space occupies a lot and is difficult to adapt to different stream demands.

Method used

Use Pn×n matrix to process signals on multiple long training field (LTF) symbols, and set it to a loop matrix or Hankel matrix through the sub-matrix S(n-1)×(n-1), and only the sub-matrix needs to be stored. The first row or column can restore the entire matrix, simplifying storage and computing complexity, and support MIMO channel estimation up to 16 or 32 streams.

Benefits of technology

The MIMO channel estimation capability for greater than 8 streams is realized, which reduces the redundancy of channel estimation, reduces the storage space and implementation complexity, and adapts to different stream count requirements.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118945018A_ABST
    Figure CN118945018A_ABST
Patent Text Reader

Abstract

Disclosed are a signal processing method and apparatus, the method comprising: a transmitting end device generating a PPDU, the PPDU comprising a preamble, the preamble comprising an LTF, the LTF comprising a plurality of LTF symbols, the plurality of LTF symbols being used for bearing a sequence obtained according to a first matrix; the PPDU is then transmitted. Correspondingly, the receiving end device receives the PPDU, and then processes the signals received from the plurality of LTF symbols according to the first matrix. The first matrix is a Pn * n matrix, or the first matrix is obtained according to the Pn * n matrix, the # imgabs0 # I is a unit matrix, the Pn * n matrix comprises n rows and n columns, the # imgabs1 # matrix is a transposed matrix of the Pn * n matrix, n is an integer greater than 8, and k is used for representing the kth subcarrier in each LTF symbol in the plurality of LTF symbols. According to the method provided by the invention, channel estimation of more than 8 spatial streams can be realized.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application. The application number of the original application is 2020114535553, and the original application date is December 11, 2020. The entire contents of the original application are incorporated into this application by reference. Technical Field

[0002] The present application relates to the field of communication technology, and in particular to a signal processing method and device. Background Art

[0003] In the wireless local area network (WLAN) standard based on OFDM technology, a physical (PHY) layer protocol data unit (PPDU) is defined. The PPDU may include a preamble, and the preamble may include a long training field (LTF). The LTF can be used to help the receiving end perform channel estimation, etc., so as to obtain the received data information.

[0004] However, how the receiving end performs channel estimation based on the LTF needs to be solved urgently. Summary of the invention

[0005] The present application provides a signal processing method and device. n×n The matrix can process signals received from multiple LTF symbols and more than 8 spatial streams.

[0006] In a first aspect, an embodiment of the present application provides a signal processing method, the method comprising: receiving a physical (PHY) layer protocol data unit (PHY protocol data unit, PPDU), the PPDU comprising a preamble, the preamble comprising a long training field (long training field, LTF), the LTF comprising a plurality of LTF symbols; according to a first matrix Processing the signals received from the plurality of LTF symbols, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, wherein n is an integer greater than 8, and k is used to represent the kth subcarrier in each LTF symbol in the multiple LTF symbols.

[0007] The method provided in the embodiment of the present application can be applied to a communication device, such as a receiving device, that is, a device for receiving PPDU.

[0008] The method provided in the embodiment of the present application can realize the channel estimation of more than 8 streams on the receiving end device. For example, the receiving end device can support MIMO channel estimation of up to 16 streams. n×n The matrix can also adapt to the needs of different numbers of streams, so that the receiving end device can not only realize MIMO channel estimation (or phase tracking, etc.) for 12 streams (or less than 12 streams), but also realize MIMO channel estimation for 16 streams (or less than 16 streams). n×n The matrix can also realize MIMO channel estimation for 4 or 8 streams, etc. For another example, the receiving end device can also support MiMO channel estimation for up to 32 streams (or 24 streams), etc., which is not limited in the embodiments of the present application.

[0009] Through a P n×n The matrix can realize MiMO channel estimation for multiple different numbers of streams and effectively reduce the redundancy of MIMO channel estimation. n×n The matrix can simultaneously process signals received from multiple LTF symbols and more than 8 spatial streams.

[0010] In a second aspect, an embodiment of the present application provides a signal processing method, the method comprising: generating a physical layer protocol data unit PPDU, the PPDU comprising a preamble, the preamble comprising a long training field LTF, the LTF comprising a plurality of LTF symbols, the plurality of LTF symbols being used to carry a first matrix The obtained sequence, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n A transposed matrix of a matrix, wherein n is an integer greater than 8, and k is used to represent the kth subcarrier in each LTF symbol in the multiple LTF symbols; and sending the PPDU.

[0011] In combination with the first aspect or the second aspect, in a possible implementation manner,

[0012] or

[0013] or

[0014] or

[0015]

[0016] Among them, the S (n-1)×(n-1) The matrix is ​​the P n×n The matrix is ​​a submatrix, and the S (n-1)×(n-1) The matrix includes n-1 rows and n-1 columns; a is a column vector including n-1 elements, and each element is 1, and a T is the transposed vector of a, and -a represents a vector obtained by negating all elements in a.

[0017] In the embodiment of the present application, it can not only ensure that the P n×n The matrix is ​​an orthogonal matrix, and effectively guarantees the submatrix S (n-1)×(n-1) is a circulant matrix or Hankel matrix, which not only reduces P n×n The space occupied by the matrix saves storage space and effectively reduces the implementation complexity of the communication device.

[0018] In combination with the first aspect or the second aspect, in a possible implementation manner, the S (n-1)×(n-1) The matrix is ​​either a circulant matrix or a Hankel matrix.

[0019] In the present application embodiment, by n×n Submatrix S of the matrix (n-1)×(n-1) Set as a circulant matrix or a Hankel matrix, the communication device only needs to store the submatrix S (n-1)×(n-1) The submatrix can be restored by the vector of the first row or the first column, which effectively saves the storage space of the communication device and reduces the implementation complexity.

[0020] In combination with the first aspect or the second aspect, in a possible implementation manner, the S (n-1)×(n-1) The first row of the matrix is ​​equal to the first vector x, x = [1 1 1 -1 1 -1 -1 -1 -1 -1]; or, the S (n-1)×(n-1) The first row of the matrix is ​​obtained by performing one or more of the three operations of cyclic shift, inversion, and overall inversion on the first vector x, where x=[11 1 -1 1 -1 -1 -1 -1 -1]; or, the S (n-1)×(n-1) The first row of the matrix is ​​equal to the second vector y, y = [11 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1]; or, the S (n-1)×(n-1)The first row of the matrix is ​​obtained by performing one or more of three operations of circular shift, inversion, and overall inversion on the second vector y, y=[1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1].

[0021] The communication device obtains P according to the first vector or the second vector n×n Submatrix S of the matrix (n-1)×(n-1) After the first line of S (n-1)×(n-1) Therefore, the communication device only needs to save the P n×n Submatrix S of the matrix (n-1)×(n-1) Alternatively, when the relationship between a row of the submatrix and the first vector or the second vector is determined, the communication device only needs to ensure that the first vector or the second vector can restore the submatrix, thereby reducing P n×n The space occupied by the matrix saves storage space and effectively reduces the implementation complexity of the communication device (for example, the P matrix can be restored by operations such as cyclic shift). n×n Submatrix S of the matrix (n-1)×(n-1) ).

[0022] In combination with the first aspect or the second aspect, in a possible implementation, when n=16,

[0023] or

[0024] or

[0025] or

[0026]

[0027] in.

[0028]

[0029] In the embodiment of the present application, by 8×8 The matrix is ​​expanded to generate P 16×16 The matrix not only ensures that the communication device supports the transmission of 16 streams of data, but also avoids excessive complex operations.

[0030] In combination with the first aspect or the second aspect, in a possible implementation manner, the first matrix The following conditions must be met:

[0031]

[0032] Among them, the R n×n The matrix includes n rows and n columns, and the Rn×n Each row of the matrix is ​​equal to the P n×n The first row in the matrix.

[0033] In combination with the first aspect or the second aspect, in a possible implementation manner, when the kth subcarrier is a non-pilot subcarrier, the first matrix is ​​equal to the P n×n The overall inverse matrix of the matrix; or, the first matrix is ​​equal to the P n×n The transposed matrix of the matrix; or, the first matrix is ​​equal to the P n×n The transposed matrix of the overall inverse matrix of the matrix; or, the first matrix is ​​equal to the P n×n The transpose of a matrix is ​​the global inverse of the matrix.

[0034] In combination with the first aspect or the second aspect, in a possible implementation manner, the R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation. n×n The matrix is ​​used for channel estimation.

[0035] In the present application, regarding P n×n Matrix, E n×n For a detailed description of the matrix or the first matrix, etc., please refer to the examples shown below, which will not be described in detail here.

[0036] In a third aspect, an embodiment of the present application provides a communication device for executing the method in the first aspect or any possible implementation of the first aspect. The communication device includes a corresponding unit for executing the method in the first aspect or any possible implementation of the first aspect.

[0037] Exemplarily, the communication device may be a transmitting end device or a chip in the transmitting end device, etc.

[0038] In a fourth aspect, an embodiment of the present application provides a communication device for executing the method in the second aspect or any possible implementation of the second aspect. The communication device includes a corresponding method for executing the method in the second aspect or any possible implementation of the second aspect.

[0039] Exemplarily, the communication device may be a receiving device or a chip in the receiving device.

[0040] In the third aspect or the fourth aspect, the communication device may include a transceiver unit and a processing unit. For a detailed description of the transceiver unit and the processing unit, reference may also be made to the device embodiment shown below.

[0041] In a fifth aspect, an embodiment of the present application provides a communication device, the communication device comprising a processor, configured to execute the method described in the first aspect or any possible implementation of the first aspect. Alternatively, the processor is configured to execute a program stored in a memory, and when the program is executed, the method described in the first aspect or any possible implementation of the first aspect is executed.

[0042] In the process of executing the above method, the process of receiving information (such as PPDU) in the above method can be understood as the process of receiving the input information by the processor. When the processor receives the input information, the transceiver receives the information and inputs it into the processor. Furthermore, after the transceiver receives the information, the information may need to be processed in other ways before being input into the processor.

[0043] Based on the above principle, for example, the receiving PPDU mentioned in the above method can be understood as the processor receiving the input PPDU.

[0044] For the transmission, sending and receiving operations involved in the processor, unless otherwise specified, or unless they conflict with their actual function or internal logic in the relevant description, they can be more generally understood as processor output, reception, input and other operations, rather than the transmission, sending and receiving operations performed directly by the RF circuit and antenna.

[0045] In the implementation process, the above-mentioned processor can be a processor specifically used to execute these methods, or it can be a processor that executes computer instructions in a memory to execute these methods, such as a general-purpose processor. The above-mentioned memory can be a non-transitory memory, such as a read-only memory (ROM), which can be integrated with the processor on the same chip, or can be respectively arranged on different chips. The embodiment of the present application does not limit the type of memory and the arrangement of the memory and the processor. It is understandable that the description of the processor and the memory is also applicable to the sixth aspect shown below, and the sixth aspect will not be described in detail for the convenience of repeating.

[0046] In a possible implementation manner, the memory is located outside the above communication device.

[0047] In a possible implementation manner, the memory is located within the above-mentioned communication device.

[0048] In the embodiment of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together. It is understandable that the memory in the embodiment of the present application may be used to store the first vector x, the second vector y, the third vector x' or the fourth vector y ' any one or more of the above.

[0049] In a possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive a signal or send a signal. Exemplarily, the transceiver can also be used to receive a PPDU, etc.

[0050] In the embodiment of the present application, the communication device may be a transmitting end device or a chip in the transmitting end device, etc.

[0051] In a sixth aspect, an embodiment of the present application provides a communication device, the communication device comprising a processor, configured to execute the method described in the second aspect or any possible implementation of the second aspect. Alternatively, the processor is configured to execute a program stored in a memory, and when the program is executed, the method described in the second aspect or any possible implementation of the second aspect is executed.

[0052] In a possible implementation manner, the memory is located outside the above communication device.

[0053] In a possible implementation manner, the memory is located within the above-mentioned communication device.

[0054] In the embodiment of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together. It is understandable that the memory in the embodiment of the present application may be used to store any one or more of the first vector x, the second vector y, the third vector x' or the fourth vector y'.

[0055] In a possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive a signal or send a signal. Exemplarily, the transceiver can be used to send a PPDU.

[0056] In the embodiment of the present application, the communication device may be a receiving device or a chip in the receiving device, etc.

[0057] In a seventh aspect, an embodiment of the present application provides a communication device, the communication device comprising a logic circuit and an interface, the logic circuit and the interface are coupled; the interface is used to input a PPDU; the logic circuit is used to receive a PPDU according to a first matrix Process the signal received over multiple LTF symbols.

[0058] Optionally, the communication device further includes a memory, and the memory is used to store any one or more of the first vector x, the second vector y, the third vector x' or the fourth vector y'.

[0059] It can be understood that about LTF symbols, the first matrix, P n×n Matrix, R n×nFor the description of matrices, etc., reference may be made to the description of the first aspect or the second aspect mentioned above; or, reference may also be made to the various embodiments shown below, which will not be described in detail here.

[0060] In an eighth aspect, an embodiment of the present application provides a communication device, which includes a logic circuit and an interface, wherein the logic circuit and the interface are coupled; the logic circuit is used to generate a PPDU; and the interface is used to output the PPDU.

[0061] It can be understood that about LTF symbols, the first matrix, P n×n Matrix, R n×n For the description of matrices, etc., reference may be made to the description of the first aspect or the second aspect mentioned above; or, reference may also be made to the various embodiments shown below, which will not be described in detail here.

[0062] In a ninth aspect, an embodiment of the present application provides a computer-readable storage medium, which is used to store a computer program. When the computer-readable storage medium is run on a computer, the method shown in the above-mentioned first aspect or any possible implementation of the first aspect is executed.

[0063] In the tenth aspect, an embodiment of the present application provides a computer-readable storage medium, which is used to store a computer program. When the computer-readable storage medium is run on a computer, the method shown in the above-mentioned second aspect or any possible implementation of the second aspect is executed.

[0064] In the eleventh aspect, an embodiment of the present application provides a computer program product, which includes a computer program or a computer code. When the computer program product is run on a computer, the method shown in the above-mentioned first aspect or any possible implementation of the first aspect is executed.

[0065] In a twelfth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or a computer code. When the computer program product runs on a computer, the method shown in the above-mentioned second aspect or any possible implementation of the second aspect is executed.

[0066] In a thirteenth aspect, an embodiment of the present application provides a computer program. When the computer program runs on a computer, the method shown in the above-mentioned first aspect or any possible implementation of the first aspect is executed.

[0067] In a fourteenth aspect, an embodiment of the present application provides a computer program. When the computer program runs on a computer, the method shown in the above-mentioned second aspect or any possible implementation of the second aspect is executed.

[0068] In the fifteenth aspect, an embodiment of the present application provides a wireless communication system, which includes a transmitting device and a receiving device, the transmitting device is used to execute the method shown in the above-mentioned first aspect or any possible implementation of the first aspect, and the receiving device is used to execute the method shown in the above-mentioned second aspect or any possible implementation of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] Figure 1 is a schematic diagram of a communication system provided in an embodiment of the present application;

[0070] Figure 2 It is a structural diagram of an access point (AP) device or a station (STA) device provided in an embodiment of the present application;

[0071] Figure 3a It is a structural diagram of a PPDU provided in an embodiment of the present application;

[0072] Figure 3b This is a schematic diagram of the relationship between a spatial stream and an LTF symbol provided in an embodiment of the present application;

[0073] Figure 4a is a flowchart of a signal processing method provided in an embodiment of the present application;

[0074] Figure 4b It is a schematic diagram of the structure of another PPDU provided in an embodiment of the present application;

[0075] Figures 5 to 7 It is a structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0076] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described below in conjunction with the accompanying drawings.

[0077] The terms "first" and "second" in the specification, claims and drawings of this application are only used to distinguish different objects, rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.

[0078] The "embodiment" mentioned in this article means that the specific features, structures or characteristics described in conjunction with the embodiment can be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It can be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0079] In the present application, "at least one (item)" means one or more, "more than one" means two or more, "at least two (items)" means two or three and more than three, and "and / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items. For example, at least one 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".

[0080] The method provided in this application can be applied to various communication systems, for example, the Internet of Things (IoT) system, the narrowband Internet of Things (NB-IoT) system, the long term evolution (LTE) system, the fifth generation (5G) communication system, and new communication systems (such as 6G) that will emerge in the future development of communication. And the method provided in this application can also be applied to wireless local area network (WLAN) systems, such as wireless fidelity (Wi-Fi), etc.

[0081] The method provided in the present application can be implemented by a communication device in a wireless communication system. For example, the communication device can be an access point (AP) device or a station (STA) device. For another example, the communication device can also be a wireless communication device that supports parallel transmission of multiple links, such as the communication device can be called a multi-link device (MLD) or a multi-band device (multi-band device).

[0082] The method provided in the present application can be applied to a scenario where a node transmits data to one or more nodes; it can also be applied to uplink / downlink transmission of a single user, and / or uplink / downlink transmission of multiple users; it can also be applied to device to device (D2D) transmission, etc., which will not be described in detail here. Among them, the above-mentioned node can be either an AP or a STA. For the convenience of description, the following takes the communication between AP and STA as an example for explanation.

[0083] Exemplarily, the communication system to which the method provided in the present application can be applied may include an access point (AP) device and a station (STA) device. The access point device can also be understood as an access point entity, and the station device can also be understood as a station entity. For example, the present application can be applied to the scenario of communication between AP and STA in WLAN. Optionally, the AP can communicate with a single STA, or the AP can communicate with multiple STAs at the same time. Specifically, the communication between AP and multiple STAs can be divided into downlink transmission in which the AP sends signals to multiple STAs at the same time, and uplink transmission in which multiple STAs send signals to the AP. Among them, the WLAN communication protocol can be supported between AP and STA, and the communication protocol may include IEEE 802.11be (or Wi-Fi7, EHT protocol), and may also include IEEE 802.11ax, IEEE 802.11ac and other protocols. Of course, with the continuous evolution and development of communication technology, the communication protocol may also include the next generation protocol of IEEE 802.11be, etc.

[0084] Figure 1 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application. The communication system may include one or more APs and one or more STAs. Figure 1 An access point device such as AP and three station devices such as STA1, STA2 and STA3 are shown in FIG. Figure 1 Only one AP and three STAs are shown for example, but the number of the APs or STAs may be more or less, and this application does not limit this.

[0085] Among them, access points (such as Figure 1The AP) is a device with wireless communication function, supports communication using the WLAN protocol, has the function of communicating with other devices in the WLAN network (such as stations or other access points), and of course, can also have the function of communicating with other devices. Alternatively, the access point is equivalent to a bridge connecting the wired network and the wireless network. Its main function is to connect various wireless network clients together and then connect the wireless network to the Ethernet. In the WLAN system, the access point can be called an access point station (AP STA). The device with wireless communication function can be a complete device, or a chip or processing system installed in the complete device. The device installed with these chips or processing systems can implement the methods and functions of the embodiments of the present application under the control of the chip or processing system. The AP in the embodiment of the present application is a device that provides services for STA and can support the 802.11 series of protocols. For example, the access point can be an access point for a terminal device (such as a mobile phone) to enter a wired (or wireless) network. It is mainly deployed in homes, buildings, and parks. The typical coverage radius is tens of meters to hundreds of meters. Of course, it can also be deployed outdoors. For another example, the AP may be a communication entity such as a communication server, a router, a switch, a bridge, etc.; the AP may include various forms of macro base stations, micro base stations, relay stations, etc., and of course the AP may also be a chip and processing system in these various forms of devices, so as to implement the methods and functions of the embodiments of the present application. The access point in the present application may be a high efficiency (HE) AP or an extraordinarily high throughput (EHT) AP, or an access point applicable to future WiFi standards, etc.

[0086] Site (e.g. Figure 1STA1 or STA2, etc. in the figure) is a device with wireless communication function, supports communication using WLAN protocol, and has the ability to communicate with other stations or access points in the WLAN network. In the WLAN system, the station can be called a non-access point station (non-AP STA). For example, STA is any user communication device that allows the user to communicate with the AP and then communicate with the WLAN. The device with wireless communication function can be a complete device, or a chip or processing system installed in the complete device, etc. The device installed with these chips or processing systems can implement the methods and functions of the embodiments of the present application under the control of the chip or processing system. For example, the station can be a wireless communication chip, a wireless sensor or a wireless communication terminal, etc., which can also be called a user. For another example, the station can be a mobile phone supporting WiFi communication function, a tablet computer supporting WiFi communication function, a set-top box supporting WiFi communication function, a smart TV supporting WiFi communication function, a smart wearable device supporting WiFi communication function, a vehicle-mounted communication device supporting WiFi communication function, and a computer supporting WiFi communication function, etc.

[0087] WLAN system can provide high-speed and low-latency transmission. With the continuous evolution of WLAN application scenarios, WLAN system will be applied to more scenarios or industries, such as the Internet of Things industry, the Internet of Vehicles industry or the banking industry, corporate offices, stadiums and exhibition halls, concert halls, hotel rooms, dormitories, wards, classrooms, supermarkets, squares, streets, production workshops and warehouses, etc. Of course, the devices supporting WLAN communication (such as access points or sites) can be sensor nodes in smart cities (such as smart water meters, smart meters, smart air detection nodes), smart devices in smart homes (such as smart cameras, projectors, displays, TVs, speakers, refrigerators, washing machines, etc.), nodes in the Internet of Things, entertainment terminals (such as wearable devices such as AR and VR), smart devices in smart offices (such as printers, projectors, loudspeakers, speakers, etc.), Internet of Vehicles devices in the Internet of Vehicles, infrastructure in daily life scenarios (such as vending machines, self-service navigation desks in supermarkets, self-service cash registers, self-service ordering machines, etc.), and equipment in large sports and music venues, etc. For example, the access point and the station can be devices used in the Internet of Vehicles, IoT nodes and sensors in the Internet of Things (IoT), smart cameras in smart homes, smart remote controls, smart water meters and electricity meters, and sensors in smart cities. The specific forms of STA and AP are not limited in the embodiments of the present application, and are only exemplary.

[0088] Although the present application is mainly described using a network deploying IEEE 802.11 as an example, those skilled in the art will readily appreciate that the various aspects of the present application may be extended to other networks that adopt various standards or protocols, such as Bluetooth, high performance radio LAN (HIPERLAN) (a wireless standard similar to the IEEE802.11 standard, mainly used in Europe), and wide area networks (WANs), wireless local area networks (WLANs), personal area networks (PANs), or other networks now known or developed later.

[0089] For example, Figure 2 Schematic diagram of the structure of the access point and the station provided in the embodiment of the present application. The AP can be a multi-antenna or a single-antenna. Figure 2 As shown in FIG. 1 , the AP includes a physical layer (PHY) processing circuit and a media access control (MAC) processing circuit. The physical layer processing circuit can be used to process physical layer signals, and the MAC layer processing circuit can be used to process MAC layer signals. The 802.11 standard focuses on the PHY and MAC parts. Figure 2 As shown, Figure 2 A schematic diagram of the STA structure with a single antenna is also shown. In actual scenarios, the STA may also have multiple antennas and may be a device with more than two antennas. The STA may include a PHY processing circuit and a MAC processing circuit. The physical layer processing circuit may be used to process physical layer signals, and the MAC layer processing circuit may be used to process MAC layer signals.

[0090] In the present application, the transmitting device may be an access point device or a site device; the receiving device may also be an access point device or a site device. For example, the transmitting device may be an access point device, and the receiving device may also be an access point device; for another example, the transmitting device may be a site device, and the receiving device may also be a site device; for another example, the transmitting device may be an access point device, and the receiving device may be a site device; for another example, the transmitting device may be a site device, and the receiving device may be an access point device. It is understood that the transmitting device and the receiving device shown here may also be collectively referred to as a communication device.

[0091] It can be understood that the present application will take the example of a transmitting device sending a PPDU to a receiving device to illustrate the signal processing method provided by the present application. However, the method shown in the present application can also be applied to various types of PPDU. For example, the PPDU may include: a multiple user PHY protocol data unit (MUPPDU), a single user PHY protocol data unit (SU PPDU) or a trigger based PHY protocol data unit (TB PPDU), etc.

[0092] The following is a description of the terms involved in this application.

[0093] 1. Orthogonal frequency division multiplexing (OFDM)

[0094] Orthogonal frequency division multiplexing is a multi-carrier transmission technology that can use a large number of adjacent orthogonal subcarriers. At the same time, each subcarrier can be modulated using a modulation technology. Therefore, the use of orthogonal frequency division multiplexing technology can have the ability of high-speed transmission and can effectively resist frequency selective fading. Figure 3a VHT-LTF1 to VHT-LTF N in the above table can also understand OFDM symbols. Figure 3a The VHT-LTF in the illustrated physical (PHY) layer protocol data unit (PHY protocol data unit, PPDU) may also be understood to include N OFDM symbols.

[0095] 2. Physical (PHY) layer protocol data unit (PHY protocol data unit, PPDU)

[0096] For example, Figure 3a FIG. 2 shows a schematic diagram of a frame structure of a very high throughput (VHT) PPDU (also referred to as 802.11ac PPDU). Figure 3aAs shown, the VHT PPDU includes data (VHT data), a legacy physical layer preamble (legacy preamble) and a very high throughput preamble (VHT preamble). The legacy physical layer preamble includes a legacy short training field (legacy-short training field, L-STF), a legacy long training field (legacy-long training field, L-LTF) and a legacy signaling field (egacy-signal field, L-SIG). The very high throughput preamble includes a very high throughput signaling field A (very high throughput signaling field A, VHT-SIG A), a very high throughput short training field (very high throughput short training field, VHT-STF), a very high throughput long training field (very high throughput long training field, VHT-LTF), and a very high throughput field B (very high throughput signaling field B, VHT-SIG B). Among them, VHT-SIG-A (also known as VHTSIGA) can include 2 OFDM symbols, each symbol duration is 4μs. And the VHT-LTF may include N VHT-LTF symbols, and the VHT-LTF may be used to help the receiving end device to correctly estimate the channel, thereby helping the receiving end device to correctly decode the received data information.

[0097] like Figure 3a As shown, the PPDU may also include a service field, a VHT data field, a padding & tail field.

[0098] 3. Pilot subcarrier and data subcarrier

[0099] In the WLAN communication protocol, each OFDM symbol may include a pilot subcarrier and a data subcarrier. A pilot subcarrier is a subcarrier that places or carries a preset sequence in an OFDM symbol, and a data subcarrier is a subcarrier that places or carries data. In a communication system, a pilot subcarrier can be used to help detect and correct subcarrier phase offsets, thereby improving the accuracy of data subcarrier resolution. For example, Figure 3aEach VHT-LTF symbol (may also be referred to as an LTF symbol) included in the illustrated LTF, that is, each VHT-LTF symbol in VHT-LTF1 to VHT-LTF N may include a pilot subcarrier and a data subcarrier.

[0100] The 802.11ac protocol supports up to 8 simultaneous data streams, including single-user multiple input multiple output (MIMO) and multi-user MIMO. STS When Figure 3a The number of OFDM symbols N included in the LTF shown LTF The following relationship can be satisfied:

[0101]

[0102] Among them, N STS It is used to indicate the maximum number of spatial streams supported by the communication device (the number of spatial streams can also be referred to as the number of streams). LTF Used to indicate the number of OFDM symbols included in LTF (i.e. the number of LTF symbols included in LTF). For example, Figure 3a VHT-LTF1 to VHT-LTF N shown are the number of OFDM symbols included in the LTF, and N is a positive integer. At the same time, each LTF symbol included in the LTF may include a data subcarrier and a pilot subcarrier. Exemplarily, the Figure 3a The VHT-LTF1 shown may include multiple data subcarriers and multiple pilot subcarriers, VHT-LTF2 may also include multiple data subcarriers and multiple pilot subcarriers, VHT-LTF3 may also include multiple data subcarriers and multiple pilot subcarriers, etc. For example, LTF includes N LTF symbols, and each of the N LTF symbols may include multiple data subcarriers and multiple pilot subcarriers. It can be understood that the present application does not limit the number of data subcarriers and pilot subcarriers included in each LTF symbol. For the specific number of data subcarriers and pilot subcarriers, reference may be made to relevant standards or protocols, etc., which will not be described in detail here. Exemplarily, the data subcarriers included in each of the N LTF symbols included in the LTF may be the same, and the pilot subcarriers included in each LTF symbol may also be the same.

[0103] LTF can be used to help the receiver estimate the channels of multiple spatial streams simultaneously. In order to accurately estimate the spatial stream channels and keep the LTF symbols of each stream orthogonal, 802.11ac proposes the use of the P matrix. STS =4 as an example, the corresponding P matrix is:

[0104]

[0105] In this case, the relationship between the spatial stream and time of the VHT-LTF can be as follows: Figure 3b As shown. Where N STS =1, N STS =2 or N STS =3 when the structure of VHT-LTF can be Figure 3b Part of the structure shown. Figure 3b The time marked in, such as 0 ns, -400 ns, -200 ns or -600 ns, can be understood as the cyclic shift delay (CSD) corresponding to each spatial stream.

[0106] For example, when sending a PPDU, the transmitting end device may combine the jth LTF symbol corresponding to the i-th spatial stream with the P 4*4 Multiply the elements in the i-th row and j-th column of the matrix. Here, i can be a positive integer greater than or equal to 1 and less than or equal to 4, and j can be a positive integer greater than or equal to 1 and less than or equal to 4. It can be understood that Figure 3b Shown are 4 LTF symbols, and Figure 3b Only the first LTF symbol is marked for example. It is understandable that the i shown in the present application can change according to the change of the number of spatial streams, and the j can also change with the change of the number of spatial streams. Exemplarily, when the number of spatial streams is 8, the i can be an integer greater than or equal to 1 and less than or equal to 8, and the j is an integer greater than or equal to 1 and less than or equal to 8.

[0107] Therefore, the kth subcarrier corresponding to each LTF symbol undergoes channel H k After that, the frequency domain signal Y received by the receiving device k It can be expressed as:

[0108] Y k =H k ×P 4×4 ×LTF k (3)

[0109] The above P 4*4 The matrix is ​​an orthogonal matrix, that is Here I is the identity matrix, YesP 4×4 The conjugate transposed matrix of the matrix. Thus, the receiving device can 4×4 Matrix, LTF k Sequence and received frequency domain signal Y k Estimate the MIMO channel H corresponding to the kth subcarrier k .

[0110] In other words, when the transmitting device sends PPDU, the signal sent on the data subcarrier in each LTF symbol can be obtained by multiplying the P matrix by the LTF sequence. When the receiving device receives the signal, it can perform channel estimation based on the signal received on the data subcarrier in each LTF symbol, the P matrix and the LTF sequence, and then obtain the channel response H k .

[0111] At the same time, when the transmitting device sends PPDU, the signal sent on the pilot subcarrier in each LTF symbol can be obtained by multiplying the LTF sequence by the R matrix. When receiving the signal, the receiving device can perform phase tracking and frequency offset estimation based on the signal received on the pilot subcarrier in each LTF symbol, the R matrix and the LTF sequence.

[0112] That is, when the transmitting device sends a PPDU, the data subcarrier in the jth LTF symbol corresponding to the i-th spatial stream (i.e., the jth LTF symbol in the LTF in the PPDU) can be multiplied by the i-th row and j-th column element of the P matrix, and the pilot subcarrier in the j-th LTF symbol corresponding to the i-th spatial stream will be multiplied by the i-th row and j-th column element of the R matrix. Exemplarily, the i-th row of the R matrix can be equal to the first row of the P matrix. The relationship between the R matrix and the P matrix can be as follows:

[0113] R(i, j) = P(1, j) (4)

[0114] Thus, each row of the R matrix can be the same, and each row of the R matrix can be equal to the first row of the P matrix.

[0115] It can be understood that the LTF sequence shown above can be defined by relevant standards or protocols, etc., and the present application is not limited to this. Exemplarily, the above LTF sequence can be {1, 1, -1, -1, 1, 1, -1, 1, 1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, 1, 1}. Exemplarily, the above LTF sequence can be {1, -1, -1, 1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1, 1, 1}.

[0116] The above is a P matrix shown with 4 spatial streams. For example, when N STS =2, the corresponding P matrix is:

[0117]

[0118] For example, when N STS =6, the corresponding P matrix is:

[0119]

[0120] Wherein, w=exp(-j2π / 6).

[0121] For example, when N STS =8, the corresponding P matrix is:

[0122]

[0123] For example, the specific expression of the above formula (7) can be:

[0124]

[0125] As can be seen from the above, the maximum number of streams supported in the 802.11ax protocol is 8. However, in the next-generation EHT standard, the maximum number of spatial streams allowed is 16, which makes the above P matrix unable to be directly applied to scenarios with more than 8 streams.

[0126] In view of this, the present application provides a signal processing method and apparatus. The method provided by the present application can be applicable to scenarios where the number of streams is greater than 8. For example, the method provided by the present application can support 16-stream channel estimation, such as supporting 16-stream MIMO channel estimation. For another example, the method provided by the present application can also support 32-stream or 24-stream channel estimation. Moreover, the P provided by the present application n×n The matrix can also reduce the storage P of the communication device n×n Matrix space.

[0127] It is understood that for the description of the communication device and the communication system of the signal processing method provided by the present application, reference can be made to the above, and no further details will be given here. It is understood that the following will take the communication device including a transmitting end device and a receiving end device as an example to illustrate the method provided by the embodiment of the present application. The transmitting end device shown below can be understood as a device that sends PPDU, and the receiving end device can be understood as a device that receives PPDU.

[0128] Figure 4a is a flow chart of a signal processing method provided by an embodiment of the present application, such as Figure 4a As shown, the method includes:

[0129] 401. A transmitting end device generates a PPDU, the PPDU includes a preamble, the preamble includes an LTF, the LTF includes a plurality of LTF symbols, the plurality of LTF symbols are used to carry a sequence obtained according to a first matrix, the first matrix is ​​P n×n Matrix, or the first matrix according to P n×n The matrix is ​​obtained, and The I is the identity matrix, P n×n The matrix consists of n rows and n columns. The matrix is ​​Pn×n The transposed matrix of the matrix, n is an integer greater than 8, and k is used to represent the k-th subcarrier in each LTF symbol in the multiple LTF symbols.

[0130] This n can not only be used to represent P n×n The number of rows and columns of the matrix (also referred to as the P matrix) can also be used to indicate the maximum number of spatial streams supported by the transmitting device when sending a signal. In other words, the maximum number of spatial streams supported by the transmitting device when sending a PPDU can be greater than 8.

[0131] For example, when n=12, P n×n The matrix may include 12 rows and 12 columns, so the first matrix includes 12 rows and 12 columns. At the same time, the maximum number of spatial streams supported by the transmitting end device may be 12, and the transmitting end device may also multiply the nth LTF symbol corresponding to the mth spatial stream by the mth row and nth column in the first matrix (such as Figure 3b ). Accordingly, the receiving device can simultaneously estimate channels of less than or equal to 12 spatial streams. For example, the receiving device can also simultaneously estimate channels of 8 spatial streams, or the receiving device can also simultaneously estimate channels of 4 spatial streams, etc. That is to say, the receiving device can perform channel estimation, or perform phase tracking and frequency offset estimation, etc. through part or all of the content of the first matrix. Exemplarily, when n=16, the first matrix includes 16 rows and 16 columns. At the same time, the maximum number of spatial streams supported by the transmitting device can be 16. Accordingly, the receiving device can simultaneously estimate channels of 16 spatial streams, or the receiving device can also simultaneously estimate channels of less than 16 spatial streams. For example, the receiving device uses the P provided in the embodiment of the present application. n×n The matrix can also estimate channels of 2-15 spatial streams, such as channels of 2 spatial streams, channels of 3 spatial streams, channels of 4 spatial streams, channels of 6 spatial streams, channels of 8 spatial streams, channels of 12 spatial streams, channels of 15 spatial streams, etc., which is not limited in the embodiments of the present application.

[0132] Exemplarily, the maximum number of spatial streams supported by the transmitting end device may also be 32 spatial streams (or 24 spatial streams), etc. And the receiving end device may also simultaneously estimate channels with less than 32 spatial streams (or less than 24 spatial streams).

[0133] The number of LTF symbols shown in the present application may be greater than or equal to the number of spatial streams. For example, the number of LTF symbols is equal to the number of spatial streams, such as n. For another example, the number of LTF symbols is equal to the number of spatial streams n+1, etc.

[0134] Exemplarily, the multiple LTF symbols include data subcarriers. In this case, the first matrix may be equal to the P n×nMatrix; or, the first matrix is ​​P n×n The transpose of a matrix (such as ); or, the first matrix is ​​equal to the P n×n The overall inverse of the matrix (such as -P n×n ); or, the first matrix is ​​P n×n The transpose matrix of the matrix (such as (-P n×n ) T ); or, the first matrix is ​​P n×n The overall inverse of the matrix transpose (such as ). In other words, the data subcarrier in each LTF symbol in the multiple LTF symbols in the LTF sent by the transmitting device can be obtained by the first matrix shown above. It can be understood that the relationship between the first matrix and the P matrix shown here is only an example, and any first matrix obtained based on the P matrix falls within the protection scope of this application.

[0135] Exemplarily, the multiple LTF symbols include pilot subcarriers. In this case, the first matrix may be equal to R n×n The matrix R n×n The matrix can be obtained according to P n×n The Tth row (or a certain row) of the matrix is ​​obtained. Here, T is an integer greater than or equal to 1 and less than n. For example, the R n×n The matrix can be obtained according to P n×n The first row of the matrix is ​​obtained. For example, the R n×n Each row in the matrix can also be The first row of the matrix; or, n×n Each row in the matrix can also be P n×n The first row of the matrix is ​​the overall inverse of the matrix; or, n×n Each row in the matrix can also be P n×n The overall inverse of a matrix, the transpose of a matrix, etc.

[0136] For an example of the first matrix, reference may also be made to Formulas (84) to (89) shown below. n×n Matrix and P n×n The relationship of the matrices can also be referred to in formula (10) shown below.

[0137] Thus, the multiple LTF symbols included in the LTF are used to carry the sequence obtained according to the first matrix, including: the data subcarriers in the multiple LTF symbols are used to carry the sequence obtained according to P n×n The sequence obtained by the matrix (also referred to as the P matrix) and the LTF sequence, and the pilot subcarriers in the multiple LTF symbols are used to carry the R n×nFurther, the receiving end device receives the PPDU, and the part of the multiple LTF symbols included in the LTF in the PPDU corresponding to the data subcarrier can be obtained by P n×n The part of the multiple LTF symbols corresponding to the pilot subcarriers can be obtained by multiplying the LTF sequence by the matrix and performing an inverse Fourier transform (also called an inverse Fourier transform). n×n The matrix is ​​multiplied by the LTF sequence and inverse Fourier transformed.

[0138] It can be understood that for the LTF sequence, data subcarrier, pilot subcarrier, and the relationship between the P matrix and the data subcarrier, and the relationship between the R matrix and the pilot subcarrier, reference can also be made to the above, such as Figure 3a or Figure 3b etc., which will not be elaborated here.

[0139] For example, Figure 4b is a schematic diagram of the structure of another PPDU provided in an embodiment of the present application. Figure 4b As shown, the PPDU includes data, a traditional physical layer preamble, an extremely high throughput (EHT) preamble, and a packet extension (PE). The EHT preamble includes a repeated legacy signaling field (RL-SIG), a universal signaling field (U-SIG), an extremely high throughput short training field (EHT short training field, EHT-STF) and LTF. The LTF includes N EHT-LTFs (also referred to as LTF symbols), and the N EHT-LTF symbols include EHT - LTF1 to EHT - LTF N.

[0140] It is understandable that the PPDU generated by the above transmitting device can be as follows Figure 4b As shown, at the same time, the above-mentioned LTF symbol may include an EHT-LTF symbol.

[0141] 402. The transmitting device transmits the PPDU. Correspondingly, the receiving device receives the PPDU.

[0142] 403. The receiving end device processes signals received from multiple LTF symbols according to the first matrix.

[0143] Exemplarily, the receiving end device may perform channel estimation based on the signals received on the data subcarriers in the multiple LTF symbols and the first matrix. For example, the receiving end device may perform channel estimation based on the signals received on the data subcarriers in the multiple LTF symbols, the first matrix, and the LTF sequence. Exemplarily, the receiving end device may also perform phase tracking and / or frequency offset estimation based on the signals received on the pilot subcarriers in the multiple LTF symbols and the first matrix. For example, the receiving end device may also perform phase tracking and frequency offset estimation based on the signals received on the pilot subcarriers in the multiple LTF symbols, the first matrix, and the LTF sequence.

[0144] For the first matrix With P n×n Matrix or R n×n The relationship of the matrices can be shown as in formula (9). For example, for the k-th subcarrier in each LTF symbol, when the transmitting end device generates the LTF, the transmitting end device can generate the LTF through the mapping matrix shown below.

[0145]

[0146] It can be understood that other cases in formula (9) can represent the case where the kth subcarrier is a non-pilot subcarrier. For example, if the kth subcarrier is a data subcarrier, then the first matrix

[0147] For example, R n×n Matrix and P n×n The relationship of the matrices can be shown as follows:

[0148] [R] m,n =[P] 1,n (10)

[0149] Among them, [R] m,n Represents R n×n The mth row of the matrix, [P] 1,n Indicates P n×n In the first row of the matrix, m and n are both integers greater than or equal to 1 and less than or equal to 16.

[0150] It can be understood that the R shown in the embodiment of the present application n×n Each row of the matrix can also be equal to P n×n The first row of the matrix is ​​the overall inverse of the matrix, or, P n×n The first row of the transpose of the matrix, or, P n×n The overall inverse of a matrix is ​​the transpose of the first row of the matrix and so on.

[0151] The method provided in the embodiment of the present application can realize the channel estimation of more than 8 streams by the receiving device. For example, the receiving device can support MIMO channel estimation of up to 16 streams. At the same time, the P matrix provided in the present application can also adapt to the requirements of different numbers of streams, so that the receiving device can not only realize MIMO channel estimation of 12 streams, but also realize MIMO channel estimation of 16 streams, etc. n×n The matrix can realize MIMO channel estimation of multiple different numbers of streams and effectively reduce the redundancy of MIMO channel estimation.

[0152] Generally, for a matrix with 16 rows and 16 columns, the communication device often needs to store the values ​​of 256 elements. Therefore, the communication device (such as the transmitting end device) can read the elements of the matrix in sequence when generating LTF. n×n Matrix, since only the submatrix S is stored (n-1)×(n-1) The submatrix S can be restored by the vector of the first row or the first column (or the first vector x, the second vector y, etc.) (n-1)×(n-1) and P n×n matrix, so there is no need to store the complete P n×n Matrix, which can effectively reduce the storage space it occupies and reduce the complexity of implementation. n×n The matrix can be composed of element 1 and element -1, which can also simplify the complexity of calculation. n×n The n elements in the Tth row of the matrix are not completely the same, which can effectively improve the problem of spectral line.

[0153] The following is based on P n×n The characteristics of the matrix are used to illustrate the P provided in the embodiment of the present application. n×n It is understood that one or more of the features shown below may be a matrix of the P n×n Matrix features. For example, one of the features 1 to 7 shown below can be the P n×n The characteristics of the matrix; or, the combination of any two of the characteristics 1 to 7 shown below is the P n×n The characteristics of the matrix; or, the combination of any three of the characteristics one to seven shown below is the P n×n The characteristics of the matrix, etc.; or, the characteristics one to seven shown below can all be the P n×n Characteristics of matrices.

[0154] Feature 1:

[0155] The P n×n The matrix consists of elements 1 and -1.

[0156] In the embodiment of the present application, the P n×n The matrix may be a matrix consisting of element 1 and element -1. Thus, the communication device saves other more complex elements (such as complex numbers, etc.), which leads to the problem of complex implementation. That is, the P provided in the embodiment of the present application is improved. n×n Matrices can effectively simplify the complexity of calculations.

[0157] Feature 2:

[0158] The P n×n The n elements in the T-th row of the matrix are not all the same, where T is an integer greater than or equal to 1 and less than n.

[0159] In the present application embodiment, if the P n×n The n elements in the first row of the matrix are not identical; or n×n The n elements of the second row of the matrix are not exactly the same; or, n×n The n elements in the Tth row of the matrix are not exactly the same. n×n The matrix R n×n The n elements in each row of the matrix may not be completely the same, in which case the problem of spectrum bulge is effectively improved.

[0160] In combination with the above-mentioned features 1 and 2, the P provided in the embodiment of the present application n×n The elements of the matrix are simple, and it also makes the P n×n The n elements in each row of the matrix are not completely the same, which not only improves the problem of computational complexity of the communication device, but also effectively improves the problem of spectrum bulge.

[0161] Feature 3:

[0162] The P n×n Submatrix S of the matrix (n-1)×(n-1) is a circulant matrix or a Hankel matrix.

[0163] The circulant matrix can be a special form of a Toeplitz matrix (also called a constant diagonal matrix). Each element of the column vector of the circulant matrix can be the result of shifting each element of the previous column vector right by one position.

[0164] Hankel matrix x ) refers to a square matrix in which the elements on each subdiagonal are equal.

[0165] In the present application embodiment, by n×n Submatrix S of the matrix (n-1)×(n-1) Set as a circulant matrix or a Hankel matrix, the communication device only needs to store the submatrix S (n-1)×(n-1)The submatrix can be restored by simply searching the first row or the first column of , which effectively saves the storage space of the communication device and reduces the implementation complexity.

[0166] It can be understood that about the submatrix S (n-1)×(n-1) Examples of Hankel matrices can be found in Formula (51) and Formula (52) shown below.

[0167] Feature 4:

[0168] P n×n Submatrix S of the matrix (n-1)×(n-1) The first row of is equal to or obtained from the first vector x, x = [1 1 1 -1 1 -1 -1 -1 -1 -1] (in this case, n = 12); or P n×n Submatrix S of the matrix (n-1)×(n-1) The first row is equal to the second vector y or according to the second vector y It is found that y=[1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1] (in this case, n=16).

[0169] In the embodiment of the present application, for the sub-matrix S (n-1)×(n-1) The other rows of can also be obtained according to the first vector x; or, according to the second vector y. For ease of description, the following will be sub-matrix S (n-1)×(n-1) The first row of is equal to the first vector x (or the second vector y) or is obtained according to the first vector x (or the second vector y) as an example to illustrate the various matrices provided in the embodiments of the present application, but it should not be understood as a limitation to the embodiments of the present application.

[0170] For example, the submatrix S (n-1)×(n-1) The first row of can be obtained by one or more of three operations: circular shift, inversion or overall inversion of the first vector x.

[0171] For example, the submatrix S (n-1)×(n-1) The first row of y can be obtained by one or more of three operations: circular shift, inversion or overall inversion of the second vector y.

[0172] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the overall inverse vector of the first vector, such as the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 -1 1 1 -1 1 1 1] (can also be written as -x).

[0173] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the inverse vector of the first vector, such as the submatrix S (n-1)×(n-1)The first row of = [-1 -1 -1 1 -1 -1 1 -1 1 1 1] (it can also be written as the reverse vector of x).

[0174] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the cyclic shift vector of the first vector, such as the submatrix S (n-1)×(n-1) The first row of = [-1 1 1 1 -1 1 -1 -1 -1 -1], that is, the first vector x is cyclically shifted right by one position to obtain the submatrix S (n-1)×(n-1) The first row of . For example, the submatrix S (n-1)×(n-1) The first row of = [1 1 -1 1 -1 -1 1 -1-1 -1 1], that is, the first vector x is cyclically shifted to the left by one position to obtain the submatrix S (n-1)×(n-1) The first line of .

[0175] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the overall inverse of the second vector, such as the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1] (can also be written as -y).

[0176] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the inverse vector of the second vector, such as the submatrix S (n-1)×(n-1) The first row of = [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] (it can also be written as the reverse vector of y).

[0177] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the cyclic shift vector of the second vector, such as the submatrix S (n-1)×(n-1) The first row of = [-1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1], that is, the second vector y is cyclically shifted right by one position to obtain the submatrix S (n-1)×(n-1) The first row of . For example, the submatrix S (n-1)×(n-1) The first row of = [1 1 -1 -1-1 -1 -1 1 -1 -1 -1 1 -1 1], that is, the second vector y is circularly shifted to the left by one position to obtain the submatrix S (n-1)×(n-1) The first line of .

[0178] For example, when the submatrix S (n-1)×(n-1) When the first row of the S matrix P is obtained according to the first vector x, (n-1)×(n-1) The second row of can also be obtained according to the cyclic shift of the first vector x, the S matrix P (n-1)×(n-1) The third row of can also be obtained by cyclic shift of the first vector x, etc. Or, the submatrix S (n-1)×(n-1)After the first row of the submatrix S is determined according to the first vector x, (n-1)×(n-1) The second row to the n-1th row of can also be obtained according to the cyclic shift of the first row.

[0179] For example, the submatrix S (n-1)×(n-1) The first row of = [1 1 1 -1 1 -1 -1 -1 -1 -1], submatrix S (n-1)×(n-1) The second row of S = [-1 1 1 1 -1 1 -1 -1 -1 -1] (i.e., the 11 elements of x are circularly shifted one position to the right), the submatrix S (n-1)×(n-1) The third row of = [-1 -1 1 1 1 -1 1 -1 -1 1 -1] (that is, the 11 elements of x are cyclically shifted two places to the right), and so on, we can get the submatrix S (n-1)×(n-1) .

[0180] For example, the submatrix S (n-1)×(n-1) The first row of = [1 1 1 -1 1 -1 -1 -1 -1 -1], submatrix S (n-1)×(n-1) The second row of S = [1 1 -1 1 -1 -1 -1 -1 -1 1] (i.e., the 11 elements of x are circularly shifted to the left by one position), the submatrix S (n-1)×(n-1) The third row of = [1 -1 1 -1 -1 -1 -1 -1 1 1] (that is, the 11 elements of x are circularly shifted left by two places), and so on, we can get the submatrix S (n-1)×(n-1) .

[0181] For example, the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 -1 1 1 -1 1 1 1], submatrix S (n-1)×(n-1) The second row of x = [1 -1 -1 -1 1 -1 1 1 -1 1 1] (i.e., the 11 elements of the overall inverse of x are cyclically shifted one position to the right), submatrix S (n-1)×(n-1) The third row of = [1 1 -1 -1 -1 1 -1 1 -1 1], and so on, we can get the submatrix S (n-1)×(n-1) .

[0182] For example, the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 -1 1 1 -1 1 1 1], submatrix S (n-1)×(n-1) The second row of the submatrix S = [-1 -1 1 -1 1 1 -1 1 1 -1] (i.e., the 11 elements of the overall inverse of x are cyclically shifted one position to the left). (n-1)×(n-1)The third row of = [-1 1 -1 1 1 -1 1 1 -1 -1], and so on, we can get the submatrix S (n-1)×(n-1) .

[0183] For example, the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 -1 -1 1 -1 1 1], submatrix S (n-1)×(n-1) The second row of S = [1 -1 -1 -1 1 -1 -1 1 -1 1 1] (i.e., the 11 elements of the reverse vector of x are cyclically shifted to the right by one position), the submatrix S (n-1)×(n-1) The third row of = [1 1 -1 -1 -1 -1 -1 -1 1 -1 1], and so on, we can get the submatrix S (n-1)×(n-1) .

[0184] For example, the submatrix S (n-1)×(n-1) The first row of = [-1 -1 -1 1 -1 -1 1 -1 1 1], submatrix S (n-1)×(n-1) The second row of S = [-1 -1 1 -1 -1 1 -1 1 1 -1] (i.e., the 11 elements of the reverse vector of x are cyclically shifted to the left by one position), the submatrix S (n-1)×(n-1) The third row of = [-1 1 -1 -1 1 -1 1 1 -1 -1], and so on, we can get the submatrix S (n-1)×(n-1) .

[0185] In other words, the submatrix S (n-1)×(n-1) Each element of the row vector of is the result of shifting the elements of the previous row vector right by one position; or, the submatrix S (n-1)×(n-1) Each element of the row vector is the result of shifting each element of the previous row vector left by one position.

[0186] For example, when the submatrix S (n-1)×(n-1) When the first row of is equal to the second vector y or is obtained according to the second vector y, the submatrix S (n-1)×(n-1) The second row to the n-1th row of can also be obtained according to the cyclic shift of the first row.

[0187] It can be understood that about the submatrix S (n-1)×(n-1) For the description of the second vector y, please refer to the submatrix S introduced above. (n-1)×(n-1) The example with the first vector x will not be described in detail here.

[0188] In the embodiment of the present application, the communication device obtains P according to the first vector or the second vector n×n Submatrix S of the matrix (n-1)×(n-1) After the first line of S (n-1)×(n-1)Therefore, the communication device only needs to save the P n×n Submatrix S of the matrix (n-1)×(n-1) Alternatively, when the relationship between a row of the submatrix and the first vector or the second vector is determined, the communication device only needs to ensure that the first vector or the second vector can restore the submatrix, thereby, there is no need to store the complete P n×n Matrix. This not only reduces P n×n The space occupied by the matrix saves storage space and effectively reduces the implementation complexity of the communication device (for example, the P matrix can be restored by operations such as cyclic shift). n×n Submatrix S of the matrix (n-1)×(n-1) ).

[0189] Feature 5:

[0190] P n×n Submatrix S of the matrix (n-1)×(n-1) The first column of is equal to the third vector x' or is obtained according to the third vector x' (in this case, n = 12); or P n×n Submatrix S of the matrix (n-1)×(n-1) The first column of is equal to the fourth vector y' or is obtained according to the fourth vector y'. In this case, n=16).

[0191] The third vector x' can be expressed as follows:

[0192]

[0193] The fourth vector y' can be expressed as follows:

[0194]

[0195] For example, the submatrix S (n-1)×(n-1) The first column of can be obtained by one or more of three operations: circular shift, inversion or overall inversion of the third vector.

[0196] For example, the submatrix S (n-1)×(n-1) The first column of can be obtained according to one or more of three operations of circular shift, inversion or overall inversion of the fourth vector y.

[0197] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the inverse vector of the third vector, such as the submatrix S (n-1)×(n-1) The first column of is equal to [1 1 -1 1 -1 -1 -1 -1 -1 1] T .

[0198] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the overall inverse vector of the third vector, such as the submatrix S(n-1)×(n-1) The first column of is equal to [-1 1 1 1 -1 1 1 -1 1 -1 -1] T .

[0199] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the transposed vector of the cyclic shift vector of the third vector, such as the submatrix S (n-1)×(n-1) The first column of = [-1 -1 -1 1 -1 -1 1 -1 1 1] T , that is, the third vector x' is circularly shifted upward by one position to obtain the submatrix S (n-1)×(n-1) The first column of . For example, the submatrix S (n-1)×(n-1) The first column of = [1 1 -1 -1 -1 1-1 -1 1 -1 1] I , that is, the third vector x' is circularly shifted downward by one position to obtain the submatrix S (n-1)×(n-1) The first line of .

[0200] It can be understood that the submatrix S (n-1)×(n-1) After the first column of the submatrix S is determined according to the third vector x', (n-1)×(n-1) The second to n-1th columns of can also be obtained according to the cyclic shift of the first column.

[0201] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the overall inverse vector of the fourth vector, such as the submatrix S (n-1)×(n-1) The first column of = [-1 1 -1 -1 1 1 -1 1 -1 1 l 1 1 -1 -1] T .

[0202] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the inverse vector of the transposed vector of the fourth vector, such as the submatrix S (n-1)×(n-1) The first column of = [1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1] T .

[0203] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the transposed vector of the cyclic shift vector of the fourth vector, such as the submatrix S (n-1)×(n-1) The first column of = [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] T , that is, the fourth vector y is circularly shifted upward by one position to obtain the submatrix S (n-1)×(n-1) The first column of . For example, the submatrix S (n-1)×(n-1) The first column of = [1 1-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1] T, that is, the fourth vector y is cyclically shifted downward by one position to obtain the submatrix S (n-1)×(n-1) The first line of .

[0204] It can be understood that about the submatrix S (n-1)×(n-1) The relationship between the first column of and the third vector x or the fourth vector y can be referred to the above description about feature four, which will not be described in detail here.

[0205] For the sake of simplicity, the following will be referred to as P n×n Submatrix S of the matrix (n-1)×(n-1) The first row of is equal to the first vector (or the second vector); or according to the first vector (or the second vector), as an example, the P shown in the embodiment of the present application is explained. n×n Matrix. For P n×n Submatrix S of the matrix (n-1)×(n-1) The first column of is equal to the third vector (or fourth vector); or the example obtained according to the third vector (or fourth vector) is not described in detail below.

[0206] Feature 6:

[0207]

[0208]

[0209]

[0210]

[0211] Among them, the S (n-1)×(n-1) For this P n×n The matrix is ​​a submatrix, and the S (n-1)×(n-1) consists of n-1 rows and n-1 columns, a is a column vector consisting of n-1 elements, and each element is 1. T is the transposed vector of a, and -a represents the vector obtained by negating all elements in a.

[0212] In the embodiment of the present application, the S (n-1)×(n-1) Can be a circulant matrix or a Hankel matrix.

[0213] In the embodiment of the present application, it can not only ensure that the P n×n The matrix is ​​an orthogonal matrix, and effectively guarantees the submatrix S (n-1)×(n-1) is a circulant matrix or a Hankel matrix. Thus, the communication device stores the submatrix S (n-1)×(n-1) The vector of the first row or first column (or the first vector x, the second vector y, etc.) can restore the submatrix and P n×n Matrix, so there is no need to store the complete P n×n matrix, thus not only reducing P n×nThe space occupied by the matrix saves storage space and effectively reduces the implementation complexity of the communication device.

[0214] Feature 7:

[0215]

[0216]

[0217]

[0218]

[0219] In other words, the P 16×16 Matrix (i.e. P when n=16 n×n The matrix) can be based on P 8×8 The matrix P 8×8 The matrix is ​​the P matrix corresponding to when the maximum number of spatial streams supported by the communication device is 8.

[0220] Exemplary.

[0221]

[0222] In the embodiment of the present application, by 8×8 The matrix is ​​expanded to generate P 16×16 The matrix can not only ensure that the communication device supports the transmission of 16 streams of data or less than 16 streams of data, but also avoid excessive complex operations.

[0223] It is understandable that the embodiment of the present application can also be based on P 16×16 Matrix obtains P 32×32 Matrix, and according to P 12×12 Matrix obtains P 24×24 Matrix, the specific acquisition method is similar to the above-mentioned method based on P 8×8 The matrix is ​​expanded to generate P 16×16 For the sake of brevity, the following will not describe in detail the 12×12 The matrix gets P 24×24 Matrix method, and according to P 16×16 The matrix gets P 32×32 Matrix methods.

[0224] Therefore, by 12×12 The matrix is ​​expanded to generate P 24×24 Matrix, or, by P 16×16 The matrix is ​​expanded to generate P 32×32 The matrix can not only ensure that the communication device supports the transmission of 32 streams of data or less than 32 streams of data, but also avoid excessive complex operations.

[0225] For example, the following first describes in detail the P provided in the embodiments of the present application. n×n Matrix, and then introduce the R n×n Matrix, finally introduces the first matrix provided in the embodiment of the present application.

[0226] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0227]

[0228] or.

[0229]

[0230] The above formula (22) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 1 -1 -1 -1 -1] (i.e., equal to the first vector) is shown as an example, but it should not be understood as a limitation on the embodiments of the present application. It can be understood that formula (22) shows the submatrix S (n-1)×(n-1) Each element of the row vector is the result of shifting the previous row vector elements right by one position. Formula (23) shows the submatrix S (n-1)×(n-1) Each element of the row vector is the result of shifting each element of the previous row vector to the left by one position. It can be understood that the formulas (22) and (23) shown here can also be understood as P obtained according to the above formula (13) n×n Matrix. S (n-1)×(n-1) The result obtained by shifting each element of the row vector of S two (or three, four, etc.) positions to the right, or (n-1)×(n-1) The result obtained by shifting each element of the row vector of the submatrix S by two (or three, four, etc.) positions to the left also belongs to the protection scope of the present application. Therefore, for the sake of brevity, the following only shows the example of shifting the submatrix S (n-1)×(n-1) The result obtained by shifting each element of the row vector of by one position to the right. Meanwhile, for the sake of brevity, the matrices obtained by any one or more of the three operations of circular shift, overall inversion, and inversion in formula (22) or formula (23) are not listed here one by one.

[0231] It can be seen from the above formulas (22) and (23) that the P shown in the embodiment of the present application is n×n Submatrix S of the matrix (n-1)×(n-1) is a circulant matrix or a Hankel matrix. At the same time, the communication device only needs to store the submatrix S (n-1)×(n-1) The first line of P can be obtained n×n matrix, effectively saving the storage space of the communication device and reducing the time required to restore P n×nThe complexity of the matrix. It can be understood that for this description, the various P n×n Matrix or according to P n×n The first matrix obtained by the matrix is ​​also applicable. To avoid redundancy, it will not be described below.

[0232] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0233]

[0234] The above formula (24) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 1 -1 -1 -1 -1], and the above formula (14) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (24) are not listed here one by one.

[0235] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0236] or,

[0237] The above formula (25) is based on the sub-matrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 1 -1 -1 -1 -1], and the above formula (15) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (24) are not listed here one by one.

[0238] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0239]

[0240] The above formula (26) is based on the sub-matrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 1 -1 -1 -1 -1], and the above formula (16) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (26) are not listed here one by one.

[0241] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0242]

[0243] The above formula (27) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 1 1 -1 1 11] (i.e., the overall negation of the first vector), and the above formula (13) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (27) are not listed here one by one.

[0244] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0245]

[0246] The above formula (28) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 1 1 -1 1 11], and the above formula (14) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (28) are not listed here one by one.

[0247] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0248]

[0249] The above formula (29) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 1 1 -1 1 11] as an example, and the above formula (15) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (29) are not listed here one by one.

[0250] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0251]

[0252] The above formula (30) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 1 1 -1 1 11] as an example, and the above formula (16) is an example of P 12×12For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (30) are not listed here one by one.

[0253] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0254]

[0255] The above formula (31) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 -1 1 -1 1 11] (i.e., the reverse vector of the first vector), and the above formula (13) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (31) are not listed here one by one.

[0256] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0257]

[0258] The above formula (32) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 -1 1 -1 1 11], and the above formula (14) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (32) are not listed here one by one.

[0259] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0260]

[0261] The above formula (33) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 -1 1 -1 1 11] as an example, and the above formula (15) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (33) are not listed here one by one.

[0262] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0263]

[0264] The above formula (34) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 -1 -1 1 -1 1 11] as an example, and the above formula (16) is an example of P 12×12 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (34) are not listed here one by one.

[0265] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0266]

[0267] The above formula (35) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1] (i.e., the second vector) as an example, and the above formula (13) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (35) are not listed here one by one.

[0268] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0269]

[0270] The above formula (36) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1], and the above formula (14) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (36) are not listed here one by one.

[0271] It can be understood that the submatrix S in formula (36) is (n-1)×(n-1) It can also be understood as a Hankel matrix. For the submatrix S (n-1)×(n-1) For other examples of Hankel matrices, please refer to Formula (51) and Formula (52) shown below.

[0272] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0273]

[0274] The above formula (37) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1] as an example, and the above formula (15) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (37) are not listed here one by one.

[0275] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0276]

[0277] The above formula (38) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1], and the above formula (16) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (38) are not listed here one by one.

[0278] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0279]

[0280] The above formula (39) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 1 1 1 -1 1 -11 1 -1 -1 1] (i.e., the overall inverse vector of the second vector) as an example, and the above formula (13) is used as an example to illustrate P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (39) are not listed here one by one.

[0281] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0282]

[0283] The above formula (40) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 1 1 1 -1 1 -11 1 -1 -1 1] as an example, and the above formula (14) is an example of P 16×16For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (40) are not listed here one by one.

[0284] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0285]

[0286] The above formula (41) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 1 1 1 -1 1 -11 1 -1 -1 1] as an example, and the above formula (15) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (41) are not listed here one by one.

[0287] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0288]

[0289] The above formula (42) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 -1 -1 1 1 1 1 -1 1 -11 1 -1 -1 1] as an example, and the above formula (16) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (42) are not listed here one by one.

[0290] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0291]

[0292] The above formula (43) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] (i.e., the reverse vector of the second vector), and the above formula (13) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (43) are not listed here one by one.

[0293] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0294]

[0295] The above formula (44) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] as an example, and the above formula (14) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (44) are not listed here one by one.

[0296] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0297]

[0298] The above formula (45) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1], and the above formula (15) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (45) are not listed here one by one.

[0299] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0300]

[0301] The above formula (46) is based on the submatrix S (n-1)×(n-1) The first row of is equal to [-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] as an example, and the above formula (16) is an example of P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (46) are not listed here one by one.

[0302] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0303]

[0304] The above formula (47) is a formula (17) and the above formula (21) are used as examples to illustrate P 16×16For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (47) are not listed here one by one.

[0305] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0306]

[0307] The above formula (47) is a formula (18) and the above formula (21) are used as examples to illustrate P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (37) are not listed here one by one.

[0308] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0309]

[0310] The above formula (49) is a formula (19) and the above formula (21) are used as examples to illustrate P 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (37) are not listed here one by one.

[0311] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0312]

[0313] The above formula (50) is a formula (20) and a formula (21) for example. 16×16 For the sake of brevity, matrices obtained by any one or more of the three operations of cyclic shift, global inversion, and inversion in formula (37) are not listed here one by one.

[0314] In one possible implementation, P 12×12 The matrix can be shown as follows:

[0315]

[0316] The submatrix S in the above formula (51) is (n-1)×(n-1) This is the Hankel matrix.

[0317] In one possible implementation, P 16×16 The matrix can be shown as follows:

[0318]

[0319] The submatrix S in the above formula (52) (n-1)×(n-1) This is the Hankel matrix.

[0320] The following is an exemplary introduction to the R provided in the embodiments of the present application. n×n matrix.

[0321] In one possible implementation, R n×n The matrix can be shown as follows:

[0322]

[0323] Understandably, due to R n×n Each row of the matrix has the same elements, so for simplicity, the following formulas (54) to (83) only show the R n×n The first row of the matrix, but it should not be understood as a limitation of the embodiments of the present application.

[0324] In one possible implementation, R n×n The matrix can be shown as follows:

[0325] R 12×12 =[1 1 1 -1 1 -1 -1 -1 -1 -1 1] (54)

[0326] It is understood that for the elements of other rows not shown in formula (54), reference can be made to the elements of the first row shown. This description also applies to formulas (55) to (83) shown below, and for the sake of brevity, they will not be repeated below.

[0327] In one possible implementation, R n×n The matrix can be shown as follows:

[0328] R 12×12 =[1 1 1 1 -1 1 -1 -1 1 -1 -1 -1] (55)

[0329] In one possible implementation, R n×n The matrix can be shown as follows:

[0330] R 12×12 =[1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1] (56)

[0331] In one possible implementation, R n×n The matrix can be shown as follows:

[0332] R 12×12=[-1 1 1 1 -1 1 -1 -1 1 -1 -1 -1] (57)

[0333] In one possible implementation, R n×n The matrix can be shown as follows:

[0334] R 12×12 =[-1 -1 -1 1 -1 1 1 -1 1 1 1] (58)

[0335] In one possible implementation, R n×n The matrix can be shown as follows:

[0336] R 12×12 =[1 -1 -1 -1 1 -1 1 1 -1 1 1 1] (59)

[0337] In one possible implementation, R n×n The matrix can be shown as follows:

[0338] R 12×12 =[-1 -1 -1 1 -1 1 1 -1 1 1 -1] (60)

[0339] In one possible implementation, R n×n The matrix can be shown as follows:

[0340] R 12×12 =[-1 -1 -1 -1 1 -1 1 1 -1 1 1 1] (61)

[0341] In one possible implementation, R n×n The matrix can be shown as follows:

[0342] R 12×12 =[-1 -1 -1 1 -1 -1 1 -1 1 1 1] (62)

[0343] In one possible implementation, R n×n The matrix can be shown as follows:

[0344] R 12×12 =[1 -1 -1 -1 1 -1 -1 1 -1 1 1] (63)

[0345] In one possible implementation, R n×n The matrix can be shown as follows:

[0346] R 12×12=[-1 -1 -1 1 -1 -1 1 -1 1 1 -1] (64)

[0347] In one possible implementation, R n×n The matrix can be shown as follows:

[0348] R 12×12 =[-1 -1 -1 -1 1 -1 -1 1 -1 1 1] (65)

[0349] In one possible implementation, R n×n The matrix can be shown as follows:

[0350] R 16*16 =[1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1] (66)

[0351] In one possible implementation, R n×n The matrix can be shown as follows:

[0352] R 16*16 =[1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1] (67)

[0353] In one possible implementation, R n×n The matrix can be shown as follows:

[0354] R 16*16 =[1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1] (68)

[0355] In one possible implementation, R n×n The matrix can be shown as follows:

[0356] R 16*16 =[-1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1] (69)

[0357] In one possible implementation, R n×n The matrix can be shown as follows:

[0358] R 16*16 =[-1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1] (70)

[0359] In one possible implementation, R n×n The matrix can be shown as follows:

[0360] R 16*16 =[1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1] (71)

[0361] In one possible implementation, R n×n The matrix can be shown as follows:

[0362] R 16*16 =[-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 -1] (72)

[0363] In one possible implementation, R n×n The matrix can be shown as follows:

[0364] R 16*16 =[-1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1] (73)

[0365] In one possible implementation, R n×n The matrix can be shown as follows:

[0366] R 16*16 =[-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1] (74)

[0367] In one possible implementation, R n×n The matrix can be shown as follows:

[0368] R 16*16 =[1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] (75)

[0369] In one possible implementation, R n×n The matrix can be shown as follows:

[0370] R 16*16 =[-1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1] (76)

[0371] In one possible implementation, R n×n The matrix can be shown as follows:

[0372] R 16*16 =[-1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1] (77)

[0373] In one possible implementation, Rn×n The matrix can be shown as follows:

[0374] R 16*16 =[1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1] (78)

[0375] In one possible implementation, R n×n The matrix can be shown as follows:

[0376] R 16*16 =[-1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1] (79)

[0377] In one possible implementation, R n×n The matrix can be shown as follows:

[0378] R 16*16 =[1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1] (80)

[0379] In one possible implementation, R n×n The matrix can be shown as follows:

[0380] R 16*16 =[1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1] (81)

[0381] In one possible implementation, R n×n The matrix can be shown as follows:

[0382] R 12×12 =[1 1 -1 1 -1 -1 -1 -1 -1 1 1] (82)

[0383] In one possible implementation, R n×n The matrix can be shown as follows:

[0384] R 16×16 =[-1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 1] (83)

[0385] It is understood that the above formulas (53) to (83) are only exemplary examples of the R n×n matrix.

[0386] The following is an illustrative introduction to the first matrix provided in the embodiment of the present application.

[0387] It can be understood that for the first matrix equal to P shown aboven×n Matrix or R n×n The following is only an example of the first matrix equal to P n×n The overall inverse of the matrix; alternatively, the first matrix is ​​equal to P n×n The transpose of the matrix; alternatively, the first matrix is ​​equal to P n×n The transposed matrix of the matrix (also known as P n×n The transpose of a matrix (the global inverse of a matrix).

[0388] Exemplarily, taking formula (22) as an example, the first matrix can be shown as follows:

[0389]

[0390] In a possible implementation, the first matrix may be as follows:

[0391]

[0392] In a possible implementation, the first matrix may be as follows:

[0393]

[0394] The above formula (84) is illustrated by taking the overall inversion of formula (22) as an example, the above formula (85) is illustrated by taking the transposed matrix of formula (22) as an example, and the above formula (86) is illustrated by taking the transposed matrix of the overall inversion matrix of formula (22) (it can also be understood as taking the overall inversion of the transposed matrix of formula (22)) as an example.

[0395] Exemplarily, taking formula (35) as an example, the first matrix can be shown as follows:

[0396]

[0397] In a possible implementation, the first matrix may be as follows:

[0398]

[0399] In a possible implementation, the first matrix may be as follows:

[0400]

[0401] The above formula (88) is illustrated by taking the overall inversion of formula (35) as an example, the above formula (87) is illustrated by taking the transposed matrix of formula (35) as an example, and the above formula (89) is the transposed matrix of the overall inversion matrix of formula (35) (it can also be understood as being illustrated by taking the overall inversion of the transposed matrix of formula (35) as an example.

[0402] It is understandable that the matrices shown above are merely examples and should not be construed as limitations on the embodiments of the present application.

[0403] The following is an introduction to the communication device provided in the embodiments of the present application.

[0404] The present application divides the functional modules of the communication device according to the above method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or software functional modules. It should be noted that the division of modules in the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. Figures 5 to 7 The communication device according to the embodiment of the present application is described in detail.

[0405] Figure 5 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application, such as Figure 5 As shown, the communication device includes a processing unit 501 and a transceiver unit 502 .

[0406] In some embodiments of the present application, the communication device may be the receiving device shown above or a chip in the receiving device, etc. That is, the communication device may be used to execute the steps or functions executed by the receiving device in the above method embodiments.

[0407] For example, the transceiver unit 502 is configured to input a PPDU, the PPDU includes a preamble, the preamble includes a long training field LTF, and the LTF includes a plurality of LTF symbols;

[0408] The processing unit 501 is configured to: Processing the signal received from multiple LTF symbols, the first matrix P n×n Matrix, or, the first matrix According to P n×n The matrix is ​​obtained, and I is the identity matrix, P n×n The matrix consists of n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, n is an integer greater than 8, and k is used to represent the k-th subcarrier in each LTF symbol in multiple LTF symbols.

[0409] It can be understood that the transceiver unit 502, used for inputting the PPDU, includes: the transceiver unit 502, used for receiving the PPDU sent from the transmitting end device.

[0410] In the embodiment of the present application, regarding PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n Matrix or R n×n The description of the matrix can also refer to the above method embodiments (including Figure 4b ) are introduced in detail here.

[0411] It is understandable that the specific description of the transceiver unit and the processing unit shown in the embodiment of the present application is only an example. For the specific functions or execution steps of the transceiver unit and the processing unit, reference can be made to the above method embodiment, which will not be described in detail here. Figure 4a In the receiving step of step 402 shown in FIG. 1 , the processing unit 501 may also be used to perform Figure 4a Step 403 is shown.

[0412] Reuse Figure 5 In some other embodiments of the present application, the communication device may be the transmitting end device shown above or a chip in the transmitting end device, etc. That is, the communication device may be used to execute the steps or functions executed by the transmitting end device in the above method embodiment, etc.

[0413] For example, the processing unit 501 is used to determine to generate a PPDU; the transceiver unit 502 is used to output the PPDU.

[0414] It can be understood that the transceiver unit 502, used to output the PPDU includes: the transceiver unit 502, used to send the PPDU to the receiving end device.

[0415] In the embodiment of the present application, regarding PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n Matrix or R n×n The description of the matrix can also refer to the above method embodiments (including Figure 4b ) are introduced in detail here.

[0416] It is understandable that the specific description of the transceiver unit and the processing unit shown in the embodiment of the present application is only an example. For the specific functions or execution steps of the transceiver unit and the processing unit, reference can be made to the above method embodiment, which will not be described in detail here. Figure 4a In step 401 shown in FIG. 4 , the transceiver unit 502 may also be used to perform Figure 4a The sending step in step 402 is shown.

[0417] Exemplarily, the processing unit 501 provided in the embodiment of the present application may also include a pilot subcarrier processing component and a data subcarrier processing component. For example, when the communication device is a receiving end device, the receiving end device may perform phase tracking and / or frequency offset estimation through the pilot subcarrier processing component, and may also perform channel estimation through the data subcarrier processing component.

[0418] The above describes the transmitting device and receiving device of the embodiment of the present application. The following describes possible product forms of the transmitting device and receiving device. Figure 5 Any product having the functions of the transmitting device described above, or any product having the functions of the transmitting device described above Figure 5 Any form of product with the functions of the receiving end device described above falls within the protection scope of the embodiments of the present application. It should also be understood that the following description is only an example and does not limit the product forms of the transmitting end device and the receiving end device of the embodiments of the present application to this.

[0419] In one possible implementation, Figure 5 In the communication device shown, the processing unit 501 may be one or more processors, the transceiver unit 502 may be a transceiver, or the transceiver unit 502 may also be a sending unit and a receiving unit, the sending unit may be a transmitter, the receiving unit may be a receiver, and the sending unit and the receiving unit are integrated into one device, such as a transceiver. In the embodiment of the present application, the processor and the transceiver may be coupled, etc., and the embodiment of the present application does not limit the connection method between the processor and the transceiver.

[0420] like Figure 6 As shown, the communication device 60 includes one or more processors 620 and a transceiver 610 .

[0421] Exemplarily, when the communication device is used to execute the steps, methods or functions executed by the above-mentioned receiving device, the transceiver 610 is used to receive the PPDU from the sending device; the processor 620 is used to receive the PPDU from the sending device according to the first matrix Process the signal received over multiple LTF symbols.

[0422] Exemplarily, when the communication device is used to execute the steps, methods or functions performed by the above-mentioned transmitting device, the processor 620 is used to generate a PPDU; and the transceiver 610 is used to send the PPDU to the receiving device.

[0423] In the embodiment of the present application, regarding PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n Matrix or R n×n The description of the matrix can also refer to the above method embodiments (including Figure 4b ) are introduced in detail here.

[0424] It is understood that for the specific description of the processor and transceiver, please refer to Figure 5 The description of the processing unit and the transceiver unit shown will not be repeated here.

[0425] exist Figure 6 In various implementations of the communication device shown, the transceiver may include a receiver and a transmitter, wherein the receiver is used to perform a receiving function (or operation) and the transmitter is used to perform a transmitting function (or operation). The transceiver is used to communicate with other devices / devices through a transmission medium.

[0426] Optionally, the communication device 60 may also include one or more memories 630 for storing program instructions and / or data. The memory 630 is coupled to the processor 620. The coupling in the embodiment of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms, and is used for information exchange between devices, units or modules. The processor 620 may operate in conjunction with the memory 630. The processor 620 may execute program instructions stored in the memory 630. Optionally, at least one of the one or more memories may be included in the processor. In the embodiment of the present application, the memory 630 may store any one or more of the first vector x, the second vector y, the third vector x' or the fourth vector y'. Exemplarily, Figure 6 The memory shown only shows the first vector x and the second vector y for example. It can be understood that Figure 6 The reason why dotted lines are used to indicate that the first vector x and the second vector y are stored in the memory is that the memory may store only the first vector x, may store only the second vector y, or may store both the first vector x and the second vector y.

[0427] Therefore, the communication device (such as a transmitting device or a receiving device) only needs to store the first vector x or the second vector y to obtain the entire P n×n matrix, effectively saving the storage space of the communication device and reducing the time required to restore P n×n The complexity of the matrix.

[0428] The specific connection medium between the transceiver 610, the processor 620 and the memory 630 is not limited in the embodiment of the present application. Figure 6 The memory 630, the processor 620 and the transceiver 610 are connected via a bus 650. Figure 6 The connections between the other components are shown in bold lines, which are only for illustration and are not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0429] In the embodiments of the present application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor, etc.

[0430] In the embodiment of the present application, the memory may include, but is not limited to, non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), a random access memory (RAM), an erasable programmable read-only memory (EPROM), a read-only memory (ROM) or a portable read-only memory (CD-ROM), etc. The memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures and can be read and / or written by a computer (such as a communication device shown in the present application), but is not limited thereto. The memory in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0431] The processor 620 is mainly used to process the communication protocol and communication data, and to control the entire communication device, execute the software program, and process the data of the software program. The memory 630 is mainly used to store the software program and data. The transceiver 610 may include a control circuit and an antenna. The control circuit is mainly used to convert the baseband signal and the radio frequency signal and process the radio frequency signal. The antenna is mainly used to send and receive radio frequency signals in the form of electromagnetic waves. The input and output devices, such as a touch screen, a display screen, a keyboard, etc., are mainly used to receive data input by the user and output data to the user.

[0432] When the communication device is turned on, the processor 620 can read the software program in the memory 630, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be sent wirelessly, the processor 620 performs baseband processing on the data to be sent, and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then sends the radio frequency signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 620. The processor 620 converts the baseband signal into data and processes the data.

[0433] In another implementation, the RF circuit and antenna may be arranged independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna may be arranged remotely from the communication device.

[0434] It is understandable that the communication device shown in the embodiment of the present application may also have Figure 6 The embodiments of the present application do not limit the number of components and the like. The methods executed by the processor and the transceiver shown above are only examples, and the specific steps executed by the processor and the transceiver can refer to the methods described above.

[0435] In another possible implementation, Figure 5 In the communication device shown, the processing unit 501 may be one or more logic circuits, and the transceiver unit 502 may be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver unit 502 may be a sending unit and a receiving unit, the sending unit may be an output interface, the receiving unit may be an input interface, and the sending unit and the receiving unit may be integrated into one unit, such as an input / output interface. Figure 7 As shown, Figure 7 The communication device shown includes a logic circuit 701 and an interface 702. That is, the processing unit 501 can be implemented by the logic circuit 701, and the transceiver unit 902 can be implemented by the interface 702. The logic circuit 701 can be a chip, a processing circuit, an integrated circuit or a system on chip (SoC) chip, etc., and the interface 702 can be a communication interface, an input / output interface, a pin, etc. For example, Figure 7 The above communication device is taken as an example as a chip, and the chip includes a logic circuit 701 and an interface 702 .

[0436] In the embodiment of the present application, the logic circuit and the interface may also be coupled to each other. The embodiment of the present application does not limit the specific connection method between the logic circuit and the interface.

[0437] Exemplarily, when the communication device is used to execute the method, function or step executed by the above-mentioned receiving device, the interface 702 is used to input the PPDU; the logic circuit 701 is used to receive the PPDU according to the first matrix Process the signal received over multiple LTF symbols.

[0438] Exemplarily, when the communication device is used to execute the method, function or step performed by the above-mentioned transmitting end device, the logic circuit 701 is used to generate a PPDU; and the interface 702 is used to output the PPDU.

[0439] Optionally, the communication device further includes a memory 703, which can be used to store any one or more of the first vector x, the second vector y, the third vector x' or the fourth vector y'. Exemplarily, Figure 7 The memory shown only shows the first vector x and the second vector y for example. It can be understood that Figure 7 The reason why dotted lines are used to indicate that the first vector x and the second vector y are stored in the memory is that the memory may store only the first vector x, may store only the second vector y, or may store both the first vector x and the second vector y.

[0440] Therefore, the communication device (such as a transmitting device or a receiving device) only needs to store the first vector x or the second vector y to obtain the entire P n×n matrix, effectively saving the storage space of the communication device and reducing the time required to restore P n×n The complexity of the matrix.

[0441] It can be understood that the communication device shown in the embodiment of the present application can implement the method provided in the embodiment of the present application in the form of hardware, or can implement the method provided in the embodiment of the present application in the form of software, etc., and the embodiment of the present application is not limited to this.

[0442] In the embodiment of the present application, regarding PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n Matrix or R n×n The description of the matrix can also refer to the above method embodiments (including Figure 4b ) are introduced in detail here.

[0443] for Figure 7 The specific implementation methods of the various embodiments shown can also refer to the above embodiments, which will not be described in detail here.

[0444] The present application also provides a wireless communication system, which includes a transmitting end device and a receiving end device. The transmitting end device and the receiving end device can be used to execute any of the above embodiments (such as Figure 4a ) in the method.

[0445] In addition, the present application also provides a computer program, which is used to implement the operations and / or processing performed by the sending end device in the method provided by the present application.

[0446] The present application also provides a computer program, which is used to implement the operations and / or processing performed by a receiving device in the method provided by the present application.

[0447] The present application also provides a computer-readable storage medium, in which computer code is stored. When the computer code is executed on a computer, the computer executes the operations and / or processing performed by the sending device in the method provided in the present application.

[0448] The present application also provides a computer-readable storage medium, in which computer code is stored. When the computer code is executed on a computer, the computer executes the operations and / or processing performed by the receiving device in the method provided in the present application.

[0449] The present application also provides a computer program product, which includes a computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processing performed by the sending device in the method provided by the present application are executed.

[0450] The present application also provides a computer program product, which includes a computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processing performed by the receiving device in the method provided by the present application are executed.

[0451] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or it can be an electrical, mechanical or other form of connection.

[0452] The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the technical effects of the solutions provided in the embodiments of the present application.

[0453] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0454] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or partly contributed to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a readable storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned readable storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program code.

[0455] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A signal processing method, characterized in that: The method comprises: receiving a physical layer protocol data unit PPDU, wherein the PPDU includes a preamble, wherein the preamble includes a long training field LTF, and wherein the LTF includes a plurality of LTF symbols; According to the first matrix Processing the signals received from the plurality of LTF symbols, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, wherein n is an integer greater than 8, and k is used to represent the The k-th subcarrier in each LTF symbol in a plurality of LTF symbols; in the case of n=12, or or or or Or in the case of n=16, or or 2. A signal processing method, characterized in that: The method comprises: Generate a physical layer protocol data unit PPDU, the PPDU includes a preamble, the preamble includes a long training field LTF, the LTF includes a plurality of LTF symbols, the plurality of LTF symbols are used to carry The obtained sequence, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, wherein n is an integer greater than 8, and k is used to represent the k-th subcarrier in each LTF symbol in the plurality of LTF symbols; when n=12, or or or or Or in the case of n=16, or or The PPDU is sent.

3. The method according to claim 1 or 2, characterized in that: The first matrix The following conditions must be met: Among them, the R n×n The matrix includes n rows and n columns, and the R n×n Each row of the matrix is ​​equal to the P n×n The first row in the matrix.

4. The method according to claim 3, characterized in that When the kth subcarrier is a non-pilot subcarrier, the first matrix is ​​equal to the P n×n The global inverse of a matrix; or The first matrix is ​​equal to the P n×n The transpose of a matrix; or The first matrix is ​​equal to the P n×n The transpose of the matrix's global inverse; or The first matrix is ​​equal to the P n×n The transpose of a matrix is ​​the global inverse of the matrix.

5. The method according to claim 3, characterized in that: The R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation. n×n The matrix is ​​used for channel estimation.

6. A communication device, characterized in that: The communication device comprises: A transceiver unit, configured to receive a physical layer protocol data unit PPDU, wherein the PPDU includes a preamble, wherein the preamble includes a long training field LTF, and wherein the LTF includes a plurality of LTF symbols; A processing unit for Processing the signals received from the plurality of LTF symbols, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, wherein n is an integer greater than 8, and k is used to represent the k-th subcarrier in each LTF symbol in the plurality of LTF symbols; when n=12, or or or or Or in the case of n=16, or or 7. A communication device, characterized in that: The communication device comprises: A processing unit is used to generate a physical layer protocol data unit PPDU, wherein the PPDU includes a preamble, the preamble includes a long training field LTF, the LTF includes a plurality of LTF symbols, and the plurality of LTF symbols are used to carry The obtained sequence, the first matrix P n×n matrix, or the first matrix According to the P n×n The matrix is ​​obtained, and The I is the identity matrix, the P n×n The matrix includes n rows and n columns. The matrix is ​​the P n×n The transposed matrix of the matrix, wherein n is an integer greater than 8, and k is used to represent the k-th subcarrier in each LTF symbol in the plurality of LTF symbols; when n=12, or or or or or When n=16, or or The transceiver unit is used to send the PPDU.

8. The communication device according to claim 6 or 7, characterized in that: The first matrix The following conditions must be met: Among them, the R n×n The matrix includes n rows and n columns, and the R n×n Each row of the matrix is ​​equal to the P n×n The first row in the matrix.

9. The communication device according to claim 8, characterized in that: When the kth subcarrier is a non-pilot subcarrier, the first matrix is ​​equal to the P n×n The global inverse of a matrix; or The first matrix is ​​equal to the P n×n The transpose of a matrix; or The first matrix is ​​equal to the P n×n The transpose of the matrix's global inverse; or The first matrix is ​​equal to the P n×n The transpose of a matrix is ​​the global inverse of the matrix.

10. The communication device according to claim 8, characterized in that: The R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation. n×n The matrix is ​​used for channel estimation.

11. A communication device, characterized in that: including a processor and a memory; The processor is used to store computer-executable instructions; The processor is used to execute the computer-executable instructions so that the method according to any one of claims 1 to 5 is performed.

12. A communication device, characterized in that: comprising a logic circuit and an interface, wherein the logic circuit and the interface are coupled; The interface is used to input and / or output code instructions, and the logic circuit is used to execute the code instructions so that the method described in any one of claims 1 to 5 is executed.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium is used to store a computer program. When the computer program is executed, the method according to any one of claims 1 to 5 is executed.