Punctured bit position determination method, and apparatus
By determining the set of punctured bits, and utilizing the Fast Hadamard Transform and the Maximum Linearly Independent Set, the problem of RM code encoding not supporting flexible puncturing was solved, thus improving communication performance.
Patent Information
- Application Number
- PCT/CN2026/095963
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-16
- Filing Date
- 2026-05-09
- Publication Date
- 2026-11-19
AI Technical Summary
Existing technologies do not support flexible punching during RM code encoding, which leads to reduced communication performance.
By determining the set of punctured bits, and utilizing the output sequence of the Fast Hadamard Transform and the number of maximally linearly independent sets, flexible determination of punctured bits can be achieved.
It improves communication performance, supports flexible punching, and enhances communication efficiency and quality.
Smart Images

Figure CN2026095963_19112026_PF_FP_ABST
Abstract
Description
A method and apparatus for determining punched bit positions
[0001] Cross-reference to related applications
[0002] This application claims priority to Chinese Patent Application No. 202510639951.1, filed on May 16, 2025, entitled "A Method and Apparatus for Determining Punch Bits", the entire contents of which are incorporated herein by reference. Technical Field
[0003] This application relates to the field of mobile communication technology, and in particular to a method and apparatus for determining punched bits. Background Technology
[0004] Reed-Muller (RM) codes are among the oldest, simplest, and most unique error-correcting codes. In mobile communication, the transmitting end can encode information bits using RM codes and transmit the encoded bit sequence. Correspondingly, the receiving end can use a decoding scheme corresponding to the RM code for decoding. When transmission resources and code length do not match, some bits can be removed from the encoded bit sequence without being transmitted; this is known as puncturing.
[0005] Currently, RM codes do not support flexible punching, leading to reduced communication performance. Therefore, how to implement flexible punching when using RM codes is a technical problem that urgently needs to be solved. Summary of the Invention
[0006] This application provides a method and apparatus for determining punched bits, which is used to flexibly punch bits when using RM code for encoding, so as to improve communication performance.
[0007] Firstly, embodiments of this application provide a method for determining punched bits, which can be executed by a first device or a second device. Unless otherwise specified, the "first device" in this application can refer to the first device itself (e.g., a terminal, terminal device, or network device), a component used in the first device (e.g., a functional module, communication module, processor, circuit, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first device. The component used in the first device can be within the first device or independent of it. Similarly, the "second device" in this application can refer to the second device itself, a component used in the second device, or a logic module or software capable of implementing all or part of the functions of the second device. The first device and the second device can be different devices. For example, the first device can be a transmitting device, and correspondingly, the receiving device is the second device. For example, if the first or second device is a terminal, the method described in the first aspect can be applied to the terminal side, such as the terminal or its communication module, or the circuits or chips responsible for communication functions in the terminal (e.g., modem chips, also known as baseband chips, or system-on-chip (SoC) chips or system-in-package (SIP) chips containing modem cores). Similarly, if the first or second device is a network device, the method described in the first aspect can be applied to the network device side, such as the network device or its communication module, or the circuits or chips responsible for communication functions in the network device (e.g., modem chips, or SoC chips or SIP chips containing modem cores).
[0008] Taking the first device as the executing entity as an example, the method includes: the first device obtaining a first number of punched bits; the first device determining a first set of punched bits according to the first number of punched bits and a first correspondence, wherein the first correspondence includes the correspondence between K punched bits and M sets of punched bits, wherein the K punched bits include the first number of punched bits, and the M sets of first punched bits include the first set of punched bits corresponding to the first number of punched bits, wherein K and M are positive integers greater than 1, and M is greater than or equal to K, and the first set of punched bits includes the sequence number of one or more punched bits, and the first set of punched bits is used for punching.
[0009] Based on this implementation, the first device can determine the set of punctured bits according to the first number of punctures and the first correspondence, so as to flexibly puncture according to the number of punctures and improve communication performance. Specifically, the first device can flexibly and efficiently determine the first set of punctured bits corresponding to the first number of punctures based on the first correspondence.
[0010] In one possible implementation, the first set of punched bits is determined based on at least one of the following: the output sequence of the fast Hadamard transform; or, the number of sets of maximally linearly independent groups.
[0011] Based on this implementation, the first set of punctured bits is determined according to the output sequence of the fast Hadamard transform and / or the number of sets of maximally linearly independent groups, which can further improve communication performance.
[0012] Secondly, embodiments of this application provide a method for determining punched bits, which can be executed by a first device or a second device. The first and second devices are described in the first aspect.
[0013] Taking the first device as the executing entity as an example, the method includes: the first device acquiring a first number of punctured bits; the first device determining a first set of punctured bits based on the first number of punctured bits, the first set of punctured bits including the sequence number of one or more punctured bits, the first set of punctured bits being used for puncturing; wherein, the first set of punctured bits is determined based on at least one of the following: the output sequence of the fast Hadamard transform; or, the number of groups of maximally linearly independent sets.
[0014] Based on this implementation, the first device can determine the set of punctured bits according to the first number of punctures and the first correspondence, so as to achieve flexible puncturing based on the number of punctures, thereby improving communication performance. The first set of punctured bits is determined based on the output sequence of the Fast Hadamard Transform and / or the number of groups of maximally linearly independent sets, which can further improve communication performance.
[0015] In one possible implementation, determining the first set of punched bits based on the first number of punched bits includes: determining the first set of punched bits based on the first number of punched bits and a first correspondence; wherein the first correspondence includes the correspondence between K punched bits and M sets of punched bits, the K punched bits include the first number of punched bits, the M sets of first punched bits include the first set of punched bits corresponding to the first number of punched bits, K and M are positive integers greater than 1, and M is greater than or equal to K.
[0016] Based on this implementation method, the first device can flexibly and efficiently determine the first set of punched bits corresponding to the first number of punched bits based on the first correspondence.
[0017] In one possible implementation of the first aspect and / or the second aspect, the first set of punctured bits is determined based on the output sequence of the Fast Hadamard Transform (FUT), including: the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits satisfies at least one of the following: the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to a first threshold; the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of the second peak in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit indices in the second set of punctured bits is equal to the number of punctured bits in the first set of punctured bits; the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits satisfies at least one of the following: the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of the second peak in the output sequence corresponding to the second set of punctured bits; the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of ... The absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence of the Dama Transform is greater than or equal to a second threshold; the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is greater than or equal to the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit indices in the second set of punctured bits is equal to the number of punctured bits in the first set of punctured bits; the number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to a third threshold; or, the number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to the number of secondary peaks in the output sequence corresponding to the second set of punctured bits.
[0018] Based on this implementation, the first set of punctured bits is the set of punctured bits with smaller second peak-to-peak values in the output sequence of the Fast Hadamard Transform, or the set of punctured bits with the same second peak-to-peak value but fewer second peaks, in order to further improve communication performance.
[0019] In one possible implementation of the first aspect and / or the second aspect, the first set of punctured bits is determined based on the number of groups of the maximally linearly independent set, including: the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits satisfies at least one of the following: the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits is greater than or equal to a fourth threshold; or, the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits is greater than or equal to the number of groups of the maximally linearly independent set corresponding to the second set of punctured bits, wherein the number of the indexes of the punctured bits in the second set of punctured bits is the number of the first number of punctured bits.
[0020] Based on this implementation, the first set of punctured bits is a set of punctured bits with a larger number of groups of maximally linearly independent sets, in order to further improve communication performance.
[0021] In one possible implementation of the first aspect and / or the second aspect, the first correspondence includes the correspondence between the M sets of punctured bits and the feature values; wherein any of the feature values includes at least one of the following: the distribution information of peaks in the output sequence of the fast Hadamard transform corresponding to the set of punctured bits; or, the group number information of the maximal linearly independent set corresponding to the set of punctured bits.
[0022] Based on this implementation, it is possible to display the feature values corresponding to the set of punched bits in the first correspondence, which makes it easier to select the set of punched bits with better performance based on the feature values.
[0023] In one possible implementation of the first aspect and / or the second aspect, the M sets of punched bits include a third set of punched bits and a fourth set of punched bits, the third set of punched bits corresponding to the number of punched bits p, the fourth set of punched bits corresponding to the number of punched bits q, where p and q are both positive integers and q ≠ p; the fourth set of punched bits is determined based on the third set of punched bits.
[0024] Based on this implementation, the fourth set of punctured bits in the first correspondence can be determined by nesting the third set of punctured bits to improve the efficiency of rate matching while ensuring communication performance.
[0025] In one possible implementation of the first aspect and / or the second aspect, determining the first set of punched bits based on the first number of punched bits and the first correspondence includes: determining the first set of punched bits based on the third set of punched bits in the M sets of punched bits, wherein the third set of punched bits corresponds to the number of punched bits p, wherein p and q are both positive integers, q≠p, and q is the first number of punched bits.
[0026] Based on this implementation, the first set of punctured bits can be determined by nesting the third set of punctured bits in the first correspondence, thereby improving the efficiency of determining the set of punctured bits while ensuring communication performance. "Nesting" can be understood as the sequence number of a punctured bit in one set being determined by adding and / or subtracting one or more punctured bit indices from the sequence numbers of punctured bits in another set. Therefore, it is not necessary to redetermine all the indices in the punctured bit set; only the indices of the added and / or subtracted punctured bits need to be determined, which improves the efficiency of determining the set of punctured bits. For example, if the first set of punctured bits does not contain the set of punctured bits corresponding to the number of punctured bits q, the first device can determine the first set of punctured bits by nesting the third set of punctured bits corresponding to the number of punctured bits p in the first correspondence.
[0027] In one possible implementation of the first and / or second aspect, when p is less than q, the intersection of the third set of punctured bits and the first set of punctured bits is the third set of punctured bits; when p is greater than q, the intersection of the third set of punctured bits and the first set of punctured bits is the first set of punctured bits. The intersection of multiple sets of punctured bits is a set consisting of identical elements from the multiple sets of punctured bits.
[0028] Alternatively, it can be said that when p is less than q, the intersection of the third set of punctured bits and the fourth set of punctured bits in the first correspondence is the third set of punctured bits; when p is greater than q, the intersection of the third set of punctured bits and the fourth set of punctured bits in the first correspondence is the fourth set of punctured bits.
[0029] Based on this implementation, when the set of punched bits is determined through nesting, optionally, the intersection of the set of punched bits determined through nesting and the set of punched bits with fewer punched bits is the set of punched bits among the two sets. The set of punched bits determined through nesting may include, for example, a first set of punched bits and / or a fourth set of punched bits; the nested set of punched bits may include, for example, a third set of punched bits.
[0030] In one possible implementation of the first and / or second aspect, when p is less than q, p and q satisfy at least one of the following: q belongs to the nested punch number set, and p = q - 1; or, p belongs to the nested punch number set, q does not belong to the nested punch number set, and p is the maximum value among the elements less than q in the nested punch number set. Alternatively, when p is greater than q, p and q satisfy at least one of the following: q belongs to the nested punch number set, and p = q + 1; or, p belongs to the nested punch number set, q does not belong to the nested punch number set, and p is the minimum value among the elements greater than q in the nested punch number set.
[0031] Based on this implementation, the set of punctured bits can be determined by nesting based on the set of nested punctured bit positions. The set of nested punctured bit positions includes one or more punctured bit positions, and the set of punctured bits corresponding to any punctured bit position in the set of nested punctured bit positions is determined by nesting the set of punctured bits corresponding to the punctured bit position closest to the punctured bit position in the set of nested punctured bit positions. The set of nested punctured bit positions can be predefined, preconfigured, or indicated by the network device via signaling. The set of nested punctured bit positions can also have other names, which are not limited in this application.
[0032] Therefore, when the number of punched bits q belongs to a nested set of punched bits, the set of punched bits corresponding to the number of punched bits q can be determined by nesting the set of punched bits corresponding to the previous punched bit number q. This achieves efficient determination of the set of punched bits and improves the efficiency of rate matching. Specifically, when determining the set of punched bits in a nested manner from fewest to most punched bits, that is, when p is less than q, the previous punched bit number p of punched bit number q satisfies: p = q - 1. When determining the set of punched bits in a nested manner from most to least punched bits, that is, when p is greater than q, the previous punched bit number p of punched bit number q satisfies: p = q + 1.
[0033] When the number of punched bits q does not belong to the nested set of punched bits (or, in other words, q belongs to the non-nested set of punched bits), the set of punched bits corresponding to the number of punched bits q can be determined based on the set of punched bits p that is closest to the number of punched bits q in the nested set of punched bits. This achieves efficient determination of the set of punched bits and improves the efficiency of rate matching. Specifically, when determining the set of punched bits in a nested manner from fewest to most punched bits (i.e., when p is less than q), the punched bit p that is closest to the number of punched bits q is the maximum value among the elements less than q in the nested set of punched bits. Conversely, when determining the set of punched bits in a nested manner from most to least punched bits (i.e., when p is greater than q), the punched bit p that is closest to the number of punched bits q is the minimum value among the elements greater than q in the nested set of punched bits.
[0034] In one possible implementation of the first aspect and / or the second aspect, the method further includes: a first device receiving indication information of the nested punch number set.
[0035] Based on this implementation method, the set of nested punch numbers can be determined flexibly and efficiently.
[0036] In one possible implementation of the first aspect and / or the second aspect, the method further includes: a first device receiving indication information of the first correspondence.
[0037] Based on this implementation method, the first correspondence can be determined flexibly and efficiently.
[0038] Thirdly, a communication device is provided. The device can implement the methods described in any one of the first to second aspects and any possible implementation thereof. The device possesses the functions of the first or second device described above. The device is, for example, a terminal device, a functional module within a terminal device, or a network device or a functional module or component within a network device (e.g., a functional module, communication module, processor, circuit, chip, or chip system, etc.).
[0039] In one optional implementation, the device may include modules corresponding one-to-one with the methods / operations / steps / actions described in any of the first to second aspects and any possible implementations thereof. These modules may be hardware circuits, software, or a combination of hardware circuits and software. In another optional implementation, the device includes a processing unit (sometimes also called a processing module) and a communication unit (sometimes also called a transceiver module, communication module, etc.). The transceiver unit is capable of both sending and receiving functions. When the transceiver unit performs the sending function, it may be called a sending unit (sometimes also called a sending module); when it performs the receiving function, it may be called a receiving unit (sometimes also called a receiving module). The sending unit and the receiving unit may be the same functional module, referred to as the transceiver unit, which performs both sending and receiving functions; or, the sending unit and the receiving unit may be different functional modules, with the transceiver unit being a collective term for these functional modules.
[0040] For example, when the apparatus is used to perform the method described in any one of the first to second aspects, the apparatus may include a communication unit and a processing unit.
[0041] When executing the method shown in the first aspect, the processing unit can be used to obtain a first number of punctured bits; the first device determines a first set of punctured bits based on the first number of punctured bits and a first correspondence, the first correspondence including the correspondence between K punctured bits and M sets of punctured bits, the K punctured bits including the first number of punctured bits, the M sets of first punctured bits including the first set of punctured bits corresponding to the first number of punctured bits, K and M being positive integers greater than 1, and M being greater than or equal to K, the first set of punctured bits including the sequence number of one or more punctured bits, and the first set of punctured bits being used for punching. Optionally, the communication unit can be used to perform punching.
[0042] In one possible implementation, the first set of punched bits is determined based on at least one of the following: the output sequence of the fast Hadamard transform; or, the number of sets of maximally linearly independent groups.
[0043] When performing the method shown in the second aspect, the processing unit may be used to obtain a first number of puncture bits; the first device determines a first set of punctured bits based on the first number of puncture bits, the first set of punctured bits including the indices of one or more punctured bits, the first set of punctured bits being used for puncturing; wherein the first set of punctured bits is determined based on at least one of the following: the output sequence of the fast Hadamard transform; or, the number of groups of maximally linearly independent sets. Optionally, the communication unit may be used to perform puncturing.
[0044] In one possible implementation, determining the first set of punched bits based on the first number of punched bits includes: determining the first set of punched bits based on the first number of punched bits and a first correspondence; wherein the first correspondence includes the correspondence between K punched bits and M sets of punched bits, the K punched bits include the first number of punched bits, the M sets of first punched bits include the first set of punched bits corresponding to the first number of punched bits, K and M are positive integers greater than 1, and M is greater than or equal to K.
[0045] In one possible implementation, the first set of punctured bits is determined based on the output sequence of the Fast Hadamard Transform (FUT), including: the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits satisfies at least one of the following: the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to a first threshold; the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of the second peak in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit indices in the second set of punctured bits is equal to the number of punctured bits in the first set of punctured bits; the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits satisfies at least one of the following: the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of the second peak in the output sequence corresponding to the second set of punctured bits; the distribution of peaks in the output sequence of the FUT corresponding to the first set of punctured bits satisfies at least one of the following: the peak-to-peak value of the second peak in the output sequence of the FUT corresponding to the first set of punctured bits is less than or equal to the peak-to-peak value of the second peak in the output sequence of ... The absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence is greater than or equal to a second threshold; the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is greater than or equal to the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit indices in the second set of punctured bits is equal to the number of punctured bits in the first set of punctured bits; the number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to a third threshold; or, the number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to the number of secondary peaks in the output sequence corresponding to the second set of punctured bits.
[0046] In one possible implementation, the first set of punctured bits is determined based on the number of groups of the maximally linearly independent set, including: the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits satisfies at least one of the following: the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits is greater than or equal to a fourth threshold; or, the number of groups of the maximally linearly independent set corresponding to the first set of punctured bits is greater than or equal to the number of groups of the maximally linearly independent set corresponding to the second set of punctured bits, wherein the number of punctured bit indices in the second set of punctured bits is the number of punctured bits.
[0047] In one possible implementation, the first correspondence includes the correspondence between the M sets of punctured bits and the feature values; wherein any of the feature values includes at least one of the following: the distribution information of peaks in the output sequence of the fast Hadamard transform corresponding to the set of punctured bits; or, the group number information of the maximal linearly independent set corresponding to the set of punctured bits.
[0048] In one possible implementation, the M punched bit sets include a third punched bit set and a fourth punched bit set, the third punched bit set corresponding to the number of punched bits p, and the fourth punched bit set corresponding to the number of punched bits q, where p and q are both positive integers and q ≠ p; the fourth punched bit set is determined based on the third punched bit set.
[0049] In one possible implementation, determining the first set of punched bits based on the first number of punched bits and the first correspondence includes: determining the first set of punched bits based on the third set of punched bits in the M sets of punched bits, wherein the third set of punched bits corresponds to the number of punched bits p, wherein p and q are both positive integers, q≠p, and q is the first number of punched bits.
[0050] In one possible implementation, when p is less than q, the intersection of the third set of punched bits and the first set of punched bits is the third set of punched bits; when p is greater than q, the intersection of the third set of punched bits and the first set of punched bits is the first set of punched bits.
[0051] Alternatively, it can be said that when p is less than q, the intersection of the third set of punctured bits and the fourth set of punctured bits in the first correspondence is the third set of punctured bits; when p is greater than q, the intersection of the third set of punctured bits and the fourth set of punctured bits in the first correspondence is the fourth set of punctured bits.
[0052] In one possible implementation, when p is less than q, p and q satisfy at least one of the following: q belongs to the nested punch number set and p = q-1; or, p belongs to the nested punch number set, q does not belong to the nested punch number set, and p is the maximum value among the elements less than q in the nested punch number set.
[0053] In one possible implementation, when p is greater than q, p and q satisfy at least one of the following: q belongs to the nested punch number set and p = q + 1; or, p belongs to the nested punch number set and q does not belong to the nested punch number set, and p is the minimum value among the elements greater than q in the nested punch number set.
[0054] In one possible implementation, the communication unit can also be used for: the first device receiving indication information of the nested punch number set.
[0055] In one possible implementation, the communication unit may also be used to: receive indication information of the first correspondence.
[0056] The aforementioned communication device may be a terminal, a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip (also known as a baseband chip) or a SoC or SIP chip containing a modem module.
[0057] Fourthly, embodiments of this application also provide a communication device, including a processor for executing a computer program (or computer-executable instructions) stored in a memory, which, when executed, causes the device to perform the method as described in any one of the first to second aspects and any possible implementation thereof.
[0058] In one possible implementation, the processor and memory are integrated together;
[0059] In another possible implementation, the memory is located outside the communication device.
[0060] The communication device also includes a communication interface for communicating with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.
[0061] The aforementioned communication device may be a terminal, a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip (also known as a baseband chip) or a SoC or SIP chip containing a modem module.
[0062] Fifthly, this application provides a communication device comprising a memory and one or more processors. The memory stores part or all of the necessary computer programs or instructions for implementing the functions described in the first aspect above. The one or more processors are capable of executing the computer programs or instructions, which, when executed, cause the communication device to implement the methods in any possible design or implementation of the first aspect above.
[0063] In one possible design, the communication device may further include an interface circuit, through which the processor communicates with other devices or components.
[0064] The aforementioned communication device may be a terminal, a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip (also known as a baseband chip) or a SoC or SIP chip containing a modem module.
[0065] A sixth aspect provides a computer-readable storage medium for storing a computer program or instructions that, when executed, cause the method described in any of the first to second aspects and any possible implementations thereof, and the method shown in any possible implementations thereof, to be implemented.
[0066] A seventh aspect provides a computer program product containing instructions that, when run on a computer, enables the method described in any of the first to second aspects and any possible implementation thereof to be implemented.
[0067] Eighthly, embodiments of this application also provide a communication device for performing the method described in any one of the first to second aspects and any possible implementation thereof.
[0068] Ninthly, a chip system is provided, comprising logic circuitry (or, as understood, a processor, which may include logic circuitry, etc.), and further comprising input / output interfaces. The input / output interfaces can be used to input messages or to output messages. The input / output interfaces can be the same interface, i.e., the same interface can implement both sending and receiving functions; or, the input / output interface includes an input interface and an output interface, the input interface being used to implement the receiving function, i.e., to receive messages; and the output interface being used to implement the sending function, i.e., to send messages. The logic circuitry can be used to perform operations other than the sending and receiving functions in the methods described in any of the first to second aspects and any possible implementations thereof; the logic circuitry can also be used to transmit messages to the input / output interfaces or to receive messages from other communication devices from the input / output interfaces. The chip system can be used to implement the methods described in any of the first to second aspects and any possible implementations thereof. The chip system can be composed of chips or can include chips and other discrete devices.
[0069] Optionally, the chip system may also include a memory, which can be used to store instructions, and the logic circuits can call the instructions stored in the memory to implement the corresponding functions.
[0070] In a tenth aspect, a communication method is provided, which may include the method implemented by a first device as shown in the first aspect and any possible implementation thereof, and the method implemented by a second device as shown in the second aspect and any possible implementation thereof.
[0071] Eleventhly, a communication system is provided, which may include a first device and a second device. The first device may be used to implement the method shown in the first aspect and any possible implementation thereof, and the second device may be used to implement the method shown in the second aspect and any possible implementation thereof.
[0072] The technical effects brought about by the third to eleventh aspects above can be found in the descriptions of the beneficial effects of the corresponding solutions in the first and second aspects above, and will not be repeated here. Attached Figure Description
[0073] Figure 1 is a schematic diagram of the architecture of a wireless communication system;
[0074] Figure 2 is a schematic diagram of an air interface transmission process;
[0075] Figure 3 is a schematic diagram of a base for an RM code;
[0076] Figure 4 is a schematic diagram of an FHT operation;
[0077] Figure 5 is a flowchart illustrating a method for determining punched bits according to an embodiment of this application;
[0078] Figures 6a to 6d are schematic diagrams of communication scenarios applicable to the embodiments of this application;
[0079] Figures 7 and 8 are schematic diagrams of the communication device provided in the embodiments of this application. Detailed Implementation
[0080] The embodiments of this application will now be described in detail with reference to the accompanying drawings.
[0081] The following describes the communication system architecture to which the encoding and decoding methods provided in this application are applicable. It should be noted that this description is for the convenience of those skilled in the art and is not intended to limit the scope of protection claimed in this application.
[0082] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, wireless fidelity, Wi-Fi, Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4G mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, 5G mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, without limitation. This application describes the communication system shown in Figure 1 as an example. When applying the technical solution of this application to other communication systems, the devices, components, modules, etc. in the embodiment can be replaced with corresponding devices, components, modules in other communication systems without limitation.
[0083] Figure 1 is a schematic diagram of the architecture of the communication system applied in the embodiments of this application. As shown in Figure 1, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as 110a and 110b in Figure 1, and may also include at least one terminal device, such as 120a-120j in Figure 1. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop computer, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example, the mobile phones in Figure 1 are 120a, 120e, 120f and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can access micro-station 110b, connect to laptop 120g and printer 120h. Mobile phone 120j can control drone 120i.
[0084] The communication system provided in this application may also include artificial intelligence (AI) network elements to implement some or all AI-related operations. AI network elements can also be referred to as AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI network elements may be built into the network elements of the communication system. For example, an AI network element may be an AI module built into access network equipment, core network equipment, cloud servers, or operation, administration, and maintenance (OAM) equipment to implement AI-related functions. The OAM equipment may act as the network management system for core network equipment and / or access network equipment. Alternatively, the AI network element may be an independently configured network element in the communication system. Optionally, the terminal or its built-in chip may also include an AI entity to implement AI-related functions.
[0085] (1) Network equipment
[0086] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device within a radio access network (RAN) that provides wireless communication functionality to terminal devices; this is called a RAN device. The RAN can be an access network in 3GPP, such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.
[0087] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.
[0088] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) protocol and the packet data convergence protocol (PDCP) protocol of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into the CU control plane (CP) (i.e., CU-CP) and the CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the radio link control (RLC) layer and the medium access control (MAC) layer of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. The CU and DU can be set up separately, or they can be included in the same network element, such as in the baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. RAN equipment can be a macro base station (as shown in Figure 1, 110a), a micro base station or an indoor station (as shown in Figure 1, 110b), or a relay node or donor node, etc. The embodiments of this application do not limit the specific technology or equipment form used in the network equipment.
[0089] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.
[0090] (2) Terminal equipment
[0091] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. They can be widely used in various scenarios, such as D2D communication, V2X communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be mobile phones, tablets, computers with wireless transceiver capabilities, wearable devices, vehicle devices (such as vehicle units, in-vehicle modules, in-vehicle chips, on-board units (OBUs) or telematics boxes (T-BOXs), etc.), drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, satellite terminals, Internet of Things (IoT) terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability UE (REDCAP UE), etc. In the embodiments of this application, the device used to implement the functions of the terminal device can be the terminal device itself, or a device capable of supporting the terminal device in implementing that function, such as a chip system or a combination of devices or components capable of implementing the functions of the terminal device. This device can be installed in the terminal device. The embodiments of this application do not limit the specific technology or specific device form used in the terminal device.
[0092] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device containing the functions of the terminal device.
[0093] Network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.
[0094] The roles of network devices and terminal devices can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device. That is, 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol. In this case, relative to 110a, 120i is also a network device. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with network device functions, and 120a-120j in Figure 1 can be called communication devices with terminal device functions.
[0095] Network devices and terminal devices, network devices and network devices, and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.
[0096] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.
[0097] The following is an explanation of the relevant terms used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.
[0098] (1) Information bit sequence
[0099] An information bit sequence refers to a sequence of bits to be transmitted. For example, if the bits to be transmitted are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the resulting information bit sequence is 10101100101. In this application, the length of the information bit sequence can represent the number of information bits to be transmitted. The information bits may include payload bits. Optionally, the information bits may also include check bits, such as cyclic redundancy check (CRC) bits.
[0100] For the communication system architecture shown in Figure 1, air interface transmission can be performed between terminal devices and network devices. Taking network devices as an example, air interface transmission includes uplink transmission and downlink transmission, as shown in the air interface transmission process in Figure 2. For downlink transmission: the network device sequentially encodes, modulates, maps, precodes, frames, and performs inverse fast fourier transform (IFFT) on layer 2 (L2) data, and processes it into a signal to be transmitted over the air interface through the intermediate radio frequency (IRF) module. For uplink transmission: the network device processes the received signal through the IRF module to obtain baseband data, and then performs inverse fast fourier transform (FFT), deframes, equalizes, demaps, demodulates, and decodes to complete the physical layer signal processing.
[0101] (2) Reed Müller (RM) code
[0102] Rectifying (RM) codes are among the oldest, simplest, and most unique error-correcting codes. They possess unique and rich structural characteristics and have been widely studied in fields such as wireless communication, computer science, cryptography, and discrete mathematics. RM codes can be modeled and represented in various ways, such as using finite geometry, polynomial rings, or Boolean functions. This paper introduces a definition of RM codes based on polynomial rings:
[0103] Binary RM codes contain multivariate polynomials in the binary field. The evaluation results are as follows. Consider a polynomial ring with m variables. For a polynomial and a binary vector Define Eval z (f)=f(z1,z2,…,z m Let f be the value of the polynomial f in the binary vector z. Based on this, the evaluation vector of the polynomial f can be defined. That is, a coordinate of Eval(f) is the evaluation result of the polynomial f at a certain binary vector. Since The CCP has 2 m There are m-dimensional binary vectors, therefore the evaluation vector Eval(f) has a total of 2 m Each dimension. For an RM code with parameters m and r, its codeword set can be defined as the set of evaluation vectors of all polynomials of order no higher than r, i.e., the RM code can be represented as:
[0104] Here, deg(f) represents the order of the polynomial f. Without ambiguity, parameter m can be called the code length parameter of the RM(m,r) code (or the first parameter of the RM code), and parameter r can be called the order of the RM(m,r) code (or the second parameter of the RM code).
[0105] According to the above definition, the number of information bits K in an RM(m,r) code is the number of m-ary binary monomials, which can be expressed as: in This represents the number of combinations. Furthermore, the generator matrix of the RM(m,r) code can be obtained from the evaluation vector of the monomial. For example, for m=3 and r=2, the generator matrix of the corresponding RM code can be written as:
[0106] From the generator matrix G of the RM code, its inverse matrix G can be easily obtained. -1 Thus, for any valid RM codeword x∈RM(m,r), using G -1 The corresponding information bit u = xG can be obtained immediately. -1 .
[0107] Another way to define the RM code generation matrix is the recursive generation matrix of RM codes, which utilizes the recursive property of RM codes. For any valid codeword x of RM(m,r), this codeword can be divided into a first half and a second half, for example, x = (x1,x2). Then x1,x2 ∈ RM(m-1,r), and... Suppose that the generating matrix of RM(m,r) is represented as G. m,r (It can also be represented as G(m,r)). When the information sequence is u, the corresponding generated RM codeword sequence is x = u·G. m,r Based on the aforementioned recursive properties of RM codes, the generator matrix G can be... m,r Decomposed into the following form:
[0108] Among them, G m,r In this context, 0 generally refers to a matrix consisting entirely of zeros, and its dimension is the same as G. m-1,r-1The sizes are the same. For some special cases where m and r are special code types, their generator matrices can be easily written. For example, consider the following two special cases:
[0109] Example 1: r = 0. In this case, the RM code corresponds to a 1-bit repeat code, which means that the 1-bit information bit is repeated twice. m Therefore, the generator matrix of the RM code with r=0 is 1 row and 2 columns. m A matrix of all 1s in each column;
[0110] Example 2: r = m. The RM code in this case corresponds to a code rate of 1. Therefore, the generator matrix of this RM code with r = m is of size 2. m The identity matrix.
[0111] Based on the two generator matrices of RM codes described above and the recursive definition of generator matrices, the generator matrix of any RM code can be easily obtained. For example, for the RM(3,1) code, it is known that the RM(3,1) code can be composed of RM(2,0) codes and RM(2,1) codes; and the RM(2,1) code can be composed of RM(1,0) codes and RM(1,1) codes. Therefore, the generator matrix of RM(3,1) can be:
[0112] The RM code generation matrix defined in the above manner can be called a recursive generation matrix.
[0113] In the control channel coding of the 5G NR protocol, if the number of control channel information bits is greater than or equal to 3 and less than or equal to 11, the RM code is used to encode the control information. Specifically, when the number of information bits is greater than or equal to 3 and less than or equal to 11, the basis shown in Figure 3 is used to encode the information bits, and the resulting codeword length is 32 bits. Each column of M in Figure 3... i It's a base, using the input information bits u k With substrate M k Multiply them, and then perform a bitwise XOR operation on the product of all information bits and the corresponding basis to obtain the encoded codeword bits. The basis of the first 6 columns in Figure 3 are the 6 basis of the RM(5,1) code.
[0114] (3) Characteristics of RM codes
[0115] RM codes have many important characteristics that greatly aid in their decoding algorithms. For example, the characteristics of RM codes can be summarized as follows:
[0116] 1) Automorphic permutation property of RM codes:
[0117] For a valid codeword x of RM(m,r), its 2 m The bits of a codeword can be represented by an m-dimensional binary vector z = (z1, ..., z2). mUse ) as the index. For any binary full-rank matrix and vectors Define coordinate transformation That is, placing the bit at position z of codeword x into Position, thus obtaining a new length of 2 m The code This yields the RM code after automorphic permutation.
[0118] 2) Decomposition properties of RM codes:
[0119] For any valid codeword x of RM(m,r) (or any of its automorphic permutation codewords) See property 1 above, this codeword can be divided into a first half and a second half: x = (x1, x2). At this point, x1, x2 ∈ RM(m-1, r), and (for automorphic permutation codewords) ).
[0120] 3) Projective properties of RM codes:
[0121] definition Let be an s-dimensional subspace of an m-dimensional binary vector space, denoted as . It is a subspace The set of all cosets, i.e. In particular, There are 2 in the middle m-s A coset. Define an RM codeword y in a subspace. The projection of the subspace is but
[0122] (4) Decoding algorithm for RM code
[0123] Taking first-order RM code encoding as an example, the Fast Hadamard Transform (FHT) decoding algorithm is mainly an efficient decoding algorithm for first-order RM codes. As shown in Figure 4, the FHT operation can be represented by a recursive butterfly operator:
[0124] When the butterfly operator has a length of 2, the operation at the first node is the sum of the two input values (represented by "+" in Figure 4), and the operation at the second node is the subtraction of the second input from the first input (represented by "-" in Figure 4). When the butterfly operator has a length of N, the j-th input and the (j+N / 2)-th input are added to obtain the output of the j-th node at the output end of the butterfly operator, and the j-th input and the (j+N / 2)-th input are subtracted to obtain the output of the (j+N / 2)-th node at the output end of the butterfly operator. In Figure 4, the dots on the left represent the sequence before decoding, that is, multiple bits of the information to be decoded; the dots on the right represent the decoded output sequence.
[0125] In the case where no holes are punched or the number of holes is 0, N is an integer power of 2, so N / 2 is divisible by 2.
[0126] When the number of punched holes is a positive integer, the input value corresponding to the punched hole number is set to 0, and the FHT decoding operation can be performed in the following two ways:
[0127] Method a: The input value of 0 at the punch position participates in the butterfly operator operation. For example, when N=8 and the j=0th input value is 0, the output of the 0th node of the butterfly operator is obtained by adding the 0th input value and the 4th input value, and the output of the 4th node of the butterfly operator is obtained by subtracting the 0th input value and the 4th input value.
[0128] In method b, the input value of 0 at the punch position does not participate in the butterfly operator operation. In this case, the butterfly operator operation length does not have to be an integer power of 2, but the decoding result is the same as in method a. For example, when N=8, the number of punch positions is 1, and the butterfly operator operation length is 8-1=7. The output value of the output node depends on the index of the input node, which changes according to the influence of the punch position and the number of punch positions on the index of the input node in method a.
[0129] The decoding results of method a and method b can be considered equivalent.
[0130] For an 8-point FHT operation, which includes log28 levels of butterfly operator operations, the first level is an 8-point butterfly operator, whose output is the input of two 4-point butterfly operators in the next level. The output of the second-level operator is then used as the input of four butterfly operators in the third level. After the three levels of calculation are completed, the entire output is obtained.
[0131] Similarly, an N-point FHT operation contains log2N level butterfly operator operations.
[0132] During decoding, the log-likelihood ratio (Log-LLR) of each transmitted bit can be extracted from the modulated symbol energy. After FHT (Focused Hyper-Hyper-Temperature) operation, a score value for each information codeword z(z1, z2, z3) can be obtained. By comparing the absolute values of the score values, the z with the largest score value is the maximum likelihood decoding result. Furthermore, z0 is determined based on the sign of the score. For example, when the score is greater than or equal to 0, z0 = 0; conversely, when the score is less than 0, z0 = 1.
[0133] For example, using RM(3,1) to encode a 4-bit information sequence z = (z0, z1, z2, z3) results in the following encoding matrix:
[0134] The FHT decoding result is output at the decoding end at 8 nodes. The rating value.
[0135] FHT decoding is the most commonly used decoding algorithm for first-order RM codes due to its efficient hardware implementation and maximum likelihood decoding performance.
[0136] (5) Rate matching
[0137] Due to air interface resource limitations, the encoded codeword cannot carry all information bits. Therefore, a rate matching process is needed to remove some bits from the encoded bit sequence. The modulated bit sequence after removing some bits can then be modulated to obtain a modulation sequence, which is then used for subsequent transmission steps. Rate matching ensures that the length of the modulation sequence meets the air interface resource length constraints.
[0138] The rate matching method will be further explained below.
[0139] Punching: Punching refers to directly creating holes in certain bit positions within the encoded bit sequence without transmitting them. This method generates bit sequences of arbitrary length to meet air interface resource constraints. On the decoding side, since there is no information at the corresponding punctured positions, the LLR of the corresponding bit is set to 0.
[0140] Shortening: Shortening involves fixing certain bit positions in the encoded bit sequence so that they do not need to be transmitted. On the decoding side, since the corresponding "shortened" positions are known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity.
[0141] Repetition: "Repetition" refers to obtaining a longer bit sequence by repeatedly sending a portion of the encoded bit sequence.
[0142] In this application, "punch bit" or "punch bit position" refers to the bit that needs to be removed from the encoded bit sequence by punching holes; "punch bit number" refers to the number of punch bits, that is, the number of bits that need to be removed from the encoded bit sequence by punching holes.
[0143] Currently, RM code encoding does not support flexible determination of punch bit positions. Therefore, in some scenarios, it is impossible to reasonably determine the information bit with the best decoding performance based on air interface resources, which will lead to a reduction in transmission performance.
[0144] To address the aforementioned issues, this application provides corresponding solutions.
[0145] The method for determining punctured bits provided in the embodiments of this application is described in detail below. Figure 5 is a schematic flowchart of a method for determining punctured bits provided in an embodiment of this application. This method can be executed by a first device and / or a second device. Unless otherwise specified, the "first device" in this application can refer to a first device (e.g., a terminal or access network device), a component of the first device (e.g., a processor, a chip (such as a modem chip, or a SoC chip or SIP chip containing a modem core, etc.), or a chip system, or a logic module or software that can implement all or part of the functions of the first device. A component can also be replaced by a device or function. The component can be located in the first device. In addition, the "second device" in the embodiments of this application can refer to a second device (e.g., a terminal or access network node), a component of the second device (e.g., a processor, a chip (such as a modem chip, or a SoC chip or SIP chip containing a modem core, etc.), or a chip system, or a logic module or software that can implement all or part of the functions of the second device. A component can also be replaced by a device or function. The component can be located in the second device.
[0146] In this application, the first device can act as a transmitting side or an encoding side, and the second device can act as a receiving side or a decoding side. For example, the first device or the first equipment can send information or data to the second device or the second equipment. Specifically, during uplink communication, the first equipment can be a terminal, and the second equipment can be an access network device; during downlink communication, the first equipment can be an access network device, and the second equipment can be a terminal. Furthermore, this application does not exclude applications in terminal-to-terminal communication scenarios, in which case the transmitting device and the receiving device can each be a terminal.
[0147] It is understood that the method for determining punctured bits provided in this application can be applied to various mobile communication scenarios. The first device and the second device can be a terminal device and a network device in the mobile communication scenario, respectively. For example, the mobile communication scenario between a network device and a terminal device as shown in Figure 6a, or the dual connectivity (DC) scenario between multiple network devices and terminal devices as shown in Figure 6b, or the multi-hop single-connection scenario between a network device and a terminal device as shown in Figure 6c, or the multi-hop multi-connection scenario between a network device and a terminal device as shown in Figure 6d. It is understood that Figures 6a to 6d are merely illustrative examples of several possible mobile communication scenarios and do not constitute a limitation on the mobile communication scenarios to which this application applies. The mobile communication scenarios to which this application is applicable may include, but are not limited to, scenarios where one or more network-side devices transmit signals to one or more terminal devices, such as network devices transmitting signals to terminal devices, network devices transmitting signals to relay devices, relay network devices transmitting signals to terminal devices, multiple network devices transmitting signals to one terminal device, or multiple network devices transmitting signals to multiple terminal devices.
[0148] For example, the first device can be a network device as shown in Figure 1 (e.g., network device 110a), and the second device can be a terminal device as shown in Figure 1 (e.g., terminal device 120a). Alternatively, the first device can be a terminal device as shown in Figure 1 (e.g., terminal device 120a), and the second device can be a network device as shown in Figure 1 (e.g., network device 110a).
[0149] Figure 5 illustrates a flowchart of a method for determining punctured bits according to an embodiment of this application. This method is applicable to the communication system architecture shown in Figure 1. As shown in Figure 5, the method includes:
[0150] S101: The first device obtains the first number of holes.
[0151] The number of puncture bits refers to the number of bits that need to be punched. The number of puncture bits can be determined based on the size of the air interface resources.
[0152] For example, the air interface resource size can refer to the total number of air interface resources, N′. RE The total number of REs for air interface resources can be determined by the number of allocated physical resource blocks (PRBs) and the number of valid REs on each PRB. For example, the total number of REs for air interface resources is the product of the number of allocated PRBs and the number of valid REs on each PRB.
[0153] Furthermore, the modulation order and the total number of REs in the air interface resources can be used to determine the number of transmitted bits E, where E is the product of the modulation order and the total number of REs in the air interface resources. The number of transmitted bits E can also be called the code length after rate matching. That is, after rate matching, the codeword length is E. For example, the mother code length of RM code encoding is N, and correspondingly, the code length after rate matching is E, which is also the number of punctures NE. Based on RM code encoding, the number of punctures can be denoted as 2. m -E, where m is the code length parameter.
[0154] S102: The first device determines the first set of punched bits based on the first number of punched bits.
[0155] In this application, the first set of punctured bits may include the sequence number of one or more punctured bits, that is, the bit corresponding to the sequence number is used as the punctured bit. The first set of punctured bits is used for puncturing. For example, in the rate matching process, the bit corresponding to the sequence number in the first set of punctured bits is used as the punctured bit or the shortened bit.
[0156] Based on this implementation, the first set of punctured bits in this application can be determined according to the first number of punctures, thus enabling flexible determination of the punctured bit set. The number of punctures can be determined based on the air interface resource size; therefore, the above method can determine the punctured bit set based on the air interface resource size. Subsequently, after encoding, puncturing can be performed based on the first set of punctured bits to meet the air interface resource limitations on code length.
[0157] For example, for a first-order RM code with m=4, when the first puncture bit is 10, the first puncture bit set can be [6,12,5,11,13,9,15,0,1,14]. That is, the bits with indices 6,12,5,11,13,9,15,0,1 and 14 need to be punctured, i.e., these bits are used as puncture bits.
[0158] In one possible embodiment, the first device can determine the first set of punctured bits based on the first number of punctures and a first correspondence. The first device can obtain, store, maintain, and / or manage the first correspondence, and after determining the first number of punctures, determine the first set of punctured bits based on the first number of punctures and the correspondence. Therefore, the first set of punctured bits corresponding to the first number of punctures can be determined flexibly and efficiently.
[0159] The first correspondence is described below.
[0160] In this application, the first correspondence can be a correspondence between the number of punched bits and the set of punched positions. This first correspondence includes at least a correspondence between the first number of punched bits and the first set of punched bits.
[0161] As an example, the first correspondence includes the correspondence between K punched bits and M punched bit sets, where K and M are positive integers greater than 1, and M is greater than or equal to K.
[0162] The K punch numbers include the first punch number. Optionally, the K punch numbers may also include one or more punch numbers, which are not equal to the first punch number.
[0163] The set of M punctured bits may include a first set of punctured bits. Optionally, the set of M punctured bits may also include one or more sets of punctured bits that are different from the first set of punctured bits.
[0164] Optionally, in the first correspondence, any one of the M punched bit sets can correspond to a single punched bit number; any one of the K punched bit numbers can correspond to one or more punched bit sets. Taking the first punched bit number as an example, the first punched bit number can correspond to the first punched bit set, and optionally, it can also correspond to other punched bit sets.
[0165] The first correspondence is explained below using the correspondence between the number of punched bits and the set of punched bits shown in Table 1. As shown in Table 1,
[0166] Table 1
[0167] Table 1 above is an example of the correspondence between the number of punched bits and the set of punched bits, and should not be construed as an exhaustive list of all implementations in this application. For example, the values and set numbers in Table 1 can be changed, and this application does not impose any restrictions on this.
[0168] It is understood that the first correspondence may include the correspondence between the number of punched bits and the set of punched bits shown in one or more rows of Table 1. As shown in Table 1, any number of punched bits may correspond to one or more sets of punched bits.
[0169] As an example, the first number of punches can be 10, and the first set of punch positions can be either set #2 or set #3.
[0170] Optionally, the correspondence shown in Table 1 may also include the correspondence between the number of punched bits, the set of punched bits, and the eigenvalues. The eigenvalues can be found in the description of the characteristics satisfied by the set of punched bits below, which will not be elaborated here.
[0171] In one possible embodiment, the first device can obtain indication information of the aforementioned first correspondence. This indication information may be predefined or preconfigured. It may also be sent by a network device or network element, thus the first device can receive it. For example, the indication information may include the first correspondence.
[0172] In one possible embodiment, the first set of punched bits, and / or any set of punched bits in the first correspondence, satisfies the following feature 1 and / or feature 2.
[0173] Feature 1 and Feature 2 will be introduced below.
[0174] Feature 1 is determined based on the secondary peak distribution of the FHT output sequence.
[0175] First, let's explain the peak distribution of the FHT output sequence.
[0176] For a length of 2 m Given a set of codeword sequences The sequence in the set is of length 2 m Given a binary sequence of elements, where each element has the value 'a' or '-a', where 'a' is any real number. It can be proven that the absolute value distribution of the output sequence after passing through the FHT is fixed, and the positional distribution of these absolute values changes deterministically as the input sequence changes. A codeword sequence refers to a sequence of legal codewords encoded using RM codes.
[0177] For example, for a codeword with m=3, without punching holes, any possible codeword sequence can be used as the input sequence for the FHT operation. The probability distribution of the elements after taking the absolute value of any FHT output sequence is one of the following: {8*a,0,0,0,0,0,0,0}, {0,8*a,0,0,0,0,0,0}, {0,0,8*a,0,0,0,0,0}, {0,0,0,8*a,0,0,0,0}, {0,0,0,0,8*a,0,0,0}, {0,0,0,0,0,0,8*a,0}, {0,0,0,0,0,0,8*a,0}, {0,0,0,0,0,0,0,8*a,0}. As can be seen, the values of the elements after taking the absolute value of the FHT output sequence and the number of values are fixed. For example, in the example above, after taking the absolute value of various possible FHT output sequences, only one element has the value of 8*a, and the values of the other elements are all 0.
[0178] It should be understood that the output sequence of FHT here is the output sequence obtained by performing FHT operation on any sequence, and does not correspond to the output result of FHT operation in the FHT decoding process.
[0179] The peak value of an FHT output sequence can be defined as the absolute value of each element after taking the absolute value of the FHT output sequence. The largest value after taking the absolute value of the FHT output sequence is called the primary peak, the second largest value is called the secondary peak, and so on, with the nth largest value being called the nth peak, where n is a positive integer greater than or equal to 3. In the example above, the FHT output sequence has only one peak after taking the absolute value, with a value of 8*a, meaning the primary peak's value is 8*a. Furthermore, in the same example, the secondary peak's value is 0.
[0180] As one possible implementation, the peak distribution of the FHT output sequence can be represented by peak distribution information. Peak distribution information can include the peak value and the number of secondary peaks. For example, in the example above, the peak value is 0 and the number of secondary peaks is 7; therefore, the secondary peak distribution of the FHT output sequence can be represented by the secondary peak distribution information (0,7). Peak distribution information can also take other forms, which are not specifically limited in this application.
[0181] Additionally, in the case of puncturing, any sequence in the codeword sequence set can be punctured and used as the input sequence for FHT. The puncturing process, for example, involves setting the element corresponding to the punctured bit to 0 using either 'a' or '-a'. For instance, when puncturing 1 bit, the element corresponding to one bit in any information bit sequence can be set to 0; this bit is the punctured bit. The position of the punctured bit will differ for different sets of punctured bits with the same number of punctures.
[0182] As an example, for a codeword with m=3, when 1 puncture bit is used, the secondary peak distribution corresponding to different input sequences and / or different puncture bit positions is (1,7).
[0183] The above describes the peak distribution of the FHT output sequence. With rate matching, the FHT input sequence (i.e., the encoded output sequence) is a rate-matched sequence, meaning at least one element in the FHT input sequence is 0. The positions that are 0 are punctured bits, that is, the bits corresponding to the index in the punctured bit set.
[0184] It is understandable that as m increases and the number of punch bits changes, there are many possibilities for the peak distribution, that is, different punch bits (or different sets of punch bits) may correspond to different peak distributions.
[0185] For example, for a codeword with m=4, when the number of punctured bits is 5, if the punctured bit indices are [0,1,4,5,6], the corresponding FHT output sequence distribution is [11,-1,-3,1,1,1,-1,-1,-1,-5,-1,-3,1,1,1,-1,-1,-1], and the secondary peak distribution information is (5,1). If the punctured bit indices are [1,4,5,6,8], the corresponding FHT output sequence distribution is [11,-1,-3,1,1,1,-1,-1,-1,-3,1,-1,3,3,3,1,1]. It can be seen that in this example, different sets of punctured bits correspond to different peak distributions, causing changes in the secondary peak distribution information, which is (3,1).
[0186] If multiple sets of punched bits correspond to different secondary peak distribution information under a certain number of punched bits, the set of punched bits can be selected as the set of punched bits corresponding to the number of punched bits according to the principle of optimal or relatively optimal secondary peak distribution of FHT.
[0187] The following describes how to determine the first set of punctured bits and / or any set of punctured bits in the first correspondence based on the FHT subpeak distribution.
[0188] In this embodiment of the application, the optimal FHT peak distribution can mean:
[0189] (1) First compare the magnitude of the secondary peak value corresponding to multiple punched bit sets. If the secondary peak value is the smallest, the FHT peak distribution of the punched bit set is optimal; if the secondary peak value is larger, the FHT peak distribution of the punched bit set is not optimal.
[0190] (2) When the peak values of the secondary peaks of multiple punched bit sets are the same, the number of secondary peaks can be further compared. If the number of secondary peaks is the smallest, the FHT peak distribution of the punched bit set is optimal; if the number of secondary peaks is larger, the FHT peak distribution of the punched bit set is not optimal.
[0191] It is understandable that, satisfying the optimal FHT peak conditions (1) and / or (2) above, the decoding interference of the secondary peak position on the main peak position is minimized, thus resulting in optimal communication performance. In addition, to reduce the difficulty of obtaining the punctured bit set, a punctured bit set with a better FHT peak distribution can also be selected.
[0192] For example, when the codeword has m=4 and the number of puncture bits is 5, the secondary peak distribution information corresponding to the puncture bit indices [0,1,4,5,6] is (5,1), and the secondary peak distribution information corresponding to the puncture bit indices [1,4,5,6,8] is (3,1). The main peak value corresponding to these two puncture bit sets is 11. Among them, compared with the puncture scheme with a secondary peak value of 5, the secondary peak causes less interference to the main peak in the scheme with a secondary peak value of 3. Therefore, the puncture bit indices [0,1,4,5,6] can be selected as the puncture bit set corresponding to the number of puncture bits 5.
[0193] Therefore, based on feature 1, it can be considered that the first set of punctured bits in this application, and / or any set of punctured bits in the first correspondence, is determined according to the FHT output sequence. Specifically, the set of punctured bits can be selected based on the peak distribution of the FHT output sequence. To improve decoding performance, the set of bit positions with the optimal or relatively optimal peak distribution of the FHT output sequence can be selected as the first set of punctured bits, and / or as any set of punctured bits in the first correspondence. For example, the set of punctured bits with smaller second-peak values, or with the same second-peak values and fewer second-peaks in the FHT output sequence can be selected as the first set of punctured bits, and / or as any set of punctured bits in the first correspondence.
[0194] As an example, the FHT output sequence corresponding to any set of punctured bits in the first set of punctured bits and / or the first correspondence can satisfy any of the following conditions:
[0195] Condition (1) states that the peak value of the secondary peak in the FHT output sequence is less than or equal to a first threshold. The first threshold can be an upper limit representing the peak value of the secondary peak with a better peak distribution. The first threshold can be a set value or a value related to the peak value of the primary peak. For example, the first threshold is positively correlated with the magnitude of the primary peak.
[0196] According to condition (1), the set of punctured bits with smaller peak values can be reasonably selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence based on the size of the secondary peak value, so as to improve the decoding performance.
[0197] Condition (2): The second peak value in the peak of the FHT output sequence is less than or equal to the second peak value in the peak of the output sequence corresponding to the second punctured bit set, and the number of punctured bit numbers in the second punctured bit set is the number of punctured bits in the first punctured bit set.
[0198] According to condition (2), based on the relationship between the magnitudes of the multiple secondary peak values corresponding to multiple punctured bit sets, the punctured bit set corresponding to the smaller secondary peak value can be reasonably selected as the first punctured bit set and / or any punctured bit set in the first correspondence to improve decoding performance. The second punctured bit set is the punctured bit set with the larger corresponding secondary peak value.
[0199] Condition (3) states that the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak in the FHT output sequence is greater than or equal to the second threshold. The second threshold can be the lower limit of the absolute value of the difference between the peak value of the primary peak and the peak value of the secondary peak, representing a better peak distribution. The second threshold can be a set value or a value related to the peak value of the primary peak. For example, the second threshold is positively correlated with the magnitude of the peak value of the primary peak.
[0200] According to condition (3), the set of punched bits with the larger absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak can be reasonably selected as the first set of punched bits and / or any set of punched bits in the first correspondence relationship to improve decoding performance.
[0201] Condition (4): The absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak in the FHT output sequence is greater than or equal to the absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak in the output sequence corresponding to the second set of punched bits. The number of the serial numbers of the punched bits in the second set of punched bits is the number of the first punched bits.
[0202] According to condition (4), based on the absolute value of the difference between the peak values of the main peak and the peak values of the secondary peak corresponding to multiple sets of punctured bit bits, the set of punctured bit bits with the larger value can be reasonably selected as the first set of punctured bit bits and / or any set of punctured bit bits in the first correspondence to improve decoding performance. The second set of punctured bit bits is the set of punctured bit bits with the smaller absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak.
[0203] Condition (5) states that the number of secondary peaks in the FHT output sequence is less than or equal to the third threshold. The third threshold can be an upper limit representing the number of secondary peaks with a better peak distribution. The third threshold can be a set value or a value related to the peak value of the main peak. For example, the third threshold is positively correlated with the peak value of the main peak.
[0204] According to condition (5), the set of punctured bits with fewer secondary peaks can be reasonably selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence to improve decoding performance.
[0205] Condition (6) states that the number of secondary peaks in the FHT output sequence is less than or equal to the number of secondary peaks in the output sequence corresponding to the second set of punched bits.
[0206] According to condition (6), the set of punctured bits with fewer secondary peaks can be reasonably selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence relationship based on the size relationship of the number of secondary peaks corresponding to the multiple sets of punctured bits, so as to improve decoding performance.
[0207] Optionally, any two or more of the above conditions (1) to (6) can be implemented in combination. For example, conditions (1) and (5) can be implemented in combination, that is, a set of punched bits whose peak value is less than or equal to the first threshold and whose number of secondary peaks is less than or equal to the third threshold can be selected as the first set of punched bits and / or any set of punched bits in the first correspondence.
[0208] Understandably, the "secondary peak" in Feature 1 above can also be changed to "the nth peak," or to "from the secondary peak to the nth peak," where n is greater than or equal to 3. That is, the distribution of the secondary peak or the nth peak can be used to determine whether the set of punch positions makes the FHT peak distribution optimal. For example, taking n=3 as an example, when multiple sets of punched bits with the same number of punches correspond to the same secondary peak distribution information, the set of punched bits corresponding to the number of punches can be determined by combining the distribution of the third peak corresponding to multiple sets of punched bits. For instance, a set of punched bits with a smaller third peak can be selected, or a set of punched bits with the same third peak value and fewer third peaks can be selected as the set of punched bits corresponding to the number of punches.
[0209] Alternatively, the set of punctured bits corresponding to the number of punctures can be determined based on the distribution of at least two peaks from the second to the nth peak. For example, the set of punctured bits can be scored based on the distribution of at least two peaks from the second to the nth peak, and the set of punctured bits can be determined based on the score corresponding to the number of punctures.
[0210] Feature 2 is determined based on the number of groups in the maximal linearly independent set.
[0211] First, let's define the number of maximal linearly independent sets.
[0212] The number of groups in a maximally linearly independent set can be determined using the following steps:
[0213] Step (1) Enumerate the number of combinations: For RM(m,1), the dimension of its encoding matrix is (m+1)×2 m We can choose any m+1 columns from the column numbers as a combination. First, we enumerate all the combinations as a set C.
[0214] Step (2) Determine the rank of the matrix based on the combination: Select combination c in set C. iThe number of columns of the corresponding generating matrix forms a new matrix. If this matrix is full rank, the number of combinations of maximal linearly independent sets is increased by one.
[0215] Step (3) Calculate the number of maximal linearly independent sets: By iterating through the combinations in set C of the generating matrix, the number of maximal linearly independent sets can be obtained by summing them up.
[0216] The following describes how to determine the first set of punctured bits and / or any set of punctured bits in the first correspondence based on the number of sets of maximally linearly independent sets.
[0217] With at least one punctured bit, the first punctured bit set and / or any punctured bit set in the first correspondence can be determined based on the number of sets of maximal linearly independent sets corresponding to the punctured bit set.
[0218] The method for determining the number of maximally linearly independent groups corresponding to any set of punched bits can be as follows: For a set of punched bits, a new matrix is formed by deleting columns with the same index from the encoding matrix according to the sequence number in the set of punched bits, and the number of maximally linearly independent groups of the new matrix is determined according to steps (1) to (3).
[0219] It can be assumed that different sets of punctured bits with the same number of puncture bits can have different numbers of maximally linearly independent subsets. Among them, for the same number of puncture bits, the larger the number of maximally linearly independent subsets corresponding to the set of punctured bits, the better the decoding performance of the set of punctured bits, that is, the better the communication performance.
[0220] If a set of punctured bits corresponds to the highest number of bits in that group, then that set of punctured bits has the best (or better) decoding performance. Therefore, this set of punctured bits can be selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence.
[0221] Alternatively, the set of punctured bits corresponding to a higher number of groups can be selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence, which results in better decoding performance.
[0222] As an example, the FHT output sequence corresponding to any set of punctured bits in the first set of punctured bits and / or the first correspondence can satisfy any of the following conditions:
[0223] Condition (7) states that the number of maximally linearly independent sets is greater than or equal to the fourth threshold. The fourth threshold can be a lower limit on the number of maximally linearly independent sets corresponding to the set of punched bits with better decoding performance. The fourth threshold can be a set value or a value related to the number of punched bits. For example, the fourth threshold is negatively correlated with the number of punched bits.
[0224] According to condition (7), the set of punctured bits with a larger number of groups in the maximal linearly independent group can be selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence to improve decoding performance.
[0225] Condition (8) is that the number of maximally linearly independent sets is greater than or equal to the number of maximally linearly independent sets corresponding to the second set of punched bits, and the number of the indexes of the punched bits in the second set of punched bits is equal to the number of the first set of punched bits.
[0226] According to condition (8), the set of punctured bits with a larger number of groups can be reasonably selected as the first set of punctured bits and / or any set of punctured bits in the first correspondence relationship based on the size relationship of the number of groups corresponding to multiple sets of punctured bits, so as to improve decoding performance.
[0227] It is understandable that conditions (7) and (8) above can be implemented in combination to achieve better decoding performance. In addition, at least one of conditions (1) to (6) above can be implemented in combination with at least one of conditions (7) and (8).
[0228] In one possible embodiment, the first correspondence may further include the correspondence between the number of puncture bits, the set of puncture bits, and the feature values, facilitating the selection of a set of puncture bits that meets communication requirements based on the feature values. The feature values include peak distribution information and / or the number of sets of maximally linearly independent groups, as shown in Table 1. Furthermore, the feature values corresponding to multiple sets of puncture bits with the same number of puncture bits may be identical.
[0229] For example, for a first-order RM code with m=4, when 1 bit is punched, the secondary peak distribution is (1, 15), and the number of maximal linearly independent sets is 1848. When 2 bits are punched, the secondary peak distribution is (2, 7), and the number of maximal linearly independent sets is 1232. When 3 bits are punched, the secondary peak distribution is (3, 3), and the number of maximal linearly independent sets is 792. When 4 bits are punched, the secondary peak distribution is (4, 1), and the number of maximal linearly independent sets is 488. When 5 bits are punched, the secondary peak distribution is (3, 5), and the number of maximal linearly independent sets is 287. When 6 bits are punched, the secondary peak distribution is (2, 15), and the number of maximal linearly independent sets is 162. When 7 bits are punched, the secondary peak distribution is (3, 6), and the number of maximal linearly independent sets is 81. When the punch is 8 bits, the secondary peak distribution is (4,2), and the number of maximal linearly independent sets is 36. When the punch is 9 bits, the secondary peak distribution is (3,6), and the number of maximal linearly independent sets is 15. When the punch is 10 bits, the secondary peak distribution is (2,15), and the number of maximal linearly independent sets is 6.
[0230] In one possible embodiment, a set of punctured bits can be determined by nesting another set of punctured bits. Nesting can be understood as the sequence number of the punctured bits in one set being determined by adding and / or subtracting one or more punctured bits from the sequence number of the punctured bits in another set, wherein the number of sequence numbers of the punctured bits in the two sets are different. Optionally, the intersection of the two sets of punctured bits can be the set of punctured bits with fewer sequence numbers. The intersection of multiple sets of punctured bits is a set consisting of identical elements from the multiple sets. Alternatively, the set of punctured bits corresponding to the number of punctured bits q can be determined by the set of punctured bits corresponding to the number of punctured bits p, where q ≠ p. Determining the set of punctured bits based on nesting can improve the efficiency of rate matching while ensuring good communication performance.
[0231] In this application, nesting can also be referred to as continuation, association, or inheritance.
[0232] Optionally, the determination of the added and / or reduced punch bits can be based on feature 1 and / or feature 2. For example, by adding and / or reducing punch bits, the set of punch bits after adding and / or reducing punch bits satisfies at least one of the above conditions (1) to (8).
[0233] As an example of nested determination of punch bit sets, any two punch bit sets in the first correspondence can be obtained through nesting. For example, the M punch bit sets in the first correspondence include a third punch bit set and a fourth punch bit set, where the third punch bit set corresponds to the number of punches p, and the fourth punch bit set corresponds to the number of punches q, where p and q are both positive integers, and q ≠ p; the fourth punch bit set can be determined based on the third punch bit set.
[0234] Taking Table 1 as an example, the first correspondence includes the correspondence between the number of punched bits 9 and set #1, and the correspondence between the number of punched bits 11 and set #4. Assuming p = 9 and q = 11, set #4 can be determined by set #1. For example, set #4 can be determined by adding two punched bits to set #1. The indices of these two punched bits have multiple possible combinations. A combination whose weights can be determined based on the peak distribution of the various possible corresponding FHT output sequences and / or the number of maximally linearly independent sets can be used as the two punched bits added to set #1.
[0235] As another example of nested determination of the punch bit set, the first device can determine the first punch bit set based on the third punch bit set among M punch bit sets, where the third punch bit set corresponds to the number of punch bits p, and the first punch bit set corresponds to the number of punch bits q, where p and q are both positive integers, and q ≠ p.
[0236] One possible scenario for this example is that, if the first correspondence does not include the first puncture bit q but includes p, the first puncture bit position set can be determined based on the third puncture bit position set corresponding to p.
[0237] For example, for a first-order RM code with m=4, when p=10, the set of the third punctured bits is [6,12,5,11,13,9,15,0,1,14]. Assuming q=9, one punctured bit can be removed from the set of the third punctured bits. For example, the index of the removed punctured bit is 14, meaning the set of the first punctured bit positions is [6,12,5,11,13,9,15,0,1]. Optionally, the index 14 of the removed punctured bit can be determined based on the peak distribution of the FHT output sequence and / or the number of maximally linearly independent sets to achieve better decoding performance.
[0238] Understandably, in the example above where the set of punched bits is nested, when p is less than q, it can be considered that the set of punched bits with more punched bits is determined based on the set of punched bits with fewer punched bits, that is, the set of punched bits is nested in order of increasing number of punched bits; when p is greater than q, it can be considered that the set of punched bits with fewer punched bits is determined based on the set of punched bits with more punched bits, that is, the set of punched bits is nested in order of decreasing number of punched bits.
[0239] One possibility is that the set of punched bits corresponding to the p punched bits satisfies feature 1 as optimal and / or feature 2 as optimal, while the set of punched bits corresponding to the p+1 punched bits obtained by nesting the set of punched bits corresponding to the p punched bits does not satisfy feature 1 and / or feature 2. That is, the set of punched bits corresponding to the p punched bits is optimal, but the set of punched bits corresponding to the p+1 punched bits cannot be guaranteed to be optimal. For example, this situation may occur when m is too large.
[0240] There are two approaches at this point:
[0241] One approach is to reduce the performance requirements of the set of punched bits corresponding to the p punched bits. That is, the set of punched bits corresponding to the p punched bits is no longer required to satisfy optimal feature 1 and / or optimal feature 2, thus ensuring that the set of punched bits corresponding to the p+1 punched bits is optimal. For example, the set of punched bits corresponding to the p punched bits can be adjusted so that it satisfies suboptimal (or non-optimal) feature 1 and / or suboptimal (or non-optimal) feature 2. Then, based on this set, the set of punched bits corresponding to the p+1 punched bits can be determined through a nested approach, ensuring that the set of punched bits corresponding to the p+1 punched bits satisfies optimal feature 1 and / or optimal feature 2. If no set of punched bits corresponding to the p+1 punched bits satisfies optimal feature 1 and / or optimal feature 2 can be found, the process can backtrack to adjusting the set of punched bits corresponding to the p punched bits, continuing to reduce the requirements for satisfying feature 1 and / or feature 2, until the set of punched bits corresponding to the p+1 punched bits satisfies optimal feature 1 and / or optimal feature 2.
[0242] Approach two can reduce the performance requirements for the set of punched bits corresponding to p+1 punched bits. Specifically, it eliminates the requirement that the set of punched bits corresponding to p+1 punched bits satisfy optimality for feature 1 and / or optimality for feature 2, thus ensuring that the set of punched bits corresponding to p punched bits is optimal and that the set of punched bits corresponding to p+2 punched bits satisfies optimality for feature 1 and / or optimality for feature 2. For example, the set of punched bits corresponding to p+1 punched bits is determined in a way that satisfies suboptimal (or non-optimal) feature 1 and / or suboptimal (or non-optimal) feature 2. The set of punched bits corresponding to p+2 punched bits is then determined through a nested approach, ensuring that the set of punched bits corresponding to p+2 punched bits satisfies optimality for feature 1 and / or optimality for feature 2. This is illustrated using the nested approach of determining the set of punched bits in ascending order of the number of punched bits. When determining the set of punched bits in descending order of the number of punched bits, the above description can be used as a reference.
[0243] As a possible nested method for determining the set of punctured bits, the first device can determine the set of punctured bits by nesting the nested set of punctured bits and / or the non-nested set of punctured bits, which can further achieve efficient determination of the set of punctured bits and improve the efficiency of rate matching.
[0244] The nested punch bit set includes one or more punch bit sets. The set of punch bits corresponding to each punch bit in the nested punch bit set is determined based on the set of punch bits corresponding to the previous punch bit. When the punch bit set is determined by nesting in ascending order of punch bit number, the previous punch bit of punch bit number q is q-1; when the punch bit set is determined by nesting in descending order of punch bit number, the previous punch bit of punch bit number q is q+1.
[0245] The non-nested punch bit set includes one or more punch bits. The set of punch bits corresponding to a punch bit in the non-nested punch bit set is determined based on the set of punch bits corresponding to the punch bit in the nested punch bit set closest to that punch bit. When the punch bit set is determined by nesting in ascending order of punch bits, the punch bit in the nested punch bit set closest to punch bit q is the largest punch bit among the punch bits less than q in the nested punch bit set; when the punch bit set is determined by nesting in descending order of punch bits, the punch bit in the nested punch bit set closest to punch bit q is the smallest punch bit among the punch bits greater than q in the nested punch bit set.
[0246] Alternatively, the set of nested punch numbers can be considered as the set of punch numbers that do not belong to the set of non-nested punch numbers, and the set of non-nested punch numbers can be considered as the set of punch numbers that do not belong to the set of nested punch numbers. In other words, the set of nested punch numbers and the set of non-nested punch numbers can be considered complementary.
[0247] Taking the example of determining the set of punched bits corresponding to a punched bit number q based on the nested set of punched bits corresponding to a punched bit number p, when determining the set of punched bits in ascending order of the number of punched bits, p is less than q. If q belongs to the nested set of punched bits, then p = q - 1; if q does not belong to the nested set of punched bits, then p is the maximum value among the punched bits less than q in the nested set of punched bits. When determining the set of punched bits in descending order of the number of punched bits, p is greater than q. If q belongs to the nested set of punched bits, then p = q + 1; if q does not belong to the nested set of punched bits, then p is the minimum value among the punched bits greater than q in the nested set of punched bits.
[0248] Wherein, the set of punched bits corresponding to p can be the third set of punched bits, and the set of punched bits corresponding to the punched bit number q can be the first set of punched bits or the fourth set of punched bits.
[0249] In one possible embodiment, the first device can obtain indication information of the aforementioned nested puncture bit set. This indication information can be predefined or preconfigured. It can also be sent by a network device or network element, thus the first device can receive it. For example, the indication information may include a nested puncture bit set. Alternatively, the indication information may include a non-nested puncture bit set, that is, implicitly indicating the nested puncture bit set through the non-nested puncture bit set.
[0250] Alternatively, the indication information can also be an index of a nested set of punch bit positions. For example, multiple possible nested punch bit position sets and multiple indices of nested punch bit position sets can be predefined or preconfigured, and the indication information can include an index of a nested punch bit position set to activate that nested punch bit position set. Similarly, the indication information can include an index of a non-nested punch bit position set, that is, implicitly indicating a nested punch bit position set through a non-nested punch bit position set.
[0251] After determining the first set of punched bits, an exemplary mapping method is as follows:
[0252] 1. Arrange the sequence numbers in the first set of punched bits to the beginning of the interleaved sequence by interleaving, and punch holes sequentially starting from the beginning; or arrange the sequence numbers in the first set of punched bits to the end of the interleaved sequence by interleaving, and punch holes sequentially starting from the end.
[0253] 2. If punching starts from the beginning, let the interleaving mapping be Π. The original sequence before interleaving is sorted as I, and the sequence after interleaving is sorted as Q. The original sequence sorting I is divided into punched positions I1 and non-punched positions I2, where I = I1 + I2. The interleaved sequence Q includes punched positions Q1 and non-punched positions Q2. Π(I) represents the interleaved sequence, satisfying: Π(I) = Π(I1) + Π(I2) = Q1 + Q2. Subsequently, punching can be performed at position Q1 according to the number of punches.
[0254] Taking a first-order RM code with m=4 as an example, Q1 = [[6,12,5,11,13,9,15,0,1,14], Q2 = [2,3,4,7,8,10]]. Therefore, Π(I) satisfies: Π(I) = [[6,12,5,11,13,9,15,0,1,14][2,3,4,7,8,10]]. Among them, Q1 = [6,12,5,11,13,9,15,0,1,14] is a fixed order, while Q2 = [2,3,4,7,8,10] can be interleaved in other orders, such as row-column interleaving.
[0255] Q1 above can also be understood as the set of punched bits under a set number of punching positions. When the actual number of punching positions is less than the set number of punching positions, the first device can punch the bits corresponding to the sequence numbers [6,12,5,11,13,9,15,0,1,14] sequentially from left to right according to the number of punching positions. For example, if the number of punching positions is 1, the bit with sequence number 6 can be punched in order from left to right.
[0256] If we start punching holes from the end, let the interleaving map be Π. The original sequence before interleaving is sorted as I, and the sequence after interleaving is sorted as Q. The original sequence sorting I is divided into punched positions I1' and non-punched positions I2', where I = I1' + I2'. The interleaved sequence Q includes punched positions Q1' and non-punched positions Q2'. Π(I) represents the interleaved sequence, and Π(I) satisfies: Π(I) = Π(I2') + Π(I1') = Q2' + Q1'.
[0257] Taking the first-order RM code with m=4 as an example, Q1' can be seen as the inversion of Q1, that is, Q1' = [14,1,0,15,9,13,11,5,12,6]. Additionally, Q2' can be the same as Q2, or Q2' can be seen as the inversion of Q2. Taking Q2' = [2,3,4,7,8,10] as an example, Π(I) satisfies: Π(I) = [[2,3,4,7,8,10][14,1,0,15,9,13,11,5,12,6]].
[0258] The aforementioned Q1' can also be understood as the set of punched bits under a set number of punching positions. When the actual number of punching positions is less than the set number of punching positions, the first device can punch the bits corresponding to the sequence numbers [14,1,0,15,9,13,11,5,12,6] sequentially from right to left according to the number of punching positions. For example, if the number of punching positions is 1, the bit with sequence number 6 can be punched in order from left to right.
[0259] The above flowchart, illustrated in Figure 5, describes how the first device executes the method for determining the punctured bit provided in this embodiment. It is understood that the method for determining the punctured bit executed by the second device can refer to the method executed by the first device, and will not be repeated here. Specifically, the second device can decode the punctured bit, that is, set the LLR of the punctured bit to 0, thus achieving reasonable LLR initialization.
[0260] In a single communication process, the punched bit determined by the first device is the same as the punched bit determined by the second device.
[0261] Taking the air interface transmission process shown in Figure 2 as an example, the first device and the second device can determine the first set of punctured bits based on the process shown in Figure 5. During transmission, the first device can puncture the encoded bit sequence according to the first set of punctured bits, that is, remove the corresponding bit in the encoded bit sequence according to the sequence number in the punctured bit set. Then, it performs one or more steps of modulation, layer mapping, precoding, framing, IFFT, and IRF to obtain the transmitted signal, and transmits the transmitted signal through the air interface. The second device can receive the physical signal through the air interface and parse the physical signal to obtain the information to be decoded. As shown in Figure 2, the parsing process can include performing one or more steps of IRF, FFT, deframing, equalization, de-layer mapping, and demodulation. The second device can also decode the information to be decoded. The second device can determine the punctured bits according to the first set of punctured bits and decode according to the punctured bits to improve decoding performance.
[0262] It is understandable that S101 and S102 can also be replaced with: obtaining the air interface resource size, and determining the first set of punctured bits based on the air interface resource size. The step of determining the first set of punctured bits based on the air interface resource size can include: determining the first number of punctured bits based on the air interface resource size, and determining the first set of punctured bits based on the first number of punctured bits. The description of "determining the first number of punctured bits based on the air interface resource size" can be found in S101. The description of "determining the first set of punctured bits based on the first number of punctured bits" can be found in S102.
[0263] It is understood that, in order to achieve the functions in the above embodiments, the terminal device or network device includes hardware structures and / or software modules corresponding to perform each function. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in the form of hardware, computer software, or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application scenario and design constraints of the technical solution.
[0264] Figures 7 and 8 are schematic diagrams illustrating possible communication devices provided in embodiments of this application. These communication devices can be used to implement the functions of the first or second device in the above method embodiments, and thus also achieve the beneficial effects of the above method embodiments. In the embodiments of this application, the communication device can be a terminal device or a network device, or it can be a module or component applied to a terminal device or a network device. For example, when implementing the function of a terminal device in the embodiments of this application, the communication device can be the terminal device or a communication module in the terminal device, or a circuit or chip in the terminal device responsible for communication functions. Similarly, when implementing the function of a network device in the embodiments of this application, the communication device can be the network device or a communication module in the network device, or a circuit or chip in the network device responsible for communication functions.
[0265] The communication device 700 shown in Figure 7 includes a processing unit 710 and a transceiver unit 720. The processing unit can be used to perform processing and other actions. The transceiver unit, also called a communication unit, may include a sending unit and a receiving unit. The sending unit is used to perform the sending action of the communication device, and the receiving unit is used to perform the receiving action of the communication device. For ease of description, the sending unit and the receiving unit in this embodiment are combined into a single transceiver unit. This will be explained uniformly here and will not be repeated later. The communication device 700 is used to implement the functions of the first or second device in the above method embodiments. For example, the functions of the first or second device can be found in the description of the relevant content in Figure 5. Optionally, the communication device 700 may also include a storage unit for storing device program code and / or data.
[0266] In one possible design, when the communication device 700 is a terminal, a communication module within a terminal, a network device, or a communication module within a network device, the function of the processing unit 710 can be implemented by one or more processors. Specifically, the processor may include a modem chip, or a system-on-a-chip (SoC) chip or a SIP chip containing a modem core. The function of the transceiver unit 720 can be implemented by transceiver circuitry.
[0267] In one possible design, when the communication device 700 is a circuit or chip responsible for communication functions in a terminal or network device, such as a modem chip or a system-on-a-chip (SoC) or SIP chip containing a modem core, the function of the processing unit 710 can be implemented by a circuit system in the aforementioned chip that includes one or more processors or processor cores. The function of the transceiver unit 720 can be implemented by interface circuits or data transceiver circuits on the aforementioned chip.
[0268] When the communication device 700 is used to implement the function of the first device in the above method embodiment, the processing unit 710 and / or the transceiver unit 720 can be used to obtain the first number of puncture bits, and the processing unit 710 and / or the transceiver unit 720 can be used to determine the first set of puncture bits based on the first number of puncture bits.
[0269] For a more detailed description of the processing unit 710 and the transceiver unit 720, please refer directly to the relevant descriptions in the above method embodiments, which will not be repeated here.
[0270] The communication device 800 shown in Figure 8 includes a processor 810 and an interface circuit 820. The processor 810 and the interface circuit 820 are coupled to each other. It is understood that the interface circuit 820 can be a transceiver or an input / output interface. Optionally, the communication device 800 may also include a memory 830 for storing instructions executed by the processor 810, or storing input data required by the processor 810 to execute instructions, or storing data generated after the processor 810 executes instructions.
[0271] In one example, the interface circuitry or transceiver is used for receiving and / or transmitting signals. For instance, a processor controls the transceiver to receive and / or transmit signals. The transceiver may include a receiver for receiving signals and a transmitter for transmitting signals; if the processor is a chip, the transceiver may be the chip's input / output interface, where the output corresponds to transmitting and the input corresponds to receiving.
[0272] When the communication device 800 is used to implement the above method embodiment, the processor 810 is used to implement the function of the processing unit 710, and the interface circuit 820 is used to implement the function of the transceiver unit 720.
[0273] It is understood that the processor in the embodiments of this application can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), microprocessors without interlocked piped stages architecture (MIPS), advanced instruction set computers (RISC) machines (ARM), network processors (NPs), field-programmable gate arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor can be a microprocessor or any conventional processor.
[0274] The method steps in the embodiments of this application can be implemented in hardware, by a processor executing software instructions, or by a combination of hardware and software. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Furthermore, the ASIC can reside in a first device or a second device. Alternatively, the processor and storage medium can exist as discrete components in the first device or the second device.
[0275] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. A computer program is a set of instructions that instruct an electronic computer or other device having a first or second device to perform any step of its operation. It is typically written in a programming language and runs on a target architecture. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed, in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium can be volatile or non-volatile, or it can include both types of storage media.
[0276] Based on the same technical concept, embodiments of this application also provide a computer-readable storage medium, including a program or instructions, which, when run on a computer, cause the methods in the above method embodiments to be executed.
[0277] Based on the same technical concept, embodiments of this application also provide a computer program product, including instructions that, when run on a computer, cause the methods in the above method embodiments to be executed.
[0278] Based on the same technical concept, embodiments of this application also provide a communication system, which may include a first device and a second device. In this communication system, the first device and the second device can be used to implement the method flow shown in FIG5, respectively. As an example, the first device may be a terminal, and the second device may be a network device (such as a base station). As another example, the first device may be a network device, and the second device may be a terminal.
[0279] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0280] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.
[0281] In this application, "at least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. In the textual description of this application, the character " / " generally indicates an "or" relationship between the preceding and following related objects; in the formulas of this application, the character " / " indicates a "division" relationship between the preceding and following related objects.
[0282] It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers described above does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.
Claims
1. A method of determining punctured bits, characterized by, include: Get the first number of holes; Based on the first number of punched bits and the first correspondence, a first set of punched bits is determined. The first correspondence includes the correspondence between K punched bits and M sets of punched bits. The K punched bits include the first number of punched bits, and the M sets of first punched bits include the first set of punched bits corresponding to the first number of punched bits. K and M are positive integers greater than 1, and M is greater than or equal to K. The first set of punched bits includes the sequence number of one or more punched bits, and the first set of punched bits is used for punching.
2. The method of claim 1, wherein, The first set of punched bits is determined based on at least one of the following: The output sequence of the Fast Hadamard Transform; or, The number of maximally linearly independent sets.
3. A method of determining puncturing bits, characterized by, include: Get the first number of holes; A first set of punched bits is determined based on the first number of punched bits. The first set of punched bits includes the sequence number of one or more punched bits. The first set of punched bits is used for punching. The first set of punched bits is determined based on at least one of the following: The output sequence of the Fast Hadamard Transform; or, The number of maximally linearly independent sets.
4. The method of claim 3, wherein, The step of determining the first set of punctured bits based on the first number of punctures includes: The first set of punched bits is determined based on the first number of punched bits and the first correspondence. Wherein, the first correspondence relationship includes the correspondence between K punched bits and M punched bit sets, the K punched bits include the first punched bits, the M first punched bit sets include the first punched bit sets corresponding to the first punched bits, K and M are positive integers greater than 1, and M is greater than or equal to K.
5. The method of any one of claims 2-4, wherein, The first set of punctured bits is determined based on the output sequence of the Fast Hadamard Transform, and includes: The distribution of peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punched bits satisfies at least one of the following: The peak value of the second peak in the output sequence of the fast Hadamard transform corresponding to the first set of punched bits is less than or equal to the first threshold. The second-highest peak value in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to the second-highest peak value in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit numbers in the second set of punctured bits is equal to the number of punctured bits in the first set of punctured bits. The absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak in the output sequence of the fast Hadamard transform corresponding to the first set of punched bits is greater than or equal to the second threshold. The absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is greater than or equal to the absolute value of the difference between the peak value of the main peak and the peak value of the secondary peak in the output sequence corresponding to the second set of punctured bits, and the number of punctured bit numbers in the second set of punctured bits is the number of punctured bits in the first set of punctured bits. The number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punched bits is less than or equal to the third threshold; or... The number of secondary peaks in the output sequence of the Fast Hadamard Transform corresponding to the first set of punctured bits is less than or equal to the number of secondary peaks in the output sequence corresponding to the second set of punctured bits.
6. The method of any one of claims 2-5, wherein, The first set of punched bits is determined based on the number of sets of the maximally linearly independent set, including: The number of maximally linearly independent sets corresponding to the first set of punched bits satisfies at least one of the following: The number of maximally linearly independent sets corresponding to the first set of punched bits is greater than or equal to the fourth threshold; or, The number of maximally linearly independent sets corresponding to the first set of punched bits is greater than or equal to the number of maximally linearly independent sets corresponding to the second set of punched bits, and the number of the indexes of the punched bits in the second set of punched bits is equal to the number of the first set of punched bits.
7. The method of any one of claims 1, 2, 4, wherein, The first correspondence includes the correspondence between the set of M punched bits and the feature values; Wherein, any of the aforementioned feature values includes at least one of the following: The distribution information of peaks in the output sequence of the Fast Hadamard Transform corresponding to the set of punched bits; or, Information on the number of groups corresponding to the maximal linearly independent set of punched bit bits.
8. The method of any one of claims 1, 2, 4, 7, wherein, The M punched bit sets include a third punched bit set and a fourth punched bit set. The third punched bit set corresponds to the number of punched bits p, and the fourth punched bit set corresponds to the number of punched bits q. Both p and q are positive integers, and q ≠ p. The fourth set of punched bits is determined based on the third set of punched bits.
9. The method of any one of claims 1, 2, 4, 7, wherein, The step of determining the first set of punched bits based on the first number of punched bits and the first correspondence includes: The first punch bit set is determined based on the third punch bit set in the M punch bit set. The third punch bit set corresponds to the number of punch bits p, where p and q are both positive integers, q ≠ p, and q is the number of punch bits in the first punch set.
10. The method as described in claim 9, characterized in that, When p is less than q, the intersection of the third set of punched bits and the first set of punched bits is the third set of punched bits; or, When p is greater than q, the intersection of the third set of punched bits and the first set of punched bits is the first set of punched bits.
11. The method of claim 9 or 10, wherein, p is less than q, and p and q satisfy at least one of the following: q belongs to the nested set of punch number positions, p = q - 1; or, p belongs to the nested punch number set, q does not belong to the nested punch number set, and p is the maximum value among the elements less than q in the nested punch number set.
12. The method of claim 9 or 10, wherein, p is greater than q, and p and q satisfy at least one of the following: q belongs to the nested set of punch numbers, p = q + 1; or, p belongs to the nested punch number set, q does not belong to the nested punch number set, and p is the minimum value among the elements in the nested punch number set that are greater than q.
13. The method of claim 11 or 12, wherein, The method further includes: Receive the indication information of the nested punch number set.
14. The method of any one of claims 1, 2, 4, 7-13, wherein, The method further includes: Receive the indication information of the first correspondence.
15. A communications device, characterized by Includes units or modules for performing the method as described in any one of claims 1-14.
16. A communications device, characterized by including a processor for executing computer programs or instructions to implement the method as claimed in any one of claims 1-14.
17. A computer-readable storage medium, characterized in that, The storage medium has stored therein computer programs or instructions, which, when executed by a communication device, implement the method as claimed in any one of claims 1-14.
18. A computer program product, characterised in that, The computer program product, when executed by a computer, causes the computer to perform the method as claimed in any one of claims 1-14.
