Encoding method and apparatus

Abstract

The embodiment of the application provides a kind of encoding method and device, it is related to communication field, can improve decoding performance.The method comprises: the sending end device obtains the information bit sequence with length K2, information bit sequence contains the first information bit sub-sequence with length K1, K2 is greater than K1, K1, K2 are all positive integers;The information bit sequence with length K2 is encoded, and the coded bit sequence with length N2 is obtained, the coded bit sequence with length N2 contains the first coded bit sub-sequence with length N1, the first information bit sub-sequence with length K1 corresponds the first coded bit sub-sequence with length N1, N2 is greater than N1, N1, N2 are all positive integers;The coded bit sequence with length N2 is output.

Description

Technical Field

[0001] This application relates to the field of communications, and more particularly to encoding methods and apparatus. Background Technology

[0002] In wireless communication, the transmitting device typically encodes the information bit sequence to obtain an encoded bit sequence. This encoded bit sequence is then output, and the receiving device, upon receiving it, can decode it to recover the information bit sequence. During the decoding process, the receiving device must decode the complete encoded bit sequence. That is, if the receiving device receives only a portion of the encoded bit sequence (or an incomplete sequence), it cannot decode it and therefore cannot recover the information bits corresponding to that portion, resulting in degraded decoding performance.

[0003] For example, when the receiving device is under certain conditions (such as being in energy-saving mode or being a specific user), it can only receive a portion of the sequence; or, due to interference, resource contention by other services, or other reasons, only a portion of the encoded bit sequence output by the transmitting device may be received by the receiving device. Therefore, improving decoding performance is a pressing technical problem that needs to be solved. Summary of the Invention

[0004] This application provides an encoding method and apparatus that can improve decoding performance.

[0005] Firstly, this application provides an encoding method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to a transmitting equipment, a component used in the transmitting equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting equipment. The component used in the transmitting equipment can be within the transmitting equipment or independent of it. The method includes: acquiring an information bit sequence of length K2, where the information bit sequence includes a first information bit subsequence of length K1, K2 being greater than K1, and K1 and K2 being positive integers; encoding the information bit sequence of length K2 to obtain an encoded bit sequence of length N2, where the encoded bit sequence of length N2 includes a first encoded bit subsequence of length N1, the first information bit subsequence of length K1 corresponding to the first encoded bit subsequence of length N1, N2 being greater than N1, and N1 and N2 being positive integers; and outputting the encoded bit sequence of length N2.

[0006] Based on the first aspect, the encoding method of this application embodiment designs a layered transmission method, that is, the transmitting device encodes an information bit sequence of length N2 to obtain an encoded bit sequence of length N2, wherein the information bit sequence of length K2 includes a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1, and the encoded bit sequence of length N2 includes a first encoded bit subsequence of length N1, and the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1; that is, the first information bit subsequence of length K1 is encoded to obtain a first encoded bit subsequence of length N1, so that after the transmitting device outputs the encoded bit sequence, even if the receiving device cannot receive the complete encoded bit sequence (for example, the receiving device receives the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still recover the corresponding information bits according to the bit sequence it received (such as recovering the first information bit subsequence of length K1 from the symbol sequence corresponding to the first encoded bit subsequence of length N1), thereby improving the decoding performance.

[0007] Furthermore, even if the receiving device receives a symbol sequence corresponding to a partial encoded bit sequence (such as the first encoded bit subsequence of length N1), the receiving device can still recover the corresponding information bits (such as recovering the first information bit subsequence of length K1). Therefore, the method provided in this application can be flexibly applied to different application scenarios. For example, it can be applied to scenarios with different operating modes or different capabilities of devices. For example, when the receiving device is in power-saving mode or the receiving device has insufficient capability, so that it receives a partial encoded bit sequence (such as the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still perform decoding based on the method provided in this application, thereby improving the decoding performance of the receiving device.

[0008] In one possible design, the information bit sequence of length K2 also includes a second information bit subsequence of length K2-K1, and the first encoded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1.

[0009] Based on this possible design, since the first coded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1, the first information bit subsequence of length K1 can be independently encoded to obtain the first coded bit subsequence of length N1. Correspondingly, the first information bit subsequence of length K1 can be recovered by independently decoding the symbol sequence corresponding to the first coded bit subsequence of length N1. Therefore, even if the receiving device can only receive the symbol sequence corresponding to the first coded bit subsequence of length N1, it can still recover the first information bit subsequence of length K1 from the received bit sequence, thereby improving decoding performance.

[0010] In one possible design, the first information bit subsequence of length K1 includes a third information bit subsequence of length K3, where K3 is less than K1; correspondingly, the first encoded bit subsequence of length N1 includes a third encoded information bit subsequence of length N3, where the third information bit subsequence of length K3 corresponds to a third encoded bit subsequence of length N3, where N3 is less than N1.

[0011] Based on this possible design, the first information bit subsequence of length K1 contains a third information bit subsequence of length K3 and a fourth information bit subsequence of length K1-K3; the third information bit subsequence of length K3 is encoded to obtain a third encoded information bit subsequence of length N3; thus, even if the receiving device receives a symbol sequence corresponding to some bits in the first encoded bit subsequence of length N1 (such as the symbol sequence corresponding to the third encoded information bit subsequence of length N3), the receiving device can still recover the corresponding information bits (such as recovering the third information bit subsequence of length K3 from the symbol sequence corresponding to the third encoded information bit subsequence of length N3), thereby improving decoding performance.

[0012] Furthermore, since K2 is greater than K1 and K3 is less than K1, it means that if the receiving device cannot receive the third coded bit subsequence of length N3, but instead receives a symbol sequence corresponding to a smaller number of coded bits (such as the third coded bit subsequence of length N3), the receiving device can still recover the corresponding information bits (such as recovering the first information bit subsequence of length K3). This further makes the method provided in this application more flexible and applicable to different application scenarios.

[0013] In one possible design, the coded bit sequence of length N2 also includes a second coded bit subsequence of length N2-N1; wherein the first coded bit subsequence of length N1 is carried in the first resource, and the second coded bit subsequence of length N2-N1 is carried in the second resource, and the first resource and the second resource are different.

[0014] Based on this possible design, the first coded bit subsequence of length N1 and the second coded bit subsequence of length N2-N1 can be carried on different resources to avoid the influence of factors such as channel congestion, which would prevent the provision of a continuous resource to carry these two subsequences and thus prevent their successful transmission, thereby improving the flexibility of transmission.

[0015] In one possible design, the receiving device has different receiving performance on the first resource and the second resource; and / or, the first resource and the second resource have different resource characteristics, including dedicated resources and common resources.

[0016] In one possible design, the first resource and the second resource have different resource characteristics, including: the first resource is a dedicated resource for the receiving device, and the second resource is a common resource.

[0017] Based on the two possible designs mentioned above, since public resources are easily preempted or interfered with by other services, the receiving device may not be able to successfully receive the second encoded bit subsequence of length K2-K1. The first encoded bit subsequence of length N1 is sent through dedicated resources to ensure that the receiving device can successfully receive the first encoded bit subsequence of length N1, thereby recovering the first information bit subsequence of length K1 and improving decoding performance.

[0018] In one possible design, the receiving device has different receiving performance on the first resource and the second resource, including: the receiving device has better receiving performance on the first resource than on the second resource.

[0019] Based on this possible design, the resources with higher reception performance of the receiving device can be designated as the first resource, and the resources with lower reception performance as the second resource. In other words, the receiving device's reception performance on the first resource is better than its reception performance on the second resource. This ensures that the receiving device can successfully receive the first coded bit subsequence of length N1, thereby recovering the first information bit subsequence of length K1 and improving decoding performance.

[0020] In one possible design, the temporal resources of the first resource are located before the temporal resources of the second resource.

[0021] Based on this possible design, it is possible to consider sending a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 at different times (i.e., the time domain resources of the first and second resources are different); thereby avoiding the inability to provide a continuous time domain resource to carry these two subsequences due to factors such as channel congestion, which would prevent the two subsequences from being successfully sent, thus improving the flexibility of transmission.

[0022] In one possible design, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 belong to different task types; the receiving device has different requirements for the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1; and / or, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 are transmitted at different times.

[0023] Based on this possible design, the transmitting device can divide a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 based on factors such as task type, receiving device requirements, and transmission time, providing different implementation methods for the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1.

[0024] In one possible design, encoding an information bit sequence of length K2 to obtain an encoded bit sequence of length N2 includes: determining a bit sequence to be encoded of length N2 based on the information bit sequence of length K2; encoding the bit sequence to be encoded of length N2 to obtain an encoded bit sequence of length N2; wherein the bit sequence to be encoded of length N2 corresponds to a set of bit positions containing N2 bits, the set of bit positions containing a first set of bit positions and a second set of bit positions; the first set of bit positions contains N1 bits, the N1 bits contain K1 first bits, and a first information bit subsequence of length K1 is located on the K1 first bits; the second set of bit positions contains N2-N1 bits, the N2-N1 bits contain K2-K1 first bits, and a second information bit subsequence of length K2-K1 is located on the K2-K1 first bits.

[0025] In one possible design, the bit sequence to be encoded of length N2 comprises a first bit subsequence to be encoded of length N1 and a second bit subsequence to be encoded of length N2-N1; wherein, in the bit sequence to be encoded of length N2, the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are concatenated; or, in the bit sequence to be encoded of length N2, the bits in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are spaced apart.

[0026] Based on the two possible designs mentioned above, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 can be jointly encoded. That is, the two short codes of the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 corresponding to the first information bit subsequence of length K1 are combined into a long code of length N2 (i.e., the bit subsequence of length N2 to be encoded) for encoding, thereby obtaining better long code gain and improving encoding efficiency.

[0027] Understandably, during the encoding process of polar codes, some input bits are affected by other bits, requiring the assistance of those other bits to recover them. Conversely, some input bits are unaffected by other bits, allowing the receiver to independently decode and recover them without their assistance. Therefore, based on the encoding characteristics of polar codes, a bit sequence of length N2 can be encoded (by concatenating a first bit subsequence of length N1 with a second bit subsequence of length N2-N1, or by cross-concatenating the first bit subsequence of length N1 with the second bit subsequence of length N2-N1). For example, placing the first bit subsequence of length N1 in bits unaffected by other bits during encoding allows the receiver to recover the first information bit subsequence of length K1 even if it only receives the symbol sequence corresponding to the first information bit subsequence of length K1, thus improving decoding performance.

[0028] In one possible design, the information bit sequence of length K2 is located on the K2 bits with high reliability out of N2 bits; wherein, the K2 bits include K1 first bits and K2-K1 first bits.

[0029] Based on this possible design, a first information bit subsequence of length K1 or a second information bit subsequence of length K2-K1 can be placed on the K2 bits with high reliability, thereby improving the reliability of the encoding and reducing the bit error rate.

[0030] In one possible design, the K1 first bits are the K1 bits with the highest reliability among the N1 bits, and the K2-K1 first bits are the K2-K1 bits with the highest reliability among the N2-N1 bits.

[0031] Based on this possible design, the transmitter can determine the information bit (i.e., the first bit) of each information bit subsequence based on the short code. For example, it can determine the K1 reliable first bits based on the first bit position set containing N1 bits, and determine the K2-K1 reliable first bits based on the second bit position set containing N2-N1 bits. Since the K1 and K2-K1 first bits are also the K2 reliable bits among the N2 bits, the complexity of determining the first bit based on the short code is lower than that of determining the first bit based on the long code (i.e., the reliable first bit among the N2 bits), thereby improving coding efficiency.

[0032] In one possible design, in a bit sequence of length N2 to be encoded, a first bit subsequence of length N1 to be encoded and a second bit subsequence of length N2-N1 to be encoded are distributed alternately, including: the second bit subsequence of length N2-N1 to be encoded contains a first bit and a second bit, with an interval of X third bits between the first bit and the second bit; wherein, the first bit and the second bit are adjacent bits in the second bit subsequence of length N2-N1 to be encoded, and the X third bits are X consecutive bits in the first bit subsequence of length N1 to be encoded, the value of X is negatively correlated with K2-K1, and X is a positive integer.

[0033] Based on this possible design, when the first bit subsequence to be encoded with a length of N1 and the second bit subsequence to be encoded with a length of N2-N1 are distributed alternately in the bit sequence to be encoded with a length of N2-N1, there exists a gap of X third bits (i.e., bits in the first bit subsequence to be encoded with a length of N1) between two adjacent bits (i.e., the first bit and the second bit); where the value of X can decrease as the difference between K2 and K1 increases.

[0034] Understandably, during the encoding process of polar codes, some input bits are affected by other bits, requiring the assistance of those other bits to recover them. Conversely, some input bits are unaffected by other bits, allowing the receiver to decode them independently without their assistance. Therefore, based on the encoding characteristics of polar codes, the value of X can be appropriately set so that the first subsequence to be encoded of length N1 and the second subsequence to be encoded of length N2-N1 are spaced apart. In this arrangement, the bits in the first subsequence of length N1 are all located in positions unaffected by other bits during encoding. Thus, even if the receiver only receives the symbol sequence corresponding to the first information bit subsequence of length K1, it can still recover the first information bit subsequence of length K1, thereby improving decoding performance.

[0035] In addition, when setting the value of X, one can also consider placing the first information bit subsequence of length K1 or the second information bit subsequence of length K2-K1 in the bit sequence to be encoded of length N2 on the K2 bits with high reliability, thereby improving the reliability of encoding and reducing the bit error rate.

[0036] In one possible design, K2-K1 is less than or equal to K1.

[0037] Based on this possible design, when dividing the first information bit subsequence of length K1 or the subsequence of the second information bit subsequence of length K2-K1, it is advisable to make K1 greater than or equal to K2 / 2. This way, even if the receiving device cannot receive all the information output by the sending device, it can still ensure that it can receive as many information bits as possible, thereby recovering the information bits and reducing information loss.

[0038] In one possible design, N2 = 2 * N1, and in the bit sequence to be encoded of length N2, the bits in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are equally spaced.

[0039] Based on this possible design, when the bits in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are equally spaced, the K2 bits with high reliability determined based on the long code are the same as the K1 first bits and K2-K1 first bits determined based on the short code (i.e., the K2 bits contain the K1 first bits and K2-K1 first bits). The first information bit subsequence of length K1 or the second information bit subsequence of length K2-K1 can be placed on the K2 bits with high reliability, thereby improving the reliability of encoding and reducing the bit error rate.

[0040] In one possible design, the coded bit sequence of length N2 also includes a second coded bit subsequence of length N2-N1, and the second information bit subsequence of length K2-K1 corresponds to the second coded bit subsequence of length N2-N1; wherein, the second coded bit subsequence of length N2-N1 is obtained by operating on the fifth coded bit subsequence of length N2-N1 and the first coded bit subsequence of length N1, and the fifth coded bit subsequence of length N2-N1 is obtained by encoding the second bit subsequence to be encoded of length N2-N1 corresponding to the second information bit subsequence of length K2-K1.

[0041] In one possible design, the second encoded bit subsequence of length N2-N1 is obtained by XORing the fifth encoded bit subsequence of length N2-N1 with the first encoded bit subsequence of length N1.

[0042] Based on the two possible designs mentioned above, during the encoding of the second information bit subsequence of length K2-K1, the fifth encoded bit subsequence of length N2-N1 obtained by independently encoding the first encoded bit subsequence of N1 can be operated on (such as XOR operation). This is equivalent to encoding with a long code of length N2 during the encoding process, thereby obtaining better long code gain and improving encoding efficiency.

[0043] Yes, it is understandable. In the encoding process of polar codes, some input bits are affected by other bits during the encoding process, so the receiving device needs the assistance of other bits when recovering these bits. On the other hand, some input bits are not affected by other bits during the encoding process, so the receiving device can independently decode and recover these bits without the assistance of other bits.

[0044] Therefore, during the encoding of the fifth coded bit subsequence of length N2-N1 based on the first coded bit subsequence of length N1, it is advisable to place the fifth coded bit subsequence of length N2-N1 on a bit position unaffected by other bits. This allows the receiving device to independently decode the first information bit subsequence of length K1 based on the second coded bit subsequence of length N2-N1 without the assistance of other bits, thus improving decoding performance.

[0045] Secondly, this application provides a decoding method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to a receiving end device, a component used in the receiving end device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving end device. The component used in the transmitting end device can be within the transmitting end device or independent of it. The method includes: acquiring a symbol sequence, where the symbol sequence corresponds to a first encoded bit subsequence of length N1, and the first encoded bit subsequence of length N1 is contained within an encoded bit sequence of length N2; and decoding the symbol sequence to obtain a decoded sequence. The encoded bit sequence of length N2 is obtained by encoding an information bit sequence of length K2, which contains a first information bit subsequence of length K1, where K2 is greater than K1, N2 is greater than N1, and K1, K2, N2, and N1 are all positive integers. The decoded sequence corresponds to the first information bit subsequence of length K1.

[0046] Based on the second aspect, the encoding method of this application embodiment designs a layered transmission method, that is, the transmitting device encodes an information bit sequence of length N2 to obtain an encoded bit sequence of length N2, wherein the information bit sequence of length K2 includes a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1, and the encoded bit sequence of length N2 includes a first encoded bit subsequence of length N1, and the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1; that is, the first information bit subsequence of length K1 is encoded to obtain a first encoded bit subsequence of length N1, so that after the transmitting device outputs the encoded bit sequence, even if the receiving device cannot receive the complete encoded bit sequence (for example, the receiving device receives a first encoded bit subsequence of length N1), it can still recover the corresponding information bits according to the bit sequence it received (such as recovering the first information bit subsequence of length K1 from the symbol sequence corresponding to the first encoded bit subsequence of length N1), thereby improving the decoding performance.

[0047] Furthermore, even if the receiving device receives a symbol sequence corresponding to a partial encoded bit sequence (such as the first encoded bit subsequence of length N1), the receiving device can still recover the corresponding information bits (such as recovering the first information bit subsequence of length K1). Therefore, the method provided in this application can be flexibly applied to different application scenarios. For example, it can be applied to scenarios with different operating modes or different capabilities of devices. For example, when the receiving device is in power-saving mode or the receiving device has insufficient capability, so that it receives a partial encoded bit sequence (such as the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still perform decoding based on the method provided in this application, thereby improving the decoding performance of the receiving device.

[0048] In one possible design, the information bit sequence of length K2 also includes a second information bit subsequence of length K2-K1, and the first encoded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1.

[0049] In one possible design, the first information bit subsequence of length K1 includes a third information bit subsequence of length K3, where K3 is less than K1; correspondingly, the first encoded bit subsequence of length N1 includes a third encoded information bit subsequence of length N3, where the third information bit subsequence of length K3 corresponds to a third encoded bit subsequence of length N3, where N3 is less than N1.

[0050] In one possible design, the coded bit sequence of length N2 also includes a second coded bit subsequence of length N2-N1, and the second information bit subsequence of length K2-K1 corresponds to the second coded bit subsequence of length N2-N1; wherein, the first coded bit subsequence of length N1 is carried in the first resource, and the second coded bit subsequence of length N2-N1 is carried in the second resource, and the first resource and the second resource are different.

[0051] In one possible design, the receiving device has different receiving performance on the first resource and the second resource; and / or, the first resource and the second resource have different resource characteristics, including dedicated resources and common resources.

[0052] In one possible design, the first resource and the second resource have different resource characteristics, including: the first resource is a dedicated resource for the receiving device, and the second resource is a common resource.

[0053] In one possible design, the receiving device has different receiving performance on the first resource and the second resource, including: the receiving device has better receiving performance on the first resource than on the second resource.

[0054] In one possible design, the temporal resources of the first resource are located before the temporal resources of the second resource.

[0055] In one possible design, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 belong to different task types; the receiving device has different requirements for the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1; and / or, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 are transmitted at different times.

[0056] In one possible design, the encoded bit sequence of length N2 corresponds to a set of bit positions containing N2 bits. The set of bit positions includes a first set of bit positions and a second set of bit positions. The first set of bit positions contains N1 bits, the second set of bit positions contains N2-N1 bits, and the N1 bits contain K1 first bits. The first information bit subsequence of length K1 is located on the K1 first bits of the N1 bits.

[0057] In one possible design, the K1 first bits are the K1 bits with the highest reliability out of the N1 bits.

[0058] In one possible design, N2-N1 bits include K2-K1 first bits, and K2-K1 first bits are the K2-K1 bits with high reliability among N2-N1.

[0059] In one possible design, the K2 bits with high reliability among the N2 bits include the K1 first bits and the K2-K1 first bits.

[0060] The technical effects of any design in the second aspect can be referenced from the technical effects of the corresponding design in the first aspect, and will not be elaborated here.

[0061] Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be a transmitting end device, a chip or chip system of the transmitting end device, or a system-on-a-chip, etc. The communication device can execute the functions performed by the transmitting end device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0062] For example, the processing module is used to obtain an information bit sequence of length K2, which includes a first information bit subsequence of length K1, where K2 is greater than K1 and both K1 and K2 are positive integers; the processing module is also used to encode the information bit sequence of length K2 to obtain an encoded bit sequence of length N2, which includes a first encoded bit subsequence of length N1, where the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1, where N2 is greater than N1 and both N1 and N2 are positive integers; the transceiver module is used to output the encoded bit sequence of length N2.

[0063] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0064] Fourthly, embodiments of this application provide a communication device that can be applied to the receiving device described in the second aspect to achieve the functions performed by the receiving device. This communication device can be a receiving device, a chip or chip system of a receiving device, or a system-on-a-chip, etc. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the functions described above. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0065] For example, the transceiver module is used to acquire a symbol sequence, which corresponds to a first coded bit subsequence of length N1, and the first coded bit subsequence of length N1 is contained in a coded bit sequence of length N2; and to decode the symbol sequence to obtain a decoded sequence. The coded bit sequence of length N2 is obtained by encoding an information bit sequence of length K2, which contains a first information bit subsequence of length K1, where K2 is greater than K1, N2 is greater than N1, and K1, K2, N2, and N1 are all positive integers. The decoded sequence corresponds to the first information bit subsequence of length K1.

[0066] Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in the second aspect or any possible design of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0067] Fifthly, embodiments of this application provide a communication device including one or more processors; the one or more processors are configured to execute the method described in any one of the first to second aspects by means of logic circuits and / or by running computer programs or instructions.

[0068] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0069] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0070] In one possible design, the communication device is a chip or chip system.

[0071] In a sixth aspect, embodiments of this application provide a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to perform the method described in either the first or second aspect, processing and / or generating information based on the information.

[0072] In one possible design, the communication device is a chip or chip system.

[0073] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the methods described in either the first or second aspect to be performed.

[0074] Eighthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, cause the method described in either the first or second aspect to be executed.

[0075] Ninthly, embodiments of this application provide a computer program that, when run on a computer, causes the method described in either the first or second aspect to be executed.

[0076] In a tenth aspect, embodiments of this application provide a chip, including: a processor coupled to a memory, the memory being used to store programs or instructions, which, when executed by the processor, cause the method described in either the first or second aspect to be performed.

[0077] The technical effects of any of the design methods in aspects three through ten are similar to those in aspects one and two above, and will not be elaborated upon further.

[0078] Eleventhly, embodiments of this application provide a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description

[0079] Figure 1 A schematic diagram of a polar code fence diagram provided for an embodiment of this application;

[0080] Figure 2 A schematic diagram of another polar code fence diagram provided in an embodiment of this application;

[0081] Figure 3 A schematic diagram of another polar code fence diagram provided in an embodiment of this application;

[0082] Figure 4 A schematic diagram of a communication system provided in an embodiment of this application;

[0083] Figure 5 A schematic diagram illustrating encoding and decoding of a transmitting end device and a receiving end device according to an embodiment of this application;

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

[0085] Figure 7 A flowchart illustrating an encoding method provided in an embodiment of this application;

[0086] Figure 8 A schematic diagram of another polar code fence diagram provided in an embodiment of this application;

[0087] Figure 9 A schematic diagram of another polar code fence diagram provided in an embodiment of this application;

[0088] Figure 10 A schematic diagram of another polar code fence diagram provided in an embodiment of this application;

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

[0090] Figure 12 This is a schematic diagram of the structure of a receiving device provided in an embodiment of this application;

[0091] Figure 13 This is a schematic diagram of another communication device provided in an embodiment of this application;

[0092] Figure 14 This is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0093] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0094] Polar codes: Polar codes are the first coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity. They have the advantages of good decoding performance and low complexity. They have been selected by the third generation partnership project (3GPP) as the control channel coding scheme for the fifth generation (5G) enhanced mobile broadband (eMBB) scenario.

[0095] Specifically, a polar code is a linear code block that can generate a matrix G. N Among them, G N It is an N×N matrix. n = log₂(N). Where, Defined as the Kronecker product of n matrices F2. In other words, the kernel of the Kronecker product of the polar code is F2.

[0096] The encoding process of polar codes is as follows: in, It is a binary row vector with a length of N. A portion of the bits in the array is used to carry information; therefore, this portion of bits can be called information bits. The other portion of the bits consists of fixed values ​​agreed upon beforehand by the transmitting and receiving ends; therefore, this other portion of bits can be called fixed bits. The set of indices for the information bits can be denoted as... The set of fixed-bit indices can be denoted as supplement

[0097] Specifically, taking N=16 as an example, the encoding process of polar codes can be achieved through methods such as... Figure 1 The fence diagram shown in (a) represents the fence. (Right now );Will The fixed bits and information bits are placed on the leftmost bit position (i.e., the input bit position) of the fence diagram, and an n-order butterfly operation is performed sequentially from left to right to obtain the rightmost output bit of the fence diagram. (Right now In this context, the bit position where the information bit is located can also be called the information bit, and the bit position where the fixed bit is located can also be called the fixed bit. For example... Figure 1 As shown in (a), u8,u 11 ,u 12 ,u 13 ,u 14 ,u 15 ,u 16 All of these are information bits, therefore the bit positions they occupy are all information bits: u1, u2, u3, u4, u5, u6, u7, u9, u 10 All of them are fixed bits, so the bit position they occupy is a fixed bit.

[0098] It should be noted that a fixed bit can also be called a frozen bit, and a fixed position can also be called a frozen position; that is, "fixed bit" and "frozen bit" have the same meaning; "fixed position" and "frozen position" have the same meaning; therefore, in this application, the two terms that have the same meaning can be substituted for each other.

[0099] Correspondingly, decoding can be performed using the Successive Cancellation Decoding (SC) algorithm. In SC, the log likelihood ratio (LLR) of the information bits is calculated sequentially. For an information bit, if LLR > 0, the bit is set to 0; if LLR < 0, the bit is set to 1. For frozen bits, the bit is set to 0 regardless of the LLR value. A simple illustration of SC decoding is shown below. Figure 1 As shown in (b): There are 8 computation nodes in the diagram, including 4 f nodes and 4 g nodes. The computation of an f node requires 2 LLR inputs to its right, and the computation of a g node requires 2 LLR inputs to its right and 1 "Partial Sum" input above it. Note that the output can only be calculated after the inputs have been computed. According to the above rules, Figure 1 In (b) of the code, starting from the signal received on the right, the eight nodes are calculated sequentially, and the resulting decoding sequence is ①→②→③→④, which is the SC decoding process.

[0100] In wireless communication, the transmitting device typically encodes the information bit sequence to obtain an encoded bit sequence. This encoded bit sequence is then output, and the receiving device, upon receiving it, can decode it to recover the information bit sequence. During the decoding process, the receiving device must decode the complete encoded bit sequence. That is, if the receiving device receives only a portion of the encoded bit sequence (or an incomplete sequence), it cannot decode it and therefore cannot recover the information bits corresponding to that portion, resulting in degraded decoding performance.

[0101] For example, the length of the information bit sequence is K, the length of the encoded bit sequence is N, the length of a partial sequence is N², and the length of the information bits corresponding to the partial sequence is K². In this case, if the receiving device receives a partial sequence of length N², it cannot recover the information bits of length K². Here, N is greater than N², K is greater than K², and N, N², K, and K² are all positive integers.

[0102] For example, when the receiving device is under certain conditions (such as being in energy-saving mode, being a specific user, or being a limited-capacity device like an IoT device), it can only receive a portion of the sequence. Alternatively, due to interference, resource contention by other services, or other reasons, only a portion of the encoded bit sequence output by the sending device may be received by the receiving device. Therefore, if the receiving device cannot decode this portion of the sequence, it indicates that the receiving device is not functioning properly.

[0103] Given the requirement of the receiving device to decode a portion of the sequence, one possible implementation involves reconstructing a polar code based on the length K2 of the information bits and the length N2 of the partial bits. In this polar code, the K2 bits with the highest reliability are selected as the information bits. The transmitting device can then encode the K2-length partial sequence using this polar code to obtain a N2-length partial sequence, which it can then output. This output allows the receiving device to recover the K2-length information bits from this partial sequence.

[0104] Since the information bits of length K2 are a partial sequence of length N2 obtained by encoding with an independent polar code (a polar code of length N2), the information bits of length K2 can also be regarded as a complete information bit sequence, in which case the length of this information bit sequence is K2. Correspondingly, the partial sequence of length N2 can also be regarded as a complete encoded bit sequence, in which case the length of this encoded bit sequence is N2. Therefore, when the transmitting device outputs this partial sequence of length N2, the receiving device may receive a partial sequence of length N2. For example, the receiving device may receive a partial sequence of length N1. In this case, the receiving device cannot recover the corresponding information bits of length K1 from the partial sequence of length N1. Here, N2 is greater than N1, K2 is greater than K1, and N1 and K1 are both positive integers.

[0105] For example, with N2=16, N1=8, K2=7, and K1=4, the fence diagram of the polar code constructed based on N2 and K2 is as follows: Figure 2 As shown, K1 information bits are located in Figure 2 The bits represented by non-hollow circles in the input bits (i.e. Figure 2 In the bits represented by Pattern 1 and Pattern 2, the information bits of length K1 include u 13 ,u 14 ,u 15 ,u 16 Place it Figure 2 The information bits represented by pattern 2 in the diagram; the information bits of length K2 include u8, u 11 ,u 12 ,u 13 ,u 14 ,u 15 ,u 16 At this point, the information bits of length K2, excluding the information bits of length K1, that are of length K2 can be divided into information bits of length K2 and length K1 (including u8, u...). 11 ,u 13 ) placed Figure 2 The bit represented by pattern 1 in the diagram.

[0106] Therefore, after encoding, a partial sequence of length N2 can be obtained, which contains a partial sequence of length N1. Thus, if the receiving device receives the partial sequence of length N1, it needs to first obtain u... 11 ,u 13 And then based on u 11 ,u 13 Only then can the decoding of a partial sequence of length N1 be completed, thereby recovering the information bits of length K1. And u 11 ,u13 The sequence needs to be decoded from a portion of length N2. Therefore, if the receiving device only receives a portion of the sequence N1, it cannot decode that portion of the sequence N1, thus affecting the decoding performance of the receiving device.

[0107] Given that a partial sequence of length N2 includes a partial sequence of length N1, and information bits of length K2 include information bits of length K1, one possible implementation considers constructing polar codes based on N1, K1, and N2-N1 and K2-K1 respectively. That is, constructing a polar code of length N1 based on N1 and K1, and a polar code of length N2-N1 based on N2-N1 and K2-K1. Thus, using the polar code of length N1 to encode the information bits of length K1 yields a partial sequence of length N1, and using the polar code of length N2-N1 to encode the information bits of length K2-K1 (i.e., the information bits of length K1 excluding the information bits of length K1) yields a partial bit sequence of length N2-N1.

[0108] For example, with N2=16, N1=8, K2=7, and K1=4, the fence diagram of the polar code constructed based on N1 and K1 is as follows: Figure 3 As shown in (a), information bits of length K1 can be placed in Figure 3 The solid circles in (a) represent the bits; the fence diagram of the polar code constructed based on N2-N1 and K2-K1 is as follows. Figure 3 As shown in (b), the information bits of length K2-K1 can be placed in Figure 3 The bits represented by the solid circles in (b) are shown.

[0109] Therefore, even if the receiving device only receives a portion of the sequence of length N1, it can still recover the information bits of length K1. However, during the encoding process, the longer the code length, the higher the corresponding code length gain, or in other words, the higher the encoding efficiency. Therefore, compared to encoding using a polar code of length N2, encoding using a polar code of length N1 cannot obtain the long code gain, thus affecting the decoding performance of the receiving device.

[0110] In conclusion, there is currently no effective method to improve decoding performance. Therefore, how to improve decoding performance is a technical problem that urgently needs to be solved.

[0111] In view of this, embodiments of this application provide an encoding method and design a layered transmission method, wherein the transmitting device encodes an information bit sequence of length N2 to obtain an encoded bit sequence of length N2, wherein the information bit sequence of length K2 includes a first information bit subsequence of length K1, the encoded bit sequence of length N2 includes a first encoded bit subsequence of length N1, and the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1; that is, the first information bit subsequence of length K1 is encoded to obtain a first encoded bit subsequence of length N1, so that after the transmitting device outputs the encoded bit sequence, even if the receiving device cannot receive the complete encoded bit sequence (for example, the receiving device receives the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still recover the corresponding information bits based on the bit sequence it received (such as recovering the first information bit subsequence of length K1 from the symbol sequence corresponding to the first encoded bit subsequence of length N1), thereby improving decoding performance.

[0112] Furthermore, even if the receiving device receives a symbol sequence corresponding to a partial encoded bit sequence (such as the first encoded bit subsequence of length N1), the receiving device can still recover the corresponding information bits (such as recovering the first information bit subsequence of length K1). Therefore, the method provided in this application can be flexibly applied to different application scenarios. For example, it can be applied to scenarios with different operating modes or different capabilities of devices. For example, when the receiving device is in power-saving mode or the receiving device has insufficient capability, so that it receives a partial encoded bit sequence (such as the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still perform decoding based on the method provided in this application, thereby improving the decoding performance of the receiving device.

[0113] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0114] The encoding method provided in this application can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, a 5G mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, a vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an Internet of Things (IoT) system, a narrow band Internet of Things (NB-IoT) system, eMBB, ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), and various types of future communication systems. It can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, etc., without limitation.

[0115] The encoding method provided in this application can be applied to various communication scenarios. For example, it can be applied to one or more of the following communication scenarios: encoding of control channels, encoding of data channels, etc., without limitation.

[0116] The following is based on Figure 4 Taking an example, the communication system provided in the embodiments of this application will be described.

[0117] Figure 4 A schematic diagram of a communication system provided in an embodiment of this application is shown below. Figure 4 As shown, the communication system may include at least one terminal device and at least one network device.

[0118] in, Figure 4The terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink signaling and / or data, and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device can also use channel coding to encode uplink signaling and / or data, and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting and receiving devices can both be network devices or both be terminal devices, without restriction.

[0119] Figure 4 The terminal equipment in this context can be a device with wireless transceiver capabilities or a chip or chip system that can be configured on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. Terminal equipment can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0120] For example, Figure 4The terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, smart point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (light UE), reduced capability user equipment (REDCAPUE), vehicle equipment (such as vehicle units, in-vehicle modules, in-vehicle chips, on-board units (OBUs), or telematics terminals. Wireless terminals in industrial control, autonomous driving, telemedicine, smart grids, smart cities, smart homes, vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, drones with UAV-to-UAV (U2U) communication capabilities, and terminal equipment in future networks or future evolved public land mobile networks (PLMNs) are not restricted.

[0121] in, Figure 4The network equipment in this context can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system configurable within such devices, a logical node or module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network equipment can be either wired or wireless access-enabled.

[0122] For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, baseband units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0123] In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack.

[0124] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

[0125] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0126] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an open radioaccess network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through a software module, a hardware module, or a combination of software and hardware modules.

[0127] Based on the above description of the terminal device and network device, optionally, the encoding method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuit (ASIC), field-programmable gate array (FPGA), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0128] Optional, Figure 4 The communication system shown may also include artificial intelligence (AI) network elements to implement some or all AI-related operations.

[0129] For example, an AI network element can also be referred to as an AI node, AI device, AI entity, AI module, AI model, or AI unit, etc. The AI ​​network element can be built into a network element within a communication system. For instance, an AI network element can be an AI module built into a network device (such as an access network device), core network device, cloud server, or operation, administration, and maintenance (OAM) system to implement AI-related functions. The OAM system can act as the network management system for the core network device and / or the access network device. Alternatively, the AI ​​network element can also be a network element independently configured within the communication system. Optionally, the terminal device or its built-in chip can also include an AI entity to implement AI-related functions. Optionally, in this embodiment, the transmitting device (or source) and receiving device (or sink) can adopt the following... Figure 5 The process shown involves encoding and decoding. The transmitting device can be... Figure 4 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 4 Any terminal device or network device in the communication system shown.

[0130] in, Figure 5 The process described includes: the transmitting device can perform source encoding on its own generated bits to obtain a source bit stream; channel encoding is then applied to the source bit stream; after modulation, the modulated symbols are transmitted to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it can demodulate them, then perform channel decoding to recover the source bit stream; and finally, through source recovery (i.e., source decoding), the decoding result is obtained.

[0131] In practical implementation, Figure 4 As shown in the figure: various terminal devices and network devices can adopt Figure 6 The shown composition structure, or including Figure 6 The components shown. Figure 6 This is a schematic diagram illustrating the composition of a communication device 600 provided in an embodiment of this application. The communication device 600 can be a terminal device or a chip or system-on-a-chip within a terminal device; it can also be a network device or a chip or system-on-a-chip within a network device. For example... Figure 6 As shown, the communication device 600 includes a processor 601, a transceiver 602, and a communication line 603.

[0132] Furthermore, the communication device 600 may also include a memory 604. The processor 601, memory 604, and transceiver 602 can be connected via a communication line 603.

[0133] The processor 601 can be a central processing unit (CPU), a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 601 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0134] Transceiver 602 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area networks (WLAN), etc. Transceiver 602 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0135] Communication line 603 is used to transmit information between the components included in communication device 600.

[0136] Memory 604 is used to store instructions. These instructions can be computer programs.

[0137] The memory 604 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0138] It should be noted that the memory 604 can exist independently of the processor 601 or can be integrated with the processor 601. The memory 604 can be used to store instructions, program code, or some data, etc. The memory 604 can be located inside or outside the communication device 600, without limitation. The processor 601 is used to execute the instructions stored in the memory 604 to implement the encoding method provided in the following embodiments of this application.

[0139] In one example, processor 601 may include one or more CPUs, for example Figure 6 CPU0 and CPU1 in the CPU.

[0140] As an optional implementation, the communication device 600 includes multiple processors, for example, besides Figure 6 In addition to processor 601, it may also include processor 607.

[0141] As an optional implementation, the communication device 600 also includes an output device 605 and an input device 606. For example, the input device 606 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 605 is a device such as a display screen or speaker.

[0142] It should be noted that the communication device 600 can be a desktop computer, laptop computer, network server, mobile phone, tablet computer, wireless terminal, embedded device, chip system, or other device. Figure 6 Equipment with a similar structure. Furthermore... Figure 6 The structural composition shown does not constitute a limitation on the communication device, except... Figure 6 In addition to the components shown, the communication device may include more or fewer components than illustrated, or combine certain components, or have different component arrangements.

[0143] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0144] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0145] The following is combined Figure 4 The communication system shown below describes the encoding method provided in this application, with reference to the following embodiments. The transmitting device can be... Figure 4 Any terminal device or network device in the communication system shown, the receiving device can also be Figure 4Any terminal device or network device in the communication system shown. The transmitting or receiving device described in the following embodiments may include Figure 4 The component shown.

[0146] See Figure 7 The flowchart below illustrates an encoding method provided in an embodiment of this application. Figure 7 As shown, the method may include:

[0147] S701, The transmitting device acquires an information bit sequence of length K2.

[0148] The information bit sequence of length K2 contains a first information bit subsequence of length K1, where K2 is greater than K1 and both K1 and K2 are positive integers.

[0149] For example, the information bit sequence may include the information bits (payload bits) themselves, and K2 may be the number of information bits included in the information bit sequence. Alternatively, the information bit sequence may include information bits and cyclic redundancy check (CRC) bits, that is, the information bit sequence may be a CRC-encoded information bit sequence, and K2 may be the sum of the number of information bits and the number of CRC bits included in the information bit sequence.

[0150] Optionally, the information bit sequence of length K2 may also include a second information bit subsequence of length K2-K1.

[0151] For example, an information bit sequence of length K2 consists of a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1; or, an information bit sequence of length K2 can be divided into a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1. In other words, by splitting an information bit sequence of length K2, we can obtain a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1.

[0152] S702. The transmitting device encodes the information bit sequence of length K2 to obtain an encoded bit sequence of length N2.

[0153] The encoded bit sequence of length N2 contains a first encoded bit subsequence of length N1, and the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1. N2 is greater than N1, and both N1 and N2 are positive integers.

[0154] For example, the first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1. This can also be understood as: encoding the first information bit subsequence of length K1 can yield the first encoded bit subsequence of length N1.

[0155] Optionally, the first encoded bit subsequence of length N1 is uncorrelated with the second information bit subsequence of length K2-K1.

[0156] For example, the first encoded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1. This can be understood as follows: the first information bit subsequence of length K1 does not require the assistance of the second information bit subsequence of length K2-K1 during the encoding process; or, the first information bit subsequence of length K1 is unaffected by the second information bit subsequence of length K2-K1 during the encoding process. In other words, the first information bit subsequence of length K1 can be encoded independently to obtain the first encoded bit subsequence of length N1. Therefore, even if the receiving device can only receive the symbol sequence corresponding to the first encoded bit subsequence of length N1, it can still recover the first information bit subsequence of length K1 from the received bit sequence, thereby improving decoding performance.

[0157] Optionally, the coded bit sequence of length N2 may also include a second coded bit subsequence of length N2-N1.

[0158] For example, the second information bit subsequence of length K2-K1 corresponds to the second encoded bit subsequence of length N2-N1. This can also be understood as: encoding the second information bit subsequence of length K2-K1 can yield the second encoded bit subsequence of length N2-N1.

[0159] For example, the encoding scheme in step S702 includes, but is not limited to, convolutional codes (such as tail-biting convolutional coding (TBCC)), turbo codes, low-density parity check (LDPC) codes, and polar codes.

[0160] S703, The transmitting device outputs an encoded bit sequence of length N2; correspondingly, the receiving device acquires the symbol sequence.

[0161] For example, the transmitting device can modulate a coded bit sequence of length N2 to obtain a first symbol sequence. Alternatively, the transmitting device can interleave a coded bit sequence of length N2 to obtain an interleaved symbol sequence. Furthermore, the transmitting device can also modulate the interleaved symbol sequence to obtain the first symbol sequence.

[0162] Specifically, the transmitting device can also modulate the first coded bit subsequence of length N1 and the second coded bit subsequence of length N2-N1 respectively, or interleave and modulate them respectively, to obtain the first symbol subsequence and the second symbol subsequence. The first symbol subsequence includes both the first symbol subsequence and the second symbol subsequence.

[0163] In one example, the symbol sequence acquired by the receiving device corresponds to an encoded bit sequence of length N2.

[0164] For example, in this example, the receiving device is able to receive a first symbol sequence output from the sending device.

[0165] Specifically, the first symbol sequence sent by the transmitting device to the receiving device may be affected by interference during transmission through the channel, resulting in the receiving device receiving a first symbol sequence affected by noise and other interference, i.e., a second symbol sequence. In other words, the second symbol sequence is the first symbol sequence affected by noise and other interference.

[0166] Therefore, the receiving device can receive the first symbol sequence output from the transmitting device, which actually means that the receiving device receives the first symbol sequence affected by interference (i.e., the second symbol sequence); wherein, the second symbol sequence corresponds to an encoded bit sequence of length N2, and at this time, the symbol sequence in step S703 is the second symbol sequence.

[0167] In another example, the symbol sequence acquired by the receiving device corresponds to an encoded bit sequence of length K1.

[0168] For example, in this example, the receiving device can receive a portion of the first symbol sequence output by the transmitting device. Specifically, the first symbol sequence sent by the transmitting device to the receiving device may be affected by interference during channel transmission, causing it to become a second symbol sequence by the time it reaches the receiving device (i.e., the second symbol sequence is the first symbol sequence affected by noise and other interference). Furthermore, due to factors such as interference and preemption of resources in ultra-reliable low-latency communication (URLLC) services, the receiving device may not be able to receive the complete symbol sequence corresponding to the coded bit sequence of length N2 (i.e., the second symbol sequence); that is, the receiving device can only receive a portion of the second symbol sequence (this portion corresponds to a portion of the first symbol sequence output by the transmitting device), namely, the third symbol sequence. In other words, the third symbol sequence is a portion of the first symbol sequence after interference. That is, a portion of the second part of the sequence. For example, the third symbol sequence corresponds to a first coded bit subsequence of length N1 (i.e., the receiving device can recover a first information bit subsequence of length K1 from the received third symbol sequence)). At this point, the symbol sequence in step S703 is the second symbol sequence.

[0169] It should be noted that the above two examples illustrate the implementation of the receiving device by assuming that the receiving device can receive a coded bit sequence of length K1 or a symbol sequence corresponding to a coded bit sequence of length K2. In fact, the receiving device can also support receiving a coded bit sequence of length K3 or a symbol sequence corresponding to a coded bit sequence of length K1. In this case, the implementation of the receiving device is similar to that of the receiving device described above when "the receiving device can receive a coded bit sequence of length K1 or a symbol sequence corresponding to a coded bit sequence of length K2". For details, please refer to the relevant description of the receiving device above, which will not be repeated here.

[0170] For ease of description, the following embodiments use the example of "the receiving device being able to receive a coded bit sequence of length K1 or a symbol sequence corresponding to a coded bit sequence of length K2" to illustrate the relevant operations of the receiving device. This will be explained uniformly here and will not be repeated.

[0171] For example, the transmitting device can output the first symbol sequence based on the following three implementation methods:

[0172] Implementation method 1: The transmitting device can use unicast to output the first symbol sequence to a single receiving device; in this case, the receiving device in step S703 is the single receiving device mentioned above.

[0173] For example, in one implementation, the sending device outputting an encoded bit sequence of length N2 in step S703 can be replaced by the sending device sending a first symbol sequence to the receiving device. Correspondingly, the receiving device acquiring the symbol sequence can be replaced by the receiving device receiving a second symbol sequence; or, it can also be replaced by the receiving device receiving a third symbol sequence.

[0174] Implementation method 2: The transmitting device can use multicast or broadcast to output the first symbol sequence to multiple receiving devices; in this case, the receiving device in step S703 is any one of the multiple receiving devices mentioned above.

[0175] For example, in one implementation, the output of an encoded bit sequence of length N2 by the transmitting device in step S703 can be replaced by the transmitting device sending a first symbol sequence to the receiving device.

[0176] Correspondingly, for any one of the multiple receiving devices, the receiving device acquiring the symbol sequence can be replaced by: the receiving device receiving the second symbol sequence; or, it can also be replaced by: the receiving device receiving the third symbol sequence.

[0177] In other words, among multiple receiving devices, there may be multiple receiving devices that all receive the second symbol sequence; or, there may be multiple receiving devices that all receive the third symbol sequence; or, some of the multiple receiving devices may receive the second symbol sequence while others receive the third symbol sequence.

[0178] Implementation Method 3: The transmitting device can use multicast to output the first symbol subsequence to some of the multiple receiving devices and the second symbol subsequence to others.

[0179] For example, in one implementation, the transmitting device outputting an encoded bit sequence of length N2 in step S703 may include: the transmitting device sending a first symbol subsequence to some of the multiple receiving devices, and the transmitting device sending a second symbol subsequence to another part of the multiple receiving devices.

[0180] The first symbol subsequence may be affected by interference during transmission through the channel, causing the receiving device to receive a first symbol subsequence affected by noise and other interference, i.e., the third symbol subsequence. In other words, the third symbol subsequence is a third symbol sequence affected by noise and other interference. Therefore, for any one of the receiving devices among a plurality of receiving devices, acquiring a symbol sequence can be replaced by the receiving device receiving the third symbol subsequence. In this case, any one of the receiving devices among the plurality of receiving devices mentioned in step S703. Thus, the third symbol subsequence is the aforementioned third symbol sequence.

[0181] The second symbol subsequence may be affected by interference during transmission through the channel, causing the receiving device to receive a second symbol subsequence affected by noise and other interference, i.e., the fourth symbol subsequence. In other words, the fourth symbol subsequence is the second symbol sequence affected by noise and other interference. Therefore, for any one of the other receiving devices, acquiring a symbol sequence can be replaced by the receiving device receiving the fourth symbol subsequence.

[0182] S704. The receiving device decodes the symbol sequence to obtain the decoded sequence.

[0183] For example, based on different implementations of the symbol sequence, the decoding sequence in step S704 can be implemented based on the following three cases:

[0184] Case 1: The symbol sequence in step S704 is the second symbol sequence mentioned above. That is, the symbol sequence corresponds to an encoded bit sequence of length N2.

[0185] Optionally, the receiving device decodes the symbol sequence to obtain a decoded sequence, including: the receiving device decodes a sequence of length N2 corresponding to the second symbol sequence to obtain a decoded sequence. The decoded sequence corresponds to an information bit subsequence of length K2.

[0186] For example, when the first symbol sequence is obtained by the transmitting device modulating an coded bit sequence of length N2, the receiving device can demodulate the second symbol sequence to obtain a sequence to be decoded of length N2; when the first symbol sequence is obtained by the transmitting device interleaving and modulating an coded bit sequence of length N2, the receiving device can demodulate the second symbol sequence to obtain a demodulated sequence, and then deinterleave the demodulated sequence to obtain a sequence to be decoded of length N2.

[0187] Then, the sequence to be decoded, which is of length N2, is decoded to obtain a decoded sequence. At this time, the decoded sequence corresponds to an information bit sequence of length K2. That is to say, step S704 can also be considered as: the receiving device recovers the information bit sequence of length K2 based on the sequence to be decoded, which is of length N2.

[0188] For example, the receiving device can decode the sequence to be decoded with a length of N2 according to the encoding method in step S702 to obtain an information bit sequence with a length of K2.

[0189] Specifically, when polar coding is used in step S702, the receiving device can use SC decoding to decode the sequence to be decoded of length N2. The SC decoding process can be found above. Figure 1 The relevant description of (b) in the text will not be repeated here.

[0190] Case 2: The symbol sequence in step S704 is the third symbol sequence mentioned above. That is, the symbol sequence corresponds to an encoded bit sequence of length N1.

[0191] Optionally, the receiving device decodes the symbol sequence to obtain a decoded sequence, including: the receiving device decodes a sequence of length N1 corresponding to the third symbol sequence to obtain a decoded sequence. The decoded sequence corresponds to a first information bit subsequence of length K1.

[0192] In one example, the transmitting device outputs a first symbol sequence. If the first symbol sequence is obtained by the transmitting device modulating a coded bit sequence of length N2, the receiving device can demodulate a third symbol sequence to obtain a sequence to be decoded of length N1. If the first symbol sequence is obtained by the transmitting device interleaving and modulating a coded bit sequence of length N2, the receiving device can demodulate the third symbol sequence to obtain a demodulated sequence, and then deinterleave the demodulated sequence to obtain a sequence to be decoded of length N1.

[0193] Then, the sequence to be decoded, which is of length N1, is decoded to obtain a decoded sequence. At this time, the decoded sequence corresponds to a first information bit sequence of length K1. That is to say, step S704 can also be considered as: the receiving device recovers the first information bit sequence of length K1 based on the sequence to be decoded, which is of length N1.

[0194] In another example, the transmitting device outputs a first symbol subsequence. If the first symbol subsequence is obtained by the transmitting device modulating a first coded bit subsequence of length N1, the receiving device can demodulate the third symbol subsequence (or the third symbol sequence) to obtain a sequence to be decoded of length N1. If the first symbol subsequence is obtained by the transmitting device interleaving and modulating a first coded bit subsequence of length N1, the receiving device can demodulate the third symbol subsequence (or the third symbol sequence) to obtain a demodulated sequence, and then deinterleave the demodulated sequence to obtain a sequence to be decoded of length N1.

[0195] Then, the sequence to be decoded, which is of length N1, is decoded to obtain a decoded sequence. At this time, the decoded sequence corresponds to a first information bit subsequence of length K1. That is to say, step S704 can also be considered as: the receiving device recovers the first information bit subsequence of length K1 based on the sequence to be decoded, which is of length N1.

[0196] For example, the receiving device can decode the sequence to be decoded of length N1 according to the encoding method in step S702 to obtain the first information bit subsequence of length K1.

[0197] Specifically, when polar coding is used in step S702, the receiving device can use SC decoding to decode the sequence to be decoded of length N2. The SC decoding process can be found above. Figure 1 The relevant description of (b) in the text will not be repeated here.

[0198] based on Figure 7 The aforementioned encoding method employs a layered transmission approach. The transmitting device encodes an information bit sequence of length N² to obtain an encoded bit sequence of length N². The information bit sequence of length K² includes a first information bit subsequence of length K¹, and the encoded bit sequence of length N² includes a first encoded bit subsequence of length N¹. The first information bit subsequence of length K¹ corresponds to the first encoded bit subsequence of length N¹. In other words, the first information bit subsequence of length K¹ is encoded to obtain a first encoded bit subsequence of length N¹. Therefore, even if the receiving device cannot receive the complete encoded bit sequence after the transmitting device outputs the encoded bit sequence (e.g., the receiving device receives the symbol sequence corresponding to the first encoded bit subsequence of length N¹), it can still recover the corresponding information bits from the received bit sequence (e.g., recovering the first information bit subsequence of length K¹ from the symbol sequence corresponding to the first encoded bit subsequence of length N¹), thereby improving decoding performance.

[0199] Furthermore, even if the receiving device receives a symbol sequence corresponding to a partial encoded bit sequence (such as the first encoded bit subsequence of length N1), the receiving device can still recover the corresponding information bits (such as recovering the first information bit subsequence of length K1). Therefore, the method provided in this application can be flexibly applied to different application scenarios. For example, it can be applied to scenarios with different operating modes or different capabilities of devices. For example, when the receiving device is in power-saving mode or the receiving device has insufficient capability, so that it receives a partial encoded bit sequence (such as the symbol sequence corresponding to the first encoded bit subsequence of length N1), it can still perform decoding based on the method provided in this application, thereby improving the decoding performance of the receiving device.

[0200] The above is an overall description of the encoding method provided in this application. The "information bit sequence of length K2" involved in the above embodiments will be described in detail below. Specifically, for ease of description, the following description uses an information bit sequence of length K2 containing a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 as an example. This will be explained uniformly here and will not be repeated.

[0201] For example, an information bit sequence of length K2 includes, but is not limited to, some or all of the bits in a physical broadcast channel (PBCH).

[0202] For example, the transmitting device can distinguish between a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 based on the following three possible implementations:

[0203] In one possible implementation, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 belong to different task types. That is, the transmitting device can distinguish between the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 based on the task type.

[0204] For example, in this possible implementation, information for different task types refers to information located in different sub-bands. Specifically, for a frequency band, a certain sub-band within that frequency band is located (or is close to) the core (or center) position of that frequency band, and therefore, that sub-band can also be called the core band (or center band); or, some sub-bands within that frequency band are located (or are close to) the edge position of that frequency band, and therefore, that sub-band can also be called a sideband.

[0205] Typically, a receiving device can successfully receive information in the core band, but a receiving device with weaker receiving capabilities cannot successfully receive information in the side band. Therefore, the transmitting device can divide the information into a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 according to the importance of the information, and place the more important information in the core band for output to ensure that the more important information can be successfully received by the receiving device.

[0206] Alternatively, it can be viewed that different task types of information refer to information with different probabilities of successful transmission (i.e., successful reception by the receiving device). Specifically, information in the core band has a higher probability of successful transmission than information in the sideband.

[0207] For example, a first information bit subsequence of length K1 can be in the core band, and a second information bit subsequence of length K2-K1 can be in the side band; that is, the probability of successful transmission of the first information bit subsequence of length K1 is greater than the probability of successful transmission of the second information bit subsequence of length K2-K1.

[0208] In another possible implementation, the receiving device has different requirements for the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1. That is, the transmitting device can distinguish between the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 according to the requirements of the receiving device.

[0209] For example, in this possible implementation, the receiving device has different needs for different information, or in other words, the receiving device has different degrees of need for different information. Therefore, the sending device can divide the information into a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 based on the degree of need the receiving device has for the information; for example, the information with a higher degree of need by the receiving device is used as the first information bit subsequence of length K1, and the information with a higher degree of need by the receiving device is used as the second information bit subsequence of length K2-K1.

[0210] In another possible implementation, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 are transmitted at different times. That is, the transmitting device can distinguish between the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 based on the transmission time of the information.

[0211] For example, in this possible implementation, the transmitting device can divide the information resources into a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 based on the time-domain resources. For instance, the information with the earlier time-domain resources can be used as the first information bit subsequence of length K1, and the information with the later time-domain resources can be used as the second information bit subsequence of length K2-K1. This ensures that the time-domain resources of the first information bit subsequence of length K1 are located before the time-domain resources of the second information bit subsequence of length K2-K1, or in other words, the transmission time of the first information bit subsequence of length K1 is located before the transmission time of the second information bit subsequence of length K2-K1. Furthermore, the transmitting device can first transmit the first encoded bit subsequence of length N1 corresponding to the first information bit subsequence of length K1, and then transmit the second encoded bit subsequence of length N2-N1 corresponding to the first information bit subsequence of length K2-K1.

[0212] It is understood that the above examples describe three ways to distinguish between a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1. In fact, any two or three of the above three methods can be used in combination to distinguish between a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1. For details, please refer to the relevant descriptions in the above three possible implementations, which will not be repeated here.

[0213] Optionally, the first information bit subsequence of length K1 includes a third information bit subsequence of length K3, where K3 is less than K1; correspondingly, the first encoded bit subsequence of length N1 includes a third encoded information bit subsequence of length N3, where the third information bit subsequence of length K3 corresponds to a third encoded bit subsequence of length N3, where N3 is less than N1.

[0214] For example, a third information bit subsequence of length K3 corresponds to a third encoded bit subsequence of length N3. This can also be understood as: encoding a third information bit subsequence of length K3 can yield a third encoded bit subsequence of length N3.

[0215] Optionally, the first information bit subsequence of length K1 also includes a fourth information bit subsequence of length K1-K3, and the third encoded information bit subsequence of length N3 is unrelated to the fourth information bit subsequence of length K1-K3.

[0216] For example, a first information bit subsequence of length K1 is composed of a third information bit subsequence of length K3 and a fourth information bit subsequence of length K1-K3; or, in other words, the first information bit subsequence of length K1 can be divided into a third information bit subsequence of length K3 and a fourth information bit subsequence of length K1-K3. In other words, by splitting the first information bit subsequence of length K1, we can obtain a third information bit subsequence of length K3 and a fourth information bit subsequence of length K1-K3.

[0217] For example, the third encoded information bit subsequence of length N3 is unrelated to the fourth information bit subsequence of length K1-K3. This can be understood as follows: the third information bit subsequence of length K3 does not require the assistance of the fourth information bit subsequence of length K1-K3 during the encoding process; or, in other words, the third information bit subsequence of length K3 is not affected by the fourth information bit subsequence of length K1-K3 during the encoding process. That is, the third information bit subsequence of length K3 can be independently encoded to obtain the third encoded bit subsequence of length N3. Therefore, even if the receiving device can only receive the symbol sequence corresponding to the third encoded bit subsequence of length N3, it can still recover the third information bit subsequence of length K3 from the received bit sequence, thereby improving decoding performance.

[0218] Optionally, the first encoded bit subsequence of length N1 further includes a fourth encoded bit subsequence of length N1-N3. For example, the fourth encoded bit subsequence of length N1-N3 is obtained by encoding the third information bit subsequence of length K3 and the fourth information bit subsequence of length K1-K3.

[0219] Optionally, the third information bit subsequence of length K3 may also contain a fifth information bit subsequence of length K4, and further, a sixth information bit subsequence of length K3-K4. The fifth information bit subsequence of length K4 is different from the sixth information bit subsequence of length K3-K4, where K4 is less than K3. Correspondingly, the third encoded bit subsequence of length N3 includes a fifth encoded bit subsequence of length N4. The fifth information bit subsequence of length K4 corresponds to the fifth encoded bit subsequence of length N4. The encoded subsequence corresponding to the fifth information bit subsequence of length K4 is unrelated to the sixth information bit subsequence of length K3-K4, where N4 is less than N3.

[0220] Optionally, the third coded bit subsequence of length N3 also includes a sixth coded bit subsequence of length N3-N4. The sixth information bit subsequence of length K3-K4 corresponds to the sixth coded bit subsequence of length N3-N4.

[0221] Specifically, the fifth information bit subsequence of length K4, the sixth information bit subsequence of length K3-K4, the fifth encoded bit subsequence of length N4, and the sixth encoded bit subsequence of length N3-N4 are similar to the implementation of the Xth information bit subsequence and the Xth encoded bit subsequence in the above embodiments. For details, please refer to the relevant descriptions in the above embodiments.

[0222] In other words, in this application, the information bit sequence (or information bit subsequence) of length Ki actually includes an information bit subsequence of length Km and an information bit subsequence of length Ki-Km. Where Ki is greater than Km. Correspondingly, the encoded bit sequence (or encoded bit subsequence) of length Ni actually includes an information bit subsequence of length Nm. Wherein, the information bit sequence of length Ki corresponds to the encoded bit sequence of length Ni, the information bit subsequence of length Km corresponds to the information bit subsequence of length Nm, and the information bit subsequence of length Nm is unrelated to the information bit sequence of length Ki-Km, and Ni is greater than Nm.

[0223] Therefore, regardless of whether the coded bit sequence of length Ni output by the transmitting device can be fully received by the receiving device, the receiving device can recover a portion of the information bit sequence of length Ki based on the received symbol sequence. For example, if Ni is N2, and the symbol sequence received by the receiving device corresponds to a first coded bit subsequence of length N1, then the receiving device can recover a first information bit subsequence of length K1 based on this symbol sequence; or, if the symbol sequence received by the receiving device corresponds to a third coded bit subsequence of length N3, then the receiving device can recover a third information bit subsequence of length K3 based on this symbol sequence; or, if the symbol sequence received by the receiving device corresponds to a fifth coded bit subsequence of length N4, then the receiving device can recover a fifth information bit subsequence of length K5 based on this symbol sequence, and so on. If the symbol sequence received by the receiving device corresponds to a Y-th coded bit subsequence of length Nm, then the receiving device can recover a Y-th information bit subsequence of length Km based on this symbol sequence.

[0224] For example, parameters such as Ki, Km, Ni, and Nm can be pre-defined. For instance, these parameters can be predetermined through a protocol; or, the sending device can determine and inform the receiving device; such as the sending device determining and informing the receiving device autonomously, or the sending device determining these parameters based on the state of the receiving device, i.e., the receiving device can inform the sending device of its state, thereby the sending device informing the receiving device after determining these parameters.

[0225] For ease of description, the following description uses an information bit sequence of length K2, which includes a first encoded bit subsequence of length K1 and a second encoded bit subsequence of length K2-K1, as an example. This will be explained uniformly here and will not be repeated.

[0226] Optionally, a first coded bit subsequence of length N1 is carried in a first resource, and a second coded bit subsequence of length N2-N1 is carried in a second resource, wherein the first resource and the second resource are different.

[0227] In one possible implementation, the receiving device has different receiving performance on the first resource and the second resource. That is, the different resources can be divided based on the receiving performance of the receiving device.

[0228] For example, in this possible implementation, resources with higher reception performance of the receiving device can be designated as first resources, and resources with lower reception performance can be designated as second resources. That is, the receiving device's reception performance on the first resource is better than its reception performance on the second resource. This ensures that the receiving device can successfully receive the first coded bit subsequence of length N1, thereby recovering the first information bit subsequence of length K1 and improving decoding performance. For example, resources that the receiving device can receive and detect are designated as first resources; resources that the receiving device cannot receive or detect are designated as second resources.

[0229] Optionally, based on the foregoing, the transmission time of the first information bit subsequence of length K1 is before the transmission time of the second information bit subsequence of length K2-K1; that is, the transmission time of the first encoded bit subsequence of length N1 is before the transmission time of the second encoded bit subsequence of length N2-N1. Since the first encoded bit subsequence of length N1 is carried in the first resource, and the second encoded bit subsequence of length N2-N1 is carried in the second resource, it can also be considered that the time domain resource of the first resource is before the time domain resource of the second resource.

[0230] In another possible implementation, the first resource and the second resource have different resource characteristics.

[0231] As an example, resource characteristics include dedicated resources and public resources.

[0232] For example, in this possible implementation, the dedicated resources of the receiving device can be defined as the first resource, and the public resources as the second resource. Here, the dedicated resource refers to the dedicated resources of the receiving device. That is, the first resource is the dedicated resource of the receiving device, and the second resource is the public resource.

[0233] Because public resources are easily preempted or interfered with by other services, the receiving device may fail to successfully receive the second encoded bit subsequence of length K2-K1. The first encoded bit subsequence of length N1 is sent through dedicated resources to ensure that the receiving device can successfully receive the first encoded bit subsequence of length N1, thereby recovering the first information bit subsequence of length K1 and improving decoding performance.

[0234] Optionally, based on the foregoing, the transmission time of the first information bit subsequence of length K1 is before the transmission time of the second information bit subsequence of length K2-K1; that is, the transmission time of the first encoded bit subsequence of length N1 is before the transmission time of the second encoded bit subsequence of length N2-N1. Since the first encoded bit subsequence of length N1 is carried in the first resource, and the second encoded bit subsequence of length N2-N1 is carried in the second resource, it can also be considered that the time domain resource of the first resource is before the time domain resource of the second resource.

[0235] As another example, resource characteristics include preset resources, as well as other resources besides preset resources. Specifically, preset resources may include one or more of time-domain resources, frequency-domain resources, or spatial-domain resources.

[0236] For example, in this possible implementation, a preset resource can be identified as the first resource, and other resources can be identified as the second resource.

[0237] The above two possible implementation methods are illustrated by taking the synchronous transmission of the first resource and the second resource as an example. In fact, the first resource and the second resource can also be transmitted asynchronously. That is, the transmitting device can first transmit the first resource (i.e., the transmitting device first transmits the first encoded bit subsequence of length N1) and then transmit the second resource (i.e., the transmitting device first transmits the second encoded bit subsequence of length N2-N1).

[0238] The above describes the implementation of an information bit sequence of length N2. The implementation of the "encoding" involved in the above embodiments will be described in detail below. For ease of description, the following description uses the polar code encoding scheme as an example. This will be explained uniformly here and will not be repeated.

[0239] In one possible implementation, a first information bit subsequence of length K1 is jointly encoded with a second information bit subsequence of length K2-K1.

[0240] Optionally, the transmitting device can determine a bit sequence to be encoded of length N2 based on an information bit sequence of length K2, and then encode the bit sequence to be encoded of length N2 to obtain a bit sequence to be encoded of length N2; that is, the transmitting device encodes an information bit sequence of length K2 to obtain an encoded bit sequence of length N2, including: the transmitting device determines a bit sequence to be encoded of length N2 based on an information bit sequence of length K2; and encodes the bit sequence to be encoded of length N2 to obtain an encoded bit sequence of length N2.

[0241] The bit sequence to be encoded with a length of N2 corresponds to a set of bit positions containing N2 bits, and the set of bit positions includes a first set of bit positions and a second set of bit positions.

[0242] The first bit position set contains N1 bits, which in turn contain K1 first bits, and a first information bit subsequence of length K1 is located on the K1 first bits; the second bit position set contains N2-N1 bits, which in turn contain K2-K1 first bits, and a second information bit subsequence of length K2-K1 is located on the K2-K1 first bits.

[0243] For example, the transmitting device can map a first information bit subsequence of length K1 onto K1 first bits, and a second information bit subsequence of length K2-K1 onto K2-K1 first bits; or, the transmitting device can interleave the information bit sequence of length K2, so that the first information bit subsequence of length K1 can be mapped onto K1 first bits, and the second information bit subsequence of length K2-K1 can be mapped onto K2-K1 first bits. This yields a bit sequence to be encoded of length N2.

[0244] Alternatively, the transmitting device can sequentially determine each bit in the bit position set. If the bit is one of the K1 first bits, then place one bit of the first information bit subsequence of length K1 on the bit. If the bit is one of the K2-K1 first bits, then place one bit of the second information bit subsequence of length K2-K1 on the bit.

[0245] Optionally, in the first bit position set containing N1 bits, K1 first bits are the K1 bits with the highest reliability among the N1 bits. That is, the bit position of the first information bit subsequence of length K1 is determined based on the reliability of the bits in the first bit position set.

[0246] In one implementation, the N1 bits in the first bit position set do not include rate matching bits. The rate matching bits include punctured bits (or simply punctured bits) and / or shortened bits (or simply shortened bits). In this implementation, the K1 first bits are the K1 bits with the highest reliability among the N1 bits in the first bit position set. Therefore, the first bit position set contains N2-K1 frozen bits (or fixed bits).

[0247] In another implementation, the N1 bits in the first bit position set include W rate matching bits; W is a positive integer. In this implementation, the K1 first bits are the top K1 bits with the highest reliability among the remaining N1-W bits (excluding the W rate matching bits) in the N1 bits included in the first bit position set. Therefore, the first bit position set contains N1-K1-W frozen bits (or, more specifically, fixed bits). Specifically, if W equals N1-K1, it means the first bit position set does not contain frozen bits; if W is less than N1-K1, it means the first bit position set contains frozen bits (i.e., N1-K1-W frozen bits).

[0248] Optionally, in the second bit position set containing N2-N1 bits, the K2-K1 first bits are the K2-K1 bits with the highest reliability among N2-N1. That is, the bit position of the second information bit subsequence of length K2-K1 is determined based on the reliability of the bits in the second bit position set.

[0249] In one implementation, the N2-N1 bits in the second bit position set do not include rate matching bits. In this implementation, the K2-K1 first bits are the highest reliability bits among the N2-N1 bits in the second bit position set. Therefore, the second bit position set contains N2-N1-K2+K1 freeze bits.

[0250] In another implementation, the N2-N1 bits in the second bit position set contain Q rate matching bits; Q is a positive integer. In this implementation, the K2-K1 first bits are the highest reliability bits among the remaining N2-N1-Q bits (excluding the Q rate matching bits) in the N2-N1 bits included in the second bit position set. Therefore, the second bit position set contains N2-N1-K2+K1-Q frozen bits. Specifically, if Q equals N2-N1-K2+K1, it means the second bit position set does not contain frozen bits; if Q is less than N2-N1-K2+K1, it means the first bit position set contains frozen bits (i.e., N2-N1-K2+K1-Q frozen bits).

[0251] Optionally, the information bit sequence of length K2 is located on the K2 bits with high reliability among the N2 bits contained in the bit position set. Since the first information bit subsequence of length K1 is located on the K1 first bits, and the second information bit subsequence of length K2-K1 is located on the K2-K1 first bits, the K2 bits contain the K1 first bits and the K2-K1 first bits.

[0252] For example, if the N2 bits include a rate matching bit, then the K2 bits are the K2 bits with the highest reliability among the remaining bits of the N2 bits excluding the rate matching bit. If the N2 bits do not include a rate matching bit, then the K2 bits are the K2 bits with the highest reliability among the N2 bits.

[0253] Optionally, the bit position set is the input bit position set of a fence diagram of a polar code of length N2. Therefore, the bit sequence to be encoded of length N2 corresponds to a bit position set containing N2 bits. This can be understood as: placing the bit sequence to be encoded of length N2 on the bit position set, and then performing polar coding on the bit sequence to be encoded of length N2 based on this fence diagram to obtain an encoded bit sequence of length N2. Here, the first information bit subsequence of length K1 is located on the K1 first bits in the first bit position set; the second information bit subsequence of length K2-K1 is located on the K2-K1 first bits in the second bit position set. For example, the first bit can be called an information bit.

[0254] Specifically, the fence diagram of the polar code of length N2 is formed by concatenating the fence diagram #1 of the polar code of length N1 and the fence diagram #2 of the polar code of length N2-N1. The input bits of fence diagram #1 constitute the first set of bit positions, and the input bits of fence diagram #2 constitute the second set of bit positions.

[0255] As mentioned above, the K1 first bits are determined based on the reliability of the bits in the first bit position set, and the K2-K1 first bits are determined based on the reliability of the bits in the second bit position set. Since the K2 bits with high reliability out of the N2 bits, even if the information bits are determined based on the fence diagrams of their respective short codes (i.e., K1 first bits are determined based on the first bit position set of fence diagram #1, and K2-K1 first bits are determined based on the second bit position set of fence diagram #2), they can still achieve a similar or the same effect as the information bits determined based on the fence diagram of the long code obtained by splicing short codes (i.e., the fence diagram of the polar code with a length of N2).

[0256] For example, a bit sequence to be encoded of length N2 includes a first bit subsequence to be encoded of length N1 and a second bit subsequence to be encoded of length N2-N1. Thus, the first bit subsequence to be encoded of length N1 is placed in the first bit position set; the second bit subsequence to be encoded of length N2-N1 is placed in the second bit position set. Alternatively, in the fence diagram of the resulting polar code of length N2, the first bit subsequence to be encoded of length N1 is placed at the input bit position of fence diagram #1, and the second bit subsequence to be encoded of length N2-N1 is placed at the input bit position of fence diagram #2.

[0257] As an example, fence diagram #1 and fence diagram #2 are concatenated to obtain a fence diagram of polar code of length N2. That is, in the bit sequence to be encoded of length N2, the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are concatenated.

[0258] Example #1, taking N2 as 16, N1 as 8, K2 as 7, and K1 as 4 as an example, N2-N1 is 8, and K2-K1 is 3; therefore, the fence diagram #1 contains 8 input bits, including 4 information bits (such as...). Figure 8 Pattern #1 represents the bit; Fence pattern #2 contains 8 input bits, including 3 information bits (such as...). Figure 8 (The bit represented by pattern #3 in the diagram). Taking the example that neither fence diagram #1 nor fence diagram #2 contains a rate matching bit, fence diagram #1 and fence diagram #2 are as follows: Figure 8 As shown, the 8 input bits in fence diagram #1 also include 4 freeze bits (such as...). Figure 8 Pattern #2 represents the bit position. The 8 input bits in fence diagram #2 also include 5 freeze bits (such as...). Figure 8 The bit represented by pattern #4 in the diagram); after concatenating fence diagram #1 and fence diagram #2, the resulting fence diagram corresponding to the polar code of length N2 is (e.g., Figure 8 The fence diagram shown is #3.

[0259] The first bit position set includes {0, 0, 0, 1, 0, 1, 1, 1}, and the second bit position set includes {0, 0, 0, 0, 0, 1, 1, 1}, where 0 represents a freeze bit and represents an information bit; at this time, Figure 8 The input bits (i.e., the set of bit positions) of the fence diagram #3 in the diagram are {0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1}.

[0260] Alternatively, the set of bit positions includes bits #0 to #15; where bits #0 to #4, bits #8 to #10, and bit #12 are all freeze bits; and bits #5 to #7, bit #11, and bits #13 to #15 are all information bits. Furthermore, the set of bit positions is the union of the first set of bit positions and the second set of bit positions. The first set of bit positions includes bits #8 to #15, and the second set of bit positions includes bits #0 to #7.

[0261] Example #2, with N2 = 16, N1 = 12, K2 = 6, and K1 = 5, the value of N2-N1 is 4, and the value of K2-K1 is 1. Therefore, fence diagram #1 contains 12 input bits, including 5 information bits; fence diagram #2 contains 4 input bits, including 1 information bit. Taking the case where neither fence diagram #1 nor fence diagram #2 contains a rate matching bit, the 12 input bits in fence diagram #1 also contain 7 freeze bits, and the 4 input bits in fence diagram #2 also contain 3 freeze bits. In this case, the first bit position set includes {0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1}, and the second bit position set includes {0, 0, 0, 1}, where 0 represents a freeze bit and 1 represents an information bit. Therefore, after concatenating fence diagram #1 and fence diagram #2, the input bits (i.e., the set of bit positions) in the fence diagram corresponding to the polar code of length N2 include {0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1}.

[0262] Alternatively, the set of bit positions includes bits #0 to #15; where bits #0 to #2, bits #4 to #6, bits #8 to #10, and bit #12 are all frozen bits; and bits #3, #7, #11, and bits #13 to #15 are all information bits. Furthermore, the set of bit positions is the union of the first set of bit positions and the second set of bit positions. The first set of bit positions includes bits #4 to #15, and the second set of bit positions includes bits #0 to #3.

[0263] For example, in this example, it can be assumed that: in the first bit subsequence of length N1, there are no bits in the second bit subsequence of length N2-N1 that are separated from each other by one or more bits in the first bit subsequence of length N2-N1; or, in the second bit subsequence of length N2-N1, there are no bits in the first bit subsequence of length N1 that are separated from each other by one or more bits in the first bit subsequence of length N1.

[0264] For example, when the value of K1 approaches the value of K2 (e.g., K1 = K2), that is, when the difference between K2 and K1 approaches 0 (e.g., K2 - K1 = 0), fence diagram #1 and fence diagram #2 are concatenated to obtain a fence diagram of polar code with a length of N2.

[0265] As another example, fence diagram #1 and fence diagram #2 are cross-stitched to obtain a fence diagram of polar code of length N2. That is, in the bit sequence to be encoded of length N2, the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are interleaved. In other words, the bit spacing in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 is distributed.

[0266] For example, the alternating distribution of a first bit subsequence of length N1 and a second bit subsequence of length N2-N1 can be understood as: the bit spacing distribution within the first bit subsequence of length N1 and the second bit subsequence of length N2-N1. That is, in the first bit subsequence of length N1, there exists a gap between adjacent bits that is one or more bits from the second bit subsequence of length N2-N1; or, in the second bit subsequence of length N2-N1, there exists a gap between adjacent bits that is one or more bits from the first bit subsequence of length N1.

[0267] For ease of description, the following description uses the example of "a second bit subsequence of length N2-N1 containing X bits from a first bit subsequence of length N1 between two adjacent bits". In the following embodiments, these two adjacent bits will be referred to as the first bit and the second bit, and any bit from the X bits of the first bit subsequence of length N1 will be referred to as the third bit. This will be explained uniformly here and will not be repeated.

[0268] At this point, in the second subsequence of bits to be encoded with length N2-N1, there exists a gap of X bits from the first subsequence of bits to be encoded with length N1 between any two adjacent bits. This can also be understood as: the second subsequence of bits to be encoded with length N2-N1 contains a first bit and a third bit (the first bit and the second bit are adjacent bits), and there is a gap of X bits between the first bit and the second bit. Furthermore, these X third bits are X consecutive bits in the second subsequence of bits to be encoded with length N2-N1. X is a positive integer.

[0269] In other words, for any two adjacent bits in the second bit subsequence of length N2-N1 to be encoded, the adjacent bits are separated by 0 bits (i.e., in the bit subsequence of length N2 to be encoded, the adjacent bits are still adjacent), or the adjacent bits are separated by one or more third bits. Among them, when the adjacent bits are separated by X bits, the adjacent bits are the first bit and the second bit.

[0270] For ease of description, the following description uses "the adjacent bits are separated by 0 or X third bits" as an example. That is, in the second bit subsequence to be encoded with a length of N2-N1, there is no third bit between adjacent bits (i.e., the adjacent bits are separated by 0 third bits), or the adjacent bits are separated by X third bits.

[0271] Optionally, the minimum value of K1 is K2 / 2, meaning the difference between K2 and K1 is less than or equal to K1. For example, K2 can be 7 and K1 can be 4; or K2 can be 7 and K1 can be 6.

[0272] Understandably, during the encoding process of polar codes, some input bits are affected by other bits (or require the assistance of other bits for encoding), so the receiving device needs the assistance of these other bits to recover these bits. On the other hand, some input bits are not affected by other bits during the encoding process (or can be encoded independently), so the receiving device can decode these bits independently to recover them without the assistance of other bits.

[0273] like Figure 9 As shown in (a), during the butterfly operation of the fence diagram, bit #1 is transformed into bit #3 through the butterfly operation, and bit #2 is transformed into bit #4 through the butterfly operation.

[0274] In this context, bit #3 is obtained by butterfly operation on bit #1. This means that bit #3 is obtained by XORing bit #1 and bit #2. In other words, bit #1 is affected by bit #2 during encoding, so bit #2 is needed to recover bit #1 when decoding bit #3. Bit #4 is obtained by butterfly operation on bit #2. This means that bit #4 is obtained by operating on bit #2 itself. In other words, bit #2 is independently encoded to obtain bit #4, so bit #2 can be recovered by directly decoding bit #4.

[0275] Furthermore, in such Figure 9 In the fence diagram of polar codes of length 8 in (b), based on Figure 9 As shown in (a), during the butterfly operation of the first layer, the bits at bit #0, bit #2, bit #4, and bit #6 are all affected by other bits during the encoding process (i.e., the bit at bit #0 is affected by the bit at bit #1, the bit at bit #2 is affected by the bit at bit #3, the bit at bit #4 is affected by the bit at bit #5, and the bit at bit #6 is affected by the bit at bit #7), while the bits at bit #1, bit #3, bit #5, and bit #7 are not affected by other bits during the encoding process.

[0276] During the butterfly operation in the second layer, the bits at bit #0, bit #1, bit #4, and bit #5 are all affected by other bits during the encoding process (i.e., the bit at bit #0 is affected by the bit at bit #2, the bit at bit #1 is affected by the bit at bit #3, the bit at bit #4 is affected by the bit at bit #6, and the bit at bit #5 is affected by the bit at bit #7), while the bits at bit #2, bit #3, bit #6, and bit #7 are not affected by other bits during the encoding process.

[0277] During the butterfly operation at the third layer, the bits at bit #0, bit #1, bit #2, and bit #3 are all affected by other bits during the encoding process (i.e., the bit at bit #0 is affected by the bit at bit #4, the bit at bit #1 is affected by the bit at bit #5, the bit at bit #2 is affected by the bit at bit #6, and the bit at bit #3 is affected by the bit at bit #7), while the bits at bit #4, bit #5, bit #6, and bit #7 are not affected by other bits during the encoding process.

[0278] If bits #1, #3, #5, and #7 all belong to bit set #1, and bits #0, #2, #4, and #6 all belong to bit set #2, then it can be seen that: in the first-level butterfly operation, bits located in bit set #2 are affected by bits in bit set #1, while bits located in bit set #1 are not affected by bits in bit set #1 during the encoding process. In the second and third-level butterfly operations, bits located in bit set #1 and bits located in bit set #2 are both affected by bits in their respective sets. That is to say, in Figure 9 In the fence diagram shown in (b), the bit located in bit set #1 is only affected by other bits in its set during the polarization encoding process, and is not affected by bits in other sets (such as bit set #2); therefore, for the bit located in bit set #1, the encoded bit subsequence obtained by its polarization encoding can be decoded independently to recover the bit located in bit set #1.

[0279] Therefore, it is possible to base on Figure 9 (like Figure 9 (a) or Figure 9 Based on the principle described in (b)), the value of X is set such that after the first bit position set and the second bit position set are concatenated based on the value of X, the first bit subsequence of length N1 located in the first bit position set is not affected by the second bit subsequence of length N2-N1 during the encoding process. In other words, based on... Figure 9 The principle shown, regardless of Figure 8 Whether fence diagrams #1 and #2 are concatenated or cross-stitched to obtain a fence diagram of polar code of length N2 (such as fence diagram #3), it can be guaranteed that in this fence diagram, the bits in the input bit position (i.e. the first bit position set) of fence diagram #1 are not affected by other bits during the encoding process.

[0280] For example, the value of X can be determined based on the following two cases:

[0281] Case 1: N2-N1 is equal to N1, or in other words, N2-N1 = N1 (i.e., N2 = 2 * N1).

[0282] Optionally, in one case, X can be a power of 2, so that the bits located in the first bit position set are not affected by other bits during the encoding process.

[0283] Optionally, in one case, the values ​​of N2 and N1 can be integer powers of 2.

[0284] For example, N2 is 16 and N1 is 8; in this case, X can be any one of 1, 2, or 4.

[0285] Optionally, the value of X is negatively correlated with the difference between K2 and K1. That is, the larger the difference between K2 and K1, the smaller the value of X. For example, when the value of K1 approaches K2 / 2 (such as K1 = K2 / 2), that is, when the difference between K2 and K2 approaches K1 (such as equal to K1), the value of X can be 1.

[0286] Optionally, in a bit sequence of length N2 to be encoded, the bits in the first bit subsequence of length N1 and the second bit subsequence of length N2-N1 to be encoded are equally spaced.

[0287] In other words, any two adjacent bits in the first bit subsequence to be encoded of length N1 are spaced apart by X bits in the second bit subsequence to be encoded of length N2-N1, and any two adjacent bits in the second bit subsequence to be encoded of length N2-N1 are spaced apart by X bits in the first bit subsequence to be encoded of length N1.

[0288] For example, taking N2 as 16, N1 as 8, K2 as 7, and K1 as 4, the value of N2-N1 is 8, and the value of K2-K1 is 3; thus, the first bit position set includes {0, 0, 0, 1, 0, 1, 1, 1}, and the second bit position set includes {0, 0, 0, 0, 0, 1, 1, 1}, where 0 represents a freeze bit and 1 represents an information bit.

[0289] In one implementation, if X is 4, then the input bits (i.e., the set of bit positions) of the fence diagram of a polar code of length 16 are {0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1}.

[0290] In other words, the bit position set includes bits #0 to #15; among them, bits #0 to #6, bit #8, and bit #12 are all freeze bits; bits #7, bits #9 to #11, and bits #13 to #15 are all information bits. Furthermore, the bit position set is obtained by concatenating the first bit position and the second bit position. The first bit position set includes bits #4 to #7 and bits #13 to #15; the second bit position set includes bits #0 to #3 and bits #8 to #11.

[0291] In another implementation, if X is 2, then the input bits (i.e., the set of bit positions) of the fence diagram of a 16-length polar code are {0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1}. In yet another implementation, if X is 1, then the input bits (i.e., the set of bit positions) of the fence diagram of a 16-length polar code are {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1}.

[0292] In other words, the bit position set includes bits #0 to #15; among them, bits #0 to #6, bit #8, and bit #10 are all frozen bits; bits #7, #9, and bits #11 to #15 are all information bits. Furthermore, the bit position set is obtained by concatenating the first bit position and the second bit position. Specifically, the first bit position set includes bits #2 to #3, bits #6 to #7, bits #10 to #11, and bits #14 to #15; the second bit position set includes bits #0 to #1, bits #4 to #5, bits #8 to #9, and bits #12 to #13.

[0293] Specifically, taking N2 as 16, N1 as 8, K2 as 7, K1 as 4, and X as 1 as an example, N2-N1 is 8, and K2-K1 is 3. In this case, the fence diagram #1 contains 8 input bits, including 4 information bits (such as...). Figure 10 Pattern #1 represents the bit; Fence pattern #2 contains 8 input bits, including 3 information bits (such as...). Figure 10 (The bit represented by pattern #3 in the diagram). Taking the example that neither fence diagram #1 nor fence diagram #2 contains a rate matching bit, fence diagram #1 and fence diagram #2 are as follows: Figure 8 As shown, the 8 input bits in fence diagram #1 also include 4 freeze bits (such as...). Figure 10 Pattern #2 represents the bit position. The 8 input bits in fence diagram #2 also include 5 freeze bits (such as...). Figure 10 Pattern #4 represents the bit position. Fence pattern #3 is obtained by cross-splitting fence pattern #1 and fence pattern #2. Figure 10 As shown.

[0294] Case 2: N2-N1 is not equal to N1, that is, N2-N1≠N1.

[0295] Optionally, in case two, the values ​​of N2 and N1 can be any integer values. For example, the value of N2 is 16, the value of N1 is 12, and the value of N2-N1 is 4.

[0296] In one implementation, in the second bit subsequence to be encoded of length N2-N1, there exists a third bit spaced X times between the first bit and the second bit.

[0297] For example, if N2 is 16, N1 is 12, K2 is 6, and K1 is 5, then N2-N1 is 4 and K2-K1 is 1. In this case, the first bit position set includes {0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1}, and the second bit position set includes {0, 0, 0, 1}, where 0 represents a freeze bit and 1 represents an information bit.

[0298] If X is 2, then the input bits (i.e., the set of bit positions) of the fence diagram of a polar code of length 16 can be {0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1}. That is, the set of bit positions includes bits #0 to #15; where bits #0 to #4, #6, #8 to #10, and #12 are frozen bits; and bits #5, #7, #11, and #13 to #15 are information bits. Furthermore, the set of bit positions is obtained by concatenating the first bit position and the second bit position. The first set of bit positions includes bits #2 to #3 and bits #6 to #15; the second set of bit positions includes bits #0 to #1 and bits #4 to #5.

[0299] If X is 6, then the input bits (i.e., the set of bit positions) of the fence diagram of a polar code of length 16 can be {0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1}. That is, the set of bit positions includes bits #0 to #15; among them, bits #0 to #4, bits #6 to #8, bit #10, and bit #12 are all frozen bits; bits #5, #9, #11, and bits #13 to #15 are all information bits. Furthermore, the set of bit positions is obtained by concatenating the first bit position and the second bit position. The first set of bit positions includes bits #2 to #7 and bits #10 to #15; the second set of bit positions includes bits #0 to #1 and bits #8 to #9.

[0300] In another implementation, in the second bit subsequence to be encoded with a length of N2-N1, any two adjacent bits are spaced apart by X third bits.

[0301] For example, taking N2 as 16, N1 as 12, K2 as 6, and K1 as 5, the value of N2-N1 is 4, and the value of K2-K1 is 1. In this case, the first bit position set includes {0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1}, and the second bit position set includes {0, 0, 0, 1}, where 0 represents a freeze bit and 1 represents an information bit. In this case, X can be 3, thus the input bits (i.e., the bit position set) of the fence diagram of a 16-length polar code can be {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1}.

[0302] In other words, the bit position set includes bits #0 to #15; among them, bits #0 to #4, bits #6 to #9, and bit #11 are all frozen bits; bits #5, #10, and bits #12 to #15 are all information bits. Furthermore, the bit position set is obtained by concatenating the first bit position and the second bit position. The first bit position set includes bits #1 to #3, bits #5 to #7, bits #9 to #11, and bits #13 to #15; the second bit position set includes bits #0, #4, #8, and #12.

[0303] Combining the two scenarios above, it can be understood that during the encoding process of polar codes, some input bits are affected by other bits, requiring the assistance of those other bits to recover them. Conversely, some input bits are unaffected by other bits during encoding, allowing the receiver to independently decode and recover them without their assistance. Therefore, regardless of whether fence diagrams #1 and #2 are concatenated or cross-stitched to obtain a polar code fence diagram of length N2 (such as fence diagram #3), it is sufficient to ensure that the bits in the input bits (i.e., the first bit position set) of fence diagram #1 are unaffected by other bits during encoding.

[0304] Furthermore, regardless of whether fence diagram #1 and fence diagram #2 are concatenated or spliced ​​to obtain the fence diagram of the polar code of length N2, it can be guaranteed that the K1 information bits with high reliability in fence diagram #1 and the K2-K1 information bits with high reliability in fence diagram #2 are similar to or the same as the K2 information bits with high reliability in the fence diagram of the polar code of length N2. That is, the K2 bits include the K1 first bits and the K2-K1 first bits. Therefore, the first information bit subsequence of length K1 or the second information bit subsequence of length K2-K1 can be placed on the K2 bits with high reliability, thereby improving the reliability of the encoding and reducing the bit error rate.

[0305] Based on this possible implementation, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 can be jointly encoded. That is, the two short codes of the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 corresponding to the first information bit subsequence of length K1 are combined into a long code of length N2 (i.e., the bit subsequence of length N2 to be encoded) for encoding, thereby obtaining a better long code gain and improving encoding efficiency.

[0306] Understandably, during the encoding process of polar codes, some input bits are affected by other bits, requiring the assistance of those other bits to recover them. Conversely, some input bits are unaffected by other bits, allowing the receiver to independently decode and recover them without their assistance. Therefore, based on the encoding characteristics of polar codes, a bit sequence of length N2 can be encoded (by concatenating a first bit subsequence of length N1 with a second bit subsequence of length N2-N1, or by cross-concatenating the first bit subsequence of length N1 with the second bit subsequence of length N2-N1). For example, placing the first bit subsequence of length N1 in bits unaffected by other bits during encoding allows the receiver to recover the first information bit subsequence of length K1 even if it only receives the symbol sequence corresponding to the first information bit subsequence of length K1, thus improving decoding performance.

[0307] In another possible implementation, a first information bit subsequence of length K1 and a second information bit subsequence of length K2-K1 are encoded independently.

[0308] Optionally, the transmitting device can encode the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 respectively to obtain a first encoded bit subsequence of length N1 and a first encoded bit subsequence of length N2-N1.

[0309] For example, the transmitting device can obtain a first bit subsequence to be encoded of length N1 based on a first information bit subsequence of length K1, and then encode the first bit subsequence to be encoded of length N1 to obtain a first encoded bit subsequence of length N1. Similarly, the transmitting device can obtain a second bit subsequence to be encoded of length N2-N1 based on a second information bit subsequence of length K2-K1, and then encode the second bit subsequence to be encoded of length N2-N1 to obtain a fifth encoded bit subsequence of length N2-N1. Then, based on the first encoded bit subsequence of length N1, the fifth encoded bit subsequence of length N2-N1 is encoded to obtain a second encoded bit subsequence of length N2-N1.

[0310] Specifically, a first coded bit subsequence of length N1 and a fifth coded bit subsequence of length N2-N1 can be processed to obtain a second coded bit subsequence of length N2-N1. For example, a first coded bit subsequence of length N1 and a fifth coded bit subsequence of length N2-N1 can be XORed to obtain a second coded bit subsequence of length N2-N1.

[0311] Yes, it is understandable. In the encoding process of polar codes, some input bits are affected by other bits during the encoding process, so the receiving device needs the assistance of other bits when recovering these bits. On the other hand, some input bits are not affected by other bits during the encoding process, so the receiving device can independently decode and recover these bits without the assistance of other bits.

[0312] Therefore, in the process of encoding the fifth coded bit subsequence of length N2-N1 based on the first coded bit subsequence of length N1, it is possible to place the fifth coded bit subsequence of length N2-N1 on a bit position that is not affected by other bits. Thus, when the receiving device recovers the first information bit subsequence of length K1, it can independently decode based on the second coded bit subsequence of length N2-N1 without the assistance of other bits, and thus recover the first information bit subsequence of length K1.

[0313] Optionally, the transmitting device may encode the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 simultaneously; or, the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 may not be encoded simultaneously, for example, the corresponding information bit subsequence may be encoded only when there is a transmission requirement.

[0314] Optionally, the transmitting device may simultaneously transmit a first coded bit subsequence of length N1 and a second coded bit subsequence of length N2-N1; or, it may not simultaneously transmit the first coded bit subsequence of length N1 and the second coded bit subsequence of length N2-N1; for example, the corresponding coded bit subsequence may be transmitted only when there is a transmission demand.

[0315] Based on this possible implementation, during the encoding of the second information bit subsequence of length K2-K1, the fifth encoded bit subsequence of length N2-N1 obtained by independently encoding the first encoded bit subsequence of N1 can be operated on (such as XOR operation). This is equivalent to encoding with a long code of length N2 during the encoding process, thereby obtaining better long code gain and improving encoding efficiency.

[0316] Yes, it is understandable. In the encoding process of polar codes, some input bits are affected by other bits during the encoding process, so the receiving device needs the assistance of other bits when recovering these bits. On the other hand, some input bits are not affected by other bits during the encoding process, so the receiving device can independently decode and recover these bits without the assistance of other bits.

[0317] Therefore, during the encoding of the fifth coded bit subsequence of length N2-N1 based on the first coded bit subsequence of length N1, it is advisable to place the fifth coded bit subsequence of length N2-N1 on a bit position unaffected by other bits. This allows the receiving device to independently decode the first information bit subsequence of length K1 based on the second coded bit subsequence of length N2-N1 without the assistance of other bits, thus improving decoding performance.

[0318] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0319] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are examples, and the embodiments of this application may also perform other operations or variations of various operations. In addition, the steps may be performed in different orders as presented in the embodiments of this application, and it is not necessary to perform all the operations in the embodiments of this application.

[0320] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, based on the algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0321] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and represents a logical functional division; in actual implementation, there may be other division methods.

[0322] When dividing each function into modules according to its corresponding function. Figure 11 A transmitting device 110 is shown, which can perform the above-described... Figure 7 The actions performed by the transmitting device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0323] The transmitting device 110 may include a transceiver module 1101 and a processing module 1102. Exemplarily, the transmitting device 110 may be a communication device, or a chip or other combined device or component having the aforementioned transmitting device functions. When the transmitting device 110 is a communication device, the transceiver module 1101 may be a transceiver, which may include an antenna and radio frequency circuits; the processing module 1102 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 110 is a component having the aforementioned transmitting device functions, the transceiver module 1101 may be a radio frequency unit; the processing module 1102 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 110 is a chip system, the transceiver module 1101 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1102 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1101 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1102 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0324] For example, transceiver module 1101 can be used to perform... Figure 7 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; the processing module 1102 can be used to perform Figure 7 The embodiments shown include all operations performed by the transmitting device other than the sending and receiving operations, and / or other processes used to support the techniques described herein.

[0325] Figure 12 A receiving device 120 is shown, which can perform the above-described... Figure 7 The actions performed by the receiving device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0326] The receiving device 120 may include a transceiver module 1201 and a processing module 1202. Exemplarily, the receiving device 120 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions applied in a communication device. When the receiving device 120 is a communication device, the transceiver module 1201 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1202 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 120 is a component having the aforementioned receiving device functions, the transceiver module 1201 may be a radio frequency unit; the processing module 1202 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 120 is a chip system, the transceiver module 1201 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1202 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1201 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1202 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0327] For example, the transceiver module 1201 can be used to perform... Figure 7 In the illustrated embodiment, all transmit and receive operations performed by the receiving device, and / or other processes used to support the techniques described herein; the processing module 1202 can be used to perform Figure 7 The embodiments shown include all operations performed by the receiving device other than the transmit / receive operations, and / or other processes used to support the techniques described herein.

[0328] As another feasible approach Figure 11 The transceiver module 1101 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1101; the processing module 1102 can be replaced by a processor, which can integrate the functions of the processing module 1102. Furthermore, Figure 11 The transmitting device 110 shown may also include a memory. Alternatively, Figure 12 The transceiver module 1201 can be replaced by a transceiver unit, which can integrate the functions of the transceiver module 1201; the processing module 1202 can be replaced by a processor, which can integrate the functions of the processing module 1202. Furthermore, Figure 12 The receiver device 120 shown may also include a memory.

[0329] Alternatively, when the processing module 1102 is replaced by a processor and the transceiver module 1101 is replaced by a transceiver, the transmitting end device 110 involved in the embodiments of this application can also be... Figure 13The communication device 130 shown. Alternatively, when the processing module 1202 is replaced by a processor and the transceiver module 1201 is replaced by a transceiver, the receiving device 120 involved in the embodiments of this application can also be... Figure 13 The communication device 130 shown.

[0330] The processor can be logic circuit 1301, and the transceiver can be interface circuit 1302. Furthermore, Figure 13 The communication device 130 shown may also include a memory 1303.

[0331] This application also provides a communication device, such as... Figure 14 As shown, this communication device can be applied to the above-mentioned... Figure 7 In the methods shown in the embodiments, such as Figure 14 As shown, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0332] In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and performs the steps executed by the transmitting device in the above method embodiments. The transceiver module is used for specific execution. Figure 7 The embodiments shown depict sending and / or receiving actions performed by the transmitting device, such as supporting the transmitting device in performing other processes of the techniques described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the techniques described herein.

[0333] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0334] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0335] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to perform... Figure 7 The illustrated embodiment relates to a method. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is primarily responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is primarily responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and translations. Registers are primarily responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS), an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an in-chip storage module, such as a register or cache. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0336] It should be noted that the functions of the processor and interface can be implemented through hardware design, software design, or a combination of both; no restrictions are imposed here.

[0337] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0338] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0339] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0340] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are for descriptive purposes and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0341] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0342] It should be understood that in this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action to be taken when the action is taken, nor do they imply any other limitations.

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

[0344] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0345] Through the above description of the implementation methods, those skilled in the art can clearly understand that, for the sake of convenience and brevity, the above-described division of functional modules is used as an example. In practical applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0346] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are illustrative. For instance, the division of modules or units is a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0347] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

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

[0349] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

1. An encoding method, characterized in that, The method includes: Obtain an information bit sequence of length K2, wherein the information bit sequence of length K2 contains a first information bit subsequence of length K1, K2 is greater than K1, and K1 and K2 are both positive integers; The information bit sequence of length K2 is encoded to obtain an encoded bit sequence of length N2. The encoded bit sequence of length N2 contains a first encoded bit subsequence of length N1. The first information bit subsequence of length K1 corresponds to the first encoded bit subsequence of length N1. N2 is greater than N1, and N1 and N2 are both positive integers. Output the encoded bit sequence of length N2.

2. The method according to claim 1, characterized in that, The information bit sequence of length K2 also includes a second information bit subsequence of length K2-K1, and the first encoded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1.

3. The method according to claim 2, characterized in that, The process of encoding the information bit sequence of length K2 to obtain an encoded bit sequence of length N2 includes: Based on the information bit sequence of length K2, determine the bit sequence to be encoded of length N2; The bit sequence to be encoded of length N2 is encoded to obtain the encoded bit sequence of length N2; Wherein, the bit sequence to be encoded of length N2 corresponds to a set of bit positions containing N2 bits, and the set of bit positions includes a first set of bit positions and a second set of bit positions; The first bit position set contains N1 bits, the N1 bits contain K1 first bits, and the first information bit subsequence of length K1 is located on the K1 first bits; The second bit position set contains N2-N1 bits, and the N2-N1 bits contain K2-K1 first bits. The second information bit subsequence of length K2-K1 is located on the K2-K1 first bits.

4. The method according to claim 3, characterized in that, The K1 first bits are the K1 bits with high reliability among the N1 bits, and the K2-K1 first bits are the K2-K1 bits with high reliability among the N2-N1 bits.

5. The method according to claim 3 or 4, characterized in that, The information bit sequence of length K2 is located on the K2 bits with the highest reliability among the N2 bits; Wherein, the K2 bits include the K1 first bits and the K2-K1 first bits.

6. The method according to claim 5, characterized in that, The bit sequence to be encoded of length N2 includes a first bit subsequence to be encoded of length N1 and a second bit subsequence to be encoded of length N2-N1; Wherein, in the bit sequence to be encoded of length N2, the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are concatenated; or, In the bit sequence to be encoded of length N2, the bit spacing distribution in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 is as follows.

7. The method according to claim 5, characterized in that, In the bit sequence to be encoded of length N2, the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are distributed alternately, including: The second bit subsequence to be encoded, which has a length of N2-N1, includes a first bit and a second bit, with X third bits between the first bit and the second bit. Wherein, the first bit and the second bit are adjacent bits in the second bit subsequence to be encoded of length N2-N1, and the X third bits are X consecutive bits in the first bit subsequence to be encoded of length N1, where the value of X is negatively correlated with K2-K1 and X is a positive integer.

8. The method according to claim 7, characterized in that, K2-K1 is less than or equal to K1.

9. The method according to any one of claims 6-8, characterized in that, N2 = 2 * N1, in the bit sequence to be encoded of length N2, the bits in the first bit subsequence to be encoded of length N1 and the second bit subsequence to be encoded of length N2-N1 are equally spaced.

10. The method according to claim 2, characterized in that, The coded bit sequence of length N2 further includes a second coded bit subsequence of length N2-N1. The second coded bit subsequence of length N2-N1 is obtained by operating on a fifth coded bit subsequence of length N2-N1 and a first coded bit subsequence of length N1. The fifth coded bit subsequence of length N2-N1 is obtained by encoding a second bit subsequence of length N2-N1 corresponding to the second information bit subsequence of length K2-K1.

11. The method according to claim 10, characterized in that, The second coded bit subsequence of length N2-N1 is obtained by XORing the fifth coded bit subsequence of length N2-N1 with the first coded bit subsequence of length N1.

12. A decoding method, characterized in that, The method includes: Obtain a symbol sequence, the symbol sequence corresponding to a first encoded bit subsequence of length N1, the first encoded bit subsequence of length N1 being contained in an encoded bit sequence of length N2, the encoded bit sequence of length N2 being encoded by an information bit sequence of length K2, the information bit sequence of length K2 containing a first information bit subsequence of length K1, K2 being greater than K1, N2 being greater than N1, and K1, K2, N2, and N1 being positive integers; The symbol sequence is decoded to obtain a decoded sequence, which corresponds to the first information bit subsequence of length K1.

13. The method according to claim 12, characterized in that, The information bit sequence of length K2 also includes a second information bit subsequence of length K2-K1, and the first encoded bit subsequence of length N1 is unrelated to the second information bit subsequence of length K2-K1.

14. The method according to claim 12, characterized in that, The encoded bit sequence of length N2 corresponds to a set of bit positions containing N2 bits, and the set of bit positions includes a first set of bit positions and a second set of bit positions; The first bit position set contains N1 bits, the second bit position set contains N2-N1 bits, the N1 bits contain K1 first bits, and the first information bit subsequence of length K1 is located on the K1 first bits among the N1 bits.

15. The method according to claim 14, characterized in that, The K1 first bits are the K1 bits with the highest reliability among the N1 bits.

16. The method according to claim 14 or 15, characterized in that, The N2-N1 bits include K2-K1 first bits, and the K2-K1 first bits are the K2-K1 bits with high reliability among the N2-N1 bits.

17. The method according to claim 16, characterized in that, The K2 bits with high reliability among the N2 bits include the K1 first bits and the K2-K1 first bits.

18. The method according to any one of claims 1-17, characterized in that... The first information bit subsequence of length K1 includes a third information bit subsequence of length K3, where K3 is less than K1; Accordingly, the first encoded bit subsequence of length N1 includes a third encoded information bit subsequence of length N3, and the third information bit subsequence of length K3 corresponds to the third encoded bit subsequence of length N3, where N3 is less than N1.

19. The method according to any one of claims 1-18, characterized in that, The encoded bit sequence of length N2 also includes a second encoded bit subsequence of length N2-N1; The first coded bit subsequence of length N1 is carried in the first resource, and the second coded bit subsequence of length N2-N1 is carried in the second resource. The first resource and the second resource are different.

20. The method according to claim 19, characterized in that, The receiving device has different receiving performance on the first resource and the second resource; and / or, The first resource and the second resource have different resource characteristics, including dedicated resources and public resources.

21. The method according to claim 20, characterized in that, The receiving device has different receiving performance on the first resource and the second resource, including: The receiving device has better receiving performance on the first resource than on the second resource.

22. The method according to claim 20, characterized in that, The first resource and the second resource have different resource characteristics, including: The first resource is a dedicated resource of the receiving device, and the second resource is the public resource.

23. The method according to any one of claims 19-22, characterized in that, The temporal resources of the first resource are located before the temporal resources of the second resource.

24. The method according to any one of claims 1-23, characterized in that, The information bit sequence of length K2 further includes the second information bit subsequence of length K2-K1; wherein... The first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1 belong to different task types; The receiving device has different requirements for the first information bit subsequence of length K1 and the second information bit subsequence of length K2-K1; and / or, The first information bit subsequence of length K1 is transmitted at a different time than the second information bit subsequence of length K2-K1.

25. A communication device, characterized in that, The communication device includes a processor; the processor is configured to execute a computer program or instructions via logic circuitry and / or to cause the method described in any one of claims 1-11, 18-24 to be performed, or to cause the method described in any one of claims 12-24 to be performed.

26. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used for inputting and / or outputting information; the logic circuit is used to perform the method as described in any one of claims 1-11, 18-24, or to perform the method as described in any one of claims 12-24.

27. A communication device, characterized in that, Includes modules for performing the method as described in any one of claims 1-11, 18-24, and / or includes modules for performing the method as described in any one of claims 12-24.

28. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the method described in any one of claims 1-11, 18-24 to be performed, or cause the method described in any one of claims 12-24 to be performed.

29. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the method as described in any one of claims 1-11, 18-24 to be performed, or cause the method as described in any one of claims 12-24 to be performed.

Images