Ultra-wideband-based signal transmission method and apparatus

Abstract

The application relates to a signal transmission method and device based on ultra-wideband, which comprises the following steps: transmitting a signal, wherein the signal comprises a signal generated by encoding first PHR information, the code word comprises a code word corresponding to the first PHR information in a first code word set, and the first PHR information is used for indicating the data rate of a physical layer payload field. By adopting the application, the encoding performance of the first PHR information can be improved. The application is applied to a WPAN system based on UWB, a sensing system and the like, including 802.15 series protocols, such as 802.15.4a, 802.15.4z or 802.15.4ab protocols and the like. The application can also be applied to a WLAN system of 802.11ax next-generation Wi-Fi protocols, such as 802.11be, Wi-Fi 7 or EHT, for example, 802.11be next-generation, Wi-Fi 8 and the like 802.11 series protocols.

Description

[0001] This application is a divisional application. The original application has the application number 202310101526.8 and the original application date is February 1, 2023. The entire contents of the original application are incorporated herein by reference. Technical Field

[0002] This application relates to the field of wireless communication technology, and in particular to a signal transmission method and apparatus based on ultra-wideband (UWB). Background Technology

[0003] With the entry of ultra-wideband (UWB) technology into the civilian sector, UWB wireless communication has become one of the physical layer technologies for short-range, high-speed wireless networks. UWB is a wireless carrier communication technology that can transmit data using nanosecond-level non-sinusoidal narrow pulses, thus occupying a very wide spectrum. Due to its narrow pulse width and low radiation spectral density, UWB has advantages such as strong multipath resolution, low power consumption, and strong security.

[0004] The Institute of Electrical and Electronics Engineers (IEEE) has incorporated UWB technology into its IEEE 802 series of wireless standards, and has released the UWB-based high-speed wireless personal area network (WPAN) standard IEEE 802.15.4a, as well as its evolution IEEE 802.15.4z. The next-generation UWB wireless personal area network (WPAN) standard 802.15.4ab is also under discussion. The physical layer protocol data unit (PPDU) in the existing WPAN standard contains at least a physical layer header (PHR) field and a physical layer (PHY) payload field.

[0005] Currently, the PHR field uses convolutional coding, and its coding performance needs further improvement. Summary of the Invention

[0006] This application provides a signal transmission method and apparatus based on ultra-wideband, which can improve the encoding performance of PHR fields and further reduce the transmission time of PHR fields.

[0007] The present application is described below from different aspects. It should be understood that the different implementation methods and beneficial effects described below can be referenced from each other.

[0008] Firstly, this application provides a signal transmission method based on ultra-wideband (UWB). The method includes: a communication device generating a physical layer protocol data unit (PPDU), the PPDU including a physical layer header (PHR) field and a physical layer (PHY) payload field, the PHR field including first PHR information indicating the data rate of the PHY payload field; the communication device transmitting a signal generated based on the PPDU, the signal including a signal generated from codewords encoded according to the first PHR information, the codewords including codewords corresponding to the first PHR information in a first codeword set. The specific content of the codewords can be found in the method embodiments below, which are not listed here due to space limitations.

[0009] This application designs a new codeword set (i.e., codebook) and uses the codewords in this codeword set to map and encode the first PHR information. Compared with the convolutional coding method, it can improve the encoding performance of the PHR field (mainly the first PHR information).

[0010] Secondly, this application provides a signal transmission method based on ultra-wideband (UWB). The method includes: a communication device receiving a signal generated based on a PPDU (Power Component Distribution Unit), the PPDU including a PHR (Power Response Rate) field and a PHY payload field, the PHR field including first PHR information, the signal including a signal generated by encoding codewords based on the first PHR information, the codewords including codewords in a first codeword set corresponding to the first PHR information; and demodulating and decoding the signal to obtain the first PHR information, the first PHR information being used to indicate the data rate of the PHY payload field. The specific content of the codewords can be found in the method embodiments below, which are not listed here due to space limitations.

[0011] In one possible implementation of any of the above aspects, the first PHR information is 3 bits and can be used to indicate that the data rate of the PHY payload field is any of the following: 1.95 Mbps (megabits per second), 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, or 124.8 Mbps.

[0012] In one possible implementation of any of the above aspects, the first PHR information further includes information indicating whether the PHY payload field is encoded using the first encoding method. For example, the first PHR information is 4 bits, where 3 bits are used to indicate the data rate of the PHY payload field, and the other 1 bit is used to indicate whether the PHY payload field is encoded using the first encoding method.

[0013] Optionally, the first encoding method can be any of the following: low-density parity code (LDPC), convolutional code, polar code, turbo code, etc., and this application does not impose any restrictions. For ease of description, the following explanation will use LDPC as the first encoding method.

[0014] This application uses codewords from the first codeword set to map and encode the first PHR information (4 bits). Compared with convolutional coding, this method can meet the demodulation performance requirements while reducing the transmission time of the first PHR information, achieving a good trade-off between the demodulation performance and transmission time of the first PHR information.

[0015] In any possible implementation of the above aspect, the number M of codewords in the first codeword set is less than or equal to 2. K Where K is the bit length of the first PHR information. For example, when K equals 3, the number of codewords M in the first codeword set is less than or equal to 8; when K equals 4, the number of codewords M in the first codeword set is less than or equal to 16; when K equals 2, the number of codewords M in the first codeword set is less than or equal to 4.

[0016] In some scenarios, the Hamming distance between any two codewords in the first codeword set is greater than or equal to the upper limit of the theoretical minimum Hamming distance of this first codeword set.

[0017] Optionally, if the first codeword set includes M codewords, each codeword having a length of L. For example, the Hamming distance d between any two codewords in these M codewords satisfies:

[0018] or,

[0019] This application improves encoding performance by increasing the Hamming distance between codewords.

[0020] In one possible implementation of any of the above aspects, when the first PHR information is 4 bits, the length of the codewords in the first codeword set satisfies L = 4n + 2; where L represents the length of the codeword and n is a positive integer. For the specific content of the codewords in the first codeword set under different codeword lengths, please refer to the description in Embodiment 1 below, which will not be detailed here.

[0021] In one possible implementation of any of the above aspects, when the first PHR information is 3 bits, the length of the codewords in the first codeword set is an even number of bits, and satisfies L = 7n + m; where L represents the length of the codeword, n is a positive integer, and m is an integer greater than or equal to 0 and less than 7. For the specific content of the codewords in the first codeword set under different codeword lengths, please refer to the description in Embodiment 2 below, which will not be detailed here.

[0022] In any possible implementation of the above aspect, the length of the codeword is greater than or equal to 2. K K is the bit length of the first PHR information. For example, the codeword length is any of the following: 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, or 40 bits.

[0023] Thirdly, embodiments of this application provide a communication device for executing the method in the first aspect or any possible implementation thereof. The communication device includes units for executing the method in the first aspect or any possible implementation thereof.

[0024] Fourthly, embodiments of this application provide a communication device for executing the method in the second aspect or any possible implementation thereof. The communication device includes units capable of executing the method in the second aspect or any possible implementation thereof.

[0025] In the third or fourth aspect, the aforementioned communication device may include a transceiver unit and a processing unit. Further details regarding the transceiver unit and processing unit can be found in the device embodiments shown below. The beneficial effects of the third and fourth aspects described above can be referenced in the relevant descriptions of the first and second aspects, and will not be repeated here.

[0026] Fifthly, this application provides a communication device including a processor for executing the method described in the first aspect or any possible implementation thereof. Alternatively, the processor is configured to execute a program stored in a memory, wherein when the program is executed, the method described in the first aspect or any possible implementation thereof is executed.

[0027] In conjunction with the fifth aspect, in one possible implementation, the memory is located outside the aforementioned communication device.

[0028] In conjunction with the fifth aspect, in one possible implementation, the memory is located within the aforementioned communication device.

[0029] In this application, the processor and memory can also be integrated into a single device, that is, the processor and memory can be integrated together.

[0030] In conjunction with the fifth aspect, in one possible implementation, the communication device further includes a transceiver for transmitting signals.

[0031] Sixthly, this application provides a communication device including a processor for executing the method shown in the second aspect above, or any possible implementation thereof. Alternatively, the processor is configured to execute a program stored in a memory, wherein when the program is executed, the method shown in the second aspect above, or any possible implementation thereof, is executed.

[0032] In conjunction with the sixth aspect, in one possible implementation, the memory is located outside the aforementioned communication device.

[0033] In conjunction with the sixth aspect, in one possible implementation, the memory is located within the aforementioned communication device.

[0034] In this application, the processor and memory can also be integrated into a single device, that is, the processor and memory can be integrated together.

[0035] In conjunction with the sixth aspect, in one possible implementation, the communication device further includes a transceiver for receiving signals.

[0036] In a seventh aspect, this application provides a communication device including a logic circuit and an interface, the logic circuit and the interface being coupled. The logic circuit is used to generate a PPDU, the PPDU including a PHR field and a PHY payload field, the PHR field including first PHR information used to indicate the data rate of the PHY payload field; the interface is used to output a signal generated based on the PPDU, the signal including a signal generated from codewords encoded according to the first PHR information, the codewords including codewords from a first codeword set corresponding to the first PHR information.

[0037] Eighthly, this application provides a communication device including logic circuitry and an interface, the logic circuitry and the interface being coupled. The interface is used to input a signal generated based on a PPDU, the PPDU including a PHR field and a PHY payload field, the PHR field including first PHR information, the signal including a signal generated from codewords encoded based on the first PHR information, the codewords including codewords from a first codeword set corresponding to the first PHR information; the logic circuitry is used to decode the signal to obtain the first PHR information, the first PHR information being used to indicate the data rate of the PHY payload field.

[0038] For details regarding PPDU, first PHR information, first codeword set, etc. in the seventh or eighth aspect, please refer to the descriptions in the first or second aspect mentioned above, and they will not be elaborated here.

[0039] Ninthly, this application provides a computer-readable storage medium for storing a computer program that, when run on a computer, causes the method shown in the first aspect above, or any possible implementation thereof, to be executed.

[0040] In a tenth aspect, this application provides a computer-readable storage medium for storing a computer program that, when run on a computer, causes the methods shown in the second aspect above, or any possible implementation thereof, to be executed.

[0041] Eleventhly, embodiments of this application provide a computer program product, which includes a computer program or computer code, which, when run on a computer, causes the method shown in the first aspect above, or any possible implementation of the first aspect, to be executed.

[0042] In a twelfth aspect, embodiments of this application provide a computer program product comprising a computer program or computer code that, when run on a computer, causes the methods shown in the second aspect above, or any possible implementation thereof, to be executed.

[0043] In a thirteenth aspect, this application provides a computer program that, when run on a computer, executes the method shown in the first aspect above, or any possible implementation thereof.

[0044] In a fourteenth aspect, this application provides a computer program that, when run on a computer, executes the methods shown in the second aspect above, or any possible implementation thereof.

[0045] In a fifteenth aspect, embodiments of this application provide a wireless communication system, which includes a first communication device and / or a second communication device. The first communication device is used to perform the method shown in the first aspect or any possible implementation of the first aspect, and the second communication device is used to perform the method shown in the second aspect or any possible implementation of the second aspect.

[0046] The technical effects achieved in the above aspects can be referred to each other or to the beneficial effects in the method embodiments shown below, which will not be repeated here. Attached Figure Description

[0047] Figure 1 This is a schematic diagram of the structure of a wireless communication system provided in an embodiment of this application;

[0048] Figure 2 This is another schematic diagram of the wireless communication system provided in the embodiments of this application;

[0049] Figure 3 This is a schematic diagram of the UWB PPDU format provided in an embodiment of this application;

[0050] Figure 4 This is another schematic diagram of the UWB PPDU format provided in the embodiments of this application;

[0051] Figure 5 This is a flowchart illustrating a signal transmission method based on ultra-wideband provided in an embodiment of this application;

[0052] Figure 6 This is a schematic diagram illustrating the upper limit of the theoretical minimum Hamming distance under different code lengths provided in the embodiments of this application;

[0053] Figure 7 This is a schematic diagram of the packet error rate simulation results of PHR1 when using different encoding methods, provided in the embodiments of this application;

[0054] Figure 8 This is another schematic flowchart of the ultra-wideband signal transmission method provided in the embodiments of this application;

[0055] Figure 9 This is another schematic diagram illustrating the upper limit of the theoretical minimum Hamming distance under different code lengths provided in the embodiments of this application;

[0056] Figure 10 This is a schematic diagram of the minimum Hamming distance under different code lengths provided in the embodiments of this application;

[0057] Figure 11 This is a schematic diagram of the structure of the communication device provided in an embodiment of this application;

[0058] Figure 12 This is another structural schematic diagram of the communication device provided in the embodiments of this application;

[0059] Figure 13 This is another structural schematic diagram of the communication device provided in the embodiments of this application. Detailed Implementation

[0060] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0061] In the description of this application, the terms "first," "second," etc., are used only to distinguish different objects and do not limit the quantity or order of execution, nor do they imply that they are necessarily different. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0062] In the description of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "one or more of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Here, a, b, and c can be single or multiple.

[0063] In this application, the words "exemplary" or "for example" are used to indicate that something is an example, illustration, or illustration. Any embodiment or design described as "exemplary," "for example," or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Rather, the use of the words "exemplary," "for example," or "for example" is intended to present the relevant concepts in a specific manner.

[0064] In this application, the use of singular designations for elements is intended to represent "one or more" rather than "one and only one," unless otherwise specified.

[0065] It is understood that in the various embodiments of this application, "B mapped to A" or "A mapped to B" means that there is a correspondence between A and B, and B can be determined based on A. However, it should also be understood that determining (or generating) B based on A does not mean that B is determined (or generated) solely based on A; B can also be determined (or generated) based on A and / or other information.

[0066] The technical solution provided in this application can be applied to wireless personal area networks (WPANs) based on UWB technology. For example, the method provided in this application can be applied to IEEE 802.15 series protocols, such as 802.15.4a, 802.15.4z, or 802.15.4ab, or a future generation of UWB WPAN standards, etc., which will not be listed here. The method provided in this application can also be applied to various communication systems, such as Internet of Things (IoT) systems, vehicle-to-everything (V2X) systems, narrowband Internet of Things (NB-IoT) systems, devices applied in V2X, IoT nodes and sensors in IoT, smart cameras, smart remote controls, smart water and electricity meters in smart homes, and sensors in smart cities. The method provided in this application can also be applied to long term evolution (LTE) frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) communication systems, LTE systems, and also to 5th-generation (5G) communication systems, 6th-generation (6G) communication systems, etc.

[0067] Ultra-wideband (UWB) technology is a novel wireless communication technology. It utilizes nanosecond-level non-sinusoidal narrow pulses to transmit data. By modulating impulse pulses with very steep rise and fall times, it achieves a wide transmission spectrum, resulting in a bandwidth on the order of gigahertz (GHz). The bandwidth used in UWB is typically above 1 GHz. Because UWB systems do not require the generation of sinusoidal carrier signals and can directly transmit impulse sequences, they possess a wide spectrum and very low average power. UWB wireless communication systems offer advantages such as strong multipath resolution, low power consumption, and strong security, facilitating coexistence with other systems and thus improving spectrum utilization and system capacity. Furthermore, in short-range communication applications, the transmit power of UWB transmitters can typically be below 1 mW. Theoretically, the interference generated by UWB signals is equivalent to only white noise. This contributes to good coexistence between ultra-wideband and existing narrowband communications. Therefore, UWB systems can operate simultaneously with narrowband (NB) communication systems without interference.

[0068] The method provided in this application can be implemented by a communication device in a wireless communication system. In a communication device, the device, chip, or functional unit that implements the UWB system function can be referred to as a UWB module, and the device, chip, or functional unit that implements the narrowband communication system function can be referred to as a narrowband communication module. The UWB module and the narrowband communication module can be different devices or chips; of course, the UWB module and the narrowband communication module can also be integrated on a single device or chip. The embodiments of this application do not limit the implementation of the UWB module and the narrowband communication module in the communication device. The communication device in this application includes a UWB module, and optionally also includes a narrowband communication module. It is understood that the above description of the communication device applies to the first and second communication devices in this application.

[0069] Although the embodiments in this application primarily use WPAN as an example, such as a network applied to the IEEE 802.15 series of standards, those skilled in the art will readily understand that the various aspects involved in this application can be extended to other networks employing various standards or protocols. For example, wireless local area networks (WLANs), Bluetooth, high-performance radio LANs (HIPERLANs) (a wireless standard similar to the IEEE 802.11 standard, primarily used in Europe), and wide area networks (WANs) or other networks now known or developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in this application can be applied to any suitable wireless network.

[0070] Optionally, the communication device in the embodiments of this application can be a device that supports multiple WPAN standards such as 802.15.4a and 802.15.4z, as well as IEEE 802.15.4ab or later versions currently under discussion.

[0071] For example, the method provided in this application can be implemented by a communication device in a wireless communication system, which can be a device involved in the UWB system. For instance, the communication device can include, but is not limited to, communication servers, routers, switches, bridges, computers, mobile phones, etc., that support UWB technology. As another example, the communication device can include user equipment (UE), which can include various handheld devices, in-vehicle devices (such as automobiles or components installed in automobiles), wearable devices, Internet of Things (IoT) devices, computing devices, or other processing devices connected to a wireless modem that support UWB technology, etc., and will not be listed exhaustively here. As yet another example, the communication device can include a central control point, such as a personal area network (PAN) or a PAN coordinator. The PAN coordinator or PAN can be a mobile phone, in-vehicle device, anchor, tag, or smart home device, etc. As yet another example, the communication device can include a chip, which can be located in a communication server, router, switch, or terminal device, etc., and will not be listed exhaustively here.

[0072] In this embodiment, the communication device may include a hardware layer, an operating system layer running on top of the hardware layer, and an application layer running on the operating system layer. The hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and memory (also called main memory). The operating system can be any one or more computer operating systems that implement business processing through processes, such as Linux, Unix, Android, iOS, or Windows. The application layer includes applications such as browsers, address books, word processing software, and instant messaging software. Furthermore, this embodiment does not specifically limit the structure of the execution entity of the method provided in this embodiment, as long as it can communicate according to the method provided in this embodiment by running a program that records the code of the method provided in this embodiment.

[0073] It is understood that the above description of the communication device applies to the first and second communication devices in this application.

[0074] For example, see Figure 1 , Figure 1 This is a schematic diagram of the structure of a wireless communication system provided in an embodiment of this application. Figure 1 As shown, the wireless communication system is a star topology, in which a central control node (e.g., Figure 1 The PAN coordinator (in this context) can communicate with one or more other devices. See also Figure 2 , Figure 2 This is another structural schematic diagram of the wireless communication system provided in an embodiment of this application. For example... Figure 2 As shown, this wireless communication system is a point-to-point topology, in which a central control node (such as...) Figure 2 The PAN coordinator can communicate with one or more other devices, and these other devices can also communicate with each other. Figure 1 and Figure 2 In this application, both "full-function device" and "reduced-function device" can be understood as the communication apparatus shown. The terms "full-function device" and "reduced-function device" are relative; for example, a reduced-function device cannot be a PAN coordinator. Furthermore, compared to a full-function device, a reduced-function device may lack coordination capabilities or have a lower communication rate. It is understood that... Figure 2 The PAN coordinator shown is merely an example. Figure 2 The other three full-function devices shown can also act as PAN coordinators, and will not be shown individually here. It should also be understood that the full-function and low-function devices shown in this application are merely examples of communication devices, and any device capable of implementing the PPDU transmission method provided in this application falls within the protection scope of this application.

[0075] Because UWB has very low spectral energy, it causes minimal interference to other wireless communication technologies. Therefore, according to regulations, UWB can transmit signals without channel monitoring, making it highly suitable for low-latency data transmission. Furthermore, due to its large communication bandwidth, UWB can transmit high-speed data over ultra-wideband channels. Conversely, to increase transmission distance or expand equipment coverage, lower data rates can also be selected for transmission.

[0076] One possible UWB PPDU format is as follows: Figure 3 As shown, Figure 3 This is a schematic diagram of the UWBPPDU format provided in an embodiment of this application. For example... Figure 3As shown, this UWB PPDU includes at least a Physical Layer Header (PHR) field, and optionally one or more of the following fields: a synchronization (SYNC) field, a start-of-frame delimiter (SFD) field, or a Physical Layer (PHY) payload field. The SYNC field is used for channel measurement and signal synchronization, and the SFD field separates the SYNC field from the subsequent parts. The PHR field indicates parameters necessary for demodulating the PHY payload field, such as the length of the PHY payload field, the data rate, and the encoding method. The PHY payload field carries the data. It can be understood that... Figure 3 The names of the fields in this application are merely examples. As the standard evolves, the names of the fields in the UWB PPDU may differ, but all fields that can perform the above functions fall within the scope of protection of this application.

[0077] Therefore, to correctly demodulate the data in the PHY payload field, the correct demodulation of the PHR field must be guaranteed. Generally, the lower the data rate, the more reliable the transmitted data, meaning it's easier to demodulate correctly. Therefore, the PHR field typically uses a lower data rate. The PHY payload field, on the other hand, can use a higher data rate to improve transmission performance. In other words, to ensure demodulation performance, the data rate of the PHR field is usually lower than that of the PHY payload field. Currently, to ensure correct demodulation and higher reliability for the PHR field than the PHY payload field, the PHR field needs to use a lower data rate. This results in longer transmission time (or time occupied by the air interface), increased latency, and interference with other wireless devices or wireless communication technologies. Furthermore, if the data rate of the PHR field is too high, it will become the performance bottleneck for the entire PPDU demodulation.

[0078] One possible implementation involves dividing the PHR field into two parts to reduce transmission time. One part is transmitted at a fixed, low data rate, while the other part is transmitted at a dynamic data rate. See [link to relevant documentation] Figure 4 , Figure 4 This is another schematic diagram of the UWB PPDU format provided in the embodiments of this application. For example... Figure 4As shown, the PHR field can be divided into two parts, denoted as PHR1 and PHR2. PHR1, also known as the rate header, consists of 4 bits. Three bits indicate the data rate of the PHY payload field, and the remaining bit indicates whether the PHY payload field uses low-density parity code (LDPC) encoding. Currently, the data rates supported by the PHY payload field include: 1.95 Mbps, 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, and 124.8 Mbps. PHR2 primarily indicates the length of the PHY payload field. Optionally, PHR2 may also include bits indicating whether the PPDU is used for sensing measurements, reserved bits, and cyclic redundancy check (CRC) bits. PHR1 can be transmitted at a fixed, relatively low data rate, while PHR2 can be transmitted at a dynamic data rate. The data rate of PHR2 can be determined by the data rate of the PHY payload field and the channel coding used in the PHY payload field.

[0079] In addition, PHR1 can be encoded using convolutional codes with a code rate of 0.5, such as convolutional codes with a polynomial of (133,171)8. One possible encoding method for PHR1 is as follows: add 6 zeros as tail bits after the 4 bits of PHR1, and then encode it with convolutional codes with a code rate of 0.5 to get 20 bits; then use 2 bits as a symbol, for a total of 10 symbols. Depending on the different symbol transmission rates, there are several schemes: (1) transmit PHR1 at a rate of 3.9 Mbps, which takes about 2.5 μs (microseconds); (2) transmit PHR1 at a rate of 1.95 Mbps, which takes about 5 μs; (3) transmit PHR1 at a rate of 0.975 Mbps, which takes about 10 μs. For scheme (1), since the symbol rate of PHR1 is relatively high (3.9 Mbps), when the data rate of the PHY payload field is 1.95 Mbps, the demodulation performance cannot be guaranteed, thus creating a performance bottleneck. For scheme (2), the symbol rate of PHR1 is 1.95 Mbps. Since LDPC encoding performs better than convolutional encoding, demodulation performance cannot be guaranteed when the data rate of the PHY payload field is 1.95 Mbps and LDPC encoding is used, resulting in a performance bottleneck. For scheme (3), the symbol rate of PHR1 is very low (0.975 Mbps), which increases the transmission time of PHR1.

[0080] In view of this, embodiments of this application provide a signal transmission method and apparatus based on ultra-wideband (UWB). By designing a new codebook (such as a first codeword set) to map and encode the first IPHR information, the encoding performance of the PHR field (mainly the first IPHR information) can be improved, and the transmission time of the PHR field (mainly the first IPHR information) can be further reduced. For example, the "codeword set" referred to in this application means one or more codewords.

[0081] The technical solution provided in this application will be described in detail below with reference to more accompanying drawings.

[0082] To facilitate a clear description of the technical solutions of this application, multiple embodiments are described below. Unless otherwise specified, the same or similar parts between the various embodiments or implementations can be referenced interchangeably. In the various embodiments and implementation methods / methods within those embodiments, unless otherwise specified or logically conflicting, the terminology and / or descriptions between different embodiments and between different implementation methods / methods within those embodiments are consistent and can be mutually referenced. The technical features in different embodiments and between different implementation methods / methods within those embodiments can be combined according to their inherent logical relationships to form new embodiments, implementation methods, methods, or methods of implementation. The embodiments described below do not constitute a limitation on the scope of protection of this application.

[0083] The communication device in this application can support the 802.15.4ab standard or the next generation standard of 802.15.4ab, and can also support multiple standards such as 802.15.4a, 802.15.4-2011, 802.15.4-2015, 802.15.4-2020 and 802.15.4z, as well as WLAN standards of the 802.11 family such as 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, 802.11a, 802.11be next generation, etc.

[0084] See Figure 5 , Figure 5 This is a schematic flowchart of a signal transmission method based on ultra-wideband provided in an embodiment of this application. Figure 5 As shown, this ultra-wideband-based signal transmission method includes, but is not limited to, the following steps:

[0085] S101, the first communication device generates a PPDU, which includes a PHR field and a PHY payload field. The PHR field includes first PHR information, which is used to indicate the data rate of the PHY payload field and whether the PHY payload field is encoded using a first encoding method.

[0086] S102, the first communication device sends a signal, which is generated based on the PPDU. The signal includes a signal generated by encoding codewords based on the first PHR information. The codewords include codewords in the first codeword set that correspond to the first PHR information.

[0087] Correspondingly, the second communication device receives the signal.

[0088] S103, the second communication device decodes the signal to obtain the first PHR information.

[0089] Optionally, the PPDU mentioned above can be a PPDU applied in the UWB WPAN standard, such as the PPDU in the 802.15.4ab protocol.

[0090] Optionally, the aforementioned PPDU may include, but is not limited to, a PHR field and a PHY payload field. The PHR field may include first PHR information and second PHR information. The first PHR information may be used to indicate the data rate of the PHY payload field and whether the PHY payload field is encoded using a first encoding method. The second PHR information may be used to indicate the length of the PHY payload field, and optionally also to indicate one or more of the following: whether the PPDU is used for sensing measurements or a cyclic redundancy check (CRC) code.

[0091] For example, the first encoding method can be any of the following: LDPC, convolutional code, polar code, turbo code, etc., and the embodiments of this application are not limited thereto. For ease of description, the first encoding method is LDPC as an example for illustration; of course, as standards develop, LDPC in the following text can also be replaced by any encoding method specified in future standards (such as convolutional code, polar code, turbo code, etc.).

[0092] For example, the frame format of the PPDU can be as described above. Figure 4 As shown, the aforementioned Figure 4 PHR1 in the above corresponds to the first PHR information in the embodiments of this application, as described above. Figure 4The PHR2 in this example corresponds to the second PHR information in this embodiment. The first PHR information (PHR1) has 4 bits, of which 3 bits indicate the data rate of the PHY payload field, and the other 1 bit indicates whether the PHY payload field uses LDPC encoding. For example, the second PHR information (PHR2) has 23 bits, of which 12 bits indicate the length of the PHY payload field, 1 bit indicates whether the PPDU is used for sensing measurements, 2 bits are reserved, and 8 bits indicate the CRC code.

[0093] Optionally, the first communication device can encode the generated PPDU, and then modulate the encoded codewords into UWB pulses (i.e., signals) for transmission. Correspondingly, after receiving the signal (i.e., the UWB pulse), the second communication device demodulates the signal to obtain the PPDU-encoded codewords, and then decodes the encoded codewords of the first PHR information (PHR1) according to the first codeword set to obtain the first PHR information (PHR1). The first codeword set can be predefined, pre-negotiated, or pre-configured, etc. The encoding here can include convolutional codes, LDPC, specific codebooks, repetitive codes, etc. It can be understood that different fields in the PPDU can be encoded using different encoding methods. For example, the PHY payload field in the PPDU can be encoded using LDPC or convolutional codes, while the SFD field can be mapped using a codebook. As another example, the first PHR information (PHR1) in the PPDU can be mapped using a codebook, while the second PHR information (PHR2) can be encoded using convolutional codes, and so on.

[0094] Therefore, the aforementioned signal can be generated based on PPDU. This signal must include at least a signal generated from codewords encoded from the aforementioned first PHR information (PHR1), and these codewords can include codewords from a first codeword set mapped to the first PHR information. This first codeword set includes at least M codewords, each with a length of L. For example, the Hamming distance d between any two codewords among these M codewords satisfies either formula (1-1) or formula (1-2).

[0095]

[0096] Among them, symbols This indicates rounding down. The same symbols in the following text have the same meaning and will not be repeated.

[0097] Optionally, the first codeword set mentioned above can be all or part of the codewords in the codebook, and the number of codewords in the codebook is 2. K K is the bit length of the first PHR message (PHR1). M is less than or equal to 2. KThe codebook can be predefined, pre-negotiated, or pre-configured, etc. In this application, "predefined" can be understood as definition, pre-defined, preset, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-burned, etc.

[0098] In this article, "code length" can also be abbreviated as "code length", "code character length", etc. The three terms can be used interchangeably, and will not be elaborated further below.

[0099] Hamming distance is used in data transmission error control coding to represent the number of different characters at corresponding positions in two (equal-length) strings. Let d(x,y) represent the Hamming distance between two strings x and y. Performing an XOR operation on these two strings and counting the number of 1s in the result gives the Hamming distance.

[0100] It can also be understood that a codebook with a size of N codewords and a code length of L has a theoretical minimum Hamming distance that satisfies the following formula (1-3).

[0101]

[0102] Optionally, the length L of the codewords in the first codeword set mentioned above can be an even number of bits, and can also be greater than or equal to 2. K K is the bit length of the first PHR information (PHR1). For example, the codeword length L is 22 bits, 26 bits, 30 bits, or 36 bits.

[0103] Optionally, the codewords in the first codeword set mentioned above can be generated based on a (L+2) order Hadamard matrix. The generation method of this first codeword set and the specific content of the codewords can be found in the description below, and will not be elaborated upon here.

[0104] A Hadamard matrix is ​​a square matrix consisting of elements +1 and -1; and each row and column of a Hadamard matrix is ​​mutually orthogonal. A k-order (k×k) Hadamard matrix H satisfies HH T =kI k Here I k H represents the k×k identity matrix. T Let H be the transpose of H. Since all rows of a Hadamard matrix are orthogonal to each other, the Hamming distance between different rows is (k / 2). A normalized Hadamard matrix is ​​a Hadamard matrix where the elements in the first row and the first column are all 1s. When the number of rows k > 2 in a Hadamard matrix, k is an integer multiple of 4.

[0105] This application embodiment designs a new codebook and uses the first codeword set in this codebook to map and encode the first PHR information (PHR1). This satisfies the demodulation performance requirements while reducing the transmission time of the PHR field (mainly PHR1), achieving a good trade-off between demodulation performance and transmission time for the PHR field (mainly PHR1). Furthermore, this application embodiment also improves the encoding performance of the PHR field (mainly PHR1) by increasing the Hamming distance between codewords in the first codeword set.

[0106] The design concept of the codebook in the embodiments of this application is described in detail below, and examples are given to illustrate the codebook and codebook generation method provided in the embodiments of this application.

[0107] This application embodiment considers that the PHY payload field currently supports 5 data rates. In addition, considering whether the PHY payload field uses LDPC encoding, the first PHR information (PHR1) needs at least 10 values ​​to indicate the data rate of the PHY payload field and whether the PHY payload field uses LDPC encoding. Correspondingly, at least 10 codewords are needed to map and encode the first PHR information (PHR1).

[0108] It is understandable that the performance of encoding is related to the minimum Hamming distance between codewords. The larger the minimum Hamming distance between codewords, the greater the difference between different codewords, and thus the better the encoding performance and the easier it is to decode correctly.

[0109] For the case where the first PHR information (PHR1) is 4 bits, if we consider the mapping between all the values ​​of the 4 bits and the codewords, there are a total of 16 codewords. When the code length is L, the upper bound of the theoretical minimum Hamming distance between these 16 codewords is:

[0110]

[0111] However, if we only consider 10 codewords, then when the codeword length is L, the upper limit of the theoretical minimum Hamming distance between these 10 codewords is:

[0112]

[0113] In this article, the symbol "*" represents the "multiplication" operation. The same symbol will have the same meaning in the following text, and will not be repeated hereafter.

[0114] See Figure 6 , Figure 6 This is a schematic diagram illustrating the upper limit of the theoretical minimum Hamming distance under different code lengths provided in the embodiments of this application. For example... Figure 6As shown, the horizontal axis represents code length, and the vertical axis represents the theoretical minimum Hamming distance bound. It's understandable that, considering the precision of the illustration, Figure 6 Only a portion of the code lengths are shown, representing the upper limit of the theoretical minimum Hamming distance, i.e., the code length range represented by the horizontal axis is 20 bits to 32 bits. Figure 6 In this context, "equal" indicates equal encoding, and "unequal" indicates unequal encoding. Equal encoding considers all 16 codewords, while unequal encoding considers only 10 codewords.

[0115] Depend on Figure 6 It can be seen that when the code length L is 20, 22, 24, 26 and 28, considering only 10 codewords (unequal encoding) has a certain advantage in terms of theoretical minimum Hamming distance compared to considering 16 codewords (equal encoding).

[0116] The following example illustrates how to design a codebook that contains 10 codewords, with the Hamming distance between these 10 codewords reaching its maximum value.

[0117] For example, one possible way to generate a codebook is as follows:

[0118] Let K denote the bit length of the first PHR message (i.e., PHR1), and L denote the codeword length, where L≥2. K The first codeword set contains M codewords, where M≤2. K .

[0119] When L = 4n + 2 (n is a positive integer), L + 2 (i.e., 4n + 4) is an integer multiple of 4, and in this case, there exists a normalized Hadamard matrix H of (L + 2) * (L + 2). (L+2) A codebook can be generated by following these steps.

[0120] Step 1: Select a normalized Hadamard matrix H of size (L+2)*(L+2). (L+2) According to the properties of the Hadamard matrix, H (L+2) The Hamming distance between any two rows is (L+2) / 2 = (4(n+1)) / 2 = 2n+2; then remove H (L+2) The elements of the first column can be used to obtain a (L+2)*(L+1) matrix H. ((L+2)*(L+1)) Because of H (L+2) The first column elements (all 1s) are all the same, therefore matrix H ((L+2)*(L+1)) The Hamming distance between any two rows is still 2n+2.

[0121] Step 2: From matrix H ((L+2)*(L+1)) Remove any column from the matrix, and then divide the rows of the resulting matrix into two groups according to the sign of the elements in the removed column, thus obtaining matrix G. + And matrix G - Among them, matrix G + It contains (2n+2) rows of length L (i.e., G) + The size of matrix G is (2n+2) rows and L columns, and matrix G... + The Hamming distance between any two rows of elements in matrix G is still 2n+2. - It contains (2n+2) rows of length L (i.e., G) - The size of matrix G is (2n+2) rows and L columns, and matrix G... - The Hamming distance between any two rows of elements in G is still 2n+2. Furthermore, matrix G... + Any row element in the matrix G - The Hamming distance of any row element in the array is 2n+1.

[0122] Step 3: From matrix G + And matrix G - Choose any M rows of elements from one matrix, and select (2) rows from another matrix. K -M) rows of elements are merged to form a codebook matrix C. The codebook matrix C contains 2... K Given a set of codewords of length L, the minimum Hamming distance between the M valid codewords is 2n+2, and the minimum Hamming distance between all codewords is 2n+1. This can be understood from matrix G... + or matrix G - The M rows of elements selected are the M valid codewords. These M valid codewords can be combined to form the first codeword set, or these M valid codewords are a subset of the codewords in the first codeword set.

[0123] The codebook generated using the above steps satisfies the following: the minimum Hamming distance between codewords in the codebook is equal to the upper limit of the theoretical minimum Hamming distance of this codebook, i.e., 2n+1; the Hamming distance between any two codewords in the first codeword set of this codebook is equal to the upper limit of the theoretical minimum Hamming distance of this first codeword set, i.e., 2n+2. This improves the encoding performance of the first PHR information (PHR1).

[0124] It is understandable that in the above steps (steps one to three), different Hadamard matrices can be used to construct different codebooks, but their minimum Hamming distance remains unchanged. It is also understandable that by rearranging the columns, rows, or inverting all elements of the column (inverting elements means changing element-1 to element 1 and element 1 to element-1) of the codebook matrix C obtained in step three, another codebook matrix can be obtained, which has the same Hamming distance distribution as the codebook matrix C obtained in step three.

[0125] For example, when K equals 4 and L = 22, a 24*24 Hadamard matrix H is constructed as follows. 24 .

[0126]

[0127] Remove H 24 After the first column, we get H. 24*23 The matrix. Assuming H is chosen. 24*23 The first column, and H 24*23 While removing the first column, sort all rows according to H 24*23 The first column of elements is divided into two groups based on their sign:

[0128]

[0129] So, The Hamming distance between any two rows of elements in the array is 12. The Hamming distance between any two rows of elements is also 12. any row of elements and The Hamming distance between any row of elements in the array is 11. Then from... Select 12 rows of elements (i.e., M equals 12). Four rows of elements are selected, and element 1 is mapped to 0, and element -1 is mapped to 1, resulting in the codewords shown in Table 1 below. Among them, The size is 12 rows and 22 columns. The size is also 12 rows and 22 columns.

[0130] It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix. It is also understood that in Table 1 below, the Hamming distance between any two codewords in the first 10 codewords is 12, according to the aforementioned... Figure 6 As shown, the theoretical upper bound for code length L equal to 22 under unequal coding conditions has been reached. Furthermore, for all codewords shown in Table 1 below, the minimum Hamming distance can reach 11, which also reaches the theoretical upper bound for code length L equal to 22 under equal coding conditions.

[0131] Table 1: Examples of codebooks with a code length (L) of 22

[0132]

[0133] For example, when K equals 4, and L = 26, the normalized Hadamard matrix H is 28*28. 28 as follows.

[0134]

[0135] Remove H 28 After the first column, we get H. 28*27 The matrix. Assuming H is chosen. 28*27 Column 14, and H 28*27 While removing column 14, sort all rows according to H 28*27 The positive and negative signs of the elements in column 14 are divided into the following two groups:

[0136]

[0137] So, The Hamming distance between any two rows of elements in the table is 14. The Hamming distance between any two rows of elements is also 14. any row of elements and The Hamming distance between any two elements is 13. Then from... Select 14 rows of elements (i.e., M equals 14). Select 2 rows of elements (any 2 rows, as shown in Table 2 below). (The last two rows are examples), and element 1 is mapped to 0, and element -1 is mapped to 1, resulting in the codewords shown in Table 2 below. Among them, The size is 14 rows and 26 columns. The size is also 14 rows and 26 columns.

[0138] It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix. It is also understood that in Table 2 below, the Hamming distance between any two codewords in the first 10 codewords is 14, according to the aforementioned... Figure 6 As shown, the theoretical upper bound for a code length L equal to 26 under unequal coding conditions has been reached. Furthermore, for all codewords shown in Table 2 below, the minimum Hamming distance can reach 13, which also reaches the theoretical upper bound for a code length L equal to 26 under equal coding conditions.

[0139] Table 2: Examples of codebooks with a code length (L) of 26 1

[0140]

[0141]

[0142] For example, when K equals 4, and L = 30, the normalized Hadamard matrix H is 32*32. 32 as follows.

[0143]

[0144] Remove H 32 After the first column, we get H. 32*31 The matrix. Assuming H is chosen. 32*31 The first column, and H 32*31 While removing the first column, sort all rows according to H 32*31 The first column of elements is divided into two groups based on their sign:

[0145]

[0146]

[0147] So, The Hamming distance between any two rows of elements in the table is 16. The Hamming distance between any two rows of elements is also 16. any row of elements and The Hamming distance between any row of elements in the array is 15. Because... The size is 16 rows and 30 columns. The size is also 16 rows and 30 columns. Therefore, it can be derived from... or Select 16 rows of elements (see Table 3 below for selection) Taking the 16th row of elements as an example, and mapping element 1 to 0 and element -1 to 1, we obtain the codewords shown in Table 3 below.

[0148] It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix. It is also understood that in Table 3 below, the Hamming distance between any two codewords is 16, according to the aforementioned... Figure 6 As shown, the theoretical upper limit is reached when the code length L is equal to 30 under the case of unequal coding.

[0149] Table 3: Examples of codebooks with a code length (L) of 30 1

[0150]

[0151]

[0152] Furthermore, when L≥2 (K+1)When the length is -2, the code length can be split into two parts L = L1 + L2. Using the above codebook generation method, codebook matrices with code length L1 and code length L2 are designed respectively. Then, these two codebook matrices are concatenated to form a codebook of length L.

[0153] For example, when L = 18 + 18, the normalized Hadamard matrix H is 20*20. 20 as follows.

[0154]

[0155] Remove H 20 After the first column, we get H. 20*19 The matrix H. 20*19 Remove any column (for example, the first column here), and then divide the rows of the matrix after removing the column into two groups according to the sign of the elements in the removed column:

[0156]

[0157]

[0158] from Select 10 rows of elements, from The selected six rows of elements form a codebook matrix C with a code length L of 18. 16×18 .

[0159]

[0160] Then take the two Cs 16×18 The code is concatenated to form a codebook matrix C with a code length L of 36. 16×36 .

[0161] C 16×36 =[C 16×18 C p 16×18 ]

[0162] Among them, C p 16×18 Indicates C 16×18 The matrix obtained by rearranging the rows. Since the row arrangement does not affect C... 16×18 The Hamming distance, so C 16×18 The Hamming distance between any two elements in the last 10 rows is 10, and the Hamming distance between any two elements in the first 6 rows is also 10. However, the Hamming distance between any element in the first 6 rows and any element in the last 10 rows is 9.

[0163] When C p 16×18 With C 16×18Simultaneously, mapping element 1 to 0 and element -1 to 1 yields the codewords shown in Table 4 below. It is understood that this embodiment does not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix. It is also understood that in Table 4 below, the Hamming distance between any two codewords in the last 10 codewords is 20, reaching the theoretical upper bound when the code length L equals 36 in the case of unequal encoding. Furthermore, for all codewords shown in Table 4 below, the minimum Hamming distance is 18.

[0164] Table 4: Examples of codebooks with a code length (L) of 36 1

[0165]

[0166]

[0167] For example, when L = 18 + 14, the normalized Hadamard matrix H is 20*20. 20 as follows.

[0168]

[0169] Remove H 20 After the first column, we get H. 20*19 The matrix H. 20*19 Remove any column (for example, the first column here), and then divide the rows of the matrix after removing the column into two groups according to the sign of the elements in the removed column:

[0170]

[0171] from Select 10 rows of elements, from Select any 6 rows of elements (for example, select 6 rows here). The last 6 rows of elements form a codebook matrix C with a code length L of 18. 16×18 .

[0172]

[0173] Then use the 16*16 normalized Hadamard matrix H 16 as follows:

[0174]

[0175] Remove H 16 After the first column, we get H. 16*15 The matrix H. 16*15 Remove any column (for example, the first column here), and then divide the rows of the matrix after removing the column into two groups according to the sign of the elements in the removed column:

[0176]

[0177] from Select 8 rows of elements, plus those from... Select 8 rows of elements to form a codebook matrix C with a code length L of 14. 16×14 .

[0178]

[0179] Then C 16×18 and C 16×14 The code is concatenated to form a codebook matrix C with a code length L of 32. 16×32 .

[0180] C 16×32 =[C 16×18 C p 16×14 ]

[0181] Among them, C p 16×14 It is for C 16×14 The matrix is ​​obtained by rearranging the rows, and the row arrangement does not affect C. 16×14 The Hamming distance distribution, where C p 16×14＝ C 16×14 Therefore, C 16×32 The Hamming distance between any two elements in the first 8 rows is 18, the Hamming distance between any two elements in the first 10 rows is either 18 or 17, and the Hamming distance between any two elements in all 16 rows is at least 16.

[0182] When C p 16×14 With C 16×14 When elements are the same, mapping element 1 to 0 and element -1 to 1 yields the codewords shown in Table 5a below. It is understood that this application does not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0183] Table 5a: Examples of codebooks with a code length (L) of 32 1

[0184]

[0185]

[0186] For example, when L = 22 + 10, the normalized Hadamard matrix H is 24*24. 24 as follows.

[0187]

[0188] Remove H 24After the first column, we get H. 24*23 The matrix. In the selected H... 24×23 The first column will be matrix H 24*23 The first column is removed, and the rows of the matrix after removing the column are divided into two groups according to the sign of the elements in the removed column:

[0189]

[0190] So, The Hamming distance between any two rows of elements in the array is 12. The Hamming distance between any two rows of elements is also 12. any row of elements and The Hamming distance between any row of elements in the array is 11.

[0191] Then use the 12*12 normalized Hadamard matrix H 12 as follows:

[0192]

[0193] Remove H 12 After the first column, we get H. 12*11 The matrix H. 12*11 Remove any column (for example, the first column here), and then divide the rows of the matrix after removing the column into two groups according to the sign of the elements in the removed column:

[0194]

[0195] So, The Hamming distance between any two rows of elements in the array is 6. The Hamming distance between any two rows of elements is also 6. any row of elements and The Hamming distance between any row of elements in the given text is 5. Then... and All rows are merged together to form a codebook matrix C with a code length L of 10. 12×10 .

[0196]

[0197] Will or With C 12×10 The parts are concatenated to form a codebook matrix C with a code length L of 32. 12×32 .

[0198] or

[0199] Among them, C12×32 The Hamming distance between any two elements in the first 6 rows is 18, and the Hamming distance between any two elements in the last 6 rows is also 18. The Hamming distance between any element in the first 6 rows and any element in the last 6 rows is 17.

[0200] by With C 12×10 Taking splicing as an example, C 12×32 In this matrix, element 1 is mapped to 0, and element -1 is mapped to 1, resulting in the codewords shown in Table 5b below. It is understood that this application does not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0201] Table 5b: Examples of codebooks with a code length (L) of 32

[0202]

[0203]

[0204] It is understood that Tables 1 to 4 above are merely examples. The mapping relationship between data rate and LDPC indication and codewords in Tables 1 to 4 is not fixed. It is only necessary to ensure that different combinations of data rate and LDPC indication map to different codewords. In other words, different values ​​of the first PHR information (PHR1) map to different codewords.

[0205] For example, the first codeword set may include one or more of the following codewords: one or more codewords in Table 1, one or more codewords in Table 2, one or more codewords in Table 3, one or more codewords in Table 4, one or more codewords in Table 5a, or one or more codewords in Table 5b.

[0206] To better illustrate the beneficial effects of using the first codeword set designed in the embodiments of this application to map and encode the first PHR information (i.e., PHR1), the performance of the embodiments of this application is illustrated below by exemplarily demonstrating the packet error rate of the first PHR information (i.e., PHR1) under different encoding methods. Furthermore, the advantages of the embodiments of this application in terms of transmission duration are also illustrated by calculating the transmission time of the first PHR information (i.e., PHR1).

[0207] For example, see Figure 7 , Figure 7 This is a schematic diagram illustrating the packet error rate simulation results of PHR1 using different encoding methods, provided in an embodiment of this application. For example... Figure 7As shown, the horizontal axis represents the signal-to-noise ratio (SNR), measured in decibels (dB); the vertical axis represents the packet error rate (PER) of the first PHR message (PHR1). It is understandable that, considering the precision of the illustration, Figure 7 Only a portion of the simulation results are shown; the horizontal axis represents the SNR range from -5dB to 0, and the vertical axis represents the packet error rate range greater than 10. -3 . Figure 7 In this table, BCC represents the packet error rate when the 4 bits of PHR1 are convolutionally encoded; equal,L=22 represents the packet error rate when PHR1 is mapped using all the codewords in Table 1; Uequal,L=22 represents the packet error rate when PHR1 is mapped using the first 10 codewords (i.e., the first codeword set) in Table 1; equal,L=26 represents the packet error rate when PHR1 is mapped using all the codewords in Table 2; and Uequal,L=26 represents the packet error rate when PHR1 is mapped using the first 10 codewords (i.e., the first codeword set) in Table 2.

[0208] Depend on Figure 7 It can be seen that as the codeword length increases, the packet error rate performance of PHR1 continuously improves.

[0209] In addition, the transmission time of PHR1 when using codebooks with different codeword lengths is shown in Table 6 below.

[0210] Table 6

[0211] Code length PHR1 transmission duration (µs) 20 5 22 5.5 26 6.5

[0212] As shown in Table 6 above, the codebook designed in this application for mapping and encoding the first PHR information (i.e., PHR1) has a shorter transmission time compared to the prior art solution 3 (transmitting PHR1 at a rate of 0.975Mbps).

[0213] Therefore, the embodiments of this application can both meet the demodulation performance requirements and reduce the transmission time of the PHR field (mainly PHR1), achieving a good trade-off between the demodulation performance and transmission time of the PHR field (mainly PHR1).

[0214] This application also provides another implementation of the first codeword set.

[0215] Since the PHY payload field currently supports five data rates, even considering the indication of whether the PHY payload field uses LDPC encoding, a maximum of 10 values ​​are needed to indicate this. Therefore, at least 10 (considering future standard extensions) different codeword sequences can be used to indicate the modulation and coding rate information of the UWB system. For lower data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be larger; for higher data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be smaller, thus matching the codeword sequence performance with the data coding and modulation rate.

[0216] For example, another possible way to generate a codebook is as follows:

[0217] When L = 16, the normalized Hadamard matrix H is 12*12. 12 As shown below.

[0218]

[0219] Remove H 12 After the first column, we get H. 12×11 The matrix.

[0220]

[0221] So H 12×11 The Hamming distance between any two rows of elements in the matrix is ​​6. Reconstruct matrix P. 12×5 , making P 12×5 The first row contains all elements of -1, and all other elements contain all elements of 1, i.e.:

[0222]

[0223] So, P 12×5 The Hamming distance between the elements in the first row and the elements in all other rows is 5, and the Hamming distance between any two elements in any other row is 0. Therefore, a codebook matrix C of length 16 can be constructed. 12×16 =[P 12×5 H 12×11 ]. C 12×16 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 12×11 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 12×16 The Hamming distance distribution, where the codebook matrix C... 12×16 The Hamming distance between the first row of elements and any other row is 11, and the Hamming distance between any two other rows is 6.

[0224] The codebook matrix C12×16 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 7 below.

[0225] Table 7: Examples of codebooks with a code length (L) of 16

[0226]

[0227]

[0228] When L = 18, the normalized Hadamard matrix H is 12*12. 12 As mentioned above, this will not be repeated here. Remove H. 12 After the first column, we get H. 12×11 The matrix, as shown above, will not be repeated here. Where H... 12×11 The Hamming distance between any two rows of elements is 6.

[0229] Reconstruct matrix P 12×7 , making P 12×7 The first row contains all elements of -1, and all other elements contain all elements of 1, i.e.:

[0230]

[0231] So, P 12×7 The Hamming distance between the elements in the first row and the elements in all other rows is 7, and the Hamming distance between any two elements in any other row is 0. Therefore, a codebook matrix C of length 18 can be constructed. 12×18 =[P 12×7 H 12×11 ]. C 12×18 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 12×11 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 12×18 The Hamming distance distribution, where the codebook matrix C... 12×18 The Hamming distance between the first row of elements and any other row is 13, and the Hamming distance between any two other rows is 6.

[0232] The codebook matrix C 12×18 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 8 below.

[0233] Table 8: Examples of codebooks with a code length (L) of 18

[0234]

[0235] Alternatively, when L = 18, the 16*16 normalized Hadamard matrix H16 As shown below.

[0236]

[0237] Remove H 16 After the first column, we get H. 16×15 The matrix.

[0238]

[0239] So H 16×15 The Hamming distance between any two rows of elements in the matrix is ​​8. Reconstruct matrix P. 16×3 , making P 16×3 The first row contains all elements of -1, and all other elements contain all elements of 1, i.e.:

[0240]

[0241] So, P 16×3 The Hamming distance between the elements in the first row and the elements in all other rows is 3, and the Hamming distance between any two elements in any other row is 0. Therefore, a codebook matrix C of length 18 can be constructed. 16×18 =[P 16×3 H 16×15 ]. C 16×18 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 16×15 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 16×18 The Hamming distance distribution, where the codebook matrix C... 16×18 The Hamming distance between the first row of elements and any other row is 11, and the Hamming distance between any two other rows is 8.

[0242] The codebook matrix C 16×18 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 9 below.

[0243] Table 9: Examples of codebooks with a code length (L) of 18 (2)

[0244]

[0245]

[0246] When L = 20, the normalized Hadamard matrix H is 12*12. 12 As mentioned above, this will not be repeated here. Remove H. 12 After the first column, we get H. 12×11 The matrix, as shown above, will not be repeated here. Where H... 12×11The Hamming distance between any two rows of elements is 6.

[0247] Reconstruct matrix P 12×9 , making P 12×9 The first three rows are repetitions of the following matrix:

[0248]

[0249] In other words, P 12×9 The first three rows are obtained by repeating matrix H3 three times, that is:

[0250]

[0251] So, P 12×9 The Hamming distance between any element in the first three rows and any element in any other row is 6, and the Hamming distance between any two elements in any other row is 0. Therefore, a codebook matrix C of length 20 can be constructed. 12×20 =[P 12×9 H 12×11 ]. C 12×20 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 12×11 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 12×20 The Hamming distance distribution, where the codebook matrix C... 12×20 The Hamming distance between any element in the first three rows and any other element in the other rows is 12, and the Hamming distance between any two elements in the other rows is 6.

[0252] The codebook matrix C 12×20 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 10 below.

[0253] Table 10: Examples of codebooks with a code length (L) of 20 1

[0254]

[0255]

[0256] Alternatively, the 16x16 normalized Hadamard matrix H 16 As mentioned above, this will not be repeated here. Remove H. 16 After the first column, we get H. 16×15 The matrix, as shown above, will not be repeated here. Where H... 16×15 The Hamming distance between any two rows of elements is 8.

[0257] Reconstruct matrix P 16×5 , making P 16×5As shown below:

[0258]

[0259] or,

[0260] For case 1, P 16×5 The Hamming distance between the elements in the first row and the elements in the other rows is 5, and the Hamming distance between any two elements in any row other than the first row is 0. Therefore, a codebook matrix C of length 20 can be constructed. 16×20 =[P 16×5 H 16×15 ]. C 16×20 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 16×15 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 16×20 The Hamming distance distribution, where the codebook matrix C... 16×20 The Hamming distance between the elements in the first row and any other row is 13, and the Hamming distance between any two other rows is 8. Let the codebook matrix C... 16×20 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 11 below.

[0261] Table 11: Examples of codebooks with a code length (L) of 20

[0262]

[0263]

[0264] For case 2, P 16×5 The Hamming distance between any element in the first three rows and any other row is at least 3, and the Hamming distance between any two other rows is 0. Therefore, a codebook matrix C of length 20 can be constructed. 16×20 =[P 16×5 H 16×15 ]. C 16×20 This can be understood as concatenating two matrices. Before concatenating, we can modify the right-hand matrix H. 16×15 The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 16×20 The Hamming distance distribution, where the codebook matrix C... 16×20 The Hamming distance between any element in the first three rows and any element in any other row is 11, and the Hamming distance between any two elements in the other rows is 8. Let the codebook matrix C... 16×20 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 12 below.

[0265] Table 12: Examples of codebooks with a code length (L) of 20 (3)

[0266]

[0267]

[0268] Alternatively, using the normalized Hadamard matrix H, which is 20*20 as shown below. 20 .

[0269]

[0270] Remove H 20 After the first column, we get H. 20*19 The matrix. Assuming H is chosen. 20*19 The first column, and H 20*19 While removing the first column, sort all rows according to H 20*19 The first column of elements is divided into two groups based on their sign:

[0271]

[0272] So, The Hamming distance between any two rows of elements in the table is 10. The Hamming distance between any two rows of elements is also 10. any row of elements and The Hamming distance between any row of elements in the array is 9.

[0273] Reconstruct matrix P 10×2 , making P 10×2 As shown below:

[0274]

[0275] Therefore, a codebook matrix of length 20 can be constructed. C 10×20 This can be understood as concatenating two matrices. Before concatenating, the right-hand matrix can be modified. The rows are rearranged, and the resulting codebook matrix is ​​concatenated without affecting the original codebook matrix C. 10×20 The Hamming distance distribution, where the codebook matrix C... 10×20 The Hamming distance between any element in the first two rows and any element in the other rows is 11, and the Hamming distance between any two elements in the other rows is 10.

[0276] The codebook matrix C 10×20 The element 1 is mapped to 0, and the element -1 is mapped to 1, resulting in the codewords shown in Table 13 below.

[0277] Table 13: Examples of codebooks with a code length (L) of 20 (4)

[0278]

[0279] It is understood that Tables 7 to 13 above are merely examples. The mapping relationship between modulation coding rate combinations and codewords in Tables 7 to 13 is not fixed. It is only necessary to ensure that different combinations of data rates and LDPC indicators are mapped to different codewords.

[0280] For example, the first codeword set mentioned above may include one or more of the following codewords: one or more codewords from Tables 7 to 13 mentioned above.

[0281] It is understood that operations such as inverting one or more columns of elements in all or part of the codeword sequences in Tables 7 to 13 above (for example, inverting elements means changing element 1 to element 0 and element 0 to element 1), or rearranging rows or columns, do not affect the Hamming distance distribution and are all within the scope of protection of this application.

[0282] This application also provides another implementation of the first codeword set.

[0283] For example, since the PHY payload field currently supports five data rates, even considering the indication of whether the PHY payload field uses LDPC encoding, a maximum of 10 values ​​are needed to indicate this. Therefore, at least 10 (considering future standard extensions) different codeword sequences can be used to indicate the modulation and coding rate information of the UWB system. For smaller data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be larger; for larger data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be smaller, thus matching the codeword sequence performance with the data coding and modulation rate.

[0284] It is understandable that for an extended binary Gray code with a code rate of 0.5 and a length of 24, the Hamming distance between any two codewords is at least 8. Therefore, this application considers designing a sequence set (i.e., a codebook) based on an extended binary Gray code with a code rate of 0.5 and a length of 24, thereby guaranteeing the Hamming distance between codewords in the sequence set (i.e., the codebook).

[0285] For example, the generator matrix G of the extended binary Gray code with a code rate of 0.5 and a length of 24 is as follows:

[0286]

[0287] Any binary information bit sequence of length 12 (That is, a binary vector with 1 row and 12 columns), multiplied by the generating matrix G (here, binary multiplication results in binary 0s and 1s), yields a derived binary Gray code. Right now

[0288] It is understandable that different sequences of binary information bits are used. This allows the generation of different extended binary Gray codes. To extend a binary Gray code As a codeword sequence, since the information bit length is 12, it is possible to construct 2... 12 = 4096 distinct codeword sequences. According to coding theory, the extended binary Gray code with a code rate of 0.5 and a length of 24 can be shortened by removing some information bits and their corresponding parity bits. This corresponds to reducing the dimension of the generator matrix G, and this operation (i.e., the shortening operation) does not reduce the Hamming distance between codewords.

[0289] Therefore, the extended binary Gray code with a code rate of 0.5 and a length of 24 can be shortened by k bits. The generator matrix of this shortened extended binary Gray code can then be represented as: G short = G((k+1):12,(k+1):24). Where, the generating matrix G... short It contains rows (k+1) to 12 and columns (k+1) to 24 of the generating matrix G. It can be understood that, based on the generating matrix G... short , can construct 2 (12-k) Barcode character sequence.

[0290] For example, one possible way to generate a codebook is as follows:

[0291] When the code length L = 18, the extended binary Gray code with a code rate of 0.5 and a length of 24 can be shortened by 5 bits, resulting in 128 codeword sequences of length 19. Deleting any bit from these 128 codeword sequences, such as deleting the first bit, yields 128 codeword sequences of length 18. From these 128 codeword sequences of length 18, we can select 18 sequences containing 12 ones; adding these to the sequences containing all zeros, we obtain 19 codewords as shown in Table 14 below.

[0292] Table 14: Examples of codebooks with a code length (L) of 18 (3)

[0293]

[0294]

[0295] Among the 19 codewords shown in Table 14 above, the Hamming distance between the first codeword (i.e., the codeword with all elements equal to 0) and the other codewords is 12, and the Hamming distance between any two codewords other than the first codeword is at least 8.

[0296] In some scenarios, the first codeword in Table 14 (i.e., the codeword with all elements equal to 0) can be used to indicate a lower rate, while the other codewords can be used to indicate a higher rate. In some scenarios, the sender can select the appropriate codeword sequence based on the load rate, and then map the selected codeword sequence to 1 and -1 before sending. For example, element 0 is mapped to element 1, and element 1 is mapped to element -1. Of course, element 0 can also be mapped to element -1, and element 1 can be mapped to element 0. This application does not impose any limitations.

[0297] It is understood that Table 14 above is only an example. The mapping relationship between modulation coding rate combinations and codewords in Table 14 is not fixed. It is only necessary to ensure that different combinations of data rates and LDPC indicators are mapped to different codewords.

[0298] For example, the first codeword set mentioned above may include one or more codewords from Table 14 above. In practical applications, only some of the codewords in Table 14 above may be used, or some of the codewords in Table 14 above may be reserved.

[0299] It is understood that operations such as inverting one or more columns of all codewords in Table 14 above (for example, inverting elements means changing element 1 to element 0 and element 0 to element 1), or rearranging rows or columns, do not affect the Hamming distance distribution and are all within the scope of protection of this application.

[0300] This application also provides another implementation of the first codeword set.

[0301] For example, since the PHY payload field currently supports five data rates, even considering the indication of whether the PHY payload field uses LDPC encoding, a maximum of 10 values ​​are needed to indicate this. Therefore, at least 10 (considering future standard extensions) different codeword sequences can be used to indicate the modulation and coding rate information of the UWB system. For smaller data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be larger; for larger data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be smaller, thus matching the codeword sequence performance with the data coding and modulation rate.

[0302] For example, one possible way to generate a codebook is as follows:

[0303] For the case where the code length L = 18, the code length can be split into two parts L = 12 + 6, and codebooks with a code length of 12 and codebooks with a code length of 6 can be designed respectively. These two codebooks can then be spliced ​​together to form a codebook with a code length of 18.

[0304] Choose 12 sequences from a sequence of length 12 that contains 5 ones and 7 zeros, such that the Hamming distance between any two sequences is at least 6. For example, a codebook matrix P1 of length 12 is as follows:

[0305]

[0306] In a codebook matrix P1 with a code length of 12, the Hamming distance between any two rows of elements is at least 6.

[0307] For example, the codebook matrix P2 with a code length of 6 is as follows:

[0308]

[0309] Concatenating the codebook matrix P1 (length 12) and the codebook matrix P2 (length 6) together yields a sequence set [P1, P2] with a code length of 18. The Hamming distance between any two sequences in this sequence set [P1, P2] is either 8 or 10. Furthermore, the Hamming distance between a sequence of all 1s (i.e., all 18 elements are 1) and any sequence in the sequence set [P1, P2] is 12, and the sequence [0...]... 12 The Hamming distance between

[16] (i.e., the sequence consisting of 12 elements 0 and 6 elements 1) and any sequence in the sequence set [P1, P2] is 10; therefore, these two sequences (i.e., the sequence of all 1s and the sequence [0, P2]) can be considered as one. 12 Using the sequence set [P1,P2] with a code length of 18 as the codebook, we can obtain 14 codewords as shown in Table 15 below.

[0310] Table 15: Examples of codebooks with a code length (L) of 18 (4)

[0311]

[0312]

[0313] Among the 14 codewords shown in Table 15 above, the Hamming distance between the first codeword (i.e., the codeword with all elements being 1) and the other codewords is 12, the Hamming distance between the second codeword (i.e., the codeword with the first 12 elements being all 0 and the last 6 elements being all 1) and the other codewords is 10, and the Hamming distance between any two codewords other than the first and second codewords is at least 8.

[0314] In some scenarios, the first codeword (i.e., the codeword with all elements equal to 1) and the second codeword (i.e., the codeword with the first 12 elements all equal to 0 and the last 6 elements all equal to 1) in Table 15 can be used for lower rate indication, while the other codewords are used for higher rate indication. In some scenarios, the sending end can select the appropriate codeword sequence based on the load rate, and then map the selected codeword sequence to 1 and -1 before sending. For example, element 0 is mapped to element 1, and element 1 is mapped to element -1. Of course, element 0 can also be mapped to element -1, and element 1 can be mapped to element 0. This application embodiment does not impose any limitations.

[0315] It is understood that Table 15 above is only an example. The mapping relationship between modulation coding rate combinations and codewords in Table 15 is not fixed. It is only necessary to ensure that different combinations of data rates and LDPC indicators are mapped to different codewords.

[0316] For example, the first codeword set mentioned above may include one or more codewords from Table 15 above. In practical applications, only some of the codewords in Table 15 above may be used, or some of the codewords in Table 15 above may be reserved.

[0317] It is understood that operations such as inverting one or more columns of all codewords in Table 15 above (for example, inverting elements means changing element 1 to element 0 and element 0 to element 1), or rearranging rows or columns, do not affect the Hamming distance distribution and are all within the scope of protection of this application.

[0318] See Figure 8 , Figure 8 This is another schematic diagram of the ultra-wideband signal transmission method provided in the embodiments of this application. For example... Figure 8 As shown, this ultra-wideband-based signal transmission method includes, but is not limited to, the following steps:

[0319] S201, the first communication device generates a PPDU, which includes a PHR field and a PHY payload field. The PHR field includes first PHR information, which is used to indicate the data rate of the PHY payload field.

[0320] S202, the first communication device sends a signal, which is generated based on the PPDU. The signal includes a signal generated by encoding codewords based on the first PHR information. The codewords include codewords in the first codeword set that correspond to the first PHR information.

[0321] Correspondingly, the second communication device receives the signal.

[0322] S203, the second communication device decodes the signal to obtain the first PHR information.

[0323] Optionally, the PPDU mentioned above can be a PPDU applied in the UWB WPAN standard, such as the PPDU in the 802.15.4ab protocol.

[0324] Optionally, the aforementioned PPDU may include, but is not limited to, a PHR field and a PHY payload field. The PHR field may include first PHR information and second PHR information. The first PHR information may be used to indicate the data rate of the PHY payload field. The second PHR information may be used to indicate whether the PHY payload field is encoded using a first encoding method and the length of the PHY payload field, and optionally also to indicate one or more of the following: whether the PPDU is used for sensing measurements or a CRC code.

[0325] For example, the first PHR information in this application embodiment can be understood as the 3 bits in PHR1 used to indicate the data rate of the PHY payload field, and the second PHR information can be understood as the 1 bit in PHR1 used to indicate whether the PHY payload field is encoded using the first encoding method and PHR2. That is, the first PHR information has a total of 3 bits, used to indicate the data rate of the PHY payload field; the second PHR information has a total of 24 bits, of which 1 bit is used to indicate whether the PHY payload field is encoded using the first encoding method, 12 bits are used to indicate the length of the PHY payload field, 1 bit is used to indicate whether the PPDU is used for sensing measurement, 2 bits are reserved, and 8 bits are used to indicate the CRC code.

[0326] For example, the first encoding method can be any of the following: LDPC, convolutional code, polar code, turbo code, etc., and the embodiments of this application are not limited thereto. For ease of description, the first encoding method is LDPC as an example for illustration; of course, as standards develop, LDPC in the following text can also be replaced by any encoding method specified in future standards (such as convolutional code, polar code, turbo code, etc.).

[0327] Optionally, the first communication device can encode the generated PPDU, and then modulate the encoded codewords into UWB pulses (i.e., signals) for transmission. Correspondingly, after receiving the signal (i.e., the UWB pulse), the second communication device demodulates the signal to obtain the PPDU-encoded codewords, and then decodes the encoded codewords of the first PHR information according to a first codeword set to obtain the first PHR information. The first codeword set can be predefined, pre-negotiated, or pre-configured, etc. The encoding here can include convolutional codes, LDPC, specific codebooks, repetitive codes, etc. It can be understood that different fields in the PPDU can be encoded using different encoding methods. For example, the PHY payload field in the PPDU can be encoded using LDPC or convolutional codes, while the SFD field can be mapped using a codebook. As another example, the first PHR information in the PPDU can be mapped using a codebook, while the second PHR information can be encoded using convolutional codes, and so on.

[0328] Therefore, the aforementioned signal can be generated based on PPDU. This signal must include at least a signal generated from codewords encoded from the aforementioned first PHR information. These codewords can include codewords in the first codeword set mapped to the first PHR information. In some scenarios, the Hamming distance between any two codewords in the first codeword set is greater than or equal to the upper bound of the theoretical minimum Hamming distance of the first codeword set. For example, if the first codeword set has M codewords, each with a length L, then the Hamming distance d between any two codewords in the first codeword set can satisfy the aforementioned formula (1-1) or formula (1-2). Further exemplarily, M is less than or equal to 2... K .

[0329] Optionally, the length L of the codewords in the first codeword set mentioned above can be an even number of bits, and can also be greater than or equal to 2. K K is the bit length of the first PHR information. For example, K equals 3. For another example, the codeword length L is any of the following: 20 bits, 22 bits, 24 bits, 26 bits, 28 bits, 30 bits, 32 bits, 34 bits, 36 bits, 38 bits, or 40 bits.

[0330] Optionally, the codewords in the first codeword set mentioned above can be based on 2 K The generation of the Hadamard matrix of order 1 (8*8 when K is 3) is described below. The generation method of this first codeword set and the specific content of the codewords are described in detail below, and will not be elaborated here.

[0331] This application embodiment designs a new codeword set (i.e., codebook) and uses the codewords in this codeword set to map and encode the first PHR information. Since the minimum Hamming distance in this codeword set can reach the theoretical upper limit, the encoding performance of the PHR field (mainly the first PHR information) can be improved.

[0332] The design concept of the first codeword set in the embodiments of this application is described in detail below, and examples are given to illustrate the first codeword set and the generation method of the first codeword set provided in the embodiments of this application.

[0333] In this embodiment, the 1 bit used to indicate whether the PHY payload field is encoded using LDPC is placed in PHR2, so the first PHR information in this embodiment has a total of 3 bits. Furthermore, considering that the PHY payload field currently supports 5 data rates, the first PHR information (3 bits) needs at least 5 possible values ​​to indicate the data rate of the PHY payload field; correspondingly, at least 5 codewords are needed to map and encode the first PHR information.

[0334] It is understandable that the performance of encoding is related to the minimum Hamming distance between codewords. The larger the minimum Hamming distance between codewords, the greater the difference between different codewords, and thus the better the encoding performance and the easier it is to decode correctly.

[0335] For the case where the first PHR information is 3 bits, if we consider the mapping between all the values ​​of the 3 bits and the codewords, there are a total of 8 codewords. When the code length is L, the upper limit of the theoretical minimum Hamming distance between these 8 codewords is:

[0336]

[0337] If we only consider 5 codewords, then when the codeword length is L, the upper limit of the theoretical minimum Hamming distance between these 5 codewords is:

[0338]

[0339] See Figure 9 , Figure 9 This is another schematic diagram illustrating the upper limit of the theoretical minimum Hamming distance under different code lengths provided in the embodiments of this application. For example... Figure 9 As shown, the horizontal axis represents code length, and the vertical axis represents the theoretical minimum Hamming distance bound. It's understandable that, considering the precision of the illustration, Figure 9 Only a portion of the code lengths are shown, representing the upper limit of the theoretical minimum Hamming distance, i.e., the code length range represented by the horizontal axis is 20 bits to 40 bits. Figure 9In this context, "equal" indicates equal encoding, and "unequal" indicates unequal encoding. Equal encoding considers all 8 codewords, while unequal encoding considers only 5 codewords.

[0340] Depend on Figure 9 It can be seen that when the first PHR information is 3 bits, under different code lengths, considering only 5 codewords (unequal encoding) has a certain advantage in theoretical minimum Hamming distance compared to considering 8 codewords (equal encoding).

[0341] The following example illustrates how to design a first codeword set such that the Hamming distance between any two codewords in the first codeword set is greater than or equal to the upper limit of the theoretical minimum Hamming distance of this first codeword set.

[0342] For example, one possible way to generate a codebook is as follows:

[0343] Let K represent the bit length of the first PHR information, and in this embodiment, K equals 3; L represents the length of the codeword, and L≥2. K The first codeword set contains 2 codewords. K .

[0344] When L = 7n + m (where n and m are both positive integers), the first codeword set can be generated based on the normalized 8*8 Hadamard matrix H8.

[0345]

[0346] Since the first column of H8 consists entirely of 1s, it contributes no contribution to the Hamming distance between different rows. We can remove the first column of H8 to obtain the following matrix H. (8×7) .

[0347]

[0348] Furthermore, based on the properties of the Hadamard matrix, H (8×7) The Hamming distance between any two rows of elements is (8 / 2) = 4.

[0349] If m = 0, then L = 7n, and matrix H can be... (8×7) Repeated n times, n matrices H are obtained. (8×7) Then we can work on these n H's (8×7) After rearranging the rows (or skipping the rearrangement process), and then arranging them row by row, we obtain matrix C. 8×7n .

[0350]

[0351] in, Indicates H(8×7) The matrix obtained by rearranging the rows will be represented in the same way and have the same meaning in the following text, and will not be repeated here. Because H (8×7) The Hamming distance between any two rows of elements in H is 4, while H (8×7) Repeating n times and rearranging rows does not affect each H (8×7) The Hamming distance in the middle, therefore C 8×7n The Hamming distance between any two rows of elements in C is 4n. Then, C... 8×7n Elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length of 7n. It is understood that this application does not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0352] For example, when L = 28, the codebook with a code length of 28 is shown in Table 16 below. The Hamming distance between any two codewords in Table 16 is 16. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 16 below.

[0353] Table 16: Examples of codebooks with a code length (L) of 28

[0354]

[0355]

[0356] If m = 1, 2, 5, or 6, and L = 7n + m, then matrix H can be... (8×7) Repeated n times, n matrices H are obtained. (8×7) Then we can work on these n H's (8×7) After rearranging the rows (or skipping the rearrangement process), arrange them side-by-side according to the rows, starting from H. (8×7) arbitrarily select m columns to form matrix H (8×m) And this matrix C is obtained by arranging it row-by-row with the matrix obtained by repeating it n times. 8×(7n+m) .

[0357]

[0358] in, Indicates H (8×7) The matrix after rearranging the rows. Since matrix H has m = 1, 2, 5, and 6 respectively. (8×m) The minimum Hamming distance between elements in each row of C is 0, 0, 2, 3. When m equals 1 or 2, C 8×(7n+m) The minimum Hamming distance between elements in each row is 4n. When m equals 5, C 8×(7n+m) The minimum Hamming distance between elements in each row is 4n+2. When m equals 6, C 8×(7n+m) The minimum Hamming distance between elements in each row of C is 4n+3. Then, C... 8×(7n+m)The elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length L = 7n + m. It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0359] For example, when L = 22, the codebook with a code length of 22 is shown in Table 17 below. The minimum Hamming distance between these 8 codewords in Table 17 is 12. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 17 below.

[0360] Table 17: Examples of codebooks with a code length (L) of 22

[0361]

[0362] For example, when L=26, the codebook with a code length of 26 is shown in Table 18 below. The minimum Hamming distance between these 8 codewords in Table 18 is 14. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 18 below.

[0363] Table 18: Examples of codebooks with a code length (L) of 26

[0364]

[0365]

[0366] For example, when L=30, the codebook with a code length of 30 is shown in Table 19 below. The minimum Hamming distance between these 8 codewords in Table 19 is 16. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 19 below.

[0367] Table 19: Examples of codebooks with a code length (L) of 30 (2)

[0368]

[0369] For example, when L=34, the codebook with a code length of 34 is shown in Table 20 below. The minimum Hamming distance between these 8 codewords in Table 20 is 19. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 20 below.

[0370] Table 20: Examples of codebooks with a code length (L) of 34

[0371]

[0372] For example, when L=36, the codebook with a code length of 36 is shown in Table 21 below. The minimum Hamming distance between these 8 codewords in Table 21 is 20. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 21 below.

[0373] Table 21: Examples of codebooks with a code length (L) of 36

[0374]

[0375]

[0376] For example, when L = 40, the codebook with a code length of 40 is shown in Table 22 below. The minimum Hamming distance between these 8 codewords in Table 22 is 22. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 22 below.

[0377] Table 22: Examples of codebooks with a code length (L) of 40

[0378]

[0379] If m = 3 and L = 7n + 3, choose a 12*12 normalized Hadamard matrix H. 12 .

[0380]

[0381] Then remove H. 12 The elements in the first column can be used to obtain a 12x11 matrix H. 12*11 Then from matrix H 12*11 Remove any column from matrix H. 12*11 The first column will be H 12*11 While removing the first column, the rows of the matrix after removing the column are divided into two groups according to the sign of the elements in the removed column:

[0382]

[0383]

[0384] So, The Hamming distance between any two rows of elements in the array is 6. The Hamming distance between any two rows of elements is also 6. any row of elements and The Hamming distance between any row of elements in the given text is 5. Select any q rows from the given data. Arbitrarily select 8-q rows from the matrix (taking q = 2 as an example) to form matrix C. 8×10 .

[0385]

[0386] Then matrix H (8×7) Repeat this process n-1 times to obtain n-1 matrices H. (8×7)Then we can work on these n-1 H... (8×7) After rearranging the rows (or skipping the rearrangement process), then matrix C... 8×10 With H (8×7) After n-1 repetitions, the matrix is ​​arranged row-by-row to obtain matrix C. 8×(7n+3) .

[0387] C 8×(7n+3) =[H (8×7) ,

[0388] in, Indicates H (8×7) The matrix obtained by rearranging the rows. Then, C 8×(7n+3) The Hamming distance between any two rows of elements in C is 4(n-1)+5=4n+1 or 4(n-1)+6=4n+2. Therefore, C 8×(7n+3) The minimum Hamming distance between elements in each row of C is 4n+1. Then, C... 8×(7n+3) The elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length L = 7n + 3. It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0389] For example, when L=24, the codebook with a code length of 24 is shown in Table 23 below. The minimum Hamming distance between these 8 codewords in Table 23 is 13. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 23 below.

[0390] Table 23: Examples of codebooks with a code length (L) of 24

[0391]

[0392] For example, when L = 38, the codebook with a code length of 38 is shown in Table 24 below. The minimum Hamming distance between these 8 codewords in Table 24 is 21. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 24 below.

[0393] Table 24: Examples of codebooks with a code length (L) of 38

[0394]

[0395]

[0396] Furthermore, for the case of L = 7n + 3, the codebook can also be generated using the following method. (The matrix H is then used for this purpose.) (8×7) Repeated n times, n matrices H are obtained. (8×7) Then we can work on these n H's (8×7)After rearranging the rows (or skipping the rearrangement process), arrange them side-by-side according to the rows, starting from H. (8×7) Choose any 3 columns from the given set, excluding the following 7 combinations: Avoid combinations of column numbers such as {1,2,3; 1,4,5; 1,6,7; 2,4,6; 2,5,7; 3,4,7; 3,5,6}; and construct matrix H. (8×3) Then, matrix H... (8×3) With H (8×7) The matrix obtained after n repetitions is arranged row-by-row to form matrix C. 8×(7n+3) .

[0397]

[0398] in, Indicates H (8×7) The matrix is ​​obtained by rearranging the rows. Finally, C... 8×(7n+3) The elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length L = 7n + 3. Specific codebooks are not listed here. It is understood that this application does not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0399] If m = 4 and L = 7n + 4, choose a 12*12 normalized Hadamard matrix H. 12 As mentioned earlier, this will not be repeated here. Then remove H. 12 The elements in the first column can be used to obtain a 12x11 matrix H. 12*11 Then from matrix H 12*11 Choose any 8 rows, for example, rows 5 to 12, to obtain an 8*11 matrix H. 8*11 Then matrix H 8*11 The Hamming distance between any two rows of elements is 6.

[0400]

[0401] Then matrix H (8×7) Repeat this process n-1 times to obtain n-1 matrices H. (8×7) Then we can work on these n-1 H... (8×7) After rearranging the rows (or skipping the rearrangement process), then matrix H... 8×11 With H (8×7) After n-1 repetitions, the matrix is ​​arranged row-by-row to obtain matrix C. 8×(7n+4) .

[0402]

[0403] in, Indicates H (8×7) The matrix obtained by rearranging the rows. Then, C 8×(7n+4)The Hamming distance between any two rows of elements in C is 4(n-1) + 6 = 4n + 2. Therefore, C 8×(7n+4) The minimum Hamming distance between elements in each row of C is 4n+2. Then, C... 8×(7n+4) The elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length L = 7n + 4. It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0404] For example, when L = 32, the codebook with a code length of 32 is shown in Table 25 below. The minimum Hamming distance between these 8 codewords in Table 25 is 18. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 25 below.

[0405] Table 25: Examples of codebooks with a code length (L) of 32

[0406]

[0407] Furthermore, for the case of L = 7n + 4, the codebook can also be generated using the following method. (The matrix H is then used for this purpose.) (8×7) Repeated n times, n matrices H are obtained. (8×7) Then we can work on these n H's (8×7) After rearranging the rows (or skipping the rearrangement process), arrange them side-by-side according to the rows, starting from H. (8×7) Arbitrarily select 4 columns, which can be one of the following 7 combinations: The possible column combinations are {1,2,4,7; 1,2,5,6; 1,3,4,6; 1,3,5,7; 2,3,4,5; 2,3,6,7; 4,5,6,7}; forming matrix H. (8×4) Then, matrix H... (8×4) With H (8×7) The matrix obtained after n repetitions is arranged row-by-row to form matrix C. 8×(7n+4) .

[0408]

[0409] in, Indicates H (8×7) The matrix is ​​obtained by rearranging the rows. Finally, C... 8×(7n+4) The elements 1 and -1 in the matrix are mapped to 0 and 1 respectively, resulting in a codebook with a code length L = 7n + 4. It is understood that the embodiments of this application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

[0410] For example, when L = 32, H (8×7) Copy 4 times, and also select H. (8×7)Columns 1, 2, 4, and 7 of the code can form a codebook with a code length of 32, as shown in Table 26 below. The minimum Hamming distance between these 8 codewords in Table 26 is 18. Optionally, the first codeword set mentioned above may include all or part of the codewords in Table 26 below.

[0411] Table 26: Examples of codebooks with a code length (L) of 32 (4)

[0412]

[0413]

[0414] It is understood that Tables 16 to 26 above are just examples. The mapping relationship between different values ​​of the first PHR information and codewords in Tables 16 to 26 is not fixed. It is only necessary to ensure that different values ​​of the first PHR information are mapped to different codewords.

[0415] It is understandable that different codebooks can be constructed using different Hadamard matrices in the various codebook generation methods mentioned above, but their minimum Hamming distance remains unchanged. It is also understandable that by rearranging columns, rows, or inverting all elements in a column (inverting elements means changing element-1 to element-1 and element-1 to element-1) on any of the codebooks in Tables 16 to 26, another codebook can be obtained, which has the same Hamming distance distribution as the original codebook.

[0416] To more intuitively understand the minimum Hamming distance between codewords in the codebooks (i.e., the first codeword set) of different code lengths designed in the embodiments of this application, the following illustrations are provided. See also Figure 10 , Figure 10 This is a schematic diagram illustrating the minimum Hamming distance under different code lengths provided in the embodiments of this application. For example... Figure 10 As shown, the horizontal axis represents code length, and the vertical axis represents the minimum Hamming distance. This is understandable given the need for precise illustration. Figure 10 The minimum Hamming distance for a portion of the code length is shown, meaning the code length range represented by the horizontal axis is 20 to 40 bits.

[0417] Comparative analysis of the above Figure 9 and Figure 10 It can be seen that for even values ​​of code length between 20 and 40, except for 30, the minimum Hamming distance between codewords designed for other code lengths can reach the upper limit of the theoretical minimum Hamming distance, thereby ensuring the minimum bit error rate and improving coding performance.

[0418] Therefore, the embodiments of this application improve encoding performance by increasing the Hamming distance between codewords.

[0419] The foregoing details the method provided in this application. To facilitate the implementation of the above-described solutions in the embodiments of this application, corresponding apparatus or devices are also provided in the embodiments of this application.

[0420] This application divides the communication device into functional modules according to the above-described method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware or as software functional modules. It should be noted that the module division in this application is illustrative and represents only one logical functional division; other division methods may be used in actual implementation. The following will combine... Figures 11 to 13 The communication device of the present application embodiment is described in detail.

[0421] See Figure 11 , Figure 11 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Figure 11 As shown, the communication device includes a transceiver unit 10 and a processing unit 20.

[0422] In some embodiments of this application, the communication device may be the first communication device shown above or a chip therein. That is... Figure 11 The communication device shown can be used to perform the steps or functions performed by the first communication device in the above method embodiments.

[0423] Processing unit 20 is used to generate a PPDU, which includes a PHR field and a PHY payload field. The PHR field includes first PHR information, which is used to indicate the data rate of the PHY payload field. Transceiver unit 10 is used to transmit a signal, which is generated based on the PPDU. The signal includes a signal generated by encoding the first PHR information. The codeword includes a codeword in a first codeword set that corresponds to the first PHR information.

[0424] For details regarding PPDU, first PHR information, first codeword set, etc., please refer to the method implementation examples shown above, which will not be elaborated here.

[0425] It is understood that the specific descriptions of the transceiver unit and processing unit shown in the embodiments of this application are merely examples. For the specific functions or execution steps of the transceiver unit and processing unit, please refer to the above method embodiments, which will not be detailed here. For example, the transceiver unit 10 can be used to perform… Figure 5 The steps S102 or shown are as follows: Figure 8 The processing unit 20 can be used to execute step S202 shown. Figure 5 The steps S101 or shown Figure 8 The step S201 is shown.

[0426] Reuse Figure 11 In other embodiments of this application, the communication device may be the second communication device shown above or a chip therein. Figure 11 The communication device shown can be used to perform the steps or functions performed by the second communication device in the above method embodiments.

[0427] The transceiver unit 10 is used to receive a signal generated based on a PPDU. The PPDU includes a PHR field and a PHY payload field. The PHR field includes first PHR information. The signal includes a signal generated by encoding codewords based on the first PHR information. The codewords include codewords in a first codeword set that correspond to the first PHR information. The processing unit 20 is used to decode the signal to obtain the first PHR information. The first PHR information is used to indicate the data rate of the PHY payload field.

[0428] For details regarding PPDU, first PHR information, first codeword set, etc., please refer to the method implementation examples shown above, which will not be elaborated here.

[0429] It is understood that the specific descriptions of the transceiver unit and processing unit shown in the embodiments of this application are merely examples. For the specific functions or execution steps of the transceiver unit and processing unit, please refer to the above method embodiments, which will not be detailed here. For example, the transceiver unit 10 can be used to receive signals; the processing unit 20 can be used to execute... Figure 5 The steps S103 or shown are as follows: Figure 8 Step S203 is shown.

[0430] The communication device according to embodiments of this application has been described above. The following describes possible product forms of the communication device. It should be understood that any device possessing the above-described features... Figure 11 Any form of the communication device described herein falls within the protection scope of the embodiments of this application. It should also be understood that the following description is merely illustrative and does not limit the form of the communication device in the embodiments of this application to this specific example.

[0431] In one possible implementation, Figure 11In the communication device shown, the processing unit 20 can be one or more processors, and the transceiver unit 10 can be a transceiver, or the transceiver unit 10 can also be a transmitting unit and a receiving unit. The transmitting unit can be a transmitter, and the receiving unit can be a receiver. The transmitting unit and the receiving unit are integrated into one device, such as a transceiver. In the embodiments of this application, the processor and the transceiver can be coupled, etc. The connection method between the processor and the transceiver is not limited in the embodiments of this application. In the process of executing the above method, the process of sending information (such as sending a signal) in the above method can be understood as the process of the processor outputting the above information. When outputting the above information, the processor outputs the above information to the transceiver so that the transceiver can transmit it. After the above information is output by the processor, it may need to undergo other processing before reaching the transceiver. Similarly, the process of receiving information (such as receiving a signal) in the above method can be understood as the process of the processor receiving the input above information. When the processor receives the input information, the transceiver receives the above information and inputs it into the processor. Furthermore, after the transceiver receives the above information, the above information may need to undergo other processing before being input into the processor.

[0432] See Figure 12 , Figure 12 This is another structural schematic diagram of the communication device provided in the embodiments of this application. The communication device can be a first communication device or a second communication device, or a chip therein. Figure 12 Only the main components of the communication device are shown. In addition to the processor 1001 and transceiver 1002, the communication device may further include a memory 1003 and input / output devices (not shown).

[0433] The processor 1001 is primarily used to process communication protocols and data, control the entire communication device, execute software programs, and process the data from those programs. The memory 1003 is primarily used to store software programs and data. The transceiver 1002 may include control circuitry and an antenna. For example, the control circuitry is primarily used for converting baseband signals to radio frequency signals and processing radio frequency signals. The antenna is primarily used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are primarily used to receive user input data and output data to the user.

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

[0435] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.

[0436] The processor 1001, transceiver 1002, and memory 1003 can be connected via a communication bus.

[0437] In one design, the communication device can be used to perform the functions of the first communication device in the aforementioned embodiment: the processor 1001 can be used to execute... Figure 5 Step S101, and / or other processes for performing the techniques described herein; transceiver 1002 can be used to perform Figure 5 Step S102 in the document, and / or other processes used in the techniques described herein.

[0438] In another design, the communication device can be used to perform the functions of the second communication device in the aforementioned embodiment one: the processor 1001 can be used to execute... Figure 5 Step S103, and / or other processes for performing the techniques described herein; transceiver 1002 can be used to receive Figure 5 The signal sent in step S102, and / or other processes used in the techniques described herein.

[0439] In one design, the communication device can be used to perform the functions of the first communication device in the aforementioned embodiment two: the processor 1001 can be used to execute... Figure 8 Step S201, and / or other processes used to perform the techniques described herein; transceiver 1002 can be used to perform Figure 8 Step S202 in the document, and / or other processes used in the techniques described herein.

[0440] In another design, the communication device can be used to perform the functions of the second communication device in the aforementioned embodiment two: the processor 1001 can be used to execute... Figure 8Step S203, and / or other processes for performing the techniques described herein; transceiver 1002 can be used to receive Figure 8 The signal sent in step S202, and / or other processes used in the techniques described herein.

[0441] In any of the above designs, the processor 1001 may include a transceiver for implementing receiving and transmitting functions. For example, the transceiver may be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing receiving and transmitting functions may be separate or integrated. The aforementioned transceiver circuit, interface, or interface circuit may be used for reading and writing code / data, or it may be used for transmitting or relaying signals.

[0442] In any of the above designs, the processor 1001 may store instructions, which may be computer programs. These computer programs, running on the processor 1001, cause the communication device to perform the methods described in the above method embodiments. The computer program may be embedded in the processor 1001; in this case, the processor 1001 may be implemented in hardware.

[0443] In one implementation, the communication device may include a circuit that can perform the functions of transmitting, receiving, or communicating in the aforementioned method embodiments. The processor and transceiver described in this application can be implemented on integrated circuits (ICs), analog ICs, radio frequency integrated circuits (RFICs), mixed-signal ICs, application-specific integrated circuits (ASICs), printed circuit boards (PCBs), electronic devices, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal-oxide semiconductors (CMOS), n-metal-oxide-semiconductor (NMOS), positive-channel metal-oxide semiconductors (PMOS), bipolar junction transistors (BJTs), bipolar CMOS (BiCMOS), silicon-germanium (SiGe), gallium arsenide (GaAs), etc.

[0444] The scope of the communication device described in this application is not limited thereto, and the structure of the communication device may vary. Figure 12 The communication device may be a standalone device or part of a larger device. For example, the communication device may be:

[0445] (1) Independent integrated circuit IC, or chip, or chip system or subsystem;

[0446] (2) A collection of one or more ICs, optionally including storage components for storing data and computer programs;

[0447] (3) ASIC, such as modem;

[0448] (4) Modules that can be embedded in other devices;

[0449] (5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.

[0450] (6) Others, etc.

[0451] In another possible implementation Figure 11 In the communication device shown, the processing unit 20 can be one or more logic circuits, and the transceiver unit 10 can be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver unit 10 can also be a transmitting unit and a receiving unit. The transmitting unit can be an output interface, and the receiving unit can be an input interface. The transmitting unit and the receiving unit are integrated into one unit, such as an input / output interface. See also Figure 13 , Figure 13 This is another structural schematic diagram of the communication device provided in the embodiments of this application. For example... Figure 13 As shown, Figure 13 The communication device shown includes logic circuitry 901 and interface 902. That is, the processing unit 20 can be implemented using logic circuitry 901, and the transceiver unit 10 can be implemented using interface 902. The logic circuitry 901 can be a chip, processing circuit, integrated circuit, or system-on-chip (SoC) chip, etc., and the interface 902 can be a communication interface, input / output interface, pins, etc. For example, Figure 13The above-described communication device is used as an example of a chip, which includes logic circuitry 901 and interface 902. It is understood that the chip shown in this application embodiment may include narrowband chips or ultra-wideband chips, etc., and this application embodiment does not limit this. Narrowband chips and ultra-wideband chips may be integrated on a single device or chip, or they may be implemented independently. This application embodiment does not limit the implementation method of narrowband chips and ultra-wideband chips in the device. The step of transmitting signals as shown above can be performed by an ultra-wideband chip; whether the remaining steps are performed by an ultra-wideband chip is not limited in this application embodiment.

[0452] In this embodiment, the logic circuit and the interface can also be coupled to each other. The specific connection method between the logic circuit and the interface is not limited in this embodiment.

[0453] For example, when a communication device is used to perform the method, function, or step performed by the first communication device in the aforementioned method embodiment, logic circuit 901 is used to generate a PPDU, the PPDU including a PHR field and a PHY payload field, the PHR field including first PHR information, the first PHR information being used to indicate the data rate of the PHY payload field; interface 902 is used to output a signal, the signal being generated based on the PPDU, the signal including a signal generated by encoding a codeword according to the first PHR information, the codeword including a codeword in a first codeword set corresponding to the first PHR information.

[0454] For example, when the communication device is used to perform the method, function, or step performed by the second communication device in the aforementioned method embodiment, interface 902 is used to input a signal, which is generated based on a PPDU. The PPDU includes a PHR field and a PHY payload field. The PHR field includes first PHR information. The signal includes a signal generated by encoding codewords based on the first PHR information. The codewords include codewords in a first codeword set that correspond to the first PHR information. Logic circuit 901 is used to decode the signal to obtain the first PHR information, which is used to indicate the data rate of the PHY payload field.

[0455] It is understood that specific explanations regarding PPDU, first PHR information, first codeword set, etc. can be found in the method embodiment 1 shown above, and will not be detailed here.

[0456] It is understood that the communication device shown in the embodiments of this application can implement the method provided in the embodiments of this application in hardware form or in software form, etc., and the embodiments of this application do not limit it in this way.

[0457] for Figure 13For specific implementations of the various embodiments shown, please refer to the above embodiments, which will not be described in detail here.

[0458] This application also provides a wireless communication system, which includes a first communication device and a second communication device. The first communication device and the second communication device can be used to perform the methods in any of the foregoing embodiments.

[0459] In addition, this application also provides a computer program for implementing the operations and / or processes performed by the first communication device in the method provided in this application.

[0460] This application also provides a computer program for implementing the operations and / or processes performed by the second communication device in the method provided in this application.

[0461] This application also provides a computer-readable storage medium storing computer code that, when executed on a computer, causes the computer to perform the operations and / or processes performed by the first communication device in the method provided in this application.

[0462] This application also provides a computer-readable storage medium storing computer code that, when executed on a computer, causes the computer to perform the operations and / or processes performed by the second communication device in the method provided in this application.

[0463] This application also provides a computer program product, which includes computer code or a computer program that, when run on a computer, causes the operations and / or processes performed by the first communication device in the method provided in this application to be executed.

[0464] This application also provides a computer program product, which includes computer code or a computer program that, when run on a computer, causes the operations and / or processes performed by the second communication device in the method provided in this application to be executed.

[0465] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interfaces, devices, or units, or it may be an electrical, mechanical, or other form of connection.

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

[0467] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0468] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned readable storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0469] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for signal transmission based on ultra-wideband, characterized in that, Comprise: The PHR1 is encoded, and the code word of the PHR1 after encoding is obtained, the code word of the PHR1 after encoding maps the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding; The code word of the PHR1 after encoding maps the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding, including at least one of the following mapping relationships: The code word of the PHR1 after encoding is 11111111111111111111, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 1; The code word of the PHR1 after encoding is 00000100110011001100, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 3; The code word of the PHR1 after encoding is 00000001100110011001, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 4; The code word of the PHR1 after encoding is 00000111000011110000, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 5; The code word of the PHR1 after encoding is 00000010010110100101, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 6; The code word of the PHR1 after encoding is 00000100001111000011, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 7; The code word of the PHR1 after encoding is 00000001011010010110, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 8; The code word of the PHR1 after encoding is 00000111111100000000, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 9; The code word of the PHR1 after encoding is 00000010101001010101, mapping the combination of the data rate of the PHY payload field and whether the PHY payload field adopts LDPC encoding 10. The PHR1 encoded code word is 00000100110000110011, mapping, the combination 11 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; Transmit the PHR1 encoded code word.

2. The method of claim 1, wherein, The length of the PHR1 encoded code word is 20 bits.

3. The method according to claim 1 or 2, characterized in that, The PHR1 is in a PHR field of a PPDU, and the PHR field further includes a PHR2 used for indicating the length of the PHY payload field.

4. The method of claim 3, wherein, The PPDU further includes the PHY payload field.

5. The method according to any one of claims 1 to 4, characterized in that, The data rate of the PHY payload field is any one of the following:

1. 95 Mbps (Megabits per second), 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, or 124.8 Mbps.

6. An ultra-wideband signal transmission device, comprising: An encoding unit, configured to encode a PHR1 to obtain a PHR1 encoded code word, wherein the PHR1 encoded code word maps a combination of the data rate of a PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word maps the combination of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC, including at least one of the following mapping relationships: The PHR1 encoded code word is 11111111111111111111, mapping, the combination 1 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word is 00000100110011001100, mapping, the combination 3 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word is 00000001100110011001, mapping, the combination 4 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word is 00000111000011110000, mapping, the combination 5 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word is 00000010010110100101, mapping, the combination 6 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded code word is 00000100001111000011, mapping, the combination 7 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The PHR1 encoded codeword is 00000001011010010110, mapping, combination 8 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The PHR1 encoded codeword is 00000111111100000000, mapping, combination 9 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The PHR1 encoded codeword is 00000010101001010101, mapping, combination 10 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The PHR1 encoded codeword is 00000100110000110011, mapping, combination 11 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The PHR1 encoded codeword is 00000100110000110011, mapping, combination 11 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC.

7. The apparatus of claim 6, wherein, The PHR1 encoded codeword has a length of 20 bits.

8. The apparatus of claim 6 or 7, wherein, The PHR1 is in a PHR field of a PPDU, the PHR field further comprising a PHR2 indicating a length of the PHY payload field.

9. The apparatus of claim 8, wherein, The PPDU further comprises the PHY payload field.

10. The device according to any of claims 6-9, characterized in that The data rate of the PHY payload field is any one of: 1.95 Mbps (Megabits per second), 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, or 124.8 Mbps.

11. A computer readable storage medium characterized by: A computer program product for storing a computer program comprising instructions for performing the method of any one of claims 1-5.

12. A computer program, characterized in that, The computer program product comprises instructions for performing the method of any one of claims 1-5.

Images