Signal transmission method and device based on ultra wide band

Abstract

The invention relates to a signal transmission method and device based on an ultra wide band, and the method comprises the steps: transmitting a signal, the signal comprises a signal generated according to a code word obtained 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. According to the invention, the coding performance of the first PHR information can be improved. The application is applied to a WPAN (Wireless Personal Area Network) system, a sensing system and the like based on UWB (Ultra Wideband), and comprises 802.15 series protocols, such as 802.15. 4a, 802.15. 4 z or 802.15. 4 ab protocols and the like. The method can be applied to a wireless local area network (WLAN) system of an 802.11 ax next generation Wi-Fi protocol, such as 802.11 be, Wi-Fi 7 or EHT, and a WLAN system of an 802.11 series protocol, such as an 802.11 be next generation, Wi-Fi 8 and the like.

Description

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

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

[0003] With the entry of ultra-wide band (UWB) technology into the civilian field, UWB wireless communication has become one of the physical layer technologies for short-distance, high-speed wireless networks. UWB technology is a wireless carrier communication technology. For example, it can transmit data using nanosecond-level non-sinusoidal narrow pulses, so the occupied spectrum range is very wide. Since its pulses are relatively narrow and the radiation spectral density is low, UWB has advantages such as strong multipath resolution ability, low power consumption, and strong confidentiality.

[0004] The Institute of Electrical and Electronics Engineers (IEEE) has incorporated UWB technology into its IEEE 802 series of wireless standards. The high-speed wireless personal area network (WPAN) standard IEEE 802.15.4a based on UWB technology and its evolved version IEEE 802.15.4z have been released, and 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 at least includes 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 to be further improved. Summary of the Invention

[0006] Embodiments of this application provide a signal transmission method and apparatus based on ultra-wide band, which can improve the coding performance of the PHR field and further reduce the transmission duration of the PHR field.

[0007] The present application will be introduced from different aspects below. It should be understood that the implementation manners and beneficial effects of the different aspects below can be referred to each other.

[0008] In a first aspect, the present application provides a signal transmission method based on ultra-wideband. The method includes: a communication device generates a physical layer protocol data unit (PPDU), where the PPDU includes a physical layer header (PHR) field and a physical layer (PHY) payload (PHY payload) field, and the PHR field includes first PHR information for indicating the data rate of the PHY payload field; the communication device transmits a signal generated based on the PPDU, where the signal includes a signal generated from a codeword encoded according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in a first codeword set. The specific content of the codeword can be seen in the method embodiments below. Due to space limitations here, they will not be listed one by one.

[0009] By designing a new codeword set (i.e., a codebook) in the present application and using the codewords in this codeword set to perform mapping encoding on the first PHR information, compared with the method of using convolutional coding, the encoding performance of the PHR field (mainly the first PHR information) can be improved.

[0010] In a second aspect, the present application provides a signal transmission method based on ultra-wideband. The method includes: a communication device receives a signal generated based on a PPDU, where the PPDU includes a PHR field and a PHY payload field, the PHR field includes first PHR information, and the signal includes a signal generated from a codeword encoded according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in a first codeword set; and demodulates and decodes the signal to obtain the first PHR information, where the first PHR information is used to indicate the data rate of the PHY payload field. The specific content of the codeword can be seen in the method embodiments below. Due to space limitations here, they will not be listed one by one.

[0011] In a possible implementation manner 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 one of the following: 1.95 Mbps (megabits per second), 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, or 124.8 Mbps.

[0012] In a possible implementation of any of the above aspects, the first PHR information further includes: information for indicating whether the PHY payload field is encoded using a first encoding method. Exemplarily, 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 is any one of the following: low density parity code (LDPC), convolutional code, polar code, turbo code, etc., and the present application does not make any restrictions. For the convenience of description hereinafter, an example will be given with the first encoding method being LDPC.

[0014] In the present application, the codewords in the first codeword set are used to map and encode the first PHR information (4 bits). Compared with the convolutional coding method, it can not only meet the requirements of demodulation performance, but also reduce the transmission duration of the first PHR information, achieving a good compromise between the demodulation performance and the transmission duration of the first PHR information.

[0015] In a possible implementation of any of the above aspects, the number M of codewords in the above first codeword set is less than or equal to 2 K , where K is the bit length of the first PHR information. Exemplarily, when K is equal to 3, the number M of codewords in the first codeword set is less than or equal to 8; when K is equal to 4, the number M of codewords in the first codeword set is less than or equal to 16; when K is equal to 2, the number M of codewords 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 above first codeword set is greater than or equal to the upper limit value of the theoretical minimum Hamming distance of this first codeword set.

[0017] Optionally, if the first codeword set includes M codewords, the length of each codeword is L. Exemplarily, the Hamming distance d between any two of these M codewords satisfies:

[0018] Or,

[0019] In the present application, by increasing the Hamming distance between codewords, the coding performance is improved.

[0020] In a possible implementation of any of the above aspects, when the first PHR information is 4 bits, the length L 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, refer to the description of Embodiment 1 hereinafter, and details will not be elaborated here one by one.

[0021] In a 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, refer to the description of Embodiment 2 below, and details are not elaborated here one by one.

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

[0023] In a third aspect, an embodiment of the present application provides a communication device, and this communication device is used to execute the method in the first aspect or any possible implementation of the first aspect. This communication device includes a unit having the function of executing the method in the first aspect or any possible implementation of the first aspect.

[0024] In a fourth aspect, an embodiment of the present application provides a communication device, and this communication device is used to execute the method in the second aspect or any possible implementation of the second aspect. This communication device includes a unit having the function of executing the method in the second aspect or any possible implementation of the second aspect.

[0025] In the third aspect or the fourth aspect, the above communication device may include a transceiver unit and a processing unit. For the specific description of the transceiver unit and the processing unit, reference may also be made to the device embodiments shown below. The beneficial effects of the above third aspect to the fourth aspect may refer to the relevant descriptions of the foregoing first aspect and second aspect, and details are not repeated here.

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

[0027] In combination with the fifth aspect, in a possible implementation, the memory is located outside the above communication device.

[0028] In combination with the fifth aspect, in a possible implementation, the memory is located inside the above communication device.

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

[0030] In combination with the fifth aspect, in a possible implementation manner, the communication device further includes a transceiver, and the transceiver is used to send signals.

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

[0032] In combination with the sixth aspect, in a possible implementation manner, the memory is located outside the above-mentioned communication device.

[0033] In combination with the sixth aspect, in a possible implementation manner, the memory is located inside the above-mentioned communication device.

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

[0035] In combination with the sixth aspect, in a possible implementation manner, the communication device further includes a transceiver, and the transceiver is used to receive signals.

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

[0037] In an eighth aspect, this application provides a communication device, which includes a logic circuit and an interface, and the logic circuit is coupled to the interface. The interface is used to input a signal, the signal 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 according to a codeword obtained by encoding according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in a first codeword set; the logic circuit is used to decode the signal to obtain the first PHR information, and the first PHR information is used to indicate the data rate of the PHY payload field.

[0038] In the seventh or eighth aspect, the specific descriptions of the PPDU, the first PHR information, the first codeword set, etc. can refer to the descriptions in the foregoing first or second aspect, and will not be elaborated here one by one.

[0039] In a ninth aspect, the present application provides a computer-readable storage medium for storing a computer program, which when run on a computer, causes the method shown in the above-mentioned first aspect or any possible implementation manner of the first aspect to be executed.

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

[0041] In an eleventh aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code, which when run on a computer, causes the method shown in the above-mentioned first aspect or any possible implementation manner of the first aspect to be executed.

[0042] In a twelfth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code, which when run on a computer, causes the method shown in the above-mentioned second aspect or any possible implementation manner of the second aspect to be executed.

[0043] In a thirteenth aspect, the present application provides a computer program, which when run on a computer, causes the method shown in the above-mentioned first aspect or any possible implementation manner of the first aspect to be executed.

[0044] In a fourteenth aspect, the present application provides a computer program, which when run on a computer, causes the method shown in the above-mentioned second aspect or any possible implementation manner of the second aspect to be executed.

[0045] In a fifteenth aspect, an embodiment of the present application provides a wireless communication system, which includes a first communication device and / or a second communication device. The first communication device is used to execute the method shown in the above-mentioned first aspect or any possible implementation manner of the first aspect, and the second communication device is used to execute the method shown in the above-mentioned second aspect or any possible implementation manner of the second aspect.

[0046] The technical effects achieved by the above-mentioned aspects can be referred to each other or to the beneficial effects in the method embodiments shown below, and will not be elaborated here. Description of the Drawings

[0047] Figure 1 It is a schematic structural diagram of a wireless communication system provided by an embodiment of the present application;

[0048] Figure 2 It is another schematic structural diagram of a wireless communication system provided by an embodiment of the present application;

[0049] Figure 3 It is a schematic diagram of a UWB PPDU format provided by an embodiment of the present application;

[0050] Figure 4 It is another schematic diagram of a UWB PPDU format provided by an embodiment of the present application;

[0051] Figure 5 It is a schematic flowchart of a signal transmission method based on ultra-wideband provided by an embodiment of the present application;

[0052] Figure 6 It is a schematic diagram of the upper limit value of the theoretical minimum Hamming distance under different code lengths provided by an embodiment of the present application;

[0053] Figure 7 It is a schematic diagram of the packet error rate simulation result of PHR1 when different coding methods are adopted provided by an embodiment of the present application;

[0054] Figure 8 It is another schematic flowchart of a signal transmission method based on ultra-wideband provided by an embodiment of the present application;

[0055] Figure 9 It is another schematic diagram of the upper limit value of the theoretical minimum Hamming distance under different code lengths provided by an embodiment of the present application;

[0056] Figure 10 It is a schematic diagram of the minimum Hamming distance under different code lengths provided by an embodiment of the present application;

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

[0058] Figure 12 It is another schematic structural diagram of a communication device provided by an embodiment of the present application;

[0059] Figure 13 It is still another schematic structural diagram of a communication device provided by an embodiment of the present application. Detailed implementation manners

[0060] Next, the technical solutions in the embodiments of the present application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present application.

[0061] In the description of this application, terms such as "first" and "second" are only used to distinguish different objects, and do not limit the quantity and execution order. Moreover, terms such as "first" and "second" do not necessarily mean different. In addition, 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, etc. that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units not listed, etc., or optionally also includes other steps or units inherent to these processes, methods, products, or devices, etc.

[0062] In the description of this application, unless otherwise specified, " / " means "or". For example, A / B can mean A or B. The "and / or" herein is merely a description of the association relationship between associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, "one (or more) of the following" or similar expressions refer to any combination of these items, including any combination of single item (or multiple items). For example, at least one (or more) of a, b, or c can mean: a, b, c; a and b; a and c; b and c; or a and b and c. Wherein a, b, and c can be single or multiple.

[0063] In this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplary", "for example", or "such as" in this application should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary", "for example", or "such as" is intended to present relevant concepts in a specific manner.

[0064] In this application, elements represented in the singular are intended to mean "one or more", and do not mean "one and only one", unless otherwise specified.

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

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

[0067] Ultra-wideband (UWB) technology is a new type of wireless communication technology. It transmits data using nanosecond-level non-sinusoidal narrow pulses. By modulating impulse pulses with very steep rise and fall times, the transmitted spectrum range is very wide, giving the signal a bandwidth on the order of gigahertz (GHz). The bandwidth used by UWB is usually above 1 GHz. Since the UWB system does not need to generate a sinusoidal carrier signal and can directly transmit impulse sequences, the UWB system has a very wide spectrum and low average power. The UWB wireless communication system has advantages such as strong multipath resolution ability, low power consumption, and strong confidentiality, which is conducive to coexisting with other systems, thereby improving spectrum utilization and system capacity. Additionally, in short-distance communication applications, the transmit power of the UWB transmitter can usually be made lower than 1 mW (milliwatt). Theoretically, the interference generated by the UWB signal is only equivalent to white noise. This helps the good coexistence between ultra-wideband and existing narrowband communications. Therefore, the UWB system 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 one device or chip. The embodiments of this application do not limit the implementation manner of the UWB module and the narrowband communication module in the communication device. The communication device in this application includes a UWB module and optionally also includes a narrowband communication module. It can be understood that the above description of the communication device applies to the first communication device and the second communication device in this application.

[0069] Although the embodiments of this application mainly take WPAN as an example, such as taking a network applied to the IEEE 802.15 series of standards as an example for illustration. It is easy for those skilled in the art to understand that all aspects involved in this application can be extended to other networks using various standards or protocols. For example, wireless local area networks (WLANs), Bluetooth, high performance radio LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard, mainly used in Europe), and wide area networks (WANs) or other currently known or future-developed networks. Therefore, regardless of the coverage range and wireless access protocol used, all aspects provided in this application can be applied to any suitable wireless network.

[0070] Optionally, the communication device in the embodiments of the present application may be a device supporting multiple WPAN standards such as 802.15.4a and 802.15.4z, as well as IEEE 802.15.4ab or subsequent versions under discussion.

[0071] Exemplarily, the method provided in the present application may be implemented by a communication device in a wireless communication system, and the communication device may be a device involved in a UWB system. For example, the communication device may include, but is not limited to, a communication server, a router, a switch, a bridge, a computer, a mobile phone, etc. that support UWB technology. For another example, the communication device may include a user equipment (UE), and the user equipment may include various handheld devices, vehicle-mounted devices (such as cars or components installed on cars), wearable devices, Internet of Things (IoT) devices, computing devices, or other processing devices connected to a wireless modem, etc., which are not listed one by one here. For another example, the communication device may include a central control point, such as a personal area network (PAN) or a PAN coordinator, etc. The PAN coordinator or PAN may be a mobile phone, a vehicle-mounted device, an anchor, a tag, or a smart home, etc. For another example, the communication device may include a chip, and the chip may be disposed in a communication server, a router, a switch, or a terminal device, etc., which are not listed one by one here.

[0072] In the embodiments of the present application, the above-mentioned communication device may include a hardware layer, an operating system layer running on 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 a memory (also referred to as a main memory). The operating system may be any one or more computer operating systems that implement service processing through processes. For example, Linux operating system, Unix operating system, Android operating system, iOS operating system, or Windows operating system, etc. The application layer includes applications such as a browser, an address book, a word processing software, and an instant messaging software. Moreover, the embodiments of the present application do not particularly limit the specific structure of the execution subject of the method provided in the embodiments of the present application, as long as it can communicate according to the method provided in the embodiments of the present application by running a program recording the code of the method provided in the embodiments of the present application.

[0073] It can be understood that the above description of the communication device is applicable to the first communication device and the second communication device in the present application.

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

[0075] Since the spectral energy of UWB is very low and the interference to other wireless communication technologies is very small, according to regulations, UWB can send signals without channel monitoring, so it is very friendly to low-latency data transmission. At the same time, since the communication bandwidth of UWB is relatively large, relatively high-rate data can be transmitted on the ultra-wideband channel. On the other hand, in order to increase the transmission distance or expand the coverage range of the device, data can also be transmitted at a lower rate.

[0076] A possible UWB PPDU format is as Figure 3 shown, Figure 3 which is a schematic diagram of a UWB PPDU format provided by an embodiment of the present application. As Figure 3As shown, the UWB PPDU at least includes a physical layer header (PHR) field, and optionally may further include 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. Among them, the SYNC field is used for channel measurement and signal synchronization, and the SFD field is used to separate the SYNC field and the subsequent part. The PHR field is used to indicate some parameters necessary for demodulating the PHY payload field, such as the length of the PHY payload field, the data rate, the coding method, etc. The PHY payload field is used to carry data. It can be understood that Figure 3 the names of the respective fields are only examples. As the standard evolves, the names of the respective fields in the UWB PPDU may be different, but fields that can achieve the above functions all fall within the protection scope of this application.

[0077] Therefore, in order to correctly demodulate the data in the PHY payload field, it is necessary to ensure the correct demodulation of the PHR field. Generally, the lower the data rate, the more reliable the data transmitted, that is, the easier it is to be correctly demodulated. Therefore, the PHR field usually uses a relatively low data rate for transmission. The PHY payload field, on the other hand, can use a higher data rate for transmission to improve the transmission performance. In other words, to ensure the demodulation performance, the data rate of the PHR field is usually lower than that of the PHY payload field. Currently, in order to ensure that the PHR field can be correctly demodulated and its reliability is higher than that of the PHY payload field, the PHR field needs to use a lower data rate for transmission, which will result in a longer transmission time (or the time occupying the air interface), increase the delay, and interfere with other wireless devices or other wireless communication technologies. In addition, if the data rate of the PHR field is too high, the PHR will become the performance bottleneck of the entire PPDU demodulation.

[0078] In a possible implementation, in order to reduce the transmission time of the PHR field, it is considered to divide the PHR field into two parts, one part is transmitted at a fixed relatively low data rate, and the other part is transmitted at a dynamic data rate. See Figure 4 , Figure 4 is another schematic diagram of the UWB PPDU format provided by the embodiments of this application. As Figure 4As shown, the PHR field can be divided into two parts, denoted as PHR1 and PHR2. Among them, PHR1 is also known as the rate header, with a total of 4 bits. Among these, 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 low density parity code (LDPC). Currently, the data rates supported by the PHY payload field include: 1.95 Mbps (megabits per second), 7.8 Mbps, 31.2 Mbps, 62.4 Mbps, and 124.8 Mbps. PHR2 is mainly used to indicate the length of the PHY payload field. Optionally, PHR2 can also include: bits for indicating whether the PPDU is used for sensing measurement, reserved bits, cyclic redundancy check (CRC) bits. PHR1 can be transmitted at a fixed and relatively low data rate, while PHR2 can be transmitted at a dynamic data rate, where the data rate of PHR2 can be jointly determined according to the data rate of the PHY payload field and the channel coding adopted by the PHY payload field.

[0079] In addition, PHR1 can be encoded using a convolutional code with a code rate of 0.5, such as a convolutional code with a polynomial of (133,171) 8 of the convolutional code. A possible encoding method for PHR1 is as follows: Add 6 zeros as tail bits after the 4 bits of PHR1, and then after encoding using a convolutional code with a code rate of 0.5, it becomes 20 bits; then, taking 2 bits as a symbol, there are a total of 10 symbols. According to different symbol transmission rates, there are the following several schemes: (1) Transmit PHR1 at a rate of 3.9 Mbps, which requires approximately 2.5 us (microseconds) in total; (2) Transmit PHR1 at a rate of 1.95 Mbps, which requires approximately 5 us in total; (3) Transmit PHR1 at a rate of 0.975 Mbps, which requires approximately 10 us in total. For scheme (1), due to the relatively high symbol rate of PHR1 (3.9 Mbps), when the data rate of the PHY payload field is 1.95 Mbps, the demodulation performance cannot be guaranteed, thus resulting in a performance bottleneck. For scheme (2), the symbol rate of PHR1 is 1.95 Mbps. Since the performance of LDPC coding is superior to that of convolutional coding, when the data rate of the PHY payload field is 1.95 Mbps and LDPC is used for encoding, the demodulation performance still cannot be guaranteed, and a performance bottleneck will occur. For scheme (3), the symbol rate of PHR1 is very low (0.975 Mbps), which increases the transmission duration of PHR1.

[0080] In view of this, an embodiment of the present application provides a signal transmission method and apparatus based on ultra-wideband. By designing a new codebook (such as the first codeword set) to perform mapping encoding on the first IPHR information, the encoding performance of the PHR field (mainly the first IPHR information) can be improved, and further, the transmission duration of the PHR field (mainly the first IPHR information) can be reduced. Exemplarily, the "codeword set" referred to in the present application means one or more codewords.

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

[0082] To facilitate a clear description of the technical solution of the present application, the present application is described through multiple embodiments. Specifically, refer to the following. In the present application, unless otherwise specified, the same or similar parts between various embodiments or implementation manners can be referred to each other. In each embodiment of the present application, as well as in each implementation manner / implementation method / realization method in each embodiment, if there is no special description and logical conflict, the terms and / or descriptions between different embodiments, as well as between each implementation manner / implementation method / realization method in each embodiment, are consistent and can be referred to each other. The technical features in different embodiments, as well as in each implementation manner / implementation method / realization method in each embodiment, can be combined to form new embodiments, implementation manners, implementation methods, or realization methods according to their internal logical relationships. The implementation manners of the present application described below do not constitute a limitation on the protection scope of the present application.

[0083] The communication device in the present 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. It can also support WLAN standards of the 802.11 family such as 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, 802.11a, and the next-generation 802.11be.

[0084] See Figure 5 , Figure 5 is a schematic flowchart of a signal transmission method based on ultra-wideband provided by an embodiment of the present application. As Figure 5 shown, the signal transmission method based on ultra-wideband 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 coding method.

[0086] S102, the first communication device sends a signal, which is generated based on the PPDU. The signal includes a signal generated according to a codeword encoded based on the first PHR information. The codeword includes a codeword corresponding to the first PHR information in a first codeword set.

[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 above PPDU may be a PPDU applied to the UWB WPAN standard, such as the PPDU in the 802.15.4ab protocol.

[0090] Optionally, the above 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 coding method. The second PHR information may be used to indicate the length of the PHY payload field, and optionally may also be used to indicate one or more of the following: whether the PPDU is used for sensing measurement, or a cyclic redundancy check (CRC) code.

[0091] Exemplarily, the first coding method may be any one of the following: LDPC, convolutional code, Polar code, Turbo code, etc., which are not limited in the embodiments of the present application. For ease of description below, the first coding method is taken as LDPC as an example for illustration; of course, with the development of the standard, LDPC below may also be replaced with any coding method specified in future standards (such as convolutional code, Polar code, Turbo code, etc.).

[0092] Exemplarily, the frame format of the PPDU may be as described above Figure 4 shown, where PHR1 above Figure 4 corresponds to the first PHR information in the embodiments of the present application, and above Figure 4The PHR2 therein corresponds to the second PHR information in the embodiments of the present application. Then, the first PHR information (PHR1) has a total of 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 LDPC. Exemplarily, the second PHR information (PHR2) has a total of 23 bits, where 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.

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

[0094] Therefore, the above signal can be generated based on the PPDU. Then, the signal at least includes a signal generated according to the codeword obtained by encoding the above first PHR information (PHR1), and the codeword may include the codeword mapped to the first PHR information in the first codeword set. The first codeword set includes at least M codewords, and the length of each codeword is L. Exemplarily, the Hamming distance d between any two of these M codewords satisfies the following formula (1-1) or the following formula (1-2).

[0095]

[0096] Among them, the symbol represents rounding down. The same symbol in the following text represents the same meaning and will not be repeated.

[0097] Optionally, the above first codeword set may 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 information (PHR1). M is less than or equal to 2 KThe codebook can be predefined, pre-negotiated, pre-configured, etc. The predefined in this application can be understood as defined, pre-defined, preset, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-fired, etc.

[0098] In this text, the "length of the codeword" can also be abbreviated as "code length", "codeword length", etc. The three can be used interchangeably and will not be elaborated below.

[0099] It can be understood that the Hamming distance is used in data transmission error control coding. It represents the number of different characters at corresponding positions of two (same-length) strings. Let d(x,y) represent the Hamming distance between two strings x and y. Perform an exclusive OR operation on these two strings and count the number of results that are 1. Then this counted number of 1s is the Hamming distance.

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

[0101]

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

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

[0104] It can be understood that a Hadamard matrix (English: Hadamard matrix) is a square matrix composed of elements +1 and elements -1; and each row of the Hadamard matrix is mutually orthogonal, and each column is also mutually orthogonal. The Hadamard matrix H of order k (referring to k×k) satisfies HH T = kI k , where I k represents the k×k identity matrix, and H T represents the transpose of H. Since all rows of the Hadamard matrix are mutually orthogonal, the Hamming distance between different rows is (k / 2). The normalized Hadamard matrix is a Hadamard matrix in which the elements of the first row and the first column are all 1. When the number of rows k of the Hadamard matrix > 2, k is an integer multiple of 4.

[0105] In the embodiments of the present application, by designing a new codebook and using the first codeword set in this codebook to perform mapping encoding on the first PHR information (PHR1), it can not only meet the requirements of demodulation performance, but also reduce the transmission duration of the PHR field (mainly PHR1), achieving a good compromise between the demodulation performance and transmission duration of the PHR field (mainly PHR1). In addition, in the embodiments of the present application, the Hamming distance between the codewords in the first codeword set is increased to improve the encoding performance of the PHR field (mainly PHR1).

[0106] The following details the design concept of the codebook in the embodiments of the present application and illustrates the codebook provided by the embodiments of the present application and the generation method of the codebook with examples.

[0107] In the embodiments of the present application, considering that there are currently 5 data rates supported by the PHY payload field, and combined with whether LDPC is used for encoding the PHY payload field, then the first PHR information (PHR1) needs at least 10 values to indicate the data rate of the PHY payload field and whether LDPC is used for encoding the PHY payload field; correspondingly, at least 10 codewords are also required to perform mapping encoding on the first PHR information (PHR1).

[0108] It can be understood 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, so 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 considering the mapping of all 4-bit values to codewords, there are a total of 16 codewords. When the code length is L, the upper limit value (bound) of the theoretical minimum Hamming distance between these 16 codewords is:

[0110]

[0111] And if only considering 10 codewords, when the code length is L, the upper limit value of the theoretical minimum Hamming distance between these 10 codewords is:

[0112]

[0113] In this article, the symbol "*" represents the "multiplication" or "multiply" operation. The same symbol in the following text represents the same meaning and will not be elaborated further below.

[0114] See Figure 6 , Figure 6 is a schematic diagram of the upper limit value of the theoretical minimum Hamming distance under different code lengths provided by the embodiments of the present application. As Figure 6As shown, the abscissa represents the code length, and the ordinate represents the upper limit of the theoretical minimum Hamming distance. It can be understood that considering the accuracy of the illustration, Figure 6 only the upper limit of the theoretical minimum Hamming distance for some code lengths is illustrated, that is, the range of the code length represented by the abscissa is from 20 bits to 32 bits. Figure 6 In it, "equal" (equivalent) represents equal encoding, and "unequal" (unequal) represents unequal encoding. Among them, equal encoding means considering the case of 16 codewords, and unequal encoding means only considering the case of 10 codewords.

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

[0116] The following is an example to illustrate how to design a codebook so that there are 10 codewords in this codebook and the Hamming distance between these 10 codewords reaches the maximum value.

[0117] For example, a possible codebook generation method is as follows:

[0118] Let K represent the bit length of the first PHR information (i.e., PHR1), and L represent the length of the codeword, L≥2 K , and the number of codewords included in the first codeword set is M, 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. At this time, there is a normalized Hadamard matrix H of (L + 2) * (L + 2) (L+2) , and a codebook can be generated through the following steps.

[0120] The first step: Select a normalized Hadamard matrix H of (L + 2) * (L + 2) (L+2) . According to the characteristics of the Hadamard matrix, it can be known that the Hamming distance between any two rows in H (L+2) is (L + 2) / 2 = (4(n + 1)) / 2 = 2n + 2; then remove the first column elements of H (L+2) to obtain a matrix H of (L + 2) * (L + 1) ((L+2)*(L+1)) . Since the first column elements of H (L+2) (all 1s) are the same, the Hamming distance between any two rows in the matrix H ((L+2)*(L+1)) is still 2n + 2.

[0121] Step 2: Arbitrarily select and remove one column from matrix H ((L+2)*(L+1)) and divide the rows of the matrix after removing this column into two groups according to the positive and negative of the elements in the removed column, obtaining matrix G + and matrix G - . Among them, matrix G + contains (2n + 2) rows of length L (i.e., the size of G + is (2n + 2) rows by L columns), and the Hamming distance between any two rows of elements in matrix G + is still 2n + 2. Matrix G - contains (2n + 2) rows of length L (i.e., the size of G - is (2n + 2) rows by L columns), and the Hamming distance between any two rows of elements in matrix G - is still 2n + 2. In addition, the Hamming distance between any row of elements in matrix G + and any row of elements in matrix G - is 2n + 1.

[0122] Step 3: Arbitrarily select M rows of elements from matrix G + and matrix G - , and select (2 K -M) rows of elements from the other matrix, and combine them to form a codebook matrix C. The codebook matrix C contains 2 K codewords of length L. Among them, the minimum Hamming distance between M legal codewords is 2n + 2, and the minimum Hamming distance between all codewords is 2n + 1. It can be understood that the M rows of elements selected from matrix G + or matrix G - are the M legal codewords. These M legal codewords can form the first codeword set, or these M legal codewords are part of the codewords in the first codeword set.

[0123] The codebook generated by using the above steps satisfies: the minimum Hamming distance between the codewords in the codebook is equal to the upper limit value of the theoretical minimum Hamming distance of this codebook, that is, 2n + 1; the Hamming distance between any two codewords in the first codeword set of this codebook is equal to the upper limit value of the theoretical minimum Hamming distance of this first codeword set, that is, 2n + 2. Thus, the coding performance of the first PHR information (PHR1) can be improved.

[0124] It can be understood that in the above steps (the first step to the third step), by using different Hadamard matrices, different codebooks can be constructed, but their minimum Hamming distance remains unchanged. It can also be understood that after performing operations such as column rearrangement, row rearrangement, or element negation of the entire column (element negation means that element -1 becomes element 1 and element 1 becomes element -1) on the codebook matrix C obtained in the above third step, another codebook matrix can be obtained, and this another codebook matrix has the same Hamming distance distribution as the codebook matrix C obtained in the above third step.

[0125] For example, when K is equal to 4 and L = 22, construct the following 24*24 Hadamard matrix H 24 .

[0126]

[0127] After removing the first column of H 24 , the matrix of H 24*23 is obtained. Assume that the first column of H 24*23 is selected, and while removing the first column of H 24*23 , all rows are divided into the following two groups according to the positive and negative of the elements in the first column of H 24*23 :

[0128]

[0129] Then, the Hamming distance between any two rows of elements in is 12, the Hamming distance between any two rows of elements in is also 12, the Hamming distance between any row of elements in and any row of elements in is 11. Then select 12 rows of elements from (i.e., M is equal to 12),

[0130] select 4 rows of elements from Figure 6 , and map element 1 to 0 and element -1 to 1 to obtain the codewords shown in Table 1 below. Among them,

[0131] Table 1: Codebook example 1 with code length (L) of 22

[0132]

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

[0134]

[0135] Removal of H 28 After the first column of H 28*27 Assume that H is selected 28*27 14th column, and H 28*27 At the same time as removing the 14th column, all rows are sorted according to H 28*27 The positive and negative elements of the 14th column are divided into the following two groups:

[0136]

[0137] So, The Hamming distance between any two rows of elements in is 14. The Hamming distance between any two rows of elements in is also 14. Any row of elements in The Hamming distance between any elements in is 13. Then from Select 14 rows of elements (that is, M is equal to 14), Select 2 rows of elements (any 2 rows, the following table 2 The last two lines of , for example, and element 1 is mapped to 0, and element -1 is mapped to 1, to obtain the codewords shown in the following Table 2. The size is 14 rows and 26 columns. The size is also 14 rows and 26 columns.

[0138] It can be understood that the embodiment of the present application does not limit the mapping relationship between the elements 1 and -1 and 1 and 0 in the matrix. It can also be understood that in the following Table 2, the Hamming distance between any two code words in the first 10 code words is 14. Figure 6 As shown, the theoretical upper limit of the unequal coding case when the code length L is equal to 26 is reached. In addition, for all code words shown in Table 2 below, the minimum Hamming distance can reach 13, which has also reached the theoretical upper limit of the equal coding case when the code length L is equal to 26.

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

[0140]

[0141]

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

[0143]

[0144] After removing the first column of H 32 , the matrix of H 32*31 is obtained. Assume that the first column of H 32*31 is selected, and while removing the first column of H 32*31 , all rows are divided into the following two groups according to the positive and negative of the elements in the first column of H 32*31 :

[0145]

[0146]

[0147] Then, the Hamming distance between any two rows of elements in is 16, the Hamming distance between any two rows of elements in is also 16, and the Hamming distance between any row of elements in and any row of elements in or is 15. Since is of size 16 rows and 30 columns,

[0148] is also of size 16 rows and 30 columns. Therefore, 16 rows of elements can be selected from Figure 6 shown in Table 3 below (taking the 16 rows of elements selected from

[0149] Table 3: Example 1 of the codebook with code length (L) of 30

[0150]

[0151]

[0152] In addition, when L ≥ 2 (K+1) - 2, the code length can be split into two parts L = L 1 + L 2, respectively design codebook matrices with code lengths of L 1 and code length of L 2 using the above codebook generation method, and then splice these two codebook matrices to form a codebook with a length of L.

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

[0154]

[0155] After removing the first column of H 20 , the matrix of H 20*19 is obtained. Select any column (exemplarily, the first column here) from the matrix H 20*19 and remove it. At the same time, divide the rows of the matrix after removing this column into the following two groups according to the positive and negative of the elements in the removed column:

[0156]

[0157]

[0158] Select 10 rows of elements from , and select the last six rows of elements from to form a codebook matrix C 16×18 with a code length L of 18.

[0159]

[0160] Then splice the two C 16×18 to form a codebook matrix C 16×36 with a code length L of 36.

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

[0162] where C p 16×18 represents the matrix after rearranging the rows of C 16×18 . Since the row permutation does not affect the Hamming distance of C 16×18 , the Hamming distance between any two rows of the last 10 rows of elements in C 16×18 is 10, and the Hamming distance between any two rows of the first 6 rows of elements is also 10. However, the Hamming distance between any row of the first 6 rows of elements and any row of the last 10 rows of elements is 9.

[0163] When C p 16×18 and C 16×18 ​When they are the same, mapping element 1 to 0 and element -1 to 1, the codewords shown in Table 4 below can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between element 1 and -1 in the matrix and 1 and 0. It can also be understood that in Table 4 below, the Hamming distance between any two of the last 10 codewords is 20, reaching the theoretical upper bound when the code length L is equal to 36 in the case of unequal coding. In addition, for all the codewords shown in Table 4 below, the minimum Hamming distance is 18.

[0164] Table 4: Example 1 of the codebook with code length (L) of 36

[0165]

[0166]

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

[0168]

[0169] After removing the first column of H 20 , the matrix of H 20*19 is obtained. Select any column (exemplarily, the first column here) from the matrix H 20*19 to remove, and at the same time divide the rows of the matrix after removing the column into the following two groups according to the positive and negative of the elements in the removed column:

[0170]

[0171] Select 10 rows of elements from , and select any 6 rows of elements from (exemplarily, select the last 6 rows of elements of ) to form the codebook matrix C 16×18 with code length L of 18.

[0172]

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

[0174]

[0175] After removing the first column of H 16 , the matrix of H 16*15 is obtained. Select any column (exemplarily, the first column here) from the matrix H 16*15 to remove, and at the same time divide the rows of the matrix after removing the column into the following two groups according to the positive and negative of the elements in the removed column:

[0176]

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

[0178]

[0179] Then splice C 16×18 and C 16×14 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] where C p 16×14 is the matrix after rearranging the rows of C 16×14 . The row rearrangement does not affect the Hamming distance distribution of C 16×14 . Here, C p 16×14＝ C 16×14 . Therefore, the Hamming distance between any two rows of the first 8 rows of elements in C 16×32 is 18, the Hamming distance between any two rows of the first 10 rows of elements is 18 or 17, and the Hamming distance between any two rows of all 16 rows of elements is at least 16.

[0182] When C p 16×14 is the same as C 16×14 , map element 1 to 0 and element -1 to 1, and the following codewords as shown in Table 5a can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between elements 1 and -1 and 1 and 0 in the matrix.

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

[0184]

[0185]

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

[0187]

[0188] Remove H 24 ​After the first column of, we get H 24*23 of the matrix. After selecting the first column of H 24×23 Remove the first column of the matrix H 24*23 At the same time, divide the rows of the matrix after removing the column into the following two groups according to the positive and negative of the elements in the removed column:

[0189]

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

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

[0192]

[0193] After removing the first column of H 12 we get the matrix of H 12*11 Select any column (exemplarily, the first column here) from the matrix H 12*11 Remove it, and at the same time divide the rows of the matrix after removing the column into the following two groups according to the positive and negative of the elements in the removed column:

[0194]

[0195] Then, The Hamming distance between any two rows of elements in is 6, The Hamming distance between any two rows of elements in is also 6, The Hamming distance between any row of elements in and The Hamming distance between any row of elements in is 5. Then combine all the rows in and to form a codebook matrix C with code length L of 10 12×10 .

[0196]

[0197] Combine or with C 12×10 to form a codebook matrix C with code length L of 32 12×32 .

[0198] Or

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

[0200] Taking concatenation with C 12×10 as an example, mapping the element 1 in C 12×32 to 0 and the element -1 to 1, the codewords shown in Table 5b below can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the elements 1 and -1 and 1 and 0 in the matrix.

[0201] Table 5b: Example 2 of a codebook with a code length (L) of 32

[0202]

[0203]

[0204] It can be understood that the above Tables 1 to 4 are only examples, and the mapping relationships between the data rate and the LDPC indication and the codewords in Tables 1 to 4 are not fixed. It only needs to ensure that different combinations of data rates and LDPC indications are mapped to different codewords. That is, different values of the first PHR information (PHR1) are mapped to different codewords.

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

[0206] To better illustrate the beneficial effects of mapping and encoding the first PHR information (i.e., PHR1) using the first codeword set designed according to the embodiments of the present application, the performance of the embodiments of the present application is exemplarily illustrated below through the packet error rate simulation of the first PHR information (i.e., PHR1) under different encoding methods. In addition, the advantage of the embodiments of the present application in terms of transmission duration is also exemplified by calculating the transmission time of the first PHR information (i.e., PHR1).

[0207] For example, referring to Figure 7 , Figure 7 is a schematic diagram of the packet error rate simulation results of PHR1 using different encoding methods provided by the embodiments of the present application. As Figure 7As shown, the abscissa represents the signal-to-noise ratio (SNR) in decibels (dB); the ordinate represents the packet error rate (PER) of the first PHR information (i.e., PHR1). It can be understood that considering the schematic accuracy, Figure 7 only some simulation results are shown. That is, the SNR range represented by the abscissa is from -5 dB to 0, and the packet error rate range represented by the ordinate is greater than 10 -3 . Figure 7 Among them, BCC represents the packet error rate when convolutional coding is performed on 4 bits of PHR1, equal,L = 22 represents the packet error rate when PHR1 is mapped and encoded using all the codewords in Table 1 above, Uequal,L = 22 represents the packet error rate when PHR1 is mapped and encoded using the first 10 codewords (i.e., the first codeword set) in Table 1 above, equal,L = 26 represents the packet error rate when PHR1 is mapped and encoded using all the codewords in Table 2 above, and Uequal,L = 26 represents the packet error rate when PHR1 is mapped and encoded using the first 10 codewords (i.e., the first codeword set) in Table 2 above.

[0208] From 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 duration of PHR1 when using codebooks with different codeword lengths is shown in Table 6 below.

[0210] Table 6

[0211] Codeword length Transmission duration of PHR1 (μs) 20 5 22 5.5 26 6.5

[0212] As can be seen from Table 6 above, when using the codebook designed in the embodiments of the present application to perform mapping and encoding on the first PHR information (i.e., PHR1), compared with the prior art solution 3 (transmitting PHR1 at a rate of 0.975 Mbps), the transmission time is shorter.

[0213] Therefore, the embodiments of the present application can not only meet the requirements of demodulation performance, but also reduce the transmission duration of the PHR field (mainly PHR1), achieving a good compromise between the demodulation performance and transmission duration of the PHR field (mainly PHR1).

[0214] The present application also provides another implementation manner of the first codeword set.

[0215] Since there are currently 5 data rates supported by the PHY payload field, even considering the indication of whether LDPC coding is used for the PHY payload field, at most 10 values are needed to indicate, so at least 10 (considering future standard promotion) 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, and for larger data rates, the Hamming distance between the corresponding codeword sequence and other codeword sequences can be smaller, so that the performance of the codeword sequence matches the data coding and modulation rate.

[0216] For example, another possible codebook generation method is as follows:

[0217] When L = 16, the 12 * 12 normalized Hadamard matrix H 12 is as follows.

[0218]

[0219] After removing the first column of H 12 , the matrix of H 12×11 is obtained.

[0220]

[0221] Then the Hamming distance between any two rows of elements in H 12×11 is 6. Then construct the matrix P 12×5 , such that the first row elements of P 12×5 are all -1 and other elements are all 1, that is:

[0222]

[0223] Then, the Hamming distance between the first row elements and other row elements in P 12×5 is 5, and the Hamming distance between any two rows of elements except the first row elements is 0. Therefore, a codebook matrix C 12×16 of length 16 can be constructed as [P 12×5 , H 12×11 . C 12×16 can be understood as the splicing of two matrices. Before splicing, the rows of the right matrix H 12×11 can be rearranged, and the codebook matrix obtained after rearrangement and splicing does not affect the Hamming distance distribution of the original codebook matrix C 12×16 . Among them, the Hamming distance between the first row elements and any other row elements in the codebook matrix C 12×16 is 11, and the Hamming distance between any other two rows of elements is 6.

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

[0225] Table 7: Example of a codebook with code length (L) of 16

[0226]

[0227]

[0228] When L = 18, the 12×12 normalized Hadamard matrix H 12 As shown before, it will not be elaborated here. After removing the first column of H 12 , the matrix of H 12×11 is obtained. As shown before, it will not be elaborated here. Among them, the Hamming distance between any two rows of elements in H 12×11 is 6.

[0229] Then, construct the matrix P 12×7 such that the first row elements of P 12×7 are all -1 and the other elements are all 1, that is:

[0230]

[0231] Then, the Hamming distance between the first row elements and the other row elements in P 12×7 is 7, and the Hamming distance between any two other rows of elements except the first row elements is 0. Therefore, a codebook matrix C 12×18 = [P 12×7 , H 12×11 can be constructed. C 12×18 can be understood as the splicing of two matrices. Before splicing, the rows of the matrix H 12×11 on the right can be rearranged. After rearrangement and then splicing, the obtained codebook matrix does not affect the Hamming distance distribution of the original codebook matrix C 12×18 . Among them, the Hamming distance between the first row elements and any other row elements in the codebook matrix C 12×18 is 13, and the Hamming distance between any two other rows of elements is 6.

[0232] By mapping the element 1 in the codebook matrix C 12×18 to 0 and the element -1 to 1, the codewords shown in Table 8 below can be obtained.

[0233] Table 8: Example 1 of a codebook with code length (L) of 18

[0234]

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

[0236]

[0237] Remove the first column of H 16 to obtain the matrix of H 16×15 .

[0238]

[0239] Then the Hamming distance between any two rows of elements in H 16×15 is 8. Then construct the matrix P 16×3 such that the first row of elements in P 16×3 are all -1 and the other elements are all 1, that is:

[0240]

[0241] Then, the Hamming distance between the first row of elements in P 16×3 and the other rows of elements is 3, and the Hamming distance between any other two rows of elements except the first row is 0. Therefore, a codebook matrix C 16×18 of length 18 can be constructed as C 16×3 = [P 16×15 , H 16×18 . C 16×15 can be understood as the splicing of two matrices. Before splicing, the rows of the matrix H 16×18 on the right can be rearranged. The codebook matrix obtained after rearrangement and splicing does not affect the Hamming distance distribution of the original codebook matrix C 16×18 . Among them, the Hamming distance between the first row of elements in the codebook matrix C

[0242] and any other row of elements is 11, and the Hamming distance between any other two rows of elements is 8. 16×18 Map the element 1 in the codebook matrix C

[0243] Table 9: Example 2 of the codebook with code length (L) of 18

[0244]

[0245]

[0246] When L = 20, the 12 * 12 normalized Hadamard matrix H 12 is as shown before, which will not be elaborated here. Remove the first column of H 12 to obtain the matrix of H 12×11 , as shown before, which will not be elaborated here. Among them, H 12×11The Hamming distance between any two rows of elements is 6.

[0247] Construct matrix P again 12×9 , such that P 12×9 The first three rows of are the repetitions of the following matrix:

[0248]

[0249] That is to say, P 12×9 The first three rows of are obtained by repeating matrix H 3 three times, namely:

[0250]

[0251] Then, for any row element of the first three rows of P 12×9 The Hamming distance between it and any other row element is 6. Except for the elements of the first three rows, the Hamming distance between any other two rows of elements is 0. Therefore, a codebook matrix C of length 20 can be constructed 12×20 = [P 12×9 , H 12×11 . C 12×20 Can be understood as the splicing of two matrices. Before splicing, the rows of the right matrix H 12×11 Can be rearranged. After rearrangement and then splicing, the obtained codebook matrix does not affect the Hamming distance distribution of the original codebook matrix C 12×20 . Among them, for any row element of the first three rows of the codebook matrix C 12×20 The Hamming distance between it and any other row element is 12, and the Hamming distance between any other two rows of elements is 6.

[0252] Map the element 1 in the codebook matrix C 12×20 to 0, and the element -1 to 1, the following codewords shown in Table 10 can be obtained.

[0253] Table 10: Example 1 of codebook with code length (L) of 20

[0254]

[0255]

[0256] Or, the 16*16 normalized Hadamard matrix H 16 As shown before, it will not be elaborated here. After removing the first column of H 16 , the matrix of H 16×15 is obtained. As shown before, it will not be elaborated here. Among them, for any two rows of elements in H 16×15 The Hamming distance is 8.

[0257] Construct matrix P again 16×5 , such that P16×5 is as follows:

[0258]

[0259] Or,

[0260] For P in case 1 16×5 , the Hamming distance between the first row element and the other row elements is 5, and the Hamming distance between any two other rows of elements is 0. Therefore, a codebook matrix C of length 20 can be constructed 16×20 = [P 16×5 , H 16×15 . C 16×20 can be understood as the splicing of two matrices. Before splicing, the rows of the right matrix H 16×15 can be rearranged. The codebook matrix obtained after rearrangement and then splicing does not affect the Hamming distance distribution of the original codebook matrix C 16×20 . Among them, the Hamming distance between the first row element and any other row element in the codebook matrix C 16×20 is 13, and the Hamming distance between any two other rows of elements is 8. Mapping the element 1 in the codebook matrix C 16×20 to 0 and the element -1 to 1, the codewords shown in Table 11 below can be obtained.

[0261] Table 11: Example 2 of codebook with code length (L) of 20

[0262]

[0263]

[0264] For P in case 2 16×5 , the Hamming distance between any one of the first three rows of elements and the other row elements is at least 3, and the Hamming distance between any two other rows of elements except the first three 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 can be understood as the splicing of two matrices. Before splicing, the rows of the right matrix H 16×15 can be rearranged. The codebook matrix obtained after rearrangement and then splicing does not affect the Hamming distance distribution of the original codebook matrix C 16×20 . Among them, the Hamming distance between any one of the first three rows of elements and any other row element in the codebook matrix C 16×20 is 11, and the Hamming distance between any two other rows of elements is 8. For the codebook matrix C 16×20The element 1 in it is mapped to 0, and the element -1 is mapped to 1, and the codewords shown in Table 12 below can be obtained.

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

[0266]

[0267]

[0268] Alternatively, use the 20*20 normalized Hadamard matrix H shown below 20 .

[0269]

[0270] After removing the first column of H 20 , the matrix of H 20*19 is obtained. Assume that the first column of H 20*19 is selected, and while removing the first column of H 20*19 , all rows are divided into the following two groups according to the positive and negative of the elements in the first column of H 20*19 :

[0271]

[0272] Then, the Hamming distance between any two rows of elements in it is 10, the Hamming distance between any two rows of elements in it is also 10, the Hamming distance between any row of elements in it and any row of elements in it is 9.

[0273] Then construct the matrix P 10×2 , such that P 10×2 is as follows:

[0274]

[0275] Therefore, a codebook matrix with a length of 20 can be constructed C 10×20 can be understood as the splicing of two matrices. Before splicing, the rows of the matrix on the right can be rearranged. After rearrangement and then splicing, the obtained codebook matrix does not affect the Hamming distance distribution of the original codebook matrix C 10×20 . Among them, the Hamming distance between any row of elements in the first two rows of the codebook matrix C 10×20 and any other row of elements is 11, and the Hamming distance between any other two rows of elements is 10.

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

[0277] Table 13: Example 4 of the codebook with code length (L) of 20

[0278]

[0279] It can be understood that Tables 7 to 13 above are only examples, and the mapping relationship between the modulation and coding rate combinations and the codewords in Tables 7 to 13 is not fixed. It only needs to ensure that different combinations of data rates and LDPC indications are mapped to different codewords.

[0280] Exemplarily, the above first codeword set may include one or more of the following codewords: one or more codewords in the above Table 7 to the above Table 13.

[0281] It can be 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 (exemplarily, inverting an element here means changing element 1 to element 0 and element 0 to element 1), or rearranging rows, or rearranging columns, etc., do not affect the Hamming distance distribution and are all within the protection scope of this application.

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

[0283] Exemplarily, since there are currently 5 data rates supported by the PHY payload field, even considering the indication of whether LDPC is used for encoding in the PHY payload field, at most 10 values are required to indicate. Then, at least 10 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 sequences and other codeword sequences can be larger, and for larger data rates, the Hamming distance between the corresponding codeword sequences and other codeword sequences can be smaller, so that the performance of the codeword sequences matches the data coding and modulation rate.

[0284] It can be understood that for an extended binary Golay 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 (that is, a codebook) according to an extended binary Golay code with a code rate of 0.5 and a length of 24, so as to ensure the Hamming distance between the codewords in the sequence set (that is, the codebook).

[0285] Exemplarily, the generating matrix G of the extended binary Golay code with a code rate of 0.5 and a length of 24 is as follows:

[0286]

[0287] Any binary information bit sequence with a length of 12 (i.e., a 1-row and 12-column binary vector), multiplied by the generating matrix G (here it is binary multiplication, and the multiplication result is a binary of 0 and 1), can obtain an extended binary Gray code That is

[0288] It can be understood that using different binary information bit sequences can generate different extended binary Gray codes Taking an extended binary Gray code as a codeword sequence, since the information bit length is 12, 2 12 = 4096 different codeword sequences can be constructed. According to coding theory, the extended binary Gray code with a code rate of 0.5 and a length of 24 can be shortened, that is, some of the information bits and the corresponding parity bits of these information bits can be removed, which corresponds to reducing the dimension of the generating matrix G, and this operation (i.e., the shortening operation) will not reduce the Hamming distance between codewords.

[0289] Therefore, if the extended binary Gray code with a code rate of 0.5 and a length of 24 is shortened by k bits, then the generating matrix of this shortened extended binary Gray code can be expressed as: G short = G((k + 1):12, (k + 1):24). Among them, the generating matrix G short contains the (k + 1)-th row to the 12th row and the (k + 1)-th column to the 24th column in the generating matrix G. It can be understood that based on the generating matrix G short , 2 (12-k) barcode word sequences can be constructed.

[0290] For example, a possible codebook generation method 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, and 128 codeword sequences with a length of 19 can be obtained. Deleting any one bit of these 128 barcode word sequences, for example, deleting the first bit of these 128 barcode word sequences, 128 codeword sequences with a length of 18 can be obtained. Then, from these 128 codeword sequences with a length of 18, select the codeword sequences containing 12 1s. There are 18 codeword sequences containing 12 1s in total; adding the codeword sequence of all 0s, 19 codewords as shown in Table 14 below can be obtained.

[0292] Table 14: Example 3 of the codebook with a code length (L) of 18

[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 being 0) and other codewords is 12, and the Hamming distance between any two other codewords is at least 8.

[0296] In some scenarios, the first codeword (i.e., the codeword with all elements being 0) in Table 14 above can be used for indicating a lower rate, and other codewords can be used for indicating a higher rate. In some scenarios, the sending end can select a corresponding codeword sequence according to the rate of the payload, and then map the selected codeword sequence to 1 and -1 and send it. Exemplarily, element 0 is mapped to element 1, and element 1 is mapped to element -1. Of course, it can also be that element 0 is mapped to element -1 and element 1 is mapped to element 0. The embodiments of the present application do not make restrictions.

[0297] It can be understood that Table 14 above is only an example, and the mapping relationship between the modulation and coding rate combinations and the codewords in Table 14 is not fixed, as long as it is ensured that different combinations of data rates and LDPC indications are mapped to different codewords.

[0298] Exemplarily, the above first codeword set can include one or more of the following codewords: one or more codewords in Table 14 above. In practical applications, only some of the codewords in Table 14 above can be used, or some of the codewords in Table 14 above can be reserved.

[0299] It can be understood that operations such as taking the inverse of one or more columns of elements of all the codewords in Table 14 above (exemplarily, here taking the inverse of an element means changing element 1 to element 0 and element 0 to element 1), or rearranging rows, or rearranging columns, etc., do not affect the Hamming distance distribution and all fall within the protection scope of the present application.

[0300] The present application also provides another implementation manner of the first codeword set.

[0301] Exemplarily, since there are currently 5 data rates supported by the PHY payload field, even considering the indication of whether LDPC is used for encoding the PHY payload field, at most 10 values are required for indication. Then, at least 10 (considering subsequent standard promotion) different codeword sequences can be used to indicate the modulation and coding rate information of the UWB system. For a smaller data rate, the Hamming distance between its corresponding codeword sequence and other codeword sequences can be larger, and for a larger data rate, the Hamming distance between its corresponding codeword sequence and other codeword sequences can be smaller, so that the performance of the codeword sequence matches the data coding and modulation rate.

[0302] For example, a possible codebook generation method 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. A codebook with a code length of 12 and a codebook with a code length of 6 are designed respectively, and the two designed codebooks are concatenated to form a codebook with a code length of 18.

[0304] Select 12 sequences from sequences of length 12 containing 5 1s and 7 0s such that the Hamming distance between any two of these 12 sequences is at least 6. For example, the codebook matrix P with a code length of 12 1 is as follows:

[0305]

[0306] The codebook matrix P with a code length of 12 1 has a Hamming distance of at least 6 between any two rows of elements.

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

[0308]

[0309] Then, the codebook matrix P with a code length of 12 1 and the codebook matrix P with a code length of 6 2 are concatenated together to obtain a sequence set of length 18 [P 1 , P 2 . The Hamming distance between any two sequences in this sequence set [P 1 , P 2 is 8 or 10. In addition, the all-1 sequence (i.e., all 18 elements are 1) and any sequence in the sequence set [P 1 , P 2 have a Hamming distance of 12, and the sequence [0 12 , 1 6 (i.e., a sequence composed of 12 elements 0 and 6 elements 1) and any sequence in the sequence set [P 1 , P 2 have a Hamming distance of 10. Therefore, these two sequences (i.e., the all-1 sequence and the sequence [0 12 , 1 6 ) and the sequence set of length 18 [P 1 , P 2 can be used as a codebook to obtain 14 codewords as shown in Table 15 below.

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

[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 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 other codewords is 10, and the Hamming distance between any two other codewords except the first and the second codewords is at least 8.

[0314] In some scenarios, the first codeword (i.e., the codeword with all elements being 1) and the second codeword (i.e., the codeword with the first 12 elements being all 0 and the last 6 elements being all 1) in Table 15 above can be used for the indication of a lower rate, and other codewords can be used for the indication of a higher rate. In some scenarios, the sending end can select a corresponding codeword sequence according to the rate of the payload, and then map the selected codeword sequence to 1 and -1 before sending. Exemplarily, element 0 is mapped to element 1, and element 1 is mapped to element -1. Of course, it can also be that element 0 is mapped to element -1 and element 1 is mapped to element 0. The embodiments of the present application do not make restrictions.

[0315] It can be understood that Table 15 above is only an example, and the mapping relationship between the modulation and coding rate combinations and the codewords in Table 15 is not fixed. It only needs to ensure that different combinations of data rates and LDPC indications are mapped to different codewords.

[0316] Exemplarily, the above first codeword set may include one or more of the following codewords: one or more codewords in Table 15 above. In practical applications, only some of the codewords in Table 15 above can be used, or in other words, some of the codewords in Table 15 above can be reserved.

[0317] It can be understood that operations such as taking the inverse of one or more columns of elements of all the codewords in Table 15 above (exemplarily, here taking the inverse of an element means changing element 1 to element 0 and element 0 to element 1), or rearranging rows, or rearranging columns, etc., do not affect the Hamming distance distribution and all fall within the protection scope of the present application.

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

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

[0320] S202. The first communication device transmits a signal, which is generated based on the PPDU. The signal includes a signal generated according to the coded codewords obtained from the first PHR information. The codewords include the codewords corresponding to the first PHR information in the first codeword set.

[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 above PPDU may be a PPDU applied to the UWB WPAN standard, such as the PPDU in the 802.15.4ab protocol.

[0324] Optionally, the above 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 coding method and the length of the PHY payload field, and optionally may also be used to indicate one or more of the following: whether the PPDU is used for sensing measurement, or CRC code.

[0325] Exemplarily, the first PHR information in the embodiments of the present application may be understood as 3 bits in the PHR1 for indicating the data rate of the PHY payload field, and the second PHR information may be understood as 1 bit in the PHR1 for indicating whether the PHY payload field is encoded using a first coding method and the PHR2. That is to say, the first PHR information has a total of 3 bits and is used to indicate the data rate of the PHY payload field; the second PHR information has a total of 24 bits, where 1 bit is used to indicate whether the PHY payload field is encoded using a first coding 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] Exemplarily, the first coding method may be any one of the following: LDPC, convolutional code, Polar code, Turbo code, etc., and the embodiments of the present application do not limit it. For ease of description below, the first coding method is taken as LDPC as an example for illustration; of course, with the development of the standard, the LDPC below may also be replaced by any coding method specified in future standards (such as convolutional code, Polar code, Turbo code, etc.).

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

[0328] Therefore, the above signal can be generated based on the PPDU. Then, the signal at least includes a signal generated according to the codeword obtained by encoding the above first PHR information, and the codeword may include the codeword mapped to the first PHR information in the first codeword set. In some scenarios, the Hamming distance between any two codewords in the first codeword set is greater than or equal to the upper limit (bound) of the theoretical minimum Hamming distance of the first codeword set. Exemplarily, if the first codeword set has a total of M codewords and the length of each codeword is L, the Hamming distance d between any two codewords in the first codeword set may satisfy the foregoing formula (1-1) or the foregoing formula (1-2). For another example, M is less than or equal to 2 K 。

[0329] Optionally, the length L of the codewords in the above first codeword set may be an even number of bits and may also be greater than or equal to 2 K bits, where K is the bit length of the first PHR information. Exemplarily, K is equal to 3. For another example, the length L of the codeword is any one 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 above first codeword set may be generated based on a 2 K -order (when K is 3, here it is 8*8) Hadamard matrix. The generation method of the first codeword set and the specific content of the codewords can be seen in the following description, and will not be elaborated here.

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

[0332] The following details the design idea of the first set of codewords in the embodiment of the present application, and gives examples to illustrate the first set of codewords provided by the embodiment of the present application and the generation method of the first set of codewords.

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

[0334] It can be understood that the encoding performance is related to the minimum Hamming distance between codewords. The larger the minimum Hamming distance between codewords, the greater the difference between different codewords, so 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 all the values of the 3 bits are considered for the mapping with codewords, there are a total of 8 codewords. When the code length is L, the upper limit value of the theoretical minimum Hamming distance between these 8 codewords is:

[0336]

[0337] If only 5 codewords are considered, when the code length is L, the upper limit value of the theoretical minimum Hamming distance between these 5 codewords is:

[0338]

[0339] See Figure 9 , Figure 9 is another schematic diagram of the upper limit value of the theoretical minimum Hamming distance under different code lengths provided by the embodiment of the present application. As Figure 9 shown, the abscissa represents the code length, and the ordinate represents the upper limit value of the theoretical minimum Hamming distance. It can be understood that considering the accuracy of the schematic diagram, Figure 9 only the upper limit values of the theoretical minimum Hamming distance for some code lengths are schematically shown, that is, the range of the code length represented by the abscissa is from 20 bits to 40 bits. Figure 9Among them, "equal" means equal encoding, and "unequal" means unequal encoding. Among them, equal encoding refers to considering the case of 8 codewords, and unequal encoding refers to only considering the case of 5 codewords.

[0340] From Figure 9 it can be seen that when the first PHR information is 3 bits, for different code lengths, only considering 5 codewords (unequal encoding) has a certain advantage over considering 8 codewords (equal encoding) in terms of the theoretical minimum Hamming distance.

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

[0342] For example, a possible codebook generation method is as follows:

[0343] Let K represent the bit length of the first PHR information. In the embodiments of this application, K is equal to 3; L represents the length of the codeword, L≥2 K , and the number of codewords included in the first codeword set is 2 K .

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

[0345]

[0346] Since the first column elements of H 8 are all 1 and it has no contribution to the Hamming distance between different rows, the first column elements of H 8 can be removed to obtain the following matrix H (8×7) .

[0347]

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

[0349] If m = 0, then L = 7n, and the matrix H (8×7) can be repeated n times to obtain n matrices H (8×7) , and then the rows of these n H (8×7) can be rearranged respectively (the rearrangement process can also be skipped), and then arranged side by side by row to obtain the matrix C 8×7n .

[0350]

[0351] Among them, represents the matrix after rearranging the rows of H (8×7) . The same representation method below means the same meaning and will not be elaborated below. Since the Hamming distance between any two rows of elements in H (8×7) is 4, and repeating H (8×7) n times and row rearrangement do not affect the Hamming distance in each H (8×7) , so the Hamming distance between any two rows of elements in C 8×7n is 4n. Then, by mapping the elements 1 and -1 in C 8×7n to 0 and 1 respectively, a codebook with a code length of 7n can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the 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 below is 16. Optionally, the above first codeword set may include all or part of the codewords in Table 16 below.

[0353] Table 16: Example of a codebook with a code length (L) of 28

[0354]

[0355]

[0356] If m = 1, 2, 5, or 6 and L = 7n + m, the matrix H (8×7) can be repeated n times to obtain n matrices H (8×7) . Then, the rows of these n H (8×7) can be rearranged respectively (the rearrangement process can also be skipped), and then arranged side by side by rows. Then, any m columns are selected from H (8×7) to form the matrix H (8×m) , and the matrix obtained after n repetitions is arranged side by side by rows to obtain the matrix C 8×(7n+m) .

[0357]

[0358] Among them, represents the matrix after rearranging the rows of H (8×7) . Since when m is 1, 2, 5, or 6 respectively, the minimum Hamming distance between the rows of elements in the matrix H (8×m) is 0, 0, 2, 3. When m is equal to 1 or 2, the minimum Hamming distance between the rows of elements in C 8×(7n+m) is 4n. When m is equal to 5, the minimum Hamming distance between the rows of elements in C 8×(7n+m) is 4n + 2. When m is equal to 6, the minimum Hamming distance between the rows of elements in C 8×(7n+m)The minimum Hamming distance between the elements in each row is 4n + 3. Then, by mapping the elements 1 and -1 in C 8×(7n+m) to 0 and 1 respectively, a codebook with a code length L = 7n + m can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the 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 below is 12. Optionally, the above first codeword set may include all or part of the codewords in Table 17 below.

[0360] Table 17: Example 2 of the codebook with a code length (L) of 22

[0361]

[0362] Again, 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 below is 14. Optionally, the above first codeword set may include all or part of the codewords in Table 18 below.

[0363] Table 18: Example 2 of the codebook with a code length (L) of 26

[0364]

[0365]

[0366] Also, 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 below is 16. Optionally, the above first codeword set may include all or part of the codewords in Table 19 below.

[0367] Table 19: Example 2 of the codebook with a code length (L) of 30

[0368]

[0369] Also, 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 below is 19. Optionally, the above first codeword set may include all or part of the codewords in Table 20 below.

[0370] Table 20: Example of the codebook with a code length (L) of 34

[0371]

[0372] For another 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 below is 20. Optionally, the above first codeword set may include all or part of the codewords in Table 21 below.

[0373] Table 21: Example 2 of the codebook with code length (L) of 36

[0374]

[0375]

[0376] For another 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 below is 22. Optionally, the above first codeword set may include all or part of the codewords in Table 22 below.

[0377] Table 22: Example of the codebook with code length (L) of 40

[0378]

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

[0380]

[0381] Then remove the first column elements of H 12 to obtain a 12 * 11 matrix H 12*11 . Then, randomly select and remove one column from the matrix H 12*11 . Assume that the first column of the matrix H 12*11 is selected. While removing the first column of H 12*11 , divide the rows of the matrix after removing this column into the following two groups according to the positive and negative of the elements in the removed column:

[0382]

[0383]

[0384] Then, the Hamming distance between any two rows of elements is 6, the Hamming distance between any two rows of elements is also 6, the Hamming distance between any row of elements and any row of elements is 5. Randomly select q rows from , and randomly select 8 - q rows from (here, q is taken as 2 for example) to form the matrix C 8×10 .

[0385]

[0386] Then, matrix H (8×7) is repeated n - 1 times to obtain n - 1 matrices H (8×7) . Then, after the rows of these n - 1 Hs (8×7) are respectively rearranged (the rearrangement process can also be skipped), matrix C 8×10 is arranged side by side with the matrix of H (8×7) after n - 1 repetitions by rows to obtain matrix C 8×(7n+3) .

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

[0388] wherein, represents the matrix after rearranging the rows of H (8×7) . Then, the Hamming distance between any two rows of elements in C 8×(7n+3) is 4(n - 1)+5 = 4n + 1 or 4(n - 1)+6 = 4n + 2. Therefore, the minimum Hamming distance between the rows of elements in C 8×(7n+3) is 4n + 1. By respectively mapping the elements 1 and -1 in C 8×(7n+3) to 0 and 1, a codebook with code length L = 7n + 3 can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the elements 1 and -1 and 1 and 0 in the matrix.

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

[0390] Table 23: Example of codebook with code length (L) of 24

[0391]

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

[0393] Table 24: Example of codebook with code length (L) of 38

[0394]

[0395]

[0396] In addition, for the case of L = 7n + 3, a codebook can also be generated by the following method. Matrix H (8×7) is repeated n times to obtain n matrices H (8×7) . Then, after the rows of these n H (8×7) are respectively rearranged (the rearrangement process can also be skipped), and then arranged side by side by rows, and 3 columns are arbitrarily selected from H (8×7) except for the following 7 combinations: Avoid selecting combinations of column numbers = {1, 2, 3; 1, 4, 5; 1, 6, 7; 2, 4, 6; 2, 5, 7; 3, 4, 7; 3, 5, 6}; to form matrix H (8×3) . Then, matrix H (8×3) and the matrix obtained by repeating H (8×7) n times are arranged side by side by rows to obtain matrix C 8×(7n+3) .

[0397]

[0398] Among them, represents the matrix after rearranging the rows of H (8×7) . Finally, by mapping the elements 1 and -1 in C 8×(7n+3) to 0 and 1 respectively, a codebook with code length L = 7n + 3 can be obtained. The specific codebooks are not listed one by one here. It can be understood that the embodiments of the present application do not limit the mapping relationship between the elements 1 and -1 and 0 and 1 in the matrix.

[0399] If m = 4 and L = 7n + 4, a 12×12 normalized Hadamard matrix H 12 is selected. As described above, it will not be elaborated here. Then, the first column elements of H 12 are removed to obtain a 12×11 matrix H 12*11 . Then, 8 rows are arbitrarily selected from matrix H 12*11 , for example, rows 5 to 12 to obtain an 8×11 matrix H 8*11 . Then, the Hamming distance between any two rows of elements in matrix H 8*11 is 6.

[0400]

[0401] Then, matrix H (8×7) is repeated n - 1 times to obtain n - 1 matrices H (8×7) . Then, after the rows of these n - 1 H (8×7) are respectively rearranged (the rearrangement process can also be skipped), and then matrix H 8×11 and the matrix obtained by repeating H (8×7) n - 1 times are arranged side by side by rows to obtain matrix C 8×(7n+4) .

[0402]

[0403] Among them, represents the matrix after rearranging the rows of H (8×7) . Then, the Hamming distance between any two rows of elements in C 8×(7n+4) is 4(n - 1)+6 = 4n + 2. Therefore, the minimum Hamming distance between the rows of elements in C 8×(7n+4) is 4n + 2. Then, by mapping the elements 1 and -1 in C 8×(7n+4) to 0 and 1 respectively, a codebook with code length L = 7n + 4 can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the elements 1 and -1 and 1 and 0 in the matrix.

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

[0405] Table 25: Example of a codebook with code length (L) of 32 3

[0406]

[0407] In addition, for the case of L = 7n + 4, a codebook can also be generated by the following method. Repeat the matrix H (8×7) n times to obtain n matrices H (8×7) . Then, after rearranging the rows of these n H (8×7) respectively (the rearrangement process can also be skipped), and arranging them side by side by rows, and arbitrarily selecting 4 columns from H (8×7) , these 4 columns are one of the following 7 combinations: the combinable column number combinations = {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}; to form the matrix H (8×4) . Then, arrange the matrix H (8×4) and the matrix after repeating H (8×7) n times side by side by rows to obtain the matrix C 8×(7n+4) .

[0408]

[0409] Among them, represents the matrix after rearranging the rows of H (8×7) . Finally, by mapping the elements 1 and -1 in C 8×(7n+4) to 0 and 1 respectively, a codebook with code length L = 7n + 4 can be obtained. It can be understood that the embodiments of the present application do not limit the mapping relationship between the elements 1 and -1 and 1 and 0 in the matrix.

[0410] For example, when L = 32, H (8×7) is copied 4 times, and at the same time, the 1st, 2nd, 4th, and 7th columns in H (8×7) are selected to 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 below is 18. Optionally, the above first codeword set may include all or part of the codewords in Table 26 below.

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

[0412]

[0413]

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

[0415] It can be understood that in the above various codebook generation methods, different Hadamard matrices can be used to construct different codebooks, but their minimum Hamming distance remains unchanged. It can also be understood that after operations such as column rearrangement, row rearrangement, or element negation of the entire column (element negation means element -1 becomes element 1 and element 1 becomes element -1) on any of the codebooks in Tables 16 to 26 above, another codebook can be obtained, and this another codebook has the same Hamming distance distribution as this codebook.

[0416] To more intuitively understand the minimum Hamming distance between each codeword in the codebooks (i.e., the first codeword set) with different code lengths designed in the embodiments of the present application, the following will be described by means of illustrations. Refer to Figure 10 , Figure 10 which is a schematic diagram of the minimum Hamming distance under different code lengths provided by the embodiments of the present application. As Figure 10 shown, the abscissa represents the code length, and the ordinate represents the minimum Hamming distance. It can be understood that considering the accuracy of the illustration, Figure 10 only the minimum Hamming distance of some code lengths is illustrated, that is, the range of the code length represented by the abscissa is from 20 bits to 40 bits.

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

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

[0419] The above content elaborates in detail the method provided by the present application. To facilitate the implementation of the above solutions of the embodiments of the present application, the embodiments of the present application also provide corresponding devices or equipment.

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

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

[0422] In some embodiments of the present 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 execute the steps or functions performed by the first communication device in the above method embodiments.

[0423] The processing unit 20 is used to generate a PPDU, the PPDU includes a PHR field and a PHY payload field, the PHR field includes first PHR information, and the first PHR information is used to indicate the data rate of the PHY payload field; the transceiver unit 10 is used to send a signal, the signal is generated based on the PPDU, and the signal includes a signal generated according to a code obtained by encoding according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in the first codeword set.

[0424] Among them, the specific descriptions of the PPDU, the first PHR information, the first codeword set, etc. can refer to the method embodiments shown above, and will not be elaborated here one by one.

[0425] It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For the specific functions or steps executed by the transceiver unit and the processing unit, reference can be made to the above method embodiments, and will not be elaborated here. Exemplarily, the transceiver unit 10 can be used to execute Figure 5 the step S102 shown in Figure 8The step S202 shown; the processing unit 20 can be used to execute Figure 5 the step S101 shown or Figure 8 the step S201 shown.

[0426] Multiplex Figure 11 , in some other embodiments of the present application, the communication device may be the second communication device shown above or a chip therein. That is Figure 11 the communication device shown can be used to execute the steps or functions, etc. performed by the second communication device in the above method embodiments.

[0427] The transceiver unit 10 is used to receive a signal, the signal 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 according to a codeword encoded based on the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in a first codeword set; the processing unit 20 is used to decode the signal to obtain the first PHR information, and the first PHR information is used to indicate the data rate of the PHY payload field.

[0428] Among them, specific descriptions of the PPDU, the first PHR information, the first codeword set, etc. can refer to the method embodiments shown above, and will not be elaborated one by one here.

[0429] It can be understood that the specific descriptions of the transceiver unit and the processing unit shown in the embodiments of the present application are only examples. For the specific functions or steps executed by the transceiver unit and the processing unit, reference can be made to the above method embodiments, and will not be elaborated here. Exemplarily, the transceiver unit 10 can be used to receive a signal; the processing unit 20 can be used to execute Figure 5 the step S103 shown or Figure 8 the step S203 shown.

[0430] The communication device of the embodiments of the present application is introduced above. The following introduces possible product forms of the communication device. It should be understood that any product form having the functions of the Figure 11 communication device described above falls within the protection scope of the embodiments of the present application. It should also be understood that the following introduction is only for example, and does not limit the product form of the communication device of the embodiments of the present application to this.

[0431] In a possible implementation manner, Figure 11In the communication device shown, the processing unit 20 may be one or more processors, the transceiver unit 10 may be a transceiver, or the transceiver unit 10 may also be a sending unit and a receiving unit. The sending unit may be a transmitter, and the receiving unit may be a receiver. The sending unit and the receiving unit are integrated into one device, such as a transceiver. In the embodiments of the present application, the processor and the transceiver may be coupled, etc. The embodiments of the present application do not limit the connection manner of the processor and the transceiver. 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 for transmission by the transceiver. After the above information is output by the processor, other processing may be required before it reaches the transceiver. Similarly, the process of receiving information (such as receiving a 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 to the processor. Further, after the transceiver receives the above information, the above information may need to be processed otherwise before being input to the processor.

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

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

[0434] After 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 wirelessly transmitted, after the processor 1001 performs baseband processing on the data to be transmitted, it outputs a baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then transmits the radio frequency signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 1001. The processor 1001 converts the baseband signal into data and processes the data.

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

[0436] Among them, the processor 1001, the transceiver 1002, and the memory 1003 can be connected through a communication bus.

[0437] In one design, the communication device can be used to perform the functions of the first communication device in the foregoing Embodiment 1: The processor 1001 can be used to execute Figure 5 the steps in S101, and / or for other processes of the technology described herein; the transceiver 1002 can be used to execute Figure 5 the steps in S102, and / or for other processes of the technology described herein.

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

[0439] In one design, the communication device can be used to perform the functions of the first communication device in the foregoing Embodiment 2: The processor 1001 can be used to execute Figure 8 the steps in S201, and / or for other processes of the technology described herein; the transceiver 1002 can be used to execute Figure 8 the steps in S202, and / or for other processes of the technology described herein.

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

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

[0442] In any of the above designs, the processor 1001 may store instructions, which may be computer programs. The computer programs run on the processor 1001, and may enable the communication device to perform the method described in the above method embodiment. The computer program may be fixed in the processor 1001, in which case the processor 1001 may be implemented by hardware.

[0443] In one implementation, the communication device may include a circuit that can implement the functions of sending or receiving or communicating in the aforementioned method embodiment. The processor and transceiver described in the present application can be implemented in an integrated circuit (IC), an analog IC, a radio frequency integrated circuit (RFIC), a mixed signal IC, an application specific integrated circuit (ASIC), a printed circuit board (PCB), an electronic device, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), N-type metal oxide semiconductor (nMetal-oxide-semiconductor, NMOS), P-type metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (bipolar junction transistor, BJT), 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 not be restricted by Figure 12 . The communication device may be an independent device or may be part of a larger device. For example, the communication device may be:

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

[0446] (2) A set of one or more ICs, optionally, the IC set may also include storage components for storing data and computer programs;

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

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

[0449] (5) A receiver, a terminal, a smart terminal, a cellular phone, a wireless device, a handheld device, a mobile unit, a vehicle-mounted device, a network device, a cloud device, an artificial intelligence device, and so on;

[0450] (6) Others and so on.

[0451] In another possible implementation, Figure 11 In the shown communication device, the processing unit 20 may be one or more logic circuits, and the transceiver unit 10 may be an input / output interface, or also referred to as a communication interface, or interface circuit, or interface, etc. Or the transceiver unit 10 may also be a sending unit and a receiving unit. The sending unit may be an output interface, and the receiving unit may be an input interface. The sending unit and the receiving unit are integrated into one unit, such as an input / output interface. Refer to Figure 13 , Figure 13 which is another structural schematic diagram of the communication device provided by the embodiment of this application. As Figure 13 shown, Figure 13 the shown communication device includes a logic circuit 901 and an interface 902. That is, the above-mentioned processing unit 20 can be implemented by the logic circuit 901, and the transceiver unit 10 can be implemented by the interface 902. Among them, the logic circuit 901 may be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 902 may be a communication interface, an input / output interface, a pin, etc. Exemplarily, Figure 13It is illustrated by taking the above communication device as a chip as an example. The chip includes a logic circuit 901 and an interface 902. It can be understood that the chip shown in the embodiments of the present application may include a narrowband chip or an ultra-wideband chip, etc., and the embodiments of the present application do not make any limitations. The narrowband chip and the ultra-wideband chip may also be integrated on one device or chip, or may be independent respectively. The embodiments of the present application do not limit the implementation manners of the narrowband chip and the ultra-wideband chip in the device. The steps of transmitting signals as shown above may be executed by the ultra-wideband chip, and whether the remaining steps are executed by the ultra-wideband chip is not limited in the embodiments of the present application.

[0452] In the embodiments of the present application, the logic circuit and the interface may also be coupled to each other. Regarding the specific connection manner between the logic circuit and the interface, the embodiments of the present application do not make any limitations.

[0453] Exemplarily, when the communication device is used to execute the method, function or steps executed by the first communication device in the foregoing method embodiments, the logic circuit 901 is used to generate a PPDU, the PPDU includes a PHR field and a PHY payload field, the PHR field includes first PHR information, and the first PHR information is used to indicate the data rate of the PHY payload field; the interface 902 is used to output a signal, the signal is generated based on the PPDU, and the signal includes a signal generated according to a codeword obtained by encoding according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in the first codeword set.

[0454] Exemplarily, when the communication device is used to execute the method, function or steps executed by the second communication device in the foregoing method embodiments, the interface 902 is used to input a signal, the signal is generated based on a PPDU, the PPDU includes a PHR field and a PHY payload field, the PHR field includes first PHR information, and the signal includes a signal generated according to a codeword obtained by encoding according to the first PHR information, and the codeword includes a codeword corresponding to the first PHR information in the first codeword set; the logic circuit 901 is used to decode the signal to obtain the first PHR information, and the first PHR information is used to indicate the data rate of the PHY payload field.

[0455] It can be understood that the specific descriptions of the PPDU, the first PHR information, the first codeword set, etc. can refer to the first method embodiment shown above, and will not be elaborated here one by one.

[0456] It can be understood that the communication device shown in the embodiments of the present application may implement the method provided in the embodiments of the present application in the form of hardware, or may also implement the method provided in the embodiments of the present application in the form of software, etc., and the embodiments of the present application do not make any limitations in this regard.

[0457] For Figure 13For the specific implementation manners of the various embodiments shown, reference may also be made to the above various embodiments, which will not be elaborated here.

[0458] An embodiment of the present application further provides a wireless communication system, which includes a first communication device and a second communication device, and the first communication device and the second communication device can be used to execute the methods in any of the foregoing embodiments.

[0459] In addition, the present application provides a computer program, which is used to implement the operations and / or processes executed by the first communication device in the method provided by the present application.

[0460] The present application further provides a computer program, which is used to implement the operations and / or processes executed by the second communication device in the method provided by the present application.

[0461] The present application further provides a computer-readable storage medium, in which computer code is stored. When the computer code runs on a computer, the computer is caused to execute the operations and / or processes executed by the first communication device in the method provided by the present application.

[0462] The present application further provides a computer-readable storage medium, in which computer code is stored. When the computer code runs on a computer, the computer is caused to execute the operations and / or processes executed by the second communication device in the method provided by the present application.

[0463] The present application further provides a computer program product, which includes computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processes executed by the first communication device in the method provided by the present application are caused to be executed.

[0464] The present application further provides a computer program product, which includes computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processes executed by the second communication device in the method provided by the present application are caused to be executed.

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

[0466] The unit described as a separation component may or may not be physically separated. The component shown as a unit may or may not be a physical unit, that is, it may be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the technical effects of the solution provided by the embodiments of the present application.

[0467] In addition, each functional unit in the embodiments of the present application may be integrated in a processing unit, may exist separately as individual physical units, or two or more units may be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

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

[0469] As described above, the above are only specific implementation manners of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present application, and all of them should be covered by the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A signal transmission method based on ultra-wideband, characterized in that, it includes: Encoding PHR1 to obtain a coded word after PHR1 encoding, and the coded word after PHR1 encoding maps the combination of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; Sending the coded word after PHR1 encoding.

2. The method according to claim 1, characterized in that, the length of the coded word after PHR1 encoding is 20 bits.

3. The method according to claim 2, characterized in that, the coded word after PHR1 encoding 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 coded word after PHR1 encoding 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 coded word after PHR1 encoding 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 coded word after PHR1 encoding 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 coded word after PHR1 encoding 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 coded word after PHR1 encoding 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 coded word after PHR1 encoding is 11111100001111000011, mapping the combination 7 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The coded word after PHR1 encoding is 00000001011010010110, mapping the combination 8 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The coded word after PHR1 encoding is 00000111111100000000, mapping the combination 9 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The codeword after encoding PHR1 is 00000010101001010101, mapping, the combination 10 of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; The codeword after encoding PHR1 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.

4. The method according to any one of claims 1-3, characterized in that, the PHR1 is in the PHR field of the PPDU, and the PHR field further includes PHR2 for indicating the length of the PHY payload field.

5. The method according to claim 4, characterized in that, the PPDU further includes the PHY payload field.

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

7. A signal transmission method based on ultra-wideband, characterized in that, comprising: receiving the codeword after encoding PHR1, and the codeword after encoding PHR1 maps the combination of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC; obtaining the combination of the data rate of the PHY payload field and whether the PHY payload field is encoded by LDPC according to the codeword after encoding PHR1.

8. The method according to claim 7, characterized in that, the length of the codeword after encoding PHR1 is 20 bits.

9. The method according to claim 8, characterized in that, the codeword after encoding PHR1 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 codeword after encoding PHR1 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 codeword after encoding PHR1 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 codeword after encoding PHR1 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 codeword after encoding PHR1 is 00000111000011110000, mapping, the combination 5 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 00000010010110100101, mapping, the combination 6 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 11111100001111000011, mapping, the combination 7 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 00000001011010010110, mapping, the combination 8 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 00000111111100000000, mapping, the combination 9 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 00000010101001010101, mapping, the combination 10 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC; The codeword after encoding PHR1 is 00000100110000110011, mapping, the combination 11 of the data rate of the PHY payload field and whether the PHY payload field is encoded using LDPC.

10. The method according to any one of claims 7 - 9, wherein, the PHR1 is in the PHR field of the PPDU, and the PHR field further includes PHR2 for indicating the length of the PHY payload field.

11. The method according to claim 10, wherein, the PPDU further includes the PHY payload field.

12. The method according to any one of claims 7 - 11, wherein, 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.

13. A signal transmission device based on ultra - wideband, wherein, it includes a unit for executing the method according to any one of claims 1 - 6.

14. A signal transmission device based on ultra - wideband, wherein, it includes a unit for executing the method according to any one of claims 7 - 12.

15. A computer - readable storage medium, wherein, it is used to store a computer program, and the computer program includes instructions for executing the method according to any one of claims 1 - 6.

16. A computer-readable storage medium, characterized in that, for storing a computer program, the computer program comprising instructions for performing the method according to any one of claims 7-12.

17. A computer program, characterized in that, the computer program comprising instructions for performing the method according to any one of claims 1-6.

18. A computer program, characterized in that, the computer program comprising instructions for performing the method according to any one of claims 7-12.

Images