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, titled "SIGNAL PROCESSING METHOD AND APPARATUS," filed with the China National Intellectual Property Administration on 11 December 2020, which is incorporated herein by reference in its entirety.

[0002] This application relates to the field of communication technology, and more particularly to signal processing methods and apparatus. [Background technology]

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

[0004] However, how the receiving end performs channel estimation and other operations based on LTF urgently needs to be resolved. [Overview of the project] [Means for solving the problem]

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

[0006] According to a first aspect, one embodiment of the present application provides a signal processing method. The method comprises the steps of receiving a physical (PHY) layer protocol data unit (PHY protocol data unit, PPDU), wherein the PPDU includes a preamble, the preamble includes a long training field (LTF), and the LTF includes a plurality of LTF symbols, and a first matrix

number

number

number

number

number

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

[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 for 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) for 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 for 4 streams, 8 streams, etc. In another example, the receiving device can support MIMO channel estimation for 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 for a plurality of different numbers of streams can be performed, and the redundancy of MIMO channel estimation is effectively reduced. In other words, the receiving device can simultaneously process signals received with a plurality of LTF symbols and 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

number

number

number

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

number

number

number

number

[0012] In this embodiment of the present application, P n×n The matrix is ​​an orthogonal matrix, and the submatrix S (n-1)×(n-1) This ensures that P is a cyclic matrix or a Hankel matrix.n×n This reduces the space occupied by matrices, saves memory space, and effectively reduces the complexity of implementing communication devices.

[0013] In relation to the first or second aspect, in one possible embodiment, S (n-1)×(n-1) The matrix is ​​a cyclic matrix or a Hankel matrix.

[0014] In this embodiment of the present application, P n×n Submatrix S of a matrix (n-1)×(n-1) The matrix is ​​set to a cyclic matrix or a Hankel matrix, and the communication device has a submatrix S (n-1)×(n-1) A submatrix can be reconstructed simply by storing the vector in the first row or first column. This effectively saves memory space in communication devices and reduces implementation complexity.

[0015] In relation to the first or second aspect, in one possible embodiment, S (n-1)×(n-1 The first row of the matrix is ​​equal to the first vector x, so 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: cyclic 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, 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 following three operations on the second vector y: cyclic shift, inversion, and total negation, so that y = [1 1 1-1-1-1-1 1-1 1-1-1 1 1-1].

[0016] The communication device P n×n Submatrix S of a matrix (n-1)×(n-1) After obtaining the first line of S (n-1)×(n-1) It may be obtained. Therefore, the communication device, in order to reconstruct the submatrix, P n×nSubmatrix S of a matrix (n-1)×(n-1) It is sufficient to store only the rows. Alternatively, once the relationship between the rows of the submatrix and the first or second vector is determined, the communication device can reconstruct the submatrix by simply storing the first or second vector. This allows P n×n This reduces the space occupied by matrices, saves memory space, and effectively reduces the complexity of implementing communication devices (for example, P n×n Submatrix S of a matrix (n-1)×(n-1) (This can be restored based on calculations such as cyclic shifts.)

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

number

number

number

number

number

[0018] In this embodiment of the present application, P 8×8 The matrix is ​​expanded, P 16×16 A matrix is ​​generated. This ensures that the communication device supports the transmission of 16 streams of data and avoids overly complex operations.

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

number

number

[0020] R n×n A matrix contains n rows and n columns, R n×n Each row of the matrix is ​​P n×n It is equivalent to the first row of a matrix.

[0021] In relation to the first or second aspect, in one possible embodiment, when the k-th subcarrier is a non-pilot subcarrier, the first matrix is ​​P n×n The first matrix that is equal to the total negation of a matrix is ​​P. n×n The first matrix that is equal to the transpose of the matrix is ​​P. n×n The first matrix is ​​equal to the transpose of the total negation of the matrix, or the first matrix is ​​P n×n It is equal to the total negation of the transpose of the matrix.

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

[0023] In this embodiment of the present application, P n×n matrix, E n×n For a detailed explanation of matrices, the first matrix, etc., please refer to the example shown below. Further details are not provided here.

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

[0025] For example, the communication device may be a transmitting device, a chip within the transmitting device, or the like.

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

[0027] For example, the communication device may be a receiving device, a chip within the receiving device, or the like.

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

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

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

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

[0032] Unless otherwise specified, operations such as transmission, sending, and receiving associated with a processor may be more generally understood as operations such as output, reception, and input of a processor, provided that the operation does not conflict with the actual function or internal logic of the operation in the relevant description.

[0033] In the implementation process, the processor may be a processor specifically configured to perform these methods, or it may be a processor that executes computer instructions in memory to perform these methods, such as a general-purpose processor. The memory may be non-transitory memory, such as read-only memory (ROM). The memory and processor may be integrated on the same chip, or they may be located separately on different chips. The type of memory and the arrangement of the memory and processor are not limited to this embodiment of the present application. It will be understood that the description of the processor and memory is also applicable to the sixth embodiment shown below. For the sake of clarity, the details will not be described again in the sixth embodiment.

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

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

[0036] In this embodiment of the present application, the processor and memory may be integrated into a single component. In other words, the processor and memory may be combined into a single unit. It will be understood that the memory in this embodiment of the present application may be configured to store one or more of the following: a first vector x, a second vector y, a third vector x', a fourth vector y', and so on.

[0037] 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 further configured to receive a PPDU, etc.

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

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

[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 memory may be integrated into a single component. In other words, the processor and memory may be combined into a single unit. It will be understood that the memory in this embodiment of the present application may be configured to store one or more of the following: a first vector x, a second vector y, a third vector x', a fourth vector y', and so on.

[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 within the receiving device, or the like.

[0045] According to a seventh aspect, one embodiment of the present application provides a communication device. The communication device includes a logic circuit and an interface, the logic circuit being coupled to the interface. The interface is configured to take a PPDU as input, and the logic circuit takes a first matrix

number

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

[0047] LTF symbol, first matrix, P n×n matrix, R n×n For explanations of matrices and other related concepts, please refer to the descriptions of the first or second embodiment, or the various embodiments shown below. Further details will not be explained again here.

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

[0049] LTF symbol, first matrix, P n×n matrix, R n×n For explanations of matrices and other related concepts, please refer to the descriptions of the first or second embodiment, or the various embodiments shown below. Further details will not be explained again here.

[0050] According to the ninth aspect, one 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, a method in the first aspect or any one of the possible embodiments of the first aspect is performed.

[0051] According to a tenth aspect, one 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, a method in the second aspect or any one of the possible embodiments of the second aspect is performed.

[0052] According to the eleventh aspect, one embodiment of the present application provides a computer program product, which comprises a computer program or computer code, and when the computer program product is executed on a computer, a method in the first aspect or one of a possible embodiment of the first aspect is performed.

[0053] According to the twelfth aspect, one embodiment of the present application provides a computer program product, which comprises a computer program or computer code, and when the computer program product is executed on a computer, a method in the second aspect or one of the possible embodiments of the second aspect is performed.

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

[0055] According to the fourteenth aspect, one embodiment of the present application provides a computer program. When the computer program is executed on a computer, a method in the second aspect or one of the possible embodiments of the second aspect is performed.

[0056] According to the fifteenth aspect, one embodiment of the present application provides a wireless communication system. The wireless communication system includes a transmitting device and a receiving device. The transmitting device is configured to perform a method in any one of the first aspect or a possible embodiment of the first aspect. The receiving device is configured to perform a method in any one of the second aspect or a possible embodiment of the second aspect. [Brief explanation of the drawing]

[0057] [Figure 1] This is a schematic diagram of a communication system according to one embodiment of the present application. [Figure 2] This is a schematic diagram of the structure of an access point (AP) device or station (STA) device according to one embodiment of this application. [Figure 3a] This is a schematic diagram of the structure of a PPDU according to one embodiment of this application. [Figure 3b] This is a schematic diagram illustrating the relationship between a spatial stream and an LTF symbol according to one embodiment of this application. [Figure 4a] This is a schematic flowchart of a signal processing method according to one embodiment of this application. [Figure 4b] This is a schematic diagram of the structure of another PPDU according to one embodiment of this application. [Figure 5] This is a schematic diagram of the structure of a communication device according to one embodiment of this application. [Figure 6] This is a schematic diagram of the structure of a communication device according to one embodiment of this application. [Figure 7] This is a schematic diagram of the structure of a communication device according to one embodiment of this application. [Modes for carrying out the invention]

[0058] To further clarify the purpose, technical solutions, and advantages of this application, the application will be described below with reference to the attached drawings.

[0059] In the specification, claims, and accompanying drawings of this application, terms such as “first” and “second” are used solely to distinguish different subjects and do not indicate a particular order. Furthermore, “includes,” “has,” or any other variation thereof are intended to encompass non-exclusive inclusion. For example, a process, method, system, product, or device comprising a series of steps or units is not limited to the listed steps or units, but may optionally include further steps or units not listed, and may optionally include further steps or units specific to the process, method, product, or device.

[0060] The “embodiments” as used herein mean that certain characteristics, structures, or features described with reference to an embodiment may be included in at least one embodiment of this application. The terms used in various parts of this specification do not necessarily refer to the same embodiment, nor are they exclusive, independent, or optional embodiments from another embodiment. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0061] In this application, “at least one part (item)” means one or more, “more than” means two or more, and “at least two parts (items)” means two, three or more. The term “and / or” is used to describe the relationship between related subjects and indicates that three relationships may exist. For example, “A and / or B” can represent the following three cases: the case where only A is present, the case where only B is present, and the case where both A and B are present, and A and B may be singular or plural. The symbol “ / ” usually indicates an “or” relationship between related subjects. “At least one of the following items (parts)” or a similar expression means any combination of these items. For example, at least one (part) 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 methods provided in this application can be applied to various communication systems, such as Internet of Things (IoT) systems, narrow-band Internet of Things (NB-IoT) systems, long-term evolution (LTE) systems, fifth-generation (5G) communication systems, and new communication systems that will emerge in future communication developments (e.g., 6G). The methods provided in this application can be further applied to wireless local area network (WLAN) systems, such as wireless fidelity (Wi-Fi).

[0063] The method provided in this application may be implemented by a communication device within a wireless communication system. For example, the communication device may be an access point (AP) device or a station (STA) device. Alternatively, the communication device may be a wireless communication device that supports simultaneous transmission over multiple links. For example, the communication device may be called a multi-link device (MLD) or a multi-band device.

[0064] The method provided in this application may be applied to scenarios in which one node performs data transmission with one or more nodes, or it may be applied to single-user uplink / downlink transmission or multi-user uplink / downlink transmission, or it may be applied to device-to-device (D2D) transmission. Details are not described here. A node may be an AP or an STA. For the sake of clarity, communication between an AP and an STA will be used as an example below.

[0065] For example, a communication system to which the method provided in this application may be applied may include access point (AP) devices and station (STA) devices. An access point device may also be understood as an access point entity, and a station device may also be understood as a station entity. For example, this application is applicable to a scenario in which an AP communicates with an STA in a WLAN. Optionally, the AP may communicate with a single STA, or the AP may communicate with multiple STAs simultaneously. Specifically, communication between an AP and multiple STAs can be further classified into downlink transmissions, where the AP simultaneously signals to multiple STAs, and uplink transmissions, where multiple STAs signal to the AP. The AP and STAs may support a WLAN communication protocol. The communication protocol may include the IEEE 802.11be (also known as Wi-Fi 7 or EHT protocol) protocol, and may further include protocols such as the IEEE 802.11ax and IEEE 802.11ac protocols. With the continued evolution and development of communication technology, it is clear that the communication protocol may further include next-generation protocols such as IEEE 802.11be.

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

[0067] An access point (e.g., the AP in Figure 1) is a device equipped with wireless communication capabilities that supports communication according to the WLAN protocol and has the ability to communicate with other devices (e.g., a station or another access point) in the WLAN. It is clear that an access point may further have the ability to communicate with other devices. Alternatively, an access point corresponds to a bridge connecting a wired network and a wireless network. The main function of an access point is to connect various wireless network clients together and then connect the wireless network to Ethernet. In a WLAN system, an access point is sometimes called an access point station (AP STA). A device equipped with wireless communication capabilities may be an entire device or a chip or processing system mounted on the entire device. A device on which a chip or processing system is installed may implement the methods and functions of the embodiments of this application under the control of the chip or processing system. The AP in this embodiment of this application is a device that provides services to an STA and may support the 802.11 series protocol. For example, an access point may be an access point for terminal devices (e.g., mobile phones) to access a wired (or wireless) network and is mainly deployed in homes, buildings, and parks. A typical coverage radius is several tens of meters to over 100 meters. It is clear that access points may alternatively be deployed outdoors. In another example, the AP may be a communications entity, such as a communications server, router, switch, or bridge, or the AP may include various forms of macro base stations, micro base stations, relay stations, etc. It is clear that the AP may alternatively be a chip or processing system within various forms of these devices to implement the methods and functions in embodiments of this application. The access points in this application may be high-efficiency (HE) APs, extremely high-throughput (EHT) APs, or access points applicable to future WiFi standards.

[0068] A station (e.g., STA1, STA2 in Figure 1) is a device having wireless communication capabilities, supporting communication according to the WLAN protocol, and having the ability to communicate with other stations or access points in the WLAN. In a WLAN system, a station is sometimes called a non-access point station (non-AP STA). For example, an STA is any user communication device that enables a user to communicate with an AP and then with the WLAN. A device with wireless communication capabilities may be an entire device or a chip or processing system mounted on the entire device. A device on which a chip or processing system is installed may implement the methods and functions of the embodiments of this application under the control of the chip or processing system. For example, a 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, a station may be a mobile phone supporting WiFi communication capabilities, a tablet computer supporting WiFi communication capabilities, a set-top box supporting WiFi communication capabilities, a smart TV supporting WiFi communication capabilities, an intelligent wearable device supporting WiFi communication capabilities, an in-vehicle communication device supporting WiFi communication capabilities, or a computer supporting WiFi communication capabilities.

[0069] WLAN systems can provide high-speed and low-latency transmission. With the continued 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, wards, classrooms, supermarkets, squares, streets, production workshops, and warehouse storage. Devices supporting WLAN communication (such as access points or stations) may include sensor nodes in smart cities (e.g., smart water meters, smart electricity meters, or smart air detection nodes), smart devices in smart homes (e.g., smart cameras, projectors, displays, televisions, stereos, refrigerators, or washing machines), nodes in the Internet of Things, entertainment terminals (e.g., AR, VR, or other wearable devices), smart devices in smart offices (e.g., printers, projectors, speakers, or stereos), Internet of Vehicle devices in the Internet of Vehicles, infrastructure in everyday life scenarios (e.g., vending machines, self-service navigation stations in supermarkets, self-service cash register devices, or self-service ordering machines), and devices in large sports and music venues. 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 remotes, and smart water meters in smart homes, as well as sensors in smart cities. Specific forms of STA and AP are not limited to this embodiment of the present application; they are merely examples for illustrative purposes.

[0070] While this application primarily describes a network deployed with IEEE 802.11 as an example, it will be readily apparent to those skilled in the art that various aspects of this application can be extended to other networks using various standards or protocols, such as Bluetooth®, High Performance Radio LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard and primarily used in Europe), Wide Area Networks (WANs), Wireless Local Area Networks (WLANs), Personal Area Networks (PANs), or other known or subsequently developed networks.

[0071] For example, Figure 2 is a schematic diagram of the structure of an access point and a station according to one embodiment of the present application. The AP may have multiple antennas or a single antenna. As shown in Figure 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 PHY and MAC. As shown in Figure 2, Figure 2 further illustrates a schematic diagram of the structure of an STA with a single antenna. In practical scenarios, the STA may alternatively have multiple antennas, and may be a device with 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 yet another example, the transmitting device is an access point device, and the receiving device is a station device. In yet another example, the transmitting device is a station device, and the receiving device is an access point device. It will be understood that the transmitting device and receiving device described herein may collectively be referred to as a communication device.

[0073] It will be understood that the signal processing method provided in this application will be described using an example in which a transmitting device transmits a PPDU to a receiving device of this application. However, the method shown in this application is further applicable to various types of PPDUs. For example, PPDUs may include multiple-user physical layer protocol data units (MU PPDUs), single-user physical layer protocol data units (SU PPDUs), trigger-based physical layer protocol data units (TB PPDUs), and the like.

[0074] The following terms related to this application will be explained.

[0075] 1. Orthogonal frequency division multiplexing (OFDM) Orthogonal frequency division multiplexing (OCD) is a multi-carrier transmission technique. This technique can utilize multiple adjacent orthogonal subcarriers, each of which can be modulated using modulation techniques. Therefore, OCD can achieve high-rate transmission and effectively withstand frequency selective fading. For example, VHT-LTF1 to VHT-LTFN in Figure 3a can also be understood as OFDM symbols. In other words, VHT-LTF in the physical (PHY) layer protocol data unit (PPDU) shown in Figure 3a can also be understood as containing N OFDM symbols.

[0076] 2. Physical (PHY) Layer Protocol Data Unit (PPDU) For example, Figure 3a is a schematic diagram of the frame structure of a very high throughput (VHT) PPDU (also known as an 802.11ac PPDU). As shown in Figure 3a, a VHT PPDU includes data (VHT data), a legacy physical layer preamble, and a very high throughput preamble (VHT preamble). The legacy physical layer 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 (also called VHTSIGA) may contain two OFDM symbols, each with a duration of 4 μs. VHT-LTF may contain N VHT-LTF symbols, which can be used to help the receiving device correctly estimate the channel in order to help the receiving device correctly decode the received data information.

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

[0078] 3. Pilot subcarrier and data subcarrier In WLAN communication protocols, each OFDM symbol may contain a pilot subcarrier and a data subcarrier. The pilot subcarrier is the subcarrier on which a pre-configured sequence is placed or carried within the OFDM symbol, and the data subcarrier is the subcarrier on which data is placed or carried. In communication systems, the pilot subcarrier may be used to assist in the detection and correction of subcarrier phase offset in order to improve the accuracy of the data subcarrier resolution. For example, each VHT-LTF symbol (also called an LTF symbol) contained in the LTF shown in Figure 3a, i.e., each VHT-LTF symbol from VHT-LTF1 to VHT-LTFN, may contain 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. The number of spatial streams is N. STS In this case, the number of OFDM symbols included in the LTF shown in Figure 3a is N. LTF The following relationships may be satisfied.

number

[0080] N STS This indicates the maximum number of spatial streams supported by the communication device (the number of spatial streams can also be abbreviated as the number of streams), N LTFThis indicates 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 Figure 3a are the number of OFDM symbols included in the LTF, where 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 Figure 3a may include multiple data subcarriers and multiple pilot subcarriers, VHT-LTF2 may include multiple data subcarriers and multiple pilot subcarriers, VHT-LTF3 may include multiple data subcarriers and multiple pilot subcarriers, and so on. For example, an LTF may contain N LTF symbols, and each of the N LTF symbols may include multiple data subcarriers and multiple pilot subcarriers. It should be understood that the number of data subcarriers and pilot subcarriers included in each LTF symbol is not limited in this application. For specific numbers of data subcarriers and pilot subcarriers, please refer to the relevant standards or protocols. Details are not provided here. For example, the data subcarriers contained in each of the N LTF symbols included in the LTF may be the same, and the pilot subcarriers contained in each LTF symbol may also be the same.

[0081] LTF can be used to help the receiving end simultaneously estimate the channels of multiple spatial streams. To accurately estimate the channels of spatial streams and keep the LTF symbols for each stream orthogonal, 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 Figure 3b. 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 the cyclic shift diversity (CSD) corresponding to each spatial stream.

[0083] For example, when transmitting a PPDU, the transmitting device may multiply the element in the i-th row and j-th column of the P 4×4 matrix by the j-th LTF symbol corresponding to the i-th spatial stream. 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 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 k received by the receiving device 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 for obtaining the channel response H k and 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 sequences shown above may be defined by relevant standards, protocols, etc., and this is not limited to this application. For example, an 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}. For example, an 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}.

[0091] The aforementioned P matrix is ​​demonstrated 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(-j²π / 6).

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

number

[0095] For example, the specific expression of equation (7) could be as follows:

number

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

[0097] With this in mind, this application provides a signal processing method and apparatus. The method provided in this application is applicable to scenarios where the number of streams is greater than 8. For example, the method provided in this application may support channel estimation for 16 streams, e.g., MIMO channel estimation for 16 streams. As another example, the method provided in this application may further support channel estimation for 32 or 24 streams. In addition, the P provided in this application n×n The matrix is ​​a communication device P n×n This further reduces the space required to store matrices.

[0098] For a description of the communication apparatus and communication system in the signal processing method provided in this application, it will be understood that the above description is necessary. Details will not be repeated here. It will be understood that the method provided in the embodiments of this application will be described below using an example in which the communication apparatus includes a transmitting device and a receiving device. The transmitting device shown below may be understood as a device for transmitting PPDUs, and the receiving device may be understood as a device for receiving PPDUs.

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

[0100] 401: The transmitting device generates a PPDU, the PPDU contains a preamble, the preamble contains an LTF, the LTF contains multiple LTF symbols, the multiple LTF symbols are used to carry the acquired sequence according to a first matrix, the first matrix is ​​P n×n The matrix is, or the first matrix is ​​P n×n Obtained according to the matrix,

Number

Number

[0101] n can indicate the number of rows and columns of the P n×n matrix (which can 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 contain 12 rows and 12 columns. Therefore, the first matrix contains 12 rows and 12 columns. In addition, the maximum number of spatial streams supported by the transmitting device may be 12, and the transmitting device may further multiply the nth LTF symbol corresponding to the mth spatial stream by the mth row and nth column of the first matrix (shown in Figure 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 eight spatial streams, or it may further simultaneously estimate the channels of four 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 contents of the first matrix. For example, when n=16, the first matrix may contain 16 rows and 16 columns. In addition, 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 it may further simultaneously estimate the channels of spatial streams whose number is less than 16. For example, the receiving device is provided in this embodiment of the present application. n×n According to the matrix, channels for 2 to 15 spatial streams may be further estimated, for example, channels for 2 spatial streams, channels for 3 spatial streams, channels for 4 spatial streams, channels for 6 spatial streams, channels for 8 spatial streams, channels for 12 spatial streams, or channels for 15 spatial streams. This is not limited to 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). In addition, 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

Number

[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 called 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, please refer to equations (84) to (89) shown below. n×n Matrices and P n×n For the relationship with matrices, please refer to equation (10) and other examples shown below.

[0108] Therefore, the fact that multiple LTF symbols contained in the LTF are used to carry the sequence obtained according to the first matrix means that the data subcarriers within the multiple LTF symbols are P n×n Used to carry sequences and LTF sequences obtained according to a matrix (which may also be called a P matrix), with pilot subcarriers within multiple LTF symbols being R n×n This includes being used to carry sequences and LTF sequences obtained according to a matrix (which may also be called an R matrix). Furthermore, the receiving device receives the PPDU. Of the multiple LTF symbols contained in the LTF in the PPDU, the portion corresponding to the data subcarrier is P n×n This may also be obtained by multiplying the matrix by the LTF sequence and performing an inverse Fourier transform (which may also be called an inverse Fourier transform). Of the multiple LTF symbols, the portion corresponding to the pilot subcarrier is R n×n This may also be obtained by multiplying the matrix by an LTF sequence and performing an inverse Fourier transform.

[0109] For LTF sequences, 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 should be understood by referring to the previously mentioned explanation, for example, Figure 3a or Figure 3b. Further details will not be explained again here.

[0110] Figure 4b is a schematic diagram of the structure of another PPDU according to one embodiment of the present application. As shown in Figure 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 extremely high throughput short training field (EHT-STF), and an LTF. The LTF contains N EHT-LTFs (which may also be called LTF symbols), and the N EHT-LTF symbols include EHT-LTF1 through EHT-LTFN.

[0111] The PPDU generated by the transmitting device may be shown in Figure 4b, and it will be understood that the LTF symbol may include the EHT-LTF symbol.

[0112] 402: The transmitting device sends a PPDU. In response, the receiving device receives the PPDU.

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

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

[0115] First matrix

number

number

[0116] It will be understood that another case of equation (9) may represent the case where the k-th subcarrier is a non-pilot subcarrier. For example, if the k-th subcarrier is a data subcarrier, the first matrix is

number

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

[0118] [R] m,n R n×n The mth row of the matrix is ​​shown, [P] 1,n P n×n The first row of the matrix is ​​shown, where m and n are both integers between 1 and 16 (inclusive).

[0119] R shown in this embodiment of the present application n×n Each row of the matrix is ​​P n×n The first row of the total negative matrix, P n×n The first row of the transpose of the matrix, P n×n It should be understood that the first row of the transpose of the matrix's total negation can also be equal to the first row of the transpose of the matrix.

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

[0121] Typically, in the case of a 16x16 matrix, a communication device usually needs to store the values ​​of 256 elements. Therefore, when generating an LTF, the communication device (e.g., a transmitting device) can sequentially read the elements of the matrix. However, the P provided in this embodiment of the present application n×n In matrices, S (n-1)×(n-1) By storing only the vectors in the first row or first column of a submatrix (or the first vector x, the second vector y, etc.), S (n-1)×(n-1) Submatrices and P n×n The matrix can be reconstructed. Therefore, the complete P n×nThe matrix does not need to be stored. In this way, the memory space occupied by the matrix can be effectively reduced, and the complexity of the implementation can be reduced. Alternatively, P provided in this application n×n The matrix may include elements 1 and -1, which can further simplify the complexity of the calculation. Alternatively, to effectively resolve spectral bumps (spectral lines), P provided in this application n×n The n elements in the Tth row of a matrix are distinct.

[0122] In the following, P n×n Based on the characteristics of the matrix, P provided in this embodiment of the present application n×n Let's explain matrices. One or more of the following features are P n×n It will be understood that these can also be matrix features. For example, if any of the following features 1-7 is P n×n It may also be a feature of the matrix. Alternatively, P may be a combination of any two of the following features 1-7. n×n These are the characteristics of a matrix. Alternatively, any combination of any three of the following characteristics 1-7 is P. n×n These are characteristics of matrices. Alternatively, the following characteristics 1-7 are all P n×n It could also be a characteristic of a matrix.

[0123] Feature 1: P n×n The matrix contains elements 1 and -1.

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

[0125] Feature 2: P n×n The n elements in the Tth row of a matrix are distinct, and T is an integer between 1 and n (inclusive).

[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. Or, P n×n The n elements in the second row of the matrix are different. Or, P n×n The n elements in row T of the matrix are distinct. 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. This effectively resolves the spectral bump.

[0127] Referring to Features 1 and 2, P provided in this embodiment of the present application n×n The elements of the matrix are simple, P n×n Each row of the matrix has n distinct elements. This resolves the complex operation of the communication device and effectively resolves spectral bumps.

[0128] Feature 3: P n×n Submatrix S of a matrix (n-1)×(n-1) This is a cyclic matrix or Hankel matrix.

[0129] A cyclic matrix may be a special form of a Toeplitz matrix (also known as a diagonal constant matrix). Each element of the column vectors of a cyclic matrix may be the result of sequentially shifting each element of the previous column vector to the right by one bit.

[0130] A Hankel matrix is ​​a square matrix in which all elements on each skew diagonal are equal.

[0131] In this embodiment of the present application, P n×n Submatrix S of a matrix (n-1)×(n-1) The matrix is ​​set to a cyclic matrix or a Hankel matrix, and the communication device has a submatrix S (n-1)×(n-1) A submatrix can be reconstructed by simply memorizing the first row or first column. This effectively saves memory space in communication devices and reduces implementation complexity.

[0132] submatrix S (n-1)×(n-1) For an example where is a Hankel matrix, it will be helpful to refer to equations (51) and (52) shown below.

[0133] Feature 4: P n×n Submatrix S of a matrix (n-1)×(n-1) The first row is equal to the first vector x, or 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, P n×n Submatrix S of a matrix (n-1)×(n-1) The first row is equal to or derived 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 submatrix S (n-1)×(n-1) Another row of can also be obtained based on the first vector x or the second vector y. For the sake of clarity, below we have the submatrix S (n-1)×(n-1) Each matrix provided in the embodiments of this application will be illustrated using an example in which the first row of the matrix is ​​equal to or based on the first vector x (or second vector y). However, this should not be construed as a limitation to the embodiments of this application.

[0135] For example, a submatrix S (n-1)×(n-1) The first row can be obtained by performing one or more of the following three operations on the first vector x: cyclic shift, inversion, or total negation.

[0136] For example, a submatrix S (n-1)×(n-1) The first row can be obtained by performing one or more of the following three operations on the second vector y: cyclic shift, inversion, or total negation.

[0137] For example, a submatrix S (n-1)×(n-1)The first row is equal to the negation vector of the first vector, for example, the submatrix S (n-1)×(n-1) The first line is equal to [-1-1-1 1-1 1 1-1 1 1 1] (which can also be shown as -x).

[0138] In another example, the submatrix S (n-1)×(n-1) The first row is equal to the inverted vector of the first vector, for example, submatrix 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 shown as the inverted vector of x).

[0139] In another example, the submatrix S (n-1)×(n-1) The first row is equal to the cyclic shift vector of the first vector, for example, submatrix S (n-1)×(n-1 The first row of ) is equal to [-1 1 1 1-1 1-1-1 1-1-1]. In other words, the submatrix S (n-1)×(n-1) The first row is obtained by shifting the first vector x to the right by one bit. In another example, the submatrix 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 submatrix S (n-1)×(n-1) The first row is obtained by shifting the first vector x to the left by one bit.

[0140] For example, a submatrix S (n-1)×(n-1) The first row is equal to the negation vector of the second vector, for example, the submatrix S (n-1)×(n-1) The first line is equal to [-1-1-1 1 1 1-1 1-1 1 1-1-1 1] (which can also be shown as -y).

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

[0142] In another example, the submatrix S (n-1)×(n-1)The first row is equal to the cyclic shift vector of the second vector, for example, submatrix S (n-1)×(n-1 The first row of ) is equal to [-1 1 1 1-1-1-1-1 1-1 1-1-1 1 1]. In other words, the submatrix S (n-1)×(n-1) The first row is obtained by shifting the second vector y to the right by one bit. In another example, the submatrix S (n-1)×(n-1) The 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) The first row is obtained by shifting the second vector y to the left by one bit.

[0143] For example, a submatrix S (n-1)×(n-1) If the first row of the matrix P is obtained based on the first vector x, then the matrix P (n-1)×(n-1) The second row may also be obtained based on the cyclic shift of the first vector x, and the S matrix P (n-1)×(n-1) The third row may also be obtained based on the cyclic shift of the first vector x. Alternatively, a submatrix S may be obtained based on the first vector x. (n-1)×(n-1) After the first row is determined, the submatrix S is determined based on the cyclic shift of the first row. (n-1)×(n-1) The second to (n-1)th row may be retrieved.

[0144] For example, a submatrix S (n-1)×(n-1) The first row 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 is equal to [-1 1 1 1-1 1-1-1 1-1-1] (i.e., shifting 11 elements of x to the right by 1 bit), and the submatrix S (n-1)×(n-1) The third row is equal to [-1-1 1 1-1 1-1-1 1-1] (i.e., shifting 11 elements of x to the right by 2 bits). The rest can be estimated by analogy, and the submatrix S (n-1)×(n-1) It can be obtained.

[0145] In another example, 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 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 x to the left by 1 bit), and the submatrix S (n-1)×(n-1) The third row is equal to [1-1 1-1-1 1-1-1-1 1 1] (i.e., shifting 11 elements of x to the left by 2 bits). The rest can be estimated by analogy, and the submatrix S (n-1)×(n-1) It can be obtained.

[0146] In another example, 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 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 negation vector of x to the right by 1 bit), and the submatrix S (n-1)×(n-1) The third row is equal to [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) It can be obtained.

[0147] In another example, 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 is a 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 negation vector of x one bit to the left), and 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 estimated by analogy, and the submatrix S (n-1)×(n-1) It can be obtained.

[0148] In another example, 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 is a 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 to the right by 1 bit), and 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 estimated by analogy, and the submatrix S (n-1)×(n-1) It can be obtained.

[0149] In another example, 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 is a 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 11 elements of the inverted vector of x left by 1 bit), and 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 estimated by analogy, and the submatrix S (n-1)×(n-1) It can be obtained.

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

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

[0152] submatrix S (n-1)×(n-1) And for the explanation of the second vector y, see the submatrix S. (n-1)×(n-1) It will be understood that we should refer to the previous example of the first vector x. Further details will not be explained again here.

[0153] In this embodiment of the present application, the communication device P n×n Submatrix S of a matrix (n-1)×(n-1) After obtaining the first line of S (n-1)×(n-1)It may be obtained. Therefore, the communication device, in order to reconstruct the submatrix, P n×n Submatrix S of a matrix (n-1)×(n-1) It is sufficient to store only the rows. Alternatively, once the relationship between the rows of a submatrix and the first or second vector is determined, the communication device can reconstruct the submatrix by simply storing the first or second vector. Therefore, the complete P n×n The matrix does not need to be stored in memory. Furthermore, this means that P n×n This reduces the space occupied by matrices, saves memory space, and effectively reduces the complexity of implementing communication devices (for example, P n×n Submatrix S of a matrix (n-1)×(n-1) (This can be restored based on calculations such as cyclic shifts.)

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

[0155] The third vector x' can be shown as follows:

number

[0156] The fourth vector y' can be shown as follows:

number

[0157] For example, a submatrix S (n-1)×(n-1) The first column can be obtained by performing one or more of the following three operations on the third vector: cyclic shift, inversion, or total negation.

[0158] For example, a submatrix S (n-1)×(n-1) The first column is the fourth vector y ’ It can be obtained by performing one or more of the following three operations on it: cyclic shift, inversion, or total negation.

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

[0160] For example, a submatrix S (n-1)×(n-1) The first column is equal to the negation vector of the third vector, for example, submatrix S (n-1)×(n-1) The first row is [-1 1 1 1-1 1 1-1 1-1-1] T It is equal to.

[0161] In another example, the submatrix S (n-1)×(n-1) The first column is equal to the transpose of the cyclic shift vector of the third vector, for example, submatrix S (n-1)×(n-1) The first column is [-1-1-1 1-1-1 1-1 1 1 1] T It is equal to. In other words, the submatrix S (n-1)×(n-1) The first column is obtained by cyclically shifting the third vector x' up by one bit. In another example, the submatrix S (n-1)×(n-1) The first row is [1 1-1-1-1 1-1-1 1-1 1] T It is equal to. In other words, the submatrix S (n-1)×(n-1) The first column is obtained by cyclically shifting the third vector x' down by one bit.

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

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

[0164] In another example, the submatrix S (n-1)×(n-1) The first column is equal to the inverted vector of the transpose of the fourth vector, for example, submatrix S (n-1)×(n-1) The first row is [1 1-1-1-1-1 1-1 1-1-1-1 1 1-1 1] T It is equal to.

[0165] In another example, the submatrix S (n-1)×(n-1) The first column is equal to the transpose of the cyclic shift vector of the fourth vector, for example, submatrix S (n-1)×(n-1) The first row is [-1 1 1-1-1 1-1 1-1-1-1-1 1 1 1] T It is equal to. In other words, the submatrix S (n-1)×(n-1) The first column is the fourth vector y ’ This is obtained by cyclically shifting it up by one bit. In another example, the submatrix S (n-1)×(n-1) The first row is [1 1-1 1 1-1-1 1-1 1-1-1-1-1 1] T It is equal to. In other words, the submatrix S (n-1)×(n-1) The first line is the fourth vector y ’ It is obtained by cyclically shifting it down by one bit.

[0166] submatrix S (n-1)×(n-1) The first column and the third vector x ’ Or the fourth vector y ’ For an explanation of the relationship, please refer to the explanation in Feature 4. Further details will not be explained here.

[0167] To simplify the explanation, P n×n Submatrix S of a matrix (n-1)×(n-1)Using an example where the first row of is equal to the first vector (or second vector) or obtained based on the first vector (or second vector), the P provided in the embodiments of this application n×n Let's explain matrices. Below, P n×n Submatrix S of a matrix (n-1)×(n-1) Examples where the first column is equal to the third vector (or fourth vector), or obtained based on the third vector (or fourth vector), will not be explained in detail.

[0168] Feature 6:

number

number

number

number

[0169] S (n-1)×(n-1) The matrix is ​​P n×n It is a submatrix of the matrix, S (n-1)×(n-1) The matrix has n-1 rows and n-1 columns, and α is a column vector consisting of n-1 elements, each element being 1. T -α is the transpose vector of α, and -α represents the vector obtained by negating all elements within α.

[0170] In this embodiment of the present application, S (n-1)×(n-1) This could be a cyclic matrix or a Hankel matrix.

[0171] In this embodiment of the present application, P n×n The matrix is ​​an orthogonal matrix, and the submatrix S (n-1)×(n-1) It can be guaranteed that is a cyclic matrix or a Hankel matrix. The communication device has a submatrix S (n-1)×(n-1) By storing the first row or first column vector (or the first vector x, the second vector y, etc.), the submatrix and Pn×n The matrix can be reconstructed. Therefore, the complete P n×n The matrix does not need to be stored in memory. In this way, P n×n The memory space occupied by matrices can be effectively reduced, memory space can be saved, and the complexity of implementing communication devices can be effectively reduced.

[0172] Feature 7:

number

number

number

number

[0173] In other words, P 16×16 The matrix (i.e., P in the case of n=16) n×n The matrix is ​​P 8×8 It can be obtained according to the matrix. P 8×8 The 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, P 8×8 The matrix is ​​expanded, P 16×16 A matrix is ​​generated. This ensures that the communication device supports the transmission of 16 or fewer data streams, and avoids overly complex operation.

[0176] In this embodiment of the present application, P 32×32 The matrix is ​​P 16×16 P can be obtained according to the matrix.24×24 The matrix is ​​P 12×12 It will be understood that it can be obtained according to the matrix. The specific method of obtaining it is P 8×8 Extend the matrix to P 16×16 This is similar to the method for generating matrices. For simplicity, we will refer to P below. 12×12 P according to the matrix 24×24 Methods for obtaining a matrix, and P 16×16 P according to the matrix 32×32 The method for obtaining the matrix will not be explained in detail.

[0177] P 12×12 The matrix is ​​P 24×24 Extended to generate matrices, or P 16×16 The matrix is ​​P 32×32 It is extended to generate matrices. This ensures that the communication device supports the transmission of 32 or fewer streams of data, and avoids overly complex operation.

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

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

number

[0180] or,

number

[0181] Equation (22) is a submatrix S (n-1)×(n-1)An example is shown using the first row of which is equal to [1 1 1-1 1-1-1 1-1-1-1] (i.e., equal to the first vector). However, this should not be understood as a limitation to embodiments of the present application. The submatrix S shown in equation (22) (n-1)×(n-1) It can be understood that each element of the row vector is the result of sequentially shifting each element of the previous row vector to the right by one bit. The submatrix S shown in equation (23) (n-1)×(n-1) Each element of the row vector is the result of sequentially shifting each element of the previous row vector to the left by one bit. Equations (22) and (23) shown herein also give P obtained according to equation (13). n×n It will be understood that this can also be understood as a matrix. (n-1)×(n-1) The result of sequentially shifting each element of the row vector to the right by 2 (or 3, 4, etc.) bits, or S (n-1)×(n-1) The result of sequentially shifting each element of the row vector of to the left by 2 (or 3, 4, etc.) bits is also included within the scope of protection of this application. Therefore, for the sake of brevity, the following example uses the submatrix S (n-1)×(n-1) Only the result of sequentially shifting each element of the row vector to the right by one bit is shown. In addition, for the sake of brevity, matrices obtained based on one or more of the three operations of cyclic shift, total negation, and inversion in equation (22) or equation (23) are not enumerated herein.

[0182] From formulas (22) and (23), the P shown in this embodiment of the present application n×n Submatrix S of a matrix (n-1)×(n-1) S is a cyclic matrix or Hankel matrix, and the communication device is a submatrix S. (n-1)×(n-1) Just memorizing the first line completes P n×n It can be seen that a matrix can be obtained. This allows for effective saving of memory space in the communication device, P n×n The complexity of reconstructing the matrix can be reduced. The explanation is shown in P below. n×n Matrix, or P n×n It will be understood that this is also applicable to the first matrix obtained according to the matrix. To avoid repetition, the details will not be explained again below.

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

number

[0184] Equation (24) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [1 1 1-1 1-1-1 1-1-1-1], and P is shown using equation (14) as an example. 12×12 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (24)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

[0186] or,

number

[0187] Equation (25) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [1 1 1-1 1-1-1 1-1-1-1], and P is shown using equation (15) as an example. 12×12 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (24)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0189] Equation (26) is a submatrix S (n-1)×(n-1)The first row of is shown using an example where it is equal to [1 1 1-1 1-1-1 1-1-1-1], and P is shown using equation (16) as an example. 12×12 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (26)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

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

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

number

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

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

number

[0195] Equation (29) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1-1-1 1-1 1 1-1 1 1 1], and P is shown using equation (15) as an example. 12×12 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (29)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0197] Equation (30) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1-1-1 1-1 1 1-1 1 1 1], and P is shown using equation (16) as an example. 12×12 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (30)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0199] Equation (31) is a submatrix S (n-1)×(n-1) This is shown using an example where the first row is equal to [-1-1-1 1-1-1 1-1 1 1 1] (i.e., the inverse vector of the first vector), and P is shown using equation (13) as an example. 12×12These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (31)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

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

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

number

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

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

number

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

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

number

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

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

number

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

[0210] Submatrix S of equation (36) (n-1)×(n-1) It will be understood that this can also be a Hankel matrix. Submatrix S (n-1)×(n-1) For another example where is a Hankel matrix, see equations (51) and (52) below.

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

number

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

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

number

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

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

number

[0216] Equation (39) is a submatrix S (n-1)×(n-1) This is shown using an example where the first row is equal to [-1-1-1 1 1 1-1 1-1 1 1-1-1 1] (i.e., the total negative vector of the second vector), and P is shown using equation (13) as an example. 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (39)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0218] Equation (40) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1-1-1 1 1 1-1 1-1 1 1-1-1 1], and P is shown using equation (14) as an example. 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (40)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0220] Equation (41) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1-1-1 1 1 1-1 1-1 1 1-1-1 1], and P is shown using equation (15) as an example. 16×16These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (41)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0222] Equation (42) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1-1-1 1 1 1-1 1-1 1 1-1-1 1], and P is shown using equation (16) as an example. 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (42)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0224] Equation (43) is a submatrix S (n-1)×(n-1) This is shown using an example where the first row is equal to [-1 1 1-1-1 1-1 1-1-1-1-1 1 1 1] (i.e., the inverse vector of the second vector), and P is shown using equation (13) as an example. 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (43)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

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

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

number

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

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

number

[0230] Equation (46) is a submatrix S (n-1)×(n-1) The first row of is shown using an example where it is equal to [-1 1 1-1-1 1-1 1-1-1-1-1 1 1 1], and P is shown using equation (16) as an example. 16×16These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (46)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0232] Equation (47) is shown using equations (17) and (21) as examples for P 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (47)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0234] Equation (47) is shown using equations (18) and (21) as examples for P 16×16 These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (37)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0236] Equation (49) is shown using equations (19) and (21) as examples for P 16×16These are matrices. For the sake of brevity, matrices obtained based on one or more of the three operations in equation (37)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0238] Equation (50) is P, which was shown using equations (20) and (21) as examples. 16×16 This is the matrix. For brevity, matrices obtained based on one or more of the three operations in equation (37)—cyclic shift, total negation, and inversion—are not enumerated herein.

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

number

[0240] Submatrix S of equation (51) (n-1)×(n-1) This is the Hankel matrix.

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

number

[0242] Submatrix S of equation (52) (n-1)×(n-1) This is the Hankel matrix.

[0243] For example, in the following, R provided in this embodiment of the present application n×n Let's explain matrices.

[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 in each row of the matrix are the same. Therefore, for the sake of brevity, equations (54) to (83) shown below are R n×n Only the first row of the matrix is ​​shown, but this should not be understood as a limitation to this embodiment of the present application.

[0246] 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](54)

[0247] For elements in other rows not shown in equation (54), it will be understood that they refer to the elements in the first row. This explanation also applies to equations (55) through (83) shown below. For brevity, further details will not be explained below.

[0248] 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](55)

[0249] 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](56)

[0250] 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](57)

[0251] In one possible embodiment, 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 The 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 The 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 The 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 The matrix can be shown as follows: R 16*16 =[-1 1 1-1-1-1-1 1-1 1-1-1 1 1-1](69)

[0264] In one possible embodiment, R n×n The 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 The matrix can be shown as follows: R 16*16 =[1-1-1-1 1 1 1-1 1-1 1 1-1-1 1](71)

[0266] In one possible embodiment, R n×n The 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 The 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 The 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 The 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 The 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 The 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 The 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 The 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 The 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 The 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 The 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 The matrix can be shown as follows: R 16×16 =[-1-1 1-1 1-1-1 1 1-1 1 1-1-1 1](83)

[0278] Formulas (53) to (83) are R shown in this embodiment of the present application. n×n It will be understood that this is simply an example of a matrix.

[0279] For example, the first matrix provided in this embodiment of the present application is described below.

[0280] The first matrix is ​​P n×n Matrix or R n×nIt should be understood that examples of matrix equivalents will not be explained in detail again below. Below, the first matrix is ​​P n×n The matrix is ​​equal to the total negation of the matrix, or the first matrix is ​​P. n×n The matrix is ​​equal to the transpose of the matrix, or the first matrix is ​​P n×n The transpose of the total negation of a matrix (P n×n Only examples that are equivalent to (which can also be understood as the complete negation of the transpose of a matrix) are shown.

[0281] For example, equation (22) can be used as an example, and the first matrix can be expressed as follows:

number

[0282] In one possible embodiment, the first matrix may be represented as follows:

number

[0283] In one possible embodiment, the first matrix may be represented as follows:

number

[0284] Equation (84) is shown by example using the negation of equation (22), equation (85) is shown by example using the transpose of equation (22), and equation (86) is shown by example using the transpose of the negation of equation (22) (which can also be understood as the negation of the transpose of equation (22)).

[0285] For example, equation (35) can be used as an example, and the first matrix can be expressed as follows:

number

[0286] In one possible embodiment, the first matrix may be represented as follows:

number

[0287] In one possible embodiment, the first matrix may be represented as follows:

number

[0288] Equation (88) is shown by example using the negation of equation (35), equation (87) is shown by example using the transpose of equation (35), and equation (89) is shown by example using the transpose of the negation of equation (35) (which can also be understood as the negation of the transpose of equation (35)).

[0289] It should be understood that the matrix shown above is merely an example and should not be interpreted as a limitation on the embodiments of this application.

[0290] The following describes the communication device provided in the embodiments of this application.

[0291] In this application, the communication device is divided into functional modules based on the example of the method described above. For example, functional modules corresponding to functions may be obtained by the division, or two or more functions may be integrated into a single processing module. The integrated module may be implemented in hardware form or in the form of a software functional module. Note that in this application, the module division is merely an example and is simply a logical functional division. In actual implementation, a different division method may be used. The communication device in the embodiment of this application will be described in detail below with reference to Figures 5 to 7.

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

[0293] In some embodiments of this application, the communication device may be the receiving device, a chip within the receiving device, or the like. In other words, the communication device may be configured to perform steps or functions performed by the receiving device in embodiments of the method.

[0294] For example, the transceiver unit 502 is configured to input a PPDU, which includes a preamble, which includes a long training field (LTF), and which includes multiple LTF symbols.

[0295] Processing unit 501 processes the first matrix

number

number

number

number

number

[0296] It will be understood that configuring transceiver unit 502 to input PPDUs includes configuring transceiver unit 502 to receive PPDUs transmitted by the transmitting device.

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

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

[0299] Figure 5 is reused. In some embodiments of this application, the communication device may be the transmitting device, a chip within the transmitting device, etc. In other words, the communication device may be configured to perform steps or functions performed by the transmitting device in embodiments of the method.

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

[0301] It will be understood that configuring transceiver unit 502 to output a PPDU includes configuring transceiver unit 502 to transmit a PPDU to a receiving device.

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

[0303] It should be understood that the specific descriptions of the transceiver unit and processing unit described in this embodiment of the present application are merely examples. For specific functions, steps, etc., of the transceiver unit and processing unit, please refer to the embodiments of the method described above. Details will not be described again here. For example, the processing unit 501 may be further configured to perform step 401 shown in Figure 4a, and the transceiver unit 502 may be further configured to perform 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, if 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 and receiving devices in this embodiment of the present application are described above. Possible product forms of the transmitting and receiving devices are described below. It should be understood that any form of product having the functionality of the transmitting device in Figure 5 and any form of product having the functionality of the receiving device in Figure 5 fall within the scope of protection of the embodiments of this application. It should be further understood that the following description is merely an example and does not limit the product forms of the transmitting and receiving devices in this embodiment of the present application.

[0306] In one possible embodiment, in the communication device shown in Figure 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 may be integrated into a single component, such as a transceiver. In this embodiment of the present application, the processor and the transceiver may be coupled, and so on. The connection method between the processor and the transceiver is not limited in this embodiment of the present application.

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

[0308] For example, if a communication device is configured to perform a step, method, or function performed by a receiving device, the transceiver 610 is configured to receive a PPDU from the transmitting device. The processor 620 is configured to receive a first matrix

number

[0309] For example, if the communication device is configured to perform a step, method, or function performed by the transmitting device, the processor 620 is configured to generate a PPDU. The transceiver 610 is configured to send the PPDU to the receiving device.

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

[0311] For a detailed explanation of the processor and transceiver, please refer to the descriptions of the processing unit and transceiver unit shown in Figure 5. Further details will not be provided here.

[0312] In each embodiment of the communication device shown in Figure 6, the transceiver may include a receiver and a transmitter. The receiver is configured to perform a receiving function (or operation), and the transmitter is configured to perform a transmitting function (or operation). The transceiver is configured to communicate with another device / device 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 memories 630 are coupled to the processor 620. The coupling in embodiments of this application is an indirect coupling or communication connection between devices, units, or modules, which may be electrical, mechanical, or otherwise, and is used for information exchange between devices, units, or modules. The processor 620 may cooperate with the memories 630. The processor 620 may execute program instructions stored in the memories 630. Optionally, at least one of the one or more memories may be included in the processor. In this embodiment of this application, the memory 630 may store one or more of the following: a first vector x, a second vector y, a third vector x', a fourth vector y', and so on. For example, the memory shown in Figure 6 shows only the first vector x and the second vector y. In Figure 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 dashed lines is that memory can store only the first vector x, only the second vector y, or both the first vector x and the second vector y.

[0314] Therefore, a 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 complete P n×nA matrix can be obtained. This allows for effective saving of memory space in the communication device, P n×n This can reduce the complexity of reconstructing the matrix.

[0315] The specific connection medium between the transceiver 610, the processor 620, and the memory 630 is not limited to 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 a bus 650 in Figure 6, which is represented by a thick line in Figure 6. Connection methods between other components are described schematically but are not limited thereto. Buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, the bus is shown in Figure 6 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 embodiments of this 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 that can implement or perform the methods, steps, and logic block diagrams disclosed in embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed with reference to embodiments of this application may be performed and executed directly by the hardware processor, or they may be performed and executed using a combination of hardware modules and software modules within the processor.

[0317] In this embodiment of the present application, memory may include, but is not limited to, non-volatile memory such as a hard disk drive (HDD) or 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). Memory is any storage medium that can be used to carry or store program code in the form of instructions or data structures and that can be read and written by a computer (e.g., a communication device as shown in this application). However, it is not limited to these. Alternatively, memory in the embodiments of the present application may 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 primarily configured to process communication protocols and data, control the entire communication device, execute software programs, and process data for the software programs. The memory 630 is primarily configured to store software programs and data. The transceiver 610 may include a control circuit and an antenna. The control circuit is primarily configured to perform conversions between baseband signals and radio frequency signals and to process radio frequency signals. The antenna is primarily configured to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices such as touch screens, display screens, or keyboards are primarily configured to receive data entered by the 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, explain and execute the instructions of the software program, and process the data of the software program. If the data needs to be transmitted wirelessly, the processor 620 performs 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 antenna may be located independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuit and antenna may be located remotely and independently of the communication equipment.

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

[0322] In another possible embodiment, in the communication device shown in Figure 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, interface circuit, or interface. Alternatively, the transceiver unit 502 may be a transmit unit and a receive unit. The transmit unit may be an output interface, and the receive unit may be an input interface. Alternatively, the transmit unit and the receive unit may be integrated into a single unit, such as an input / output interface. As shown in Figure 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 a chip (SoC), etc. The interface 702 may be a communication interface, an input / output interface, a pin, etc. For example, Figure 7 shows an example where the communication device is a chip. The chip includes the logic circuit 701 and the interface 702.

[0323] In this embodiment of the present application, the logic circuits may be further coupled to an interface. The specific connection methods of the logic circuits and interfaces are not limited to this embodiment of the present application.

[0324] For example, if a communication device is configured to perform a method, function, or step performed by a receiving device, interface 702 is configured to accept a PPDU. Logic circuit 701 is a first matrix

number

[0325] For example, if a communication device is configured to perform a method, function, or step performed by a transmitting device, the logic circuit 701 is configured to generate a PPDU. 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 the following: a first vector x, a second vector y, a third vector x', a fourth vector y', and so on. For example, the memory shown in Figure 7 shows only the first vector x and the second vector y. In Figure 7, it will be understood that the dashed line indicates that the first vector x and the second vector y are stored in the memory. The reason for using the dashed line 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.

[0327] Therefore, a 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 complete P n×n A matrix can be obtained. This allows for effective saving of memory space in the communication device, P n×n This can reduce the complexity of reconstructing the matrix.

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

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

[0330] For specific embodiments of the embodiment shown in Figure 7, please refer to the previously described embodiments. Further details will not be explained again here.

[0331] One embodiment of this 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 perform the method in any embodiment (for example, Figure 4a).

[0332] In addition, this application further provides a computer program used to perform operations and / or processes performed by a transmitting device in the manner provided in this application.

[0333] This application further provides a computer program used to perform operations and / or processes to be performed by a receiving device in the manner provided in this application.

[0334] This application further provides a computer-readable storage medium for storing computer code. When the computer code is executed on a computer, the computer is enabled to perform operations and / or processes performed by a transmitting device in the manner provided in this application.

[0335] This application further provides a computer-readable storage medium for storing computer code. When the computer code is executed on a computer, the computer is enabled to perform operations and / or processes to be performed by a receiving device in the manner provided in this application.

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

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

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

[0339] Units described as separate parts may or may not be physically separate, and parts shown as units may or may not be physical units, in other words, they may be located in one place or distributed across 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 embodiments of this application.

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

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

[0342] The foregoing description represents only specific embodiments of this application, and the scope of protection of this application is not limited thereto. Any modifications or substitutions readily conceivable by a person skilled in the art within the scope of the art disclosed herein shall also fall within the scope of protection of this application. Accordingly, the scope of protection of this application shall be subject to the scope of protection of the claims. [Explanation of Symbols]

[0343] 501 Processing Unit 502 Transceiver Unit 610 Transceiver 620 processors 630 memory 701 Logic Circuits 702 Interface 703 memory

Claims

1. A signal processing method, wherein the method is A step of receiving a Physical Layer Protocol Data Unit (PPDU), wherein the PPDU includes a preamble, the preamble includes a Long Training Field (LTF), and the LTF includes a plurality of LTF symbols, First matrix [Math 1] A step of processing the signals received by the plurality of LTF symbols in accordance with the above, When the k-th subcarrier is a non-pilot subcarrier or a data subcarrier, the first matrix [Math 2] is P n×n A matrix, the negation of the P n×n matrix, the transpose of the P n×n matrix, the transpose of the negation of the P n×n matrix, or the negation of the transpose of the P n×n matrix. Or, when the k-th subcarrier is a pilot subcarrier, the first matrix [Math 3] is an R n×n matrix, the R n×n matrix contains n rows and n columns, and each row of the R n×n matrix is ​​P n×n Equivalent to the T-th row of the matrix, the T-th row of the negation matrix of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, or the T-th row of the negation matrix of the transpose of the P n×n matrix, where T is an integer between 1 and n, [Math 4] And I is the identity matrix, and the P n×n The matrix contains n rows and n columns, [Math 5] The matrix is ​​P n×n The transpose of the matrix, where n is an integer greater than 8, and k represents the k-th subcarrier in each of the aforementioned LTF symbols, and the step and Includes, If n=12, [Math 6] [Number 7] [Number 8] [Number 9] or [Number 10] and, or, If n=16, [Math 11] [Math 12] or 【Number 13】 The method.

2. A signal processing method, wherein the method is A step of generating a physical layer protocol data unit (PPDU), wherein the PPDU includes a preamble, the preamble includes a long training field (LTF), the LTF includes a plurality of LTF symbols, and the plurality of LTF symbols are a first matrix [Number 14] Used to transport the sequence obtained according to When the k-th subcarrier is a non-pilot subcarrier or a data subcarrier, the first matrix [Number 15] is P n×n A matrix, the negation of the P n×n matrix, the transpose of the P n×n matrix, the transpose of the negation of the P n×n matrix, or the negation of the transpose of the P n×n matrix. Or, when the k-th subcarrier is a pilot subcarrier, the first matrix [Number 16] is an R n×n matrix, the R n×n matrix contains n rows and n columns, and each row of the R n×n matrix is ​​P n×n Equivalent to the T-th row of the matrix, the T-th row of the negation matrix of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, or the T-th row of the negation matrix of the transpose of the P n×n matrix, where T is an integer between 1 and n, [Number 17] And I is the identity matrix, and the P n×n The matrix contains n rows and n columns, [Number 18] The matrix is ​​P n×n The transpose of the matrix, where n is an integer greater than 8, and k represents the k-th subcarrier in each of the aforementioned LTF symbols, and the step, The step of transmitting the PPDU and Includes, If n=12, [Number 19] [Number 20] [Math 21] [Number 22] or [Number 23] and, or, If n=16, [Number 24] [Number 25] or [Number 26] The method. 【Request Item 3】 【Number 27】 [Number 28] [Number 29] or [Number 30] And, The foregoing S （n－1）×（n－1） matrix is a submatrix of the foregoing P n×n matrix, the foregoing S （n－1）×（n－1） matrix includes n - 1 rows and n - 1 columns, α is a column vector consisting of n - 1 elements, each element being 1, and α T is the transposed vector of α, and -α indicates a vector obtained by negating all elements in α The method according to claim 1 or 2.

4. The aforementioned S （n－1）×（n－1） The method according to claim 3, wherein the matrix is ​​a cyclic matrix or a Hankel matrix.

5. The aforementioned S （n－1）×（n－1） The first row of the matrix is ​​equal to the first vector x, so x = [1 1 1-1 1-1-1 1-1-1-1], The aforementioned 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: cyclic shift, inversion, and total negation, so x = [1 1 1-1 1-1-1 1-1-1-1], The aforementioned S （n－1）×（n－1） The first row of the matrix is ​​equal to the second vector y, so y = [1 1 1-1-1-1-1 1-1 1-1-1 1 1-1], or, The aforementioned 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: cyclic shift, inversion, and total negation, so that y = [1 1 1-1-1-1-1 1-1 1-1-1 1 1-1] The method according to claim 3 or 4.

6. The aforementioned R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, and the P n×n The method according to any one of claims 1 to 5, wherein the matrix is ​​used for channel estimation.

7. A communication device, wherein the communication device is A transceiver unit configured to receive a Physical Layer Protocol Data Unit (PPDU), wherein the PPDU includes a preamble, the preamble includes a Long Training Field (LTF), and the LTF includes a plurality of LTF symbols; First matrix [Number 31] A processing unit configured to process signals received by the plurality of LTF symbols accordingly, When the k-th subcarrier is a non-pilot subcarrier or a data subcarrier, the first matrix [Number 32] is P n×n A matrix, the negation of the P n×n matrix, the transpose of the P n×n matrix, the transpose of the negation of the P n×n matrix, or the negation of the transpose of the P n×n matrix. Or, when the k-th subcarrier is a pilot subcarrier, the first matrix [Number 33] is an R n×n matrix, the R n×n matrix contains n rows and n columns, and each row of the R n×n matrix is ​​P n×n Equivalent to the T-th row of the matrix, the T-th row of the negation matrix of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, or the T-th row of the negation matrix of the transpose of the P n×n matrix, where T is an integer between 1 and n, [Number 34] And I is the identity matrix, and the P n×n The matrix contains n rows and n columns, [Number 35] The matrix is ​​P n×n The transpose matrix of the matrix, where n is an integer greater than 8, and k represents the k-th subcarrier in each of the aforementioned LTF symbols, and the processing unit and Equipped with, If n=12, [Number 36] [Number 37] [Number 38] [Number 39] or [Number 40] and, or, If n=16, [Number 41] [Number 42] or [Number 43] It is a communication device.

8. A communication device, wherein the communication device is A processing unit configured to generate a Physical Layer Protocol Data Unit (PPDU), wherein the PPDU includes a preamble, the preamble includes a Long Training Field (LTF), the LTF includes a plurality of LTF symbols, and the plurality of LTF symbols are a first matrix [Number 44] Used to transport the sequence obtained according to When the k-th subcarrier is a non-pilot subcarrier or a data subcarrier, the first matrix [Number 45] is P n×n A matrix, the negation of the P n×n matrix, the transpose of the P n×n matrix, the transpose of the negation of the P n×n matrix, or the negation of the transpose of the P n×n matrix. Or, when the k-th subcarrier is a pilot subcarrier, the first matrix [Number 46] is an R n×n matrix, the R n×n matrix contains n rows and n columns, and each row of the R n×n matrix is ​​P n×n Equivalent to the T-th row of the matrix, the T-th row of the negation matrix of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, the T-th row of the transpose of the P n×n matrix, or the T-th row of the negation matrix of the transpose of the P n×n matrix, where T is an integer between 1 and n, [Number 47] And I is the identity matrix, and the P n×n The matrix contains n rows and n columns, [Number 48] The matrix is ​​P n×n A processing unit that is the transpose of a matrix, where n is an integer greater than 8, and k represents the k-th subcarrier in each of the aforementioned LTF symbols, A transceiver unit configured to transmit the PPDU and Equipped with, If n=12, [Number 49] [Number 50] [Number 51] [Number 52] or [Number 53] and, or, If n=16, [Number 54] [Number 55] or [Number 56] It is a communication device. [Request Item 9] [Number 57] [Number 58] [Number 59] or [Number 60] And, The aforementioned S （n－1）×（n－1） The matrix is ​​P n×n A submatrix of a matrix, and HLS （n－1）×（n－1） The matrix contains n-1 rows and n-1 columns, and α is a column vector consisting of n-1 elements, each element being 1. T α is the transpose vector of α, and -α represents the vector obtained by negating all elements within α. The communication device according to claim 7 or 8.

10. The aforementioned S （n－1）×（n－1） The communication device according to claim 9, wherein the matrix is ​​a cyclic matrix or a Hankel matrix.

11. The aforementioned S （n－1）×（n－1） The first row of the matrix is ​​equal to the first vector x, so x = [1 1 1-1 1-1-1 1-1-1-1], The aforementioned 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: cyclic shift, inversion, and total negation, so x = [1 1 1-1 1-1-1 1-1-1-1], The aforementioned S （n－1）×（n－1） The first row of the matrix is ​​equal to the second vector y, so y = [1 1 1-1-1-1-1 1-1 1-1-1 1 1-1], or, The aforementioned S （n－1）×（n－1） The first row of the matrix is ​​obtained by performing one or more of the following operations on the second vector y: cyclic shift, inversion, and total negation, so that y = [1 1 1-1-1-1-1 1-1 1-1-1 1 1-1] The communication device according to claim 9 or 10.

12. The aforementioned R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, and the P n×n A communication device according to any one of claims 7 to 11, wherein the matrix is ​​used for channel estimation.

13. A communication device comprising a processor and memory, The memory is configured to store computer executable instructions. A communication device wherein the processor is configured to execute the computer executable instructions in order to perform the method according to any one of claims 1 to 6.

14. A communication device comprising a logic circuit and an interface, wherein the logic circuit is coupled to the interface. A communication 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 the method according to any one of claims 1 to 6.

15. A computer-readable storage medium, wherein the computer-readable storage medium is configured to store a computer program, and when the computer program is executed, the method according to any one of claims 1 to 6 is performed.

16. A computer program wherein, when the computer program is executed, the method described in any one of claims 1 to 6 is executed.

Images