Signal processing method and apparatus

Abstract

To provide a signal processing method and apparatus.SOLUTION: A method of the present invention includes: a step of a transmitting device generating a PPDU, where the PPDU includes a preamble, where the preamble includes a LTF, where the LTF includes a plurality of LTF symbols, where the plurality of LTF symbols can be used to carry a sequence obtained according to a first matrix; and a step of then transmitting the PPDU. Correspondingly, a receiving device receives the PPDU, and then processes the received signal on 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, where Pn×n×PTn×n=n×I, I is an identity matrix, the Pn×n matrix includes n rows and n columns, the PTn×n matrix is a transposed matrix of the Pn×n matrix, where n is an integer greater than 8. According to the method provided in the present application, channel estimation of more than 8 spatial streams can be implemented.SELECTED DRAWING: Figure 4a

Description

Technical Field

[0001] This application claims priority to Chinese Patent Application No. 202011453555.3, filed with the China National Intellectual Property Administration on December 11, 2020, entitled "SIGNAL PROCESSING METHOD AND APPARATUS", which is incorporated herein by reference in its entirety.

[0002] This application relates to the field of communication technologies, and in particular, to signal processing methods and apparatuses.

Background Art

[0003] The physical (PHY) layer protocol data unit (PPDU) is defined in the wireless local area network (WLAN) standard that uses OFDM technology as the core technology. The PPDU may include a preamble, and the preamble may include a long training field (LTF). The LTF can be used to assist the receiving end in performing channel estimation and the like in order to obtain the received data information.

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

Summary of the Invention

Means for Solving the Problems

[0005] This application provides a signal processing method and apparatus. Signals received with multiple LTF symbols and more than eight spatial streams can be processed according to the P n×n matrix.

[0006] According to the first aspect, an embodiment of the present application provides a signal processing method. The method includes receiving a physical (PHY) layer protocol data unit (PPDU), where the PPDU includes a preamble, the preamble includes a long training field (LTF), and the LTF includes a plurality of LTF symbols; and processing the signals received in the plurality of LTF symbols according to a first matrix

Number

Number

Number

Number

Number

[0007] The method provided in this embodiment of the present application can be applied to a communication device. For example, the communication device may be a receiving device, and the receiving device is a device configured to receive a PPDU.

[0008] According to the method provided in this embodiment of the present application, the receiving device can perform channel estimation for more than 8 streams. For example, the receiving device can support MIMO channel estimation of up to 16 streams. In addition, the P n×n matrix provided in the present application can be further adapted to requirements of different numbers of streams. Therefore, the receiving device can perform MIMO channel estimation (such as phase tracking) of 12 streams (or less than 12 streams), 16 streams (or less than 16 streams), etc. In addition, the P n×n matrix provided in the present application can further perform MIMO channel estimation of 4 streams, 8 streams, etc. In another example, the receiving device can support MIMO channel estimation of up to 32 streams (or 24 streams). This is not limited in this embodiment of the present application.

[0009] By using one P n×n matrix, MIMO channel estimation of a plurality of different numbers of streams can be performed, and the redundancy of MIMO channel estimation can be effectively reduced. In other words, the receiving device can simultaneously process a plurality of LTF symbols and signals received with more than 8 spatial streams according to the P n×n matrix.

[0010] According to a second aspect, an embodiment of the present application provides a signal processing method. The method includes a step of generating a physical layer protocol data unit PPDU, where 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 carry a sequence obtained according to a first matrix

Number

Number

Mathematics

Mathematics

Mathematics

[0011] In relation to the first aspect or the second aspect, in one possible embodiment,

Mathematics

Mathematics

Mathematics

Mathematics

[0012] In this embodiment of the present application, it can be guaranteed that the P n×n matrix is an orthogonal matrix and the submatrix S (n-1)×(n-1) is a circulant matrix or a Hankel matrix. Thereby, Pn×n The space occupied by the matrix can be reduced, memory space can be saved, and the complexity of the implementation of the communication device can be effectively reduced.

[0013] In one possible implementation related to the first aspect or the second aspect, S (n-1)×(n-1) The matrix is a circulant matrix or a Hankel matrix.

[0014] In this embodiment of the present application, P n×n The submatrix S of the matrix (n-1)×(n-1) is set to a circulant matrix or a Hankel matrix, and the communication device can restore the submatrix only by storing the vector of the first row or the first column of the submatrix S. (n-1)×(n-1) Thereby, the memory space of the communication device can be effectively saved, and the implementation complexity can be reduced.

[0015] In one possible implementation related to the first aspect or the second aspect, S (n-1)×(n-1 ) The first row of the matrix is equal to the first vector x, where x = [1 1 1 -1 1 -1 -1 1 -1 -1 -1], and S (n-1)×(n-1) The first row of the matrix is obtained by performing one or more of the three operations of circular shift, inversion, and all negation on the first vector x, where x = [1 1 1 -1 1 -1 -1 1 -1 -1 -1], and S (n-1)×(n-1) The first row of the matrix is equal to the second vector y, where y = [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1], or S (n-1)×(n-1) The first row of the matrix is obtained by performing one or more of the three operations of circular shift, inversion, and all negation on the second vector y, where y = [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1].

[0016] The communication device can obtain P n×n The submatrix S of the matrix (n-1)×(n-1) after obtaining the first row of, and then obtain S (n-1)×(n-1) . Therefore, the communication device can obtain the submatrix to restore P n×nSub - matrix S of the matrix (n-1)×(n-1) It is only necessary to remember the rows. Alternatively, when the relationship between the rows of the sub - matrix and the first vector or the second vector is determined, the communication device can restore the sub - matrix by only remembering the first vector or the second vector. Thereby, P n×n The space occupied by the matrix can be reduced, memory space can be saved, and the complexity of the implementation of the communication device can be effectively reduced (for example, P n×n Sub - matrix S of the matrix (n-1)×(n-1) can be restored based on operations such as circular shift).

[0017] In relation to the first aspect or the second aspect, in one possible implementation, when n = 16,

Number

Number

Number

Number

Number

[0018] In this embodiment of the present application, the P 8×8 matrix is extended to generate a P 16×16 matrix. This can ensure that the communication device supports the transmission of 16 - stream data and avoid overly complex operations.

[0019] In relation to the first aspect or the second aspect, in one possible implementation, the first matrix

Number

Number

[0020] R n×n The matrix includes n rows and n columns, and R n×n Each row of the matrix is P n×n Equal to the first row of the matrix.

[0021] In relation to the first aspect or the second aspect, in one possible implementation, when the k-th subcarrier is a non-pilot subcarrier, the first matrix is P n×n Equal to the all-negation matrix of the matrix, the first matrix is P n×n Equal to the transpose matrix of the matrix, the first matrix is P n×n Equal to the transpose matrix of the all-negation matrix of the matrix, or the first matrix is P n×n Equal to the all-negation matrix of the transpose matrix of the matrix.

[0022] In relation to the first aspect or the second aspect, in one possible implementation, R n×n The matrix is used for phase tracking and / or frequency offset estimation, and P n×n The matrix is used for channel estimation.

[0023] In this embodiment of the present application, P n×n For the specific descriptions of matrices such as matrix, E n×n Matrix, the first matrix, etc., please refer to the examples shown below. Details are not described here.

[0024] According to the third aspect, an embodiment of the present application provides a communication device configured to execute the method in any one of the first aspect or possible implementations of the first aspect. The communication device includes a corresponding unit configured to execute the method in any one of the first aspect or possible implementations of the first aspect.

[0025] For example, the communication device may be a transmitting device, a chip in the transmitting device, etc.

[0026] According to a fourth aspect, an embodiment of the present application provides a communication device configured to execute the method in any one of the second aspect or possible embodiments of the second aspect. The communication device includes a corresponding unit configured to execute the method in any one of the second aspect or possible embodiments of the second aspect.

[0027] For example, the communication device may be a receiving device, a chip in the receiving device, etc.

[0028] In the third aspect or the fourth aspect, the communication device may include a transceiver unit and a processing unit. For specific descriptions of the transceiver unit and the processing unit, please refer to the embodiments of the device shown below.

[0029] According to a fifth aspect, an embodiment of the present application provides a communication device. The communication device includes a processor configured to execute the method in any one of the first aspect or possible embodiments of the first aspect. Alternatively, the processor is configured to execute a program stored in a memory. When the program is executed, the method in any one of the first aspect or possible embodiments of the first aspect is executed.

[0030] When the method is executed, the process of receiving information (e.g., PPDU) in this method can be understood as the process of the processor receiving input information. When the processor receives the input information, the transceiver receives the information and inputs the information to the processor. Further, after the transceiver receives the information and before the information is input to the processor, other processing may need to be performed on the information.

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

[0032] Unless otherwise specified, operations such as transmission, sending, and receiving related to a processor may be more generally understood as operations such as output, reception, and input of the processor, provided that the operations do not conflict with the actual functions or internal logic of the operations in the related descriptions.

[0033] In an implementation process, the processor may be a processor specially configured to execute these methods, or may be a processor that executes computer instructions in a memory to execute these methods, such as a general-purpose processor. The memory may be a non-transitory memory, such as a Read Only Memory (ROM). The memory and the processor may be integrated on the same chip, or may be separately arranged on different chips. The type of the memory and the way of arranging the memory and the processor are not limited in this embodiment of the present application. It should be understood that the description of the processor and the memory is also applicable to the sixth aspect shown below. For the sake of simplicity of description, the details will not be described again in the sixth aspect.

[0034] In one possible implementation, the memory is located outside the communication device.

[0035] In one possible implementation, the memory is located inside the communication device.

[0036] In this embodiment of the present application, the processor and the memory may alternatively be integrated into one component. In other words, the processor and the memory may alternatively be integrated. It should be understood that the memory in this embodiment of the present application may be configured to store one or more of the first vector x, the second vector y, the third vector x', the fourth vector y', and the like.

[0037] In one possible implementation, the communication device further includes a transceiver. The transceiver is configured to receive or transmit signals. For example, the transceiver may be further configured to receive a PPDU or the like.

[0038] In this embodiment of the present application, the communication device may be a transmitting device, a chip in the transmitting device, or the like.

[0039] According to a sixth aspect, an embodiment of the present application provides a communication device. The communication device includes a processor configured to execute the method in any one of the second aspect or the possible embodiments of the second aspect. Alternatively, the processor is configured to execute a program stored in a memory. When the program is executed, the method in any one of the second aspect or the possible embodiments of the second aspect is executed.

[0040] In one possible embodiment, the memory is located outside the communication device.

[0041] In one possible embodiment, the memory is located inside the communication device.

[0042] In this embodiment of the present application, the processor and the memory may alternatively be integrated into one component. In other words, the processor and the memory may alternatively be integrated. It will be understood that the memory in this embodiment of the present application may be configured to store one or more of the first vector x, the second vector y, the third vector x', the fourth vector y', etc.

[0043] In one possible embodiment, the communication device further includes a transceiver. The transceiver is configured to receive or transmit signals. For example, the transceiver may be configured to transmit a PPDU.

[0044] In this embodiment of the present application, the communication device may be a receiving device, a chip in the receiving device, or the like.

[0045] According to a seventh aspect, an embodiment of the present application provides a communication device. The communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface. The interface is configured to input a PPDU, and the logic circuit is configured to process a signal received with a plurality of LTF symbols according to a first matrix

Number

[0046] Optionally, the communication device further includes a memory. The memory is configured to store one or more of a first vector x, a second vector y, a third vector x', a fourth vector y', etc.

[0047] For descriptions of LTF symbols, the first matrix, P n×n matrix, R n×n matrix, etc., reference may be made to the description of the first aspect or the second aspect, or the descriptions of various embodiments shown below. Details are not described again here.

[0048] According to an eighth aspect, an embodiment of the present application provides a communication device. The communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface. The logic circuit is configured to generate a PPDU. The interface is configured to output the PPDU.

[0049] For descriptions of LTF symbols, the first matrix, P n×n matrix, R n×n matrix, etc., reference may be made to the description of the first aspect or the second aspect, or the descriptions of various embodiments shown below. Details are not described again here.

[0050] According to a ninth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program, and when the computer program is executed on a computer, the method according to any one of the first aspect or possible embodiments of the first aspect is executed.

[0051] According to a tenth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program, and when the computer program is executed on a computer, the method according to any one of the second aspect or possible embodiments of the second aspect is executed.

[0052] According to an eleventh aspect, an embodiment of the present application provides a computer program product. The computer program product includes a computer program or computer code, and when the computer program product is executed on a computer, the method according to any one of the first aspect or possible embodiments of the first aspect is executed.

[0053] According to a twelfth aspect, an embodiment of the present application provides a computer program product. The computer program product includes a computer program or computer code, and when the computer program product is executed on a computer, the method according to any one of the second aspect or possible embodiments of the second aspect is executed.

[0054] According to a thirteenth aspect, an embodiment of the present application provides a computer program. When the computer program is executed on a computer, the method according to any one of the first aspect or possible embodiments of the first aspect is executed.

[0055] According to a 14th aspect, one embodiment in the present application provides a computer program. When the computer program is executed on a computer, a method in either the 2nd aspect or any one of the possible embodiments of the 2nd aspect is executed.

[0056] According to a 15th aspect, one embodiment of the present application provides a wireless communication system. The wireless communication system includes a transmission device and a reception device. The transmission device is configured to execute a method in either the 1st aspect or any one of the possible embodiments of the 1st aspect. The reception device is configured to execute a method in either the 2nd aspect or any one of the possible embodiments of the 2nd aspect.

Brief Description of the Drawings

[0057]

Figure 1

Figure 2

Figure 3a

Figure 3b

Figure 4a

Figure 4b

Figure 5

Figure 6

Figure 7

Modes for Carrying Out the Invention

[0058] To make the objectives, technical solutions, and advantages of this application clearer, the following further describes this application with reference to the accompanying drawings.

[0059] In the description, claims, and accompanying drawings of this application, terms such as "first" and "second" are merely for distinguishing different objects and do not describe a specific order. Furthermore, "including", "having", or any other variation thereof is intended to cover non-exclusive inclusion. 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, and optionally further includes steps or units not listed, and optionally further includes other steps or units specific to the process, method, product, or device.

[0060] As used herein, "embodiment" means that the specific characteristics, structures, or features described with reference to the embodiment can be included in at least one embodiment of this application. The phrases shown in various places in this specification do not necessarily refer to the same embodiment, nor are they exclusive, independent, or optional embodiments distinct from other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0061] In this application, "at least one component (item)" means one or more, "a plurality of" means two or more, and "at least two components (items)" means two, three, or more. The term "and / or" is used to describe the association relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent the following three cases, namely, the case where only A exists, the case where only B exists, and the case where both A and B exist, and A and B can be singular or plural. The symbol " / " usually indicates the "or" relationship between related objects. "At least one of the following items (components)" or a similar expression means any combination of these items. For example, at least one (component) of a, b, or c can represent a, b, c, a and b, a and c, b and c, or a, b, and c.

[0062] The method provided in this application can be applied to various communication systems, such as the Internet of Things (IoT) system, the narrow band Internet of Things (NB-IoT) system, the Long Term Evolution (LTE) system, the 5th-generation (5G) communication system, and new communication systems emerging in future communication development (e.g., 6G). The method provided in this application can be further applied to a wireless local area network (WLAN) system, such as wireless fidelity (Wi-Fi).

[0063] The method provided in this application can be implemented by a communication device in a wireless communication system. For example, the communication device may be an access point (AP) device or a station (STA) device. As another example, the communication device may alternatively be a wireless communication device that supports simultaneous transmission on multiple links. For example, the communication device may be referred to as a multi-link device (MLD) or a multi-band device.

[0064] The method provided in this application may be applicable to a scenario where one node performs data transmission with one or more nodes, or may be applicable to single-user uplink / downlink transmission or multi-user uplink / downlink transmission, or may be applicable to device-to-device (D2D) transmission. Details are not described here. The node can be an AP or an STA. For ease of explanation, hereinafter, communication between an AP and an STA is used as an example for the explanation.

[0065] For example, a communication system to which the method provided in this application can be applied may include an access point (AP) device and a station (STA) device. The access point device may also be understood as an access point entity, and the station device may also be understood as a station entity. For example, this application is applicable to a scenario where an AP communicates with STAs within a WLAN. Optionally, the AP may communicate with a single STA, or the AP may communicate with multiple STAs simultaneously. Specifically, the communication between the AP and multiple STAs can be further classified into a downlink transmission in which the AP simultaneously transmits signals to multiple STAs and an uplink transmission in which multiple STAs transmit signals to the AP. The AP and STA may support a WLAN communication protocol. The communication protocol may include the IEEE802.11be (also called Wi-Fi7 or EHT protocol), and may further include protocols such as the IEEE802.11ax protocol and the IEEE802.11ac protocol. It is obvious that with the continuous evolution and development of communication technologies, the communication protocol may further include the next-generation protocol of IEEE802.11be and the like.

[0066] FIG. 1 is a schematic diagram of the architecture of a communication system according to an embodiment of the present application. The communication system may include one or more APs and one or more STAs. FIG. 1 shows one access point device, for example, an AP, and three station devices, for example, STA1, STA2, and STA3. It will be understood that FIG. 1 shows only one AP and three STAs as an example. However, more or fewer APs or STAs may exist. This is not limited in this application.

[0067] An access point (e.g., the AP in FIG. 1) is a device with a wireless communication function, supports communication according to the WLAN protocol, and has the function of communicating with other devices (e.g., a station or another access point) in the WLAN. It is obvious that the access point may further have the function of communicating with another device. Alternatively, the access point corresponds to a bridge that connects a wired network and a wireless network. The main function of the access point is to connect various wireless network clients together and then connect the wireless network to Ethernet. In a WLAN system, the access point may sometimes be called an access point station (AP STA). The device with a wireless communication function may be the entire device or a chip or processing system installed in the entire device. The device in which the chip or processing system is installed may implement the methods and functions in the embodiments of the present application under the control of the chip or processing system. The AP in this embodiment of the present application is a device that provides services to the STA and may support the 802.11 series protocol. For example, the access point may be an access point for a terminal device (e.g., a mobile phone) to access a wired (or wireless) network and is mainly deployed in homes, buildings, and parks. The typical coverage radius is from dozens of meters to more than 100 meters. It is obvious that the access point may alternatively be deployed outdoors. In another example, the AP may be a communication entity, such as a communication server, router, switch, or bridge, or the AP may include various forms of macro base stations, micro base stations, relay stations, etc. It is obvious that the AP may alternatively be a chip or processing system in these devices in various forms to implement the methods and functions in the embodiments of the present application. The access point in the present application may be a high efficient (HE) AP, an extremely high throughput (EHT) AP, or an access point applicable to future WiFi standards.

[0068] A station (e.g., STA1, STA2 in FIG. 1, etc.) is a device with a wireless communication function, supports communication according to the WLAN protocol, and has the function of communicating with other stations or access points in the WLAN. In a WLAN system, a station may be called a non-access point station (non-AP STA). For example, a STA is any user communication device that enables a user to communicate with an AP and then with the WLAN. The device with the wireless communication function may be the entire device, or a chip or processing system installed in the entire device. The device in which the chip or processing system is installed may implement the methods and functions in the embodiments of the present application under the control of the chip or processing system. For example, the station may be a wireless communication chip, a wireless sensor, or a wireless communication terminal, and may also be called a user. In another example, the station may be a mobile phone supporting the WiFi communication function, a tablet computer supporting the WiFi communication function, a set-top box supporting the WiFi communication function, a smart TV supporting the WiFi communication function, an intelligent wearable device supporting the WiFi communication function, an in-vehicle communication device supporting the WiFi communication function, or a computer supporting the WiFi communication function.

[0069] A WLAN system can provide high-speed and low-latency transmission. With the continuous development of WLAN application scenarios, WLAN systems will be applied to more scenarios or industries, such as the Internet of Things industry, the Internet of Vehicles industry, the banking industry, corporate offices, stadium exhibition halls, concert halls, hotel rooms, dormitories, hospital wards, classrooms, supermarkets, squares, streets, production workshops, and warehouse storage. Devices that support WLAN communication (such as access points or stations) include sensor nodes in smart cities (such as smart water meters, smart electricity meters, or smart air detection nodes), smart devices in smart homes (such as smart cameras, projectors, displays, TVs, stereos, refrigerators, or washing machines), nodes in the Internet of Things, entertainment terminals (such as AR, VR, or other wearable devices), smart devices in smart offices (such as printers, projectors, speakers, or stereos), Internet of Vehicles devices in the Internet of Vehicles, infrastructure in daily life scenarios (such as vending machines, self-service navigation stations in supermarkets, self-service cash register devices, or self-service ordering machines), devices in large-scale sports and concert venues, etc. For example, access points and stations may be devices applied to the Internet of Vehicles, Internet of Things nodes or sensors in the Internet of Things (IoT), smart cameras, smart remote controls, and smart water meters in smart homes, as well as sensors in smart cities. The specific forms of STAs and APs are not limited in this embodiment of the present application. This is only an example for the description in this specification.

[0070] This application is mainly described by taking a network equipped with IEEE802.11 as an example. However, those skilled in the art can easily understand that various aspects of this application can be extended to other networks using various standards or protocols, such as Bluetooth (registered trademark), High Performance Radio LAN (HIPERLAN) (a wireless standard similar to the IEEE802.11 standard and mainly used in Europe), Wide Area Network (WAN), Wireless Local Area Network (WLAN), Personal Area Network (PAN), or other known or later-developed networks.

[0071] For example, FIG. 2 is a schematic diagram of the structure of an access point and the structure of a station according to an embodiment of this application. The AP may have multiple antennas or a single antenna. As shown in FIG. 2, the AP includes a physical layer (PHY) processing circuit and a media access control (MAC) processing circuit. The physical layer processing circuit may be configured to process physical layer signals, and the MAC layer processing circuit may be configured to process MAC layer signals. The 802.11 standard focuses on the PHY and MAC. As shown in FIG. 2, FIG. 2 further shows a schematic diagram of the structure of a STA having a single antenna. In an actual scenario, the STA may alternatively have multiple antennas or may be a device having three or more antennas. The STA may include a PHY processing circuit and a MAC processing circuit. The physical layer processing circuit may be configured to process physical layer signals, and the MAC layer processing circuit may be configured to process MAC layer signals.

[0072] In this application, the transmitting device may be an access point device or a station device. Alternatively, the receiving device may be an access point device or a station device. For example, the transmitting device may be an access point device, and the receiving device may be an access point device. In another example, the transmitting device may be a station device, and the receiving device may also be a station device. In another example, the transmitting device may be an access point device, and the receiving device may be a station device. In another example, the transmitting device may be a station device, and the receiving device may be an access point device. It should be understood that the transmitting device and the receiving device shown in this specification may also be collectively referred to as a communication device.

[0073] It should be understood that the signal processing method provided in this application is described using the example of a transmitting device transmitting a PPDU to the receiving device of this application. However, the method shown in this application is further applicable to various types of PPDUs. For example, the PPDU may include a multiple user PHY protocol data unit (MU PPDU), a single user PHY protocol data unit (SU PPDU), a trigger based PHY protocol data unit (TB PPDU), etc.

[0074] The following explains the terms related to this application.

[0075] 1. Orthogonal Frequency Division Multiplexing (OFDM) Orthogonal frequency division multiplexing is a multi-carrier transmission technology. This technology can use a plurality of adjacent orthogonal sub-carriers, and each sub-carrier can be modulated using a modulation technique. Therefore, the orthogonal frequency division multiplexing technology can achieve high-rate transmission and can effectively withstand frequency selective fading. For example, VHT-LTF1 to VHT-LTF N in FIG. 3a can also be understood as OFDM symbols. In other words, the VHT-LTF in the physical (PHY) layer protocol data unit (PPDU) shown in FIG. 3a can also be understood to include N OFDM symbols.

[0076] 2. Physical (PHY) layer protocol data unit (PPDU) For example, FIG. 3a is a schematic diagram of the frame structure of a very high throughput (VHT) PPDU (which may also be referred to as an 802.11ac PPDU). As shown in FIG. 3a, the VHT PPDU includes data (VHT data), a legacy preamble, and a very high throughput preamble. The legacy preamble includes a legacy short training field (L-STF), a legacy long training field (L-LTF), and a legacy signal field (L-SIG). The very high throughput preamble includes a very high throughput signaling field A (VHT-SIG A), a very high throughput short training field (VHT-STF), a very high throughput long training field (VHT-LTF), and a very high throughput signaling field B (VHT-SIG B). VHT-SIG A (which may also be referred to as VHTSIGA) may include two OFDM symbols, and the duration of each symbol is 4 μs. The VHT-LTF may include N VHT-LTF symbols and may be used to assist the receiving device in correctly estimating the channel in order to assist the receiving device in correctly decoding the received data information.

[0077] As shown in FIG. 3a, the PPDU may further include a service field, a VHT data field, and a padding & tail field.

[0078] 3. Pilot subcarrier and data subcarrier In the WLAN communication protocol, each OFDM symbol may include a pilot subcarrier and a data subcarrier. A pilot subcarrier is a subcarrier in which a preset sequence is arranged or carried within an OFDM symbol, and a data subcarrier is a subcarrier in which data is arranged or carried. In a communication system, a pilot subcarrier can be used to assist in detecting and correcting subcarrier phase offsets in order to improve the accuracy of data subcarrier resolution. For example, each VHT-LTF symbol (which may also be referred to as an LTF symbol) included in the LTF shown in FIG. 3a, i.e., each VHT-LTF symbol from VHT-LTF1 to VHT-LTF N, may include a pilot subcarrier and a data subcarrier.

[0079] The 802.11ac protocol supports the simultaneous transmission of up to 8 streams of data, including single-user multiple input multiple output (MIMO) technology and multi-user MIMO technology. When the number of spatial streams is N STS the number N LTF of OFDM symbols included in the LTF shown in FIG. 3a may satisfy the following relationship.

Equation

[0080] N STS represents the maximum number of spatial streams supported by the communication device (the number of spatial streams may also be abbreviated as the number of streams), and N LTFindicates the number of OFDM symbols included in the LTF (i.e., the number of LTF symbols included in the LTF). For example, VHT-LTF1 to VHT-LTF N shown in FIG. 3a is the number of OFDM symbols included in the LTF, and N is a positive integer. In addition, each LTF symbol included in the LTF may include data subcarriers and pilot subcarriers. For example, VHT-LTF1 shown in FIG. 3a may include a plurality of data subcarriers and a plurality of pilot subcarriers, VHT-LTF2 may include a plurality of data subcarriers and a plurality of pilot subcarriers, VHT-LTF3 may include a plurality of data subcarriers and a plurality of pilot subcarriers, and so on. For example, the LTF includes N LTF symbols, and each of the N LTF symbols may include a plurality of data subcarriers and a plurality of pilot subcarriers. It will be understood that the number of data subcarriers and pilot subcarriers included in each LTF symbol is not limited in this application. For the specific number of data subcarriers and pilot subcarriers, refer to the relevant standards or protocols. Details are not described here. For example, 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.

[0081] The LTF can be used to help the receiving end simultaneously estimate the channels of multiple spatial streams. In order to accurately estimate the channels of the spatial streams and orthogonalize the LTF symbols of each stream, the 802.11ac protocol proposes a P matrix. For example, N STS = 4, and the corresponding P matrix is as follows.

Number

[0082] In this case, the relationship between the spatial stream and time of the VHT-LTF can be shown in FIG. 3b. N STS = 1, N STS = 2, or NSTS When = 3, the structure of the VHT-LTF can be part of the content of the structure shown in FIG. 3b. The times marked in FIG. 3b, for example, 0 ns, -400 ns, -200 ns, or -600 ns, can be understood as cyclic shift diversity (CSD) corresponding to each spatial stream.

[0083] For example, when transmitting a PPDU, the transmitting device may multiply the j-th LTF symbol corresponding to the i-th spatial stream by the element in the i-th row and j-th column of the P 4×4 matrix. Here, i may be a positive integer from 1 to 4, and j may be a positive integer from 1 to 4. FIG. 3b shows four LTF symbols, and it should be understood that FIG. 3b only marks the first LTF symbol as an example. It will be understood that i shown in this application may vary with the amount of spatial streams, and j may also vary with the amount of spatial streams. For example, when the number of spatial streams is 8, i may be an integer from 1 to 8, and j may be an integer from 1 to 8.

[0084] Therefore, after the k-th subcarrier corresponding to each LTF symbol passes through the channel H k the frequency domain signal Y received by the receiving device k may be expressed as follows. Y k = H k × P 4×4 × LTF k (3)

[0085] P 4x4 matrix is an orthogonal matrix, that is

Number

Number

[0086] In other words, when the transmitting device transmits a PPDU, the signal transmitted on the data subcarriers within each LTF symbol can be obtained by multiplying the LTF sequence by the P matrix. When receiving the signal, the receiving device can perform channel estimation according to the P matrix, the signal received on the data subcarriers within each LTF symbol, and the LTF sequence to obtain the channel response H. k In order to obtain, the receiving device can perform channel estimation according to the P matrix, the signal received on the data subcarriers within each LTF symbol, and the LTF sequence.

[0087] In addition, when the transmitting device transmits a PPDU, the signal transmitted on the pilot subcarriers within 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, frequency offset estimation, etc. according to the R matrix, the signal received on the pilot subcarriers within each LTF symbol, and the LTF sequence.

[0088] In other words, when the transmitting device transmits a PPDU, the data subcarriers within the j-th LTF symbol corresponding to the i-th spatial stream (i.e., the j-th LTF symbol within the LTF in the PPDU) may be multiplied by the element in the i-th row and j-th column of the P matrix, and the pilot subcarriers within the j-th LTF symbol corresponding to the i-th spatial stream are multiplied by the element in the i-th row and j-th column of the R matrix. For example, the i-th row of the R matrix may be equal to the first row of the P matrix. The relationship between the R matrix and the P matrix can be shown as follows. R(i,j)=P(1,j) (4)

[0089] It can be seen that each row of the R matrix may be the same, and each row of the R matrix may be equal to the first row of the P matrix.

[0090] It will be understood that the LTF sequence shown above may be defined by relevant standards, protocols, etc., which is not limited in this application. For example, the LTF sequence may be {1, 1, -1, -1, 1, 1, -1, 1, -1, 1, 1, 1, 1, 1, 1, -1, -1, 1, 1, -1, 1, -1, 1, 1, 1, 1}. For example, the LTF sequence may be {1, -1, -1, 1, 1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1}.

[0091] The foregoing P matrix is shown using an example where the number of spatial streams is 4. For example, N STS When = 2, the corresponding P matrix is as follows.

Number

[0092] For example, N STS When = 6, the corresponding P matrix is as follows.

Number

[0093] w = exp(-j2π / 6).

[0094] For example, N STS When = 8, the corresponding P matrix is as follows.

Number

[0095] For example, the specific expression of formula (7) may be as follows.

Number

[0096] From the foregoing description, it can be seen that the maximum number of streams supported by the 802.11ax protocol is 8. However, in the next-generation EHT standard, the maximum number of allowed spatial streams is 16. As a result, the P matrix cannot be directly applied to scenarios where the number of streams is greater than 8.

[0097] Taking this into account, the present application provides a signal processing method and apparatus. The method provided in the present application is applicable to scenarios where the number of streams is greater than 8. For example, the method provided in the present application may support channel estimation for 16 streams, such as MIMO channel estimation for 16 streams. As another example, the method provided in the present application may further support channel estimation for 32 streams or 24 streams. In addition, the P n×n matrix provided in the present application can further reduce the space for the communication device to store the P n×n matrix.

[0098] Regarding the description of the communication device and communication system in the signal processing method provided in the present application, it will be understood by referring to the foregoing description. Details will not be described again here. In the following, it will be understood that an example in which the communication device includes a transmitting device and a receiving device will be used to describe the method provided in the embodiments of the present application. The transmitting device shown below may be understood as a device for transmitting a PPDU, and the receiving device may be understood as a device for receiving a PPDU.

[0099] FIG. 4a is a schematic flowchart of a signal processing method according to an embodiment of the present application. As shown in FIG. 4a, the method includes the following steps.

[0100] 401: The transmitting 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 a P n×n matrix, or the first matrix is obtained according to the P n×n matrix,

Mathematics

Mathematics

[0101] n can indicate the number of rows and columns of the P n×n matrix (which may also be abbreviated as the P matrix), and the maximum number of spatial streams supported when the transmitting device transmits a signal. In other words, when the transmitting device transmits a PPDU, the maximum number of spatial streams supported by the transmitting device may be greater than 8.

[0102] For example, when n = 12, P n×nThe matrix may include 12 rows and 12 columns. Thus, the first matrix includes 12 rows and 12 columns. Additionally, the maximum number of spatial streams supported by the transmitting device may be 12, and the transmitting device may further multiply the m-th row and the n-th column of the first matrix by the n-th LTF symbol corresponding to the m-th spatial stream (as shown in FIG. 3b). Correspondingly, the receiving device may simultaneously estimate the channels of spatial streams whose number is 12 or less. For example, the receiving device may further simultaneously estimate the channels of 8 spatial streams, or the receiving device may further simultaneously estimate the channels of 4 spatial streams. In other words, the receiving device may perform channel estimation, phase tracking, frequency offset estimation, etc. according to some or all of the content of the first matrix. For example, when n = 16, the first matrix may include 16 rows and 16 columns. Additionally, the maximum number of spatial streams supported by the transmitting device may be 16. Correspondingly, the receiving device may simultaneously estimate the channels of 16 spatial streams, or the receiving device may further simultaneously estimate the channels of spatial streams whose number is less than 16. For example, the receiving device may, according to the P provided in this embodiment of the present application n×n According to the matrix, the receiving device may further estimate the channels of 2 to 15 spatial streams, for example, the channels of 2 spatial streams, the channels of 3 spatial streams, the channels of 4 spatial streams, the channels of 6 spatial streams, the channels of 8 spatial streams, the channels of 12 spatial streams, or the channels of 15 spatial streams. This is not limited in this embodiment of the present application.

[0103] For example, the maximum number of spatial streams supported by the transmitting device may alternatively be 32 (or 24), etc. Additionally, the receiving device may simultaneously estimate the channels of spatial streams whose number is 32 (or 24) or less.

[0104] The number of LTF symbols shown in this application can be greater than or equal to the number of spatial streams. For example, the number of LTF symbols is equal to the number n of spatial streams. In another example, the number of LTF symbols is equal to the number n + 1 of spatial streams.

[0105] For example, a plurality of LTF symbols includes data subcarriers. In this case, the first matrix may be equal to the P n×n matrix. Alternatively, the first matrix is the P n×n transpose matrix of the matrix (e.g., [Number] ). Alternatively, the first matrix is the P n×n negation matrix of the matrix (e.g., -P n×n ). Alternatively, the first matrix is the P n×n transpose matrix of the negation matrix of the matrix (e.g., (-P n×n )) T ). Alternatively, the first matrix is the P n×n negation matrix of the transpose matrix of the matrix (e.g., [Number] ). In other words, the data subcarriers in each of the plurality of LTF symbols in the LTF transmitted by the transmitting device can be obtained according to the first matrix. It should be understood that the relationship between the first matrix shown in this specification and the P matrix is merely an example. However, any first matrix obtained based on the P matrix falls within the protection scope of this application.

[0106] For example, a plurality of LTF symbols includes pilot subcarriers. In this case, the first matrix may be equal to the R n×n matrix, and the R n×n matrix may be obtained based on the T-th row (or row) of the P n×n matrix. Here, T is an integer greater than or equal to 1 and less than n. For example, the R n×n matrix may be obtained based on the first row of the P n×n matrix. For example, each row of the R n×n matrix may alternatively

Number

[0107] For an example of the first matrix, refer to the following formulas (84) to (89). R n×n Matrix and P n×n For the relationship between the matrix and P matrix, refer to the following formula (10) etc.

[0108] Therefore, the fact that a plurality of LTF symbols included in the LTF are used to carry a sequence obtained according to the first matrix means that the data subcarriers in the plurality of LTF symbols are P n×n It is used to carry a sequence obtained according to a matrix (which may also be called a P matrix) and an LTF sequence, and the pilot subcarriers in the plurality of LTF symbols are R n×n It is used to carry a sequence obtained according to a matrix (which may also be called an R matrix) and an LTF sequence. Further, the receiving device receives a PPDU. Among the plurality of LTF symbols included in the LTF in the PPDU, the part corresponding to the data subcarriers is P n×n It may be obtained by multiplying the LTF sequence by the matrix and performing an inverse Fourier transform (which may also be called an inverse Fourier transform). Among the plurality of LTF symbols, the part corresponding to the pilot subcarriers is R n×n It may be obtained by multiplying the LTF sequence by the matrix and performing an inverse Fourier transform.

[0109] Regarding the LTF sequence, the data subcarriers, pilot subcarriers, the relationship between the P matrix and the data subcarriers, and the relationship between the R matrix and the pilot subcarriers can be understood by referring to the foregoing description, for example, FIGS. 3a or 3b. The details will not be described again here.

[0110] FIG. 4b is a schematic diagram of the structure of another PPDU according to an embodiment of the present application. As shown in FIG. 4b, the PPDU includes data, a legacy physical layer preamble, an extremely high throughput (EHT) preamble, and a packet extension (PE). The EHT preamble includes a repeated Legacy signal field (RL-SIG), a universal signal field (U-SIG), an EHT short training field (EHT-STF), and an LTF. The LTF includes N EHT-LTFs (which may also be referred to as LTF symbols), and the N EHT-LTF symbols include EHT-LTF1 to EHT-LTF N.

[0111] It will be understood that the PPDU generated by the transmitting device may be shown in FIG. 4b and the LTF symbols may include EHT-LTF symbols.

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

[0113] 403: The receiving device processes the signal received with a plurality of LTF symbols according to the first matrix.

[0114] For example, the receiving device may perform channel estimation according to the signals received on the data subcarriers within the first matrix and the plurality of LTF symbols. For example, the receiving device may perform channel estimation according to the signals received on the data subcarriers within the first matrix, the LTF sequence, and the plurality of LTF symbols. For example, alternatively, the receiving device may perform phase tracking and / or frequency offset estimation according to the signals received on the pilot subcarriers within the first matrix and the plurality of LTF symbols. For example, alternatively, the receiving device may perform phase tracking and frequency offset estimation according to the signals received on the pilot subcarriers within the first matrix, the LTF sequence, and the plurality of LTF symbols.

[0115] The first matrix

Number

Number

[0116] Another case of Equation (9) may be understood to show the case where the k-th subcarrier is a non-pilot subcarrier. For example, when the k-th subcarrier is a data subcarrier, the first matrix is

Number

[0117] For example, R n×n matrix and P n×n The relationship with the matrix can be shown as follows. [R] m,n =[P] 1,n (10)

[0118] [R] m,n denotes the m-th row of the R n×n matrix, and [P] 1,n denotes the P n×n matrix's first row. Both m and n are integers between 1 and 16 inclusive.

[0119] The R shown in this embodiment of the present application n×n matrix's each row is the P n×n matrix's first row of the all-negation matrix, the P n×n matrix's first row of the transposed matrix, the P n×n matrix's first row of the transposed all-negation matrix, etc. It should be understood that they may be further equal.

[0120] According to the method provided in this embodiment of the present application, the receiving device can perform channel estimation for more than 8 streams. For example, the receiving device can support MIMO channel estimation for up to 16 streams. In addition, the P matrix provided in the present application can be further adapted to requirements for different numbers of streams. Therefore, the receiving device can perform MIMO channel estimation for 12 streams, 16 streams, etc. By using one P n×n matrix, MIMO channel estimation for a plurality of different numbers of streams can be performed, and the redundancy of MIMO channel estimation is effectively reduced.

[0121] Normally, in the case of a 16-row and 16-column matrix, the communication device usually needs to store the values of 256 elements. Therefore, when generating the LTF, the communication device (for example, the transmitting device) can sequentially read the elements of the matrix. However, in the P n×n matrix provided in this embodiment of the present application, the S (n-1)×(n-1) matrix can be restored by storing only the vector of the first row or the first column of the submatrix (or the first vector x, the second vector y, etc.). Therefore, the complete P (n-1)×(n-1) submatrix and the P n×n matrix can be restored. Therefore, the complete P n×nThere is no need to store the matrix. In this way, the storage space occupied by the matrix can be effectively reduced, and the implementation complexity can be reduced. Alternatively, the P provided in this application n×n The matrix may include element 1 and element -1, and the calculation complexity can be further simplified. Alternatively, in order to effectively solve the spectral line, the P provided in this application n×n The n elements in the T-th row of the matrix are different.

[0122] In the following, the P n×n Based on the characteristics of the matrix, the P provided in this embodiment of this application n×n The matrix will be described. One or more of the following multiple characteristics may be understood as the characteristics of the P n×n matrix. For example, any one of the following characteristics 1 to 7 may be the characteristics of the P n×n matrix. Alternatively, any combination of two of the following characteristics 1 to 7 may be the characteristics of the P n×n matrix. Alternatively, any combination of any three of the following characteristics 1 to 7, etc., may be the characteristics of the P n×n matrix. Alternatively, the following characteristics 1 to 7 may all be the characteristics of the P n×n matrix.

[0123] Characteristic 1: The P n×n matrix includes element 1 and element -1.

[0124] In this embodiment of this application, the P n×n matrix may be a matrix including element 1 and element -1. This solves the complex implementation caused by storing another more complex element (for example, a complex number) by the communication device. In other words, the P provided in this embodiment of this application n×n matrix can effectively simplify the calculation complexity.

[0125] Characteristic 2: The P n×n n elements in the T-th row of the matrix are different, where T is an integer greater than or equal to 1 and less than n.

[0126] In this embodiment of the present application, for example, P n×n The n elements in the first row of the matrix are different. Alternatively, P n×n The n elements in the second row of the matrix are different. Alternatively, P n×n The n elements in the T-th row of the matrix are different. Therefore, P n×n R obtained according to the matrix n×n The n elements in each row of the matrix may also be different. Thereby, the spectral bump is effectively solved.

[0127] Referring to Feature 1 and Feature 2, the P provided in this embodiment of the present application n×n The elements of the matrix are simple, and P n×n The n elements in each row of the matrix are different. Thereby, the complex operation of the communication device is solved, and the spectral bump is effectively solved.

[0128] Feature 3: P n×n The submatrix S of the matrix (n-1)×(n-1) is a circulant matrix or a Hankel matrix.

[0129] The circulant matrix may be a special form of Toeplitz matrix (which can also be called a diagonal constant matrix). Each element of the column vector of the circulant matrix may be the result of sequentially shifting each element of the previous column vector one bit to the right.

[0130] The Hankel matrix is a square matrix in which the elements on each skew diagonal are equal.

[0131] In this embodiment of the present application, P n×n The submatrix S of the matrix (n-1)×(n-1) is set to a circulant matrix or a Hankel matrix, and the communication device can restore the submatrix only by storing the first row or the first column of the submatrix S (n-1)×(n-1) Thereby, the storage space of the communication device can be effectively saved, and the implementation complexity can be reduced.

[0132] Partial matrix S (n-1)×(n-1) For the example where the partial matrix S is a Hankel matrix, it will be understood to refer to the following equations (51) and (52).

[0133] Feature 4: P n×n The partial matrix S of the matrix (n-1)×(n-1) The first row of is equal to the first vector x or is obtained based on the first vector x, where x = [1 1 1 -1 1 -1 -1 1 -1 -1 -1] (in this case, n = 12). Alternatively, for the partial matrix S of the P n×n matrix (n-1)×(n-1) The first row of is equal to the second vector y or is obtained based on the second vector y, where y = [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1] (in this case, n = 16).

[0134] In this embodiment of the present application, the other rows of the partial matrix S (n-1)×(n-1) can also be obtained based on the first vector x or the second vector y. For ease of explanation, in the following, an example where the first row of the partial matrix S (n-1)×(n-1) is equal to the first vector x (or the second vector y) or is obtained based on the first vector x (or the second vector y) will be used to explain each matrix provided in the embodiments of the present application. However, this should not be construed as a limitation to the embodiments of the present application.

[0135] For example, the first row of the partial matrix S (n-1)×(n-1) can be obtained by performing one or more of the three operations of circular shift, inversion, or all negation on the first vector x.

[0136] For example, the first row of the partial matrix S (n-1)×(n-1) can be obtained by performing one or more of the three operations of circular shift, inversion, or all negation on the second vector y.

[0137] For example, the partial matrix S (n-1)×(n-1)The first row is equal to the all - negative vector of the first vector. For example, sub - matrix S (n-1)×(n-1) The first row is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1] (which can also be denoted as -x).

[0138] In another example, sub - matrix S (n-1)×(n-1) The first row is equal to the inverted vector of the first vector. For example, sub - matrix S (n-1)×(n-1) The first row is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1] (which can also be denoted as the inverted vector of x).

[0139] In another example, sub - matrix S (n-1)×(n-1) The first row is equal to the circular - shift vector of the first vector. For example, sub - matrix S (n-1)×(n-1 ) The first row is equal to [-1 1 1 1 -1 1 -1 -1 1 -1 -1]. In other words, the first row of sub - matrix S (n-1)×(n-1) is obtained by shifting the first vector x one bit to the right. In another example, sub - matrix S (n-1)×(n-1) The first row is equal to [1 1 -1 1 -1 -1 1 -1 -1 -1 1]. In other words, the first row of sub - matrix S (n-1)×(n-1) is obtained by shifting the first vector x one bit to the left.

[0140] For example, the first row of sub - matrix S (n-1)×(n-1) is equal to the all - negative vector of the second vector. For example, the first row of sub - matrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1] (which can also be denoted as -y).

[0141] In another example, sub - matrix S (n-1)×(n-1) The first row is equal to the inverted vector of the second vector. For example, the first row of sub - matrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1] (which can also be denoted as the inverted vector of y).

[0142] In another example, sub - matrix S (n-1)×(n-1)The first row of is equal to the circular shift vector of the second vector. For example, the submatrix S (n-1)×(n-1 )'s first row is equal to [-1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1]. In other words, the submatrix S (n-1)×(n-1) 's first row is obtained by shifting the second vector y one bit to the right. In another example, the submatrix S (n-1)×(n-1) 's first row is equal to [1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1]. In other words, the submatrix S (n-1)×(n-1) 's first row is obtained by shifting the second vector y one bit to the left.

[0143] For example, if the first row of the submatrix S (n-1)×(n-1) is obtained based on the first vector x, the second row of the S matrix P (n-1)×(n-1) may also be obtained based on the circular shift of the first vector x, and the third row of the S matrix P (n-1)×(n-1) may also be obtained based on the circular shift of the first vector x. Alternatively, after the first row of the submatrix S (n-1)×(n-1) is determined based on the first vector x, the second row to the (n - 1)th row of the submatrix S (n-1)×(n-1) may be obtained based on the circular shift of the first row.

[0144] For example, the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 1 -1 -1 1 -1 -1 -1], the second row of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 1 -1 1 -1 -1 1 -1 -1] (i.e., shifting 11 elements of x one bit to the right), and the third row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 1 1 1 -1 1 -1 -1 1 -1] (i.e., shifting 11 elements of x two bits to the right). The rest can be deduced by analogy, and the submatrix S (n-1)×(n-1) can be obtained.

[0145] In another example, the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 1 -1 -1 1 -1 -1 -1], and the submatrix S (n-1)×(n-1)The second row of (n-1)×(n-1) is equal to [1 1 -1 1 -1 -1 1 -1 -1 -1 1] (i.e., shifting the 11 elements of x one bit to the left), and the submatrix S (n-1)×(n-1) can be obtained.

[0146] In another example, for the submatrix S (n-1)×(n-1) the first row is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1], and for the submatrix S (n-1)×(n-1) the second row is equal to [1 -1 -1 -1 1 -1 1 1 -1 1 1] (i.e., shifting the 11 elements of the all - negated vector of x one bit to the right), and for the submatrix S (n-1)×(n-1) the third row is equal to [1 1 -1 -1 -1 1 -1 1 1 -1 1]. The rest can be inferred by analogy, and the submatrix S (n-1)×(n-1) can be obtained.

[0147] In another example, for the submatrix S (n-1)×(n-1) the first row is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1], and for the submatrix S (n-1)×(n-1) the second row is equal to [-1 -1 1 -1 1 1 -1 1 1 1 -1] (i.e., shifting the 11 elements of the all - negated vector of x one bit to the left), and for the submatrix S (n-1)×(n-1) the third row is equal to [-1 1 -1 1 1 -1 1 1 1 -1 -1]. The rest can be inferred by analogy, and the submatrix S (n-1)×(n-1) can be obtained.

[0148] In another example, for the submatrix S (n-1)×(n-1) the first row is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1], and for the submatrix S (n-1)×(n-1) the second row is equal to [1 -1 -1 -1 1 -1 -1 1 -1 1 1] (i.e., shifting the 11 elements of the inverted vector of x one bit to the right), and for the submatrix S (n-1)×(n-1)The third row of [1 1 -1 -1 -1 1 -1 -1 1 -1 1]. The rest can be estimated by analogy, and the submatrix S (n-1)×(n-1) can be obtained.

[0149] In another example, the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1], and the second row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 1 -1 -1 1 -1 1 1 1 -1] (i.e., shift the 11 elements of the inverted vector of x one bit to the left), and the third row of the submatrix S (n-1)×(n-1) is equal to [-1 1 -1 -1 1 -1 1 1 1 -1 -1]. The rest can be estimated by analogy, and the submatrix S (n-1)×(n-1) can be obtained.

[0150] In other words, each element of the row vector of the submatrix S (n-1)×(n-1) is the result of sequentially shifting each element of the previous row vector one bit to the right. Alternatively, each element of the row vector of the submatrix S (n-1)×(n-1) is the result of sequentially shifting each element of the previous row vector one bit to the left.

[0151] For example, when the first row of the submatrix S (n-1)×(n-1) is equal to or obtained based on the second vector y, the second row to the (n - 1)th row of the submatrix S (n-1)×(n-1) can also be obtained based on the circular shift of the first row.

[0152] Regarding the description of the submatrix S (n-1)×(n-1) and the second vector y, it will be understood to refer to the foregoing examples of the submatrix S (n-1)×(n-1) and the first vector x. Details are not described again here.

[0153] In this embodiment of the present application, the communication device obtains the first row of the submatrix S n×n of the Pmatrix based on the first vector or the second vector, and then S (n-1)×(n-1) (n-1)×(n-1)may be obtained. Therefore, in order to restore the partial matrix, the communication device only needs to store the rows of the partial matrix S of the P n×n matrix. Alternatively, when the relationship between the rows of the partial matrix and the first vector or the second vector is determined, the communication device can restore the partial matrix by only storing the first vector or the second vector. Therefore, there is no need to store the complete P (n-1)×(n-1) matrix. Furthermore, this can reduce the space occupied by the P n×n matrix, save storage space, and effectively reduce the complexity of the implementation of the communication device (for example, the partial matrix S of the P n×n matrix can be restored based on operations such as circular shift). n×n matrix. (n-1)×(n-1) can be restored based on operations such as circular shift).

[0154] Feature 5: The first column of the partial matrix S of the P n×n matrix is equal to the third vector x' or is obtained based on the third vector x' (in this case, n = 12). Alternatively, the first column of the partial matrix S of the P (n-1)×(n-1) matrix is equal to the fourth vector y' or is obtained based on the fourth vector y' (in this case, n = 16). n×n matrix. (n-1)×(n-1) matrix is equal to the fourth vector y' or is obtained based on the fourth vector y' (in this case, n = 16).

[0155] The third vector x' can be represented as follows.

Number

[0156] The fourth vector y' can be represented as follows.

Number

[0157] For example, the first column of the partial matrix S (n-1)×(n-1) can be obtained by performing one or more of the three operations of circular shift, inversion, or bitwise negation on the third vector.

[0158] For example, the first column of the submatrix S (n-1)×(n-1) can be obtained by performing one or more of three operations: cyclic shift, inversion, or full negation on the fourth vector y ’ with respect to.

[0159] For example, the first column of the submatrix S (n-1)×(n-1) is equal to the inverted vector of the third vector. For example, the first column of the submatrix S (n-1)×(n-1) is [1 1 -1 1 -1 -1 1 -1 -1 -1 1] T which is equal to.

[0160] For example, the first column of the submatrix S (n-1)×(n-1) is equal to the fully negated vector of the third vector. For example, the first column of the submatrix S (n-1)×(n-1) is [-1 1 1 1 -1 1 1 -1 1 -1 -1] T which is equal to.

[0161] In another example, the first column of the submatrix S (n-1)×(n-1) is equal to the transposed vector of the cyclic shift vector of the third vector. For example, the first column of the submatrix S (n-1)×(n-1) is [-1 -1 -1 1 -1 -1 1 -1 1 1 1] T which is equal to. In other words, the first column of the submatrix S (n-1)×(n-1) is obtained by cyclically shifting the third vector x' upward by one bit. In another example, the first column of the submatrix S (n-1)×(n-1) is [1 1 -1 -1 -1 1 -1 -1 1 -1 1] T which is equal to. In other words, the first column of the submatrix S (n-1)×(n-1) is obtained by cyclically shifting the third vector x' downward by one bit.

[0162] After the first column of the submatrix S (n-1)×(n-1) is determined based on the third vector x', it will be understood that the second through (n - 1) columns of the submatrix S (n-1)×(n-1) can also be obtained based on the cyclic shift of the first column.

[0163] In another example, the first column of the submatrix S (n-1)×(n-1) is equal to the all-negation vector of the fourth vector. For example, the first column of the submatrix S (n-1)×(n-1) is equal to [-1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1] T .

[0164] In another example, the first column of the submatrix S (n-1)×(n-1) is equal to the inverted vector of the transposed vector of the fourth vector. For example, the first column of the submatrix S (n-1)×(n-1) is equal to [1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1] T .

[0165] In another example, the first column of the submatrix S (n-1)×(n-1) is equal to the transposed vector of the circular shift vector of the fourth vector. For example, the first column of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1] T . In other words, the first column of the submatrix S (n-1)×(n-1) is obtained by circularly shifting the fourth vector y ’ upward by one bit. In another example, the first column of the submatrix S (n-1)×(n-1) is equal to [1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1] T . In other words, the first row of the submatrix S (n-1)×(n-1) is obtained by circularly shifting the fourth vector y ’ downward by one bit.

[0166] For the description of the relationship between the first column of the submatrix S (n-1)×(n-1) and the third vector x ’ or the fourth vector y ’ , refer to the description of Feature 4. Details will not be described again here.

[0167] To facilitate the description, hereinafter, for the submatrix S n×n of the P (n-1)×(n-1)Use an example where the first row is equal to the first vector (or the second vector), or is obtained based on the first vector (or the second vector), to describe the P n×n matrix provided in the embodiments of this application. In the following, P n×n submatrix S of the matrix (n-1)×(n-1) For an example where the first column of is equal to the third vector (or the fourth vector), or is obtained based on the third vector (or the fourth vector), it will not be described in detail.

[0168] Feature 6:

Number

Number

Number

Number

[0169] S (n-1)×(n-1) matrix is a submatrix of the P n×n matrix, the S (n-1)×(n-1) matrix contains n - 1 rows and n - 1 columns, α is a column vector consisting of n - 1 elements, each element is 1, and α T is the transposed vector of α, and -α indicates the vector obtained by negating all elements in α.

[0170] In this embodiment of this application, S (n-1)×(n-1) can be a circulant matrix or a Hankel matrix.

[0171] In this embodiment of this application, it can be guaranteed that the P n×n matrix is an orthogonal matrix and the submatrix S (n-1)×(n-1) is a circulant matrix or a Hankel matrix. The communication device can store the vector of the first row or the first column of the submatrix S (n-1)×(n-1) (or the first vector x, the second vector y, etc.) to obtain the submatrix and Pn×n The matrix can be restored. Therefore, the complete P n×n matrix does not need to be stored. In this way, the memory space occupied by the P n×n matrix can be effectively reduced, the memory space can be saved, and the complexity of the implementation of the communication device can be effectively reduced.

[0172] Feature 7:

Number

Number

Number

Number

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

[0174] For example,

Number

[0175] In this embodiment of the present application, the P 8×8 matrix is extended to generate the P 16×16 matrix. Thereby, it is ensured that the communication device supports the transmission of data with 16 streams or less than 16 streams, and excessive complex operations can be avoided.

[0176] In this embodiment of the present application, the P 32×32 matrix can be obtained according to the P 16×16 matrix, and the P24×24 The matrix is P 12×12 It should be understood that it can be obtained according to the matrix. The specific acquisition method is P 8×8 Expand the matrix to P 16×16 The method is the same as the method of generating the matrix. For the sake of brevity, hereinafter, P 12×12 According to the matrix, P 24×24 The method for obtaining the matrix, and P 16×16 According to the matrix, P 32×32 The method for obtaining the matrix will not be described in detail.

[0177] P 12×12 The matrix is P 24×24 Is expanded to generate the matrix, or P 16×16 The matrix is P 32×32 Is expanded to generate the matrix. This ensures that the communication device can support the transmission of data with 32 streams or less than 32 streams, and can avoid overly complex operations.

[0178] For example, hereinafter, first, P n×n The matrix provided in the embodiment of the present application will be described in detail, and then R n×n The matrix provided in the embodiment of the present application will be described, and finally, the first matrix provided in the embodiment of the present application will be described.

[0179] In one possible embodiment, P 12×12 The matrix can be shown as follows.

Number

[0180] Alternatively,

Number

[0181] Equation (22) is the submatrix S (n-1)×(n-1)An example is shown using the first row equal to [1 1 1 -1 1 -1 -1 1 -1 -1 -1] (i.e., equal to the first vector). However, it should not be understood as a limitation to the embodiments of this application. The partial matrix S shown in Equation (22) (n-1)×(n-1) It will be understood that each element of the row vector of is the result of sequentially shifting each element of the previous row vector one bit to the right. The partial matrix S shown in Equation (23) (n-1)×(n-1) Each element of the row vector of is the result of sequentially shifting each element of the previous row vector one bit to the left. The equations (22) and (23) shown in this specification may also be understood as the P n×n matrix obtained according to Equation (13). It will be understood that S (n-1)×(n-1) The result of sequentially shifting each element of the row vector of two (or three, four, etc.) bits to the right, or S (n-1)×(n-1) The result of sequentially shifting each element of the row vector of two (or three, four, etc.) bits to the left is also within the protection scope of this application. Therefore, for the sake of brevity, hereinafter, as an example, only the result of sequentially shifting each element of the row vector of the partial matrix S (n-1)×(n-1) one bit to the right is shown. In addition, for the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (22) or Equation (23) are not enumerated in this specification.

[0182] From Equation (22) and Equation (23), the partial matrix S of the P n×n matrix shown in this embodiment of this application (n-1)×(n-1) is a circulant matrix or a Hankel matrix, and it can be seen that the communication device can obtain the complete P (n-1)×(n-1) matrix only by storing the first row of S n×n . Thereby, the storage space of the communication device can be effectively saved, and the complexity of restoring the P n×n matrix can be reduced. It will be understood that the description is also applicable to the P n×n matrix shown below, or the first matrix obtained according to the P n×n matrix. To avoid repetition, the details will not be described again hereinafter.

[0183] In one possible embodiment, P 12×12 matrix can be shown as follows.

Number

[0184] Equation (24) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 1 -1 -1 1 -1 -1 -1], and shows P 12×12 matrix using Equation (14) as an example. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (24) are not listed herein.

[0185] In one possible embodiment, P 12×12 matrix can be shown as follows.

[0186] Alternatively,

Number

[0187] Equation (25) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 1 -1 -1 1 -1 -1 -1], and shows P 12×12 matrix using Equation (15) as an example. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (24) are not listed herein.

[0188] In one possible embodiment, P 12×12 matrix can be shown as follows.

Number

[0189] Equation (26) is the submatrix S (n-1)×(n-1)An example where the first row of [1 1 1 -1 1 -1 -1 1 -1 -1 -1] is used and shown using Equation (16) for P 12×12 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (26) are not enumerated herein.

[0190] In one possible embodiment, P 12×12 matrix can be shown as follows.

Number

[0191] Equation (27) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1] (i.e., the all-negation vector of the first vector), and shown using Equation (13) for P 12×12 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (27) are not enumerated herein.

[0192] In one possible embodiment, P 12×12 matrix can be shown as follows.

Number

[0193] Equation (28) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1], and shown using Equation (14) for P 12×12 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (28) are not enumerated herein.

[0194] In one possible embodiment, P 12×12The matrix can be shown as follows.

Number

[0195] Equation (29) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1], and P shown using Equation (15) as an example 12×12 is a matrix. For simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (29) are not listed herein.

[0196] In one possible embodiment, the P 12×12 matrix can be shown as follows.

Number

[0197] Equation (30) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 1 1 -1 1 1 1], and P shown using Equation (16) as an example 12×12 is a matrix. For simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (30) are not listed herein.

[0198] In one possible embodiment, the P 12×12 matrix can be shown as follows.

Number

[0199] Equation (31) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1] (i.e., the inverted vector of the first vector), and P shown using Equation (13) as an example 12×12It is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (31) are not listed herein.

[0200] In one possible embodiment, P 12×12 The matrix can be shown as follows.

Number

[0201] Equation (32) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1], and P shown using Equation (14) as an example 12×12 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (32) are not listed herein.

[0202] In one possible embodiment, P 12×12 The matrix can be shown as follows.

Number

[0203] Equation (33) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1], and P shown using Equation (15) as an example 12×12 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (33) are not listed herein.

[0204] In one possible embodiment, P 12×12 The matrix can be shown as follows.

Number

[0205] Equation (34) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 -1 -1 1 -1 1 1 1], and is shown using Equation (16) as an example, the P 12×12 matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (34) are not enumerated herein.

[0206] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0207] Equation (35) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1] (i.e., the second vector), and is shown using Equation (13) as an example, the P 16×16 matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (35) are not enumerated herein.

[0208] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0209] Equation (36) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1], and is shown using Equation (14) as an example, the P 16×16 matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (36) are not enumerated herein.

[0210] The submatrix S of Equation (36) (n-1)×(n-1) It will be understood that it may be a Hankel matrix. The submatrix S (n-1)×(n-1) In another example where S is a Hankel matrix, refer to Equations (51) and (52) shown below.

[0211] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0212] Equation (37) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1], and P shown using Equation (15) as an example 16×16 matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (37) are not enumerated herein.

[0213] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0214] Equation (38) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1], and P shown using Equation (16) as an example 16×16 matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (38) are not enumerated herein.

[0215] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0216] Equation (39) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1] (i.e., the all-negation vector of the second vector), and P shown using Equation (13) as an example 16×16 is a matrix. For simplicity, matrices obtained based on any one or more of the three operations of circular shift, all-negation, and inversion in Equation (39) are not listed herein.

[0217] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0218] Equation (40) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1], and P shown using Equation (14) as an example 16×16 is a matrix. For simplicity, matrices obtained based on any one or more of the three operations of circular shift, all-negation, and inversion in Equation (40) are not listed herein.

[0219] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0220] Equation (41) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1], and P shown using Equation (15) as an example 16×16It is a matrix. For the sake of simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (41) are not listed herein.

[0221] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0222] Equation (42) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1], and P shown using Equation (16) as an example 16×16 is a matrix. For the sake of simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (42) are not listed herein.

[0223] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0224] Equation (43) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1] (i.e., the inverted vector of the second vector), and P shown using Equation (13) as an example 16×16 is a matrix. For the sake of simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (43) are not listed herein.

[0225] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0226] Equation (44) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1], and P shown using Equation (14) as an example 16×16 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (44) are not listed herein.

[0227] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0228] Equation (45) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1], and P shown using Equation (15) as an example 16×16 is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (45) are not listed herein.

[0229] In one possible embodiment, the P 16×16 matrix can be shown as follows.

Number

[0230] Equation (46) is shown using an example where the first row of the submatrix S (n-1)×(n-1) is equal to [-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1], and P shown using Equation (16) as an example 16×16It is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (46) are not listed herein.

[0231] In one possible embodiment, P 16×16 The matrix can be shown as follows.

Number

[0232] Equation (47) shows P using Equation (17) and Equation (21) as examples 16×16 It is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (47) are not listed herein.

[0233] In one possible embodiment, P 16×16 The matrix can be shown as follows.

Number

[0234] Equation (47) shows P using Equation (18) and Equation (21) as examples 16×16 It is a matrix. For the sake of brevity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (37) are not listed herein.

[0235] In one possible embodiment, P 16×16 The matrix can be shown as follows.

Number

[0236] Equation (49) shows P using Equation (19) and Equation (21) as examples 16×16It is a matrix. For the sake of simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (37) are not listed herein.

[0237] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0238] Equation (50) is the P matrix exemplified by Equations (20) and (21). For the sake of simplicity, matrices obtained based on any one or more of the three operations of circular shift, all negation, and inversion in Equation (37) are not listed herein. 16×16 In one possible embodiment, P

[0239] In one possible embodiment, P 12×12 matrix can be shown as follows.

Number

[0240] The submatrix S of Equation (51) (n-1)×(n-1) is a Hankel matrix.

[0241] In one possible embodiment, P 16×16 matrix can be shown as follows.

Number

[0242] The submatrix S of Equation (52) (n-1)×(n-1) is a Hankel matrix.

[0243] For example, hereinafter, the R matrix provided in this embodiment of the present application will be described. n×n matrix will be described.

[0244] In one possible embodiment, R n×nThe matrix can be shown as follows.

Number

[0245] R n×n It will be understood that the elements of each row of the matrix are the same. Therefore, for the sake of brevity, the following formulas (54) to (83) show only the first row of the R n×n matrix, but should not be understood as a limitation to this embodiment of the present application.

[0246] In one possible embodiment, the R n×n matrix can be shown as follows. R 12×12 = [1 1 1 -1 1 -1 -1 1 -1 -1 -1 1] (54)

[0247] For the elements of another row not shown in formula (54), it will be understood that the elements of the first row are referred to. This explanation is the same for the following formulas (55) to (83). For the sake of brevity, the details will not be described again below.

[0248] In one possible embodiment, the R n×n matrix can be shown as follows. R 12×12 = [1 1 1 1 -1 1 -1 -1 1 -1 -1 -1] (55)

[0249] In one possible embodiment, the R n×n matrix can be shown as follows. R 12×12 = [1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1] (56)

[0250] In one possible embodiment, the R n×n matrix can be shown as follows. R 12×12 = [-1 1 1 1 -1 1 -1 -1 1 -1 -1 -1] (57)

[0251] In one possible embodiment, the Rn×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 1 -1 1 1 -1 1 1 1 1](58)

[0252] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[1 -1 -1 -1 1 -1 1 1 -1 1 1 1](59)

[0253] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 1 -1 1 1 -1 1 1 1 -1](60)

[0254] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 -1 1 -1 1 1 -1 1 1 1](61)

[0255] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 1 -1 -1 1 -1 1 1 1 1](62)

[0256] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[1 -1 -1 -1 1 -1 -1 1 -1 1 1 1](63)

[0257] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 1 -1 -1 1 -1 1 1 1 -1](64)

[0258] In one possible embodiment, R n×n The matrix can be shown as follows. R 12×12 =[-1 -1 -1 -1 1 -1 -1 1 -1 1 1 1](65)

[0259] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1](66)

[0260] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1](67)

[0261] In one possible embodiment, R n×n matrix can be shown as follows.

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

[0263] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1](69)

[0264] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 1](70)

[0265] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1](71)

[0266] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 -1](72)

[0267] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 1](73)

[0268] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1](74)

[0269] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1](75)

[0270] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1](76)

[0271] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[-1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1](77)

[0272] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 =[1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1](78)

[0273] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 = [-1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1](79)

[0274] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 = [1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1](80)

[0275] In one possible embodiment, R n×n matrix can be shown as follows. R 16*16 = [1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1](81)

[0276] In one possible embodiment, R n×n matrix can be shown as follows. R 12×12 = [1 1 -1 1 -1 -1 1 -1 -1 -1 1 1](82)

[0277] In one possible embodiment, R n×n matrix can be shown as follows. R 16×16 = [-1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1](83)

[0278] It will be understood that from Equation (53) to Equation (83) are merely examples of the R n×n matrix shown in this embodiment of the present application.

[0279] For example, hereinafter, the first matrix provided in this embodiment of the present application will be described.

[0280] The first matrix is P n×n matrix or R n×nFor examples where the matrices are equal, it will be understood that the details will not be described again below. Below, the first matrix is P n×n equal to the all-negation matrix of the matrix, or the first matrix is P n×n equal to the transposed matrix of the matrix, or the first matrix is P n×n equal to the transposed matrix of the all-negation matrix of the matrix (which can also be understood as the all-negation of the transposed matrix of the matrix), only examples will be shown below. n×n

[0281] For example, Equation (22) is used as an example, and the first matrix can be shown as follows.

Number

[0282] In one possible embodiment, the first matrix can be shown as follows.

Number

[0283] In one possible embodiment, the first matrix can be shown as follows.

Number

[0284] Equation (84) is shown using the all-negation of Equation (22) as an example, Equation (85) is shown using the transposed matrix of Equation (22) as an example, and Equation (86) is shown using the transposed matrix of the all-negation matrix of Equation (22) (which can also be understood as the all-negation of the transposed matrix of Equation (22)) as an example.

[0285] For example, Equation (35) is used as an example, and the first matrix can be shown as follows.

Number

[0286] In one possible embodiment, the first matrix can be shown as follows.​

Mathematics

[0287] In one possible embodiment, the first matrix can be shown as follows.

Mathematics

[0288] Equation (88) is shown using, as an example, the complete negation of Equation (35), Equation (87) is shown using, as an example, the transposed matrix of Equation (35), and Equation (89) is shown using, as an example, the transposed matrix of the complete negation matrix of Equation (35) (which can also be understood as the complete negation of the transposed matrix of Equation (35)).

[0289] It should be understood that the matrices shown above are merely examples and should not be construed as limitations on the embodiments of this application.

[0290] Hereinafter, a communication device provided in an embodiment of this application will be described.

[0291] In this application, the communication device is divided into functional modules based on the examples of the foregoing methods. For example, functional modules corresponding to functions may be obtained by such division, or two or more functions may be integrated into one processing module. The integrated module may be implemented in the form of hardware or in the form of software functional modules. It should be noted that the module division in this application is an example and is merely a logical function division. During actual implementation, another division method may be used. Hereinafter, with reference to FIGS. 5 to 7, the communication device in the embodiments of this application will be described in detail.

[0292] FIG. 5 is a schematic diagram of the structure of a communication device according to an embodiment of this application. As shown in FIG. 5, the communication device includes a processing unit 501 and a transceiver unit 502.

[0293] In some embodiments of the present application, the communication device may be the above receiving device, a chip in the receiving device, etc. In other words, the communication device may be configured to execute the steps or functions performed by the receiving device in the method embodiments.

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

[0295] The processing unit 501

Number

Number

Number

Number

Number

[0296] It will be understood that the transceiver unit 502 being configured to input a PPDU includes the transceiver unit 502 being configured to receive the PPDU transmitted by the transmitting device.

[0297] In this embodiment of the present application, the PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n matrix, or R n×n For the description of the matrix, please refer to the description of the method embodiment (including Figure 4b). The details will not be described again here.

[0298] It should be understood that the specific descriptions of the transceiver unit and the processing unit described in this embodiment of the present application are merely examples. For the specific functions, steps, etc. of the transceiver unit and the processing unit, please refer to the foregoing method embodiments. The details will not be described again here. For example, the transceiver unit 502 may be further configured to execute the receiving step of step 402 shown in Figure 4a, and the processing unit 501 may be further configured to execute step 403 shown in Figure 4a.

[0299] Figure 5 is reused. In some embodiments of the present application, the communication device may be the above-mentioned transmission device, a chip in the transmission device, etc. In other words, the communication device may be configured to execute the steps or functions executed by the transmission device in the method embodiment.

[0300] For example, the processing unit 501 is configured to determine to generate a PPDU. The transceiver unit 502 is configured to output the PPDU.

[0301] It should be understood that the transceiver unit 502 being configured to output the PPDU includes the transceiver unit 502 being configured to transmit the PPDU to the receiving device.

[0302] In this embodiment of the present application, the PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n matrix, or R n×nFor the description of the matrix, please refer to the description of the method embodiment (including Figure 4b). Details will not be described again here.

[0303] It should be understood that the specific descriptions of the transceiver unit and the processing unit described in this embodiment of the present application are merely examples. For the specific functions, steps, etc. of the transceiver unit and the processing unit, please refer to the method embodiments described above. Details will not be described again here. For example, the processing unit 501 may be further configured to execute step 401 shown in Figure 4a, and the transceiver unit 502 may be further configured to execute the transmission step of step 402 shown in Figure 4a.

[0304] For example, the processing unit 501 provided in this embodiment of the present application may further include a pilot subcarrier processing component and a data subcarrier processing component. For example, when the communication device is a receiving device, the receiving device may use the pilot subcarrier processing component to perform phase tracking and / or frequency offset estimation, etc., or use the data subcarrier processing component to perform channel estimation, etc.

[0305] The transmitting device and the receiving device in this embodiment of the present application have been described above. In the following, possible product forms of the transmitting device and the receiving device will be described. It should be understood that any form of product having the functions of the transmitting device in Figure 5 and any form of product having the functions of the receiving device in Figure 5 fall within the protection scope of the embodiments of the present application. It should be further understood that the following description is merely an example and does not limit the product forms of the transmitting device and the receiving device in this embodiment of the present application.

[0306] In one possible implementation, in the communication device shown in FIG. 5, the processing unit 501 may be one or more processors. The transceiver unit 502 may be a transceiver, or the transceiver unit 502 may be a transmitting unit and a receiving unit. The transmitting unit may be a transmitter, and the receiving unit may be a receiver. Alternatively, the transmitting unit and the receiving unit are integrated into one component, such as a transceiver. In this embodiment of the present application, the processor and the transceiver may be coupled, etc. The connection method between the processor and the transceiver is not limited in this embodiment of the present application.

[0307] As shown in FIG. 6, the communication device 60 includes one or more processors 620 and a transceiver 610.

[0308] For example, when the communication device is configured to execute steps, methods, or functions performed by a receiving device, the transceiver 610 is configured to receive a PPDU from a transmitting device. The processor 620 is configured to process signals received in a plurality of LTF symbols according to the first matrix

Number

[0309] For example, when the communication device is configured to execute steps, methods, or functions performed by a transmitting device, the processor 620 is configured to generate a PPDU. The transceiver 610 is configured to transmit the PPDU to a receiving device.

[0310] In this embodiment of the present application, for the description of PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n matrix, or R n×n matrix, please refer to the description of the method embodiment (including FIG. 4b). Details are not described again here.

[0311] For a specific description of the processor and the transceiver, it will be understood that reference may be made to the description of the processing unit and the transceiver unit shown in FIG. 5. Details will not be described again here.

[0312] In each embodiment of the communication device shown in FIG. 6, the transceiver may include a receiver and a transmitter. The receiver is configured to perform the function (or operation) of receiving, and the transmitter is configured to perform the function (or operation) of transmitting. The transceiver is configured to communicate with another device / equipment via a transmission medium.

[0313] Optionally, the communication device 60 may further include one or more memories 630 configured to store program instructions and / or data. The memory 630 is coupled to the processor 620. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, and may be electrical, mechanical, or in another form, and is used for information exchange between devices, units, or modules. The processor 620 may cooperate with the memory 630. The processor 620 may execute the program instructions stored in the memory 630. Optionally, at least one of the one or more memories may be included in the processor. In this embodiment of the present application, the memory 630 may store one or more of the first vector x, the second vector y, the third vector x', the fourth vector y', etc. For example, only the first vector x and the second vector y are shown in the memory shown in FIG. 6. In FIG. 6, it will be understood that the dashed lines indicate that the first vector x and the second vector y are stored in the memory. The reason for using the dashed lines is that the memory may store only the first vector x, only the second vector y, or both the first vector x and the second vector y.

[0314] Therefore, the communication device (e.g., a transmitting device or a receiving device) only needs to store the first vector x or the second vector y to obtain a complete P n×nThe matrix can be obtained. Thereby, the storage space of the communication device can be effectively saved, and P n×n the complexity of restoring the matrix can be reduced.

[0315] The specific connection medium between the transceiver 610, the processor 620, and the memory 630 is not limited in this embodiment of the present application. In this embodiment of the present application, the memory 630, the processor 620, and the transceiver 610 are connected via the bus 650 in FIG. 6, and the bus is represented by a thick line in FIG. 6. The connection methods between other components are schematically described and are not limited thereto. The bus can be classified into an address bus, a data bus, a control bus, etc. For ease of illustration, in FIG. 6, the bus is shown by using only one thick line. However, this does not indicate that there is only one bus or only one type of bus.

[0316] 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 another programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logical 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 methods disclosed with reference to the embodiments of the present application may be directly executed and performed by a hardware processor, or may be executed and performed using a combination of hardware modules and software modules within the processor.

[0317] In this 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), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM). The memory can be used to carry or store program code in the form of instructions or data structures and is any storage medium that can be read and written by a computer (such as the communication device shown in the present application). However, it is not limited to these. The memory in the embodiments of the present application may alternatively be a circuit or any other device capable of implementing a storage function and configured to store program instructions and / or data.

[0318] The processor 620 is mainly configured to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of software programs. The memory 630 is mainly configured to store software programs and data. The transceiver 610 may include a control circuit and an antenna. The control circuit is mainly configured to perform conversion between baseband signals and radio frequency signals and process radio frequency signals. The antenna is mainly configured to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices such as a touch screen, a display screen, or a keyboard are mainly configured to receive data input by a user and output data to the user.

[0319] After the communication device is powered 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 transmitted wirelessly, the processor 620 executes baseband processing on the data to be transmitted and then outputs the baseband signal to the radio frequency circuit. After performing radio frequency processing on the baseband signal, the radio frequency circuit transmits the radio frequency signal in the form of electromagnetic waves via the antenna. When data is transmitted to the communication device, the radio frequency circuit receives the radio frequency signal via 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.

[0320] In another embodiment, the radio frequency circuit and the antenna may be arranged independently of the processor that performs baseband processing. For example, in a distributed scenario, the radio frequency circuit and the antenna may be remotely arranged and independent of the communication device.

[0321] It will be understood that the communication device shown in this embodiment of the present application may further have more components etc. than those shown in FIG. 6. This is not limited in this embodiment of the present application. The methods executed by the processor and the transceiver are merely examples. For the specific steps executed by the processor and the transceiver, please refer to the above methods.

[0322] In another possible embodiment, in the communication device shown in FIG. 5, the processing unit 501 may be one or more logic circuits, and the transceiver unit 502 may be an input / output interface, also called a communication interface, an interface circuit, an interface, etc. Alternatively, the transceiver unit 502 may be a transmission unit and a reception unit. The transmission unit may be an output interface, and the reception unit may be an input interface. Alternatively, the transmission unit and the reception unit are integrated into one unit, for example, an input / output interface. As shown in FIG. 7, the communication device includes a logic circuit 701 and an interface 702. In other words, the processing unit 501 may be implemented using the logic circuit 701, and the transceiver unit 902 may be implemented using the interface 702. The logic circuit 701 may be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC), etc. The interface 702 may be a communication interface, an input / output interface, a pin, etc. For example, FIG. 7 is an example where the communication device is a chip. The chip includes a logic circuit 701 and an interface 702.

[0323] In this embodiment of the present application, the logic circuit may be further coupled to the interface. The specific connection manner of the logic circuit and the interface is not limited in this embodiment of the present application.

[0324] For example, when the communication device is configured to execute a method, function, or step executed by a receiving device, the interface 702 is configured to input a PPDU. The logic circuit 701 is configured to process the signal received by a plurality of LTF symbols according to the first matrix

Number

[0325] For example, when the communication device is configured to execute a method, function, or step performed by the transmission device, the logic circuit 701 is configured to generate a PPDU. The interface 702 is configured to output the PPDU.

[0326] Optionally, the communication device further includes a memory 703. The memory 703 is configured to store one or more of a first vector x, a second vector y, a third vector x', a fourth vector y', etc. For example, only the first vector x and the second vector y are shown in the memory illustrated in FIG. 7. In FIG. 7, it will be understood that the dashed lines indicate that the first vector x and the second vector y are stored in the memory. The reason for using the dashed lines is that the memory can store only the first vector x, only the second vector y, or both the first vector x and the second vector y.

[0327] Thus, the communication device (e.g., a transmission device or a reception device) can obtain a complete P n×n matrix by storing only the first vector x or the second vector y. Thereby, the storage space of the communication device can be effectively saved, and the complexity of restoring the P n×n matrix can be reduced.

[0328] It will be understood that the communication device shown in this embodiment of the present application can implement the method provided in the embodiments of the present application in the form of hardware or software. This is not limited in the embodiments of the present application.

[0329] In this embodiment of the present application, for the description of the PPDU, LTF symbol, data subcarrier, pilot subcarrier, first matrix, P n×n matrix, or R n×n matrix, refer to the description of the method embodiment (including FIG. 4b). Details are not described again here.

[0330] For the specific implementation of the embodiment shown in FIG. 7, please refer to the foregoing embodiments. Details will not be described again here.

[0331] One embodiment of the present application further provides a wireless communication system. The wireless communication system includes a transmitting device and a receiving device. The transmitting device and the receiving device may be configured to execute the methods in any embodiment (e.g., FIG. 4a).

[0332] In addition, the present application further provides a computer program. The computer program is used to implement the operations and / or processes executed by the transmitting device in the method provided by the present application.

[0333] The present application further provides a computer program. The computer program is used to implement the operations and / or processes executed by the receiving device in the method provided by the present application.

[0334] The present application further provides a computer-readable storage medium. The computer-readable storage medium stores computer code. When the computer code is executed on a computer, the computer is enabled to execute the operations and / or processes executed by the transmitting device in the method provided by the present application.

[0335] The present application further provides a computer-readable storage medium. The computer-readable storage medium stores computer code. When the computer code is executed on a computer, the computer is enabled to execute the operations and / or processes executed by the receiving device in the method provided by the present application.

[0336] This application further provides a computer program product. The computer program product includes computer code or a computer program. When the computer code or the computer program is executed on a computer, the operations and / or processes executed by the transmitting device in the method provided by this application are executed.

[0337] This application further provides a computer program product. The computer program product includes computer code or a computer program. When the computer code or the computer program is executed on a computer, the operations and / or processes executed by the receiving device in the method provided by this application are executed.

[0338] In some embodiments provided by this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the described device embodiments are merely examples. For example, the division into units is merely a logical function division, and in actual implementation, other divisions may be possible. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the shown or considered mutual coupling or direct coupling or communication connection may be implemented via some interfaces. The indirect coupling or communication connection between devices or units may be implemented in an electrical form, a mechanical form, or another form.

[0339] The units described as separate parts may or may not be physically separate, and the parts shown as units may or may not be physical units. In other words, they may be located in one place or may be distributed over multiple network units. Some or all of the units may be selected based on actual requirements to achieve the technical effects of the solutions provided in the embodiments of this application.

[0340] In addition, the functional units in the embodiments of the present application may be integrated into one processing unit, each of these units may physically exist independently, or two or more units may be integrated into one unit. The integrated unit may be implemented in the form of hardware or in the form of a software functional unit.

[0341] When the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, the integrated unit may be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, may also be implemented in the form of a software product. The computer software product is stored in a readable storage medium and includes several instructions for instructing a computer device (which may be a personal computer, a server, a network device, etc.) to execute all or part of the steps of the method described in the embodiments of the present application. The readable storage medium includes any medium that can store program code, such as a USB flash drive, a removable hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0342] The foregoing description is only a specific embodiment of the present application, and the protection scope of the present application is not limited thereto. Any deformation or substitution that can be easily conceived by those skilled in the art within the technical scope disclosed in the present application shall fall within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Description of Reference Signs

[0343] 501 Processing Unit 502 Transceiver Unit 610 Transceiver 620 Processor 630 Memory 701 Logic Circuit 702 Interface 703 Memory

Claims

1. 1. A method of signal processing, comprising: receiving a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols; First matrix [0010] processing the received signal with the plurality of LTF symbols according to [0025] P n×n matrix, or said first matrix [0030] P n×n It is obtained according to the matrix, [0045] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [0050] The matrix is n×n a transpose of n, n being an integer greater than 8, and k indicating a k-th subcarrier in each of the plurality of LTF symbols; A method comprising:

2. 1. A method of signal processing, comprising: generating a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [006] said first matrix being used to convey the sequence obtained according to [0070] P n×n matrix, or said first matrix [0080] P n×n It is obtained according to the matrix, [0090] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [0010] The matrix is n×n a transpose of n, n being an integer greater than 8, and k indicating a kth subcarrier in each of the plurality of LTF symbols; transmitting the PPDU; A method comprising: 【Request 3】 【Number 11】 ##EQU00012## ##EQU00013## or ##EQU14## and The above S （n－1）×（n－1） The matrix is n×n is a submatrix of the matrix S （n－1）×（n－1） The matrix has n-1 rows and n-1 columns, α is a column vector with n-1 elements, each element being 1, and α T is the transpose vector of α, and −α denotes the vector obtained by negating all elements in α. The method according to claim 1 or 2.

4. The above S （n－1）×（n－1） The method of claim 3 , wherein the matrix is ​​a circulant matrix or a Hankel matrix.

5. The above S （n－1）×（n－1 ) The first row of the matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1], The above S （n－1）×（n－1） The first row of the matrix is ​​obtained by performing one or more of the following three operations on the first vector x: circular shift, inversion, and total negation, where x = [1 1 1-1 1-1-1 1-1-1-1]; The above S （n－1）×（n－1） The first row of the matrix is ​​equal to the second vector y, y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or The above S （n－1）×（n－1） The first row of the matrix is ​​obtained by performing one or more of the three operations of circular shift, inversion, and total negation on the second vector y, where y = [1 1 1-1-1-1-1-1 1-1 1-1-1-1 1 1-1].

5. The method according to claim 3 or 4.

6. For n=12, ##EQU00015## ##EQU00016## ##EQU00017## [0018] or [0019] 6. The method according to claim 1, wherein

7. For n=16, [0020] ##EQU00021## or [0022] 6. The method according to claim 1, wherein

8. For n=16, [0023] ##EQU00024## [0025] or [0026] and [0027] The method according to claim 1 or 2,

9. The first matrix [0028] but, [0029] and R n×n The matrix has n rows and n columns, and R n×n Each row of the matrix is n×n The method according to any one of claims 1 to 8, wherein the condition is satisfied that the first row of the matrix is ​​equal to the first row of the matrix.

10. When the k-th subcarrier is a non-pilot subcarrier, the first matrix is n×n It is equal to the total negation of a matrix. The first matrix is ​​P n×n It is equal to the transpose of a matrix, The first matrix is ​​P n×n Equal to the transpose of the total negation of a matrix, or The first matrix is ​​P n×n 9. The method of claim 1, wherein the matrix transpose is equal to the total negation of the matrix.

11. R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, n×n The method according to claim 9 or 10, wherein the matrix is ​​used for channel estimation.

12. A communication device, comprising: a transceiver unit configured to receive a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a number of LTF symbols; First matrix [0030] a processing unit configured to process a signal received on the plurality of LTF symbols according to [0031] P n×n matrix, or said first matrix [0032] P n×n It is obtained according to the matrix, [Equation 33] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [0034] The matrix is n×n a transpose of a matrix, n being an integer greater than 8, and k indicating a k-th subcarrier in each of the plurality of LTF symbols; A communication device comprising:

13. A communication device, comprising:

1. A processing unit configured to generate a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [Equation 35] said first matrix being used to convey the sequence obtained according to [0036] P n×n matrix, or the first matrix [Equation 37] P n×n It is obtained according to the matrix, [Equation 38] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [0039] The matrix is n×n a processing unit, where n is an integer greater than 8, and k indicates a k-th subcarrier in each of the plurality of LTF symbols; a transceiver unit configured to transmit the PPDU; A communication device comprising: 【Request 14】 【Number 40】 [0041] [0042] or [0043] and S （n－1）×（n－1） The matrix is n×n is a submatrix of the matrix S （n－1）×（n－1） The matrix has n-1 rows and n-1 columns, α is a column vector with n-1 elements, each element being 1, and α T is the transposed vector of α, and −α denotes the vector obtained by negating all elements in α. A communication device according to claim 12 or 13.

15. S （n－1）×（n－1） 15. The communication device of claim 14, wherein the matrix is ​​a circulant matrix or a Hankel matrix.

16. S （n－1）×（n－1 ) The first row of the matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1], S （n－1）×（n－1） The first row of the matrix is ​​obtained by performing one or more of the following three operations on the first vector x: circular shift, inversion, and total negation, where x = [1 1 1-1 1-1-1 1-1-1-1]; S （n－1）×（n－1） The first row of the matrix is ​​equal to the second vector y, y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or S （n－1）×（n－1） The first row of the matrix is ​​obtained by performing one or more of the following three operations on the second vector y: circular shift, inversion, and total negation, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1].

16. A communication device according to claim 14 or 15.

17. For n=12, [0044] [0045] [0046] [0047] or [0048] 17. The communication device according to claim 12, wherein:

18. For n=16, [0049] [Number 50] or [0051] 17. The communication device according to claim 12, wherein:

19. For n=16, [0052] [0,53] [0,54] or [0.55] and [0,56] The communication device according to claim 12 or 13,

20. The first matrix [0.57] but, [0,58] and R n×n The matrix has n rows and n columns, and R n×n Each row of the matrix is n×n The communication device according to claim 12 , wherein the condition is satisfied that the first row of the matrix is ​​equal to the second row of the matrix.

21. When the k-th subcarrier is a non-pilot subcarrier, the first matrix is n×n It is equal to the total negation of a matrix. The first matrix is ​​P n×n It is equal to the transpose of a matrix, The first matrix is ​​P n×n Equal to the transpose of the total negation of a matrix, or The first matrix is ​​P n×n 20. A communication device according to any one of claims 12 to 19, wherein the matrix transpose is equal to the total negation of the matrix.

22. R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, n×n 22. A communications device according to claim 20 or 21, wherein the matrix is ​​used for channel estimation.

23. A communication device comprising a processor and a memory, The processor is configured to store computer-executable instructions; 12. A communications device, the processor configured to execute the computer-executable instructions to perform the method of any one of claims 1 to 11.

24. 1. A communications device comprising: a logic circuit; and an interface, the logic circuit coupled to the interface; A communications device, wherein the interface is configured to input and / or output code instructions, and the logic circuit is configured to execute the code instructions in order to perform a method according to any one of claims 1 to 12.

25. 13. A computer readable storage medium configured to store a computer program which, when executed, performs the method of any one of claims 1 to 12.

26. A computer program which, when executed, performs the method according to any one of claims 1 to 12.

Images