WO2023246526A1

WO2023246526A1 - Physical layer protocol data unit-based communication method and apparatus

Info

Publication number: WO2023246526A1
Application number: PCT/CN2023/099388
Authority: WO
Inventors: 刘辰辰; 钱彬
Original assignee: 华为技术有限公司
Priority date: 2022-06-25
Filing date: 2023-06-09
Publication date: 2023-12-28
Also published as: CN117335833A

Abstract

A PPDU-based communication method and apparatus, which can be applied to systems supporting 802.15 standards, such as wireless LAN systems based on 802.11 series protocols, for example, 802.15.4a, 802.15.4z or 802.15.4ab, for another example, 802.15.4a, 802.15.4z or 802.15.4ab next generation protocol, and for yet another example, 802.11be next generation and Wi-Fi 8, and can also be applied to UWB-based wireless personal area network systems, sensing systems and the like. A sending end generates a PPDU on the basis of a mapping relationship between data symbols and a spreading sequence, and sends the PPDU; accordingly, a receiving end receives the PPDU, and processes the PPDU on the basis of the mapping relationship; the minimum Hamming distance is related to the number of the data symbols and the length of the spreading sequence. By improving the minimum Hamming distance, the bit error rate is effectively reduced, and the receiving performance of the receiving end is improved.

Description

Communication method and device based on physical layer protocol data unit

This application claims priority to the Chinese patent application filed with the China Patent Office on June 25, 2022, with application number 202210728594.2 and the application title "Communication method and device based on physical layer protocol data unit", the entire content of which is incorporated by reference. in this application. This application claims priority to the Chinese patent application filed with the China Patent Office on July 8, 2022, with the application number 202210802161.7 and the application title "Communication method and device based on physical layer protocol data unit", the entire content of which is incorporated by reference. in this application.

Technical field

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 (PHY protocol data unit, PPDU).

Background technique

Ultra-wideband (UWB) technology is a wireless carrier communication technology that uses nanosecond-level non-sinusoidal narrow pulses to transmit data, so it occupies a wide spectrum range. Because its pulses are very narrow and the radiation spectrum density is extremely low, the UWB system has the advantages of strong multipath resolution, low power consumption, and strong confidentiality.

As UWB technology enters the civilian field, ultra-wideband wireless communication has become one of the popular physical layer technologies for short-distance, high-speed wireless networks. Since ultra-wideband technology does not require the use of carriers in traditional communication systems, it transmits PPDUs by sending and receiving extremely narrow pulses with nanoseconds or less, and modulates different information through pulse position and/or pulse polarity. Correspondingly, the receiving end can demodulate the PPDU based on the pulse position and/or pulse polarity it receives.

Therefore, ensuring the reception performance of the receiving end is an issue being studied by those skilled in the art.

Contents of the invention

Embodiments of the present application provide a PPDU-based communication method and device, which can effectively improve the receiving performance of the receiving end.

In a first aspect, embodiments of the present application provide a PPDU-based communication method. The method is applied to the sending end. The method includes: generating the PPDU based on the mapping relationship between data symbols and spreading sequences. The data The number of symbols is m, the length of the spread spectrum sequence is n, and the minimum Hamming distance is related to m and n. The minimum Hamming distance represents the smallest of the Hamming distances of any two different spread spectrum sequences. Hamming distance, the m and n are both positive integers; send the PPDU.

In the second aspect, embodiments of the present application provide a PPDU-based communication method. The method is applied to the receiving end. The method includes: receiving the PPDU; and processing the PPDU based on the mapping relationship between data symbols and spreading sequences. PPDU, the number of data symbols is m, the length of the spreading sequence is n, the minimum Hamming distance is related to m and n, and the minimum Hamming distance represents the difference between any two different spreading sequences. The smallest Hamming distance among Hamming distances, the m and n are both positive integers.

In the embodiments of the present application, in the mapping relationship between data symbols and spreading sequences, the minimum Hamming distance is related to the number of data symbols and the length of the spreading sequences, thereby effectively improving the fixed numerical value. The Hamming distance enables the sending end to determine the minimum Hamming distance based on m and n. For example, the sending end can increase the minimum Hamming distance based on the values of m and n. By increasing the minimum Hamming distance in the mapping relationship, the probability of the receiving end misjudging data symbols can be effectively reduced, thereby reducing the probability of the receiving end misjudging information bits, improving the receiving performance of the receiving end, and effectively ensuring the reliability of communication between both parties. , thereby improving system performance.

Combined with the second aspect, in a possible implementation, the mapping relationship between data symbols and spreading sequences is based on Processing the PPDU includes: obtaining the first sequence before demapping; determining the spreading sequence corresponding to the first sequence based on the mapping relationship, and determining the data bits corresponding to the first sequence.

In combination with the first aspect or the second aspect, in a possible implementation, the minimum Hamming distance is greater than or equal to

In the embodiment of this application, the minimum Hamming distance is greater than or equal to Therefore, the transmitting end can increase the minimum Hamming distance according to the values of m and n, further improving the minimum Hamming distance, effectively reducing the bit error rate, and improving the receiving performance of the receiving end.

In conjunction with the first aspect or the second aspect, in a possible implementation manner, the spreading sequence corresponds to at least two short bursts, and the number of pulses in the short bursts is related to the n.

In combination with 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 n.

Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is obtained based on the following matrix:

Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is obtained based on any of the following matrix M1:

In conjunction with the first aspect or the second aspect, in a possible implementation manner, obtaining the spreading sequence based on the matrix M1 includes: the spreading sequence is based on row rearrangement, column rearrangement, partial rearrangement of the matrix M1 Obtained by at least one operation in column negation.

Combined with the first aspect or the second aspect, in a possible implementation manner, the mapping relationship is as follows:

Among them, g0 and g1 each represent one data bit.

Combined with the first aspect or the second aspect, in a possible implementation, the spreading sequence is based on the following matrix M3 get:

H represents a Hadamard matrix with 8 rows and 8 columns.

In conjunction with the first aspect or the second aspect, in a possible implementation manner, obtaining the spreading sequence based on matrix M3 includes: the spreading sequence is based on row rearrangement, column rearrangement, and partial rearrangement of the matrix M3. Obtained by at least one operation in column negation.

Among them, g0, g1, g2 and g3 each represent one data bit.

or,

Among them, g1, g1, g2, and g3 respectively represent one data bit.

In a possible implementation, the spreading sequence is obtained based on the following sequence:

and

In a possible implementation, the spreading sequence is based on the sequence and the sequence Obtained by at least one operation in the negation and reverse order of .

In a possible implementation, the mapping relationship is as follows:

Among them, g0 and g1 each represent one data bit.

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

In a fourth aspect, embodiments of the present application provide a communication device for performing the method in the second aspect or any possible implementation of the second aspect. The communication device includes means for performing 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.

In a fifth aspect, embodiments of the present application provide a communication device. The communication device includes a processor, configured to execute the method shown in the above-mentioned first aspect or any possible implementation of the first aspect. Alternatively, the processor is configured to execute a program stored in the memory. When the program is executed, the method shown in the above first aspect or any possible implementation of the first aspect is executed.

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

In a possible implementation, the memory is located within the communication device.

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

In a possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive signals and/or send signals. For example, the transceiver can be used to send PPDU, etc.

In a sixth aspect, embodiments of the present application provide a communication device, which includes a processor configured to execute the method shown in the above second aspect or any possible implementation of the second aspect. Alternatively, the processor is configured to execute a program stored in the memory. When the program is executed, the method shown in the above second aspect or any possible implementation of the second aspect is executed.

In a possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive signals and/or send signals. For example, the transceiver can be used to receive PPDUs, etc.

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

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

In a ninth aspect, embodiments of the present application provide a computer-readable storage medium, which is used to store a computer program. When it is run on a computer, it enables any possibility of the first aspect or the first aspect mentioned above. The implementation shown in the method is executed.

In a tenth aspect, embodiments of the present application provide a computer-readable storage medium. The computer-readable storage medium is used to store a computer program. When it is run on a computer, it enables any possibility of the above second aspect or the second aspect. The implementation shown in the method is executed.

In an eleventh aspect, embodiments of the present application provide a computer program product. The computer program product includes a computer program or computer code (which may also be referred to as an instruction). When run on a computer, the computer program product causes the above first aspect or the third aspect. Any possible implementation of the method shown in one aspect is performed.

In a twelfth aspect, embodiments of the present application provide a computer program product. The computer program product includes a computer program or computer code (which may also be referred to as an instruction). When run on a computer, the computer program product causes the above second aspect or the third aspect to occur. Any possible implementation of the method shown in both aspects is performed.

In a thirteenth aspect, embodiments of the present application provide a computer program. When the computer program is run on a computer, the method shown in the above first aspect or any possible implementation of the first aspect is executed.

In a fourteenth aspect, embodiments of the present application provide a computer program. When the computer program is run on a computer, the method shown in the above second aspect or any possible implementation of the second aspect is executed.

In a fifteenth aspect, embodiments of the present application provide a communication system. The communication system includes a sending end and a receiving end. The sending end is configured to perform the above-mentioned first aspect or any possible implementation of the first aspect. Method, the receiving end is configured to perform the method shown in the above second aspect or any possible implementation of the second aspect.

Description of the drawings

Figure 1 is a schematic architectural diagram of a communication system provided by an embodiment of the present application;

Figure 2 is an architectural schematic diagram of a communication system provided by an embodiment of the present application;

Figure 3a is a schematic diagram of a method for processing PPDU provided by an embodiment of the present application;

Figure 3b is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 4 is a schematic diagram of a PPDU-based communication method provided by an embodiment of the present application;

Figure 5a is a schematic structural diagram of a PPDU provided by an embodiment of the present application;

Figure 5b is a schematic structural diagram of a convolutional code encoder provided by an embodiment of the present application;

Figure 5c is a schematic structural diagram of a scrambler provided by an embodiment of the present application;

Figure 5d is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 6 is a schematic diagram of an autocorrelation function provided by an embodiment of the present application;

Figure 7a is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 7b is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 8a is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 8b is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 9a is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 9b is a schematic diagram of a UWB pulse provided by an embodiment of the present application;

Figure 10 is a schematic structural diagram of a communication device provided by an embodiment of the present application;

Figure 11 is a schematic structural diagram of a communication device provided by an embodiment of the present application;

Figure 12 is a schematic structural diagram of a communication device provided by an embodiment of the present application.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described below in conjunction with the accompanying drawings.

The terms "first" and "second" in the description, claims, and drawings of this application are only used to distinguish different objects, but are not used to describe a specific sequence. Furthermore, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or equipment that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes unlisted steps or units, or optional It also includes other steps or units inherent to these processes, methods, products or equipment.

Reference herein to "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application. The appearances of this phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those skilled in the art will understand, both explicitly and implicitly, that the embodiments described herein may be combined with other embodiments.

In this application, "at least one (item)" means one or more, "plurality" means two or more, "at least two (items)" means two or three and three Above, "and/or" is used to describe the relationship between associated objects, indicating that there can be three relationships. For example, "A and/or B" can mean: only A exists, only B exists, and A and B exist simultaneously. In this case, A and B can be singular or plural. "Or" means that there can be two relationships, such as A and B; when A and B are not mutually exclusive, it can also mean that there are three relationships, such as only A, only B, or both A and B. The character "/" generally indicates that the related 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" ".

The technical solutions provided by the embodiments of this application can be applied to wireless personal area networks (WPAN) based on UWB technology. The method provided by the embodiments of this application may be applicable to the Institute of Electrical and Electronics Engineers (IEEE) 802.15 series protocols, such as the 802.15.4a protocol, 802.15.4z protocol or 802.15.4ab protocol, or a future generation UWB WPAN standards are medium and will not be listed here. The technical solutions provided by the embodiments of this application can also be applied to various communication systems, for example, they can be Internet of things (IoT) systems, vehicle to X (V2X), narrowband Internet of Things (narrow band internet of things, NB-IoT) system, used in devices in the Internet of Vehicles, IoT nodes, sensors, etc. in the Internet of Things (IoT, internet of things), smart cameras, smart remote controls, smart water meters and electricity meters in smart homes, and Sensors in smart cities wait. The technical solution provided by the embodiments of the present application can also be applied to LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), and universal mobile telecommunication system (UMTS). , Global interoperability for microwave access (WiMAX) communication system, long term evolution (LTE) system, it can also be the fifth generation (5th-generation, 5G) communication system, the sixth generation (6th) -generation, 6G) communication systems, etc.

UWB technology is a new type of wireless communication technology. It uses nanosecond-level non-sinusoidal narrow pulses to transmit data. By modulating the impulse pulses with very steep rise and fall times, it occupies a wide spectrum range, making the signal have a gigahertz (GHz) level. bandwidth. The bandwidth used by UWB is usually above 1GHz. Because the UWB system does not need to generate a sinusoidal carrier signal and can directly transmit impulse sequences, the UWB system has a wide spectrum and very low average power. The UWB wireless communication system has strong multipath resolution, low power consumption, and strong confidentiality. and other advantages, which is conducive to coexistence with other systems, thereby improving spectrum utilization and system capacity. In addition, in short-distance communication applications, the transmit power of UWB transmitters can usually be less than 1mW (milliwatt). Theoretically, the interference generated by UWB signals is only equivalent to a wideband white noise. This facilitates good coexistence between UWB and existing narrowband communications. Therefore, the UWB system can work simultaneously with the narrowband (NB) communication system without interfering with each other. The method provided by 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 functions of the UWB system can be called a UWB module, and the one that implements the functions of the narrowband communication system can be called a narrowband communication module. UWB The module and the narrowband communication module may be different devices or chips, etc., which are not limited in the embodiments of the present application. Of course, the UWB module and the narrowband communication module can also be integrated on one device or chip. The embodiments of the present application do not limit the implementation of the UWB module and the narrowband communication module in the communication device. For example, the method provided by the embodiment of the present application can be implemented using a narrowband communication module. Optionally, part of the method provided by the embodiments of this application can be implemented by the narrowband communication module, and the other part can be implemented by the UWB module. For example, after the modulation symbol is obtained based on the mapping relationship provided by the embodiment of the present application, the modulation symbol can be sent through UWB pulses, such as through a UWB module. For example, after the encoded bits of the PPDU are mapped to the spreading sequence based on the mapping relationship provided by the embodiment of the present application, the BPSK modulation method or QPSK modulation method can be used, and then transmitted through UWB pulses.

Although the embodiments of this application mainly take WPAN as an example, especially the network applied to the IEEE 802.15 series standards, as an example for explanation. Those skilled in the art can easily understand that various aspects involved in the embodiments of the present application can be extended to other networks using various standards or protocols. For example, Wireless Local Area Networks (WLAN), Bluetooth (BLUETOOTH), High Performance Wireless LAN (High Performance Radio LAN, HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard, mainly used in Europe) and WAN ( WAN) or other network now known or later developed. Therefore, regardless of the coverage and wireless access protocol used, the various aspects provided by the embodiments of the present application can be applied to any suitable wireless network.

The method provided by the embodiment of the present application can be implemented by a communication device in a wireless communication system. The communication device may be a device involved in a UWB system. For example, the communication device may include but is not limited to a communication server, router, switch, network bridge, computer, mobile phone, etc. For another example, the communication device may include user equipment (UE), which may 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 will not be listed here. For another example, the communication device may include a central control point, such as a personal area network (PAN) (also called a non-coordinator) or a PAN coordinator. The PAN coordinator or PAN can be a communication server, router, switch, bridge, smart home, mobile phone or tag, etc. For another example, the communication device may include a chip, and the chip may be installed in a communication server, a router, a switch, a network bridge, a smart home, a mobile phone, a tag, etc., which are not listed here. It can be understood that the above description about the communication device is also applicable on the sender and receiver shown below.

As an example, FIG. 1 and FIG. 2 are schematic architectural diagrams of a communication system provided by embodiments of the present application. Figure 1 is a star topology provided by an embodiment of the present application, and Figure 2 is a point-to-point topology provided by an embodiment of the present application. As shown in Figure 1, in a star topology, a central control node can communicate with one or more other devices. As shown in Figure 2, in a point-to-point topology, data communication can be carried out between different devices. In Figures 1 and 2, both full function device (full function device) and low function device (reduced function device) can be understood as the communication device shown in the embodiment of the present application. Among them, the full-function device and the low-function device are relative. For example, the low-function device may not be a PAN coordinator (coordinator). Another example is that compared with a full-function device, a low-function device may not have coordination capabilities or may have a lower communication rate than a full-function device. It can be understood that the PAN coordinator shown in Figure 2 is only an example. The other three full-function devices shown in Figure 2 can also serve as PAN coordinators, and will not be shown one by one here.

As an example, the sending end involved in the embodiment of this application can be a full-function device, and the receiving end can be a low-function device; or the sending end can be a low-function device, and the receiving end can be a full-function device; or the sending end and Both the receiving end can be a full-function device; or both the sending end and the receiving end can be a low-function device. As another example, the sending end can be a coordinator and the receiving end can be a non-coordinator; or the sending end can be a non-coordinator and the receiving end can be a coordinator; or both the sending end and the receiving end can be coordinators, etc., here No more listing them one by one.

It can be understood that the full-function devices and low-function devices shown in the embodiments of this application are only examples of communication devices. Any communication device that can implement the PPDU-based communication method provided in the embodiments of this application belongs to the embodiments of this application. scope of protection.

Generally speaking, before the sending end obtains the modulation symbols of the PPDU, the PPDU can obtain the modulation symbols through at least one of the following operations: channel coding, mapping, scrambling, and modulation. For example, FIG. 3a is a schematic diagram of a method for processing PPDU provided by an embodiment of the present application. As shown in Figure 3a, the information bits of the PPDU are channel-encoded to obtain the encoded bits of the PPDU. The encoded bits may also be called encoded information bits, or data bits, etc. This embodiment of the present application does not limit this. The coded bits can be mapped based on the mapping table, for example, the data bits are mapped to a spreading sequence (also called a chip) to obtain a mapped sequence. The mapped sequence is scrambled (of course, it may not be scrambled) to obtain a scrambled sequence. The scrambled sequence is modulated to obtain a modulation symbol, so that the transmitter can use the modulation symbol in the form of a UWB pulse. Send it out. Of course, the process of processing PPDU shown here is only an example. In a specific implementation, there may be more or fewer steps than those shown in Figure 3a, which is not limited by the embodiment of the present application.

The mapping table between data bits and spreading sequences can be shown in Table 1. In Table 1, the spreading sequence can correspond to two short bursts. Of course, burst can also have other translations, which are not limited in the embodiments of this application.

Table 1

Among them, g0 and g1 respectively represent one data bit. g0 and g1 in Table 1 can be understood as two data bits obtained through one information bit. The first short burst (first burst) and the second short burst (second burst) can be understood as the modulation symbols that the sender needs to send PPDU on short bursts.

Figure 3b is a schematic diagram of a UWB pulse provided by an embodiment of the present application. In Figure 3b, Tdsym represents the duration of sending a data symbol (date symbol), Tburst represents the duration of a short burst, and Tchip represents the duration of a chip. The data symbols can be understood as the data symbols corresponding to g0 and g1 in Figure 1, such as corresponding to 0 to 3 in sequence. In Figure 3b, each data symbol can use 8 pulses to carry two data bits. Each data bit occupies 4 pulses. Each group of 4 pulses is followed by a guard interval of 4 pulse lengths. No pulses are emitted. The reason for sending pulses in short bursts can be as follows: In a UWB-based system, the average transmit power of the transmitter is relatively small, such as lower than -41.3dBm/MHz, in order to be able to transmit over a certain distance, so the transmitter can The pulses are transmitted concentratedly for a small part of a continuous period of time to realize the transmission of PPDU with a low duty cycle.

It can be understood that the arrows in Figure 3b only represent the location of the pulses, and do not represent the positive and negative of each pulse. The two short bursts shown in Table 1 can correspond to a spreading sequence or 8 chip values.

In the mapping table shown in Table 1, the chip values corresponding to each short burst are the same, which facilitates demodulation at the receiving end. However, since the chip value corresponding to each short burst is the same, any two pulses out of the four pulses will be received incorrectly, resulting in the situation where the receiving end cannot demodulate correctly.

In view of this, embodiments of the present application provide a PPDU-based communication method and device, which can effectively improve the demodulation performance of the receiving end.

Figure 4 is a schematic diagram of a PPDU-based communication method provided by an embodiment of the present application, which can effectively improve the demodulation performance of the receiving end. For descriptions of the sending end and receiving end involved in the embodiment of this application, please refer to the above description of Figures 1 and 2. The sending end can be understood as the communication device that sends the PPDU, and the receiving end can be understood as the communication device that receives the PPDU. As for whether other forwarding devices are included between the sending end and the receiving end, this is not limited in the embodiment of the present application. Similarly, the embodiment of the present application does not limit the function or role of the PPDU. As shown in Figure 4, the method includes:

401. The transmitter generates a PPDU based on the mapping relationship between data symbols and spreading sequences.

Among them, the number of data symbols is m, the length of the spreading sequence is n, and the minimum Hamming distance is related to m and n. For example, the minimum Hamming distance is greater than or equal to m and n are both positive integers, Indicates rounding down. For example, m=4, n=8, the minimum Hamming distance is greater than or equal to 5; or, m=16, n=8, the minimum Hamming distance is greater than or equal to 4; or, m=4, n=16, The minimum Hamming distance is greater than or equal to 10; or, m=4, n=24, the minimum Hamming distance is greater than or equal to 16, etc., which will not be listed one by one here.

The minimum Hamming distance can be understood as the smallest Hamming distance of any two different spreading sequences involved in the mapping relationship between data symbols and spreading sequences; or, it can be understood as any two different data symbols. The smallest Hamming distance among the Hamming distances of the corresponding spreading sequence. The explanation of Hamming distance can be as follows: In information theory, the Hamming distance between two sequences of equal length is the number of different values at the corresponding positions of the two sequences. In other words, it is the number of sequence values that need to be replaced to transform one sequence into another sequence. For example: the Hamming distance between 1011101 and 1001001 is 2.

The mapping relationship between data symbols and spreading sequences can also be called: the mapping relationship between m data symbols and n chip values; or, the mapping relationship between data bits and spreading sequences; or, the mapping relationship between data bits The mapping relationship between chip values. For specific mapping relationships, please refer to Table 2 to Table 10, which will not be described in detail here. The data symbols are different from orthogonal frequency division multiplexing (OFDM) symbols in wireless communication networks. The data symbols shown in the embodiments of this application can be understood as the values when the data bits of the first length are mapped to decimal notation. For example, if the first length is 2 bits, the data symbol can be a value between 0 and 3. For another example, if the first length is 3 bits, the data symbol can be a value between 0 and 7. For another example, if the first length is 4 bits, the data symbol can be a value between 0 and 15. Of course, the relationship between the data bits of the first length and the data symbols shown in the embodiments of this application is only an example. For example, the data symbol can also be the value when the information bits of the first length are mapped to hexadecimal, or, The embodiment of the present application does not limit the numerical value when mapped to octal.

It should be noted that in practical applications, it is not necessary to convert between data bits and data symbols, but basically The PPDU is generated based on the mapping relationship between the data bits and the spreading sequence (that is, the mapping relationship between the data symbols and the spreading sequence). That is to say, in a specific implementation, data symbols may not exist, and of course data symbols may also exist, which is not limited in the embodiments of the present application.

The spreading shown in the embodiment of the present application can be understood as mapping data symbols to a spreading sequence including n elements (or mapping data bits of the first length to a spreading sequence, and the data symbols can be determined by the data bits) . After mapping the data symbols to the spreading sequence, the effect of extending the original bandwidth of the PPDU is achieved, so the above sequence including n elements is called a spreading sequence. In a UWB-based system, the average transmit power of the transmitter is relatively small. In order to be able to transmit over a certain distance, the transmitter can transmit pulses for a small part of the time in a continuous period of time to realize the transmission of PPDU with a low duty cycle. Thus, the spreading sequence can be transmitted in at least two short bursts. For example, the number of elements of each spreading sequence may be the same as the number of pulses sent in at least two corresponding short bursts. For example, the number of spreading sequences may be the same as the number of short bursts. Of course, the number of elements included in each spreading sequence may also be related to the modulation mode of the transmitter, such as the third implementation shown below. This is only an example and should not be understood as a limitation of the embodiments of the present application.

For example, FIG. 5a is a schematic structural diagram of a PPDU provided by an embodiment of the present application. The PPDU may include a synchronization header (SHR), a physical layer header (PHR), and a physical payload field (PHY payload field). For example, the synchronization header can be used to detect and synchronize PPDU; the physical layer header can be used to carry some physical layer indication information, such as modulation and coding information or PPDU length information, etc., to assist the receiving end in correctly demodulating the data; the physical bearer field is used to carry data. It can be understood that the PPDU shown in Figure 5a is only an example. With different functions of the PPDU, the structure of the PPDU may change. Therefore, the PPDU shown in Figure 5a should not be understood as limiting the embodiments of the present application.

After obtaining the information bits of the PPDU, the sending end can perform at least one of the following on the information bits of the PPDU: channel coding, mapping based on the mapping relationship, scrambling, and modulation. It can be understood that for the specific steps shown here, reference may be made to FIG. 3a or the following.

Exemplarily, FIG. 5b is a schematic structural diagram of a convolutional code encoder provided by an embodiment of the present application. The input in Figure 5b can be understood as one information bit, that is, after one information bit of PPDU is input to the convolutional code encoder, two data bits can be obtained, namely Where, x may represent the number of information bits of the PPDU. After the information bits of the PPDU are channel coded, the data bits of the PPDU can be obtained. The encoded output bits g ₀ ^(x) and g ₁ ^(x) using the convolutional code shown in Figure 5b are respectively mapped to at least two sets of pulses of the data symbols according to Table 2 to Table 10, and then all data symbols mapped The sequence is scrambled by the scrambler shown in Figure 5c. For example, the initial state of the scrambler is the first 15 bits of the binary sequence obtained by removing 0 from the ternary sequence in SHR and setting -1 to 0. Finally, a corresponding pulse signal is generated based on the scrambled result, 0 corresponds to a positive pulse, and 1 corresponds to a negative pulse. D in Figure 5b and Figure 5c represents a shift register, that is, delay (D). sj to sj-15 in Figure 5c respectively represent the status of the shift register. It can be understood that the convolutional code encoder shown in Figure 5b and the scrambler shown in Figure 5c are only examples, and should not be understood as limiting the embodiments of the present application.

Further, the transmitting end modulates the scrambled sequence to obtain the modulation symbol of the PPDU. For example, the transmitting end may adopt binary phase shift keying (BPSK) modulation or quadrature phase shift keying (Quadrature Phase Shift Keying, QPSK) modulation, etc., which are not limited in the embodiments of the present application.

As an example, the transmitting end can map every two data bits to a spreading sequence, in which case it can correspond to 4 data symbols; or the transmitting end can map every three data bits to a spreading sequence, such as Corresponding to 8 data symbols; alternatively, the transmitter can map every four data bits to a spreading sequence, such as corresponding to 16 data symbols, etc., which will not be listed here. For example, the length of each spreading sequence may be 8 bits, that is, it may include 8 chip values. Each spreading sequence may correspond to two short bursts, and each short burst may include four chip values. In this case, the transmitter can perform modulation through BPSK, that is, each bit is modulated to a constellation point and sent through eight pulses. As another example, each spread spectrum The length of the sequence can be 16 bits, that is, it includes 16 chip values. For example, each spreading sequence can correspond to two short bursts, and each short burst can include 8 chip values. In this case, the transmitter can modulate through QPSK, that is, every two bits are modulated to one constellation point. Therefore, the 16 bits of the spreading sequence can be modulated to 8 constellation points, and can still pass through eight Pulse sent. When the transmitting end maps the data bits of the first length to the spreading sequence, it can achieve backward compatibility as much as possible (such as being compatible with the transmission method shown in Figure 3b), ensuring that one data symbol can still pass through two short bursts. on the eight pulse positions to send.

As another example, each data symbol may correspond to a larger number of short bursts, and the number of pulses included in the short burst may be more or less, which is not limited in this embodiment of the present application.

The mapping of the data bits of the first length to the spreading sequence shown above can be implemented by any mapping table as shown below. For example, the above mapping relationship can be shown in Table 2:

Table 2

The relationship shown in Table 2 is only an example. For example, the mapping relationship between data bits and spreading sequences can be changed, and will not be listed one by one here. Of course, the first short burst shown in Table 2 can also be exchanged with the second short burst, which is not limited in the embodiment of the present application. c ₀ to c ₇ can be understood as the 8 chip values corresponding to each data symbol. It can be understood that the mapping relationship shown in Table 2 may include at least one of the following: a mapping relationship between data bits and spreading sequences, a mapping relationship between data symbols and spreading sequences, and a mapping between data bits and data symbols. relationship, the mapping relationship between spreading sequences and short bursts, etc. That is to say, in specific implementation, Table 2 can be modified according to actual needs, and Table 2 should not be understood as limiting the embodiments of the present application.

In Table 2, the minimum Hamming distance is 5. The larger the minimum Hamming distance, the lower the probability of misjudgment of data symbols at the receiving end, and thus the lower the bit error rate of demodulation at the receiving end. Therefore, the Hamming distance between any two data symbols is greater than or equal to 5, which can further improve the demodulation performance of the receiving end and improve the system performance.

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 3:

table 3

It is understandable that for the specific description of Table 3, you can also refer to Table 2, and will not be described in detail here. In the mapping relationship shown in Table 3, the side lobe of the sum of the autocorrelation functions of the first short burst and the second short burst is 0. The autocorrelation performance is good, which can effectively ensure the demodulation performance of the receiving end and reduce bit errors. Rate.

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 4:

Table 4

It can be understood that one data symbol in Table 2 and Table 3 can carry one information bit, while one data symbol in Table 4 can carry two information bits, thus improving the transmission rate.

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 5:

table 5

It can be understood that in Tables 2 to 4, if each short burst is sent by 4 pulses, modulation can be performed by BPSK. In Table 5, if each short burst still needs to be sent by 4 pulses, it can be modulated by QPSK. At the same time, each data symbol in Table 5 can carry two information bits, effectively improving transmission efficiency.

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 6:

Table 6

In Table 6, the minimum Hamming distance is 10, which increases the Hamming distance of different data symbols, can tolerate more transmission errors, improves the robustness of the system, and improves transmission efficiency. At the same time, each data symbol can be mapped to a spreading sequence of length 16. Each spreading sequence can correspond to two short bursts, which increases the number of pulses included in each short burst and reduces the transmission rate. This enables the receiving end to receive information with a low-complexity algorithm.

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 7:

Table 7

For example, the mapping relationship between data symbols and spreading sequences can be as shown in Table 8:

Table 8

In Table 7 and Table 8, each data symbol can be mapped to a spreading sequence of length 24, and each spreading sequence corresponds to three A short burst, thereby effectively increasing the number of pulses corresponding to one data symbol, reducing the transmission rate, and enabling the receiving end to receive information with a low-complexity algorithm.

It should be noted that Tables 2 to 8 are only examples. For other descriptions of the mapping relationship, please refer to Implementation Mode 1 to Implementation Mode 5 below. At the same time, the number of pulses corresponding to each spreading sequence in Table 2 to Table 8 is not limited in the embodiment of the present application. It can be understood that Tables 2 to 8 take 0 and 1 as examples. For example, the above 0 and 1 can also be replaced by 1 and -1, or any two different expressions, which are not limited in the embodiments of the present application. The description of the minimum Hamming distance from Table 2 to Table 8 can be found below.

402. The sending end sends a PPDU, and correspondingly, the receiving end receives the PPDU.

For example, the modulation method that can be used in the physical load field of PPDU can be slightly different according to the average pulse repetition frequency (pulse repetition frequency, PRF). The larger the average PRF, the more pulses can be transmitted in the same time, so that With greater transmission rate. Taking PRF equal to 249.6MHz as an example, since half of the duration of a data symbol does not send pulses, the duration of each pulse is about 2ns.

As an example, the transmitting end can send the modulation symbols of the PPDU through the pulse position as shown in Figure 3b, or can also send the modulation symbols of the PPDU through the pulse position as shown in Figure 5d. It should be noted that the arrow shown in Figure 5d only represents the pulse position and does not represent the sign of the pulse. For example, the sign of the pulse can be determined by the modulation information. For Figure 3b and Figure 5d, if the duration of a pulse is 2ns and one data symbol carries one information bit, the transmission rate of PPDU can be 1/(16*2ns)≈31.2Mbps. If the duration of a pulse is 2ns and one data symbol carries two information bits, the transmission rate of PPDU can be 2/(16*2ns)=62.5Mbps.

As another example, the transmitting end may transmit the modulation symbols of the PPDU through the pulse positions as shown in Figure 7a and Figure 7b. As yet another example, the transmitting end may transmit the modulation symbols of the PPDU through the pulse positions as shown in Figure 8a and Figure 8b. As yet another example, the transmitting end may transmit the modulation symbols of the PPDU through the pulse positions as shown in Figure 9a and Figure 9b. Please refer to the following for description of pulse position.

The transmission rate of PPDU can be related to the number of information bits carried by a data symbol, the duration of a pulse, and the number of pulses included in a short burst. The more information bits a data symbol carries, the fewer the number of pulses included in the short burst corresponding to one data symbol. The smaller the number of pulses, the higher the transmission rate of PPDU.

403. The receiving end processes the PPDU based on the mapping relationship between the data symbols and the spreading sequence.

The operation of the receiving end to process the PPDU may include at least one of the following: demodulation, descrambling, demapping, and decoding. In other words, the receiving end can perform reverse operations based on the processing operations of the sending end. For example, the receiving end can demodulate and descramble the modulation symbols of the received PPDU to obtain the descrambled sequence; and then determine the descrambling sequence based on the mapping relationship between the data symbols and the spreading sequence, including the spreading sequence. The spreading sequence corresponding to the first sequence after descrambling, and the data bits corresponding to the spreading sequence corresponding to the descrambling first sequence; finally, the data bits are decoded to obtain the information bits of the PPDU. After obtaining the information bits of the PPDU, the receiving end can effectively obtain the function or role of the PPDU, and thereby perform corresponding operations. For example, if the function of PPDU is used for synchronization, the receiving end can perform synchronization based on the PPDU. For another example, if the function of PPDU is used to wake up, the receiving end can wake itself up based on the PPDU. For another example, PPDU can also be simply used to transmit data, etc., which is not limited in the embodiments of the present application. It can be understood that the processing operations of the receiving end shown above are only examples and should not be understood as limiting the embodiments of the present application.

In the embodiment of the present application, in the mapping relationship between data symbols and spreading sequences, the minimum Hamming distance is greater than or equal to By increasing the minimum Hamming distance in the mapping relationship, the probability of the receiving end misjudging data symbols can be effectively reduced, thereby reducing the probability of the receiving end misjudging information bits, improving the receiving performance of the receiving end, and effectively ensuring the reliability of communication between both parties. , thereby improving system performance. Compared with the mapping relationship shown in Table 1, the mapping relationships shown in Table 2 to Table 8 effectively improve the demodulation performance of the receiving end, and the mapping relationships shown in Table 4 and Table 5 effectively improve the transmission rate of the system. surface The mapping relationship shown in Table 6 to Table 8 reduces the transmission rate of the system and reduces the reception complexity of the receiving end. At the same time, the mapping relationship shown in the embodiment of this application can support different modulation methods, and the modulation methods are more flexible.

The mapping relationship provided by the embodiment of this application is described in detail below.

It should be noted that the design process of each spreading sequence shown below is only an example. Optionally, each spreading sequence may be predefined by a standard, or a preset sequence, etc. That is, each spreading sequence shown in the embodiment of the present application is not necessarily implemented through the steps shown below (such as formula (1) to formula (17), etc.). For example, in practical applications, the communicating parties can interact by saving the mapping relationship. The method of determining the spreading sequence as shown below may not exist, but the method shown in Figure 4 is performed by saving the mapping relationship.

Implementation method 1.

The first burst and the second burst in the mapping relationship are combined to form a 4*8 joint mapping relationship, so that the mapping relationship provided by the embodiment of the present application is designed based on the Hamming distance between different data symbols. For example, a 4*4 normalized Hadamard matrix (hadamard matrix) can be shown as formula (1):

Among them, the Hamming distance between any two rows is 2, and the elements in the first column are all 1, which does not contribute to the Hamming distance between different rows. Therefore, the first column of the 4*4 normalized Hadamard matrix can be removed to form a new 4*3 matrix, as shown in formula (2):

Among them, any two columns in H2 contribute at least 1 to the Hamming distance between different rows, so a 4*8 mapping matrix can be obtained, as shown in formula (3):
M1＝[H3,H2,H2] (3)

Among them, H3 represents a matrix composed of any two different columns in matrix H2. Therefore, the minimum Hamming distance between any two rows in M1 is at least 5, that is, each H2 matrix contributes 2 Hamming distances, and H3 contributes at least A Hamming distance.

For example, the mapping matrix M1 can be as shown in formula (4) to formula (6):

It should be noted that at least one operation of rearranging columns, rearranging rows, and inverting some columns of the mapping matrix does not affect the minimum Hamming distance between data symbols. Therefore, the rows or columns of the above-mentioned mapping matrix M1 can also be rearranged and partial columns inverted, etc. to obtain a new mapping matrix. It can be understood that whether it is the above-mentioned mapping matrix M1 or a new mapping matrix, the mapping relationship can be obtained according to the method shown below. The following only shows one mapping matrix as an example, but this should not be understood as limiting the embodiment of the present application. . It can be understood that cyclic shift can be understood as a case of rearrangement, so the embodiments of the present application will not enumerate the cyclic shift operations one by one.

For example, based on the mapping matrix M1 shown in formula (4) to formula (6), a matrix shown in formula (7) can be obtained:

Formula (7) can be that the columns in formula (5) are arranged in the order of 1,3,2,4,7,6,5,8, and then 3,5,6,7, Obtained by inverting 8 columns. Replace -1 in the mapping matrix M1 or -M1 matrix shown in formula (7) (that is, invert all elements of the matrix in formula (7)) with 0, or replace -1 with 1, and 1 with 0, which can be used as the mapping relationship between data bits and spreading sequences. For example, by replacing 1 with 0 and -1 with 1 in formula (7), two short bursts shown in Table 2 can be obtained. It can be understood that if each element in the matrix M1 is marked as m, and each element in the spreading sequence in the mapping relationship is marked as m', then each element in the matrix M1 can also perform the following operation to obtain the spreading sequence: m'=(m+1)/2 or m'=(1-m)/2. It is understood that the description regarding substitution below also applies.

In Table 2 above, the minimum Hamming distance between any two different data symbols is 5. The autocorrelation function of the signal modulated by four different data symbols is shown in Figure 6. The autocorrelation characteristics can affect the reception performance of the receiver. Through the mapping relationship shown in Table 2, since the autocorrelation characteristics of the signal after data symbol modulation are good, the reception performance of the receiver is effectively improved.

It can be understood that Table 2 is only one of the mapping matrices shown in the above formula (4) to formula (6), and it should not be understood as limiting the embodiments of the present application.

Implementation method 2.

In the embodiment of the present application, the first burst and the second burst may form a complementary pair sequence, so that the side lobes of the sum of the autocorrelation functions of the two bursts are both 0. As an example, a complementary pair sequence of length 4 is and A new complementary pair sequence can be formed by performing at least one operation of negating or reversing the two sequences respectively. Therefore, each row of the mapping matrix M2 can be represented by the sequence and It is formed by performing at least one operation of reverse order or negation. For example, the mapping matrix M2 can be as shown in formula (8):

The first four columns in formula (8) can each be vectors the reverse order of the negation of (i.e. ), reverse order. General Replacing -1 with 0 in the mapping matrix M2 or -M2 matrix shown in Equation (8), or replacing -1 with 1 and 1 with 0, can be used as the mapping relationship between data symbols and spreading sequences. For example, if 1 in formula (8) is replaced with 0 and -1 is replaced with 1, two short bursts shown in Table 3 can be obtained. The chip values mapped in the above way are modulated by BPSK (for example, 0 is modulated as 1, 1 is modulated as -1), and then carried by UWB pulses to form the final data symbol structure, which can be seen in Figure 3b and Figure 5d, which will not be detailed here. narrate. Of course, the mapped chip values can also be scrambled, which will not be listed here. It can be understood that Table 3 is only one of the mapping matrices shown in the above formula (8), and should not be understood as limiting the embodiments of the present application.

Implementation method three.

Since all rows of the Hadamard matrix are orthogonal to each other, the Hamming distance between different rows is n/2, where n is the number of rows or columns of the Hadamard matrix. Therefore, the 8*8 Hadamard matrix is shown in formula (9):

From this, you can select the 8*8 Hadamard matrix as shown in formula (9), or rearrange the columns of the above H4 or invert some of the columns, or rearrange the rows in H4, you can construct The mapping matrix of 16 data symbols to a spreading sequence of length 8 is shown in formula (10):

Illustratively, an example of the mapping matrix M3 can be as shown in formula (11):

Formula (11) can be obtained by inverting the 3rd to 6th columns in matrix H4. Replace -1 in the mapping matrix M3 or -M3 matrix shown in formula (11) with 0, or replace -1 with 1 and 1 with 0, which can be used as the mapping relationship between data symbols and spreading sequences. , as shown in Table 4 above. The chip values mapped in the above manner are modulated by BPSK (for example, 0 is modulated as 1, and 1 is modulated as -1), and then carried by UWB pulses to form the final data symbol structure as shown in Figure 3b and Figure 5d, which will not be detailed here. narrate. Of course, the mapped chip values can also be scrambled, which will not be listed here. It can be understood that Table 4 is only one of the mapping matrices shown in the above formula (11), and should not be understood as limiting the embodiments of the present application.

Implementation method four.

In the embodiment of the present application, 16 data symbols can be mapped to a spreading sequence with a length of 16, and then QPSK modulation is used, so that each data symbol finally corresponds to 8 modulated constellation points. For example, the mapping matrix can be generated based on a 16*16 Hadamard matrix (that is, the Hamming distance between different rows is 8). Since the elements in the first column of the normalized Hadamard matrix are the same, the Hamming distance between different data symbols is Distance does not contribute, so half of the first column elements of the normalized Hadamard matrix can be negated. And the columns of the matrix obtained by inverting half of the first column elements are rearranged, partial columns are inverted, and other operations, so that the final modulated signal has good autocorrelation characteristics. For example, the mapping matrix can be as shown in formula (12):

Replace -1 in the mapping matrix M4 or -M4 matrix shown in formula (12) with 0, or replace -1 with 1 and 1 with 0. At the same time, odd-numbered columns and even-numbered columns are modulated on the I and Q branches respectively, which can be used as the mapping relationship between data symbols and spreading sequences, as shown in Table 5 above. The chip values mapped in the above manner are modulated by QPSK and carried by UWB pulses. The structure of the final data symbol can be seen in Figure 3b and Figure 5d, which will not be described in detail here. Of course, the mapped chip values can also be scrambled, which will not be listed here. It can be understood that Table 5 is only one of the mapping matrices shown in the above formula (12), and should not be understood as limiting the embodiment of the present application.

In implementation methods three and four, each data symbol can correspond to 4 data bits and carry 2 information bits, which effectively improves the transmission rate.

Implementation method five.

In scenarios where high-rate transmission is not required, communication can be performed at a lower transmission rate, allowing the receiving end to receive PPDUs with a low-complexity acceptance algorithm. For example, the number of pulses or the number of chips in one data symbol can be increased to reduce the transmission rate and increase the robustness of the system. For example, each data symbol is mapped to a spreading sequence with a length of 16 or 24, so that the Hamming distance of different spreading sequences can be greatly increased and more transmission errors can be tolerated, thus improving the robustness of the system. sex.

As an example, when the length of the spreading sequence is 16 bits, the mapping matrix can be constructed as follows:

Repeat according to the H2 matrix in formula (2) to obtain the following 4*16 mapping matrix M5:
M5＝[H11,H2,H2,H2,H2,H2] (13)

Among them, H11 is any column vector composed of 1 and -1. Since each H2 matrix contributes 2 to the minimum Hamming distance between data symbols, the mapping matrix composed of M5 has a minimum Hamming distance of 10 between each data symbol.

It should be noted that the columns of the M5 matrix in formula (13) can also be rearranged and the values of some columns can be inverted to form an optimized mapping matrix M′, so that the chip sequence corresponding to each data symbol Has good autocorrelation properties.

Then, replace -1 in the mapping matrix M5 or -M5 or the mapping matrix M′ or -M′ described in formula (13) with 0, or replace -1 with 1 and 1 with 0, which can be used as data Mapping relationship between bits and spreading sequences.

For example, H11=[1 -1 1 -1] ^T , after arranging the columns of M5, the 2nd, 3rd, 4th, 5th and 9th columns are equal to the first column of H2, 7th, 8th, 10th and 12th, Column 14 is equal to the second column of H2, columns 6, 11, 13, 15, and 16 are equal to the third column of the H2 matrix, and then the 2, 4, 5, 6, 10, 11, 13, 14, 15, 16 The columns are inverted, and finally the following mapping matrix is formed:

For example, by replacing 1 with 0 and -1 with 1 in formula (14), two short bursts shown in Table 6 can be obtained. The chip values mapped in the above manner are modulated by BPSK (for example, 0 is modulated as 1, and 1 is modulated as -1), and then carried by UWB pulses to form the final data symbol structure as shown in Figure 7a and Figure 7b. As shown in Figure 7a and Figure 7b, one data symbol can correspond to two short bursts, and each short burst can include 8 chip values, thereby reducing the transmission rate. Of course, the mapped chip values can also be scrambled, which will not be listed here. It can be understood that Table 6 is only one of the mapping matrices shown in the above formula (13), and should not be understood as limiting the embodiments of the present application.

As another example, when the chip length is 24, the mapping matrix can be constructed as follows:

Repeat according to the H2 matrix in formula (2) to obtain the following 4*24 mapping matrix M6:
M6＝[H2,H2,H2,H2,H2,H2,H2,H2] (15)

Since each H2 matrix contributes 2 to the minimum Hamming distance between symbols, the mapping matrix composed of M6 has a minimum Hamming distance of 16 between each data symbol. You can also rearrange the columns of the M6 matrix in formula (15) and invert the values of some columns to form an optimized mapping matrix M′, so that the chip sequence corresponding to each data symbol has good autocorrelation characteristics. Or make the mapping matrix have a simple structure. Then, replace -1 in the mapping matrix M6 or -M6 or the mapping matrix M′ or -M′ described in formula (15) with 0, or replace -1 with 1 and 1 with 0, which can be used as data Mapping relationship between bits and spreading sequences.

For example, after arranging the columns of the M6 matrix so that columns 1 to 8 are equal to the first column of H3, columns 9 to 16 are equal to the second column of H3, and columns 17 to 24 are equal to the third column of the H3 matrix, the following mapping matrix is finally formed:

For another example, after arranging the columns of the M6 matrix, the 1st, 6th, 12th, 14th, 15th, 19th, 21st and 24th columns are equal to the first column, 2nd, 3rd, 7th, 8th, 10th, 20th, 22nd and Column 23 is equal to the second column of H3, columns 4, 5, 9, 11, 13, 16, 17 and 18 are equal to the third column of the H3 matrix, and then columns 5, 7, 8, 9, 11, 12, 13 , 15, 16, 18, 21, 22, 23 and 24 columns are inverted, finally forming the following mapping matrix:

Replace 1 in formula (16) with 0 and -1 with 1, and you can obtain three short bursts shown in Table 7. Replace 1 in formula (17) with 0 and -1 with 1, and you can obtain three short bursts shown in Table 8. The chip values mapped in the above manner are modulated by BPSK (for example, 0 is modulated as 1, and 1 is modulated as -1), and then carried by UWB pulses to form the final data symbol structure as shown in Figure 8a and Figure 8b. As shown in Figure 8a and Figure 8b, one data symbol can correspond to at least two short bursts, and each short burst can include 8 chip values, thereby reducing the transmission rate. Alternatively, the spreading sequence with a length of 24 can also be divided into two short bursts, each of which corresponds to 12 chip values, as shown in Figure 8b. The mapped chip value is scrambled, modulated by BPSK, and mapped to the corresponding pulse. It can be understood that the arrows in Figures 7a, 7b, 8a and 8b only illustrate the position of the pulse and do not indicate the positive or negative direction of the pulse. The duration occupied by each chip in Figures 7a, 7b, 8a and 8b is the same as that in Figure 5a, but the duration occupied by each data symbol is different from that in Figure 5a.

Among the various embodiments or implementations shown above, reference may be made to other embodiments or implementations for parts that are not described in detail in one embodiment or implementation.

As another example, when the chip length is 32 (which can also be understood as the length of the spreading sequence is 32, that is, including 32 chip values), the mapping matrix can be constructed as follows:

Repeat according to the matrix H2 in formula (2) to obtain the following 4*24 mapping matrix M7:
M7＝[H3,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2] (18)

For descriptions of matrix H2 and matrix H3, please refer to the description of the above formula (2). For example, matrix H3 can be a matrix composed of any two different columns in matrix H2. Since each matrix H2 contributes 2 to the minimum Hamming distance between data symbols, and H3 contributes 1 to the minimum Hamming distance between data symbols, so the minimum Hamming distance between each data symbol in the mapping matrix composed of M7 is 21 . Of course, the columns of matrix M7 in formula (18) can also be rearranged or the values of some columns can be inverted to form an optimized mapping matrix M′, so that the chip sequence corresponding to each data symbol has good autonomy. Correlation properties may give the mapping matrix a simple structure. Then, replace -1 in the mapping matrix M7 or -M7 or the mapping matrix M' or -M' described in formula (18) with 0, or replace -1 with 1 and 1 with 0, which can be used as data Mapping relationship between bits and spreading sequences.

For example, the mapping matrix can look like this:

Replace 1 in formula (19) with 0 and -1 with 1, and you can obtain two short bursts shown in Table 9.

Table 9

It can be understood that based on the mapping relationship shown in Table 9, the chip value can be carried through UWB pulses after BPSK modulation. One data symbol can correspond to two short bursts, and each short burst can include 16 chip values. . For example, one data symbol can correspond to two short bursts, and each short burst can include 16 chips, that is, one chip corresponds to one chip value; for example, each short burst can include 32 chips, that is, Each chip value may be separated by one chip (similar to Figure 5d, Figure 7a, Figure 7b, Figure 8a and Figure 8b), etc. The specific description of the pulse position will not be described in detail in this embodiment. Of course, one data symbol can also correspond to four short bursts, for example, each short burst can correspond to 8 chip values. For an explanation of one data symbol corresponding to two short bursts and four short bursts, please refer to Figure 8a and Figure 8b, and will not be described in detail here.

As another example, when the chip length is 64, the mapping matrix can be constructed as follows:
M8＝[H5,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2,H2] (20)

Among them, matrix H5 represents any column in matrix H2. Since each matrix H2 contributes 2 to the minimum Hamming distance between data symbols, the minimum Hamming distance between each data symbol in the mapping matrix formed by matrix M8 is 42. Of course, the columns of matrix M8 in formula (20) can also be rearranged or the values of some columns can be inverted to form an optimized mapping matrix M′, so that the chip sequence corresponding to each data symbol has good autonomy. Correlation properties may give the mapping matrix a simple structure. Then, replace -1 in the mapping matrix M8 or -M8 or the mapping matrix M′ or -M′ described in formula (20) with 0, or replace -1 with 1 and 1 with 0, which can be used as data Mapping relationship between bits and spreading sequences.

For example, the mapping matrix can look like this:

Replace 1 in formula (21) with 0 and -1 with 1, and you can obtain the four short bursts shown in Table 10.

Table 10

It can be understood that based on the mapping relationship shown in Table 10, the chip value can be carried by UWB pulses after being modulated by BPSK. For example, one data symbol may correspond to four short bursts, and each short burst may include 16 chip values. For example, each short burst may include 16 chips, or each short burst may include 32 chips, etc. Reference may be made similarly to FIG. 5d, FIG. 7a, FIG. 7b, FIG. 8a, and FIG. 8b. Of course, one data symbol may also correspond to a smaller or larger number of short bursts, which is not limited in the embodiments of the present application.

In each of the above implementations, in order to further increase the transmission distance, the link budget can also be further increased through repeated transmission. For example, according to the mapping relationships shown in Table 1 to Table 10, you can follow Figure 5d, Figure 7a, Figure 7b, The pulse positions shown in Figure 8a and Figure 8b transmit each data symbol repeatedly multiple times. Among them, the same data can be sent each time it is repeated, or the data bits can be processed before being sent. As an example, each data symbol may be repeatedly transmitted multiple times at different data symbol durations (ie, Tdsym). For example, the same data symbol can be sent twice within two different data symbol durations. As another example, the same data symbol can be sent three times within three different data symbol durations. Regarding the pulse position corresponding to each data symbol, reference can be made to Figure 5d, Figure 7a, Figure 7b, Figure 8a, and Figure 8b, which will not be described in detail here. As another example, when data symbols are repeatedly sent, processing may be performed first, such as inverting the data bits corresponding to the data symbols, and then sending the chip values corresponding to the inverted data bits. For example, when data symbol 0 is sent, the data bit corresponding to the data symbol is 00. When data symbol 0 is sent repeatedly, the data bit 00 can be inverted to obtain 11, and then the chip value corresponding to data bit 11 is sent. By sending data symbols in this way, the diversity gain can be effectively improved.

In other embodiments of the present application, in scenarios where high-rate transmission is not required, communication can also be performed at a lower transmission rate, so that the receiving end can receive information using a low-complexity algorithm. Exemplarily, FIG. 7a and FIG. 7b are schematic diagrams of a UWB pulse provided by embodiments of the present application.

In the structure shown in Figure 9a, a position-based modulation method can be used. For example, only one of the two bursts before and after each data symbol can contain energy pulses. The specific burst that emits the UWB pulse can be determined based on the transmitted data bits. . For example, when the data bit is 1, the first burst sends UWB pulses and the second burst does not send UWB pulses; when the data bit is 0, the second burst sends UWB pulses and the first burst does not send UWB pulses. pulse. It can be understood that the arrow shown in Figure 9a only means that there can be UWB pulses at the position indicated by the arrow, but does not mean that at a UWB pulses need to be sent within both bursts within the duration of the data symbol. It can be understood that in the embodiment of the present application, each data symbol may correspond to one data bit, that is, only one data bit may be transmitted within the duration of each data symbol. Thus, low transmission rate transmission of PPDU is achieved. Optionally, energetic UWB pulses can be used to carry more data bits. For example, when the data bit is 1, the four pulses in the energetic burst are all positive pulses. When the data bit is 0, the energetic burst All 4 pulses are negative pulses or two are negative. Optionally, the position-based modulation method shown above and the energy UWB pulse can also be combined, so that each data symbol can carry two data bits. For example, one data bit can be determined by the location of the burst where the energetic UWB pulse is located, and another data bit can be determined by the sign (also called polarity) of the energetic pulse. In the schematic diagram shown in Figure 9a, the guard interval length in one data symbol can be greater than the burst time length, thereby reducing crosstalk between modulation symbols.

Figure 9b is another data symbol provided by an embodiment of the present application. In the structure shown in Figure 9b, the length of the guard interval may be greater than the length of the burst. At this time, the information is carried by the polarity of the pulse in the burst. The sequence composed of the UWB pulse polarity carried by different data symbols is orthogonal to each other, thus supporting the receiving end to receive in a low-complexity non-coherent method.

The following will introduce the communication device provided by the embodiment of the present application.

This application divides the communication device into functional modules according to the above method embodiments. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of modules in this application is schematic and is only a logical function division. In actual implementation, there may be other division methods. The communication device according to the embodiment of the present application will be described in detail below with reference to FIGS. 10 to 12 .

Figure 10 is a schematic structural diagram of a communication device provided by an embodiment of the present application. As shown in Figure 10, the communication device includes a processing unit 1001 and a transceiver unit 1002.

In some embodiments of the present application, the communication device may be the sending end or chip shown above, and the chip may be disposed in the sending end. That is, the communication device can be used to perform the steps or functions performed by the sending end in the above method embodiments.

The processing unit 1001 is configured to generate a PPDU based on the mapping relationship between data symbols and spreading sequences; the transceiving unit 1002 is configured to output the PPDU.

It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For specific functions or steps performed by the transceiver unit and the processing unit, reference may be made to the above method embodiments, which will not be described in detail here. For example, the processing unit 1001 may be used to perform step 401 shown in FIG. 4 . The transceiver unit 1002 may be used to perform the sending step in step 402 shown in FIG. 4 .

Reusing Figure 10, in other embodiments of the present application, the communication device may be the receiving end or chip shown above, and the chip may be disposed in the receiving end. That is, the communication device can be used to perform the steps or functions performed by the receiving end in the above method embodiments.

For example, the transceiver unit 1002 is used to input PPDU; the processing unit 1001 is used to process PPDU based on the mapping relationship between data symbols and spreading sequences.

It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For specific functions or steps performed by the transceiver unit and the processing unit, reference may be made to the above method embodiments, which will not be described in detail here. Exemplarily, the transceiver unit 1002 may also be used to perform the receiving step in step 402 shown in FIG. 4 . The processing unit 1001 can also be used to perform step 403 shown in Figure 4.

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

In the previous embodiments, for descriptions of PPDU, mapping relationships, Hamming distance, etc., you can also refer to the above method embodiments. The introduction in , will not be described in detail here.

It can be understood that the division method shown above is only an example. The division method for the sending end (or the chip provided at the sending end) and the receiving end (or the chip provided at the receiving end) can also be as follows: the sending end can include a generation unit and a sending unit; the receiving end may include a receiving unit and a processing unit. The processing unit may include a demodulation processing subunit (such as demodulating modulation symbols), a demapping processing subunit (such as decoding one or more of the PPDUs according to the mapping relationship). Multiple sequences are demapped to obtain at least one of one or more data symbols), etc., which will not be listed here.

The first communication device and the second communication device according to the embodiment of the present application are introduced above. The possible product forms of the first communication device and the second communication device are introduced below. It should be understood that any form of product that has the function of the first communication device described in Figure 10 above, or any form of product that has the function of the second communication device described in Figure 10 above, falls within the scope of this application. Protection scope of the embodiment. It should also be understood that the following description is only an example, and does not limit the product forms of the first communication device and the second communication device in the embodiments of the present application to this.

In a possible implementation, in the communication device shown in Figure 10, the processing unit 1001 can be one or more processors, the transceiving unit 1002 can be a transceiver, or the transceiving unit 1002 can also be a sending unit and a receiving unit. , the sending unit may be a transmitter, and the receiving unit may be a receiver, and the sending 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. During the execution of the above method, the process of sending information (such as sending PPDU) in the above method can be understood as the process of outputting the above information by the processor. When outputting the above information, the processor outputs the above information to the transceiver for transmission by the transceiver. After the above information is output by the processor, it 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 incoming 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 undergo other processing before being input to the processor.

As shown in FIG. 11 , the communication device 110 includes one or more processors 1120 and a transceiver 1110 .

Exemplarily, when the communication device is used to perform the steps or methods or functions performed by the transmitter, the processor 1120 is used to generate a PPDU based on the mapping relationship between data symbols and spreading sequences; the transceiver 1110 is used to Send PPDU.

Exemplarily, when the communication device is used to perform the steps or methods or functions performed by the receiving end, the transceiver 1110 is used to receive the PPDU from the sending end; the processor 1120 is used based on the relationship between the data symbols and the spreading sequence. The mapping relationship handles PPDU.

In the embodiment of this application, for descriptions of PPDU, mapping relationship, Hamming distance, etc., you can also refer to the introduction in the above method embodiment, and will not be described in detail here.

It can be understood that for the specific description of the processor and the transceiver, reference can also be made to the introduction of the processing unit and the transceiver unit shown in FIG. 10 , which will not be described again here.

In various implementations of the communication device shown in FIG. 11 , the transceiver may include a receiver and a transmitter. The receiver is configured to perform a function (or operation) of receiving. The transmitter is configured to perform a function (or operation) of transmitting. ). and transceivers for communication over transmission media and other equipment/devices.

Optionally, the communication device 110 may also include one or more memories 1130 for storing program instructions and/or data. Memory 1130 and processor 1120 are coupled. The coupling in the embodiment of this application is an indirect coupling or communication connection between devices, units or modules, which may be in electrical, mechanical or other forms, and is used for information interaction between devices, units or modules. The processor 1120 may cooperate with the memory 1130. Processor 1120 may execute program instructions stored in memory 1130 . Optionally, at least one of the above one or more memories may be included in the processor. optionally, One or more memories may be used to store the mapping relationships in the embodiments of this application.

The specific connection medium between the above-mentioned transceiver 1110, processor 1120 and memory 1130 is not limited in the embodiment of the present application. In the embodiment of the present application, the memory 1130, the processor 1120 and the transceiver 1110 are connected through a bus 1140 in Figure 11. The bus is represented by a thick line in Figure 11. The connection between other components is only a schematic explanation. , is not limited. The bus can be divided into address bus, data bus, control bus, etc. For ease of presentation, only one thick line is used in Figure 11, but it does not mean that there is only one bus or one type of bus.

In the embodiment 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., which can be implemented Or execute the disclosed methods, steps and logical block diagrams in the embodiments of this application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in conjunction with the embodiments of the present application can be directly implemented by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.

In the embodiment of the present application, the 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 (Random Access Memory, RAM), Erasable Programmable ROM (EPROM), Read-Only Memory (ROM) or Portable Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM), etc. Memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures, and that can be read and/or written by a computer (such as the communication device shown in this application), but is not limited thereto. The memory in the embodiment of the present application can also be a circuit or any other device capable of realizing a storage function, used to store program instructions and/or data.

For example, the processor 1120 is mainly used to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of the software programs. Memory 1130 is mainly used to store software programs and data. The transceiver 1110 may include a control circuit and an antenna. The control circuit is mainly used for conversion of baseband signals and radio frequency signals and processing of radio frequency signals. Antennas are mainly used to send and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as touch screens, display screens, keyboards, etc., are mainly used to receive data input by users and output data to users.

When the communication device is turned on, the processor 1120 can read the software program in the memory 1130, 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 1120 performs baseband processing on the data to be sent, and then outputs the baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then sends the radio frequency signal out 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 1120. The processor 1120 converts the baseband signal into data and performs processing on the data. deal with.

In another implementation, the radio frequency circuit and antenna can be arranged independently of the processor that performs baseband processing. For example, in a distributed scenario, the radio frequency circuit and antenna can be arranged remotely and independently of the communication device. .

It can be understood that the communication device shown in the embodiment of the present application may also have more components than in Figure 11 , and the embodiment of the present application does not limit this. The methods performed by the processor and transceiver shown above are only examples. For specific steps performed by the processor and transceiver, please refer to the method introduced above.

In another possible implementation, in the communication device shown in Figure 10, the processing unit 1001 may be one or more logic circuits, and the transceiver unit 1002 may be an input-output interface, also known as a communication interface, or an interface circuit. , or interface, etc. Or the transceiver unit 1002 can also be a sending unit and a receiving unit. The sending unit can be an output interface, and the receiving unit can be an input interface. The sending unit and the receiving unit are integrated into one unit, such as an input-output interface. As shown in FIG. 12 , the communication device shown in FIG. 12 includes a logic circuit 1201 and an interface 1202 . That is, the above-mentioned processing unit 1001 can be implemented by the logic circuit 1201, and the transceiver unit 1002 can be implemented by the interface 1202. Among them, the logic circuit 1201 can be a chip, a processor The interface 1202 may be a communication interface, an input-output interface, a pin, etc. Illustratively, FIG. 12 takes the above communication device as a chip. The chip includes a logic circuit 1201 and an interface 1202. It can be understood that the chips shown in the embodiments of the present application may include narrowband chips or ultra-wideband chips, which are not limited in the embodiments of the present application. The step of sending UWB pulses as shown above can be performed by an ultra-wideband chip. Whether the remaining steps are performed by an ultra-wideband chip is not limited by the embodiments of this application.

In the embodiment of the present application, the logic circuit and the interface may also be coupled to each other. The embodiments of this application do not limit the specific connection methods of the logic circuits and interfaces.

Exemplarily, when the communication device is used to perform the method or function or step performed by the sending end, the logic circuit 1201 is used to generate a PPDU based on the mapping relationship between the data symbols and the spreading sequence; the interface 1202 is used to output the PPDU. PPDU.

Exemplarily, when the communication device is used to perform the method or function or step performed by the receiving end, the interface 1202 is used to input the PPDU; the logic circuit 1201 is used to process the PPDU based on the mapping relationship between the data symbols and the spreading sequence. .

As a possible implementation manner, each of the above chips may include a storage circuit, and the storage circuit may be used to store the mapping relationship provided by the embodiment of the present application. As another possible implementation manner, each of the above chips can also be connected to a memory, so that when the mapping relationship needs to be used, the mapping relationship provided by the embodiment of the present application is read from the memory.

It can be understood that the communication device shown in the embodiments of the present application can be implemented in the form of hardware to implement the methods provided in the embodiments of the present application, or can be implemented in the form of software to implement the methods provided in the embodiments of the present application. This is not limited by the embodiments of the present application.

In the previous embodiments, for descriptions of PPDU, mapping relationships, Hamming distance, etc., you can also refer to the introduction in the above method embodiments, and will not be described in detail here.

For the specific implementation of each embodiment shown in Figure 12, reference may also be made to the above-mentioned embodiments, which will not be described in detail here.

An embodiment of the present application also provides a wireless communication system. The wireless communication system includes a sending end and a receiving end. The sending end and the receiving end can be used to perform the method in any of the foregoing embodiments (as shown in Figure 4). Alternatively, the sending end and receiving end may refer to the communication devices shown in FIGS. 10 to 12 .

In addition, this 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 this application.

This 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 this application.

This application also provides a computer-readable storage medium, which stores computer code. When the computer code is run on a computer, it causes the computer to perform the operations performed by the sending end in the method provided by this application and/ or processing.

This application also provides a computer-readable storage medium, which stores computer code. When the computer code is run on a computer, it causes the computer to perform the operations performed by the receiving end in the method provided by this application and/ or processing.

This application also provides a computer program product. The computer program product includes computer code or computer program. When the computer code or computer program is run on a computer, it causes the operations performed by the sending end in the method provided by this application and/or Processing is performed.

This application also provides a computer program product. The computer program product includes computer code or computer program. When the computer code or computer program is run on a computer, it causes the operations performed by the receiving end in the method provided by this application and/or Processing is performed.

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 illustrative, such as the division of the units, It is only a logical functional division. In actual implementation, there may be other divisions. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the coupling or direct coupling or communication connection between each other shown or discussed may be an indirect coupling or communication connection through some interfaces, devices or units, or may be electrical, mechanical or other forms of connection.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to 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 by the embodiments of the present application.

In addition, each functional unit in various embodiments of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above integrated units can be implemented in the form of hardware or software functional units.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or contributes to the existing technology, 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 The storage medium includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned readable storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc. that can store program code medium.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application. should be covered by the protection scope of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims

A communication method based on physical layer protocol data unit PPDU, characterized in that the method includes:

The PPDU is generated based on the mapping relationship between data symbols and spreading sequences. The number of data symbols is m, the length of the spreading sequence is n, and the minimum Hamming distance is related to m and n. The minimum Hamming distance is related to m and n. The Hamming distance represents the smallest Hamming distance among the Hamming distances of any two different spreading sequences, and the m and n are both positive integers;

Send the PPDU.
A communication method based on physical layer protocol data unit PPDU, characterized in that the method includes:

receive the PPDU;

The PPDU is processed based on the mapping relationship between data symbols and spreading sequences. The number of data symbols is m, the length of the spreading sequence is n, and the minimum Hamming distance is related to m and n. The minimum Hamming distance is related to m and n. The Hamming distance represents the smallest Hamming distance among the Hamming distances of the spreading sequences corresponding to any two different data symbols, and the m and n are both positive integers.
The method according to claim 2, wherein processing the PPDU based on the mapping relationship between data symbols and spreading sequences includes:

Get the first sequence before mapping to be solved;

The spreading sequence corresponding to the first sequence is determined based on the mapping relationship, and the data bits corresponding to the first sequence are determined.
The method according to any one of claims 1-3, characterized in that the minimum Hamming distance is greater than or equal to
The method according to any one of claims 1 to 4, characterized in that the spreading sequence corresponds to at least two short bursts, and the number of pulses in the short bursts is related to the n.
The method according to any one of claims 1 to 5, characterized in that the spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the n.
The method according to claim 6, characterized in that the spreading sequence is obtained based on the following matrix:
The method according to claim 7, characterized in that the spreading sequence is obtained based on any of the following matrix M1:
The method according to claim 8, characterized in that obtaining the spreading sequence based on matrix M1 includes:

The spreading sequence is obtained based on at least one operation of row rearrangement, column rearrangement, and partial column inversion of the matrix M1.
The method according to any one of claims 1-9, characterized in that the mapping relationship is as follows:

Among them, g0 and g1 each represent one data bit.
The method according to claim 6, characterized in that the spreading sequence is obtained based on the following matrix M3:

H represents a Hadamard matrix with 8 rows and 8 columns.
The method of claim 11, wherein obtaining the spread spectrum sequence based on matrix M3 includes: the spread spectrum sequence is based on row rearrangement, column rearrangement, and partial column inversion of matrix M3. At least one operation was obtained.
The method according to any one of claims 1-6, 11 or 12, characterized in that the mapping relationship is as follows:

Among them, g0, g1, g2 and g3 each represent one data bit.
The method according to any one of claims 1-6, characterized in that the mapping relationship is as shown in any one of the following:

or,

or,

or,

Among them, g1, g1, g2, and g3 respectively represent one data bit.
A communication device, characterized in that the device includes:

A processing unit configured to generate a physical layer protocol data unit PPDU based on the mapping relationship between data symbols and spreading sequences, where the number of data symbols is m, the length of the spreading sequence is n, and the minimum Hamming distance is equal to m and n are related, the minimum Hamming distance represents the smallest Hamming distance among the Hamming distances of any two different spreading sequences, and the m and n are both positive integers;

A transceiver unit, configured to send the PPDU.
A communication device, characterized in that the device includes:

Transceiver unit, used to receive physical layer protocol data unit PPDU;

A processing unit configured to process the PPDU based on the mapping relationship between data symbols and spreading sequences. The number of data symbols is m, the length of the spreading sequence is n, and the minimum Hamming distance is equal to m, n. Relatedly, the minimum Hamming distance represents the smallest Hamming distance among the Hamming distances of any two different spreading sequences, and the m and n are both positive integers.
The device according to claim 16, characterized in that:

The processing unit is specifically configured to obtain the first sequence before demapping; determine the spreading sequence corresponding to the first sequence based on the mapping relationship, and determine the data bits corresponding to the first sequence.
The device according to any one of claims 15-17, characterized in that the minimum Hamming distance is greater than or equal to
The device according to any one of claims 15 to 18, wherein the spreading sequence corresponds to at least two short bursts, and the number of pulses in the short bursts is related to the n.
The device according to any one of claims 15 to 19, characterized in that the spreading sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the n.
A communication device, characterized by including a processor and a memory;

The memory is used to store instructions;

The processor is configured to execute the instructions, so that the method described in any one of claims 1 to 14 is executed.
A chip, characterized in that it includes a logic circuit and an interface, and the logic circuit and the interface are coupled;

The interface is used to input and/or output code instructions, and the logic circuit is used to execute the code instructions, so that the method described in any one of claims 1 to 14 is executed.
A computer-readable storage medium, characterized in that the computer-readable storage medium is used to store a computer program, and when the computer program is executed, the method described in any one of claims 1 to 14 is executed.
A communication system, characterized in that the communication system includes a sending end and a receiving end, the sending end is used to perform the method as shown in any one of claims 1, 4 to 14, and the receiving end is used to perform A method as claimed in any one of claims 2 to 14.