Communication method and device based on physical layer protocol data unit

Abstract

A communication method and device based on a PPDU can be applied to a system supporting an 802.15 standard system, such as a 802.15. 4a protocol, a 802.15. 4 z protocol or a 802.15. 4 ab protocol, a 802.15. 4a protocol, a 802.15. 4 z protocol or a 802.15. 4 ab next-generation protocol and the like, and a wireless local area network system of 802.11 series protocols such as a 802.11 be next-generation protocol, Wi-Fi 8 and the like, and can also be applied to a UWB-based wireless personal local area network system, a sensing system and the like. The method comprises the following steps: a sending end generates a PPDU based on a mapping relationship between a data symbol and a spread spectrum sequence, and sends the PPDU; correspondingly, the receiving end receives the PPDU, and then processes the PPDU based on the mapping relation; wherein the minimum Hamming distance is greater than or equal to L / 2. By increasing the minimum Hamming distance, the bit error rate is effectively reduced.

Description

[0001] This application is a divisional application. The application number of the original application is 202210688053.1, the original application date is June 17, 2022, and the entire content of the original application is incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technologies, and in particular, to a communication method and apparatus based on a physical layer (PHY) protocol data unit (PPDU). Background Art

[0003] Ultra-wideband technology (UWB) is a wireless carrier communication technology that uses nanosecond-level non-sinusoidal narrow pulses to transmit data, so the occupied spectrum range is very wide. Due to its very narrow pulses and extremely low radiation spectral density, UWB systems have advantages such as strong multipath resolution ability, low power consumption, and strong confidentiality.

[0004] As UWB technology enters the civilian field, ultra-wideband wireless communication has become one of the popular physical layer technologies for short-distance and high-speed wireless networks. Generally, the narrowband signal used to assist UWB needs to map fixed-length information bits onto data symbols, and then map the data symbols onto spreading sequences of a certain length, so as to achieve the purpose of expanding the bandwidth of the signal.

[0005] However, the performance of the above mapping relationship between data symbols and spreading sequences still needs to be improved. Summary of the Invention

[0006] This application provides a communication method and apparatus based on PPDU, which can effectively increase the minimum Hamming distance among different spreading sequences, thereby effectively reducing the bit error rate at the receiving end.

[0007] In a first aspect, an embodiment of this application provides a communication method based on a physical layer protocol data unit PPDU. The method is applied to a sending end, and the method includes: generating a PPDU based on a mapping relationship between data symbols and spreading sequences, where the length of each spreading sequence is L, and the minimum Hamming distance is greater than or equal to L / 2, L is a positive integer, the bit length corresponding to the data symbol is less than the bit length of the spreading sequence, and the minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences; sending the PPDU.

[0008] In combination with the first aspect, in a possible implementation manner, generating a PPDU based on the mapping relationship between data symbols and spreading sequences includes: generating modulation symbols of the PPDU based on the mapping relationship between data symbols and spreading sequences; and transmitting the PPDU includes: transmitting the modulation symbols of the PPDU.

[0009] In a second aspect, an embodiment of the present application provides a communication method for a physical layer protocol data unit (PPDU). The method is applied to a receiving end and includes: receiving a PPDU; processing the PPDU based on the mapping relationship between data symbols and spreading sequences. The length of each spreading sequence is L, and the minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer, the bit length corresponding to the data symbol is less than the bit length of the spreading sequence, and the minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences.

[0010] In combination with the second aspect, in a possible implementation manner, processing the PPDU based on the mapping relationship between data symbols and spreading sequences includes: obtaining a first sequence in the PPDU, where the length of the first sequence is L; determining a first spreading sequence corresponding to the first sequence according to N spreading sequences included in the mapping relationship between data symbols and spreading sequences, where the first spreading sequence is one of the N spreading sequences and N is a positive integer; determining a data symbol corresponding to the first spreading sequence based on the mapping relationship between data symbols and spreading sequences; and determining information bits corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence.

[0011] In an embodiment of the present application, by increasing the minimum Hamming distance in the mapping relationship, the probability of misjudging data symbols at the receiving end can be effectively reduced, thereby reducing the probability of misjudging information bits at the receiving end, effectively ensuring the reliability of communication between the two communication parties, and thus improving the system performance.

[0012] In combination with the first aspect or the second aspect, in a possible implementation manner, L = 32, or L = 16, or L = 8.

[0013] In combination with the first aspect or the second aspect, in a possible implementation manner, the spreading sequence is obtained based on at least one of the following:

[0014] [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1];

[0015] [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1];

[0016] [1 -1-1 1 -1-1 -1-1] and [1 1 1 -1 1 -1-1 -1].

[0017] Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is obtained based on at least two of the following:

[0018] [1 1-1 1-1 1-1-1]

[0019] [1 1-1 1 1-1-1-1].

[0020] [1 1 1-1 1-1-1-1]

[0021] In the embodiments of the present application, while ensuring the autocorrelation characteristics between different spreading sequences, the minimum Hamming distance can be effectively increased, the bit error rate at the receiving end can be reduced, and the system performance can be improved.

[0022] Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the spreading sequence.

[0023] In the embodiments of the present application, while ensuring the autocorrelation characteristics between different spreading sequences, the Hamming distance between the spreading sequences corresponding to different data symbols is 16, which can effectively improve the system performance.

[0024] Combined with the first aspect or the second aspect, in a possible implementation, at least two columns of elements in the matrix composed of the spreading sequences are the same.

[0025] In the embodiments of the present application, at least two chip values at fixed positions of each data symbol are fixed. Since at least two chip values at fixed positions of each data symbol can be fixed, these fixed chip values can be used as pilots, so that the receiving end can use these fixed chip values for frequency offset estimation and compensation, improving the frequency offset resistance ability of the system.

[0026] Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is obtained based on the following two sequences: [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1];

[0028] [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1].

[0029] In the embodiments of the present application, while ensuring the autocorrelation characteristics between different spreading sequences, the Hamming distances between different spreading sequences can include 16, 17, and 20. Thus, the case where the Hamming distance between different spreading sequences is equal to 16 is the least, which can further reduce the bit error rate at the receiving end.

[0030] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0031]

[0032]

[0033] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0034]

[0035] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0036]

[0037]

[0038] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0039]

[0040] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0041]

[0042] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0043]

[0044]

[0045] Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0046] Data symbol Spreading sequence 0 1 1 0 1 1 0 0 0 1 1 0 0 0 0 0 1 0 2 1 0 1 1 1 1 1 0 3 1 1 1 0 0 1 0 0 4 1 0 1 1 0 0 0 1 5 1 1 1 0 1 0 1 1 6 1 1 0 1 0 1 1 1 7 1 0 0 0 1 1 0 1 8 1 1 0 1 1 0 0 0 9 1 0 0 0 0 0 1 0 10 1 0 1 1 1 1 1 0 11 1 1 1 0 0 1 0 0 12 1 0 1 1 0 0 0 1 13 1 1 1 0 1 0 1 1 14 1 1 0 1 0 1 1 1 15 1 0 0 0 1 1 0 1

[0047] In a third aspect, embodiments of the present application provide a communication device for performing the method in the first aspect or any possible implementation manner of the first aspect. The communication device includes units for performing the method in the first aspect or any possible implementation manner of the first aspect. Exemplarily, the communication device includes a processing unit and a transceiver unit.

[0048] The processing unit is configured to generate a PPDU based on the mapping relationship between data symbols and spreading sequences. The length of each spreading sequence is L, and the minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer. The bit length corresponding to the data symbol is less than the bit length of the spreading sequence. The minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences; the transceiver unit is configured to transmit the PPDU.

[0049] In a possible implementation manner, the processing unit is specifically configured to generate modulation symbols of the PPDU based on the mapping relationship between data symbols and spreading sequences.

[0050] In a fourth aspect, embodiments of the present application provide a communication device for performing the method in the second aspect or any possible implementation manner of the second aspect. The communication device includes units for performing the method in the second aspect or any possible implementation manner of the second aspect. Exemplarily, the communication device includes a processing unit and a transceiver unit.

[0051] The transceiver unit is configured to receive a PPDU; the processing unit is configured to process the PPDU based on the mapping relationship between data symbols and spreading sequences. The length of each spreading sequence is L, and the minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer. The bit length corresponding to the data symbol is less than the bit length of the spreading sequence. The minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences.

[0052] In a possible implementation manner, the processing unit is specifically configured to obtain a first sequence in the PPDU, where the length of the first sequence is L; determine a first spreading sequence corresponding to the first sequence according to N spreading sequences included in the mapping relationship between the data symbols and the spreading sequences, where the first spreading sequence is one of the N spreading sequences, and N is a positive integer; determine data symbols corresponding to the first spreading sequence based on the mapping relationship between the data symbols and the spreading sequences; and determine information bits corresponding to the first spreading sequence based on the data symbols corresponding to the first spreading sequence.

[0053] Combined with the third aspect or the fourth aspect, in a possible implementation manner, L = 32, or L = 16, or L = 8.

[0054] Combined with the third aspect or the fourth aspect, in a possible implementation, the spreading sequence is obtained based on at least one of the following:

[0055] [1 1 -1-1 -1-1 -1-1] and [1 1 -1 1 -1 1 -1-1];

[0056] [1 -1 1 -1-1 -1-1 -1] and [1 1 -1 1 1 -1-1 -1];

[0057] [1 -1-1 1 -1-1 -1-1] and [1 1 1 -1 1 -1-1 -1].

[0058] Combined with the third aspect or the fourth aspect, in a possible implementation, the spreading sequence is obtained based on at least two of the following:

[0059] [1 1-1 1-1 1-1-1]

[0060] [1 1-1 1 1-1-1-1].

[0061] [1 1 1-1 1-1-1-1]

[0062] Combined with the third aspect or the fourth aspect, in a possible implementation, the spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the spreading sequence.

[0063] Combined with the third aspect or the fourth aspect, in a possible implementation, at least two columns of the matrix formed by the spreading sequence have the same elements.

[0064] Combined with the third aspect or the fourth aspect, in a possible implementation, the spreading sequence is obtained based on the following two sequences: [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1];

[0066] [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1].

[0067] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0068] Data symbol Spreading sequence 0 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 2 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 3 0 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 4 0 1 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 1 1 0 1 5 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 0 0 6 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 7 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 8 1 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 9 1 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 10 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 11 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 12 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 13 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 0 0 0 1 14 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 0 0 0 0 1 15 0 0 0 1 0 0 0 1 1 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 0

[0069] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0070]

[0071]

[0072] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0073]

[0074] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0075]

[0076]

[0077] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0078]

[0079] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0080] Data symbol Spreading sequence 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 2 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 3 0 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 4 1 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 5 1 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 6 0 1 1 0 1 1 0 0 0 1 0 0 1 0 1 1 7 1 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 8 1 1 1 0 0 0 1 1 1 0 0 1 0 0 0 1 9 0 1 1 1 1 0 0 0 1 1 1 0 0 1 0 0 10 0 0 0 1 1 1 1 0 0 0 1 1 1 0 0 1 11 0 1 0 0 0 1 1 1 1 0 0 0 1 1 1 0 12 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 1 13 1 1 1 0 0 1 0 0 0 1 1 1 1 0 0 0 14 0 0 1 1 1 0 0 1 0 0 0 1 1 1 1 0 15 1 0 0 0 1 1 1 0 0 1 0 0 0 1 1 1

[0081] Combined with the third aspect or the fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the spreading sequence is as follows:

[0082] Data symbol Spreading sequence 0 1 1 0 1 1 0 0 0 1 1 0 0 0 0 0 1 0 2 1 0 1 1 1 1 1 0 3 1 1 1 0 0 1 0 0 4 1 0 1 1 0 0 0 1 5 1 1 1 0 1 0 1 1 6 1 1 0 1 0 1 1 1 7 1 0 0 0 1 1 0 1 8 1 1 0 1 1 0 0 0 9 1 0 0 0 0 0 1 0 10 1 0 1 1 1 1 1 0 11 1 1 1 0 0 1 0 0 12 1 0 1 1 0 0 0 1 13 1 1 1 0 1 0 1 1 14 1 1 0 1 0 1 1 1 15 1 0 0 0 1 1 0 1

[0083] In a fifth aspect, an embodiment of the present application provides a communication device, which includes a processor for executing the method shown in the first aspect or any possible implementation of the first aspect. Alternatively, the processor is used to execute a program stored in a memory, and when the program is executed, the method shown in the first aspect or any possible implementation of the first aspect is executed.

[0084] In a possible implementation, the memory is located outside the communication device.

[0085] In a possible implementation, the memory is located inside the communication device.

[0086] In the embodiments of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together.

[0087] In a possible implementation, the communication device further includes a transceiver, which is used to receive signals and / or send signals. Exemplarily, the transceiver can be used to send PPDUs, etc.

[0088] In a sixth aspect, the embodiments of the present application provide a communication device, which includes a processor for executing the method shown in the second aspect or any possible implementation of the second aspect. Alternatively, the processor is used to execute a program stored in the memory, and when the program is executed, the method shown in the second aspect or any possible implementation of the second aspect is executed.

[0089] In a possible implementation, the memory is located outside the communication device.

[0090] In a possible implementation, the memory is located inside the communication device.

[0091] In the embodiments of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together.

[0092] In a possible implementation, the communication device further includes a transceiver, which is used to receive signals and / or send signals. Exemplarily, the transceiver can be used to receive PPDUs, etc.

[0093] In a seventh aspect, the embodiments of the present application provide a chip, where the communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface; the logic circuit is used to generate a PPDU based on the mapping relationship between data symbols and spreading sequences; the interface is used to output the PPDU.

[0094] In an eighth aspect, the embodiments of the present application provide a chip, where the communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface; the interface is used to input a PPDU; the logic circuit is used to process the PPDU based on the mapping relationship between data symbols and spreading sequences.

[0095] In a ninth aspect, the embodiments of the present application provide a computer-readable storage medium, which is used to store a computer program. When it runs on a computer, the method shown in the first aspect or any possible implementation of the first aspect is executed.

[0096] In a tenth aspect, an embodiment of the present application provides a computer-readable storage medium for storing a computer program, which when running on a computer, causes the method shown in the second aspect or any possible implementation manner of the second aspect to be executed.

[0097] In an eleventh aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code (which can also be referred to as an instruction), and when running on a computer, causes the method shown in the first aspect or any possible implementation manner of the first aspect to be executed.

[0098] In a twelfth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code (which can also be referred to as an instruction), and when running on a computer, causes the method shown in the second aspect or any possible implementation manner of the second aspect to be executed.

[0099] In a thirteenth aspect, an embodiment of the present application provides a computer program, which when running on a computer, causes the method shown in the first aspect or any possible implementation manner of the first aspect to be executed.

[0100] In a fourteenth aspect, an embodiment of the present application provides a computer program, which when running on a computer, causes the method shown in the second aspect or any possible implementation manner of the second aspect to be executed.

[0101] In a fifteenth aspect, an embodiment of the present application provides a wireless communication system, which includes a sending end and a receiving end. The sending end is used to execute the method shown in the first aspect or any possible implementation manner of the first aspect, and the receiving end is used to execute the method shown in the second aspect or any possible implementation manner of the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0102] Figure 1 is a schematic diagram of the architecture of a communication system provided by an embodiment of the present application;

[0103] Figure 2 is a schematic diagram of the architecture of a communication system provided by an embodiment of the present application;

[0104] Figure 3 is a schematic flowchart of a communication method based on PPDU provided by an embodiment of the present application;

[0105] Figure 4a is a schematic diagram of the structure of a PPDU provided by an embodiment of the present application;

[0106] Figure 4bIt is a schematic diagram of an O-QPSK modulation and spreading process provided by an embodiment of the present application;

[0107] Figure 4c It is a schematic diagram of an O-QPSK modulation and spreading process provided by an embodiment of the present application;

[0108] Figure 5a It is a schematic diagram of the mapping relationship between data symbols and spreading sequences;

[0109] Figure 5b It is Figure 5a the Hamming distance between different spreading sequences in the shown mapping relationship;

[0110] Figure 6 It is a schematic diagram of the structure of a communication device provided by an embodiment of the present application;

[0111] Figure 7 It is a schematic diagram of the structure of a communication device provided by an embodiment of the present application;

[0112] Figure 8 It is a schematic diagram of the structure of a chip provided by an embodiment of the present application. Detailed implementation manners

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

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

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

[0116] In this application, "at least one (item)" means one or more, "a plurality" means two or more, "at least two (items)" means two, three or more, and "and / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist at the same time. Here, A and B can be singular or plural. "Or" means that there can be two relationships, such as only A exists, only B exists; when A and B are not mutually exclusive, it can also mean three relationships, such as only A exists, only B exists, and both A and B exist at the same time. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) below" or a similar expression means any combination of these items. For example, at least one (item) of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0117] The technical solutions provided in the embodiments of this application can be applied to a wireless personal area network (WPAN) based on UWB technology. For example, the methods provided in the embodiments of this application can be applied to the Institute of Electrical and Electronics Engineers (IEEE) 802.15 series of protocols, such as the 802.15.4a protocol, the 802.15.4z protocol, or the 802.15.4ab protocol, or a future generation of UWB WPAN standards, etc., which are not listed one by one here. The technical solutions provided in the embodiments of this application can also be applied to various communication systems. For example, it can be an Internet of Things (IoT) system, a vehicle-to-everything (V2X) system, a narrow-band Internet of Things (NB-IoT) system, devices applied in the vehicle-to-everything network, IoT nodes, sensors, etc. in the Internet of Things (IoT), smart cameras, smart remote controls, smart water meters and electricity meters in smart homes, and sensors in smart cities. The technical solutions provided in the embodiments of this application can also be applied to an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD), a Universal Mobile Telecommunications System (UMTS), a Worldwide Interoperability for Microwave Access (WiMAX) communication system, a Long Term Evolution (LTE) system, or a fifth-generation (5G) communication system, a sixth-generation (6G) communication system, etc.

[0118] Ultra-wideband (UWB) technology is a new type of wireless communication technology. It transmits data using nanosecond-level non-sinusoidal narrow pulses. By modulating impulse pulses with very steep rise and fall times, the spectrum range it occupies is very wide, enabling the signal to have a bandwidth on the order of gigahertz (GHz). The bandwidth used by UWB is usually above 1 GHz. Since the UWB system does not need to generate a sinusoidal carrier signal and can directly transmit impulse sequences, the UWB system has a very wide spectrum and low average power. The UWB wireless communication system has advantages such as strong multipath resolution ability, low power consumption, and strong confidentiality, which is conducive to coexisting with other systems, thereby improving spectrum utilization and system capacity. Additionally, in short-distance communication applications, the transmit power of the UWB transmitter can usually be made lower than 1 mW (milliwatt). Theoretically, the interference generated by the UWB signal is only equivalent to a broadband white noise. This helps for good coexistence between ultra-wideband and existing narrowband communications. Therefore, the UWB system can operate simultaneously with a narrowband (NB) communication system without interference. The method provided in the embodiments of this application can be implemented by a communication device in a wireless communication system. In a communication device, what realizes the UWB system function can be referred to as a UWB module, and what realizes the narrowband communication system function can be referred to as a narrowband communication module. The UWB module and the narrowband communication module can be different devices or chips, etc., and the embodiments of this application do not limit this. Of course, the UWB module and the narrowband communication module can also be integrated on one device or chip. The embodiments of this application do not limit the implementation manner of the UWB module and the narrowband communication module in the communication device. Exemplarily, the method provided in the embodiments of this application can be implemented by the narrowband communication module. Optionally, a part of the method provided in the embodiments of this application can be implemented by the narrowband communication module, and another part can be implemented by the UWB module. Exemplarily, after obtaining the modulation symbol based on the mapping relationship provided in the embodiments of this application, the modulation symbol can be sent through UWB pulses, such as can be implemented by the UWB module. Exemplarily, when mapping the information bits of the PPDU to the spreading sequence based on the mapping relationship provided in the embodiments of this application, modulation methods such as BPSK modulation or QPSK modulation can be used, and then it is sent through UWB pulses. The embodiments of this application do not limit the processing methods other than the mapping relationship.

[0119] Although the embodiments of this application mainly take WPAN as an example, especially the network applying to the IEEE 802.15 series of standards. It is easy for those skilled in the art to understand that all aspects involved in the embodiments of this application can be extended to other networks adopting various standards or protocols. For example, Wireless Local Area Networks (WLAN), BLUETOOTH, High Performance Radio LAN (HIPERLAN) (a wireless standard similar to the IEEE802.11 standard, mainly used in Europe), and Wide Area Network (WAN) or other networks known now or developed in the future. Therefore, regardless of the coverage range and wireless access protocol used, all aspects provided by the embodiments of this application can be applied to any suitable wireless network.

[0120] The method provided by the embodiments of this application can be implemented by a communication device in a wireless communication system. This communication device can be a device involved in a UWB system. For example, this communication device can include but is not limited to a communication server, a router, a switch, a bridge, a computer, a mobile phone, etc. For another example, this communication device can include a user equipment (UE), and this user equipment can include various handheld devices with wireless communication functions, vehicle-mounted devices (such as cars or components installed on cars, etc.), wearable devices, Internet of Things (IoT) devices, computing devices or other processing devices connected to a wireless modem, etc., which will not be listed one by one here. For another example, this communication device can include a central control point, such as a personal area network (PAN) or a PAN coordinator, etc. This PAN coordinator or PAN can be a mobile phone, a vehicle-mounted device, a tag or a smart home, etc. For another example, this communication device can include a chip, and this chip can be set in a communication server, a router, a switch or a terminal device, etc., which will not be listed one by one here. It can be understood that the above description of the communication device also applies to the first communication device and the second communication device shown below.

[0121] As an example, Figure 1 and Figure 2 is a schematic diagram of the architecture of a communication system provided by the embodiments of this application. Figure 1 is a star topology structure provided by the embodiments of this application, Figure 2 is a point-to-point topology structure provided by the embodiments of this application. As Figure 1 shown, in the star topology, a central control node can communicate with one or more other devices. As Figure 2 shown, in the point-to-point topology structure, different devices can communicate with each other.Figure 1 and Figure 2 In Figure 2 , both the full function device and the reduced function device can be understood as the communication device shown in the embodiments of the present application. Among them, the full function device and the reduced function device are relative. For example, the reduced function device may not be a PAN coordinator. Another example is that compared with the full function device, the reduced function device may have no coordination ability or a relatively lower communication rate than the full function device. It can be understood that Figure 2 the PAN coordinator shown in Figure 2 is only an example, Figure 2 and the other three full function devices shown in Figure 2 can also be used as the PAN coordinator, which are not shown one by one here.

[0122] As an example, in the embodiments of the present application, the sending end involved can be a full function device, and the receiving end can be a reduced function device; or, the sending end can be a reduced function device, and the receiving end can be a full function device; or, both the sending end and the receiving end can be full function devices; or, both the sending end and the receiving end can be reduced function devices. As another example, the sending end can be a coordinator, and the receiving end can be a non-coordinator; or, the sending end can be a non-coordinator, and the receiving end can be a coordinator; or, both the sending end and the receiving end can be coordinators, etc., which are not listed one by one here.

[0123] It can be understood that the full function device and the reduced function device shown in the embodiments of the present application are only one example of the communication device. As long as the communication device can implement the PPDU-based communication method provided in the embodiments of the present application, it belongs to the protection scope of the embodiments of the present application.

[0124] Generally, the narrowband signal used to assist UWB can be sent by using the offset quadrature phase shift keying (O-QPSK) modulation method. To enhance the system robustness, before O-QPSK modulation, it is necessary to map 4 encoded (or unencoded) information bits to the spreading sequence. Thus, the receiving end uses the spread sequence to judge the sent information bits. Generally, when 4 information bits are mapped to a spreading sequence of a certain length, the minimum Hamming distance among the Hamming distances between any two spreading sequences is less than L / 2, where L is the bit length of the spreading sequence. However, the above minimum Hamming distance can be further improved.

[0125] In view of this, embodiments of the present application provide a communication method and apparatus based on PPDU, which can effectively increase the minimum Hamming distance between spreading sequences. As an example, after receiving a PPDU, a receiving end may compare a sequence in the PPDU with a spreading sequence in a mapping relationship, and then determine a data symbol corresponding to the sequence according to the similarity. Generally speaking, if the Hamming distance between any two spreading sequences is relatively large, it means that more bits are allowed to be in error. Therefore, by increasing the minimum Hamming distance between spreading sequences, the probability of error when the receiving end identifies a sequence is lower, thereby effectively improving the accuracy of the receiving end in identifying a sequence and improving system performance. Optionally, in the method provided by embodiments of the present application, at least two chip values at fixed positions of each data symbol may be fixed. Since at least two chip values at fixed positions of each data symbol may be fixed, the fixed chip values may be used as pilots (pilots are generally known signals), so that the receiving end can use the fixed chip values for frequency offset estimation and compensation, improving the system's frequency offset resistance ability.

[0126] It should be noted that the minimum Hamming distance shown in embodiments of the present application can be understood as the minimum Hamming distance among the Hamming distances of any two spreading sequences involved in the mapping relationship between data symbols and spreading sequences. The description of the Hamming distance can be as follows: In information theory, the Hamming distance between two sequences of equal length is the number of different values at corresponding positions of the two sequences. In other words, it is the number of sequence values that need to be replaced to transform one sequence into another sequence. For example: the Hamming distance between 1011101 and 1001001 is 2.

[0127] The descriptions of the sending end and the receiving end involved in embodiments of the present application can refer to the above descriptions of Figure 1 and Figure 2 . The sending end can be understood as a communication device that sends a PPDU, and the receiving end can be understood as a communication device that receives a PPDU. As for whether there are other forwarding devices between the sending end and the receiving end, embodiments of the present application do not make any limitations in this regard. Similarly, embodiments of the present application do not make any limitations on the functions or roles of the PPDU.

[0128] Figure 3 is a schematic flowchart of a communication method based on PPDU provided by embodiments of the present application. As shown in Figure 3 , the method includes:

[0129] 301. The sending end generates a PPDU based on the mapping relationship between data symbols and spreading sequences.

[0130] As an example, the minimum Hamming distance is greater than or equal to L / 2, where L represents the bit length of the spreading sequence, and L is a positive integer.

[0131] As another example, the minimum Hamming distance is greater than or equal to floor{L / 2}, where floor represents rounding down.

[0132] Exemplarily, embodiments of the present application may also use N to represent the number of different data symbols in the mapping relationship between data symbols and spreading sequences. The value of N is related to the first length shown below. For example, if the first length is 4 bits, then N = 16. Another example, if the first length is 3 bits, then N = 8. Of course, the relationship between the first length and N shown here is only an example and should not be construed as a limitation on the embodiments of the present application. For ease of description, the following will take the first length of 4 bits as an example, but it should not be construed as a limitation on the embodiments of the present application.

[0133] For example, if L = 32, then the minimum Hamming distance is greater than or equal to 16. Another example, if L = 16, then the minimum Hamming distance is greater than or equal to 8. Another example, if L = 8, then the minimum Hamming distance is greater than or equal to 4. It can be understood that the values of L shown here are only examples, and in specific implementations, spreading sequences of other lengths may also be involved (for example, L can be even or odd), and the embodiments of the present application do not limit this.

[0134] Spreading is a communication technology that scatters the spectrum of a transmitted signal to a bandwidth wider than its original bandwidth. Through spreading, the original bandwidth of the PPDU can be effectively extended, and the spectrum of the PPDU can be broadened. The spreading shown in the embodiments of the present application can be understood as mapping information bits of a first length to a sequence of a second length (or mapping data symbols to a sequence of a second length, where the data symbols are obtained from the information bits of the first length), and under the same length measurement standard, the first length is greater than the second length. Since information bits of a certain length are mapped to a longer sequence, the effect of extending the original bandwidth of the PPDU is achieved. Therefore, the sequence of the second length shown in the embodiments of the present application can also be called a spreading sequence. Of course, the sequence of the second length may also have other names, such as a pseudo-random sequence, a sequence of length L, a sequence including L chips, or chip values, etc., and the embodiments of the present application do not limit this. It can be understood that the second length shown above is equal to L shown in the embodiments of the present application.

[0135] It should be noted that the mapping relationship between data symbols and spreading sequences shown in the embodiments of the present application is only an example. In specific implementations, the sending end may also generate a PPDU based on the mapping relationship between information bits and spreading sequences. The following details the generation process of the PPDU.

[0136] Figure 4a is a schematic structural diagram of a PPDU provided by an embodiment of the present application. As Figure 4aAs shown, the PPDU may include at least the following: preamble, start-of-frame delimiter (SFD), physical layer header (PHR), and payload. It can be understood that Figure 4a The content and order of the PPDU shown are only examples and should not be construed as limiting the embodiments of the present application. In specific implementations, the PPDU may also have other structures, and the embodiments of the present application do not limit this.

[0137] Figure 4b is a schematic diagram of an O-QPSK modulation and spreading process provided by an embodiment of the present application. As Figure 4b shown, the information bits of the PPDU (which can also be referred to as data bits, such as binary data; or binary bit stream, etc.) are mapped from information bits to data symbols (bit-to-symbol), and then, after being mapped from data symbols to spreading sequences (symbol-to-chip) (which can also be referred to as being spread), they are modulated by O-QPSK to output modulated symbols (modulated signal). That is to say, after obtaining the information bits based on the structure of the PPDU at the transmitting end, the information bits can be mapped to data symbols, for example, every 4 bits are mapped to one data symbol; then, based on the mapping relationship between the data symbols and the spreading sequences, each data symbol is mapped to a different spreading sequence; finally, O-QPSK modulation is performed to obtain the modulated symbols. Thus, the transmitting end can transmit the modulated symbols as Figure 4b shown.

[0138] Figure 4c is a schematic diagram of an O-QPSK modulation and spreading process provided by an embodiment of the present application. As Figure 4c shown, the information bits of the PPDU are mapped from information bits to spreading sequences, and then modulated by O-QPSK to output modulated symbols (modulated signal). That is to say, after obtaining the information bits based on the internal structure of the PPDU at the transmitting end, based on the mapping relationship between the information bits and the spreading sequences, every 4 information bits can be mapped to different spreading sequences, thereby performing O-QPSK modulation and transmitting the modulated symbols as Figure 4c shown.

[0139] Figure 4b and Figure 4c shown in the flowchart, the chip values obtained based on the mapping relationship between the data symbols and the spreading sequences or the mapping relationship between the information bits and the spreading sequences can ensure that the signals formed after O-QPSK modulation are orthogonal to each other, thereby supporting non-coherent demodulation at the receiving end with low complexity.

[0140] It should be noted that Figure 4b The data symbols shown are different from the orthogonal frequency division multiplexing (OFDM) symbols in a wireless communication network. The data symbols shown in the embodiments of the present application can be understood as the numerical values when the information bits of the first length are mapped to decimal. For example, if the first length is 4 bits, the data symbol can be represented as a numerical value between 0 and 15. Generally, the mapping between the data symbol and the spreading sequence can be understood as mapping the data symbol corresponding to every 4 bits (such as decimal) to a spreading sequence containing L chips. Of course, the relationship between the information bits of the first length and the data symbol shown in the embodiments of the present application is only an example. For example, the data symbol can also be the numerical value when the information bits of the first length are mapped to hexadecimal, or the numerical value when mapped to octal, etc. The embodiments of the present application do not limit this.

[0141] It can be understood that based on the mapping relationship between the data symbol provided in the embodiments of the present application and the spreading sequence (or the mapping relationship between the information bits and the spreading sequence), the chip values of the spreading sequence can also adopt other modulation methods, such as binary phase shift keying (BPSK) and QPSK. Optionally, the modulation symbol can be directly sent, or the modulation symbol can be carried by a group of UWB pulses to be transmitted on the UWB channel. The group of UWB pulses shown here can be sent continuously or in segments. The embodiments of the present application do not limit this. Further, a guard interval can be reserved between each segment and between different modulation symbols, that is, no signal can be sent within this guard interval, so as to effectively avoid the interference between modulation symbols caused by multipath.

[0142] Based on Figures 4a to 4c this, the generation of the PPDU shown in the embodiments of the present application can also be understood as: the sending end obtains the information bits of the PPDU, and then processes them based on the mapping relationship between the data symbol and the spreading sequence and the information bits of the PPDU to obtain the modulation symbol. The processing shown here can include at least one of the following: the mapping processing from the information bits to the data symbol, the mapping processing from the data symbol to the spreading sequence, and the modulation processing. Exemplarily, the generation of the PPDU shown in step 301 can include generating the modulation symbol of the PPDU.

[0143] The following examples illustrate the mapping relationships involved in the embodiments of the present application. It can be understood that the mapping relationships shown below are only examples

[0144] As a possible implementation, the mapping relationship includes mapping every four information bits to a spread spectrum sequence with a length of 32 bits. As another possible implementation, the mapping relationship includes mapping every four information bits to a spread spectrum sequence with a length of 16 bits. As yet another possible implementation, the mapping relationship includes mapping every four information bits to a spread spectrum sequence with a length of 8 bits. Of course, in a specific implementation, other mapping relationships may also be included, and the embodiments of the present application are not limited to this. For a specific description of the mapping relationship, please refer to the following. The following only illustrates several mapping relationships by way of example.

[0145] It will be appreciated that the mapping relationship between data symbols and spreading sequences is merely illustrative. For the mapping relationship between information bits and spreading sequences, the mapping relationship between data symbols and spreading sequences shown below can be adaptively referenced. The embodiments of the present application do not limit the mapping relationships between data symbols and spreading sequences shown in Tables 1, 3, 5, 6, 7, 9, and 10 below. In other words, the embodiments of the present application do not limit which data symbol is mapped to a particular spreading sequence. The various mapping relationships shown below are merely examples.

[0146] As an example, Table 1 shows a mapping relationship provided in an embodiment of the present application. Those skilled in the art may adapt the mapping relationship shown in Table 1 to a mapping relationship between information bits and spreading sequences. The embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or data symbols to spreading sequences.

[0147] Table 1

[0148]

[0149] If the spreading sequences shown in Table 1 are recorded as The Hamming distance between any two spreading sequences is shown in Table 2.

[0150] Table 2

[0151]

[0152]

[0153] As can be seen from Table 2, the minimum Hamming distance in the embodiment of the present application is 16. Furthermore, the Hamming distances between different spreading sequences are distributed between 16 and 18, thereby preventing the Hamming distance between any two different spreading sequences from being too large or too small, thereby affecting the Hamming distances between other spreading sequences.

[0154] As another example, Table 3 shows a mapping relationship provided by an embodiment of the present application. Those skilled in the art can appropriately modify the mapping relationship shown in Table 3 into a mapping relationship between information bits and spreading sequences. The embodiments of the present application do not limit whether the information bits are mapped to the spreading sequences or the data symbols are mapped to the spreading sequences at the transmitting end.

[0155] Table 3

[0156] Data symbol <![CDATA[Spreading sequence (Chip values (c0c1... c 30 c 31 ))]]> 0 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 2 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 3 1 0 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 0 0 0 0 4 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 5 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 6 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 7 1 0 1 1 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 0 1 1 0 0 1 0 1 1 1 1 1 8 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 9 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 10 0 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 11 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 12 0 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 1 0 0 0 13 1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 0 1 1 0 14 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 1 1 0 15 1 1 1 0 0 1 1 0 1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 0 0 0 0 1 0 1 0

[0157] If the spreading sequences shown in Table 3 are sequentially denoted as then the Hamming distances between the spreading sequences are shown in Table 4.

[0158] Table 4

[0159]

[0160]

[0161] It can be seen from Table 4 that the minimum Hamming distance in the embodiments of the present application is 16. Further, the Hamming distances between different spreading sequences are distributed between 16 and 18, thereby avoiding the situation that the Hamming distances between any two different spreading sequences are too large or too small, which may affect the Hamming distances between other spreading sequences.

[0162] As yet another example, Table 5 shows a mapping relationship provided by an embodiment of the present application. Those skilled in the art can appropriately modify the mapping relationship shown in Table 5 into a mapping relationship between information bits and spreading sequences. The embodiments of the present application do not limit whether the information bits are mapped to the spreading sequences or the data symbols are mapped to the spreading sequences at the transmitting end. It can be understood that the minimum Hamming distance in Table 5 is 16, or it can also be understood that the Hamming distances between the spreading sequences are all 16.

[0163] Table 5

[0164]

[0165] As yet another example, Table 6 shows a mapping relationship provided by an embodiment of the present application. Those skilled in the art can appropriately modify the mapping relationship shown in Table 6 into a mapping relationship between information bits and spreading sequences. The embodiments of the present application do not limit whether the information bits are mapped to the spreading sequences or the data symbols are mapped to the spreading sequences at the transmitting end. It can be understood that the minimum Hamming distance in Table 6 is 16, or it can also be understood that the Hamming distances between the spreading sequences are all 16.

[0166] Table 6

[0167]

[0168]

[0169] As another example, Table 7 shows a mapping relationship provided by an embodiment of the present application. Those skilled in the art can appropriately modify the mapping relationship shown in Table 7 into a mapping relationship between information bits and spreading sequences. The embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or maps data symbols to spreading sequences.

[0170] Table 7

[0171]

[0172] If the spreading sequences shown in Table 7 are sequentially denoted as M1, M2, ……, M16, the Hamming distances between the spreading sequences are shown in Table 8.

[0173] Table 8

[0174]

[0175]

[0176] As can be seen from Table 8, the minimum Hamming distance in the embodiment of the present application is 16. Further, the Hamming distances between different spreading sequences are distributed between 16 and 20, thereby avoiding the situation that the Hamming distance between any two different spreading sequences is too large or too small, which may affect the Hamming distances between other spreading sequences.

[0177] As another example, Table 9 shows a mapping relationship provided by an embodiment of the present application. Table 9 shows the mapping relationship when, with L = 16, data symbols of every 4 information bits are mapped to a spreading sequence of length 16 (or a sequence including 16 chips). Those skilled in the art can appropriately modify the mapping relationship shown in Table 9 into a mapping relationship between information bits and spreading sequences. The embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or maps data symbols to spreading sequences.

[0178] Table 9

[0179] Data symbol <![CDATA[Spreading sequence (Chip values (c0c1...c 14 c 15 ))]]> 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 0 1 2 0 1 0 0 1 0 1 1 0 1 1 0 1 1 0 0 3 0 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 4 1 1 0 0 0 1 0 0 1 0 1 1 0 1 1 0 5 1 0 1 1 0 0 0 1 0 0 1 0 1 1 0 1 6 0 1 1 0 1 1 0 0 0 1 0 0 1 0 1 1 7 1 1 0 1 1 0 1 1 0 0 0 1 0 0 1 0 8 1 1 1 0 0 0 1 1 1 0 0 1 0 0 0 1 9 0 1 1 1 1 0 0 0 1 1 1 0 0 1 0 0 10 0 0 0 1 1 1 1 0 0 0 1 1 1 0 0 1 11 0 1 0 0 0 1 1 1 1 0 0 0 1 1 1 0 12 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 1 13 1 1 1 0 0 1 0 0 0 1 1 1 1 0 0 0 14 0 0 1 1 1 0 0 1 0 0 0 1 1 1 1 0 15 1 0 0 0 1 1 1 0 0 1 0 0 0 1 1 1

[0180] As another example, Table 10 shows a mapping relationship provided by an embodiment of the present application. Those skilled in the art can appropriately modify the mapping relationship shown in Table 10 into a mapping relationship between information bits and spreading sequences. The embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or maps data symbols to spreading sequences.

[0181] Table 10

[0182]

[0183]

[0184] It can be understood that Tables 1 to 10 are only examples. For other mapping relationships or Hamming distances, reference can be made to the following text, which will not be elaborated here for the time being.

[0185] 302. The sending end sends a PPDU. Correspondingly, the receiving end receives the PPDU.

[0186] 303. The receiving end processes the PPDU based on the mapping relationship between data symbols and spreading sequences.

[0187] Exemplarily, the receiving end processing the PPDU includes: obtaining a first sequence in the PPDU, where the length of the first sequence is L; that is, the length of the first sequence obtained by the receiving end is the same as the length of the spreading sequence shown above. Then, determining the first spreading sequence corresponding to the first sequence according to the N spreading sequences included in the mapping relationship between data symbols and the spreading sequence (such as in Tables 1, 3, 5, 6, 7, 9, or 10), where the first spreading sequence is one of the N spreading sequences and N is a positive integer. And determining the data symbol corresponding to the first spreading sequence based on the mapping relationship between data symbols and the spreading sequence, and determining the information bits corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence. Of course, after the receiving end determines the first spreading sequence, it can also determine the information bits corresponding to the first spreading sequence based on the mapping relationship between information bits and spreading sequences (adaptively referring to Tables 1, 3, 5, 6, 7, 9, or 10). It can be understood that based on the following five implementation manners, there can be other mapping relationships for the mapping relationships shown in Tables 1, 3, 5, 6, 7, 9, or 10, which are not listed one by one in the embodiments of the present application, but the mapping relationships shown in Tables 1, 3, 5, 6, 7, 9, or 10 should not be understood as a limitation to the embodiments of the present application. It can be understood that the above-mentioned first sequence is only an example, and the processing of other sequences in the PPDU by the receiving end is the same as the processing method of the first sequence above, which will not be elaborated here one by one.

[0188] Exemplarily, the receiving end processing the PPDU may further include: the receiving end demodulating the sequence it receives. For example, if the sending end modulates through O-QPSK, the receiving end can demodulate based on O-QPSK. Another example is that if the sending end modulates through BPSK, the receiving end can demodulate based on BPSK. Another example is that if the sending end modulates through QPSK, the receiving end can demodulate based on QPSK. For other ways of the receiving end processing the PPDU, the embodiments of the present application do not make limitations.

[0189] In the embodiments of the present application, by increasing the minimum Hamming distance in the mapping relationship, the probability of misjudgment of data symbols at the receiving end can be effectively reduced, thereby reducing the probability of misjudgment of information bits at the receiving end, effectively ensuring the reliability of communication between both communication parties, and thus improving the system performance.

[0190] Relative to Figure 5a the mapping relationship shown, the minimum Hamming distance in the mapping relationship provided by the embodiments of the present application is greater than Figure 5a the minimum Hamming distance shown. Figure 5a The Hamming distances between different spreading sequences in the mapping relationship shown can be as Figure 5b shown, where the minimum Hamming distance is 12. Figure 5a In the mapping relationship shown, the Hamming distances between different spreading sequences are between 12 and 20. By sacrificing the Hamming distance to ensure the autocorrelation characteristics between different spreading sequences, the bit error rate at the receiving end is relatively high. However, the mapping relationship provided by the embodiments of the present application effectively increases the minimum Hamming distance on the basis of ensuring the autocorrelation characteristics between different spreading sequences, thereby effectively reducing the probability of misjudgment of information bits at the receiving end, reducing the bit error rate at the receiving end, ensuring the reliability of communication between both communication parties, and improving the system performance.

[0191] The following details the mapping relationship provided by the embodiments of the present application.

[0192] It should be noted that the design processes of the following spreading sequences are only examples. Optionally, each spreading sequence can be predefined by a standard or a preset sequence, etc. That is, the spreading sequences shown in the embodiments of the present application are not necessarily all implemented through the following steps (such as formulas (1) to (6), etc.). For example, the mapping relationship between the spreading sequence and the information bit, or the mapping relationship between the spreading sequence and the data symbol can refer to Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10, etc. Exemplarily, in practical applications, both communication parties can interact by saving the mapping relationship between the information bit and the spreading sequence or the mapping relationship between the data symbol and the spreading sequence. The following method for determining the spreading sequence may not exist, but instead, the method shown in Figure 3 is executed by saving the mapping relationship between the information bit and the spreading sequence or the mapping relationship between the data symbol and the spreading sequence. Thus, as long as a PPDU can be generated according to the mapping relationship between the information bit and the spreading sequence or the mapping relationship between the data symbol and the spreading sequence shown in the embodiments of the present application, and the minimum Hamming distance between the spreading sequences is greater than or equal to L / 2, it falls within the protection scope of the embodiments of the present application.

[0193] Implementation method 1:

[0194] Let be a sequence of length 8, and each element s in the sequencei = 1 / -1, and its periodic autocorrelation function is defined as:

[0195]

[0196] where the value of i ranges from 0 to 7, the value of is related to the length of the sequence, and (i + τ)8 = mod(i + τ, 8), that is, the remainder of (i + τ) divided by 8. Then (8 - R s (τ)) / 2 is equal to the Hamming distance between the sequence and after circularly shifting the sequence by τ. Based on the relationship between the Hamming distance and the autocorrelation function, it can be known that the smaller R s (τ) is, the larger the Hamming distance is. Excluding the case where the Hamming distance is 0, when takes different values, the Hamming distances between the cyclic sequences are as follows in 14 cases, as shown in Table 11.

[0197] Table 11

[0198] Hamming distance τ = 1 τ = 2 τ = 3 τ = 4 τ = 5 τ = 6 τ = 7 Case 1 2 2 2 2 2 2 2 Case 2 2 4 4 4 4 4 2 Case 3 2 4 6 6 6 4 2 Case 4 2 4 6 8 6 4 2 Case 5 4 2 4 4 4 2 4 Case 6 4 4 2 4 2 4 4 Case 7 4 4 4 6 4 4 4 Case 8 4 4 6 4 6 4 4 Case 9 4 6 4 2 4 6 4 Case 10 4 6 4 4 4 6 4 Case 11 6 2 6 2 6 2 6 Case 12 6 4 2 6 2 4 6 Case 13 6 4 2 8 2 4 6 Case 14 6 4 4 4 4 4 6

[0199] Let the 4 sequences of length 8 consisting of 1 and -1 be respectively: Using these four sequences to be evenly spliced together to form a sequence of length 32 For the sequence circularly shift it by 0, 4, 8, 12, 16, 20, 24, 28 positions respectively to obtain 8 sequences of length 32, and then take the opposite of the values on the even (or odd) positions of the sequences obtained by the circular shift to obtain another eight sequences, denoted by for these 16 sequences. The periodic autocorrelation functions of the sequences and are respectively denoted as R a (τ), R b (τ), R c (τ) and R d (τ), then the Hamming distance between the sequences and satisfies formula (2):

[0200]

[0201] It can be understood that the condition for the first formula in formula (2) is that i is less than or equal to 7 and j is less than or equal to 7; or, i is greater than or equal to 8 and j is greater than or equal to 8. The condition for the second formula in formula (2) is |i - j| = 8. The condition for the third formula in formula (2) is that i is greater than or equal to 8 and j is less than or equal to 7, or, i is less than or equal to 7 and j is greater than or equal to 8.

[0202] Where τ = |i - j|, the Hamming distances between different sequences are shown in Table 12 below (i < j). It can be understood that since the Hamming distance when i is less than j is symmetric to the Hamming distance when i is greater than j, Table 12 only exemplarily shows the Hamming distance when i is less than j.

[0203] Table 12

[0204]

[0205]

[0206] In Table 12, the Hamming distances can satisfy Formula (3) and Formula (4):

[0207] A(τ) = (32 - R a (τ) - R b (τ) - R c (τ) - R d [[ID=I24]](τ)) / 2 (3)

[0208] B(τ) = (32 - R a (τ) + R b (τ) - R c (τ) + R d (τ)) / 2 (4)

[0209] Therefore, to make the Hamming distance between different sequences as large as possible, as a possible implementation, R b (τ) + R d (τ) = 0, for τ ≠ 0, and at the same time R a (τ) + R c (τ) is as small as possible. Then, according to the Hamming distance distribution of the cyclic sequences in Table 11, the Hamming distances between the sequences and and their own cyclic sequences should belong to the cases in Table 11 where the sum of the Hamming distances is equal to 8, such as case 2 and case 14, or case 5 and case 10, or case 6 and case 8. Therefore, the sequences and can be obtained based on any one of the following formulas:

[0210] [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1] (5)

[0211] [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1] (6)

[0212] [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] (7)

[0213] Sequence and may be respectively shown as any one of formulas (5) to (7), or may also be obtained by performing a cyclic shift, negation operation, or reverse order operation based on any one of formulas (5) to (7). Since the cyclic shift, negation operation, or reverse order operation does not affect the autocorrelation of the sequence, and the embodiments of the present application focus on the sum of the autocorrelations of these two sequences, performing a cyclic shift, negation, and exchange on any one of the sequences shown in formulas (5) to (7) respectively does not affect the Hamming distance.

[0214] It can be understood that the embodiments of the present application do not limit which one of the formulas (5), (6), or (7) the sequences and are.

[0215] According to the Hamming distance distribution of the cyclic sequences in Table 11, the Hamming distances between the sequences and and their own cyclic sequences should belong to the cases with larger Hamming distances in Table 11, such as case8, case10, or case14. Thus, the sequences and can be obtained based on any one of the following formulas (8), such as the sequences and can be selected from any two different sequences among the three sequences shown in formula (8), or may also be sequences obtained by performing a cyclic shift, negation operation, or reverse order operation on two of the three sequences shown in formula (8) respectively.

[0216] [1 1 -1 1 -1 1 -1 -1],

[0217] [1 1 -1 1 1 -1 -1 -1], (8)

[0218] [1 1 1 -1 1 -1 -1 -1]

[0219] Based on formulas (5) to (8), sequences and Sequence and After that, sequence Then, the sequence Eight sequences of length 32 are obtained by circularly shifting 0, 4, 8, 12, 16, 20, 24, and 28 bits respectively, and then the values of the even (or odd) bits of the sequences obtained by the circular shift are inverted to obtain another eight sequences. Thus, the 16 sequences formed The Hamming distance between any two different sequences is 16, 18, or 20, that is, the minimum Hamming distance is 16.

[0220] For example, (The first sequence in formula (8) is circularly shifted 1 bit to the right), (The first sequence in formula (5) is circularly shifted 2 bits to the left), (After the third sequence in formula (8) is circularly shifted 4 bits to the right, a reverse operation is performed to obtain), (The second sequence in formula (5) is circularly shifted 1 bit to the right), then the 16 sequences Form the following matrix M1.

[0221]

[0222] Replacing -1 in the above matrix M1 or matrix (-M1) (i.e., taking the overall inversion of matrix M1) with 1 and 1 with 0 can be used as the mapping relationship from 16 information bits of length 4 to spreading sequences, or as the mapping relationship from 16 data symbols to spreading sequences of length 32, as shown in Table 1 above. The Hamming distance between different spreading sequences can be referred to Table 2 above, which will not be elaborated here. Of course, -1 in the matrix can also be replaced with 0, and the embodiments of the present application do not limit this. It can be understood that if each element in matrix M1 is denoted as m and each element in the spreading sequence of length 32 is denoted as m', then each element in matrix M1 can also be operated as follows to obtain 16 spreading sequences of length 32: m'=(m + 1) / 2 or m'=(1 - m) / 2. It can be understood that the description about replacement also applies hereinafter.

[0223] It should be noted that for matrix M1 shown in formula (9), each row of matrix M1 can correspond to a data symbol, with a total of 16 rows, so it corresponds to 16 data symbols. Thus, after replacing -1 in matrix M1 with 0 and 1 with 0, the mapping relationship shown in Table 1 can be obtained. Therefore, the number (or length of the sequence) of the sequences shown in the embodiments of the present application (such as the four sequences shown above and ) can be related to the number of different data symbols and the length of the spreading sequence. Any mapping relationship obtained based on the above rules falls within the protection scope of the embodiments of the present application. The same applies to this description hereinafter.

[0224] Another example is (The first sequence in formula (8) is reversed),

[0225] (The second sequence in formula (6) is circularly shifted left by 1 bit),

[0226] (The third sequence in formula (8) is circularly shifted right by 3 bits),

[0227] and (The first sequence in formula (6) is circularly shifted right by 4 bits), then the 16 sequences form the following matrix M2.

[0228]

[0229]

[0230] Replacing -1 in the above matrix M2 or matrix (-M2) (i.e., taking the overall negation of matrix M2) with 1 and 1 with 0 can be used as the mapping relationship from 16 information bits of length 4 to spreading sequences, or as the mapping relationship from 16 data symbols to spreading sequences of length 32, as shown in Table 3 above. The Hamming distance between different spreading sequences can be referred to in Table 4 above and will not be elaborated here.

[0231] In the mapping relationship shown in the embodiments of the present application, it can be seen from Table 2 and Table 4 that the Hamming distances between different spreading sequences include 16 and 18, so that the sum of the Hamming distances between different spreading sequences is the largest, effectively reducing the bit error rate at the receiving end.

[0232] As another possible implementation, R b (τ) + R d (τ) = 0, for τ ≠ 0, and at the same time R a (τ) + R c (τ) = 0, for τ ≠ 0. At this time, the Hamming distance between any two sequences and is equal to 16, and the signals formed after the spreading sequences are modulated by O-QPSK are orthogonal, which can support non-coherent reception (or non-correlative demodulation). At this time, the sequences and can be any pair of the three pairs of sequences in formulas (5), (6) and (7). At the same time, the sequences and can also be any pair of the three pairs of sequences in formulas (5), (6) and (7).

[0233] Since circular shift, negation operation, and reverse operation do not affect the autocorrelation of the sequence, the sequence and perform at least one of the following respectively: cyclic shift, reverse order, inversion or exchange and do not affect the Hamming distance and the orthogonality after O-QPSK modulation. And for the sequences and perform at least one of the following respectively: cyclic shift, reverse order, inversion or exchange and also do not affect the Hamming distance and the orthogonality after O-QPSK modulation.

[0234] For example, (after the second sequence in formula (5) is circularly shifted to the right by 1 bit and then reversed), (the first sequence in formula (6) is circularly shifted to the right by 1 bit), (the first sequence in formula (5) is circularly shifted to the right by 1 bit), (the second sequence in formula (6) is circularly shifted to the left by 1 bit), then the 16 sequences form the following matrix M3.

[0235]

[0236] Among them, the Hamming distance between any two different sequences is 16.

[0237] Replacing -1 with 1 and 1 with 0 in the above matrix M3 or matrix (-M3) (i.e., taking the overall inversion of matrix M3) can be used as the mapping relationship from 16 information bits of length 4 to spreading sequences, or as the mapping relationship from 16 data symbols to spreading sequences of length 32, as shown in Table 5 above.

[0238] It can be understood that the matrices shown in Implementation Method 1 are only examples, and based on the method shown above, there can also be other mapping relationships, which will not be listed one by one here.

[0239] In the mapping relationship shown in the embodiments of the present application, the Hamming distance between different spreading sequences is 16, so that the signals formed after the spreading sequences are modulated by O-QPSK are orthogonal, which can support non-coherent demodulation at the receiving end and reduce the complexity of demodulation at the receiving end.

[0240] The mapping relationship shown in the embodiments of the present application can, while ensuring the autocorrelation characteristics between different spreading sequences, effectively increase the minimum Hamming distance, reduce the bit error rate at the receiving end, and improve the system performance.

[0241] Implementation Method 2:

[0242] In mathematics, a Hadamard matrix is a square matrix in which each element is either +1 or -1, and each row is orthogonal to every other row, and each column is orthogonal to every other column. An n×n Hadamard matrix H satisfies HH T = nI n , where I n is the n×n identity matrix. Since all rows of a Hadamard matrix are orthogonal to each other, the Hamming distance between different rows is n / 2.

[0243] Therefore, in the mapping matrix M of 16 rows and 32 columns composed of 16 spreading sequences of length 32 involved in the embodiments of the present application, the odd-numbered columns can be composed of a 16×16 Hadamard matrix, and the even-numbered columns can also be composed of a 16×16 Hadamard matrix. At the same time, each row in the matrix formed by the odd-numbered columns and each row in the matrix formed by the even-numbered columns form a Gray complementary pair sequence, which can achieve the following effects: 1. The Hamming distance between any two different sequences is 16; 2. Different symbols after O-QPSK modulation are orthogonal and can support non-coherent demodulation; 3. There are two fixed chip values at fixed positions for each data symbol, and the receiving end can use these fixed chip values for frequency offset estimation and compensation to improve the frequency offset resistance of the system; 4. The modulation symbols have a low peak-to-average power ratio (PAPR), and the PAPR of the Gray sequence is not greater than 3 dB.

[0244] Exemplarily, the element in the r-th row and c-th column of the above Hadamard matrix can satisfy formula (12):

[0245]

[0246] where bitget(x,n) is equal to the value of the n-th bit in the binary representation of x, and K is a parameter in the range of 0 - 15. Different K values can generate different Hadamard matrices. Thus, two different K values can be selected to form the even-numbered columns and odd-numbered columns in the mapping matrix.

[0247] For example, when K = 1 and K = 14, the following matrix M4 can be constructed:

[0248]

[0249] Replacing -1 with 1 and 1 with 0 in the above M4 or -M4 matrix can be used as the mapping relationship from 16 information bits of length 4 to spreading sequences, or as the mapping relationship from 16 data symbols to spreading sequences of length 32, as shown in Table 6 above.

[0250] The mapping relationship shown in the embodiments of the present application can, while ensuring the autocorrelation characteristics between different spreading sequences, make the Hamming distance between the spreading sequences corresponding to different data symbols be 16, which can effectively improve the system performance. In addition, at least two chip values at fixed positions of each data symbol are fixed. Since at least two chip values at fixed positions of each data symbol can be fixed, these fixed chip values can be used as pilots, so that the receiving end can use these fixed chip values for frequency offset estimation and compensation, improving the system's anti-frequency offset ability.

[0251] Implementation method three

[0252] m1 = [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1] and m2 = [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1] are two m-sequences of length 31. By performing element-by-element exclusive OR on the sequence obtained by circularly shifting m2 by i bits with m1, Gold sequence gi is obtained, where i = 0, 1, 2,..., 30, as shown in Table 13.

[0253] Table 13

[0254]

[0255]

[0256] Arbitrarily select 16 (repetition is allowed) from the 31 Gold sequences shown in Table 13, and after circularly shifting the selected sequences (the number of circular shifts can be different), supplement a column of elements (such as supplementing to the first column of M) to the 16 selected sequences. Then, by trying different sequence selections, circular shifts of each sequence, and supplemented elements, search for the sequence set with the largest Hamming distance to obtain the mapping relationship shown in Table 7 above. Exemplarily, sequences satisfying the conditions can be searched by setting the minimum and maximum values of the Hamming distance, so as to obtain a 16-row and 32-column matrix, and then obtain the mapping relationship. For example, the minimum value of the Hamming distance can be 16, and the maximum value can be 20. Another example, the minimum value of the Hamming distance can be 16, and the maximum value can be 18. Exemplarily, based on the above method, the following matrix M5 can be formed. The Hamming distance between different spreading sequences can be as shown in Table 8 above.

[0257]

[0258] It can be understood that the matrix obtained based on the above Gold sequence and Hamming distance can be used as the mapping relationship from 16 data symbols to the spreading sequence. It is also possible to re-arrange the columns in Table 7 or take the complement of some columns, or re-arrange the rows in Table 7 to form a new mapping relationship, and this new mapping relationship can also be used as the mapping table relationship from 16 data symbols to the spreading sequence.

[0259] In the mapping relationship shown in the embodiments of the present application, while ensuring the autocorrelation characteristics between different spreading sequences, the Hamming distances between different spreading sequences can include 16, 17, and 20. Thus, the case where the Hamming distance between different spreading sequences is equal to 16 is the least, which can further reduce the bit error rate at the receiving end.

[0260] Implementation method four

[0261] Referring to Implementation method one, let two sequences of length 8 composed of 1 and -1 be respectively: and Use these four sequences to be evenly spliced together to form a sequence of length 16 For the sequence Perform cyclic shifts of 0, 2, 4, 6, 8, 10, 12, and 14 respectively to obtain 8 sequences of length 16, and then take the complement of the values at the even (or odd) positions of the 8 sequences obtained by the cyclic shift to obtain another eight sequences, denoted by to represent these 16 sequences. The sequences and can be any two sequences selected from the three sequences shown in formula (8), or they can also be the sequences after cyclic shift, complement, or reverse order of the selected sequences. Or, it can also be understood that the sequences and are obtained based on any two sequences among the three sequences shown in formula (8).

[0262] For example, then the 16 sequences form the following mapping matrix M6.

[0263]

[0264] Replace -1 with 1 and 1 with 0 in the above M6 or -M6 matrix, which can be used as the mapping relationship from 16 information bits of length 4 to the spreading sequence, or as the mapping relationship from 16 data symbols to the spreading sequence of length 16, as shown in Table 9 above. The minimum Hamming distance in the mapping relationship shown in Table 9 is greater than or equal to 8.

[0265] The mapping relationship shown in the embodiments of the present application can, while ensuring the autocorrelation characteristics between different spreading sequences, also effectively increase the minimum Hamming distance, reduce the bit error rate at the receiving end, and improve the system performance.

[0266] Implementation Mode Five

[0267] Referring to Implementation Mode Two, when n = 8, an 8×8 Hadamard matrix can be obtained as follows:

[0268]

[0269] Therefore, an 8×8 Hadamard matrix H as shown in the above formula can be selected, or the columns of H can be rearranged or some columns can be inverted, or after the rows in H are arranged, a mapping matrix from 16 data symbols to spreading sequences of length 8 can be constructed, as shown in formula (13):

[0270]

[0271] Replacing -1 in the above M7 or -M7 matrix with 0 can be used as the mapping relationship from 16 data symbols to spreading sequences of length 8, as shown in Table 10. The minimum Hamming distance in the mapping relationship shown in Table 10 is greater than or equal to 4.

[0272] In the mapping relationship shown in the embodiments of the present application, the Hamming distance between spreading sequences corresponding to different data symbols is 16, which can effectively improve the system performance. In addition, the chip values at two fixed positions of each data symbol are fixed, so the receiving end can use the fixed chip values for frequency offset estimation and compensation to improve the system's anti-frequency offset ability.

[0273] It can be understood that in each of the above embodiments, where one embodiment is not described in detail, other embodiments can be referred to.

[0274] The communication device provided in the embodiments of the present application will be introduced below.

[0275] The present application divides the communication device into functional modules according to the above method embodiments. For example, each functional module can be corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of a software functional module. It should be noted that the division of modules in the present application is schematic, only a logical function division, and there can be other division methods in actual implementation. The following will be combined with Figures 6 to 8 Describe the communication device of the embodiments of the present application in detail.

[0276] Figure 6 is a schematic structural diagram of a communication device provided in the embodiments of the present application, as Figure 6 shown, the communication device includes a processing unit 601 and a transceiver unit 602.

[0277] In some embodiments of the present application, the communication device may be the transmitting end or the chip shown above, and the chip may be disposed in the transmitting end. That is, the communication device may be used to execute the steps or functions performed by the transmitting end in the above method embodiments.

[0278] A processing unit 601 is configured to generate a PPDU based on a mapping relationship between data symbols and spreading sequences (or a mapping relationship between information bits and spreading sequences); a transceiver unit 602 is configured to output the PPDU.

[0279] It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For the specific functions or steps performed by the transceiver unit and the processing unit, reference may be made to the above method embodiments, which will not be elaborated here. Exemplarily, the processing unit 601 may be used to execute Figure 3 step 301 shown. The transceiver unit 602 may be used to execute Figure 3 the sending step in step 302 shown.

[0280] Multiplexing Figure 6 In some other embodiments of the present application, the communication device may be the receiving end or the chip shown above, and the chip may be disposed in the receiving end. That is, the communication device may be used to execute the steps or functions performed by the receiving end in the above method embodiments.

[0281] For example, the transceiver unit 602 is configured to input a PPDU; the processing unit 601 is configured to process the PPDU based on a mapping relationship between data symbols and spreading sequences (or a mapping relationship between information bits and spreading sequences).

[0282] For example, the processing unit 601 is specifically configured to obtain a first sequence in the PPDU; determine a first spreading sequence corresponding to the first sequence according to N spreading sequences included in the above mapping relationship; determine data symbols corresponding to the first spreading sequence based on the above mapping relationship; and determine information bits corresponding to the first spreading sequence based on the data symbols corresponding to the first spreading sequence.

[0283] For another example, the processing unit 601 is specifically configured to perform O-QPSK demodulation, or perform BPSK demodulation, or perform PSK demodulation.

[0284] It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For the specific functions or steps performed by the transceiver unit and the processing unit, reference may be made to the above method embodiments, which will not be elaborated here. Exemplarily, the transceiver unit 602 may also be used to execute Figure 3 the receiving step in step 302 shown. The processing unit 601 may also be used to execute Figure 3 step 303 shown.

[0285] In a possible implementation manner, each of the above communication devices may include a storage unit, and the storage unit may be used to store each of the mapping relationships shown above.

[0286] In each of the above embodiments, the descriptions of the PPDU, mapping relationship, minimum Hamming distance, etc. may also refer to the introduction in the above method embodiment, and will not be elaborated here one by one.

[0287] It can be understood that the above division method is only an example. The division methods for the sending end (or the chip disposed on the sending end) and the receiving end (or the chip disposed on the receiving end) may also be as follows: the sending end may include a generating unit and a sending unit; the receiving end may include a receiving unit and a processing unit, and the processing unit may include at least one of a demodulation processing sub-unit (such as demodulating modulation symbols) and a demapping processing sub-unit (such as demapping one or more sequences in the PPDU according to the mapping relationship to obtain one or more data symbols), etc., which will not be listed one by one here.

[0288] The first communication device and the second communication device of the embodiments of the present application are introduced above. The possible product forms of the first communication device and the second communication device are introduced below. It should be understood that Figure 6 Any product form that has the function of the above Figure 6 described first communication device, or any product form that has the function of the above

[0289] In a possible implementation manner, Figure 6In the communication device shown, the processing unit 601 can be one or more processors, and the transceiver unit 602 can be a transceiver, or the transceiver unit 602 can also be a sending unit and a receiving unit. The sending unit can be a transmitter, and the receiving unit can be a receiver. The sending unit and the receiving unit are integrated into one device, such as a transceiver. In the embodiments of the present application, the processor and the transceiver can be coupled, etc. The embodiments of the present application do not limit the connection manner between the processor and the transceiver. In the process of executing the above method, the process of sending information (such as sending a PPDU) in the above method can be understood as the process of the processor outputting the above information. When outputting the above information, the processor outputs the above information to the transceiver for transmission by the transceiver. After the above information is output by the processor, other processing may be required before it reaches the transceiver. Similarly, the process of receiving information (such as receiving a PPDU) in the above method can be understood as the process of the processor receiving the input above information. When the processor receives the input information, the transceiver receives the above information and inputs it to the processor. Further, after the transceiver receives the above information, the above information may need to be processed otherwise before being input to the processor.

[0290] As Figure 7 shown, the communication device 70 includes one or more processors 720 and a transceiver 710.

[0291] Exemplarily, when the communication device is used to execute the steps, methods or functions executed by the above sending end, the processor 720 is used to generate a PPDU based on the mapping relationship between data symbols and spreading sequences (or the mapping relationship between information bits and spreading sequences); the transceiver 710 is used to send the PPDU.

[0292] Exemplarily, when the communication device is used to execute the steps, methods or functions executed by the above receiving end, the transceiver 710 is used to receive the PPDU from the sending end; the processor 720 is used to process the PPDU based on the mapping relationship between data symbols and spreading sequences (or the mapping relationship between information bits and spreading sequences).

[0293] In the embodiments of the present application, the descriptions of the PPDU, the mapping relationship, the minimum Hamming distance, etc. can also refer to the introduction in the above method embodiments, and will not be elaborated here one by one.

[0294] It can be understood that the specific descriptions of the processor and the transceiver can also refer to Figure 6 the introduction of the processing unit and the transceiver unit shown, and will not be repeated here.

[0295] In Figure 7In each implementation of the communication device shown, the transceiver may include a receiver and a transmitter. The receiver is used to perform the receiving function (or operation), and the transmitter is used to perform the transmitting function (or operation). And the transceiver is used to communicate with other devices / apparatuses through a transmission medium.

[0296] Optionally, the communication device 70 may further include one or more memories 730 for storing program instructions and / or data, etc. The memory 730 is coupled to the processor 720. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units or modules, which can be electrical, mechanical or other forms, and is used for information interaction between devices, units or modules. The processor 720 may cooperate with the memory 730. The processor 720 may execute the program instructions stored in the memory 730. Optionally, at least one of the above one or more memories may be included in the processor. Optionally, one or more memories may be used to store the mapping relationship in the embodiments of the present application.

[0297] In the embodiments of the present application, the specific connection medium between the transceiver 710, the processor 720 and the memory 730 is not limited. In the embodiments of the present application Figure 7 it is shown that the memory 730, the processor 720 and the transceiver 710 are connected through a bus 740. The bus is represented by a thick line in Figure 7 The connection manners between other components are only for illustrative purposes and are not to be taken as limiting. The bus may be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, Figure 7 only one thick line is used to represent it in

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

[0299] In the embodiments of the present application, the memory may include, but is not limited to, non-volatile memories such as a hard disk drive (HDD) or a solid-state drive (SSD), a Random Access Memory (RAM), an Erasable Programmable ROM (EPROM), a Read-Only Memory (ROM), or a Compact Disc Read-Only Memory (CD-ROM), etc. 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 can be read and / or written by a computer (such as the communication device shown in the present application), but is not limited thereto. The memory in the embodiments of the present application may also be a circuit or any other device capable of implementing a storage function, for storing program instructions and / or data.

[0300] Exemplarily, the processor 720 is mainly used to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of software programs. The memory 730 is mainly used to store software programs and data. The transceiver 710 may include a control circuit and an antenna. The control circuit is mainly used for the conversion between baseband signals and radio frequency signals and the processing of radio frequency signals. The antenna is mainly used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices, such as a touch screen, a display screen, a keyboard, etc., are mainly used to receive data input by users and output data to users.

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

[0302] In another implementation, the radio frequency circuit and the antenna may be provided independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuit and the antenna may be independent of the communication device and arranged in a remote manner.

[0303] It can be understood that the communication device shown in the embodiments of the present application may also have more Figure 7More components, etc. are not limited in the embodiments of the present application. The methods executed by the above-mentioned processor and transceiver are only examples. For the specific steps executed by the processor and transceiver, reference may be made to the methods introduced above.

[0304] In another possible implementation, Figure 6 In the communication device shown, the processing unit 601 may be one or more logic circuits, and the transceiver unit 602 may be an input / output interface, or also referred to as a communication interface, or an interface circuit, or an interface, etc. Or the transceiver unit 602 may also be a sending unit and a receiving unit. The sending unit may be an output interface, and the receiving unit may be an input interface. The sending unit and the receiving unit are integrated into one unit, such as an input / output interface. As Figure 8 shown, Figure 8 The communication device shown includes a logic circuit 801 and an interface 802. That is, the above-mentioned processing unit 601 can be implemented by the logic circuit 801, and the transceiver unit 602 can be implemented by the interface 802. Among them, the logic circuit 801 may be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 802 may be a communication interface, an input / output interface, a pin, etc. Exemplarily, Figure 8 is given by taking the above-mentioned communication device as a chip as an example. The chip includes a logic circuit 801 and an interface 802. It can be understood that the chip shown in the embodiments of the present application may include a narrowband chip or an ultra-wideband chip, etc., which are not limited in the embodiments of the present application. The steps of sending UWB pulses as shown above can be executed by an ultra-wideband chip. Whether the remaining steps are executed by an ultra-wideband chip is not limited in the embodiments of the present application.

[0305] In the embodiments of the present application, the logic circuit and the interface may also be coupled to each other. For the specific connection manner between the logic circuit and the interface, the embodiments of the present application are not limited.

[0306] Exemplarily, when the communication device is used to execute the method, function or step executed by the above-mentioned sending end, the logic circuit 801 is used to generate a PPDU; the interface 802 is used to output the PPDU.

[0307] Exemplarily, when the communication device is used to execute the method, function or step executed by the above-mentioned receiving end, the interface 802 is used to input a PPDU; the logic circuit 801 is used to process the PPDU.

[0308] As a possible implementation, the above-mentioned respective chips may include a storage circuit, and the storage circuit may be used to store the mapping relationship provided in the embodiments of the present application. As another possible implementation, the above-mentioned respective chips may also be connected to a memory, so that when the mapping relationship is needed, the mapping relationship provided in the embodiments of the present application is read from the memory.

[0309] It can be understood that the communication device shown in the embodiments of the present application can implement the method provided in the embodiments of the present application in the form of hardware, or can also implement the method provided in the embodiments of the present application in the form of software, etc. The embodiments of the present application do not limit this.

[0310] In each of the above embodiments, the descriptions of PPDU, mapping relationship, minimum Hamming distance, etc. can also refer to the introductions in the method embodiments above, and will not be elaborated one by one here.

[0311] For Figure 8 The specific implementation manners of the various embodiments shown can also refer to the above various embodiments, and will not be elaborated here.

[0312] The embodiments of the present application also provide a wireless communication system, which includes a sending end and a receiving end. The sending end and the receiving end can be used to execute the method in any of the foregoing embodiments (such as Figure 3 ). Or, the sending end and the receiving end can refer to Figures 6 to 8 the communication device shown.

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

[0314] The present application also provides a computer program, which is used to implement the operations and / or processes executed by the receiving end in the method provided by the present application.

[0315] The present application also provides a computer-readable storage medium, in which computer code is stored. When the computer code runs on a computer, the computer is caused to execute the operations and / or processes executed by the sending end in the method provided by the present application.

[0316] The present application also provides a computer-readable storage medium, in which computer code is stored. When the computer code runs on a computer, the computer is caused to execute the operations and / or processes executed by the receiving end in the method provided by the present application.

[0317] The present application also provides a computer program product, which includes computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processes executed by the sending end in the method provided by the present application are caused to be executed.

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

[0319] In several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed couplings or direct couplings or communication connections to each other can be indirect couplings or communication connections through some interfaces, devices, or units, or can also be electrical, mechanical, or other forms of connection.

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

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

[0322] If the above-mentioned integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a readable storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The foregoing readable storage medium includes: USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs, etc., which can store program codes.

[0323] As described above, it is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of changes or substitutions, which should all be covered 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 described above.

Claims

1. A communication method based on a Physical Layer Protocol Data Unit (PPDU), characterized in that, The method includes: generating a PPDU based on the mapping relationship between data symbols and spreading sequences; Transmitting the PPDU; The mapping relationship between the data symbols and the spreading sequences is as follows: 。 2. A communication method for a physical layer protocol data unit (PPDU), characterized in that, The method includes: Receiving a PPDU; Processing the PPDU based on the mapping relationship between data symbols and spreading sequences; The mapping relationship between the data symbols and the spreading sequences is as follows: 。 3. The method according to claim 2, wherein The processing the PPDU based on the mapping relationship between data symbols and spreading sequences includes: Obtaining a first sequence in the PPDU, where the length of the first sequence is L; Determining a first spreading sequence corresponding to the first sequence according to N spreading sequences included in the mapping relationship between the data symbols and the spreading sequences, where the first spreading sequence is one of the N spreading sequences, and N is a positive integer; Determining data symbols corresponding to the first spreading sequence based on the mapping relationship between the data symbols and the spreading sequences; Determining information bits corresponding to the first spreading sequence based on the data symbols corresponding to the first spreading sequence.

4. The method according to any one of claims 1-3, characterized in that, The length of each of the spreading sequences is L, and the minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer, the bit length corresponding to the data symbol is less than the bit length of the spreading sequence, and the minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences.

5. The method according to any one of claims 1 to 4, characterized in that L = 32, or L = 16, or L = 8.

6. The method according to any one of claims 1 to 5, characterized in that, The spreading sequence is obtained based on at least one of the following: [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1]; [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1]; [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1].

7. The method according to any one of claims 1-6, characterized in that, The spreading sequence is obtained based on at least two of the following: [1 1 -1 1 -1 1 -1 -1]； [1 1 -1 1 1 -1 -1 -1]； [1 1 1 -1 1 -1 -1 -1]。 8. The method according to any one of claims 1-5, characterized in that, The spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the spreading sequence.

9. The method according to claim 8, wherein At least two columns of the matrix composed of the spreading sequences have the same elements.

10. The method according to any one of claims 1-5, characterized in that, The spreading sequence is obtained based on the following two sequences: [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1]； [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1]。 11. A communication device, characterized in that, The device includes: A processing unit, configured to generate a PPDU based on the mapping relationship between data symbols and spreading sequences; A transceiver unit, configured to transmit the PPDU; The mapping relationship between the data symbols and the spreading sequences is as follows:

12. A communication device, characterized in that, The device includes: A transceiver unit, configured to receive a PPDU; A processing unit, configured to process the PPDU based on the mapping relationship between data symbols and spreading sequences; The mapping relationship between the data symbols and the spreading sequences is as follows: 。 13. The device according to claim 12, wherein, The processing unit is specifically configured to obtain a first sequence in the PPDU, where the length of the first sequence is L; determine a first spreading sequence corresponding to the first sequence according to N spreading sequences included in the mapping relationship between the data symbols and the spreading sequences, where the first spreading sequence is one of the N spreading sequences, and N is a positive integer; Determine the data symbol corresponding to the first spreading sequence based on the mapping relationship between the data symbol and the spreading sequence; Determine the information bit corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence.

14. The method according to any one of claims 11-13, characterized in that, The length of each spreading sequence is L, and the minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer, the bit length corresponding to the data symbol is less than the bit length of the spreading sequence, and the minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spreading sequences.

15. The device according to any one of claims 11 - 14, characterized in that, L = 32, or L = 16, or L = 8.

16. The device according to any one of claims 11-15, characterized in that, The spreading sequence is obtained based on at least one of the following: [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1]; [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1]; [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1].

17. The device according to any one of claims 11-16, characterized in that, The spreading sequence is obtained based on at least two of the following: [1 1 -1 1 -1 1 -1 -1]； [1 1 -1 1 1 -1 -1 -1]； [1 1 1 -1 1 -1 -1 -1]。 18. The device according to any one of claims 11-15, characterized in that, The spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the spreading sequence.

19. The device according to claim 18, characterized in that, At least two columns of the matrix composed of the spreading sequences have the same elements.

20. The device according to any one of claims 11-15, characterized in that, The spreading sequence is obtained based on the following two sequences: [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1]； [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1]。 21. A communication device, characterized in that, Comprising a processor and a memory; The memory is used to store instructions; The processor is used to execute the instructions so that the method according to any one of claims 1 to 10 is executed.

22. A chip, characterized in that, Comprising a logic circuit and an interface, and the logic circuit and the interface are coupled; The interface is used to input and / or output code instructions, and the logic circuit is used to execute the code instructions so that the method according to any one of claims 1 to 10 is executed.

23. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, and when the computer program is executed, the method according to any one of claims 1 to 16 is executed.

24. A computer program product, characterized in that, When the computer program product is executed by a computer, the method according to any one of claims 1 - 10 is executed.

25. A communication system, characterized in that, The communication system includes a sending end and a receiving end, the sending end is used to execute the method according to any one of claims 1, 4 to 10, and the receiving end is used to execute the method according to any one of claims 2 to 10.

Images