Signal processing method and apparatus

Abstract

This application discloses a signal processing method and apparatus. The method includes: a transmitting device generating a PPDU, the PPDU including a preamble, the preamble including an LTF, the LTF including a plurality of LTF symbols, the plurality of LTF symbols can be used to carry a sequence obtained according to a first matrix; and 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 ​​P n×n matrix, or the first matrix is ​​P n×n It is obtained according to the matrix, JPEG2023553971000154.jpg20170n is an integer greater than 8. According to the method provided in this application, channel estimation for more than eight spatial streams can be performed.

Description

[Technical field]

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

[0002] The present application relates to the field of communications technology, and in particular to signal processing methods and apparatus. [Background technology]

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

[0004] However, how the receiving end performs channel estimation etc. based on the LTF needs to be urgently solved. Summary of the Invention [Means for solving the problem]

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

[0006] According to a first aspect, an embodiment of the present application provides a signal processing method, the method including the steps of receiving a physical (PHY) layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, and receiving 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, where the receiving device is a device configured to receive a PPDU.

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

[0009] One P n×n By using the matrix, MIMO channel estimation of multiple different numbers of streams can be implemented, and the redundancy of the MIMO channel estimation is effectively reduced. In other words, the receiving device can n×n According to the matrix, signals received with multiple LTF symbols and more than eight spatial streams may be processed simultaneously.

[0010] According to a second aspect, an embodiment of the present application provides a signal processing method, the method comprising the steps of: generating a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix

number

number

number

number

number

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

number

number

number

number

[0012] In this embodiment of the present application, P n×n If the matrix is ​​orthogonal and the submatrix S (n-1)×(n-1) It is possible to guarantee that P is a circulant or Hankel matrix.n×n The space occupied by the matrix can be reduced, the storage space can be saved, and the implementation complexity of the communication device can be effectively reduced.

[0013] In one possible embodiment in relation to the first or second aspect, S (n-1)×(n-1) The matrix may be a circulant 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) is set to a circulant matrix or a Hankel matrix, and the communication device calculates the submatrix S (n-1)×(n-1) A submatrix can be restored simply by storing the vector in the first row or the first column of , which can effectively save the storage space of the communication device and reduce the implementation complexity.

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

[0016] The communication device determines P based on the first vector or the second vector. n×n Submatrix S of a matrix (n-1)×(n-1) After getting the first row of S (n-1)×(n-1) Therefore, in order to recover the submatrix, the communication device may obtain P n×nSubmatrix S of a matrix (n-1)×(n-1) Alternatively, when the relationship between the rows of the submatrix and the first vector or the second vector is determined, the communication device can restore the submatrix by simply storing the first vector or the second vector. This allows P n×n It can reduce the space occupied by the matrix, save the memory space, and effectively reduce the implementation complexity of the communication device (for example, P n×n Submatrix S of a matrix (n-1)×(n-1) can be restored based on operations such as cyclic shifts.

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

number

number

number

number

number

[0018] In this embodiment of the present application, P 8×8 The matrix is ​​expanded to P 16×16 A matrix is ​​generated, which can ensure that the communication device supports the transmission of 16 streams of data and avoid excessively complicated operations.

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

number

number

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

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

[0022] In one possible embodiment in relation to the first or second aspect, 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 specific description of the matrices, the first matrix, etc., please refer to the examples below. Details will not be described here.

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

[0025] For example, the communication device may be a transmitting device, a chip within a transmitting device, and so on.

[0026] According to a fourth aspect, an embodiment of the present application provides a communication device configured to perform the method of the second aspect or any one of the possible implementations of the second aspect, the communication device comprising a corresponding unit configured to perform the method of the second aspect or any one of the possible implementations of the second aspect.

[0027] For example, the communication device may be a receiving device, a chip within a receiving device, and so on.

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

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

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

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

[0032] Unless otherwise specified, operations such as transmit, send, and receive related to a processor may be more generally understood as operations such as output, receive, and input of a processor, unless the operations conflict with the actual functionality or internal logic of the operations in the relevant description.

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

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

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

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

[0037] In one possible implementation, the communication device further includes a transceiver configured to receive or transmit signals, for example, the transceiver may be further configured to receive PPDUs, etc.

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

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

[0040] In one possible implementation, the memory is located external to the communication device.

[0041] In one possible implementation, the memory is located within the communication device.

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

[0043] In one possible implementation, the communication device further includes a transceiver, the transceiver configured to receive or transmit signals, for example the transceiver may be configured to transmit PPDUs.

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

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

number

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

[0047] LTF symbols, first matrix, P n×n matrix, R n×n It will be understood that for the description of the matrices etc., reference is made to the description of the first aspect or the second aspect or the various embodiments given below, and the details will not be described again here.

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

[0049] LTF symbols, first matrix, P n×n matrix, R n×n It will be understood that for the description of the matrices etc., reference is made to the description of the first aspect or the second aspect or the various embodiments given below, and the details will not be described again here.

[0050] According to a ninth aspect, an embodiment of the present application provides a computer readable storage medium configured to store a computer program which, when run on a computer, performs the method of the first aspect or any one of the possible implementations of the first aspect.

[0051] According to a tenth aspect, an embodiment of the present application provides a computer-readable storage medium configured to store a computer program, which, when run on a computer, performs the method of the second aspect or any one of the possible implementations of the second aspect.

[0052] According to an eleventh aspect, an embodiment of the present application provides a computer program product, the computer program product comprising a computer program or computer code, which, when the computer program product is run on a computer, performs the method of the first aspect or any one of the possible implementations of the first aspect.

[0053] According to a twelfth aspect, an embodiment of the present application provides a computer program product, the computer program product comprising a computer program or computer code, which, when the computer program product is run on a computer, performs the method of the second aspect or any one of the possible implementations of the second aspect.

[0054] According to a thirteenth aspect, an embodiment of the present application provides a computer program, which, when run on a computer, performs the method of the first aspect or any one of the possible implementations of the first aspect.

[0055] According to a fourteenth aspect, an embodiment of the present application provides a computer program, which, when run on a computer, performs the method of the second aspect or any one of the possible implementations of the second aspect.

[0056] According to a fifteenth aspect, an 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 the method of the first aspect or any one of the possible implementations of the first aspect. The receiving device is configured to perform the method of the second aspect or any one of the possible implementations of the second aspect. [Brief description of the drawings]

[0057] [Figure 1] 1 is a schematic diagram of a communication system according to an embodiment of the present application; [Diagram 2] 1 is a schematic diagram of the structure of an access point (AP) device or station (STA) device according to an embodiment of the present application. [Figure 3a] 1 is a schematic diagram of a structure of a PPDU according to an embodiment of the present application; [Figure 3b] FIG. 2 is a schematic diagram of the relationship between spatial streams and LTF symbols according to an embodiment of the present application. [Figure 4a] 1 is a schematic flowchart of a signal processing method according to an embodiment of the present application. [Figure 4b] 1 is a schematic diagram of the structure of another PPDU according to an embodiment of the present application; [Diagram 5] 1 is a schematic diagram of the structure of a communication device according to an embodiment of the present application; [Figure 6] 1 is a schematic diagram of the structure of a communication device according to an embodiment of the present application; [Figure 7] 1 is a schematic diagram of the structure of a communication device according to an embodiment of the present application; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0058] To make the objectives, technical solutions and advantages of the present application clearer, the present application is further described below with reference to the accompanying drawings.

[0059] In the specification, claims, and accompanying drawings of this application, terms such as "first" and "second" are merely used to distinguish different objects and do not describe a particular order. Moreover, "comprises," "has," or any other variation thereof is intended to cover a non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the recited steps or units, and optionally includes additional steps or units that are not recited, and optionally includes additional steps or units that are specific to the process, method, product, or device.

[0060] An "embodiment" referred to in this specification means that a particular feature, structure, or characteristic described with reference to the embodiment may be included in at least one embodiment of the present application. Phrases appearing in various places in this specification do not necessarily refer to the same embodiment, nor are they an independent or optional embodiment exclusive of another embodiment. It will be explicitly and implicitly understood by those skilled in the art that the embodiment described in this specification may be combined with another embodiment.

[0061] In this application, "at least one item" means one or more, "multiple" means two or more, and "at least two items" means two, three, or more. The term "and / or" is used to describe an association relationship between associated objects, and indicates that three relationships may exist. For example, "A and / or B" can represent the following three cases: a case where only A exists, a case where only B exists, and a case where both A and B exist, where A and B may be singular or plural. The symbol " / " usually indicates an "or" relationship between associated objects. "At least one of the following items" or similar expressions means any combination of these items. For example, at least one 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 herein may 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, 5th-generation (5G) communication systems, and new communication systems emerging in future communication developments (e.g., 6G). The methods provided herein may further be applied to wireless local area network (WLAN) systems, such as wireless fidelity (Wi-Fi).

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

[0064] The method provided in this application may be applied to a scenario in which one node performs data transmission with one or more nodes, may be applied to single-user uplink / downlink transmission or multi-user uplink / downlink transmission, or may be applied to device to device (D2D) transmission. Details are not described here. The node may be an AP or a STA. For ease of description, the following uses communication between an AP and a STA as an illustrative example.

[0065] For example, a communication system to which the method provided in the present application may be applied may include an access point (AP) device and a station (STA) device. 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, the present application is applicable to a scenario in which an AP communicates with a STA in a WLAN. Optionally, an AP may communicate with a single STA, or an AP may communicate with multiple STAs simultaneously. Specifically, the communication between an AP and multiple STAs may be further classified into a downlink transmission in which an AP transmits signals to multiple STAs simultaneously, and an uplink transmission in which multiple STAs transmit signals to an AP. The AP and the STA may support a WLAN communication protocol. The communication protocol may include an IEEE 802.11be (also called Wi-Fi 7 or EHT protocol) protocol, and may further include protocols such as an IEEE 802.11ax protocol and an IEEE 802.11ac protocol. It is clear that with the continuous evolution and development of communication technology, the communication protocol may further include a next-generation protocol of IEEE 802.11be, and so on.

[0066] FIG. 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. FIG. 1 shows one access point device, for example, an AP, and three station devices, for example, STA1, STA2, and STA3. It is understood that FIG. 1 shows only one AP and three STAs as an example. However, there may be more or less APs or STAs. This is not limited in the present application.

[0067] An access point (e.g., AP in FIG. 1) is a device with wireless communication capability, supports communication according to a WLAN protocol, and has the capability of communicating with other devices (e.g., stations or other access points) in a WLAN. It is clear that an access point may further have the capability of communicating 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 an Ethernet. In a WLAN system, an access point may be called an access point station (AP STA). A device with wireless communication capability may be an entire device, or a chip or a processing system mounted on the entire device. A device with a chip or a processing system installed may implement the methods and functions in the embodiments of the present application under the control of the chip or the processing system. The AP in this embodiment of the present application is a device that provides services to STAs, and may support 802.11 series protocols. For example, an access point may be an access point for a terminal device (e.g., a mobile phone) to access a wired (or wireless) network, and is mainly deployed in homes, buildings, and parks. A typical coverage radius is from a few tens of meters to a hundred meters. It is clear that the access point may alternatively be deployed outdoors. In another example, the AP may be a communication entity, such as a communication server, a router, a switch, or a 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 chips or processing systems in these devices in various forms to implement the methods and functions in the embodiments of the present application. The access point in the present application may be a high efficient (HE) AP, an extremely high throughput (EHT) AP, or an access point applicable to future WiFi standards.

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

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

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

[0071] For example, FIG. 2 is a schematic diagram of an access point structure and a station structure according to an embodiment of the present application. The AP may have multiple antennas or may have a single antenna. As shown in FIG. 2, the AP includes a physical layer (PHY) processing circuit and a media access control (MAC) processing circuit. The physical layer processing circuit may be configured to process physical layer signals, and the MAC layer processing circuit may be configured to process MAC layer signals. The 802.11 standard focuses on PHY and MAC. As shown in FIG. 2, FIG. 2 further illustrates a schematic diagram of a structure of a STA with a single antenna. In a practical scenario, 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 another example, the transmitting device is an access point device and the receiving device is a station device. In 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 devices and receiving devices shown in this specification may be collectively referred to as communication devices.

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

[0074] The following describes terms related to this application.

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

[0076] 2. Physical (PHY) layer protocol data unit (PPDU) For example, Figure 3a is a schematic diagram of a frame structure of a very high throughput (VHT) PPDU (which may also be referred to as an 802.11ac PPDU). As shown in Figure 3a, the 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 (which may also be referred to as VHTSIGA) may include two OFDM symbols, each of which is 4 μs in duration. The VHT-LTF may include N VHT-LTF symbols, which may be used to assist a receiving device to correctly estimate a channel in order to assist a receiving device to correctly decode received data information.

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

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

[0079] The 802.11ac protocol supports the simultaneous transmission of up to eight streams of data, including single-user multiple input multiple output (MIMO) and multi-user MIMO technologies. STS If so, the number of OFDM symbols included in the LTF shown in FIG. LTF may satisfy the following relationship:

number

[0080] N STS denotes the maximum number of spatial streams supported by the communication device (the number of spatial streams may be abbreviated as the number of streams), and N LTFindicates the number of OFDM symbols included in the LTF (i.e., the number of LTF symbols included in the LTF). For example, VHT-LTF1 to VHT-LTF N shown in FIG. 3a are the number of OFDM symbols included in the LTF, and N is a positive integer. In addition, each LTF symbol included in the LTF may include a data subcarrier and a pilot subcarrier. For example, VHT-LTF1 shown in FIG. 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, etc. For example, the LTF may include 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 the number of pilot subcarriers included in each LTF symbol are not limited in this application. For the specific number of data subcarriers and pilot subcarriers, please refer to the relevant standard or protocol. Details will not be described here. For example, the data subcarriers included in each of the N LTF symbols included in the LTF may be the same, and the pilot subcarriers included in each LTF symbol may also be the same.

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

number

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

[0083] For example, when transmitting a PPDU, the transmitting device may assign P 4×4 The elements in the i-th row and j-th column of the matrix may be multiplied, where i may be a positive integer between 1 and 4, and j may be a positive integer between 1 and 4. It will be understood that FIG. 3b shows four LTF symbols, and FIG. 3b marks only the first LTF symbol as an example. It will be understood that i shown in the present application may vary with the amount of spatial streams, and j may vary with the amount of spatial streams. For example, if the number of spatial streams is 8, then i may be an integer between 1 and 8, and j is an integer between 1 and 8, and

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

[0085] P 4x4 The matrix is ​​orthogonal, i.e.

number

number

[0086] In other words, when a transmitting device transmits a PPDU, the signal transmitted on the data subcarriers in each LTF symbol can be obtained by multiplying the P matrix by the LTF sequence. Upon receiving the signal, the receiving device obtains the channel response H k To obtain P, a channel estimation may be performed according to the P matrix, the signals received on the data subcarriers in each LTF symbol, and the LTF sequence.

[0087] In addition, when the transmitting device transmits a PPDU, the signal transmitted on the pilot subcarrier in each LTF symbol may be obtained by multiplying the R matrix with the LTF sequence. Upon receiving the signal, the receiving device may perform phase tracking, frequency offset estimation, etc. according to the R matrix, the signal received on the pilot subcarrier in each LTF symbol, and the LTF sequence.

[0088] In other words, when a transmitting device transmits a PPDU, a data subcarrier in the jth LTF symbol corresponding to the ith spatial stream (i.e., the jth LTF symbol in the LTF in the PPDU) may be multiplied by the element in the ith row and jth column of the P matrix, and a pilot subcarrier in the jth LTF symbol corresponding to the ith spatial stream is multiplied by the element in the ith row and jth column of the R matrix. For example, the ith 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 may be shown as follows: R(i,j)=P(1,j) (4)

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

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

[0091] The P matrix above is illustrated using an example where the number of spatial streams is 4. For example, N STS For =2, the corresponding P matrix is:

number

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

number

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

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

number

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

number

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

[0097] In consideration of this, the present application provides a signal processing method and apparatus. The method provided in the present application is applicable to scenarios where the number of streams is greater than 8. For example, the method provided in the present application may support 16-stream channel estimation, for example, 16-stream MIMO channel estimation. As another example, the method provided in the present application may further support 32-stream or 24-stream channel estimation. In addition, the P n×n The matrix is ​​P n×n The space required to store the matrix can be further reduced.

[0098] It should be understood that the description of the communication device and the communication system in the signal processing method provided in the present application can be referred to the above description. Details will not be described again here. It should be understood that the following uses an example in which the communication device includes a transmitting device and a receiving device to describe the method provided in the embodiment of the present application. The transmitting device shown below can be understood as a device for transmitting PPDU, and the receiving device can be understood as a device for receiving PPDU.

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

[0100] 401: A transmitting device generates a PPDU, the PPDU including a preamble, the preamble including an LTF, the LTF including a plurality of LTF symbols, the plurality of LTF symbols being used to carry a sequence obtained according to a first matrix, the first matrix being P n×n matrix, or the first matrix is ​​P n×n It is obtained according to the matrix,

number

number

[0101] n is P n×n It may indicate the number of rows and columns of a matrix (which may be referred to as a P matrix for short) 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, if n=12, P n×nThe matrix may include 12 rows and 12 columns. Thus, the first matrix includes 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 n-th LTF symbol corresponding to the m-th spatial stream by the m-th row and the n-th column of the first matrix (as shown in FIG. 3b). Correspondingly, the receiving device may simultaneously estimate channels of spatial streams whose number is 12 or less. For example, the receiving device may further simultaneously estimate channels of 8 spatial streams, or the receiving device may further simultaneously estimate channels of 4 spatial streams. In other words, the receiving device may perform channel estimation, phase tracking, frequency offset estimation, etc. according to some or all of the contents of the first matrix. For example, when n=16, the first matrix may include 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 channels of 16 spatial streams, or the receiving device may further simultaneously estimate channels of spatial streams whose number is less than 16. For example, the receiving device may be a P n×n According to the matrix, the channel of 2 to 15 spatial streams may be further estimated, for example, the channel of 2 spatial streams, the channel of 3 spatial streams, the channel of 4 spatial streams, the channel of 6 spatial streams, the channel of 8 spatial streams, the channel of 12 spatial streams, or the channel of 15 spatial streams, which is not limited in this embodiment of the present application.

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

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

[0105] For example, the LTF symbols include data subcarriers. In this case, the first matrix is ​​P n×n Alternatively, the first matrix may be equal to P n×n The transpose of a matrix (e.g.,

number

number

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

number

[0107] For an example of the first matrix, see Equations (84) to (89) below. n×n Matrices and P n×n For the relationship with matrices, please refer to equation (10) below.

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

[0109] It should be understood that for the LTF sequence, the data subcarriers, the pilot subcarriers, the relationship between the P matrix and the data subcarriers, and the relationship between the R matrix and the pilot subcarriers, refer to the above description, for example, FIG. 3a or FIG. 3b. Details will not be described again here.

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

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

[0112] 402: The transmitting device transmits a PPDU, and in response, the receiving device receives the PPDU.

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

[0114] For example, the receiving device may perform channel estimation according to the first matrix and signals received on data subcarriers in the multiple LTF symbols. For example, the receiving device may perform channel estimation according to the first matrix, the LTF sequence, and signals received on data subcarriers in 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 signals received on pilot subcarriers in 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 signals received on pilot subcarriers in the multiple LTF symbols.

[0115] First matrix

number

number

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

number

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

[0118] [R] m,n is R n×n Indicates the mth row of the matrix, [P] 1,n , P n×n This indicates the first row of a matrix, and m and n are both integers between 1 and 16.

[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 negation matrix, P n×n The first row of the transpose of a matrix, P n×n It will be appreciated that it may further be equal to the first row of the transpose of a full negation of a matrix, and so on.

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

[0121] Typically, for a 16-by-16 matrix, a communication device typically needs to store the values ​​of 256 elements. Therefore, when generating an LTF, a communication device (e.g., a transmitting device) may read the elements of the matrix sequentially. However, the P n×n In the matrix, S (n-1)×(n-1) By storing only the first row or column vectors of a submatrix (or the first vector x, the second vector y, etc.), (n-1)×(n-1) Submatrix and P n×n The matrix can be restored. 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 implementation complexity can be reduced. Alternatively, the P n×n The matrix may include elements 1 and -1, which can further simplify the computational complexity. Alternatively, to effectively resolve spectral bumps, the P n×n The n elements in the Tth row of the matrix are different.

[0122] In the following, P n×n Based on the characteristics of the matrix, the P n×n The matrix is ​​described below. One or more of the following characteristics are n×n It will be understood that the matrix may be a feature of the matrix. For example, any of the following features 1 to 7 may be P n×n Alternatively, any two of the following characteristics 1 to 7 may be combined to form a matrix. n×n These are the characteristics of matrices. Alternatively, any combination of three of the following characteristics 1 to 7 may be P n×n These are the characteristics of matrices. Alternatively, the following characteristics 1 to 7 are all P n×n It may also be a feature of a matrix.

[0123] Feature 1: P n×n The matrix contains element 1 and element −1.

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

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

[0126] In this embodiment of the present application, for example, P n×n n elements in the first row of the matrix are different. Or, P n×n n elements in the second row of the matrix are different. Or, P n×n The n elements in the Tth row of the matrix are different. Therefore, P n×n The matrix R is obtained according to n×n The n elements in each row of the matrix can also be different, which effectively solves the spectral bump problem.

[0127] With reference to Features 1 and 2, the P provided in this embodiment of the present application n×n The elements of the matrix are simple: P n×n The n elements of each row of the matrix are different, which solves the complex operation of the communication device and effectively solves the spectrum bump.

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

[0129] A circulant matrix may be a special form of a Toeplitz matrix (also called a diagonal constant matrix). Each element of a column vector of a circulant 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 with equal elements on each skew diagonal.

[0131] In this embodiment of the present application, P n×n Submatrix S of a matrix (n-1)×(n-1) is set to a circulant matrix or a Hankel matrix, and the communication device calculates the submatrix S (n-1)×(n-1) A submatrix can be restored by simply storing the first row or the first column of , which can effectively save the storage space of the communication device and reduce the implementation complexity.

[0132] submatrix S (n-1)×(n-1) It will be appreciated that for an example where is a Hankel matrix, see equations (51) and (52) below.

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

[0134] In this embodiment of the present application, the submatrix S (n-1)×(n-1) Another row of may also be obtained based on the first vector x or the second vector y. For ease of explanation, in the following, the submatrix S (n-1)×(n-1) Each matrix provided in the embodiment of the present application will be described using an example in which the first row of is equal to the first vector x (or the second vector y) or is obtained based on the first vector x (or the second vector y). However, this should not be construed as a limitation on the embodiment of the present application.

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

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

[0137] For example, the submatrix S (n-1)×(n-1)The first row of is equal to the total negation of the first vector, e.g., the submatrix S (n-1)×(n-1) The first row of is equivalent 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 of is equal to the inverse vector of the first vector, e.g., the submatrix S (n-1)×(n-1) The first row of is equal to [-1-1-1 1-1-1 1-1 1 1 1] (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 of is equal to the circular shift vector of the first vector, e.g., the submatrix S (n-1)×(n-1 ) 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 of is obtained by shifting the first vector x to the right by one bit. (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 of is obtained by shifting the first vector x to the left by one bit.

[0140] For example, the submatrix S (n-1)×(n-1) The first row of is equal to the total negation of the second vector, e.g., the submatrix S (n-1)×(n-1) The first row of is equivalent to [-1-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 of is equal to the inverse vector of the second vector, e.g., the submatrix S (n-1)×(n-1) The first row of is equal to [-1 1 1-1-1 1-1 1-1-1-1-1-1 1 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 of is equal to the circular shift vector of the second vector, e.g., the submatrix S (n-1)×(n-1 ) is equal to [-1 1 1 1-1-1-1-1 1-1 1-1-1 1 1]. In other words, the submatrix S (n-1)×(n-1) The first row of is obtained by shifting the second vector y to the right by one bit. (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 of is obtained by shifting the second vector y to the left by one bit.

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

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

[0145] In another example, the submatrix S (n-1)×(n-1) The first row of is equal to [1 1 1-1 1-1-1 1-1-1-1], and the submatrix S (n-1)×(n-1)The second row of is equal to [1 1-1 1-1-1 1-1-1-1 1] (i.e., the 11 elements of x are shifted left by 1 bit), and the submatrix S (n-1)×(n-1) The third row of is equal to [1-1 1-1-1 1-1-1-1 1 1] (i.e., shift the 11 elements of x to the left by 2 bits). The rest can be deduced by analogy: (n-1)×(n-1) can be obtained.

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

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

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

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

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

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

[0152] submatrix S (n-1)×(n-1) and for the description of the second vector y, the submatrix S (n-1)×(n-1) It will be understood that reference is made to the above example of the first vector x, and the details will not be described again here.

[0153] In this embodiment of the present application, the communication device determines P based on the first vector or the second vector. n×n Submatrix S of a matrix (n-1)×(n-1) After getting the first row of S (n-1)×(n-1)Therefore, in order to recover the submatrix, the communication device may obtain P n×n Submatrix S of a matrix (n-1)×(n-1) Alternatively, when the relationship between the rows of the submatrix and the first or second vector is determined, the communication device can restore the submatrix by only storing the first or second vector. Thus, the complete P n×n The matrix does not need to be stored. Furthermore, this n×n It can reduce the space occupied by the matrix, save the memory space, and effectively reduce the implementation complexity of the communication device (for example, P n×n Submatrix S of a matrix (n-1)×(n-1) can be restored based on operations such as cyclic shifts.

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

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

number

[0156] The fourth vector y′ can be expressed as follows:

number

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

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

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

[0160] For example, the submatrix S (n-1)×(n-1) The first column of is equal to the total negation of the third vector, e.g., the submatrix S (n-1)×(n-1) The first column of is [-1 1 1 1-1 1 1-1 1-1-1] T is equal to.

[0161] In another example, the submatrix S (n-1)×(n-1) The first column of is equal to the transpose of the circularly shifted vector of the third vector. For example, the submatrix S (n-1)×(n-1) The first column of is [-1-1-1 1-1-1 1-1 1 1 1] T In other words, the submatrix S (n-1)×(n-1) The first column of is obtained by cyclically shifting the third vector x' up by one bit. (n-1)×(n-1) The first column of is [1 1-1-1-1 1-1-1 1-1 1-1 1] T In other words, the submatrix S (n-1)×(n-1) The first column of 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 appreciated that the second to (n-1)th columns of can also be obtained based on a cyclic shift of the first column.

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

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

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

[0166] submatrix S (n-1)×(n-1) The first column of and the third vector x ’ or a fourth vector y ’ It will be understood that for an explanation of the relationship between the above and the above, please refer to the explanation of feature 4. The details will not be explained again here.

[0167] For ease of explanation, in the following, P n×n Submatrix S of a matrix (n-1)×(n-1)Using an example in which the first row of is equal to or obtained based on the first vector (or the second vector), the P n×n The matrix is ​​explained below. n×n Submatrix S of a matrix (n-1)×(n-1) An example in which the first column of is equal to or obtained based on the third vector (or the fourth vector) will not be described in detail.

[0168] Feature 6:

number

number

number

number

[0169] S (n-1)×(n-1) The matrix is ​​P n×n is a submatrix of the matrix S (n-1)×(n-1) The matrix has n-1 rows and n-1 columns, α is a column vector with n-1 elements, each element being 1, and α T is the transposed vector of α, and −α denotes the vector obtained by negating all elements in α.

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

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

[0172] Feature 7:

number

number

number

number

[0173] In other words, P 16×16 matrix (i.e., P for n=16) n×n 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 eight.

[0174] for example,

number

[0175] In this embodiment of the present application, P 8×8 The matrix is ​​expanded to P 16×16 A matrix is ​​generated, which can ensure that the communication device supports the transmission of 16 streams or less than 16 streams of data and avoid excessively complicated operations.

[0176] In this embodiment of the present application, P 32×32 The matrix is ​​P 16×16 can be obtained according to the matrix P24×24 The matrix is ​​P 12×12 It can be understood that the matrix can be obtained. 8×8 Expand the matrix to P 16×16 This is similar to the method for generating matrices. For simplicity, in the following, 12×12 According to the matrix P 24×24 A method for obtaining a matrix, and P 16×16 According to the matrix P 32×32 The method for obtaining the matrix will not be described in detail.

[0177] P 12×12 The matrix is ​​P 24×24 expanded to generate matrices, or P 16×16 The matrix is ​​P 32×32 matrix, which can ensure that a communication device supports the transmission of 32 streams or less than 32 streams of data and avoid excessively complex operations.

[0178] For example, in the following, P n×n The matrix will be described in detail and then the R n×n The matrices are described, and finally the first matrix provided in the embodiment of the present application is 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)is shown using an example where the first row of 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 the embodiments of the present application. (n-1)×(n-1) It will be understood that each element of the row vector of is the result of sequentially shifting each element of the previous row vector one bit to the right. (n-1)×(n-1) Each element of the row vector of is the result of sequentially shifting each element of the previous row vector one bit to the left. Equations (22) and (23) shown in this specification also represent P obtained according to equation (13). n×n It will be understood that the matrix S may be understood as (n-1)×(n-1) The result of sequentially shifting each element of the row vector of 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 S to the left by 2 (or 3, 4, etc.) bits is also within the scope of protection of this application. Therefore, for the sake of brevity, in the following, as an example, the submatrix S (n-1)×(n-1) In addition, for the sake of brevity, matrices obtained based on any 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 equations (22) and (23), P n×n Submatrix S of a matrix (n-1)×(n-1) is a circulant matrix or a Hankel matrix, and the communication device calculates the submatrix S (n-1)×(n-1) Just memorize the first line of n×n It can be seen that the matrix can be obtained. This can effectively save the storage space of the communication device, and P n×n The complexity of restoring the matrix can be reduced. n×n matrix, or P n×n It will be understood that the above method is also applicable to the first matrix obtained according to the matrix, and in order to avoid repetition, the details will not be described 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (24) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (24) 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)is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (26) 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) is shown using an example where the first row of is equal to [-1-1-1 1-1 1 1-1 1 1 1] (i.e., the total negation of the first vector), and P is shown using equation (13) as an example. 12×12 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (27) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (28) are not enumerated herein.

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

number

[0195] Equation (29) is a submatrix S (n-1)×(n-1) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (29) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (30) 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) is shown using an example where the first row of 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×12For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (31) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (32) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (33) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (34) are not recited 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (35) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (36) are not recited herein.

[0210] Submatrix S of Eq. (36) (n-1)×(n-1) It will be appreciated that may be a Hankel matrix. (n-1)×(n-1) For another example where x 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (37) are not recited 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (38) 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) is shown using an example where the first row of is equal to [-1-1-1 1 1 1 1-1 1-1 1 1-1-1 1] (i.e., the total negation of the second vector), and P is shown using equation (13) as an example. 16×16 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (39) are not recited 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (40) 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) is shown using an example where the first row of 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×16For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (41) 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) is shown using an example where the first row of 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (42) 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) is shown using an example where the first row of is equal to [-1 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (43) 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) is shown using an example where the first row of is equal to [-1 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (44) are not recited 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) is shown using an example where the first row of is equal to [-1 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 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (45) 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) is shown using an example where the first row of is equal to [-1 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×16For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (46) are not recited herein.

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

number

[0232] Equation (47) can be used as an example to show P 16×16 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (47) are not recited herein.

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

number

[0234] Equation (47) can be expressed as P using equations (18) and (21) as an example. 16×16 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (37) are not recited herein.

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

number

[0236] Equation (49) can be used as an example to show P 16×16For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (37) are not recited herein.

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

number

[0238] Equation (50) is the P 16×16 For the sake of brevity, matrices obtained based on any one or more of the three operations of cyclic shift, total negation, and inversion in equation (37) are not recited herein.

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

number

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

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

number

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

[0243] For example, in the following, R n×n Let us explain about 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 of each row of the matrix are the same. Therefore, for simplicity, the following equations (54) to (83) are written as 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] It will be understood that elements of other rows not shown in equation (54) refer to elements of the first row. This explanation also applies to equations (55) to (83) below. For the sake of brevity, the details will not be described again 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-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 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-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 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 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 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-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 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 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 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 1](83)

[0278] Formulas (53) to (83) are R n×n It will be understood that this is just an example of a matrix.

[0279] For example, the following describes the first matrix provided in this embodiment of the present application.

[0280] The first matrix is ​​P n×n Matrix or R n×nIt will be understood that the example of the matrix P will not be described in detail again below. n×n Equal to the total negation of a matrix, or the first matrix is ​​P n×n The first matrix is ​​equal to the transpose of P n×n Transpose of the total negation of a matrix (P n×n Only examples equivalent to the total negation of the transpose of a matrix are shown.

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

number

[0282] In one possible implementation, the first matrix may be expressed as follows:

number

[0283] In one possible implementation, the first matrix may be expressed as follows:

number

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

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

number

[0286] In one possible implementation, the first matrix may be expressed as follows:

number

[0287] In one possible implementation, the first matrix may be expressed as follows:

number

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

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

[0290] The following describes a communication device provided in an embodiment of the present application.

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

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

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

[0294] For example, the transceiver unit 502 is configured to input a PPDU, where the PPDU includes a preamble, where the preamble includes a long training field LTF, where the LTF includes a number of LTF symbols.

[0295] The processing unit 501 calculates a first matrix

number

number

number

number

number

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

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

[0298] It should be understood that the specific description of the transceiver unit and the processing unit described in this embodiment of the present application is merely an example. For the specific functions, steps, etc. of the transceiver unit and the processing unit, please refer to the above-mentioned embodiment of the method. The 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 FIG. 4a, and the processing unit 501 may be further configured to perform step 403 shown in FIG. 4a.

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

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

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

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

[0303] It should be understood that the specific description of the transceiver unit and the processing unit described in this embodiment of the present application is merely an example. For the specific functions, steps, etc. of the transceiver unit and the processing unit, please refer to the above-mentioned embodiment of the method. The details will not be described again here. For example, the processing unit 501 may be further configured to perform step 401 shown in FIG. 4a, and the transceiver unit 502 may be further configured to perform the transmission step of step 402 shown in FIG. 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 may use the data subcarrier processing component to perform channel estimation, etc.

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

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

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

[0308] For example, when the communication apparatus is configured to perform a step, method, or function performed by a receiving device, the transceiver 610 is configured to receive a PPDU from a transmitting device.

number

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

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

[0311] It will be understood that for a specific description of the processor and the transceiver, please refer to the description of the processing unit and the transceiver unit shown in Figure 5. The details will not be described again here.

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

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

[0314] Therefore, a communication device (e.g., a transmitting device or a receiving device) can obtain the complete P by simply storing the first vector x or the second vector y. n×nIt is possible to obtain a matrix, which can effectively save the storage space of the communication device, and P n×n The complexity of restoring the matrix can be reduced.

[0315] The specific connection medium between the transceiver 610, the processor 620, and the memory 630 is not limited in this embodiment of the present application. In this embodiment of the present application, the memory 630, the processor 620, and the transceiver 610 are connected via the bus 650 in FIG. 6, and the bus is represented by a thick line in FIG. 6. The connection manner between the other components is described generally and is not limited thereto. The bus may be classified as an address bus, a data bus, a control bus, and the like. For ease of illustration, the bus is shown in FIG. 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 the embodiments of the present application, the processor may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or another programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed with reference to the embodiments of the present application may be directly executed and performed by a hardware processor, or may be executed and performed using a combination of hardware modules and software modules in a processor.

[0317] In this embodiment of the present application, the memory may include, but is not limited to, a non-volatile memory, such as a hard disk drive (HDD) or solid-state drive (SSD), a random access memory (RAM), an erasable programmable read-only memory (EPROM), a read-only memory (ROM), or a compact disc read-only memory (CD-ROM). The 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 shown in this application). However, this is not limited thereto. The memory in the embodiment of the present application may alternatively be a circuit or any other device that can implement a storage function and is configured to store program instructions and / or data.

[0318] The processor 620 is primarily configured to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of 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 conversion between baseband signals and radio frequency signals, and process the radio frequency signals. The antenna is primarily configured to transmit and receive radio frequency signals in the form of electromagnetic waves. The input / output device, such as a touch screen, a display screen, or a keyboard, is primarily configured to receive data input by a user and output data to the user.

[0319] After the communication device is powered on, the processor 620 can read the software program in the memory 630, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 620 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 through an antenna. When data is transmitted to the communication device, the radio frequency circuit receives the radio frequency signal through an 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 circuitry and antenna may be located independently from the processor performing the baseband processing, for example in a distributed scenario, the radio frequency circuitry and antenna may be located remotely and independent from the communication device.

[0321] It should be understood that the communication device shown in this embodiment of the present application may further have more components than those in FIG. 6, etc. This is not limited in this embodiment of the present application. The method performed by the processor and the transceiver is merely an example. Please refer to the above-mentioned method for specific steps performed by the processor and the transceiver.

[0322] In another possible embodiment, in the communication device shown in FIG. 5, the processing unit 501 may be one or more logic circuits, and the transceiver unit 502 may be an input / output interface, also called a communication interface, an interface circuit, an interface, etc. Alternatively, the transceiver unit 502 may be a transmitting unit and a receiving unit. The transmitting unit may be an output interface, and the receiving unit may be an input interface. Alternatively, the transmitting unit and the receiving unit are integrated into one unit, for example, an input / output interface. As shown in FIG. 7, the communication device includes a logic circuit 701 and an interface 702. In other words, the processing unit 501 may be implemented using the logic circuit 701, and the transceiver unit 902 may be implemented using the interface 702. The logic circuit 701 may be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC), etc. The interface 702 may be a communication interface, an input / output interface, a pin, etc. For example, FIG. 7 is an example in which 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 circuit may be further coupled to an interface. The specific connection manner of the logic circuit and the interface is not limited in this embodiment of the present application.

[0324] For example, if the communication apparatus is configured to perform a method, function, or step performed by a receiving device, the interface 702 is configured to input the PPDU.

number

[0325] For example, when the communications apparatus is configured to perform a method, function, or step performed by a transmitting device, the logic circuitry 701 is configured to generate a PPDU. The interface 702 is configured to output the PPDU.

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

[0327] Therefore, a communication device (e.g., a transmitting device or a receiving device) can obtain the complete P by simply storing the first vector x or the second vector y. n×n It is possible to obtain a matrix, which can effectively save the storage space of the communication device, and P n×n The complexity of restoring the matrix can be reduced.

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

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

[0330] For the specific implementation of the embodiment shown in Figure 7, please refer to the above-mentioned embodiment, and the details will not be described again here.

[0331] An embodiment of the present application further provides a wireless communication system. The wireless communication system includes a transmitting device and a receiving device. The transmitting device and the receiving device can be configured to perform the method in any embodiment (for example, FIG. 4a).

[0332] In addition, the present application further provides a computer program, which is used to implement the actions and / or processes performed by the transmitting device in the methods provided in the present application.

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

[0334] The present application further provides a computer-readable storage medium, which stores computer code, which when executed on a computer, enables the computer to perform the operations and / or processes performed by the transmitting device in the methods provided in the present application.

[0335] The present application further provides a computer-readable storage medium, which stores computer code, which when executed on a computer, enables the computer to perform the operations and / or processes performed by a receiving device in the methods provided in the present application.

[0336] The present application further provides a computer program product, the computer program product including computer code or a computer program, which when executed on a computer, performs the operations and / or processes performed by the transmitting device in the methods provided in the present application.

[0337] The present application further provides a computer program product, the computer program product comprising computer code or a computer program, which when executed on a computer performs the operations and / or processes to be performed by a receiving device in the methods provided in the present application.

[0338] In some embodiments provided in the present application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, the described device embodiment is merely an example. For example, the division into units is merely a logical division of functions, and may be other divisions 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 implemented. In addition, the shown or discussed mutual couplings or direct couplings or communication connections may be implemented through some interfaces. Indirect couplings or communication connections between devices or units may be implemented in electrical, mechanical, or other forms.

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

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

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

[0342] The above description is only a specific embodiment of the present application, and the protection scope of the present application is not limited thereto. Any variations or replacements that can be easily thought of by those skilled in the art within the technical scope disclosed in this application shall fall within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims. [Explanation of symbols]

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

Claims

1. 1. A method of signal processing, comprising: receiving a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols; First matrix [0010] processing the received signal with the plurality of LTF symbols according to [0025] P n×n matrix, or said first matrix [0030] P n×n It is obtained according to the matrix, [0045] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [0050] The matrix is n×n a transpose of n, n being an integer greater than 8, and k indicating a k-th subcarrier in each of the plurality of LTF symbols; Including, [006] [0070] [0080] or [0090] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The method, wherein the S(n-1)×(n-1) matrix is ​​a circulant matrix or a Hankel matrix.

2. A signal processing method, the method comprising: receiving a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols; First matrix [0010] processing the received signal with the plurality of LTF symbols according to ##EQU00011## is a P n×n matrix, or the first matrix ##EQU00012## is obtained according to the P n×n matrix, ##EQU00013## where I is an identity matrix, the P n×n matrix contains n rows and n columns, ##EQU14## a matrix is ​​a transpose of the P n×n matrix, n is an integer greater than 8, and k indicates a k-th subcarrier in each of the plurality of LTF symbols; Including, ##EQU00015## ##EQU00016## ##EQU00017## or [0018] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The first row of the S(n-1)×(n-1) matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations, namely, circular shift, inversion, and total negation, on a first vector x, where x=[1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​equal to a second vector y, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or The method, wherein the first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations on a second vector y: circular shift, inversion, and total negation, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1].

3. For n=12, [0019] [0020] ##EQU00021## [0022] or [0023] The method according to claim 1 or 2,

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

5. For n=16, [0027] [0028] [0029] or [0030] and [0031] The method according to claim 1 or 2,

6. The first matrix [0032] but, [Equation 33] and R n×n The matrix has n rows and n columns, and R n×n Each row of the matrix is n×n The method according to claim 1 , wherein the first row of the matrix satisfies the condition that the first row of the matrix is ​​equal to the first row of the matrix.

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

8. R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, n×n The method of claim 6, wherein the matrix is ​​used for channel estimation.

9. A signal processing method, comprising: generating a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [0034] said first matrix being used to convey the sequence obtained according to [Equation 35] is a P n×n matrix, or the first matrix [0036] is obtained according to the P n×n matrix, [Equation 37] where I is an identity matrix, the P n×n matrix contains n rows and n columns, [Equation 38] a matrix is ​​a transpose of the P n × n matrix, n is an integer greater than 8, and k indicates a k th subcarrier in each of the plurality of LTF symbols; transmitting the PPDU; Including, [0039] [0040] [0041] or [0042] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The method, wherein the S(n-1)×(n-1) matrix is ​​a circulant matrix or a Hankel matrix.

10. A signal processing method, comprising: generating a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [0043] said first matrix being used to convey the sequence obtained according to [0044] is a P n×n matrix, or the first matrix [0045] is obtained according to the P n×n matrix, [0046] where I is an identity matrix, the P n×n matrix contains n rows and n columns, [0047] a matrix is ​​a transpose of the P n × n matrix, n is an integer greater than 8, and k indicates a k th subcarrier in each of the plurality of LTF symbols; transmitting the PPDU; Including, [0048] [0049] [Number 50] or [0051] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The first row of the S(n-1)×(n-1) matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations, namely, circular shift, inversion, and total negation, on a first vector x, where x=[1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​equal to a second vector y, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations on a second vector y: circular shift, inversion, and total negation, where y=[1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1]. method.

11. When n=12, [0052] [0,53] [0,54] [0.55] or [0,56] The method according to claim 9 or 10,

12. When n=16, [0.57] [0,58] or [0,59] The method according to claim 9 or 10,

13. When n=16, [0.60] [0061] [0062] or [0063] and [0,64] The method according to claim 1 or 2, 14. The first matrix [0.65] but, [0.66] and 14. The method according to claim 9, wherein the Rnxn matrix contains n rows and n columns, and each row of the Rnxn matrix is ​​equal to the first row of the Pnxn matrix.

15. The method of claim 15, wherein when the kth subcarrier is a non-pilot subcarrier, the first matrix is ​​equal to a total negation of the P n ×n matrix. the first matrix is ​​equal to the transpose of the P n×n matrix; the first matrix is ​​equal to the transpose of the total negation of the P n ×n matrix; or 14. A method according to any one of claims 9 to 13, wherein the first matrix is ​​equal to the total negation of the transpose of the Pnxn matrix.

16. The method of claim 14, wherein the R n×n matrix is ​​used for phase tracking and / or frequency offset estimation, and the P n×n matrix is ​​used for channel estimation.

17. A communication device, comprising: a transceiver unit configured to receive a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols; First matrix [0.67] a processing unit configured to process a signal received on the plurality of LTF symbols according to [0068] P n×n matrix, or the first matrix [0,69] P n×n It is obtained according to the matrix, [Number 70] where I is the identity matrix, and P n×n The matrix has n rows and n columns, [Equation 71] The matrix is n×n a transpose of a matrix, n being an integer greater than 8, and k indicating a k-th subcarrier in each of the plurality of LTF symbols; Equipped with [Equation 72] [Equation 73] [74] or [Number 75] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The communication device, wherein the S(n-1)×(n-1) matrix is ​​a circulant matrix or a Hankel matrix.

18. A communication device, comprising: a transceiver unit configured to receive a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols; First matrix [76] a processing unit configured to process a signal received on the plurality of LTF symbols according to [77] is a P n×n matrix, or the first matrix [78] is obtained according to the P n×n matrix, [79] where I is an identity matrix, the P n×n matrix contains n rows and n columns, [Number 80] a processing unit, wherein the matrix is ​​a transpose of the P n×n matrix, n being an integer greater than 8, and k indicating a k-th subcarrier in each of the plurality of LTF symbols; Equipped with [Number 81] [0082] [Number 83] or [Number 84] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The first row of the S(n-1)×(n-1) matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations, namely, circular shift, inversion, and total negation, on a first vector x, where x=[1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​equal to a second vector y, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or the first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations, namely, cyclic shift, inversion, and total negation, on a second vector y, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1].

19. For n=12, [Number 85] [Number 86] [Number 87] [Number 88] or [Number 89] 19. The communication device according to claim 17 or 18,

20. For n=16, [Number 90] [Number 91] or [Number 92] 19. The communication device according to claim 17 or 18,

21. For n=16, [Number 93] [Number 94] [Number 95] or [Number 96] and [Number 97] 19. The communication device according to claim 17 or 18,

22. The first matrix [Number 98] but, [Number 99] and R n×n The matrix has n rows and n columns, and R n×n Each row of the matrix is n×n The communication device according to claim 17 , wherein the condition is satisfied that the first row of the matrix is ​​equal to the first row of the matrix.

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

24. R n×n The matrix is ​​used for phase tracking and / or frequency offset estimation, n×n 23. The communications device of claim 22, wherein the matrix is ​​used for channel estimation.

25. A communication device, comprising:

1. A processing unit configured to generate a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [Number 100] said first matrix being used to convey the sequence obtained according to [Number 101] is a P n×n matrix, or the first matrix [00102] is obtained according to the P n×n matrix, [Number 103] where I is an identity matrix, the P n×n matrix contains n rows and n columns, [Equation 104] A processing unit, wherein the matrix is ​​a transpose of the P n × n matrix, n is an integer greater than 8, and k indicates a k-th subcarrier in each of the plurality of LTF symbols; a transceiver unit configured to transmit the PPDU; Equipped with [00105] [Number 106] [Equation 107] or [Number 108] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The communication device, wherein the S(n-1)×(n-1) matrix is ​​a circulant matrix or a Hankel matrix.

26. A communication device, comprising:

1. A processing unit configured to generate a physical layer protocol data unit (PPDU), the PPDU including a preamble, the preamble including a long training field (LTF), the LTF including a plurality of LTF symbols, the plurality of LTF symbols being represented by a first matrix [Number 109] said first matrix being used to convey the sequence obtained according to [Equation 110] is a P n×n matrix, or the first matrix [Equation 111] is obtained according to the P n×n matrix, [Equation 112] where I is an identity matrix, the P n×n matrix contains n rows and n columns, [Equation 113] A processing unit, wherein the matrix is ​​a transpose of the P n × n matrix, n is an integer greater than 8, and k indicates a k-th subcarrier in each of the plurality of LTF symbols; a transceiver unit configured to transmit the PPDU; Equipped with [Equation 114] [Number 115] [Equation 116] or [Equation 117] and the S(n-1)×(n-1) matrix is ​​a submatrix of the Pn×n matrix, the S(n-1)×(n-1) matrix has n-1 rows and n-1 columns, α is a column vector consisting of n-1 elements, each element is 1, αT is the transpose vector of α, and -α denotes the vector obtained by negating all elements in α; The first row of the S(n-1)×(n-1) matrix is ​​equal to the first vector x, where x = [1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of three operations, namely, circular shift, inversion, and total negation, on a first vector x, where x=[1 1 1-1 1-1-1 1-1-1-1]; The first row of the S(n-1)×(n-1) matrix is ​​equal to a second vector y, where y = [1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1], or The first row of the S(n-1)×(n-1) matrix is ​​obtained by performing one or more of the following three operations on a second vector y: circular shift, inversion, and total negation, where y=[1 1 1-1-1-1-1 1-1 1-1-1 1-1-1 1 1-1]; Communications equipment.

27. When n=12, [Number 118] [Equation 119] [Number 120] [Number 121] or [Number 122] 27. The communication device according to claim 25 or 26, 28. When n=16, [Number 123] [Number 124] or [Number 125] 27. The communication device according to claim 25 or 26, 29. When n=16, [Number 126] [Number 127] [Number 128] or [Number 129] and [Number 130] 27. The communication device according to claim 25 or 26, 30. The first matrix [Number 131] but, [Number 132] 30. The communication device according to claim 25, wherein the Rn×n matrix includes n rows and n columns, and each row of the Rn×n matrix is ​​equal to the first row of the Pn×n matrix.

31. When the kth subcarrier is a non-pilot subcarrier, the first matrix is ​​equal to a total negation of the P n ×n matrix. the first matrix is ​​equal to the transpose of the P n×n matrix; the first matrix is ​​equal to the transpose of the total negation of the P n ×n matrix; or 30. A communications device according to any one of claims 25 to 29, wherein the first matrix is ​​equal to a total negation of the transpose of the Pnxn matrix.

32. The communications device of claim 30, wherein the R n×n matrix is ​​used for phase tracking and / or frequency offset estimation, and the P n×n matrix is ​​used for channel estimation.

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

34. A communications device comprising a processor and a memory, the memory is configured to store computer-executable instructions; A communications device, wherein the processor is configured to execute the computer-executable instructions to perform a method according to any one of claims 9 to 16.

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

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

37. 9. A computer readable storage medium configured to store a computer program which, when executed, performs the method of any one of claims 1 to 8.

38. A computer-readable storage medium, the computer-readable storage medium configured to store a computer program, the computer program, when executed, performing a method according to any one of claims 9 to 16.

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

40. A computer program which, when executed, performs a method according to any one of claims 9 to 16.

Images