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 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

Communication method and device based on physical layer protocol data unit

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on June 17, 2022, with application number 202210688053.1 and application name “Communication method and device based on physical layer protocol data unit”, the entire contents of which are incorporated by reference into this application. Technical Field

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

[0003] Ultra-wideband (UWB) is a wireless carrier communication technology that transmits data using narrow, non-sinusoidal pulses in the nanosecond range, thus occupying a very wide spectrum. Due to its narrow pulses and extremely low radiation spectral density, UWB systems offer advantages such as strong multipath resolution, low power consumption, and enhanced security.

[0004] With the entry of UWB technology into the civilian sector, ultra-wideband wireless communication has become a popular physical layer technology for short-range, high-speed wireless networks. Typically, narrowband signals used to support UWB require mapping fixed-length information bits onto data symbols, which are then mapped onto a spreading sequence of a certain length to expand the signal bandwidth.

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

[0006] Summary of the Invention

[0007] The present application provides a PPDU-based communication method and apparatus, which can effectively improve the minimum Hamming distance among the Hamming distances between different spread spectrum sequences, thereby effectively reducing the bit error rate at the receiving end.

[0008] In a first aspect, an embodiment of the present application provides a communication method based on a physical layer protocol data unit (PPDU), which is applied to a transmitting end. The method includes: generating a PPDU based on a mapping relationship between data symbols and spread spectrum sequences, where the length of each spread spectrum 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 spread spectrum sequence, and the minimum Hamming distance represents the minimum Hamming distance between any two different spread spectrum sequences; and sending the PPDU.

[0009] In combination with the first aspect, in one possible implementation, generating the PPDU based on the mapping relationship between the data symbol and the spread spectrum sequence includes: generating the modulation symbol of the PPDU based on the mapping relationship between the data symbol and the spread spectrum sequence; and sending the PPDU includes: sending the modulation symbol of the PPDU.

[0010] In a second aspect, an embodiment of the present application provides a communication method for a physical layer protocol data unit (PPDU), which is applied to a receiving end and includes: receiving the PPDU; processing the PPDU based on a mapping relationship between data symbols and spread spectrum sequences, wherein the length of each spread spectrum 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 spread spectrum sequence, and the minimum Hamming distance represents the minimum Hamming distance among the Hamming distances of any two different spread spectrum sequences.

[0011] In combination with the second aspect, in a possible implementation, processing the PPDU based on the mapping relationship between data symbols and spread spectrum 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 based on the N spreading sequences included in the mapping relationship between the data symbols and the spread spectrum sequences, where the first spreading sequence is one of the N spreading sequences, and N is a positive integer; determining the data symbol corresponding to the first spreading sequence based on the mapping relationship between the data symbols and the spread spectrum sequences; and determining the information bit corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence.

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

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

[0014] 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:

[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] [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1].

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

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

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

[0021] [1 1 1 -1 1 -1 -1 -1]

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

[0023] With reference to the first aspect or the second aspect, in a possible implementation manner, 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.

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

[0025] With reference to the first or second aspect, in a possible implementation manner, at least two columns of the matrix composed of the spreading sequences have the same elements.

[0026] In an embodiment of the present application, each data symbol has at least two fixed positions with fixed chip values. Since each data symbol can have at least two fixed positions with fixed chip values, the fixed chip values ​​can be used as pilots, so that the receiving end can use the fixed chip values ​​to perform frequency offset estimation and compensation, thereby improving the system's ability to resist frequency offset.

[0027] In combination with the first aspect or the second aspect, in a possible implementation manner, the spreading sequence is obtained based on the following two sequences:

[0028] [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];

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

[0030] In the embodiment 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, so that 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 of the receiving end.

[0031] In combination with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0032] In combination with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

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

[0034] In combination with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

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

[0036] In combination with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0037] In combination with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0038] In a third aspect, embodiments of the present application provide a communication device for executing the method of the first aspect or any possible implementation of the first aspect. The communication device includes a unit capable of executing the method of the first aspect or any possible implementation of the first aspect. Exemplarily, the communication device includes a processing unit and a transceiver unit.

[0039] The processing unit is configured to generate 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, 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 between any two different spreading sequences; and the transceiver unit is configured to send the PPDU.

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

[0041] In a fourth aspect, an embodiment of the present application provides a communication device for executing the method of the second aspect or any possible implementation of the second aspect. The communication device includes a unit capable of executing the method of the second aspect or any possible implementation of the second aspect. Exemplarily, the communication device includes a processing unit and a transceiver unit.

[0042] The transceiver unit is configured to receive a PPDU; the processing unit is configured to process the PPDU based on a mapping relationship between data symbols and spread spectrum sequences, where the length of each spread spectrum 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 spread spectrum sequence, and the minimum Hamming distance represents the minimum Hamming distance between any two different spread spectrum sequences.

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

[0044] In combination with the third aspect or the fourth aspect, in a possible implementation, L=32, or L=16, or L=8.

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

[0046] [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1];

[0047] [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1];

[0048] [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1].

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

[0050] [1 1 -1 1 -1 1 -1 -1]

[0051] [1 1 -1 1 1 -1 -1 -1].

[0052] [1 1 1 -1 1 -1 -1 -1]

[0053] In combination with the third aspect or the fourth aspect, in a possible implementation manner, 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.

[0054] With reference to the third aspect or the fourth aspect, in a possible implementation manner, at least two columns of the matrix composed of the spreading sequences have the same elements.

[0055] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the spreading sequence is obtained based on the following two sequences:

[0056] [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];

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

[0058] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0059] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0060] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0061] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0062] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0063] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

[0064] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the mapping relationship between the data symbol and the spread spectrum sequence is as follows:

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

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

[0067] In a possible implementation manner, the memory is located within the communication device.

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

[0069] In a possible implementation, the communication device further includes a transceiver, wherein the transceiver is configured to receive signals and / or send signals. Exemplarily, the transceiver may be configured to send PPDUs, etc.

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

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

[0072] In a possible implementation manner, the memory is located within the communication device.

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

[0074] In a possible implementation, the communication device further includes a transceiver, and the transceiver is configured to receive signals and / or send signals. Exemplarily, the transceiver may be configured to receive PPDUs, etc.

[0075] In a seventh aspect, an embodiment of the present application provides a chip, wherein the communication device includes a logic circuit and an interface, and the logic circuit and the interface are coupled; the logic circuit is used to generate a PPDU based on a mapping relationship between data symbols and spread spectrum sequences; and the interface is used to output the PPDU.

[0076] In an eighth aspect, an embodiment of the present application provides a chip, wherein the communication device includes a logic circuit and an interface, and the logic circuit and the interface are coupled; the interface is used to input a PPDU; and the logic circuit is used to process the PPDU based on a mapping relationship between data symbols and spread spectrum sequences.

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

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

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

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

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

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

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

[0084] FIG1 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0085] FIG2 is a schematic diagram of the architecture of a communication system provided in an embodiment of the present application;

[0086] FIG3 is a flow chart of a PPDU-based communication method provided in an embodiment of the present application;

[0087] FIG4a is a schematic diagram of the structure of a PPDU provided in an embodiment of the present application;

[0088] FIG4 b is a schematic diagram of an O-QPSK modulation and spread spectrum process provided in an embodiment of the present application;

[0089] FIG4c is a schematic diagram of an O-QPSK modulation and spread spectrum process provided in an embodiment of the present application;

[0090] FIG5a is a schematic diagram of a mapping relationship between data symbols and spread spectrum sequences;

[0091] FIG5b is the Hamming distance of different spreading sequences in the mapping relationship shown in FIG5a;

[0092] FIG6 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0093] FIG7 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0094] FIG8 is a schematic structural diagram of a chip provided in an embodiment of the present application. DETAILED DESCRIPTION

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

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

[0097] References to "embodiments" herein mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it refer to independent or alternative embodiments that are mutually exclusive of other embodiments. It will be understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0098] In this application, "at least one (item)" means one or more, "more than one" means two or more, "at least two (items)" means two or three and more than three, and "and / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. "Or" means that two relationships can exist, such as only A exists, only B exists; when A and B are not mutually exclusive, it can also mean that three relationships exist, such as only A exists, only B exists, and A and B exist at the same time. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0099] The technical solutions provided in the embodiments of the present application can be applied to wireless personal area networks (WPANs) based on UWB technology. For example, the methods provided in the embodiments of the present application can be applied to the Institute of Electrical and Electronics Engineers (IEEE) 802.15 series 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, which are not listed here one by one. The technical solutions provided in the embodiments of the present application can also be applied to various communication systems, for example, the Internet of Things (IoT) system, the Vehicle to X (V2X) system, the Narrow Band Internet of Things (NB-IoT) system, devices in the Vehicle to X system, IoT nodes and sensors in the Internet of Things (IoT), smart cameras in smart homes, smart remote controls, smart water and electricity meters, and sensors in smart cities. The technical solution provided in the embodiments of the present application can also be applied to LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), universal mobile telecommunication system (UMTS), world-wide interoperability for microwave access (WiMAX) communication system, long term evolution (LTE) system, and can also be a fifth-generation (5G) communication system, a sixth-generation (6G) communication system, etc.

[0100] UWB technology is a novel wireless communication technology. It transmits data using nanosecond-scale, non-sinusoidal, narrow pulses. By modulating impulses with very steep rise and fall times, it occupies a wide spectrum, resulting in signals with bandwidths in the gigahertz range. The bandwidth used by UWB is typically above 1 GHz. Because UWB systems do not require the generation of sinusoidal carrier signals and can directly transmit impulse trains, they possess a wide spectrum and very low average power. UWB wireless communication systems offer advantages such as strong multipath resolution, low power consumption, and strong confidentiality, facilitating coexistence with other systems and improving spectrum utilization and system capacity. Furthermore, in short-range communication applications, the transmit power of UWB transmitters can typically be less than 1 mW (milliwatt). Theoretically, the interference generated by UWB signals is equivalent to broadband white noise. This facilitates good coexistence between ultra-wideband and existing narrowband communications. Consequently, UWB systems can operate simultaneously with narrowband (NB) communication systems without interfering with each other. The method provided in the embodiment of the present application can be implemented by a communication device in a wireless communication system. In a communication device, the one that implements the UWB system function can be called a UWB module, and the one that implements the narrowband communication system function can be called a narrowband communication module. The UWB module and the narrowband communication module can be different devices or chips, etc., and the embodiment of the present application does not limit this. Of course, the UWB module and the narrowband communication module can also be integrated on a device or chip. The embodiment of the present application does not limit the implementation of the UWB module and the narrowband communication module in the communication device. Exemplarily, the method provided in the embodiment of the present application can be implemented by a narrowband communication module. Optionally, a part of the method provided in the embodiment of the present application can be implemented by a narrowband communication module, and the other part can be implemented by a UWB module. Exemplarily, after obtaining the modulation symbol based on the mapping relationship provided in the embodiment of the present application, the modulation symbol can be sent by a UWB pulse, such as can be implemented by a UWB module. For example, after the information bits of the PPDU are mapped to the spread spectrum sequence based on the mapping relationship provided in the embodiment of the present application, BPSK modulation or QPSK modulation, etc. can be used, and then sent through UWB pulses. The embodiment of the present application does not limit the processing method outside the mapping relationship.

[0101] Although the embodiments of the present application are mainly described by taking WPAN as an example, especially the network applied to the IEEE 802.15 series standard as an example. It will be readily understood by those skilled in the art that the various aspects involved in the embodiments of the present application can be extended to other networks that adopt various standards or protocols. For example, wireless local area networks (WLAN), Bluetooth (BLUETOOTH), high performance wireless LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard, mainly used in Europe) and wide area networks (WAN) or other networks now known or developed later. Therefore, regardless of the coverage range and wireless access protocol used, the various aspects provided in the embodiments of the present application can be applied to any suitable wireless network.

[0102] The method provided in the embodiment of the present application can be implemented by a communication device in a wireless communication system. The communication device can be a device involved in a UWB system. For example, the 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, the communication device can include user equipment (UE), which 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 wireless modems, etc., which are not listed here one by one. For another example, the communication device can include a central control point, such as a personal area network (PAN) or a PAN coordinator, etc. The PAN coordinator or PAN can be a mobile phone, a vehicle-mounted device, a tag or a smart home, etc. For another example, the communication device can include a chip, which can be set in a communication server, a router, a switch or a terminal device, etc., which are not listed here one by one. 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.

[0103] As an example, Figures 1 and 2 are schematic diagrams of the architecture of a communication system provided in an embodiment of the present application. Figure 1 shows a star topology provided in an embodiment of the present application, and Figure 2 shows a point-to-point topology provided in an embodiment of the present application. As shown in Figure 1, in a star topology, a central control node can communicate data with one or more other devices. As shown in Figure 2, in a point-to-point topology, different devices can communicate data with each other. In Figures 1 and 2, both full-function devices and reduced-function devices can be understood as communication devices shown in the embodiments of the present application. The terms full-function devices and reduced-function devices are relative terms, for example, a reduced-function device may not be a PAN coordinator. For example, compared to a full-function device, a reduced-function device may not have coordination capabilities or may have a lower communication rate than a full-function device. It is understood that the PAN coordinator shown in Figure 2 is merely an example, and the other three full-function devices shown in Figure 2 can also serve as PAN coordinators, which are not shown one by one here.

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

[0105] It can be understood that the full-function device and low-function device shown in the embodiments of the present application are only examples of communication devices. Any communication device that can implement the PPDU-based communication method provided in the embodiments of the present application falls within the scope of protection of the embodiments of the present application.

[0106] Generally, narrowband signals used to assist UWB can be sent using offset quadrature phase shift keying (O-QPSK) modulation. To enhance system robustness, the four coded (or uncoded) information bits need to be mapped to a spread spectrum sequence before O-QPSK modulation. As a result, the receiving end uses the spread spectrum sequence to determine the transmitted information bits. Generally, when the four information bits are mapped to a spread spectrum sequence of a certain length, the minimum Hamming distance between any two spread spectrum sequences is less than L / 2, where L is the bit length of the spread spectrum sequence. However, the above minimum Hamming distance can be further improved.

[0107] In view of this, embodiments of the present application provide a PPDU-based communication method and apparatus that can effectively improve the minimum Hamming distance between spreading sequences. As an example, after receiving a PPDU, a receiving end can compare a sequence in the PPDU with a spreading sequence in a mapping relationship, and then determine the data symbol corresponding to the sequence based on 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 erroneous. Therefore, by increasing the minimum Hamming distance between spreading sequences, the probability of errors occurring when the receiving end identifies the sequence is reduced, thereby effectively improving the accuracy of the receiving end's sequence identification and improving system performance. Optionally, in the method provided in embodiments of the present application, each data symbol can have at least two fixed positions with fixed chip values. Since each data symbol can have at least two fixed positions with fixed chip values, these fixed chip values ​​can be used as pilot signals (pilot signals are generally known signals), allowing the receiving end to use these fixed chip values ​​for frequency offset estimation and compensation, thereby improving the system's frequency offset resistance.

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

[0109] For the description of the transmitter and receiver involved in the embodiments of this application, please refer to the description of Figures 1 and 2 above. The transmitter can be understood as a communication device that sends PPDUs, and the receiver can be understood as a communication device that receives PPDUs. Whether other forwarding devices are included between the transmitter and receiver is not limited in this embodiment of the application. Similarly, the functions or effects of the PPDU are not limited in this embodiment of the application.

[0110] FIG3 is a flow chart of a PPDU-based communication method provided in an embodiment of the present application. As shown in FIG3 , the method includes:

[0111] 301. The transmitting end generates a PPDU based on a mapping relationship between data symbols and spreading sequences.

[0112] 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 is a positive integer.

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

[0114] For example, in the embodiment of the present application, N can also be used to represent the number of different data symbols in the mapping relationship between data symbols and spread spectrum 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. For 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 understood as a limitation on the embodiment of the present application. For ease of description, the following takes the first length of 4 bits as an example, but it should not be understood as a limitation on the embodiment of the present application.

[0115] For example, if L = 32, the minimum Hamming distance is greater than or equal to 16. For another example, if L = 16, the minimum Hamming distance is greater than or equal to 8. For another example, if L = 8, the minimum Hamming distance is greater than or equal to 4. It will be understood that the value of L shown here is only an example, and in specific implementations, other lengths of spreading sequences may be involved (for example, L may be an even number or an odd number), and this embodiment of the present application is not limited to this.

[0116] Spread spectrum is a communication technology that spreads the spectrum of a transmitted signal to a wider bandwidth than its original bandwidth. Through spread spectrum, the original bandwidth of the PPDU can be effectively extended and the spectrum of the PPDU can be widened. The spread spectrum shown in the embodiment 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, the data symbols being obtained from 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, so the sequence of the second length shown in the embodiment of the present application can also be called a spread spectrum sequence. Of course, the sequence of the second length can also have other names, such as a pseudo-random sequence, a sequence of length L, a sequence of L chips or chip values, etc., which is not limited in the embodiment of the present application. It can be understood that the second length shown above is equal to L shown in the embodiment of the present application.

[0117] 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 a specific implementation, the transmitting end can also generate a PPDU based on the mapping relationship between information bits and spreading sequences. The following details the PPDU generation process.

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

[0119] Figure 4b is a schematic diagram of an O-QPSK modulation and spread spectrum process provided by an embodiment of the present application. As shown in Figure 4b, the information bits of the PPDU (also 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 mapped from data symbols to spread spectrum sequences (symbol-to-chip) (also referred to as spread spectrum), and then modulated by O-QPSK to output modulated symbols (modulated signal). That is, after the transmitting end obtains the information bits based on the structure of the PPDU, it can map the information bits to data symbols, such as mapping every 4 bits to one data symbol; then, based on the mapping relationship between the data symbols and the spread spectrum sequences, each data symbol is mapped to a different spread spectrum sequence; finally, O-QPSK modulation is performed to obtain a modulated symbol. Thus, the transmitting end can send the modulated symbols shown in Figure 4b.

[0120] Figure 4c is a schematic diagram of an O-QPSK modulation and spread spectrum process provided by an embodiment of the present application. As shown in Figure 4c, the information bits of the PPDU are mapped to a spreading sequence, then modulated by O-QPSK to output a modulated symbol (modulated signal). In other words, after the transmitter obtains the information bits based on the internal structure of the PPDU, it can map every four information bits to different spreading sequences based on the mapping relationship between the information bits and the spreading sequence, thereby performing O-QPSK modulation and transmitting the modulated symbols shown in Figure 4c.

[0121] In the flowcharts shown in Figures 4b and 4c, the code chip values ​​obtained based on the mapping relationship between data symbols and spread spectrum sequences or the mapping relationship between information bits and spread spectrum sequences can ensure that the formed signals are orthogonal after O-QPSK modulation, thereby supporting non-coherent demodulation at the receiving end with low complexity.

[0122] It should be noted that the data symbols shown in Figure 4b are different from orthogonal frequency division multiplexing (OFDM) symbols in wireless communication networks. The data symbols shown in the embodiment 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. In general, the mapping between data symbols and spread spectrum sequences can be understood as mapping the data symbols corresponding to every 4 bits (such as decimal) to a spread spectrum sequence containing L code chips. Of course, the relationship between the information bits of the first length and the data symbols shown in the embodiment 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 embodiment of the present application does not limit this.

[0123] It can be understood that based on the data symbols and the mapping relationship with the spread spectrum sequence (or the mapping relationship between the information bits and the spread spectrum sequence) provided in the embodiment of the present application, the code chip value of the spread spectrum sequence can also adopt other modulation methods, such as binary phase shift keying (BPSK) and QPSK. Optionally, the modulation symbols can be sent directly, or the modulation symbols can be carried by a group of UWB pulses and thus transmitted on the UWB channel. The group of UWB pulses shown here can be sent continuously or in segments, and the embodiment of the present application does not limit this. Furthermore, a protection interval can be reserved between each segment and between different modulation symbols, that is, no signal can be sent within the protection interval, thereby effectively avoiding interference between modulation symbols caused by multipath.

[0124] Based on Figures 4a to 4c, the generation of a PPDU as shown in the embodiments of the present application can also be understood as: the transmitter obtains the information bits of the PPDU, and then processes the information bits of the PPDU based on the mapping relationship between data symbols and spreading sequences and the information bits of the PPDU to obtain modulation symbols. The processing shown here can include at least one of the following: mapping information bits to data symbols, mapping data symbols to spreading sequences, and modulation. For example, the generation of the PPDU shown in step 301 can include generating modulation symbols for the PPDU.

[0125] The following examples illustrate the mapping relationship involved in the embodiments of this application. It is understood that the mapping relationship shown below is only an example.

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

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

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

[0129] Table 1

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

[0131] Table 2

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

[0133] As another example, Table 3 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 3 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.

[0134] Table 3

[0135] If the spreading sequences shown in Table 3 are recorded as The Hamming distance between the spreading sequences is shown in Table 4.

[0136] Table 4

[0137] As can be seen from Table 4, 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.

[0138] As another example, Table 5 shows a mapping relationship provided in an embodiment of the present application. Those skilled in the art can adapt the mapping relationship shown in Table 5 to a mapping relationship between information bits and spreading sequences. This embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or data symbols to spreading sequences. It can be understood that the minimum Hamming distance in Table 5 is 16, or alternatively, that the Hamming distance between spreading sequences is always 16.

[0139] Table 5

[0140] As another example, Table 6 shows a mapping relationship provided in an embodiment of the present application. Those skilled in the art can adapt the mapping relationship shown in Table 6 to a mapping relationship between information bits and spreading sequences. This embodiment of the present application does not limit whether the transmitting end maps information bits to spreading sequences or data symbols to spreading sequences. It can be understood that the minimum Hamming distance in Table 6 is 16, or alternatively, that the Hamming distance between spreading sequences is always 16.

[0141] Table 6

[0142] As another example, Table 7 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 7 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.

[0143] Table 7

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

[0145] Table 8

[0146] As can be seen from Table 8, 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 20, thereby preventing the Hamming distance between any two different spreading sequences from being too large or too small and affecting the Hamming distances between other spreading sequences.

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

[0148] Table 9

[0149] As another example, Table 10 shows a mapping relationship provided in an embodiment of the present application. Those skilled in the art can adapt the mapping relationship shown in Table 10 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.

[0150] Table 10

[0151] It is understandable that Tables 1 to 10 are only examples. For other mapping relationships or Hamming distances, please refer to the following text and will not be described in detail here.

[0152] 302. The transmitting end sends the PPDU, and correspondingly, the receiving end receives the PPDU.

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

[0154] Exemplarily, processing a PPDU at a receiving end 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 described above. Then, determining a first spreading sequence corresponding to the first sequence based on the N spreading sequences included in a mapping relationship between data symbols and the spreading sequences (such as Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10), where the first spreading sequence is one of the N spreading sequences, where N is a positive integer. Furthermore, determining the data symbol corresponding to the first spreading sequence based on the mapping relationship between the data symbol and the spreading sequence, and determining the information bit corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence. Of course, after determining the first spreading sequence, the receiving end may also determine the information bit corresponding to the first spreading sequence based on the mapping relationship between information bits and spreading sequences (refer to Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10 for adaptation). It is understood that the mapping relationships shown in Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10 may have other mapping relationships based on the five implementation methods shown below. The embodiments of the present application do not list them one by one, but the mapping relationships shown in Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10 should not be understood as limiting the embodiments of the present application. It is understood that the first sequence shown above is only an example. The receiving end processes other sequences in the PPDU in the same manner as the first sequence described above, and will not be described in detail here.

[0155] Exemplarily, processing the PPDU by the receiving end may further include: the receiving end demodulating the received sequence. For example, if the transmitting end modulates using O-QPSK, the receiving end may demodulate based on O-QPSK. For another example, if the transmitting end modulates using BPSK, the receiving end may demodulate based on BPSK. For another example, if the transmitting end modulates using QPSK, the receiving end may demodulate based on QPSK. This embodiment of the present application does not limit other methods of processing the PPDU by the receiving end.

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

[0157] Compared with the mapping relationship shown in FIG5a, the minimum Hamming distance in the mapping relationship provided in the embodiment of the present application is greater than the minimum Hamming distance shown in FIG5a. The Hamming distances of different spread spectrum sequences in the mapping relationship shown in FIG5a can be shown in FIG5b, where the minimum Hamming distance is 12. In the mapping relationship shown in FIG5a, the Hamming distances between different spread spectrum sequences are between 12 and 20. By sacrificing the Hamming distance, the autocorrelation characteristics between different spread spectrum sequences are ensured, resulting in a higher bit error rate at the receiving end. However, the mapping relationship provided in the embodiment of the present application, while ensuring the autocorrelation characteristics between different spread spectrum sequences, effectively improves the minimum Hamming distance, thereby effectively reducing the probability of the receiving end misjudging the information bit, reducing the bit error rate of the receiving end, ensuring the reliability of communication between the communicating parties, and improving system performance.

[0158] The mapping relationship provided in the embodiments of the present application is described in detail below.

[0159] It should be noted that the design process of each spread spectrum sequence shown below is only an example. Optionally, each spread spectrum sequence can be pre-defined by a standard, or a preset sequence, etc. That is, each spread spectrum sequence shown in the embodiment of the present application is not necessarily implemented by the steps shown below (such as formula (1) to formula (6), etc.). For example, the mapping relationship between the spread spectrum sequence and the information bit, or the mapping relationship between the spread spectrum sequence and the data symbol can refer to Table 1, Table 3, Table 5, Table 6, Table 7, Table 9 or Table 10, etc. For example, in actual applications, the communicating parties can interact by saving the mapping relationship between the information bit and the spread spectrum sequence or the mapping relationship between the data symbol and the spread spectrum sequence. The method of determining the spread spectrum sequence as shown below may not exist, but the method shown in Figure 3 is performed by saving the mapping relationship between the information bit and the spread spectrum sequence or the mapping relationship between the data symbol and the spread spectrum sequence. Therefore, any PPDU that can be generated according to the mapping relationship between information bits and spread spectrum sequences or the mapping relationship between data symbols and spread spectrum sequences shown in the embodiments of the present application, and the minimum Hamming distance between spread spectrum sequences is greater than or equal to L / 2, falls within the protection scope of the embodiments of the present application.

[0160] Implementation method 1:

[0161] set up is a sequence of length 8, each element s in the sequence i =1 / -1, and its periodic autocorrelation function is defined as:

[0162] 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 when i+τ is divided by 8. Then (8-R s (τ)) / 2 is equal to the sequence and The Hamming distance between sequences after circular shift τ. 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 circular sequences are as follows in 14 cases, as shown in Table 11.

[0163] Table 11

[0164] Let the four sequences of length 8 composed of 1 and -1 be respectively: and 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 bits respectively to obtain 8 sequences of length 32, and then take the opposite of the values on the even (or odd) bits of the sequences obtained by this circular shift to obtain another eight sequences, denoted by to represent 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):

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

[0166] Among them, τ = |i - j|, then the Hamming distances between different sequences are as shown in Table 12 below (i < j). It can be understood that since the Hamming distance when i < j is symmetric to the Hamming distance when i > j, Table 12 only exemplarily shows the Hamming distance when i < j.

[0167] Table 12

[0168] In Table 12, the Hamming distance of can satisfy formula (3) and formula (4): A(τ) = (32 - R a (τ) - Rb (τ)-R c (τ)-R d (τ)) / 2 (3) B(τ)=(32-R a (τ)+R b (τ)-R c (τ)+R d (τ)) / 2 (4)

[0169] Therefore, in order to make the Hamming distance between different sequences as large as possible, as a possible implementation method, R b (τ)+R d (τ)=0,forτ≠0,while R a (τ)+R c (τ) is as small as possible. According to the distribution of Hamming distance between cyclic sequences in Table 11, the sequence and The Hamming distance of the cyclic sequence with itself should belong to the case where the sum of the Hamming distances in Table 11 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 sequence and It can be obtained based on any of the following formulas:

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

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

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

[0173] sequence and It can be shown as any one of formulas (5) to (7), or it can be obtained by performing a cyclic shift, a negation operation, or a reverse operation based on any one of formulas (5) to (7). Since the cyclic shift, the negation operation, or the reverse operation does not affect the autocorrelation of the sequence, and the embodiment of the present application focuses on the sum of the autocorrelations of the two sequences, the cyclic shift, negation, and exchange of any one of the sequences shown in formulas (5) to (7) do not affect the Hamming distance.

[0174] It is understood that the present embodiment of the present application is for sequence and There is no limitation on which one of formula (5), formula (6) or formula (7) is used.

[0175] According to the distribution of Hamming distances between cyclic sequences in Table 11, the sequence and The Hamming distance of the cyclic sequence with itself should belong to the case with a larger Hamming distance in Table 11, such as case 8, case 10 or case 14. and It can be obtained based on any of the following formulas (8), such as the sequence and Two different sequences may be selected from the three sequences shown in formula (8), or sequences may be obtained by performing cyclic shift, inversion operation, or reverse operation on two of the three sequences shown in formula (8).

[0176] Based on formula (5) to formula (8), the sequence is obtained and sequence and Afterwards, we can get the sequence Then, the sequence 8 sequences of length 32 are obtained by cyclic shifting 0, 4, 8, 12, 16, 20, 24, and 28 bits respectively. Then, the values ​​of the even bits (or odd bits) of the cyclic shifted sequences are inverted to obtain another 8 sequences. The Hamming distance between any two different sequences is 16, 18, or 20, that is, the minimum Hamming distance is 16.

[0177] For example, (The first sequence in formula (8) is cyclically shifted right by 1 bit), (The first sequence in formula (5) is cyclically shifted to the left by 2 bits), (The third sequence in formula (8) is obtained by cyclically shifting 4 bits to the right and then performing the reverse operation) (The second sequence in formula (5) is cyclically shifted 1 bit to the right), then the 16 sequences The following matrix M1 is constructed.

[0178] Replacing -1 in the above matrix M1 or the matrix (-M1) (i.e., inverting the matrix M1 as a whole) with 1 and 1 with 0 can be used as a mapping relationship of 16 information bits of length 4 to a spread spectrum sequence, or as a mapping relationship of 16 data symbols to a spread spectrum sequence of length 32, as shown in Table 1 above. The Hamming distance between different spread spectrum sequences can be referred to Table 2 above, which will not be repeated here. Of course, the -1 in the matrix can also be replaced with 0, and this is not limited to the embodiments of the present application. It is understandable that if each element in the matrix M1 is denoted as m and each element in the spread spectrum sequence of length 32 is denoted as m', then each element in the matrix M1 can also be operated as follows to obtain 16 spread spectrum sequences of length 32: m'=(m+1) / 2 or m'=(1-m) / 2. It is understandable that the following description of the replacement also applies.

[0179] It should be noted that, for the matrix M1 shown in formula (9), each row of the matrix M1 can correspond to one data symbol, and there are 16 rows in total, thus corresponding to 16 data symbols. Therefore, after replacing -1 in the matrix M1 with 0 and 1 with 0, the mapping relationship shown in Table 1 can be obtained. Therefore, the sequences shown in the embodiment of the present application (such as the four sequences shown above) and The number of ) (or the length of the sequence) may be related to the number of different data symbols and the length of the spread spectrum sequence. However, any mapping relationship obtained based on the above rules falls within the scope of protection of the embodiments of the present application. For this description, the following also applies.

[0180] For example, (the first sequence in formula (8) is reversed),

[0181] (The second sequence in formula (6) is cyclically shifted to the left by 1 bit),

[0182] (The third sequence in formula (8) is cyclically shifted 3 bits to the right),

[0183] and (The first sequence in formula (6) is cyclically shifted 4 bits to the right), then the 16 sequences The following matrix M2 is constructed.

[0184] By replacing -1 with 1 and 1 with 0 in the above matrix M2 or matrix (-M2) (i.e., inverting the entire matrix M2), the mapping relationship of 16 information bits of length 4 to spreading sequences, or the mapping relationship of 16 data symbols to spreading sequences of length 32, can be obtained, as shown in Table 3 above. The Hamming distances between different spreading sequences can be referred to in Table 4 above and are not repeated here.

[0185] In the mapping relationship shown in the embodiment 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 value when the Hamming distances between different spreading sequences are added together is the largest, effectively reducing the bit error rate at the receiving end.

[0186] As another possible implementation, R b (τ)+R d (τ)=0,forτ≠0,while R a (τ)+R c (τ)=0,forτ≠0,at this time, any two sequences and The Hamming distance is equal to 16, and the signals formed by the spread spectrum sequence after O-QPSK modulation are orthogonal, which can support non-coherent reception (or non-correlated demodulation). and It can be any pair of sequences in formulas (5), (6) and (7). and It can also be any pair of the three sequences in formulas (5), (6) and (7).

[0187] Since cyclic shift, inversion operation and reverse operation do not affect the autocorrelation of the sequence, the sequence can be and Perform at least one of the following: cyclic shift, reverse, negate, or swap and It does not affect the Hamming distance and the orthogonality after O-QPSK modulation. and Perform at least one of the following: circular shift, reverse, negate, or swap and It also does not affect the Hamming distance and the orthogonality after O-QPSK modulation.

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

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

[0190] Replacing -1 with 1 and 1 with 0 in the above matrix M3 or matrix (-M3) (i.e., inverting the matrix M3 as a whole) can be used as a mapping relationship between 16 information bits of length 4 and a spreading sequence, or as a mapping relationship between 16 data symbols and a spreading sequence of length 32, as shown in Table 5 above.

[0191] It is understandable that the matrices shown in the first implementation are merely examples, and other mapping relationships may also be included based on the method shown above, which are not listed here one by one.

[0192] In the mapping relationship shown in the embodiment of the present application, the Hamming distance between different spread spectrum sequences is 16, so that the signals formed by the spread spectrum sequences after O-QPSK modulation are orthogonal to each other, which can support non-coherent demodulation at the receiving end and reduce the complexity of demodulation at the receiving end.

[0193] The mapping relationship shown in the embodiment of the present application can ensure the autocorrelation characteristics between different spread spectrum sequences while effectively improving the minimum Hamming distance, reducing the bit error rate at the receiving end, and improving system performance.

[0194] Implementation method 2:

[0195] In mathematics, a Hadamard matrix is ​​a square matrix where each element is either +1 or -1, each row is orthogonal to each other, and each column is also orthogonal to each other. The n*n order Hadamard matrix H satisfies HH T =nI n , here I n is an n*n-order identity matrix. Since all rows of the Hadamard matrix are orthogonal to each other, the Hamming distance between different rows is n / 2.

[0196] Therefore, in the mapping matrix M with 16 rows and 32 columns composed of 16 spread spectrum sequences of length 32 involved in the embodiment of the present application, the odd columns can be composed of a 16*16 Hadamard matrix, and the even columns can also be composed of a 16*16 Hadamard matrix. At the same time, each row in the matrix composed of odd columns constitutes a Gray complementary pair sequence with each row in the matrix composed of even columns. In this way, the following effects can be achieved: 1. The Hamming distance between any two different sequences is 16; 2. The different symbols after O-QPSK modulation are orthogonal, and can support non-coherent demodulation; 3. Each data symbol has two fixed position code chip values ​​that are fixed. The receiving end can use the fixed code chip value to perform frequency offset estimation and compensation, thereby improving the system's anti-frequency offset capability; 4. The modulated symbol has a low peak to average power ratio (PAPR), and the Gray sequence PAPR is not greater than 3dB.

[0197] For example, the element in the rth row and cth column of the above Hadamard matrix can satisfy formula (12):

[0198] Here, bitget(x,n) equals the value of the nth bit in the binary representation of x, and K is a parameter in the range of 0-15. Different K values ​​generate different Hadamard matrices. Therefore, by selecting two different K values, we can construct the even and odd columns in the mapping matrix.

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

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

[0201] The mapping relationship shown in the embodiment of the present application can ensure the autocorrelation characteristics between different spreading sequences while ensuring that the Hamming distance between the spreading sequences corresponding to different data symbols is 16, which can effectively improve system performance. In addition, each data symbol has at least two fixed chip values ​​at fixed positions. Since each data symbol can have at least two fixed chip values ​​at fixed positions, 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, thereby improving the system's ability to resist frequency offset.

[0202] Implementation method three:

[0203] m1 = [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 1 0 0 1 1 1 0 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 0 0 0 0 1] are two m-sequences of length 31. By performing element-wise XOR on m2 and the sequence of m1 after cyclic shift by i positions, the Gold sequence gi is obtained, where i = 0, 1, 2, …, 30, as shown in Table 13.

[0204] Table 13

[0205] Randomly select 16 of the 31 Gold sequences shown in Table 13 (repeated selection is allowed), perform cyclic shifts on the selected sequences (the number of cyclic shifts can vary), and append a column of elements (e.g., append to the first column of M) to the selected 16 sequences. Then, by trying different sequence selections, cyclic shifts of each sequence, and appended elements, search for the set of sequences with the largest Hamming distance, resulting in the mapping relationship shown in Table 7 above. For example, sequences that meet the conditions can be searched by setting the minimum and maximum values ​​of the Hamming distance, thereby obtaining a 16-row, 32-column matrix, and further obtaining the mapping relationship. For example, the minimum value of the Hamming distance can be 16, and the maximum value can be 20. For another example, the minimum value of the Hamming distance can be 16, and the maximum value can be 18. For example, the following matrix M5 can be constructed based on the above method. The Hamming distances between different spreading sequences can be as shown in Table 8 above.

[0206] It can be understood that the matrix obtained based on the above-mentioned Gold sequence and Hamming distance can be used as a mapping relationship between 16 data symbols and spread spectrum sequences. The columns in Table 7 can also be rearranged or some columns are inverted, or the rows in Table 7 are arranged to form a new mapping relationship. This new mapping relationship can also be used as a mapping table relationship between 16 data symbols and spread spectrum sequences.

[0207] In the mapping relationship shown in the embodiment 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, so that 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.

[0208] Implementation method 4:

[0209] For reference implementation method 1, assume that two sequences of length 8 consisting of 1 and -1 are: and Use these four sequences to evenly splice together to form a sequence of length 16 Sequence 8 sequences of length 16 are obtained by cyclic shifting 0, 2, 4, 6, 8, 10, 12, and 14 respectively. Then, the values ​​of the even bits (or odd bits) of the 8 sequences obtained by cyclic shift are inverted to obtain another 8 sequences. Indicates the 16 sequences. and You can choose any two sequences from the three sequences shown in formula (8), or you can choose a sequence that is cyclically shifted, inverted, or reversed. Alternatively, you can also understand it as a sequence and It is obtained based on any two of the three sequences shown in formula (8).

[0210] For example, Then the 16 sequences form the following mapping matrix M6.

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

[0212] The mapping relationship shown in the embodiment of the present application can ensure the autocorrelation characteristics between different spread spectrum sequences while effectively improving the minimum Hamming distance, reducing the bit error rate at the receiving end, and improving system performance.

[0213] Implementation method 5:

[0214] Referring to the second implementation method, when n=8, an 8-row and 8-column Hadamard matrix can be obtained, as shown below:

[0215] Therefore, we can select the 8*8 Hadamard matrix H as shown in the above formula, or we can rearrange the columns of H or invert some of the columns, or arrange the rows in H to construct a mapping matrix from 16 data symbols to a spreading sequence of length 8, as shown in formula (13):

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

[0217] In the mapping relationship shown in the embodiment of the present application, the Hamming distance between the spread spectrum sequences corresponding to different data symbols is 16, which can effectively improve system performance. In addition, each data symbol has two fixed chip values ​​at fixed positions. Therefore, the receiver can use these fixed chip values ​​to estimate and compensate for frequency offset, improving the system's ability to resist frequency offset.

[0218] It can be understood that in the various embodiments shown above, where one embodiment is not described in detail, reference can be made to other embodiments.

[0219] The following describes a communication device according to an embodiment of the present application.

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

[0221] FIG6 is a schematic structural diagram of a communication device provided in an embodiment of the present application. As shown in FIG6 , the communication device includes a processing unit 601 and a transceiver unit 602 .

[0222] In some embodiments of the present application, the communication device may be the transmitting end or chip shown above, and the chip may be provided 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.

[0223] The 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); the transceiver unit 602 is configured to output the PPDU.

[0224] It is understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are merely examples. For the specific functions or execution steps of the transceiver unit and the processing unit, reference can be made to the above-mentioned method embodiments and will not be described in detail here. For example, the processing unit 601 can be used to execute step 301 shown in Figure 3. The transceiver unit 602 can be used to execute the sending step in step 302 shown in Figure 3.

[0225] Reusing Figure 6, in some other embodiments of the present application, the communication device may be the receiving end or chip shown above, and the chip may be provided 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.

[0226] For example, the transceiver unit 602 is configured to input the 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).

[0227] For example, the processing unit 601 is specifically used to obtain a first sequence in the PPDU; and determine a first spreading sequence corresponding to the first sequence according to the N spreading sequences included in the above mapping relationship; and determine a data symbol corresponding to the first spreading sequence based on the above mapping relationship; and determine an information bit corresponding to the first spreading sequence based on the data symbol corresponding to the first spreading sequence.

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

[0229] It is understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are merely examples. For the specific functions or execution steps of the transceiver unit and the processing unit, reference can be made to the above-described method embodiments and will not be described in detail here. For example, the transceiver unit 602 can also be used to perform the receiving step in step 302 shown in Figure 3. The processing unit 601 can also be used to perform step 303 shown in Figure 3.

[0230] As a possible implementation manner, each of the above-mentioned communication devices may include a storage unit, and the storage unit may be used to store the various mapping relationships shown above.

[0231] In the above embodiments, the description of PPDU, mapping relationship, minimum Hamming distance, etc. can also be referred to the introduction in the above method embodiment, and will not be described in detail here.

[0232] It can be understood that the division method shown above is only an example. The division method for the transmitting end (or a chip set at the transmitting end) and the receiving end (or a chip set at the receiving end) can also be as follows: the transmitting end may include a generating unit and a transmitting 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 the modulation symbols), 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 are not listed one by one here.

[0233] The first communication device and the second communication device of the embodiment of the present application are described above. The following describes possible product forms of the first communication device and the second communication device. It should be understood that any product having the functions of the first communication device described in FIG6 above, or any product having the functions of the second communication device described in FIG6 above, falls within the scope of protection of the embodiment of the present application. It should also be understood that the following description is for illustrative purposes only and does not limit the product forms of the first communication device and the second communication device of the embodiment of the present application to these.

[0234] In one possible implementation, in the communication device shown in FIG6 , the processing unit 601 may be one or more processors, the transceiver unit 602 may be a transceiver, or the transceiver unit 602 may be a transmitting unit and a receiving unit, the transmitting unit may be a transmitter, the receiving unit may be a receiver, and the transmitting unit and the receiving unit are integrated into one device, such as a transceiver. In the embodiment of the present application, the processor and the transceiver may be coupled, etc., and the embodiment of the present application does not limit the connection method between the processor and the transceiver. In the process of executing the above method, the process of sending information (such as sending 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 so that it is transmitted by the transceiver. After being output by the processor, the above information may also need to undergo other processing before reaching the transceiver. Similarly, the process of receiving information (such as receiving PPDU) in the above method can be understood as the process of the processor receiving the input information. When the processor receives the input information, the transceiver receives the above information and inputs it into the processor. Furthermore, after the transceiver receives the above information, the above information may need to be processed further before being input into the processor.

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

[0236] Exemplarily, when the communication device is used to execute the steps, methods, or functions performed by the above-mentioned transmitting end, the processor 720 is used to generate a PPDU based on the mapping relationship between data symbols and spread spectrum sequences (or the mapping relationship between information bits and spread spectrum sequences); the transceiver 710 is used to send the PPDU.

[0237] Exemplarily, when the communication device is used to execute the steps, methods, or functions performed by the above-mentioned receiving end, the transceiver 710 is used to receive the PPDU from the transmitting end; the processor 720 is used to process the PPDU based on the mapping relationship between data symbols and spread spectrum sequences (or the mapping relationship between information bits and spread spectrum sequences).

[0238] In the embodiments of the present application, for descriptions of PPDU, mapping relationship, minimum Hamming distance, etc., please refer to the introduction in the above method embodiments, and will not be described in detail here.

[0239] It is understandable that for the specific description of the processor and the transceiver, reference can be made to the introduction of the processing unit and the transceiver unit shown in FIG6 , which will not be repeated here.

[0240] In various implementations of the communication device shown in FIG7 , the transceiver may include a receiver and a transmitter, wherein the receiver is configured to perform a receiving function (or operation) and the transmitter is configured to perform a transmitting function (or operation). The transceiver is configured to communicate with other devices / devices via a transmission medium.

[0241] 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 embodiment of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms, and is used for information exchange between devices, units or modules. The processor 720 may operate in conjunction with the memory 730. The processor 720 may execute program instructions stored in the memory 730. Optionally, at least one of the above-mentioned 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 embodiment of the present application.

[0242] The specific connection medium between the transceiver 710, processor 720, and memory 730 is not limited in the embodiments of the present application. In Figure 7, the memory 730, processor 720, and transceiver 710 are connected via a bus 740. The bus is represented by a bold line in Figure 7. The connection methods between other components are merely schematic and are not limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, Figure 7 only uses a single bold line, but this does not mean that there is only one bus or only one type of bus.

[0243] In the embodiments of the present application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., and may implement or execute the 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 methods disclosed in the embodiments of the present application may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor, etc.

[0244] In the embodiment of the present application, memory may include but is not limited to non-volatile memories such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM) or portable read-only memory (CD-ROM), etc. 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 embodiment of the present application can also be a circuit or other arbitrarily capable of realizing a storage function, for storing program instructions and / or data.

[0245] Illustratively, the processor 720 is primarily used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data. The memory 730 is primarily used to store software programs and data. The transceiver 710 may include a control circuit and an antenna. The control circuit is primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. The antenna is primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices, such as a touch screen, display, and keyboard, are primarily used to receive user input and output data to the user.

[0246] When 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 sent wirelessly, the processor 720 performs baseband processing on the data to be sent and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then transmits the radio frequency signal to the outside 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.

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

[0248] It is understood that the communication device shown in the embodiment of the present application may also have more components than those in FIG7 , and the embodiment of the present application is not limited thereto. The method performed by the processor and transceiver shown above is only an example, and the specific steps performed by the processor and transceiver can refer to the method described above.

[0249] In another possible implementation, in the communication device shown in FIG6 , the processing unit 601 may be one or more logic circuits, and the transceiver unit 602 may be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver unit 602 may be a transmitting unit and a receiving unit, the transmitting unit may be an output interface, the receiving unit may be an input interface, and the transmitting unit and the receiving unit may be integrated into one unit, such as an input / output interface. As shown in FIG8 , the communication device shown in FIG8 includes a logic circuit 801 and an interface 802. That is, the processing unit 601 may be implemented using a logic circuit 801, and the transceiver unit 602 may be implemented using an interface 802. 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. For example, FIG8 is illustrated using the communication device as a chip, and the chip includes a logic circuit 801 and an interface 802. It is understood that the chip shown in the embodiment of the present application may include a narrowband chip or an ultra-wideband chip, etc., and the embodiment of the present application is not limited thereto. The step of sending UWB pulses as shown above can be performed by the ultra-wideband chip, and whether the remaining steps are performed by the ultra-wideband chip is not limited in the embodiment of the present application.

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

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

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

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

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

[0255] In the above embodiments, the description of PPDU, mapping relationship, minimum Hamming distance, etc. can also be referred to the introduction in the above method embodiment, and will not be described in detail here.

[0256] For the specific implementation of each embodiment shown in FIG8 , reference may also be made to the above embodiments, which will not be described in detail here.

[0257] The present application also provides a wireless communication system including a transmitter and a receiver, which can be used to perform the method described in any of the aforementioned embodiments (e.g., FIG3 ). Alternatively, the transmitter and the receiver can refer to the communication devices shown in FIG6 to FIG8 .

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

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

[0260] The present application also provides a computer-readable storage medium, which stores computer code. When the computer code runs on a computer, the computer executes the operations and / or processing performed by the sending end in the method provided by the present application.

[0261] The present application also provides a computer-readable storage medium, which stores computer code. When the computer code runs on a computer, the computer executes the operations and / or processing performed by the receiving end in the method provided by the present application.

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

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

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

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

[0266] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0267] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or 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, and the computer software product is stored in a readable storage medium, including a number of instructions for enabling 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 method described in each embodiment of the present application. The aforementioned readable storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, and other media that can store program code.

[0268] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A communication method based on physical layer protocol data unit PPDU, characterized in that: The method comprises: Generate 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, 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 between any two different spreading sequences; Send the PPDU.

2. A communication method for a physical layer protocol data unit (PPDU), characterized in that: The method comprises: Receive PPDU; The PPDU is processed 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, 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 between any two different spreading sequences.

3. The method according to claim 2, characterized in that The processing of the PPDU based on the mapping relationship between the data symbols and the spreading sequence includes: Obtain 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 a data symbol corresponding to the first spreading sequence based on a mapping relationship between the data symbol and the spreading sequence; Information bits corresponding to the first spreading sequence are determined based on data symbols corresponding to the first spreading sequence.

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

5. The method according to any one of claims 1 to 4, 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].

6. The method according to any one of claims 1 to 5, 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] 7. The method according to any one of claims 1 to 4, 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.

8. The method according to claim 7, characterized in that In the matrix composed of the spreading sequences, at least two columns have the same elements.

9. The method according to any one of claims 1 to 4, 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]。 10. The method according to claim 5 or 6, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

11. The method according to claim 5 or 6, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

12. The method according to claim 5 or 6, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

13. The method according to claim 7, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

14. The method according to claim 9, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

15. The method according to any one of claims 1 to 4, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

16. The method according to any one of claims 1 to 4, characterized in that The mapping relationship between the data symbols and the spread spectrum sequence is as follows:

17. A communication device, characterized in that: The device comprises: a processing unit, configured to generate 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, 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 between any two different spreading sequences; The transceiver unit is configured to send the PPDU.

18. A communication device, characterized in that: The device comprises: A transceiver unit, configured to receive PPDU; a processing unit, configured to process the PPDU based on a mapping relationship between data symbols and spreading sequences, where a length of each spreading sequence is L and a minimum Hamming distance is greater than or equal to L / 2, where L is a positive integer, a bit length corresponding to the data symbol is less than a bit length of the spreading sequence, and the minimum Hamming distance represents a minimum Hamming distance between any two different spreading sequences.

19. The device according to claim 18, characterized in that The processing unit is specifically configured to obtain a first sequence in the PPDU, where a 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, where N is a positive integer; Determining a data symbol corresponding to the first spreading sequence based on a mapping relationship between the data symbol and the spreading sequence; Information bits corresponding to the first spreading sequence are determined based on data symbols corresponding to the first spreading sequence.

20. The device according to any one of claims 17 to 19, characterized in that L=32, or L=16, or L=8.

21. The device according to any one of claims 17 to 20, 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].

22. The device according to any one of claims 17 to 21, 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] 23. The device according to any one of claims 17 to 20, 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.

24. The device according to claim 23, characterized in that In the matrix composed of the spreading sequences, at least two columns have the same elements.

25. The device according to any one of claims 17 to 20, 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]。 26. A communication device, characterized in that: including processor and memory; The memory is used to store instructions; The processor is configured to execute the instructions so that the method according to any one of claims 1 to 16 is performed.

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

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

29. A communication system, characterized in that: The communication system includes a transmitting end and a receiving end, the transmitting end is used to execute the method as shown in any one of claims 1 and 4 to 16, and the receiving end is used to execute the method as shown in any one of claims 2 to 16.

Images