Physical layer protocol data unit-based communication method and apparatus

Abstract

The PPDU-based communication method and apparatus are applicable to a wireless local area network system that supports 802.11 series protocols such as 802.15 standards, for example, 802.15.4a, 802.15.4z, 802.15.4ab, the next-generation protocols of 802.15.4a, 802.15.4z, or 802.15.4ab, or the next-generation 802.11be such as Wi-Fi 8, or can be applied to a UWB-based wireless personal area network system, a sensing system, etc. The method includes the following. The transmitting end generates a PPDU based on the mapping relationship between data symbols and chip sequences, sends the PPDU, and correspondingly, the receiving end receives the PPDU and then processes the PPDU based on the mapping relationship, and the minimum Hamming distance is L / 2 or more. The minimum Hamming distance increases, thereby effectively reducing the bit error rate.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and more particularly, to a physical layer protocol data unit (PPDU)-based communication method and apparatus.

Background Art

[0002] This application claims priority to Chinese Patent Application No. 202210688053.1, filed with the China National Intellectual Property Administration on June 17, 2022, entitled "PHYSICAL LAYER PROTOCOL DATA UNIT-BASED COMMUNICATION METHOD AND APPARATUS", the entire disclosure of which is incorporated herein by reference.

[0003] Ultra-wideband (UWB) technology is a wireless carrier communication technology in which narrow impulses of non-sinusoidal waves are used for data transmission at the nanosecond level. Therefore, ultra-wideband occupies a wide spectral range. UWB systems have advantages such as high multipath resolution ability, low power consumption, and high confidentiality due to narrow impulses and extremely low radiation spectral density.

[0004] As UWB technology is used in the civilian domain, ultra-wideband wireless communication has become one of the popular physical layer technologies in short-distance and high-speed wireless networks. Generally, for the narrowband signals used to support UWB, fixed-length information bits need to be mapped to data symbols, and then the data symbols are mapped to chip sequences of a specific length to expand the bandwidth of the signal.

[0005] However, the performance of the mapping relationship between data symbols and chip sequences needs to be further improved.

Summary of the Invention

[0006] This application provides a PPDU-based communication method and apparatus for effectively increasing the minimum Hamming distance of the Hamming distance between different chip sequences and effectively reducing the bit error rate at the receiving end.

[0007] According to a first aspect, an embodiment of the present application provides a physical layer protocol data unit (PPDU)-based communication method, which is applied to a transmitting end. The method includes generating a PPDU based on a mapping relationship between data symbols and chip sequences, where the length of each chip sequence is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to a data symbol is smaller than the bit length of the chip sequence, and the minimum Hamming distance represents the smallest Hamming distance between any two different chip sequences, and sending the PPDU.

[0008] Regarding the first aspect, in a possible implementation, generating a PPDU based on a mapping relationship between data symbols and chip sequences includes generating modulated symbols of the PPDU based on the mapping relationship between data symbols and chip sequences, and sending the PPDU includes sending the modulated symbols of the PPDU.

[0009] According to a second aspect, an embodiment of the present application provides a physical layer protocol data unit (PPDU)-based communication method, which is applied to a receiving end. The method includes receiving a PPDU and processing the PPDU based on a mapping relationship between data symbols and chip sequences, where the length of each chip sequence is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to a data symbol is smaller than the bit length of the chip sequence, and the minimum Hamming distance represents the smallest Hamming distance between any two different chip sequences.

[0010] Regarding the second aspect, in a possible implementation, processing the PPDU based on the mapping relationship between data symbols and chip sequences involves obtaining a first sequence in the PPDU, where the length of the first sequence is L, determining a first chip sequence corresponding to the first sequence based on N chip sequences included in the mapping relationship between data symbols and chip sequences, where the first chip sequence is one of the N chip sequences and N is a positive integer, determining a data symbol corresponding to the first chip sequence based on the mapping relationship between data symbols and chip sequences, and determining information bits corresponding to the first chip sequence based on the data symbol corresponding to the first chip sequence.

[0011] In this embodiment of the present application, the minimum Hamming distance in the mapping relationship increases, whereby the probability that the receiving end inaccurately determines the data symbol can be effectively reduced, reducing the probability that the receiving end inaccurately determines the information bits, effectively guaranteeing the reliability of communication between two communication parties, and improving system performance.

[0012] Regarding the first aspect or the second aspect, in a possible implementation, L = 32, or L = 16, or L = 8.

[0013] Regarding the first aspect or the second aspect, in a possible implementation, the chip sequence is [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1], [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1], and [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] obtained based on at least one of them.

[0014] Regarding the first aspect or the second aspect, in a possible implementation, the chip sequence is obtained based on at least two of the following. [1 1 -1 1 -1 1 -1 -1] [1 1 -1 1 1 -1 -1 -1]. [1 1 1 -1 1 -1 -1 -1]

[0015] In this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the minimum Hamming distance can be effectively increased, the bit error rate at the receiving end can be reduced, and the system performance can be improved.

[0016] Regarding the first aspect or the second aspect, in a possible implementation, the chip sequence is obtained based on the Hadamard matrix, and the order of the Hadamard matrix is related to the length of the chip sequence.

[0017] In this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the Hamming distance between the chip sequences corresponding to different data symbols is 16, whereby the system performance can be effectively improved.

[0018] Regarding the first aspect or the second aspect, in a possible implementation, at least two columns of elements in the matrix formed by the chip sequence are the same.

[0019] In this embodiment of the present application, each of the data symbols has at least two fixed chip values with fixed positions. Since each of the data symbols can have at least two fixed chip values with fixed positions, the fixed chip values may be used as pilots, whereby the receiving end can perform frequency offset estimation and compensation based on the fixed chip values to improve the anti-frequency offset ability of the system.

[0020] Regarding the first or second aspect, in a possible implementation, the chip sequence is [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1], and [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1] is obtained based on two sequences:

[0021] In this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the Hamming distances between different chip sequences can include 16, 17, and 20. Therefore, there is a case where the Hamming distance between different chip sequences is equal to 16, and the bit error rate at the receiving end can be further reduced.

[0022] Regarding the first or second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0023]

Table 1

[0024] Regarding the first or second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0025]

Table 2

[0026] Regarding the first or second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0027]

Table 3

[0028] Regarding the first aspect or the second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0029] [Table 4]

[0030] Regarding the first aspect or the second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0031] [Table 5]

[0032] Regarding the first aspect or the second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0033] [Table 6]

[0034] Regarding the first aspect or the second aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0035] [Table 7]

[0036] According to a third aspect, an embodiment of the present application provides a communication device configured to implement the method in any one of the first aspect or a possible implementation of the first aspect. The communication device includes a unit configured to implement the method in any one of the first aspect or a possible implementation of the first aspect. For example, the communication device includes a processing unit and a transceiver unit.

[0037] The processing unit is configured to generate a PPDU based on a mapping relationship between data symbols and chip sequences, wherein each length of the chip sequences is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequence, the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences, and the transceiver unit is configured to send the PPDU.

[0038] In a possible implementation, the processing unit is particularly configured to generate modulated symbols of the PPDU based on a mapping relationship between data symbols and chip sequences.

[0039] According to a fourth aspect, an embodiment of the present application provides a communication device configured to implement the method in any one of the second aspect or a possible implementation of the second aspect. The communication device includes a unit configured to implement the method in any one of the second aspect or a possible implementation of the second aspect. For example, the communication device includes a processing unit and a transceiver unit.

[0040] The transceiver unit is configured to receive the PPDU, and the processing unit is configured to process the PPDU based on a mapping relationship between data symbols and chip sequences, wherein each length of the chip sequences is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequence, and the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences.

[0041] In a possible implementation, the processing unit is to obtain a first sequence in the PPDU, where the length of the first sequence is L, and based on N chip sequences included in the mapping relationship between the data symbol and the chip sequence, determine a first chip sequence corresponding to the first sequence, where the first chip sequence is one of the N chip sequences and N is a positive integer, and based on the mapping relationship between the data symbol and the chip sequence, determine a data symbol corresponding to the first chip sequence, and based on the data symbol corresponding to the first chip sequence, determine information bits corresponding to the first chip sequence.

[0042] Regarding the third or fourth aspect, in a possible implementation, L = 32, or L = 16, or L = 8.

[0043] Regarding the third or fourth aspect, in a possible implementation, the chip sequence is [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1], [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1], and [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] obtained based on at least one of them.

[0044] Regarding the third or fourth aspect, in a possible implementation, the chip sequence is obtained based on at least two of the following. [1 1 -1 1 -1 1 -1 -1] [1 1 -1 1 1 -1 -1 -1]. [1 1 1 -1 1 -1 -1 -1]

[0045] Regarding the third or fourth aspect, in a possible implementation, the chip sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the chip sequence.

[0046] Regarding the third or fourth aspect, in a possible implementation, at least two columns of elements in the matrix formed by the chip sequence are the same.

[0047] Regarding the third or fourth aspect, in a possible implementation, the chip sequence is [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1], and [0 0 0 1 1 1 0 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 1 1 0 0 0 0 0 1] , and is obtained based on these two sequences.

[0048] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0049]

Table 8

[0050] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0051]

Table 9

[0052] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0053]

Table 10

[0054] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0055]

Table 11

[0056] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0057]

Table 12

[0058] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0059]

Table 13

[0060] Regarding the third or fourth aspect, in a possible implementation, the mapping relationship between the data symbol and the chip sequence is as follows.

[0061]

Table 14

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

[0063] In a possible implementation, the memory is disposed outside the communication device.

[0064] In a possible implementation, the memory is disposed inside the communication device.

[0065] In this embodiment of the present application, the processor and the memory can alternatively be integrated into one device. In other words, the processor and the memory can alternatively be integrated with each other.

[0066] In a possible implementation, the communication device further includes a transceiver. The transceiver is configured to receive signals and / or send signals. For example, the transceiver may be configured to send a PPDU or the like.

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

[0068] In a possible implementation, the memory is disposed outside the communication device.

[0069] In a possible implementation, the memory is disposed inside the communication device.

[0070] In this embodiment of the present application, the processor and the memory may alternatively be integrated into one device. In other words, the processor and the memory may alternatively be integrated with each other.

[0071] In a possible implementation, the communication device further includes a transceiver. The transceiver is configured to receive and / or send signals. For example, the transceiver may be configured to receive a PPDU or the like.

[0072] According to a seventh aspect, an embodiment of the present application provides a chip. The communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface. The logic circuit is configured to generate a PPDU based on a mapping relationship between data symbols and chip sequences, and the interface is configured to output the PPDU.

[0073] According to an eighth aspect, an embodiment of the present application provides a chip. The communication device includes a logic circuit and an interface, and the logic circuit is coupled to the interface. The interface is configured to input a PPDU, and the logic circuit is configured to process the PPDU based on a mapping relationship between data symbols and chip sequences.

[0074] According to a ninth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program, and when the computer program is run on a computer, the method shown in any one of the first aspect or the possible implementations of the first aspect is implemented.

[0075] According to a tenth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium is configured to store a computer program, and when the computer program is run on a computer, the method shown in any one of the second aspect or the possible implementations of the second aspect is implemented.

[0076] According to the 11th aspect, an embodiment of the present application provides 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 the computer program or computer code is run on a computer, the method shown in any one of the 1st aspect or a possible implementation of the 1st aspect is implemented.

[0077] According to the 12th aspect, an embodiment of the present application provides 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 the computer program or computer code is run on a computer, the method shown in any one of the 2nd aspect or a possible implementation of the 2nd aspect is implemented.

[0078] According to the 13th aspect, an embodiment of the present application provides a computer program. When the computer program is run on a computer, the method shown in any one of the 1st aspect or a possible implementation of the 1st aspect is implemented.

[0079] According to the 14th aspect, an embodiment of the present application provides a computer program. When the computer program is run on a computer, the method shown in any one of the 2nd aspect or a possible implementation of the 2nd aspect is implemented.

[0080] According to the 15th aspect, an embodiment of the present application provides a wireless communication system. The wireless communication system includes a transmitting end and a receiving end. The transmitting end is configured to implement the method shown in any one of the 1st aspect or a possible implementation of the 1st aspect, and the receiving end is configured to implement the method shown in any one of the 2nd aspect or a possible implementation of the 2nd aspect.

Brief Description of the Drawings

[0081]

Figure 1

Figure 2

Figure 3

Figure 4a

Figure 4b

Figure 4c

Figure 5a

Figure 5b

Figure 6

Figure 7

Figure 8

Embodiments for Carrying Out the Invention

[0082] To make the object, technical solution, and advantages of the present application clearer, the present application will be further described with reference to the accompanying drawings.

[0083] In the specification, claims, and appended drawings of this application, terms such as "first", "second", etc. are used only to distinguish different objects and not to describe a specific order. Additionally, terms such as "comprising" and "having" and any other variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that comprises a series of steps or units is not limited to the enumerated steps or units, but may optionally further include steps or units not enumerated, or other steps or units specific to these processes, methods, products, or devices.

[0084] As used herein, "embodiments" means that the specific features, structures, or characteristics described in connection with the embodiments can be included in at least one embodiment of this application. The phrases shown at various places in this specification may not necessarily refer to the same embodiment and are not independent or alternative embodiments that are exclusive of other embodiments. It may be explicitly or implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0085] In this application, "at least one part (item)" means one or more, "a plurality of" means two or more, "at least two parts (items)" means two or three or more, and "and / or" is used to describe the association relationship between associated objects, indicating that three relationships can exist. For example, "A and / or B" may indicate that only A exists, only B exists, and both A and B exist, and A and B can be in singular or plural form. "Or" indicates that two relationships can exist, for example, only A exists and only B exists, and when A and B are not mutually exclusive, three relationships can exist, for example, only A exists, only B exists, and both A and B exist. The character " / " generally represents the "or" relationship between associated objects. "At least one of the following items (parts)" or a similar expression thereof means any combination of these items. For example, at least one of a, b, or c may indicate a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0086] The technical solutions provided in the embodiments of this application are applicable to a UWB-based wireless personal area network (WPAN). For example, the methods provided in the embodiments of this application are applicable to Institute of Electrical and Electronics Engineers (IEEE) 802.15 series protocols, such as the 802.15.4a protocol, the 802.15.4z protocol, the 802.15.4ab protocol, or future generation UWB WPAN standards. Examples are not listed in this specification. The technical solutions provided in the embodiments of this application are further applicable to various communication systems, such as the Internet of Things (IoT) system, vehicle-to-everything (V2X), narrowband Internet of Things (NB-IoT) systems, and are applied to devices used in vehicle-to-everything, Internet of Things nodes, sensors in the Internet of Things (IoT), such as smart cameras, smart remote controls, and smart water or electricity meters in smart homes, sensors in smart cities, etc.The technical solutions provided in the embodiments of the present application are further applicable to an LTE frequency division duplex (FDD) system, an LTE time division duplex (TDD) system, a universal mobile telecommunications system (UMTS), a worldwide interoperability for microwave access (WiMAX) communication system, a long term evolution (LTE) system, a fifth-generation (5G) communication system, a sixth-generation (6G) communication system, and the like.

[0087] UWB technology is a new wireless communication technology in which narrow impulses of non-sinusoidal waves are used for data transmission at the nanosecond level. Modulation is performed on impulses with very steep rise and fall times, and thus UWB occupies a wide spectral range. As a result, the signal has a bandwidth on the order of gigahertz (GHz). The bandwidth used by UWB generally exceeds 1 GHz. A UWB system does not need to generate a sinusoidal carrier signal and can directly transmit an impulse sequence. Therefore, a UWB system has a wide spectrum and low average power. A UWB wireless communication system has advantages such as high multipath resolution ability, low power consumption, and high confidentiality. This facilitates coexistence with other systems, thereby improving spectrum utilization and system capacity. In addition, in short-range communication applications, the transmission power of a UWB transmitter may generally be lower than 1 mW (milliwatt). Theoretically, the interference generated by a UWB signal is equivalent to white noise with only one broadband. This facilitates good coexistence between ultra-wideband communication and existing narrowband communication. Therefore, a UWB system and a narrowband (NB) communication system can operate simultaneously without interfering with each other. The method provided in the embodiments of this application can be implemented by a communication device in a wireless communication system. In a communication device, a module that implements the UWB system function may sometimes be called a UWB module, and a module that implements the narrowband communication system function may sometimes be called a narrowband communication module. The UWB module and the narrowband communication module may be different devices, chips, etc. This is not limited in the embodiments of this application. Of course, the UWB module and the narrowband communication module may alternatively be integrated into one device or chip. The implementation of the UWB module and the narrowband communication module in a communication device is not limited in the embodiments of this application. For example, the method provided in the embodiments of this application may be implemented by a narrowband communication module.Optionally, part of the method provided in the embodiments of the present application may be implemented by a narrowband communication module, and another part may be implemented by a UWB module. For example, based on the mapping relationship provided in the embodiments of the present application, after the modulated symbol is obtained, the modulated symbol may be sent by using a UWB impulse, for example, sent by a UWB module. For example, after the information bits of the PPDU are mapped to the chip sequence based on the mapping relationship provided in the embodiments of the present application, BPSK modulation, QPSK modulation, etc. may be performed on the chip sequence, and then sent by using a UWB impulse. The processing methods other than the mapping relationship are not limited in the embodiments of the present application.

[0088] The embodiments of the present application are mainly described by way of example by using WPAN, specifically, by way of example by using the network used in the IEEE802.15 series of standards. However, those skilled in the art can easily understand that various aspects in the embodiments of the present application can be extended to other networks using various standards or protocols, such as Wireless Local Area Network (WLAN), Bluetooth (BLUETOOTH), High Performance Radio LAN (HIPERLAN) (a wireless standard similar to the IEEE802.11 standard mainly used in Europe), Wide Area Network (WAN), or other networks that are currently known or will be developed in the future. Therefore, regardless of the coverage area used and the wireless access protocol used, various aspects provided in the embodiments of the present application are applicable to any suitable wireless network.

[0089] The method provided in the embodiments of this application can be implemented by a communication device in a wireless communication system. The communication device can be a device in a UWB system. For example, the communication device can include, but is not limited to, a communication server, a router, a switch, a bridge, a computer, a mobile phone, etc. In another example, the communication device can include a user equipment (UE). The user equipment can include various handheld devices, vehicle-mounted devices (e.g., an automobile or a component mounted on an automobile), wearable devices, internet of things (IoT) devices, or computing devices having a wireless communication function, another processing device connected to a wireless modem, etc. Examples are not enumerated one by one in this specification. In another example, the communication device can include a central control point, for example, a personal area network (PAN) or a PAN coordinator. The PAN coordinator or PAN can be a mobile phone, a vehicle-mounted device, a tag, a smart home, etc. In another example, the communication device may include a chip, and the chip may be disposed in a communication server, a router, a switch, a terminal device, etc. Examples are not enumerated one by one in this specification. It may be understood that the description of the communication device is also applicable to the first communication device and the second communication device shown below.

[0090] For example, FIGS. 1 and 2 are diagrams of the architecture of a communication system according to an embodiment of the present application. FIG. 1 shows a star topology structure according to an embodiment of the present application, and FIG. 2 shows a point-to-point topology structure according to an embodiment of the present application. As shown in FIG. 1, in a star topology, one central control node can perform data communication with one or more other devices. As shown in FIG. 2, in a point-to-point topology structure, data communication can be performed between different devices. In FIGS. 1 and 2, both a full function device and a reduced function device may be understood as communication devices shown in the embodiments of the present application. The full function device and the reduced function device are relative to each other. For example, the reduced function device may not be a PAN coordinator. In another example, compared with the full function device, the reduced function device may not have adjustment capabilities or may have a lower communication rate than the full function device. The PAN coordinator shown in FIG. 2 is only an example, and the other three full function devices shown in FIG. 2 may also be used as PAN coordinators, and it may be understood that the PAN coordinators are not shown one by one in this specification.

[0091] In an example, in an embodiment of the present application, the transmitting end may be a full function device, the receiving end may be a reduced function device, or the transmitting end may be a reduced function device, the receiving end may be a full function device, or both the transmitting end and the receiving end may be full function devices, or both the transmitting end and the receiving end may be reduced function devices. In another example, the transmitting end may be a coordinator, the receiving end may be a non-coordinator, or the transmitting end may be a non-coordinator, the receiving end may be a coordinator, or both the transmitting end and the receiving end may be coordinators, etc. The examples are not listed one by one in this specification.

[0092] It may be understood that the full-function device and the reduced-function device shown in the embodiments of this application are merely examples of communication devices. However, any communication device capable of implementing the PPDU-based communication method provided in the embodiments of this application falls within the protection scope of the embodiments of this application.

[0093] Generally, the narrowband signal used to assist UWB may be sent with an offset quadrature phase shift keying (O-QPSK) modulation scheme. To improve system robustness, it is necessary to map four encoded (or unencoded) information bits to a chip sequence before O-QPSK modulation. Therefore, the receiving end determines the sent information bits by using the chip sequence. Generally, when four information bits are mapped to a chip sequence of a specific length, the minimum Hamming distance between any two chip sequences is less than L / 2, where L is the bit length of the chip sequence. However, the minimum Hamming distance can be further increased.

[0094] From this perspective, the embodiments of the present application provide a PPDU-based communication method and apparatus for effectively increasing the minimum Hamming distance between chip sequences. In an example, after receiving a PPDU, the receiving end may compare the sequence in the PPDU with the chip sequences in the mapping relationship, and then determine the data symbol corresponding to the sequence based on the similarity. Generally, when the Hamming distance between any two chip sequences is large, it indicates that more bits may be incorrect. Therefore, the minimum Hamming distance between chip sequences is increased, so that the probability of errors occurring when the receiving end identifies the sequence is lower, effectively improving the accuracy of the receiving end to identify the sequence and improving the system performance. Optionally, in the method provided by the embodiments of the present application, each of the data symbols may have at least two fixed chip values with fixed positions. Since each of the data symbols may have at least two fixed chip values with fixed positions, the fixed chip values may be used as pilots (pilots are generally known signals), so that the receiving end can perform frequency offset estimation and compensation based on the fixed chip values to improve the anti-frequency offset ability of the system.

[0095] It should be noted that the minimum Hamming distance shown in this embodiment of the present application may be understood as the smallest Hamming distance between any two chip sequences in the mapping relationship between the data symbol and the chip sequence. The Hamming distance can be described as follows. In information theory, the Hamming distance between two equal-length sequences is the amount of different values at corresponding positions in the two sequences. In other words, the Hamming distance is the amount of sequence values that need to be replaced when one sequence is converted to another sequence. For example, the Hamming distance between 1011101 and 1001001 is 2.

[0096] For the description of the transmitting end and the receiving end in the embodiments of this application, refer to the descriptions of FIGS. 1 and 2. The transmitting end may be understood as a communication device for sending a PPDU, and the receiving end may be understood as a communication device for receiving a PPDU. Whether another transfer device is further included between the transmitting end and the receiving end is not limited in the embodiments of this application. Similarly, the function of the PPDU is not limited in the embodiments of this application.

[0097] FIG. 3 is a schematic flowchart of a PPDU-based communication method according to an embodiment of this application. As shown in FIG. 3, this method includes the following steps.

[0098] 301: The transmitting end generates a PPDU based on the mapping relationship between data symbols and chip sequences.

[0099] In an example, the minimum Hamming distance is L / 2 or more, where L represents the bit length of the chip sequence and L is a positive integer.

[0100] In another example, the minimum Hamming distance is floor{L / 2} or more, where floor represents rounding down.

[0101] For example, in this embodiment of this application, N may be further used to represent the amount of different data symbols in the mapping relationship between data symbols and chip sequences, and the value of N is related to the first length shown below. For example, when the first length is 4 bits, N = 16. In another example, when the first length is 3 bits, N = 8. Of course, the relationship between the first length and N shown in this specification is only an example and should not be construed as a limitation to the embodiments of this application. For ease of explanation, an example where the first length is 4 bits is used below, but this should not be construed as a limitation to the embodiments of this application.

[0102] For example, when L = 32, the minimum Hamming distance is 16 or more. In another example, when L = 16, the minimum Hamming distance is 8 or more. In another example, when L = 8, the minimum Hamming distance is 4 or more. It may be understood that the values of L shown in this specification are merely examples. In a specific implementation, chip sequences of other lengths (for example, L can be even or odd) may be further used. This is not limited in the embodiments of this application.

[0103] Spread spectrum is a communication technology that spreads the spectrum of a transmitted signal over a bandwidth wider than the original bandwidth. Through spread spectrum, the original bandwidth of the PPDU can be effectively extended, and the spectrum of the PPDU can be expanded. The spread spectrum shown in this embodiment of this application may be understood as mapping information bits of a first length to a sequence of a second length (or mapping data symbols to a sequence of a second length, where the data symbols are obtained based on the information bits of the first length), and in the same length measurement standard, the first length is greater than the second length. Since information bits of a specific length are mapped to a longer sequence, the effect of extending the original bandwidth of the PPDU is achieved. Therefore, the sequence of the second length shown in this embodiment of this application is also sometimes called a chip sequence. Of course, the sequence of the second length may alternatively have another name, for example, a pseudo-random sequence, a sequence with a length of L, or a sequence including L chips or chip values. This is not limited in the embodiments of this application. The second length shown above may be understood to be equal to L shown in this embodiment of this application.

[0104] It should be noted that the mapping relationship between the data symbol and the chip sequence shown in this embodiment of the present application is only an example. In a specific implementation, the transmitting end may alternatively generate a PPDU based on the mapping relationship between information bits and chip sequences. Hereinafter, the process of generating a PPDU will be described in detail.

[0105] FIG. 4a is a diagram of the structure of a PPDU according to an embodiment of the present application. As shown in FIG. 4a, the PPDU may include at least a preamble, a start-of-frame delimiter (SFD), a physical layer header (PHR), and a payload. It may be understood that the content and order in the PPDU shown in FIG. 4a are only examples and should not be construed as limitations to the embodiments of the present application. In a specific implementation, the PPDU may alternatively have another structure. This is not limited in the embodiments of the present application.

[0106] Figure 4b is a diagram of the O-QPSK modulation and spreading procedure according to an embodiment of the present application. As shown in Figure 4b, the information bits of the PPDU (which may also be referred to as data bits such as binary data or a binary bit stream) undergo a mapping of the information bits to data symbols (bit-to-symbol), a mapping of the data symbols to chip sequences (symbol-to-chip) (which may also be referred to as spreading), and then O-QPSK modulation is performed to output the modulated symbols (modulated signals). In other words, after obtaining the information bits based on the PPDU structure, the transmitting end maps the information bits to data symbols, for example, maps 4 bits to one data symbol at a time, then maps each of the data symbols to different chip sequences based on the mapping relationship between the data symbols and the chip sequences, and finally performs O-QPSK modulation to obtain the modulated symbols. Therefore, the transmitting end can send the modulated symbols shown in Figure 4b.

[0107] Figure 4c is a diagram of the O-QPSK modulation and spreading procedure according to an embodiment of the present application. As shown in Figure 4c, the information bits of the PPDU undergo a mapping of the information bits of the PPDU to chip sequences, and then O-QPSK modulation is performed to output the modulated symbols (modulated signals). In other words, after obtaining the information bits based on the internal structure of the PPDU, the transmitting end maps every 4 information bits to different chip sequences based on the mapping relationship between the information bits and the chip sequences, performs O-QPSK modulation, and can send the modulated symbols shown in Figure 4c.

[0108] In the flowcharts shown in FIGS. 4b and 4c, after O-QPSK modulation is performed on the chip values obtained based on the mapping relationship between the data symbol and the chip sequence or the mapping relationship between the information bit and the chip sequence, it is possible to ensure that the formed signals are orthogonal. Therefore, non-coherent demodulation at the receiving end can be supported, and the complexity is low.

[0109] Note that the data symbol shown in FIG. 4b is different from the orthogonal frequency division multiplexing (OFDM) symbol in a wireless communication network. The data symbol shown in this embodiment of the present application may be understood as the value obtained when the information bits of the first length are mapped to decimal values. For example, when the first length is 4 bits, the data symbol can be represented as values from 0 to 15. Generally, the mapping between the data symbol and the chip sequence may be understood as mapping the corresponding data symbol (for example, decimal value) every 4 bits to the chip sequence including L chips. Of course, the relationship between the information bits of the first length and the data symbol shown in this embodiment of the present application is only an example. For example, the data symbol may alternatively be the value obtained when the information bits of the first length are mapped to hexadecimal values, the value obtained when the information bits of the first length are mapped to octal values, etc. This is not limited in the embodiments of the present application.

[0110] Based on the mapping relationship between the data symbol and the chip sequence (or the mapping relationship between the information bit and the chip sequence) provided in this embodiment of the present application, the chip value of the chip sequence may alternatively be understood to use another modulation scheme, for example, binary phase shift keying (BPSK) and QPSK. Optionally, the modulated symbol may be sent directly. Alternatively, the modulated symbol may be carried by using a group of UWB impulses and transmitted over the UWB channel. The group of UWB impulses shown herein may be sent continuously or sent in segments. This is not limited in the embodiments of the present application. Further, a guard interval may be reserved between segments and between different modulated symbols, that is, the signal may not be sent within the guard interval, effectively avoiding the interference between the modulated symbols caused by multipath.

[0111] Based on FIGS. 4a to 4c, generating the PPDU shown in this embodiment of the present application may be further understood as follows. The transmitting end obtains the information bits of the PPDU, and then performs processing based on the information bits of the PPDU and the mapping relationship between the data symbol and the chip sequence to obtain the modulated symbol. The processing herein may include at least one of mapping from the information bit to the data symbol, mapping from the data symbol to the chip sequence, and modulation. For example, generating the PPDU shown in step 301 may include generating the modulated symbol of the PPDU.

[0112] Hereinafter, the mapping relationship in this embodiment of the present application will be described using examples. It may be understood that the following mapping relationships are only examples.

[0113] In a possible implementation, the mapping relationship includes that every four information bits are mapped to a chip sequence with a length of 32 bits. In another possible implementation, the mapping relationship includes that every four information bits are mapped to a chip sequence with a length of 16 bits. In yet another possible implementation, the mapping relationship includes that every four information bits are mapped to a chip sequence with a length of 8 bits. Of course, in a specific implementation, another mapping relationship may be included as an alternative. This is not limited in the embodiments of this application. For a specific description of the mapping relationship, please refer to the following description. Hereinafter, only some mapping relationships are shown as examples.

[0114] It may be understood that the following only shows examples of the mapping relationship between data symbols and chip sequences. For the mapping relationship between information bits and chip sequences, please adaptively refer to the mapping relationship between data symbols and chip sequences shown below. The mapping relationship between data symbols and chip sequences in each of Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, and Table 10 shown below is not limited in the embodiments of this application. In other words, the specific data symbol to which the chip sequence is mapped is not limited in the embodiments of this application. The mapping relationships shown below are only examples.

[0115] In the example, Table 1 is the mapping relationship provided in this embodiment of this application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 1 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of this application.

[0116]

Table 15

[0117] The chip sequences shown in Table 1 are in the sequence

[0118] [Number]

[0119] ,

[0120] [Number]

[0121] ,

[0122] [Number]

[0123] ,..., and

[0124] [Number]

[0125] when shown as, the Hamming distance between any two chip sequences is shown in Table 2.

[0126] [Table 16]

[0127] From Table 2, it can be seen that the minimum Hamming distance in this embodiment of the present application is 16. Furthermore, the Hamming distances between different chip sequences are distributed from 16 to 18, avoiding that an overly large or overly small Hamming distance between any two different chip sequences affects the Hamming distances between other chip sequences.

[0128] In another example, Table 3 shows the mapping relationship provided in this embodiment of the present application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 3 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application.

[0129]

Table 17

[0130] When the chip sequences shown in Table 3 are in the sequence

[0131]

Number

[0132] ,

[0133]

Number

[0134] ,

[0135]

Number

[0136] ,..., and

[0137]

Number

[0138] are shown as, the Hamming distance between the chip sequences is shown in Table 4.

[0139]

Table 18

[0140] From Table 4, it can be seen that the minimum Hamming distance in this embodiment of the present application is 16. Further, the Hamming distances between different chip sequences are distributed from 16 to 18, avoiding that an overly large or overly small Hamming distance between any two different chip sequences affects the Hamming distances between other chip sequences.

[0141] In another example, Table 5 shows the mapping relationship provided in this embodiment of the present application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 5 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application. It may be understood that the minimum Hamming distance in Table 5 is 16, or it may be understood that the Hamming distances between chip sequences are all 16.

[0142] [Table 19]

[0143] In another example, Table 6 shows the mapping relationship provided in this embodiment of the present application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 6 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application. It may be understood that the minimum Hamming distance in Table 6 is 16, or it may be understood that the Hamming distances between chip sequences are all 16.

[0144] [Table 20]

[0145] In another example, Table 7 shows the mapping relationship provided in this embodiment of the present application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 7 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application.

[0146]

Table 21

[0147] When the chip sequences shown in Table 7 are shown as M1, M2,..., M16 in the sequence, the Hamming distance between the chip sequences is shown in Table 8.

[0148]

Table 22

[0149] From Table 8, it can be seen that the minimum Hamming distance in this embodiment of the present application is 16. Furthermore, the Hamming distances between different chip sequences are distributed from 16 to 20 to avoid an overly large or overly small Hamming distance between any two different chip sequences from affecting the Hamming distances between other chip sequences.

[0150] In another example, Table 9 shows the mapping relationship provided in this embodiment of the present application. Table 9 shows the mapping relationship in the case where L = 16 and the data symbols of every four information bits are mapped to a chip sequence with a length of 16 (or a sequence containing 16 chips). A person skilled in the art can appropriately modify the mapping relationship shown in Table 9 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application.

[0151]

Table 23

[0152] In another example, Table 10 is the mapping relationship provided in this embodiment of the present application. A person skilled in the art can appropriately modify the mapping relationship shown in Table 10 to the mapping relationship between information bits and chip sequences. Whether the transmitting end maps information bits to chip sequences or maps data symbols to chip sequences is not limited in the embodiments of the present application.

[0153]

Table 24

[0154] It may be understood that Tables 1 to 10 are only examples. For other mapping relationships or Hamming distances, please refer to the following description. Details are not described in this specification.

[0155] 302: The transmitting end sends a PPDU, and correspondingly, the receiving end receives the PPDU.

[0156] 303: The receiving end processes the PPDU based on the mapping relationship between data symbols and chip sequences.

[0157] For example, the receiving end processing the PPDU includes the following. The first sequence in the PPDU is obtained, and the length of the first sequence is L. In other words, the length of the first sequence obtained by the receiving end is the same as the length of the chip sequence shown above. Then, the first chip sequence corresponding to the first sequence is determined based on the N chip sequences included in the mapping relationship between the data symbol and the chip sequence (for example, the mapping relationships in Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10), the first chip sequence is one of the N chip sequences, and N is a positive integer. Further, the data symbol corresponding to the first chip sequence is determined based on the mapping relationship between the data symbol and the chip sequence, and the information bit corresponding to the first chip sequence is determined based on the data symbol corresponding to the first chip sequence. Of course, after determining the first chip sequence, the receiving end may alternatively determine the information bit corresponding to the first chip sequence based on the mapping relationship between the information bit and the chip sequence (see Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10 adaptively). It may be understood that there may be other mapping relationships based on the following five implementations for the mapping relationships shown in Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10. The mapping relationships are not enumerated one by one in the embodiments of this application. However, the mapping relationships shown in Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, or Table 10 should not be construed as limitations to the embodiments of this application. The first sequence shown above is only an example, and it may be understood that the way the receiving end processes another sequence in the PPDU is the same as the way it processes the first sequence. Details are not described again herein.

[0158] For example, the receiving end processing the PPDU may include the following as an alternative. The receiving end demodulates the sequence received by the receiving end. For example, when the transmitting end performs modulation based on O-QPSK, the receiving end may perform demodulation based on O-QPSK. In another example, when the transmitting end performs modulation based on BPSK, the receiving end may perform demodulation based on BPSK. In another example, when the transmitting end performs modulation based on QPSK, the receiving end may perform demodulation based on QPSK. Another way for the receiving end to process the PPDU is not limited in the embodiments of the present application.

[0159] In this embodiment of the present application, the minimum Hamming distance in the mapping relationship is increased, whereby the probability that the receiving end inaccurately determines the data symbol can be effectively reduced, the probability that the receiving end inaccurately determines the information bit is reduced, the reliability of communication between the two communication parties is effectively guaranteed, and the system performance is improved.

[0160] Compared with the mapping relationship shown in FIG. 5a, the minimum Hamming distance in the mapping relationship provided in this embodiment of the present application is greater than the minimum Hamming distance shown in FIG. 5a. The Hamming distance between different chip sequences in the mapping relationship shown in FIG. 5a may be shown in FIG. 5b, and the minimum Hamming distance is 12. In the mapping relationship shown in FIG. 5a, the Hamming distance between different chip sequences is from 12 to 20, and the autocorrelation characteristics between different chip sequences are guaranteed by sacrificing the Hamming distance. As a result, the bit error rate at the receiving end is high. However, according to the mapping relationship provided in this embodiment of the present application, while the minimum Hamming distance is effectively increased, the autocorrelation characteristics between different chip sequences are guaranteed, whereby the probability that the receiving end inaccurately determines the information bit is effectively reduced, the bit error rate at the receiving end is reduced, the reliability of communication between the two communication parties is guaranteed, and the system performance is improved.

[0161] Hereinafter, the mapping relationship provided in this embodiment of the present application will be described in detail.

[0162] It should be noted that the following design processes of the chip sequence are merely examples. Optionally, the chip sequence may be predefined in the standard or may be a preset sequence or the like. In other words, the chip sequence shown in this embodiment of the present application is not necessarily implemented by using the following steps (for example, from Equation (1) to Equation (6)). For example, for the mapping relationship between the chip sequence and the information bits or the mapping relationship between the chip sequence and the data symbols, refer to Table 1, Table 3, Table 5, Table 6, Table 7, Table 9, Table 10, etc. For example, in actual applications, two communication parties may store the mapping relationship between the information bits and the chip sequence or the mapping relationship between the data symbols and the chip sequence for interaction. There may not be the following method for determining the chip sequence. Instead, the method shown in FIG. 3 is executed by storing the mapping relationship between the information bits and the chip sequence or the mapping relationship between the data symbols and the chip sequence. Therefore, any method in which the PPDU can be generated based on the mapping relationship between the information bits and the chip sequence or the mapping relationship between the data symbols and the chip sequence shown in this embodiment of the present application and the minimum Hamming distance between the chip sequences is L / 2 or more falls within the protection scope of the embodiments of the present application.

[0163] Implementation 1

[0164]

Number

[0165] is a sequence of length 8, and assuming that the periodic autocorrelation function of each element S i =1 / -1 in the sequence is defined as follows.

[0166]

Number

[0167] The value of i ranges from 0 to 7, and the value of τ is related to the length of the sequence, (i + τ)8 = mod(i + τ, 8), that is, the remainder is obtained by dividing i + τ by 8. In this case, (8 - R S (τ)) / 2 is the sequence

[0168]

Number

[0169] and

[0170]

Number

[0171] is equal to the Hamming distance between the sequence obtained by circularly shifting the sequence by τ. Based on the relationship between the Hamming distance and the autocorrelation function, it can be seen that a smaller R S (τ) indicates a larger Hamming distance. Cases where the Hamming distance is 0 are excluded. When τ is set to different values, the Hamming distance between the circular sequences has the following 14 cases as shown in Table 11.

[0172]

Table 25

[0173] The four sequences of length 8 containing 1 and -1 are respectively

[0174]

Number

[0175] ,

[0176]

Number

[0177] 、

[0178]

Number

[0179] 、and

[0180]

Number

[0181] is assumed. The four sequences are spliced together uniformly to form a sequence

[0182]

Number

[0183] of length 32. The sequence

[0184]

Number

[0185] is circularly shifted by only 0 bits, 4 bits, 8 bits, 12 bits, 16 bits, 20 bits, 24 bits, and 28 bits to obtain eight sequences of length 32, and then the values of the even bits (or odd bits) of the sequences obtained through the circular shift are negated to obtain eight other sequences. In this specification,

[0186]

Number

[0187] is used to represent 16 sequences, where i = 0, 1, 2, ..., or 15. The sequence

[0188]

Number

[0189] ,

[0190]

Number

[0191] ,

[0192]

Number

[0193] , and

[0194]

Number

[0195] 's periodic autocorrelation functions are shown as R a (τ), R b (τ), R c (τ), and R d (τ), respectively. Therefore, the sequence

[0196]

Number

[0197] and the sequence

[0198]

Number

[0199] satisfies Equation (2).

[0200] [Number]

[0201] The condition of the first formula in Equation (2) may be understood as that i is 7 or less and j is 7 or less, or i is 8 or more and j is 8 or more. The condition of the second formula in Equation (2) is |i - j| = 8. The condition of the third formula in Equation (2) is that i is 8 or more and j is 7 or less, or i is 7 or less and j is 8 or more.

[0202] In this specification, τ = |i - j|. Therefore, the Hamming distance between different sequences is shown in Table 12 below (i < j). Since the Hamming distance in the case where i is smaller than j is symmetric to the Hamming distance in the case where i is larger than j, it may be understood that Table 12 only shows examples of the Hamming distance in the case where i is smaller than j.

[0203] [Table 26]

[0204] In Table 12, the Hamming distance may satisfy Equation (3) and Equation (4). A(τ) = (32 - R a (τ) - R b (τ) - R c (τ) - R d (τ)) / 2 (3) B(τ) = (32 - R a (τ) + R b (τ) - R c (τ) + R d (τ)) / 2 (4)

[0205] Therefore, in a possible implementation, in order to make the Hamming distance between different sequences as large as possible, when τ ≠ 0, R b (τ) + R d (τ) = 0, and Ra (τ) + R c (τ) is as small as possible. Therefore, based on the distribution of the Hamming distance between the cyclic sequences in Table 11, the sequences

[0206]

Number

[0207] and the sequences

[0208]

Number

[0209] between the cyclic sequences of, and the sequences

[0210]

Number

[0211] and the sequences

[0212]

Number

[0213] between the cyclic sequences of are cases where the sum of the Hamming distances is equal to 8 in Table 11, for example, Case 2 and Case 14, Case 5 and Case 10, or Case 6 and Case 8. Therefore, the sequences

[0214]

Number

[0215] and

[0216]

Number

[0217] can be obtained according to any one of the following formulas. [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1] (5) [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1] (6) [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] (7)

[0218] sequence

[0219]

Number

[0220] and

[0221]

Number

[0222] can be respectively shown by any one of formulas (5) to (7), or can be obtained by performing a circular shift, a negation operation, or a reverse order operation according to any one of formulas (5) to (7). The circular shift, the negation operation, or the reverse order operation does not affect the autocorrelation of the sequence. Since this embodiment of the present application focuses on the sum of the autocorrelations of two sequences, the circular shift, the negation, and the exchange performed on any one of the sequences shown in formulas (5) to (7) do not affect the Hamming distance.

[0223] sequence

[0224]

Number

[0225] and

[0226]

Number

[0227] Whether it is Formula (5), Formula (6), or Formula (7) may be understood not to be limited in the embodiments of the present application.

[0228] Based on the distribution of the Hamming distances between the cyclic sequences in Table 11, the sequence

[0229]

Number

[0230] and the sequence

[0231]

Number

[0232] the Hamming distance between the cyclic sequences of, and the sequence

[0233]

Number

[0234] and the sequence

[0235]

Number

[0236] the Hamming distance between the cyclic sequences of are cases where the Hamming distance is large in Table 11, for example, Case 8, Case 10, or Case 14. Therefore, the sequence

[0237]

Number

[0238] and

[0239] [Number]

[0240] can be obtained based on any one of the sequences in the following formula (8). For example, the sequence

[0241] [Number]

[0242] and

[0243] [Number]

[0244] can be any two different sequences selected from the three sequences shown in formula (8), or can be a sequence obtained by separately performing a circular shift, a negation operation, or a reverse order operation on two of the three sequences shown in formula (8). [1 1 -1 1 -1 1 -1 -1], [1 1 -1 1 1 -1 -1 -1], (8) [1 1 1 -1 1 -1 -1 -1]

[0245] Sequence

[0246] [Number]

[0247] and

[0248] [Number]

[0249] and sequence

[0250] [Number]

[0251] and

[0252] [Number]

[0253] is obtained from Equation (5) to Equation (8), and then sequence

[0254] [Number]

[0255] can be obtained. Then, sequence

[0256] [Number]

[0257] is circularly shifted by only 0 bit, 4 bits, 8 bits, 12 bits, 16 bits, 20 bits, 24 bits, and 28 bits to obtain eight sequences with a length of 32. Then, the values of the even bits (or odd bits) of the sequences obtained through the circular shift are negated to obtain eight other sequences. Therefore, the Hamming distance between any two different sequences among the formed 16 sequences

[0258] [Number]

[0259] is 16, 18, or 20. In other words, the minimum Hamming distance is 16.

[0260] For example,

[0261] [Number]

[0262] (The first sequence in Equation (8) is circularly shifted one bit to the right),

[0263] [Number]

[0264] (The first sequence in Equation (5) is circularly shifted two bits to the left),

[0265] [Number]

[0266] (The third sequence in Equation (8) is circularly shifted four bits to the right and a reverse order operation is performed), and

[0267] [Number]

[0268] (When the second sequence in Equation (5) is circularly shifted one bit to the right), the 16 sequences

[0269] [Number]

[0270] form the following matrix M1.

[0271] M1=[-1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1] (9)

[0272] In matrix M1 or matrix (-M1) (i.e., matrix M1 is negated as a whole), -1 is replaced by 1, and 1 is replaced by 0, whereby the matrix can be used as a mapping relationship between 16 information bits of length 4 and a chip sequence as shown in Table 1, or can be used as a mapping relationship between 16 data symbols and a chip sequence of length 32. For the Hamming distance between different chip sequences, see Table 2. Details will not be described again in this specification. Of course, -1 in the matrix may alternatively be replaced by 0. This is not limited in the embodiments of this application. If each element in matrix M1 is denoted as m and each element in the chip sequence of length 32 is denoted as m', the following operation may be understood to be performed alternatively for each element in matrix M1 to obtain 16 chip sequences of length 32: m' = (m + 1) / 2 or m' = (1 - m) / 2. The description of the replacement may also be understood to be applicable to the following description.

[0273] Regarding the matrix M1 shown in Equation (9), note that each row of matrix M1 may correspond to one data symbol, and there are a total of 16 rows. Therefore, matrix M1 corresponds to 16 data symbols. Therefore, after -1 and 1 in matrix M1 are replaced by 0, the mapping relationship shown in Table 1 can be obtained. Therefore, the sequences shown in this embodiment of this application (for example, the above four sequences

[0274]

Number

[0275] ,

[0276]

Number

[0277] ,

[0278]

Number

[0279] 、and

[0280]

Number

[0281] ) The amount (or sequence length) may be related to the amount of different data symbols and the length of the chip sequence. All mapping relationships obtained according to the above rules fall within the protection scope of the embodiments of this application. This description is also applicable to the following description.

[0282] In another example,

[0283]

Number

[0284] (The first sequence in formula (8) is inverted),

[0285]

Number

[0286] (The second sequence in formula (6) is circularly shifted 1 bit to the left),

[0287]

Number

[0288] (The third sequence in formula (8) is circularly shifted 3 bits to the right), and

[0289]

Number

[0290] When the first sequence in formula (6) is circularly shifted 4 bits to the right, the 16 sequences

[0291]

Number

[0292] form the following matrix M2.

[0293] M2 = [-1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1] (10)

[0294] In matrix M2 or matrix (-M2) (i.e., matrix M2 is negated as a whole), -1 is replaced by 1, and 1 is replaced by 0, whereby the matrix can be used as a mapping relationship between 16 information bits of length 4 and a chip sequence as shown in Table 3, or can be used as a mapping relationship between 16 data symbols and a chip sequence of length 32. For the Hamming distance between different chip sequences, refer to Table 4. Details will not be described again herein.

[0295] In the mapping relationship shown in this embodiment of the present application, from Tables 2 and 4, the Hamming distance between different chip sequences includes 16 and 18. Therefore, it can be understood that the value obtained when the Hamming distance between different chip sequences is added becomes the largest, effectively reducing the bit error rate at the receiving end.

[0296] In another possible implementation, when τ≠0, R b (τ)+R d (τ)=0, and when τ≠0, R a (τ)+R c (τ)=0. In this case, any two sequences

[0297]

Number

[0298] and

[0299]

Number

[0300] The Hamming distance between them is equal to 16, the signals formed by performing O-QPSK modulation on the formed chip sequences are orthogonal to each other, and non-coherent reception (or called non-coherent demodulation) can be supported. In this case, the sequences

[0301] [Number]

[0302] and

[0303] [Number]

[0304] can be any one of three pairs of sequences in formulas (5), (6), and (7). Additionally, the sequence

[0305] [Number]

[0306] and

[0307] [Number]

[0308] can also be any one of three pairs of sequences in formulas (5), (6), and (7).

[0309] Since circular shift, negation operation, and reverse order operation do not affect the autocorrelation of the sequence, at least one of the following operations is performed on the sequence

[0310] [Number]

[0311] and

[0312] [Number]

[0313] When it can be performed separately for, the Hamming distance and orthogonality after O-QPSK modulation are not affected: The operations are circular shift, inversion, negation, or

[0314]

Number

[0315] and

[0316]

Number

[0317] is to exchange with. In addition, at least one of the following operations on the sequence

[0318]

Number

[0319] and

[0320]

Number

[0321] When performed on, the Hamming distance and orthogonality after O-QPSK modulation are also not affected: The operations are circular shift, inversion, negation, or

[0322]

Number

[0323] and

[0324]

Number

[0325] is to exchange with.

[0326] For example,

[0327]

Number

[0328] (The second sequence in Equation (5) is circularly shifted one bit to the right and then inverted),

[0329]

Number

[0330] (The first sequence in Equation (6) is circularly shifted one bit to the right),

[0331]

Number

[0332] (The first sequence in Equation (5) is circularly shifted one bit to the right), and

[0333]

Number

[0334] (When the second sequence in Equation (6) is circularly shifted one bit to the left), the 16 sequences

[0335]

Number

[0336] form the following matrix M3.

[0337] M3=[-1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1] (11)

[0338] The Hamming distance between any two different sequences is 16.

[0339] In matrix M3 or matrix (-M3) (i.e., the entire matrix M3 is negated), -1 is replaced with 1, and 1 is replaced with 0, whereby the matrix can be used as a mapping relationship between 16 information bits of length 4 and a chip sequence as shown in Table 5, or as a mapping relationship between 16 data symbols and a chip sequence of length 32.

[0340] The matrix shown in Implementation 1 is merely an example, and it may be understood that other mapping relationships may be further included based on the method shown above. Examples are listed one by one in this specification.

[0341] In the mapping relationship shown in this embodiment of the present application, the Hamming distance between different chip sequences is all 16. Therefore, the signals formed by performing O-QPSK modulation on the formed chip sequences are orthogonal to each other, and non-coherent demodulation at the receiving end can be supported, thereby reducing the demodulation complexity at the receiving end.

[0342] Based on the mapping relationship shown in this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the minimum Hamming distance can be effectively increased, the bit error rate at the receiving end can be reduced, and the system performance can be improved.

[0343] Implementation 2

[0344] In mathematics, a Hadamard matrix is a square matrix, each of whose elements is +1 or -1, and the rows are orthogonal to each other, and the columns are also orthogonal to each other. The n*n order Hadamard matrix H satisfies HH T =nI n where I n is the n*n order identity matrix in this specification. Since all rows of the Hadamard matrix are orthogonal to each other, the Hamming distance between different rows is n / 2.

[0345] Therefore, in this embodiment of the present application, in the mapping matrix M of 16 rows and 32 columns including 16 chip sequences with a length of 32, odd columns may be formed by a 16×16 Hadamard matrix, and even columns may also be formed by a 16×16 Hadamard matrix. In addition, each row in the matrix forming the odd columns and each row in the matrix forming the even columns form a Gray complementary pair sequence. In this way, the following effects can be achieved. 1. The Hamming distance between any two different sequences is 16. 2. Different symbols obtained through O-QPSK modulation are orthogonal, and non-coherent demodulation can be supported. 3. Each of the data symbols has two fixed chip values with fixed positions, and the fixed chip values are used by the receiving end to perform frequency offset estimation and compensation, so that the anti-frequency offset ability of the system can be improved. 4. The modulated symbols have a low peak to average power ratio (PAPR), and the PAPR of the Gray sequence is 3 dB or less.

[0346] For example, the element in the r-th row and c-th column of the Hadamard matrix may satisfy the following formula (12).

[0347]

Equation

[0348] In this specification, bitget(x,n) is equal to the value of the n-th bit represented by x in binary, and K is a parameter in the range from 0 to 15, and different Ks can be used to generate different Hadamard matrices. Therefore, two different Ks can be selected to form even columns and odd columns in the mapping matrix.

[0349] For example, when K = 1 and K = 14, the following matrix M4 can be formed.

[0350] M4=[-1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1] (13)

[0351] In matrix M4 or -M4, -1 is replaced by 1, and 1 is replaced by 0, whereby the matrix can be used as a mapping relationship between 16 information bits of length 4 and a chip sequence, as shown in Table 6, or as a mapping relationship between 16 data symbols and a chip sequence of length 32.

[0352] Based on the mapping relationship shown in this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the Hamming distance between chip sequences corresponding to different data symbols can be 16, whereby the system performance can be effectively improved. In addition, each of the data symbols has at least two fixed chip values with fixed positions. Since each of the data symbols can have at least two fixed chip values with fixed positions, the fixed chip values may be used as pilots, whereby the receiving end can perform frequency offset estimation and compensation based on the fixed chip values to improve the anti-frequency offset ability of the system.

[0353] Implementation 3

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

[0355]

Table 27

[0356] Sixteen Gold sequences are randomly selected from the 31 Gold sequences shown in Table 13 (the sequences can be repeatedly selected), and after a cyclic shift is performed on the selected sequences (the amount of bits for the cyclic shift may be different), a column of elements is supplemented to the selected 16 sequences (for example, supplemented to the first column of M). Then, different sequence selections, each cyclic shift of the sequences, and element supplementation are attempted to search for a sequence set with the maximum Hamming distance to obtain the mapping relationship shown in Table 7. For example, in order to search for sequences that meet the conditions, the minimum and maximum values of the Hamming distance are set to obtain a matrix with 16 rows and 32 columns, and the mapping relationship can be further obtained. For example, the minimum value of the Hamming distance may be 16 and the maximum value may be 20. In another example, the minimum value of the Hamming distance may be 16 and the maximum value may be 18. For example, the following matrix M5 can be formed in the above manner. The Hamming distance between different chip sequences can be shown in Table 8 above.

[0357] M5=[1 0 0 1 1 1 0 1 0 1 1 0 0 0 1 1 0 0 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 0 1 0 1 1 1 1 1 0 0 1 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 0 1 0 1 1 0 1 0 1 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 0 1 1 1 1 0 1 1 1 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 1 0 0 1 0 1 1 0 0 1 0 1 1 1 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 1 1 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 0 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 0 0 1 0 0 1 1 1 1 0 1 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1 0 0 1 1 1 0 0 1 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1 0 0 1 1 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 0 0 0 1 1 1 0 1 1 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 0 0 1 1 0 1 1 1 1 1 0 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 1 0]

[0358] The matrix obtained based on the gold sequence and the Hamming distance may be understood to be used as a mapping relationship between 16 data symbols and the chip sequence. Alternatively, the columns of Table 7 may be rearranged or some columns may be negated, or the rows of Table 7 may be arranged to form a new mapping relationship. This new mapping relationship may alternatively be used as a mapping table relationship between 16 data symbols and the chip sequence.

[0359] Based on the mapping relationship shown in this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the Hamming distance between different chip sequences may include 16, 17, and 20. Therefore, there is a case where the Hamming distance between different chip sequences is equal to 16 at least, and the bit error rate at the receiving end can be further reduced.

[0360] Implementation 4

[0361] See Implementation 1. Two sequences of length 8 containing 1 and -1 are

[0362]

Number

[0363] and

[0364]

Number

[0365] are assumed to be. The four sequences are spliced together uniformly to form a sequence of length 16

[0366]

Number

[0367] is formed. The sequence

[0368]

Number

[0369] is circularly shifted by only 0 bits, 2 bits, 4 bits, 6 bits, 8 bits, 10 bits, 12 bits, and 14 bits to obtain eight sequences of length 16. Then, the values of the even bits (or odd bits) of the eight sequences obtained through the circular shift are negated to obtain another eight sequences. In this specification,

[0370]

Number

[0371] is used to represent 16 sequences, where i = 0, 1, 2,..., or 15. The sequence

[0372]

Number

[0373] and

[0374]

Number

[0375] can be any two sequences selected from the three sequences shown in Equation (8), or can be a sequence obtained by performing a circular shift, negation, or inversion on the selected sequence. Alternatively, the sequence

[0376]

Number

[0377] and

[0378]

Number

[0379] may be understood to be obtained based on any two of the three sequences shown in formula (8).

[0380] For example,

[0381]

Number

[0382] , and

[0383]

Number

[0384] is. In this case, the 16 sequences form the following mapping matrix M6.

[0385] M6 = [-1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1

[0386] In matrix M6 or -M6, -1 is replaced by 1, and 1 is replaced by 0, so that the matrix can be used as a mapping relationship between 16 information bits of length 4 and a chip sequence, as shown in Table 9, or can be used as a mapping relationship between 16 data symbols and a chip sequence of length 16. The minimum Hamming distance in the mapping relationship shown in Table 9 is 8 or more.

[0387] Based on the mapping relationship shown in this embodiment of the present application, when the autocorrelation characteristics between different chip sequences are guaranteed, the minimum Hamming distance can be effectively increased, the bit error rate at the receiving end can be reduced, and the system performance can be improved.

[0388] Implementation 5

[0389] Refer to Implementation 2. When n = 8, as shown below, a Hadamard matrix with 8 rows and 8 columns can be obtained.

[0390] H = [1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1]

[0391] Therefore, the 8×8 Hadamard matrix H shown in the above formula can be selected, or the columns of H can be permuted or some columns can be negated, or the rows of H are arranged so that, as shown in Equation (13), 16 data symbols form a matrix mapped to a chip sequence of length 8.

[0392]

Number

[0393] In matrix M7 or -M7, -1 is replaced by 0, whereby the matrix can be used as a mapping relationship between 16 data symbols and a chip sequence of length 8, as shown in Table 10. The minimum Hamming distance in the mapping relationship shown in Table 10 is 4 or more.

[0394] In the mapping relationship shown in this embodiment of the present application, the Hamming distance between chip sequences corresponding to different data symbols is 16, whereby the system performance can be effectively improved. In addition, each of the data symbols has two fixed chip values with fixed positions. Therefore, the receiving end can perform frequency offset estimation and compensation based on the fixed chip values to improve the anti-frequency offset ability of the system.

[0395] In the above embodiments, for parts not described in detail in one embodiment, it may be understood that reference may be made to other embodiments.

[0396] The communication device provided in the embodiments of this application will be described below.

[0397] In this application, the communication device is divided into functional modules based on the above method embodiments. For example, each of the functional modules can be obtained through division based on the corresponding functions, or two or more functions can be integrated into one processing module. The integrated module can be implemented in the form of hardware or in the form of a software functional module. It should be noted that in this application, the module division is only an example and is only a logical function division. In actual implementation, another division method may be used. Hereinafter, the communication device in the embodiments of this application will be described in detail with reference to FIGS. 6 to 8.

[0398] FIG. 6 is a structural diagram of a communication device according to an embodiment of this application. As shown in FIG. 6, the communication device includes a processing unit 601 and a transceiver unit 602.

[0399] In some embodiments of this application, the communication device may be the transmission end or chip shown above, and the chip may be disposed in the transmission end. In other words, the communication device can be configured to perform the steps, functions, etc. implemented by the transmission end in the above method embodiments.

[0400] The processing unit 601 is configured to generate a PPDU based on the mapping relationship between data symbols and chip sequences (or the mapping relationship between information bits and chip sequences), and the transceiver unit 602 is configured to output the PPDU.

[0401] It should be understood that the specific descriptions of the transceiver unit and the processing unit described in this embodiment of the present application are merely examples. For the specific functions of the transceiver unit and the processing unit, the steps implemented, etc., please refer to the above method embodiments. Details are not described herein. For example, the processing unit 601 may be configured to implement step 301 shown in FIG. 3. The transceiver unit 602 may be configured to implement the transmission step in step 302 shown in FIG. 3.

[0402] FIG. 6 is reused. In some other embodiments of the present application, the communication device may be the receiving end or the chip shown above, and the chip may be disposed in the receiving end. In other words, the communication device may be configured to implement the steps, functions, etc. implemented by the receiving end in the above method embodiments.

[0403] For example, the transceiver unit 602 is configured to input a PPDU, and the processing unit 601 is configured to process the PPDU based on the mapping relationship between the data symbol and the chip sequence (or the mapping relationship between the information bit and the chip sequence).

[0404] For example, the processing unit 601 is particularly configured to obtain the first sequence in the PPDU, determine the first chip sequence corresponding to the first sequence based on the N chip sequences included in the mapping relationship, determine the data symbol corresponding to the first chip sequence based on the mapping relationship, and determine the information bit corresponding to the first chip sequence based on the data symbol corresponding to the first chip sequence.

[0405] In another example, the processing unit 601 is particularly configured to perform O-QPSK demodulation, or perform BPSK demodulation, or perform PSK demodulation.

[0406] It should be understood that the specific descriptions of the transceiver unit and the processing unit described in this embodiment of the present application are merely examples. For the specific functions of the transceiver unit and the processing unit, the steps to be performed, etc., please refer to the above method embodiments. Details are not described herein. For example, the transceiver unit 602 may be further configured to perform the receiving step in step 302 shown in FIG. 3. The processing unit 601 may be further configured to perform step 303 shown in FIG. 3.

[0407] In a possible implementation, the communication device may include a storage unit, and the storage unit may be configured to store the mapping relationship shown above.

[0408] Regarding the descriptions of PPDU, mapping relationship, minimum Hamming distance, etc. in the above embodiments, please refer to the descriptions in the above method embodiments. Details are not described again herein.

[0409] It may be understood that the above splitting method is merely an example. The splitting methods of the transmitting end (or the chip disposed in the transmitting end) and the receiving end (or the chip disposed in the receiving end) may alternatively be shown as follows. The transmitting end may include a generating unit and a transmitting unit, the receiving end may include a receiving unit and a processing unit, and the processing unit may include at least one of a demodulation processing subunit (for example, demodulating the modulated symbols) and a demapping processing subunit (for example, demapping one or more sequences in the PPDU based on the mapping relationship to obtain one or more data symbols). Details are not listed one by one herein.

[0410] Above, the first communication device and the second communication device in the embodiments of the present application have been described. Below, possible product forms of the first communication device and the second communication device will be described. It should be understood that any form of a product having the functions of the first communication device in FIG. 6 or any form of a product having the functions of the second communication device in FIG. 6 falls within the protection scope of the embodiments of the present application. It should be further understood that the following description is merely an example, and the product forms of the first communication device and the second communication device in the embodiments of the present application are not limited thereto.

[0411] In a possible implementation, in the communication device shown in FIG. 6, the processing unit 601 may be one or more processors, and the transceiver unit 602 may be a transceiver, or the transceiver unit 602 may include a transmission unit and a reception unit. The transmission unit may be a transmitter, the reception unit may be a receiver, and the transmission unit and the reception unit are integrated into one device, for example, a transceiver. In this embodiment of the present application, the processor and the transceiver may be coupled, etc. The manner of connection between the processor and the transceiver is not limited in the embodiments of the present application. In the process of implementing the above method, the process of sending information (for example, sending a PPDU) in the above method may be understood as a process of outputting information by the processor. When outputting information, the processor outputs the information to the transceiver, whereby the transceiver transmits the information. After the information is output by the processor, other processing may need to be performed on the information before the information arrives at the transceiver. Similarly, the process of receiving information (for example, receiving a PPDU) in the above method may be understood as a process of receiving input information by the processor. When the processor receives the input information, the transceiver receives the information and inputs the information to the processor. Further, after the transceiver receives the information, other processing may need to be performed on the information before the information is input to the processor.

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

[0413] For example, when the communication device is configured to perform steps, methods, or functions implemented by a transmitting end, the processor 720 is configured to generate a PPDU based on a mapping relationship between data symbols and chip sequences (or a mapping relationship between information bits and chip sequences), and the transceiver 710 is configured to send the PPDU.

[0414] For example, when the communication device is configured to perform steps, methods, or functions implemented by a receiving end, the transceiver 710 is configured to receive a PPDU from the transmitting end, and the processor 720 is configured to process the PPDU based on a mapping relationship between data symbols and chip sequences (or a mapping relationship between information bits and chip sequences).

[0415] In this embodiment of the present application, for the descriptions of PPDU, mapping relationship, minimum Hamming distance, etc., please refer to the descriptions in the above method embodiments. Details will not be described again in this specification.

[0416] For specific descriptions of the processor and the transceiver, it may be understood that reference may be made to the descriptions of the processing unit and the transceiver unit shown in FIG. 6. Details will not be described again in this specification.

[0417] In various implementations of the communication device shown in FIG. 7, the transceiver may include a receiver and a transmitter. The receiver is configured to perform a receiving function (or operation), and the transmitter is configured to perform a transmitting function (or operation). The transceiver is configured to communicate with another device / device through a transmission medium.

[0418] Optionally, the communication device 70 may further include one or more memories 730 configured to store program instructions, data, and the like. The memory 730 is coupled to the processor 720. The coupling in this embodiment of the present application is an indirect coupling or communication connection between devices, units, or modules, and may be in electrical form, mechanical form, or another form, and is used for information exchange between devices, units, and modules. The processor 720 may operate together with the memory 730. The processor 720 may execute program instructions stored in the memory 730. Optionally, at least one of the one or more memories may be included in the processor. Optionally, the one or more memories may be configured to store the mapping relationship in this embodiment of the present application.

[0419] The specific connection medium between the transceiver 710, the processor 720, and the memory 730 is not limited in the embodiments of the present application. In this embodiment of the present application, the memory 730, the processor 720, and the transceiver 710 are connected through the bus 740 in FIG. 7. The bus is represented by using a thick line in FIG. 7. The connection manners between other components are schematically described and are not limited thereto. The bus may be classified into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is used to represent the bus in FIG. 7, but this does not indicate that there is only one bus or only one type of bus.

[0420] In this 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 another programmable logic device, an individual gate or transistor logic device, an individual hardware component, etc., and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed with respect to the embodiments of the present application may be directly implemented by a hardware processor or may be implemented, for example, by using a combination of hardware and software modules in the processor.

[0421] In this embodiment of the present application, the memory may include, but is not limited to, non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or portable read-only memory (Compact Disc Read-Only Memory, CD-ROM). The memory is a storage medium that can be used to carry or store program code in the form of instructions or data structures and can be read and / or written by a computer (for example, the communication device shown in the present application). However, the present application is not limited thereto. The memory in the embodiments of the present application may alternatively be a circuit or any other device capable of implementing a storage function and configured to store program instructions and / or data.

[0422] For example, the processor 720 is mainly configured to process communication protocols and communication data, control the entire communication device, execute software programs, and process data of the software programs. The memory 730 is mainly configured to store software programs and data. The transceiver 710 may include a control circuit and an antenna. The control circuit is mainly configured to perform conversion between a baseband signal and a radio frequency signal and process the radio frequency signal. The antenna is mainly configured to receive and transmit radio frequency signals in the form of electromagnetic waves. Input / output devices, such as a touch screen, a display, or a keyboard, are mainly configured to receive data input by a user and output the data to the user.

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

[0424] In another implementation, the radio frequency circuit and the antenna may be disposed independently of a processor that performs baseband processing. For example, in a distributed scenario, the radio frequency circuit and the antenna may be remotely disposed and may be independent of the communication device.

[0425] It may be understood that the communication device shown in this embodiment of the present application may include more components etc. than those shown in FIG. 7 as an alternative. This is not limited in the embodiments of the present application. The above method implemented by the processor and the transceiver is merely an example. For specific steps implemented by the processor and the transceiver, refer to the method described above.

[0426] In another possible implementation, in the communication device shown in FIG. 6, the processing unit 601 may be one or more logic circuits, and the transceiver unit 602 may be an input / output interface, or may be called a communication interface, an interface circuit, an interface, etc. As an alternative, the transceiver unit 602 may include a transmission unit and a reception unit. The transmission unit may be an output interface, and the reception unit may be an input interface. The transmission unit and the reception unit are integrated into one unit, for example, an input / output interface. As shown in FIG. 8, the communication device shown in FIG. 8 includes a logic circuit 801 and an interface 802. Specifically, the processing unit 601 may be implemented by using the logic circuit 801, and the transceiver unit 602 may be implemented by using the interface 802. The logic circuit 801 may be a chip, a processing circuit, an integrated circuit, a system on chip (SoC), etc. The interface 802 may be a communication interface, an input / output interface, a pin, etc. For example, FIG. 8 is an example where the communication device is a chip. The chip includes a logic circuit 801 and an interface 802. It may be understood that the chip shown in this embodiment of the present application may include a narrowband chip, an ultra-wideband chip, etc. This is not limited in the embodiments of the present application. The step of sending the UWB impulse described above may be implemented by an ultra-wideband chip, and whether another step is implemented by an ultra-wideband chip is not limited in the embodiments of the present application.

[0427] In this embodiment of the present application, the logic circuit and the interface may be coupled to each other. The specific manner of connection between the logic circuit and the interface is not limited in the embodiments of the present application.

[0428] For example, when the communication device is configured to implement the method, function, or step performed by the transmitting end, the logic circuit 801 is configured to generate a PPDU, and the interface 802 is configured to output the PPDU.

[0429] For example, when the communication device is configured to implement the method, function, or step performed by the receiving end, the interface 802 is configured to input a PPDU, and the logic circuit 801 is configured to process the PPDU.

[0430] In a possible implementation, the above chip may include a storage circuit, and the storage circuit may be configured to store the mapping relationship provided in this embodiment of the present application. In another possible implementation, the above chip may alternatively be connected to a memory, and thus, when the mapping relationship needs to be used, the mapping relationship provided in this embodiment of the present application is read from the memory.

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

[0432] In the above embodiments, for the descriptions of the PPDU, the mapping relationship, the minimum Hamming distance, etc., please refer to the descriptions in the above method embodiments. Details are not described again in this specification.

[0433] For the specific implementation of the embodiment shown in FIG. 8, please refer to the above embodiments, and details are not described again in this specification.

[0434] Embodiments of the present application further provide a wireless communication system. The wireless communication system includes a transmission end and a reception end. The transmission end and the reception end can be configured to implement the method in any one of the above embodiments (as shown in FIG. 3). Alternatively, for the transmission end and the reception end, refer to the communication devices shown in FIGS. 6 to 8.

[0435] In addition, the present application further provides a computer program. The computer program is used to implement the operations and / or processes performed by the transmission end in the method provided by the present application.

[0436] The present application further provides a computer program. The computer program is used to implement the operations and / or processes performed by the reception end in the method provided by the present application.

[0437] The present application further provides a computer-readable storage medium. The computer-readable storage medium stores computer code. When the computer code is run on a computer, the computer is enabled to perform the operations and / or processes performed by the transmission end in the method provided by the present application.

[0438] The present application further provides a computer-readable storage medium. The computer-readable storage medium stores computer code. When the computer code is run on a computer, the computer is enabled to perform the operations and / or processes performed by the reception end in the method provided by the present application.

[0439] This application further provides a computer program product. The computer program product includes computer code or a computer program. When the computer code or the computer program is run on a computer, the operations and / or processes performed by the sending end in the method provided by this application are performed.

[0440] This application further provides a computer program product. The computer program product includes computer code or a computer program. When the computer code or the computer program is run on a computer, the operations and / or processes performed by the receiving end in the method provided by this application are performed.

[0441] In some embodiments provided by this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the described device embodiments are merely examples. For example, the division into units is only a logical function division, and in actual implementation, other divisions may be possible. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the couplings or direct couplings or communication connections shown or discussed may also be implemented through some interfaces, indirect couplings or communication connections, or electrical connections, mechanical connections, or other forms of connections between devices or units.

[0442] The units described as separate parts may or may not be physically separate, and the parts shown as units may or may not be physical units. They may be located in one place or distributed over multiple network units. Some or all of the units may be selected based on the actual requirements for implementing the technical effects of the solutions provided in the embodiments of this application.

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

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

[0445] The above description is only a specific implementation of the present application and is not intended to limit the protection scope of the present application. Any deformation or substitution that can be easily conceived by those skilled in the art within the technical scope disclosed in the present application falls within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A communication method based on a physical layer protocol data unit (PPDU), the method comprising: generating a PPDU based on a mapping relationship between data symbols and chip sequences, wherein each length of the chip sequences is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequences, and the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences; sending the PPDU; and a communication method based on a physical layer protocol data unit (PPDU).

2. A physical layer protocol data unit (PPDU) communication method, the method comprising: receiving a PPDU; processing the PPDU based on a mapping relationship between data symbols and chip sequences, wherein each length of the chip sequences is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequences, and the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences; and a physical layer protocol data unit (PPDU) communication method.

3. The step of processing the PPDU based on the mapping relationship between data symbols and chip sequences comprises: obtaining a first sequence in the PPDU, wherein the length of the first sequence is L; determining a first chip sequence corresponding to the first sequence based on N chip sequences included in the mapping relationship between data symbols and chip sequences, wherein the first chip sequence is one of the N chip sequences and N is a positive integer; determining a data symbol corresponding to the first chip sequence based on the mapping relationship between data symbols and chip sequences; determining information bits corresponding to the first chip sequence based on the data symbol corresponding to the first chip sequence; and the method according to Claim 2.

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

5. The chip sequence is [1 1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1], [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1], and [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] The method according to any one of claims 1 to 4, obtained based on at least one of.

6. The chip sequence is ［１ １ －１ １ －１ １ －１ －１］ ［１ １ －１ １ １ －１ －１ －１］． ［１ １ １ －１ １ －１ －１ －１］ The method according to any one of claims 1 to 5, obtained based on at least two of.

7. The chip sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the chip sequence. The method according to any one of claims 1 to 4.

8. At least two columns of the elements in the matrix formed by the chip sequence are the same. The method according to claim 7.

9. The chip sequence is [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1], and ［０ ０ ０ １ １ １ ０ １ ０ １ ０ ０ １ ０ １ １ １ １ ０ ０ １ １ ０ １ １ ０ ０ ０ ０ ０ １］ The method according to any one of claims 1 to 4, obtained based on two sequences of.

10. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to claim 5 or 6. 【Table 1】

11. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to claim 5 or 6. 【Table 2】

12. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to claim 5 or 6. 【Table 3】

13. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to claim 7. 【Table 4】

14. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to claim 9. 【Table 5】

15. The mapping relationship between the data symbol and the chip sequence is as follows. The method according to any one of claims 1 to 4. 【Table 6】

16. The method according to any one of claims 1 to 4, wherein the mapping relationship between the data symbol and the chip sequence is as follows. 【Table 7】

17. A communication device, wherein the device is a processing unit configured to generate a PPDU based on a mapping relationship between a data symbol and a chip sequence, wherein the length of each chip sequence is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequence, and the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences; and a processing unit, a transceiver unit configured to send the PPDU A communication device comprising:

18. A communication device, wherein the device is a transceiver unit configured to receive a PPDU, and is a processing unit configured to process the PPDU based on a mapping relationship between a data symbol and a chip sequence, wherein the length of each chip sequence is L, the minimum Hamming distance is L / 2 or more, L is a positive integer, the bit length corresponding to the data symbol is smaller than the bit length of the chip sequence, and the minimum Hamming distance indicates the smallest Hamming distance between any two different chip sequences; and a processing unit A communication device comprising:

19. The apparatus according to claim 18, wherein the processing unit is specifically configured to obtain a first sequence in the PPDU, wherein the length of the first sequence is L; determine a first chip sequence corresponding to the first sequence based on N chip sequences included in the mapping relationship between the data symbol and the chip sequence, wherein the first chip sequence is one of the N chip sequences and N is a positive integer; determine a data symbol corresponding to the first chip sequence based on the mapping relationship between the data symbol and the chip sequence; and determine information bits corresponding to the first chip sequence based on the data symbol corresponding to the first chip sequence.

20. The apparatus according to any one of claims 17 to 19, wherein L = 32, L = 16, or L = 8.

21. The chip sequence is [1 1 -1 -1 -1 -1 -1 -1 -1] and [1 1 -1 1 -1 1 -1 -1], [1 -1 1 -1 -1 -1 -1 -1] and [1 1 -1 1 1 -1 -1 -1], and [1 -1 -1 1 -1 -1 -1 -1] and [1 1 1 -1 1 -1 -1 -1] , and the apparatus according to any one of claims 17 to 20, which is obtained based on at least one of them.

22. The chip sequence is ［１ １ －１ １ －１ １ －１ －１］ ［１ １ －１ １ １ －１ －１ －１］． ［１ １ １ －１ １ －１ －１ －１］ , and the apparatus according to any one of claims 17 to 21, which is obtained based on at least two of them.

23. The chip sequence is obtained based on a Hadamard matrix, and the order of the Hadamard matrix is related to the length of the chip sequence, and the apparatus according to any one of claims 17 to 20.

24. At least two columns of elements in the matrix formed by the chip sequence are the same, and the apparatus according to claim 23.

25. The chip sequence is [1 0 0 1 0 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 0 0 0 0 0 1], and ［０ ０ ０ １ １ １ ０ １ ０ １ ０ ０ １ ０ １ １ １ １ ０ ０ １ １ ０ １ １ ０ ０ ０ ０ ０ １］ , and the apparatus according to any one of claims 17 to 20, which is obtained based on two sequences.

26. A communication device comprising a processor and a memory, wherein the memory is configured to store instructions, the processor is configured to execute the instructions, whereby the method according to any one of claims 1 to 16 is implemented, a communication device.

27. A chip comprising a logic circuit and an interface, wherein the logic circuit is coupled to the interface, the interface is configured to input and / or output code instructions, and the logic circuit is configured to execute the code instructions, whereby the method according to any one of claims 1 to 16 is implemented, a chip.

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

29. A communication system, wherein the communication system includes a transmission end and a reception end, the transmission end is configured to implement the method according to any one of claims 1 and 4 to 16, and the reception end is configured to implement the method according to any one of claims 2 to 16.

Images