Communication method and communication device based on polarization code

Abstract

The invention discloses a communication method and a communication device based on a polarization code, and the method comprises the steps: when a coding side carries out the coding of a current first to-be-coded bit block, determining a frozen bit adopted by the current coding encryption based on a second information bit or a second frozen bit associated with a second coding bit block transmitted last time, the coding and encryption integrated secure communication is realized, the randomness of the frozen bits is improved, the frozen bits are not easy to obtain by an eavesdropper, the leakage of the frozen bits is avoided, and the security of coding and encryption is improved.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a communication method and a communication device based on polar codes. Background Art

[0002] Existing communication system security transmission solutions rely on key management and high-level encryption algorithms. Key management and maintenance require the support of complex communication protocols and cause additional signaling overhead. In addition, protocol vulnerabilities may be maliciously exploited, thus causing security risks to the communication system. If high-level encryption algorithms are directly applied to the encryption of physical layer data or signaling, there will be problems such as high computational complexity and excessive signal processing delay.

[0003] The integrated coding and encryption technology can enhance the security of transmission without affecting the error correction performance by introducing encryption capabilities into channel coding. For example, the integrated coding and encryption can be designed for Polar codes. Decoding and decryption require both parties to agree on the value of the frozen bits. If the frozen bits are wrong, they cannot be correctly decoded and decrypted. However, if the frozen bits are leaked or obtained through exhaustive search, the security of all information bits cannot be guaranteed.

[0004] Based on this, how to improve the security of physical layer transmission is an urgent problem to be solved. Summary of the invention

[0005] The present application provides a communication method and a communication device based on polarization polar codes. The method can determine the frozen bits of the current transmission based on at least one of the frozen bits or information bits of the previous transmission or a preset key, which is beneficial to avoid leakage of frozen bits and improve the security of physical layer transmission.

[0006] In a first aspect, the present application provides a communication method based on polar codes, which is executed by a first device, or by a component of the first device (such as a processor, a chip, or a chip system, etc.), or by a logic module that can implement all or part of the functions of the first device. For example, the first device can be a coding side (such as a network device or a terminal), or a component of the coding side, or a logic module that can implement all or part of the coding function. Among them, the first device performs Polar encoding on a first bit block to be encoded to obtain a first coded bit block; the first bit block to be encoded includes a first frozen bit, the first frozen bit is determined based on at least one of a second information bit or a second frozen bit or a preset key, the second information bit or the second frozen bit is associated with a second coded bit block, and the second coded bit block is a bit block transmitted before the first coded bit block. The first device sends a first coded bit block.

[0007] In this method, when the encoding side encodes the current first bit block to be encoded, it determines the frozen bit used for the current encoding and encryption based on the second information bit or the second frozen bit associated with the second encoding bit block transmitted in the previous time, which not only realizes the secure communication of integrated encoding and encryption, but also improves the randomness of the frozen bit, which is not easy to be obtained by the eavesdropper, which is conducive to avoiding the leakage of the frozen bit and improving the security of the encoding and encryption. If the eavesdropper wants to obtain the updated frozen bit, it can only perform an exhaustive search, and the computational overhead is very large; even if the current first frozen bit is obtained by the eavesdropper, the encoding side will continue to update the frozen bit in the subsequent transmission, and perform encoding and encryption based on the new frozen bit, so the eavesdropper cannot continue to decode the data.

[0008] In a possible implementation, the first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

[0009] In this method, the first bit block to be encoded can be a variety of different types of information or bit blocks, that is, the method provided in the present application is applicable to a variety of encoding scenarios and can perform Polar encoding on a variety of different types of information or bit blocks.

[0010] In a possible implementation manner, if the first bit block to be encoded includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or,

[0011] If the first to-be-coded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or,

[0012] If the first to-be-coded bit block includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first to-be-coded bit block; or,

[0013] If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or,

[0014] If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or,

[0015] If the first bit block to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first bit block to be encoded.

[0016] In the method, when the first bit block to be encoded is information or a bit block of a different type, the second information bit is information or a bit block of a corresponding type in the encoding process.

[0017] In a possible implementation manner, if an acknowledgment response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the first frozen bit is obtained by processing the second frozen bit and the second information bit based on the first function.

[0018] In a possible implementation manner, if a confirmation response for a physical downlink shared channel is received or a physical uplink shared channel is successfully decoded, the first device processes the second frozen bits and the second information bits based on the first function to obtain the first frozen bits.

[0019] In the above method, if the first device receives an acknowledgment (ACK) for the physical downlink shared channel or successfully decodes the physical uplink shared channel, for example, the first device receives ACK, then the frozen bits can be updated using the information bits that were previously correctly transmitted, or the information bits that were previously correctly transmitted can be processed and the processed results can be used to update the frozen bits, thereby improving the randomness of the frozen bits.

[0020] In a possible implementation, if a negative response to the physical downlink shared channel is received or the physical uplink shared channel is not successfully decoded, the first frozen bit is obtained by processing at least one of the preset key or the second frozen bit based on the second function.

[0021] In one possible implementation, if a negative response to a physical downlink shared channel is received or a physical uplink shared channel is not successfully decoded, the first device determines that the first frozen bit is the same as the second frozen bit; or, the first device processes at least one of the preset key or the second frozen bit based on a second function to obtain the first frozen bit.

[0022] In the above method, if the first device receives a negative acknowledgement (NACK) for the physical downlink shared channel or fails to successfully decode the physical uplink shared channel, for example, the first device receives NACK, then the frozen bits may not be updated, or a preset key (or a bit string obtained after processing it) may be used to update the frozen bits, thereby improving the randomness of the frozen bits.

[0023] In a possible implementation, when the time of the frozen bit update period is reached, the first frozen bit is determined based on at least one of the second information bit, the second frozen bit, or the preset key. The second information bit is an information bit in one or more hybrid automatic repeat request (HARQ) processes within the frozen bit update period; the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

[0024] In a possible implementation, when there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, the first device determines a frozen bit update period. When a frozen bit update period is reached, the first device determines a first frozen bit based on at least one of a second information bit or a second frozen bit or a preset key; wherein the second information bit is an information bit in one or more HARQ processes within the frozen bit update period; and the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

[0025] In the above method, when there are multiple transport blocks transmitted in multiple HARQ processes, a method similar to updating the Polar code frozen bits in a single process can also be used to achieve secure communication with integrated coding and encryption.

[0026] In a possible implementation, the frozen bit update period is a maximum time interval among multiple time intervals corresponding to multiple HARQ processes; or, the frozen bit update period is a preset time interval. The time interval is a time interval between a physical downlink shared channel of a HARQ process among multiple HARQ processes and an acknowledgement or a negative response of the physical downlink shared channel.

[0027] In this method, it is necessary to consider updating the frozen bits according to the frozen bit update period in multiple HARQ processes to avoid updating the frozen bits too frequently, which is beneficial to reducing the calculation overhead of the system; however, the specific value of the frozen bit update period is not limited. For example, the frozen bit update period can be the largest time interval among multiple time intervals corresponding to multiple HARQ processes, which is beneficial to enable multiple HARQ processes to update the frozen bits.

[0028] In a possible implementation, if there are N HARQ processes receiving confirmation responses for a physical downlink shared channel within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and the second information bits of the N HARQ processes based on a first function; N is a positive integer. Alternatively, the first frozen bit is obtained by processing the second frozen bits and the second information bits of M HARQ processes based on a first function, where the M HARQ processes are any M HARQ processes among the N HARQ processes, and M is a positive integer less than or equal to N.

[0029] In one possible implementation, if confirmation responses for a physical downlink shared channel are received in N HARQ processes within a frozen bit update period, the first device processes the second frozen bits and second information bits of the N HARQ processes based on a first function to obtain a first frozen bit.

[0030] In one possible implementation, the first device processes the second frozen bits and the second information bits of M HARQ processes based on the first function to obtain the first frozen bits; wherein the M HARQ processes are any M HARQ processes among N HARQ processes, and M is a positive integer less than or equal to N.

[0031] In the above method, if there are N HARQ processes in multiple HARQ processes that receive ACK or any M HARQ processes are directly selected, the first frozen bit can be determined based on the second frozen bits and the second information bits of the N HARQ processes or the M HARQ processes. The first frozen bit is used for the downlink control information of all subsequent HARQ processes in the current update cycle until the next frozen bit update cycle, which is beneficial to improving the randomness of the frozen bit and avoiding too frequent updates of the frozen bit, which is beneficial to reducing computing overhead.

[0032] In a possible implementation, if a physical uplink shared channel is successfully decoded in at least one HARQ process within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bit and the second information bit of at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function.

[0033] In a possible implementation, if a physical uplink shared channel is successfully decoded in at least one HARQ process within a frozen bit update period, the first device processes the second frozen bit and the second information bit of at least one HARQ process that successfully decodes the physical uplink shared channel based on the first function to obtain a first frozen bit.

[0034] In the above method, if there is at least one HARQ process in multiple HARQ processes that successfully decodes the physical uplink shared channel, the first frozen bit can be determined based on the second frozen bit and the second information bit of the HARQ process. The first frozen bit is used for downlink control information of all subsequent HARQ processes until the next frozen bit update period, which is beneficial to improving the randomness of the frozen bit.

[0035] In a possible implementation, the first function or the second function includes: a combination of one or more of hashing, truncation, concatenation, sampling, and symmetric encryption.

[0036] In the method, possible implementations of the first function or the second function are described exemplarily, such as a combination of hashing, truncation and other implementations, which is beneficial to improving security.

[0037] In the second aspect, the present application provides a communication method based on polar codes, which is executed by a second device, or by a component of the second device (such as a processor, a chip, or a chip system, etc.), or by a logic module that can implement all or part of the functions of the second device. For example, the second device can be a decoding side (such as a network device or a terminal), or a component of the decoding side, or a logic module that can implement all or part of the decoding function. Among them, the second device receives a first coded bit block. The second device performs Polar decoding on the first coded bit block based on the first frozen bit to obtain a first bit block to be encoded. Among them, the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key, and the second information bit or the second frozen bit is associated with the second coded bit block; the second coded bit block is a bit block transmitted before the first coded bit block.

[0038] In this method, when the decoding side decodes the currently received coded bit block, it determines the first frozen bit based on the second information bit and the second frozen bit in the previous decoding result, and decodes based on the first frozen bit, thereby realizing secure communication with integrated decoding and decryption.

[0039] In a possible implementation, the first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

[0040] In this method, the first bit block to be encoded can be a variety of different types of information or bit blocks, that is, the method provided in the present application is applicable to a variety of encoding scenarios and can perform Polar encoding on a variety of different types of information or bit blocks.

[0041] In a possible implementation manner, if the first bit block to be encoded includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or,

[0042] If the first to-be-coded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or,

[0043] If the first to-be-coded bit block includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first to-be-coded bit block; or,

[0044] If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or,

[0045] If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or,

[0046] If the first bit block to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first bit block to be encoded.

[0047] In the method, when the first bit block to be encoded is information or a bit block of a different type, the second information bit is information or a bit block of a corresponding type in the encoding process.

[0048] In a possible implementation, the first frozen bit is obtained by processing the second information bit and the second frozen bit based on the first function; or the first frozen bit is obtained by processing at least one of the preset key or the second frozen bit based on the second function.

[0049] In this method, the decoding side determines the first frozen bit based on the second information bit and the second frozen bit in the previous decoding result, or determines the first frozen bit based on a preset key or the second frozen bit, thereby decoding and decrypting based on the first frozen bit to obtain the information bit.

[0050] In a third aspect, the present application provides a communication method based on polar codes, which is implemented by the interaction between a first device and a second device. For example, the first device is the encoding side, and the second device is the decoding side. The communication method includes the following steps: the first device performs Polar encoding on the first bit block to be encoded to obtain a first encoded bit block; the first bit block to be encoded includes a first frozen bit, and the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key, and the second information bit or the second frozen bit is associated with the second encoded bit block, and the second encoded bit block is a bit block transmitted before the first encoded bit block. The first device sends the first encoded bit block, and correspondingly, the second device receives the first encoded bit block. The second device performs Polar decoding on the first encoded bit block based on the first frozen bit to obtain the first bit block to be encoded.

[0051] In this method, when the encoding side encodes the current first bit block to be encoded, the frozen bit used for the current encoding and encryption is determined based on the second information bit or the second frozen bit associated with the second encoding bit block transmitted last time, which not only realizes the secure communication of integrated encoding and encryption, but also improves the randomness of the frozen bit, which is not easy to be obtained by the eavesdropping party, is conducive to avoiding the leakage of the frozen bit, and improves the security of encoding and encryption. When the decoding side decodes the currently received encoding bit block, it determines the first frozen bit based on the second information bit and the second frozen bit in the previous decoding result, and decodes based on the first frozen bit, realizing the secure communication of integrated decoding and decryption.

[0052] Optionally, other implementations of the communication method may refer to the corresponding descriptions in the first aspect and the second aspect, and will not be repeated here.

[0053] In a fourth aspect, the present application provides a communication device. The communication device can implement a coding function, for example, it can be a network device, or a device of a network device, or a device that can be used in combination with a network device; or it can be a terminal, or a device of a terminal, or a device that can be used in combination with a terminal. In a possible implementation, the communication device may include a functional module, and the functional module may be a hardware circuit, or software, or a combination of a hardware circuit and software.

[0054] In a possible implementation, the communication device includes a communication unit and a processing unit. The processing unit is used to perform Polar encoding on a first bit block to be encoded to obtain a first encoded bit block; the first bit block to be encoded includes a first frozen bit, the first frozen bit is determined based on at least one of a second information bit or a second frozen bit or a preset key, the second information bit or the second frozen bit is associated with a second encoded bit block, and the second encoded bit block is a bit block transmitted before the first encoded bit block. The communication unit is used to send the first encoded bit block.

[0055] In a possible implementation, the first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

[0056] In a possible implementation manner, if the first bit block to be encoded includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or,

[0057] If the first to-be-coded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or,

[0058] If the first to-be-coded bit block includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first to-be-coded bit block; or,

[0059] If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or,

[0060] If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or,

[0061] If the first bit block to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first bit block to be encoded.

[0062] In a possible implementation manner, if an acknowledgment response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the first frozen bit is obtained by processing the second frozen bit and the second information bit based on the first function.

[0063] In a possible implementation manner, if a confirmation response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the processing unit is configured to process the second frozen bits and the second information bits based on the first function to obtain the first frozen bits.

[0064] In a possible implementation, if a negative response to the physical downlink shared channel is received or the physical uplink shared channel is not successfully decoded, the first frozen bit is obtained by processing at least one of the preset key or the second frozen bit based on the second function.

[0065] In one possible implementation, if a negative response to a physical downlink shared channel is received or a physical uplink shared channel is not successfully decoded, the processing unit is used to determine that the first frozen bit is the same as the second frozen bit; or, the processing unit is used to process at least one of the preset key or the second frozen bit based on a second function to obtain the first frozen bit.

[0066] In a possible implementation, when the time of the frozen bit update period is reached, the first frozen bit is determined based on at least one of the second information bit, the second frozen bit, or the preset key. The second information bit is an information bit in one or more HARQ processes within the frozen bit update period; the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

[0067] In a possible implementation, when there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, the processing unit is used to determine a frozen bit update period. When a frozen bit update period is reached, the processing unit is used to determine a first frozen bit based on at least one of a second information bit or a second frozen bit or a preset key; wherein the second information bit is an information bit in one or more HARQ processes within the frozen bit update period; and the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

[0068] In a possible implementation, the frozen bit update period is a maximum time interval among multiple time intervals corresponding to multiple HARQ processes; or, the frozen bit update period is a preset time interval. The time interval is a time interval between a physical downlink shared channel of a HARQ process among multiple HARQ processes and an acknowledgement or a negative response of the physical downlink shared channel.

[0069] In a possible implementation, if there are N HARQ processes receiving confirmation responses for a physical downlink shared channel within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and the second information bits of the N HARQ processes based on a first function; N is a positive integer. Alternatively, the first frozen bit is obtained by processing the second frozen bits and the second information bits of M HARQ processes based on a first function, where the M HARQ processes are any M HARQ processes among the N HARQ processes, and M is a positive integer less than or equal to N.

[0070] In a possible implementation, if confirmation responses for a physical downlink shared channel are received in N HARQ processes within a frozen bit update period, the processing unit is configured to process the second frozen bits and second information bits of the N HARQ processes based on a first function to obtain a first frozen bit.

[0071] In one possible implementation, the processing unit is used to process the second frozen bits and the second information bits of M HARQ processes based on the first function to obtain the first frozen bits; wherein the M HARQ processes are any M HARQ processes among N HARQ processes, and M is a positive integer less than or equal to N.

[0072] In a possible implementation, if a physical uplink shared channel is successfully decoded in at least one HARQ process within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bit and the second information bit of at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function.

[0073] In a possible implementation, if a physical uplink shared channel is successfully decoded in at least one HARQ process within a frozen bit update period, the processing unit is used to process the second frozen bit and the second information bit of at least one HARQ process that successfully decodes the physical uplink shared channel based on the first function to obtain a first frozen bit.

[0074] In a possible implementation, the first function or the second function includes: a combination of one or more of hashing, truncation, concatenation, sampling, and symmetric encryption.

[0075] In a fifth aspect, the present application provides a communication device. The communication device can implement a decoding function, for example, it can be a network device, or a device of a network device, or a device that can be used in combination with a network device; or it can be a terminal, or a device of a terminal, or a device that can be used in combination with a terminal. In a possible implementation, the communication device may include a functional module, and the functional module may be a hardware circuit, or software, or a combination of a hardware circuit and software.

[0076] In a possible implementation, the communication device includes a communication unit and a processing unit. The communication unit is used to receive a first coded bit block. The processing unit is used to perform Polar decoding on the first coded bit block based on the first frozen bit to obtain a first bit block to be coded. The first frozen bit is determined based on at least one of a second information bit or a second frozen bit or a preset key, and the second information bit or the second frozen bit is associated with a second coded bit block; the second coded bit block is a bit block transmitted before the first coded bit block.

[0077] In a possible implementation, the first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

[0078] In a possible implementation manner, if the first bit block to be encoded includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or,

[0079] If the first to-be-coded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or,

[0080] If the first to-be-coded bit block includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first to-be-coded bit block; or,

[0081] If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or,

[0082] If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or,

[0083] If the first bit block to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first bit block to be encoded.

[0084] In a possible implementation, the first frozen bit is obtained by processing the second information bit and the second frozen bit based on the first function; or the first frozen bit is obtained by processing at least one of the preset key or the second frozen bit based on the second function.

[0085] In a sixth aspect, the present application provides a communication device, comprising: a processor, configured to implement the method of the first aspect and the second aspect, and any possible implementation of the first aspect and the second aspect through a logic circuit and / or execution instructions. Optionally, the communication device also includes a memory, which is configured to store the instructions, and when the instructions are executed by the processor, the communication device implements the method of the first aspect and the second aspect, and any possible implementation of the first aspect and the second aspect. Optionally, the processor and the memory are coupled.

[0086] In a seventh aspect, the present application provides a communication system, which includes multiple devices or equipment in the above-mentioned third to fifth aspects, so that the devices or equipment execute the first aspect and the second aspect, and the method in any possible implementation of the first aspect and the second aspect.

[0087] In an eighth aspect, the present application provides a computer-readable storage medium storing instructions, which, when executed on a computer, enables the computer to execute the method in the first aspect and the second aspect, as well as any possible implementation of the first aspect and the second aspect.

[0088] In a ninth aspect, the present application provides a computer program product, comprising instructions, which, when executed on a computer, enable the computer to execute the method in the first aspect and the second aspect, as well as any possible implementation of the first aspect and the second aspect.

[0089] In a tenth aspect, the present application provides a chip, which includes a processor (or a logic circuit). Optionally, the chip may also include a communication interface (or interface) for implementing the above-mentioned first and second aspects, and the method in any possible implementation of the first and second aspects. In a possible implementation, if the chip is the smallest processing unit in the whole machine, the chip may be a processor, or may include a processor and a memory, or may include a processor, a memory and a transceiver, for implementing the above-mentioned first and second aspects, and the method in any possible implementation of the first and second aspects.

[0090] In an eleventh aspect, the present application provides a chip system. The chip system includes a processor and an interface. Optionally, it may also include a memory for implementing the above-mentioned first and second aspects, and the method in any possible implementation of the first and second aspects. The chip system may be composed of a chip, or may include a chip and other discrete devices. BRIEF DESCRIPTION OF THE DRAWINGS

[0091] Figure 1 A schematic diagram of a communication system provided for this application;

[0092] Figure 2 A schematic diagram of an integrated coding and encryption technology solution designed to utilize the channel quality advantage of a legitimate channel over an eavesdropping channel;

[0093] Figure 3 A schematic diagram of a coding and encryption integration technology based on frozen bits;

[0094] Figure 4 A flow chart of a communication method based on polar codes provided in this application;

[0095] Figure 5 A flowchart of a specific implementation of the communication method based on polar codes provided in this application;

[0096] Figure 6 A schematic diagram of a frozen bit update based on PDSCH provided in this application;

[0097] Figure 7 A schematic diagram of a frozen bit update based on PUSCH provided in this application;

[0098] Figure 8 A schematic diagram of the polar code-based communication method provided in the present application applied to a multi-HARQ process transmission scenario;

[0099] Fig. 9 A schematic diagram of a communication device provided by the present application;

[0100] Fig.10 A schematic diagram of another communication device provided in the present application. DETAILED DESCRIPTION

[0101] In the embodiments of the present application, " / " can indicate that the objects associated before and after are in an "or" relationship, for example, A / B can indicate A or B; "and / or" can be used to describe that there are three relationships between the associated objects, for example, A and / or B can indicate: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In order to facilitate the description of the technical solutions of the embodiments of the present application, in the embodiments of the present application, the words "first" and "second" can be used to distinguish between technical features with the same or similar functions. The words "first" and "second" do not limit the quantity and execution order, and the words "first" and "second" do not necessarily limit the difference. In the embodiments of the present application, the words "exemplary" or "for example" are used to indicate examples, illustrations or explanations, and any embodiment or design described as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other embodiments or design. The use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way for easy understanding.

[0102] The technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

[0103] In order to improve the security of integrated coding and encryption, the present application provides a communication method and a communication device based on polarization polar code, which can periodically or non-periodically update frozen bits to avoid leakage of frozen bits or exhaustive search, which is conducive to improving the security of integrated coding and encryption.

[0104] Among them, the communication method based on polarization polar code provided in this application can be applied to Figure 1 In the communication system shown. For example, the communication system includes a network device and a terminal, Figure 1 Only one network device and one terminal are used as examples for description, and the present application does not limit the number of the above devices. Among them, the network device can implement the encoding and encryption function or the decoding and decryption function, which is called the encoding end (encoding and encryption end) or the decoding end (decoding and decryption end); the terminal can also implement the encoding and encryption function or the decoding and decryption function, which can also be called the encoding end (encoding and encryption end) or the decoding end (decoding and decryption end). For example, when the network device is the encoding and encryption end, the terminal is the decoding and decryption end; or, when the terminal is the encoding and encryption end, the network device is the decoding and decryption end; or, when the terminal is the encoding and encryption end, the other terminal is the decoding and decryption end.

[0105] Among them, the communication system of the present application may include but is not limited to communication systems of various radio access technologies (radio access technology, RAT), for example, it may be: a new radio (new radio, NR) system, or it may be other communication systems, such as the next generation (6G) communication system and other systems evolved after NR, as long as there are two entities in the communication system, and one of the entities can send information to the other entity, or receive information sent by the other entity. The information here can be a physical signal such as a preamble, a reference signal, etc.; physical layer control information such as downlink control information (downlink control information, DCI), uplink control new signal (uplink control information, UCI), etc.; control plane (control plane, CP) data such as radio resource control (radio resource control, RRC) message, etc.; user plane (user plane, UP) data. Optionally, the above information can also be other specific scenario or application related information, such as enabling or related data generated by artificial intelligence (artificial intelligence, AI), machine learning (machine learning, ML) (such as gradient information, training data, model parameters, etc.), enabling sensing functions or related data generated by perception, etc.

[0106] Among them, the terminal, also known as terminal equipment (terminal), user equipment (UE), mobile station (MS), mobile terminal (MT), etc., refers to a device that provides voice and / or data connectivity to users, and can also be an IoT device. For example, the terminal includes a handheld device with wireless connection function, a vehicle-mounted device, etc. At present, some examples of terminals are: mobile phones, tablet computers, laptops, PDAs, mobile internet devices (MID), wearable devices (such as smart watches, smart bracelets, pedometers, smart glasses, etc.), vehicle-mounted equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed railways, etc.), satellite terminals, virtual reality (VR) equipment, augmented reality (AR) equipment, smart point of sale (POS) machines, customer-premises equipment (CPE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electric meters, etc.), intelligent robots, robotic arms, workshop equipment, wireless terminals in unmanned driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, flying equipment (such as intelligent robots, hot air balloons, drones, airplanes), terminals in future evolving networks, or terminals in future communication systems, etc. The terminal device can also be a vehicle device, such as a complete vehicle device, a vehicle-mounted module, a vehicle-mounted chip, an on-board unit (OBU) or a telematics box (T-BOX), etc. The terminal device can also be other devices with terminal functions. For example, the terminal device can also be a device that serves as a terminal function in device-to-device (D2D) communication.

[0107] Among them, the network equipment of the present application refers to a radio access network (RAN) node (or device) that connects the terminal to the wireless network, which can also be called an access network device, and can also be called a RAN node (or device). In one possible scenario, the network equipment may include: a base station, a transmission reception point (TRP), an evolved Node B (eNB), a transmitting point (TP), a next generation NodeB (gNB), a next generation base station in the sixth generation (6th generation, 6G) mobile communication system, a base station in a future mobile communication system, a satellite, or an access point (AP) in a WiFi system, an integrated access and backhaul (IAB) node, a network device in a mobile switching center non-terrestrial network (NTN) communication system, that is, it can be deployed on a high altitude platform or satellite, etc. The network equipment can be a macro base station, a micro base station or an indoor station, a relay node or a donor node, or a wireless controller in a cloud radio access network (CRAN) scenario. The network device may also be a device that functions as a base station in D2D communication, Internet of Vehicles communication, drone communication, and machine communication. Optionally, the network device may also be a server, a wearable device, a vehicle or an onboard device, etc. For example, the access network device in vehicle to everything (V2X) technology may be a roadside unit (RSU).

[0108] In another possible scenario, multiple network devices collaborate to assist the terminal in achieving wireless access, and different network devices respectively implement part of the functions of the base station. For example, the network device may include a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and DU may be set separately, or may be included in the same network element, such as a baseband unit (BBU). The RU may be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). It is understandable that the network device may be a CU node, a DU node, or a device including a CU node and a DU node. In addition, the CU may be divided into a network device in the access network RAN, or the CU may be divided into a network device in the core network CN, without limitation here.

[0109] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, CU, CU-CP, CU-UP, DU and RU are described as examples in this application. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0110] It should be noted that:

[0111] "Sending" and "receiving" in the embodiments of the present application indicate the direction of signal transmission. For example, "sending information to the terminal" can be understood as the destination end of the information is the terminal device, which can include direct sending through the air interface, and also includes indirect sending by other units or modules through the air interface. "Receiving information from a network device" can be understood as the source end of the information is the network device, which can include directly receiving from the network device through the air interface, and also includes indirectly receiving from the network device through the air interface from other units or modules. "Sending" can also be understood as the "output" of the chip interface, and "receiving" can also be understood as the "input" of the chip interface.

[0112] In other words, sending and receiving can be performed between devices, for example, between a network device and a terminal device, or can be performed within a device, for example, sending or receiving between components, modules, chips, software modules, or hardware modules within the device through a bus, wiring, or interface.

[0113] It is understandable that information may be processed accordingly between the source and destination of information transmission, such as coding, modulation, etc., but the destination can understand the valid information from the source. Similar expressions in this application can be understood similarly and will not be repeated.

[0114] In the embodiments of the present application, "indication" may include direct indication and indirect indication, and may also include explicit indication and implicit indication. The information indicated by a certain information (such as the indication information described below) is called information to be indicated. In the specific implementation process, there are many ways to indicate the information to be indicated, such as but not limited to, directly indicating the information to be indicated, such as the information to be indicated itself or the index of the information to be indicated. The information to be indicated may also be indirectly indicated by indicating other information, wherein there is an association between the other information and the information to be indicated; it may also be possible to indicate only a part of the information to be indicated, while the other part of the information to be indicated is known or agreed in advance, for example, the indication of specific information can be realized by means of the arrangement order of each information agreed in advance (such as predefined by the protocol), thereby reducing the indication overhead to a certain extent. The present application does not limit the specific method of indication. It is understandable that, for the sender of the indication information, the indication information can be used to indicate the information to be indicated, and for the receiver of the indication information, the indication information can be used to determine the information to be indicated.

[0115] 1. For ease of understanding, the definitions of relevant terms involved in this application are introduced in detail below:

[0116] 1. Integrated coding and encryption technology:

[0117] The existing communication system security transmission scheme relies on key management and high-level encryption algorithms. However, key management and maintenance require the support of complex communication protocols and cause additional signaling overhead. In addition, protocol vulnerabilities may be exploited by adversaries, thus causing security risks to the communication system. Moreover, if high-level encryption algorithms are directly applied to the encryption of physical layer data or signaling, there will be problems such as high computational complexity and excessive signal processing delay.

[0118] The integrated coding and encryption technology can enhance the security of transmission without affecting the error correction performance by introducing encryption capabilities into channel coding. On the one hand, the integration of encryption and coding can save overhead and reduce the processing delay caused by too many multi-protocol layer processing links; on the other hand, since the underlying control signaling lacks an encryption mechanism, it is vulnerable to eavesdropping, but based on the integrated coding and encryption technology, it can provide security for the underlying control signaling.

[0119] 2. Integrated coding and encryption technology based on channel design:

[0120] Among them, Polar code has a special coding structure, which is suitable for combination with encryption; in addition, Polar code is used in control channels, and it is also of practical significance to implement integrated coding and encryption operations on it. Therefore, most of the current integrated coding and encryption technical solutions are based on Polar code. For example, Figure 2 The figure is a schematic diagram of an integrated coding and encryption technology solution designed to take advantage of the channel quality advantage of the legitimate channel over the eavesdropping channel. In it, the legitimate transmitter Alice performs Polar encoding on the information bits to be sent and sends them to the legitimate receiver Bob. According to the channel polarization principle, the equivalent channel quality experienced by each information bit to be sent by the legitimate transmitter will be different. The equivalent channel experienced by each bit can be divided into two categories: "good channel" and "bad channel", such as Figure 2 As shown. Assuming that the channel polarization is ideal, bits transmitted on a good channel will not be erroneous during transmission, while bits transmitted on a bad channel may be erroneous during transmission. If the channel quality from the sender Alice to the eavesdropper Eve is worse than the channel quality from Alice to the receiver Bob (i.e., the legitimate link has a channel quality advantage), then the number of "good channels" polarized in the channel from Alice to Eve will be less than the number of "good channels" polarized in the channel from Alice to Bob, as shown in Figure 2 As shown. Therefore, there will be some bits that experience a "good channel" from Alice to Bob, but a "bad channel" from Alice to Eve. If bits carrying useful information are sent on these equivalent channels, these bits will only be correctly received by Bob, but not by Eve, thus achieving a confidentiality effect. For those equivalent bit channels that are "good channels" for both Bob and Eve, random bits are sent, that is, they do not carry any information. In this way, even if these bits are received by Eve, they will not cause the leakage of useful information. For the "bad channel" polarized in Bob's channel, frozen bits are sent, and these bits may not be correctly received by Bob and Eve.

[0121] However, the above method is based on the assumption that the legitimate channel has a channel quality advantage over the wiretap channel (for example, a higher received signal-to-noise ratio), and assumes that the sender knows the channel state information (CSI) of the wiretap channel, which is difficult to meet in practice. In addition, the above method may cause additional rate loss.

[0122] 3. Coding and encryption integration technology based on frozen bits:

[0123] Polar code decoding requires both parties to agree on the value of the frozen bit. If the frozen bit is wrong, the decoding cannot be correct. For example, Figure 3 This is a schematic diagram of an integrated coding and encryption technology based on frozen bits. The coding end uses the preset key as the frozen bit of the polar code encoding or uses the key to process the frozen bit (such as XOR, encryption, or other scrambling / coding methods). After this processing, the eavesdropper cannot know the frozen bit and cannot decode it correctly. However, if the frozen bit does not change for a long time (for example, the key is directly used as the frozen bit) or the frozen bit is generated according to a fixed preset key, once the key is leaked or obtained through exhaustive search, the security of all message bits cannot be guaranteed.

[0124] Based on this, the present application provides a communication method and a communication device based on polarization polar codes. The method can determine the frozen bits of the current transmission based on at least one of the frozen bits or information bits of the previous transmission or a preset key, which is beneficial to avoid leakage of frozen bits and improve the security of physical layer transmission.

[0125] 2. The communication method based on polarization code provided by this application:

[0126] For example, Figure 4 A flow chart of a communication method based on polar codes provided in the present application. The method can be implemented by interaction between a first device and a second device, wherein the first device is a device for implementing encoding and encryption functions (such as a terminal or a network device), and the second device is a device for implementing decoding and decryption functions (such as a network device or a terminal).

[0127] S101, a first device performs Polar encoding on a first bit block to be encoded to obtain a first encoded bit block.

[0128] The first bit block to be encoded includes a first frozen bit, and the first frozen bit is used for integrated encoding and encryption processing of the first bit block to be encoded. For example, assuming that in the first bit block to be encoded, the information bit to be encoded is represented by m k , the first frozen bit is denoted as f k Assume that the first coded bit block is denoted as d k, then the first device can perform Polar encoding to obtain d k =ECC(m k , f k ), where ECC(x, y) represents the Polar coding operation.

[0129] Optionally, the first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel (PDSCH), a bit block transmitted on a physical uplink shared channel (PUSCH), a bit block transmitted on a physical downlink control channel (PDCCH), and a bit block transmitted on a physical uplink control channel (PUCCH). The present application does not limit the first bit block to be encoded to a bit block in an uplink transmission scenario or a bit block in a downlink transmission scenario. The downlink control information may be DCI, or other possible names for downlink control information in subsequent evolved protocols, which are not limited in the present application. Similarly, the uplink control information may be UCI, or other possible names for downlink control information in subsequent evolved protocols, etc. For example, assuming that the first bit block to be encoded is downlink control information, the downlink control information carries information bits m to be encoded. k The first device performs Polar coding on the information bits to be coded carried by the downlink control information based on the first frozen bits to obtain a first coded bit block d k =ECC(m k , f k ). That is, the information carried in the above-mentioned downlink control information\uplink control information\bit block transmitted on the physical downlink shared channel\bit block transmitted on the physical uplink shared channel\bit block transmitted on the physical downlink control channel\bit block transmitted on the physical uplink control channel includes information bits to be encoded.

[0130] The first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key, and the second information bit or the second frozen bit is associated with the second coded bit block. The second coded bit block is a bit block transmitted before the first coded bit block. For example, the second coded bit block is a bit block transmitted before the first coded bit block, indicating that the first device first generates and sends the second coded bit block, and then generates and sends the first coded bit block. The second coded bit block is obtained by performing Polar encoding on the second bit block to be encoded. For example, it is assumed that the second coded bit block is represented by d k-1In the second bit block to be encoded, the information bits to be encoded are represented by m k-1 , the second frozen bit is denoted as f k-1 , then the first device can perform Polar encoding to obtain d k-1 =ECC(m k-1 , f k-1 ). The preset key refers to a key for encryption and decryption that is known in advance by both the encoding side and the decoding side. For example, the preset key can be expressed as key, including but not limited to various types of encryption and decryption keys in cryptography, which is not limited in this application.

[0131] Optionally, if a confirmation response for a physical downlink shared channel is received or a physical uplink shared channel is successfully decoded, the first frozen bit is obtained by processing the second frozen bit and the second information bit based on the first function. For example, if a confirmation response for a physical downlink shared channel is received or a physical uplink shared channel is successfully decoded, indicating that the PDSCH of the previous transmission was successfully decoded by the receiving end or the PUSCH of the previous transmission was successfully decoded by the transmitting end, the encoding end can use the information bits in the PDSCH associated with the second coding bit block of the previous transmission or the information bits in the PUSCH associated with the second coding bit block of the previous transmission to update the frozen bits used for this Polar encoding. For example, assuming that the PDSCH of the previous transmission is successfully decoded by the receiving end, the second information bit is the information bit in the PDSCH of the previous transmission, and the second information bit is represented by i k-1 , the second frozen bit is denoted as f k-1 , then the first frozen bit is represented by f k =g1(f k-1 ,i k-1 ); wherein g1 represents a first function for generating frozen bits, and a specific implementation of the first function is described in detail in a subsequent embodiment. Optionally, the second information bit is all or part of the information bit in the PDSCH of the previous transmission, or the second information bit is all or part of the information bit in the PUSCH of the previous transmission. Similarly, assuming that the subsequent transmission process also updates the frozen bits in a similar manner, for example, assuming that the PDSCH of the current transmission is successfully decoded by the receiving end, the information bit in the PDSCH associated with the coded bit block of the current transmission is represented by i k , the frozen bits in the bit block to be encoded in the current transmission are represented by f k , then the frozen bits used for the next encryption (i.e., the updated frozen bits) are expressed as f k+1 =g1(f k ,i k ). It can be seen that the present application can use the information bits of the previous transmission to update the frozen bits used in this Polar coding, thereby realizing secure communication with integrated coding and encryption.

[0132] Optionally, if a negative response to the physical downlink shared channel is received or the physical uplink shared channel is not successfully decoded, the first frozen bit is obtained by processing at least one of the preset key or the first frozen bit based on the second function. For example, if a negative response to the physical downlink shared channel is received or the physical uplink shared channel is not successfully decoded, indicating that the PDSCH of the previous transmission was not successfully decoded by the receiving end or the PUSCH of the previous transmission was not successfully decoded by the transmitting end, the encoding end may choose not to update the frozen bit currently, or generate the first frozen bit based on the preset key. For example, assuming that the second frozen bit is represented by f k-1 , the first frozen bit is denoted as f k =f k-1 , that is, the current transmission does not update the frozen bit, still based on f k-1 The information bits are encoded and encrypted. Optionally, the second frozen bits are all or part of the frozen bits used in the previous Polar encoding. For another example, the first frozen bits are represented by f k =g2(key), g2 represents a second function for generating frozen bits, and the specific implementation of the second function will be described in detail in subsequent embodiments, and key represents a preset key.

[0133] S102, the first device sends a first coded bit block; correspondingly, the second device receives the first coded bit block.

[0134] The first device is a coding end, and can send a first coding bit block to a decoding end. For example, assuming that the first coding bit block includes DCI, the first device sending the first coding bit block indicates that the base station sends DCI to the terminal, and correspondingly, the terminal receives DCI.

[0135] Optionally, the first device sends the first coded bit block, which actually undergoes modulation and other processes and then is transmitted through the channel. Correspondingly, the second device receives the first coded bit block, which actually receives the first coded bit block transmitted through the channel and obtains a coded bit block after demodulation. The coded bit block may not be exactly the same as the first coded bit block, but the information bits it carries are the same.

[0136] Optionally, after receiving the first coded bit block, the second device may perform Polar decoding on the first coded bit block based on the first frozen bit to obtain a first bit block to be coded. Optionally, for the decoding end, if the generation rule of the first frozen bit is unknown to the decoding end, the decoding end may assume that the generation rule of the first frozen bit is f k =g1(f k-1 ,i k-1 ), or f k =fk-1 , or f k =g2(key), and based on the above rules, multiple first frozen bits are generated, and then decoding is attempted based on multiple possible first frozen bits, and which hypothesis is correct is determined based on whether the cyclic redundancy check (CRC) passes, so that the first bit block to be encoded can be finally obtained, that is, the information bits transmitted this time. Optionally, if the generation rule of the first frozen bit is known to the decoding end, the decoding end can obtain the first frozen bit based on the generation rule, and decode based on the first frozen bit to obtain the first bit block to be encoded (including the information bits transmitted this time). Optionally, the generation rule of the first frozen bit is unknown to the decoding end, including the following situations: For example, assuming that for the encoding end, the generation rule of the first frozen bit is to update the first frozen bit based on the PUSCH associated with the DCI; since the base station will not feedback indication information such as ACK or NACK to the terminal, the terminal does not know whether the base station decodes the PUSCH correctly, and cannot determine which method is used to generate the first frozen bit (f k =g1(f k-1 ,i k-1 ) or f k =g2(key)), so the terminal as a decoding end cannot determine the generation rule of the first frozen bit. Optionally, the generation rule of the first frozen bit is known to the decoding end, including the following situations: For example, assuming that for the encoding end, the generation rule of the first frozen bit is to update the first frozen bit based on the PDSCH associated with the DCI; since the terminal can feedback ACK or NACK indication information to the base station after receiving the PDSCH, the terminal and the base station can both know whether the terminal correctly decodes the PDSCH, then the encoding end and the decoding end both determine to generate the first frozen bit in the same way, so the terminal as the decoding end knows the generation rule of the first frozen bit.

[0137] In this embodiment, when the encoding side encodes the current first bit block to be encoded, it determines the frozen bit used for the current encoding and encryption based on the second information bit or the second frozen bit associated with the second encoded bit block transmitted previously. This not only realizes secure communication integrating encoding and encryption, but also improves the randomness of the frozen bit, making it difficult for the eavesdropper to obtain it, which is beneficial to avoiding the leakage of the frozen bit and improving the security of the encoding and encryption.

[0138] 3. When the polar code-based communication method provided by the present application is applied to different transmission scenarios, the specific implementation process is as follows:

[0139] Example 1: In a transmission scenario without multiple HARQ processes, a frozen bit update method and an integrated encoding and encryption solution.

[0140] For example, Figure 5 A schematic diagram of a specific implementation of the communication method based on polar codes provided in this application. The process is implemented by the interaction between the first device (encoding end) and the second device (decoding end), and includes the following steps:

[0141] S201, a first device determines a first frozen bit.

[0142] Based on the foregoing description, the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key; wherein the second information bit is related to the first to-be-encoded bit block.

[0143] For example, the relationship between the second information bit and the first block of bits to be encoded may include but is not limited to one or more of the following: if the first block of bits to be encoded includes the first DCI, the second information bit is the information bit transmitted on the PDSCH or PUSCH associated with the second DCI before the first DCI; if the first block of bits to be encoded includes the first UCI, the second information bit is the information bit transmitted on the PDSCH or PUSCH associated with the second UCI before the first UCI; if the first block of bits to be encoded includes information bits transmitted on the first PDSCH, the second information bit is the information bit transmitted on the second PDSCH before the first block of bits to be encoded; if the first block of bits to be encoded includes information bits transmitted on the first PUSCH, the second information bit is the information bit transmitted on the second PUSCH before the first block of bits to be encoded; if the first block of bits to be encoded includes information bits transmitted on the first PDCCH, the second information bit is the information bit transmitted on the second PDCCH before the first block of bits to be encoded; if the first block of bits to be encoded includes information bits transmitted on the first PUCCH, the second information bit is the information bit transmitted on the second PUCCH before the first block of bits to be encoded. The relationship between the above-mentioned second information bit and the first bit block to be encoded also shows that the communication method provided by the present application is suitable for Polar encoding of different types of bit blocks to be encoded (such as different types of control information or information bits transmitted on different types of channels), thereby realizing the integration of encoding and encryption in different transmission scenarios and improving data security. The following description will be given by taking the example that the first bit block to be encoded includes the first DCI, and the second information bit is the information bit transmitted on the PDSCH or PUSCH associated with the second DCI before the first DCI. The specific implementation methods of other types of bit blocks to be encoded and the second information bits are similar, and can be implemented with reference to the following examples.

[0144] (1) PDSCH-based frozen bit update method:

[0145] For example, Figure 6A schematic diagram of a frozen bit update based on PDSCH provided in the present application. Figure 6 In the embodiment, the first device is an encoding end (eg, a base station), and the second device is a decoding end (eg, a terminal). Figure 6 DCI k-1 is the second DCI in the second block to be coded, PDSCH k-1 The PDSCH associated with the second DCI (including the second information bit), ACK / NACK onPUCCH indicates the confirmation / negative confirmation carried on the PUCCH (that is, for the PDSCH k-1 DCI k is the first DCI in the first block to be coded, PDSCH k is the PDSCH associated with the first DCI. Assume that DCI k-1 ,PDSCH k-1 The information bits belong to the k-1th transport block; DCI k ,PDSCH k The information bits belong to the kth transport block (the k-1th transport block is encoded and transmitted first, and the kth transport block is encoded and transmitted later). The DCI-associated PDSCH may refer to the DCI indicating the PDSCH. For example, the information carried in the DCI may indicate the time-frequency domain resources for sending the PDSCH.

[0146] Optionally, assuming that the first DCI sent in the kth transport block is denoted as d k , the DCI information bits to be sent are represented by m k , the first frozen bit of Polar code is represented as f k ; The second DCI sent in the k-1th transport block is denoted as d k-1 , the information bit sent on the PDSCH associated with the second DCI is represented by i k-1 , then the implementation of S201 may include the following process:

[0147] Option 1: If a confirmation response for the physical downlink shared channel is received, the first device processes the second frozen bit and the second information bit based on the first function to obtain the first frozen bit.

[0148] For example, if with d k-1 If the associated PDSCH is successfully decoded by the receiving end (i.e., the feedback on the PUCCH is ACK), the first frozen bit is represented by f k =g1(f k-1 ,i k-1 ). Optional, i k-1 Indicates part or all of the information bits sent on the PDSCH in the k-1th transport block, which is not limited in this application.k =g1(f k-1 ,i k-1 ) can be deduced, f k-1 =g1(f k-2 ,i k-2 ), f k-2 =g1(f k-3 ,i k-3 ), etc., that is, each update of the frozen bit is based on the frozen bit of the previous transmission, which is conducive to improving security. Optionally, the first frozen bit is represented by f k =g1(i k-1 ), that is, the first device processes the second information bit (excluding the second frozen bit) based on the first function, and can also obtain the first frozen bit, but each update of the frozen bit is based on part or all of the information bits sent on the previous PDSCH rather than on the frozen bits of the previous transmission.

[0149] Optionally, the first function includes: a combination of one or more of hashing, truncation, concatenation, sampling, and symmetric encryption. For example, the specific implementation of the first function includes but is not limited to a combination of one or more of the following:

[0150] A. The first frozen bit is obtained by concatenating the second frozen bit and the second information bit, using the concatenation result as the input parameter of the hash function, and truncating the output result of the hash function. For example, the first function is represented by g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ||i k-1 )), where trunc means truncation, Hash is a hash function, and || means concatenation. trunc(Hash(f k-1 ||i k-1 )) indicates that the length of the truncated bit string is consistent with the required length of the first frozen bit. Optionally, the second frozen bit and the second information bit are concatenated, and it is not limited which one comes first and which one comes later. For example, the second frozen bit may come first and the second information bit may come later; or the second information bit may come first and the second frozen bit may come later.

[0151] B. The first frozen bit is the output result of a hash function, the input parameters of which include the concatenation result of the second frozen bit and the second information bit, and the required length of the first frozen bit. For example, the first function is represented by g1(f k-1 ,i k-1 )=Hash(f k-1 |f k-1, length), where length is equal to the required length of the first frozen bit. Optionally, when the input parameter of the hash function includes length, it means that the length of the output result of the hash function is the same as the value of length (limiting the length of the output result).

[0152] C. The first frozen bit is the output result of a hash function, the input parameters of which include the second frozen bit and the required length of the first frozen bit. For example, the first function is represented by g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ||i k-1 ||key)), where length is equal to the required length of the first frozen bit.

[0153] D. The first frozen bit is obtained by concatenating the second frozen bit, the second information bit and the preset key, using the concatenation result as the input parameter of the hash function, and truncating the output result of the hash function. For example, the first function is represented by g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ||i k-1 ||key)), where key represents the preset key.

[0154] E. The first frozen bit is obtained by randomly sampling the second information bit, concatenating the random sampling results of the second frozen bit and the second information bit, using the concatenated result as the input parameter of the hash function, and truncating the output result of the hash function. For example, the first function is expressed as g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ||sampling(i k-1 ))), wherein sampling means random sampling, and the sampling pattern is determined based on the key and a preset encryption algorithm. The specific encryption algorithm is not limited in this application.

[0155] The first frozen bit F is obtained by concatenating the second frozen bit and the second information bit and then randomly sampling, using the random sampling result as the input parameter of the hash function, and truncating the output result of the hash function. For example, the first function is expressed as g1(f k-1 ,i k-1 )=trunc(Hash(sampling(f k-1 ||i k-1))), wherein sampling means random sampling, and the sampling pattern is determined based on the key and a preset encryption algorithm. The specific encryption algorithm is not limited in this application.

[0156] G. The first frozen bit is obtained by performing encryption calculation on the second information bit and the preset key, concatenating the second frozen bit and the encryption calculation result, using the concatenation result as the input parameter of the hash function, and truncating the output result of the hash function. For example, the first function is expressed as g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ||AES(i k-1 , key))), wherein AES represents the advanced encryption standard (AES) encryption algorithm, or other symmetric encryption algorithms may be selected, which is not limited in this application.

[0157] Option 2: If a negative response to the physical downlink shared channel is received, the first device processes at least one of the preset key or the second frozen bit based on the second function to obtain the first frozen bit.

[0158] For example, if with d k-1 If the associated PDSCH is not successfully decoded by the receiving end (i.e., the feedback on the PUCCH is NACK), the first frozen bit is represented by f k =f k-1 ; For example, the PDSCH of the previous transmission was not successfully decoded by the receiving end, and this transmission may be a retransmission, then the frozen bit is not updated in this transmission; or the first frozen bit is represented by f k =g2(key); For example, the second function and the preset key are known to both the encoding end and the decoding end, which is beneficial for the decoding end to determine the first frozen bit and correctly decode based on the first frozen bit.

[0159] Optionally, the second function includes: a combination of one or more of hashing, truncation, concatenation, sampling, and symmetric encryption. For example, the specific implementation of the second function includes but is not limited to a combination of one or more of the following:

[0160] A. The first frozen bit is obtained by taking the preset key as the input parameter of the hash function and truncating the output result of the hash function. For example, the second function is expressed as g2(key)=trunc(Hash(key)).

[0161] B. The first frozen bit is the output result of a hash function, and the input parameters of the hash function include a preset key and a required length of the first frozen bit. For example, the second function is expressed as g2(key)=Hash(key, length).

[0162] C. The first frozen bit is the output result of a hash function, the input parameters of which include the concatenation of a preset key and the second frozen bit, and the required length of the first frozen bit. For example, the second function is represented by g2(key)=Hash(key||f k-1 , length).

[0163] D. The first frozen bit is the output result of a hash function, the input parameters of which include a random sampling result obtained by randomly sampling the concatenation of the preset key and the second frozen bit, and the required length of the first frozen bit. For example, the second function is expressed as g2(key)=Hash(sampling(key||f k-1 ), length).

[0164] Optionally, the implementation process of S201 is similar for uplink transmission. For example, assuming that the first UCI sent in the kth transmission block is represented by d k , the UCI information bits to be sent are represented by m k , the first frozen bit of Polar code is represented as f k ; The second UCI sent in the k-1th transmission block is denoted as d k-1 , the information bits sent on the PUSCH associated with the second UCI are denoted as i k-1 If the indication information associated with the second UCI indicates that the PUSCH associated with the second UCI is successfully decoded by the transmitting end, the first frozen bit is represented as f k =g1(f k-1 ,i k-1 ); if the indication information associated with the second UCI indicates that the PUSCH associated with the second UCI is not successfully decoded by the transmitting end, the first frozen bit is represented by f k =f k-1 or k =g2(key).

[0165] (2) PUSCH-based frozen bit update method:

[0166] For example, Figure 7 A schematic diagram of a frozen bit update based on PUSCH provided in the present application. Figure 7 In the embodiment, the first device is an encoding end (eg, a base station), and the second device is a decoding end (eg, a terminal). Figure 7 DCIk-1 is the second DCI in the second block to be coded, PUSCH k-1 PUSCH associated with the second DCI (including the second information bit); DCI k is the first DCI in the first block to be coded, PUSCH k is the PUSCH associated with the first DCI. Assume that DCI k-1 , PUSCH k-1 The information bits belong to the k-1th transport block; DCI k , PUSCH k The information bits belong to the kth transport block (the k-1th transport block is encoded and transmitted first, and the kth transport block is encoded and transmitted later). The DCI-associated PUSCH means that the DCI indicates the PUSCH. For example, the information carried in the DCI can indicate the time-frequency domain resources for sending the PUSCH.

[0167] Optionally, assuming that the first DCI sent in the kth transport block is denoted as d k , the DCI information bits to be sent are represented by m k , the first frozen bit of Polar code is represented as f k ; The second DCI sent in the k-1th transport block is denoted as d k-1 , the information bit sent on the PUSCH associated with the second DCI is represented by i k-1 , then the implementation of S201 may include the following process:

[0168] Option 1: If the physical uplink shared channel is decoded successfully, the first device processes the second frozen bits and the second information bits based on the first function to obtain the first frozen bits.

[0169] For example, if with d k-1 The associated PUSCH is successfully decoded by the base station (assuming uplink transmission, the base station is the encoding end, and the base station receives PUSCH), then the first frozen bit is represented by f k =g1(f k-1 ,i k-1 ). Optional, i k-1 represents part or all of the information bits sent on the PUSCH in the k-1th transmission block, which is not limited in this application. Optionally, the first frozen bit is represented by f k =g1(i k-1 ), that is, the first device processes the second information bit (excluding the second frozen bit) based on the first function, and can also obtain the first frozen bit, but each update of the frozen bit is based on part or all of the information bits sent on the previous PUSCH instead of the frozen bit of the previous transmission. Optionally, the specific implementation of the first function refers to the corresponding description in the previous text, which will not be repeated here.

[0170] Option 2: If the physical uplink shared channel is not decoded successfully, the first device processes at least one of the preset key or the second frozen bit based on the second function to obtain the first frozen bit.

[0171] For example, if with d k-1 The associated PUSCH is not successfully decoded by the base station (assuming uplink transmission, the base station is the encoding end, and the base station receives PUSCH), then the first frozen bit is represented by f k =f k-1 ; For example, the PUSCH of the previous transmission was not successfully decoded by the base station, and this transmission may be a retransmission, then the frozen bit is not updated in this transmission; or the first frozen bit is represented by f k =g2(key); For example, the second function and the preset key are known to both the encoding end and the decoding end, which is helpful for the decoding end to determine the first frozen bit and correctly decode based on the first frozen bit. Optionally, the specific implementation of the second function refers to the corresponding description above, which will not be repeated here.

[0172] Optionally, the implementation process of S201 is similar for uplink transmission. For example, assuming that the first UCI sent in the kth transmission block is represented by d k , the UCI information bits to be sent are represented by m k , the first frozen bit of Polar code is represented as f k ; The second UCI sent in the k-1th transmission block is denoted as d k-1 , the information bits sent on the PDSCH associated with the second UCI are represented by i k-1 If the indication information associated with the second UCI indicates that the PDSCH associated with the second UCI is successfully decoded by the receiving end, the first frozen bit is represented as f k =g1(f k-1 ,i k-1 ); if the indication information associated with the second UCI indicates that the PDSCH associated with the second UCI is not successfully decoded by the receiving end, the first frozen bit is represented by f k =f k-1 or k =g2(key).

[0173] S202: The first device performs Polar encoding on the information bits based on the first frozen bits to obtain a first encoded bit block.

[0174] For example, the first device determines the first frozen bit f k After that, Polar coding is performed to obtain the first coded bit block d k =ECC(m k , f k ).

[0175] S203, the first device sends a first coded bit block; correspondingly, the second device receives the first coded bit block.

[0176] For example, the first coded bit block includes DCI, and the first device sending the first coded bit block indicates that the base station sends DCI to the terminal, and correspondingly, the terminal receives the DCI.

[0177] S204: The second device performs Polar decoding on the first coded bit block based on the first frozen bits to obtain a first bit block to be coded.

[0178] For example, in a frozen bit update method based on PDSCH, since the decoding end can feedback ACK / NACK, the generation rule of the first frozen bit is known to the decoding end, and the decoding end can obtain the first frozen bit based on the generation rule, and decode based on the first frozen bit to obtain the first bit block to be encoded.

[0179] For another example, in the frozen bit updating method based on PUSCH, since the decoding end cannot determine whether the encoding end successfully decodes the physical uplink shared channel, the generation rule of the first frozen bit is unknown to the decoding end, and the decoding end can assume that the generation rule of the first frozen bit is f k =g1(f k-1 ,i k-1 ), or f k =f k-1 , or f k =g2(key), and attempt to decode based on multiple possible first frozen bits respectively, and determine which hypothesis is correct according to whether the CRC check passes, so that the first bit block to be encoded can be finally obtained, that is, the information bit of this transmission.

[0180] In this example one, when the encoding side encodes the current first bit block to be encoded, it determines the frozen bit used for the current encoding and encryption based on the second information bit or second frozen bit associated with the second encoded bit block transmitted previously. This not only realizes secure communication with integrated encoding and encryption, but also improves the randomness of the frozen bit, making it difficult for the eavesdropper to obtain it, which is beneficial to avoid the leakage of the frozen bit and improves the security of the encoding and encryption.

[0181] Example 2: A frozen bit update method and an integrated coding and encryption solution for a multi-HARQ process transmission scenario.

[0182] For example, Figure 8The schematic diagram of the polar code-based communication method provided in the present application is applied to a multi-HARQ process transmission scenario. Assume that there are K transport blocks (TB), for example, TB1 to TB K ; Assume that each TB includes DCI and PDSCH (such as Figure 6 ); Each TB corresponds to a HARQ process, for example, TB1 corresponds to HARQ process #1, and so on. K Corresponding to HARQ process #K, such as Figure 8 Optionally, which HARQ process each transport block corresponds to is determined by the HARQ process identifier (HARQ process ID) carried by the DCI in the transport block. The frozen bits of the DCI in each HARQ process only use the transport block data of the HARQ process (e.g. Figure 8 For PDSCH data).

[0183] Optionally, depending on whether the transport block data in the HARQ process is sent on a downlink channel (PDSCH data) or on an uplink channel (PUSCH data), specific implementations of Example 2 include the following cases:

[0184] Case 1: Update frozen bits based on PDSCH:

[0185] (1) For the encoding end, a possible implementation is to assume that multiple HARQ processes each update the frozen bit, then for each HARQ process, the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key of the HARQ process. The specific implementation method can refer to the corresponding description of the above embodiment, which will not be repeated here.

[0186] Another possible implementation is to assume that multiple HARQ processes jointly update the frozen bits, then assume that there is a frozen bit update period, and the first frozen bit is determined based on at least one of the second information bit, the second frozen bit, or a preset key when the time of the frozen bit update period is reached. Among them, the second information bit is the information bit in one or more HARQ processes within the frozen bit update period; the second frozen bit is the frozen bit in one or more HARQ processes within the frozen bit update period. For example, when there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, the first device determines the frozen bit update period. When the time of a frozen bit update period is reached, the first device determines the first frozen bit based on at least one of the second information bit, the second frozen bit, or the preset key.

[0187] Optionally, the frozen bit update period is a maximum time interval among multiple time intervals corresponding to multiple HARQ processes; or, the frozen bit update period is a preset time interval. The time interval is a time interval between a physical downlink shared channel of a HARQ process in multiple HARQ processes and a confirmation or negative response of the physical downlink shared channel.

[0188] In a possible implementation, the time interval is configured by the network device to the terminal, for example, by RRC signaling.

[0189] For example, there is a preset time interval K1 between the ACK / NACK transmitted from PDSCH to PUCCH, which is defined by the parameter dl-DataToUL-ACK of PUCCH configuration (PUCCH-config) in RRC signaling. According to this feature, the largest K1 in all HARQ processes can be used as the frozen bit update period. It can be understood that if the largest K1 is used as the frozen bit update period, it is beneficial for all HARQ processes to update the frozen bits and improve security.

[0190] Optionally, when the time of the frozen bit update period is reached, the encoding end may update the frozen bits according to the ACK / NACK status of the PDSCH of each HARQ process within the frozen bit update period. For example, the frozen bits are updated based on all successfully sent PDSCHs within the frozen bit update period, or the frozen bits are updated based on the successfully sent PDSCHs within the HARQ process with the smallest HARQ process number within the frozen bit update period, or the frozen bits are updated based on the successfully sent PDSCHs within the HARQ process with the largest HARQ process number within the frozen bit update period, or the frozen bits are updated based on the successfully sent PDSCHs within any HARQ process within the frozen bit update period, and this application does not limit this. The updated frozen bits are used for the DCI of all subsequent HARQ processes within the update period until the next frozen bit update period, which is beneficial to improving the randomness of the frozen bits and avoiding too frequent updates of the frozen bits, which is beneficial to reducing computational overhead.

[0191] Optionally, the specific implementation method of the encoder updating the frozen bit according to the ACK / NACK status of the PDSCH of each HARQ process within the frozen bit update period refers to the corresponding description in the frozen bit update method based on PDSCH. For example, if there are N HARQ processes receiving confirmation responses for the physical downlink shared channel within the frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and the second information bits of the N HARQ processes based on the first function, where N is a positive integer. For example, for the N HARQ processes, determining the first frozen bit f based on the second frozen bit and the second information bit is respectively performed. k =g1(f k-1 ,i k-1 ), the first frozen bits of the N HARQ processes can be determined, and each HARQ process uses its own first frozen bit for Polar coding. Alternatively, for the N HARQ processes, the HARQ process with the smallest HARQ process number is selected to determine the first frozen bit f based on the second frozen bit and the second information bit. k =g1(f k-1 ,i k-1 ), the first frozen bit of the HARQ process with the smallest HARQ process number can be determined, and subsequent HARQ processes (for example, the HARQ process number is greater than the minimum value of the HARQ process number) all use the first frozen bit of the HARQ process with the smallest HARQ process number for Polar coding. Alternatively, the first frozen bit is obtained by processing the second frozen bits and the second information bits of M HARQ processes based on the first function, where the M HARQ processes are any M HARQ processes among the N HARQ processes, and M is a positive integer less than or equal to N. For example, for the M HARQ processes, assuming that there are M1 HARQ processes in the M processes that receive ACK for the PDSCH, then for the M1 HARQ processes, determining the first frozen bit f based on the second frozen bit and the second information bit is performed respectively. k =g1(f k-1 ,i k-1 ), the first frozen bits of the M1 HARQ processes can be determined, and the M1 HARQ processes use their respective first frozen bits for Polar coding. Assuming that there are M2 HARQ processes in the M processes that receive NACK for PDSCH, for the M2 HARQ processes, the first frozen bits f are determined based on the second frozen bits or the preset key. k =f k-1 or k=g2(key), the first frozen bits of the M2 HARQ processes can be determined respectively, and the M2 HARQ processes use their respective first frozen bits for Polar coding.

[0192] (2) For the decoding end, the decoding end can use a blind detection method to decode the received DCI. Since the decoding end does not know which HARQ process the received DCI belongs to before decoding, the decoding end can use a traversal method to try various possibilities of frozen bits to determine the frozen bits. For example, the decoding end assumes that the received DCI belongs to a certain HARQ process (such as HARQ process #1), and then based on the DCI frozen bit update method, uses the PDSCH data of the previous successful transmission in the HARQ process to generate frozen bits, and decodes the DCI based on the frozen bits; and so on, traverse all possible HARQ processes (such as HARQ process #1 to HARQ process #K) until the frozen bits are determined (for example, the CRC check result can be used to determine whether the DCI is successfully decoded, thereby determining whether the assumed frozen bits are correct), thereby completing the decoding of the DCI and the synchronization of the frozen bits.

[0193] Case 2: Update frozen bits based on PUSCH:

[0194] (1) For the encoding end, a possible implementation is to assume that multiple HARQ processes each update the frozen bit, then for each HARQ process, the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key of the HARQ process. The specific implementation method can refer to the corresponding description of the above embodiment, which will not be repeated here.

[0195] Another possible implementation is to assume that multiple HARQ processes jointly update the frozen bits, then assume that there is a frozen bit update period, and when the time of the frozen bit update period is reached, the first frozen bit is determined based on the second information bit or the second frozen bit or at least one of the preset keys. Among them, the second information bit is the information bit in one or more HARQ processes within the frozen bit update period; the second frozen bit is the frozen bit in one or more HARQ processes within the frozen bit update period. For example, when there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, the first device determines the frozen bit update period. When the time of a frozen bit update period is reached, the first device determines the first frozen bit based on at least one of the second information bit or the second frozen bit or the preset key.

[0196] Optionally, for PUSCH transmission, since there is no ACK / NACK and no parameters such as d1-DataToUL-ACK, the frozen bit update period is a pre-set time interval; within this time interval, both the encoding and decoding parties do not update the frozen bits; when the time interval is reached, both the encoding and decoding parties update the frozen bits used by the DCI of all HARQ processes.

[0197] Optionally, if PUSCH is successfully decoded in at least one HARQ process within the frozen bit update period, the first frozen bit is obtained by processing the second frozen bit and the second information bit of at least one HARQ process that successfully decodes PUSCH based on the first function. For example, if PUSCH is successfully decoded in the last HARQ process within the frozen bit update period, the frozen bit is updated based on the PUSCH in the last HARQ process. For the specific updating method, refer to the corresponding description in the previous text, otherwise it is not updated. For another example, if PUSCH is successfully decoded in the first HARQ process within the frozen bit update period, the frozen bit is updated based on the PUSCH in the first HARQ process. For the specific updating method, refer to the corresponding description in the previous text, otherwise it is not updated.

[0198] (2) For the decoding end, the decoding end can use a blind detection method to decode the received DCI. Since the decoding end does not know which HARQ process the received DCI belongs to before decoding, the decoding end can use a traversal method to try various possibilities of frozen bits to determine the frozen bits. For example, the decoding end assumes that the received DCI belongs to a certain HARQ process (such as HARQ process #1), and then based on the frozen bit update method of DCI, uses the PUSCH data of the previous transmission in the HARQ process to generate frozen bits, and decodes the DCI based on the frozen bits; and so on, traverse all possible HARQ processes (such as HARQ process #1 to HARQ process #K) until the frozen bits are determined (for example, the CRC check result can be used to determine whether the DCI is successfully decoded, thereby determining whether the assumed frozen bits are correct), thereby completing the decoding of the DCI and the synchronization of frozen bits.

[0199] Optionally, for the case where the transmission block data within the HARQ process is a bit block transmitted on the PDCCH (downlink) or a bit block transmitted on the PUCCH (uplink), similar to PDSCH data or PUSCH data, you can refer to the implementation methods of the above-mentioned cases one and two, which will not be repeated here.

[0200] In this second example, when there are multiple transmission blocks transmitted in multiple HARQ processes, a method similar to updating the Polar code frozen bits in a single process can also be used to achieve secure communication with integrated coding and encryption.

[0201] Fig. 9 A schematic diagram of a communication device provided in the present application. The device may include executing Figures 4 to 8 The module corresponding to the method / operation / step / action described in any of the embodiments shown may be a hardware circuit, software, or a combination of hardware circuit and software.

[0202] The apparatus 900 includes a communication unit 901 and a processing unit 902, which are used to implement the methods executed by the devices in the above embodiments. The communication unit 901 is also called a transceiver unit, which includes a sending unit and a receiving unit. The sending unit is used to send signals, and the receiving unit is used to receive signals.

[0203] In a possible implementation, the device is a device for implementing a coding function, such as a network device or a terminal. Specifically, the processing unit 902 is used to perform Polar coding on the first bit block to be coded to obtain a first coded bit block; the first bit block to be coded includes a first frozen bit, the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key, the second information bit or the second frozen bit is associated with the second coded bit block, and the second coded bit block is a bit block transmitted before the first coded bit block. The communication unit 901 is used to send the first coded bit block.

[0204] The specific execution process of the communication unit 901 and the processing unit 902 in this implementation manner can refer to the description of the steps executed by the first device in the method embodiment above, as well as the related description, which will not be repeated here. In the communication method based on polarization polar code implemented by the device, when the encoding side encodes the current first bit block to be encoded, it determines the frozen bit used for the current encoding and encryption based on the second information bit or the second frozen bit associated with the second encoding bit block transmitted previously, which not only realizes the secure communication of integrated encoding and encryption, but also improves the randomness of the frozen bit, which is not easy to be obtained by the eavesdropping party, is conducive to avoiding the leakage of the frozen bit, and improves the security of the encoding and encryption.

[0205] In a possible implementation, the device is a device for implementing a decoding function, such as a terminal or a network device. Specifically, the communication unit 901 is used to receive a first coded bit block. The processing unit 902 is used to perform Polar decoding on the first coded bit block based on the first frozen bit to obtain a first bit block to be encoded. The first frozen bit is determined based on at least one of the second information bit or the second frozen bit or the preset key, and the second information bit or the second frozen bit is associated with the second coded bit block; the second coded bit block is a bit block transmitted before the first coded bit block.

[0206] The specific execution process of the communication unit 901 and the processing unit 902 in this implementation manner can refer to the description of the steps performed by the second device in the method embodiment above, as well as the related description, which will not be repeated here. In the communication method based on polarization polar code implemented by the device, when the decoding side decodes the currently received coded bit block, it determines the first frozen bit based on the second information bit and the second frozen bit in the previous decoding result, and decodes based on the first frozen bit, thereby realizing secure communication with integrated decoding and decryption.

[0207] In a possible implementation, when the communication device is a chip, the chip includes a transceiver unit and a processing unit. The transceiver unit may be an input / output circuit or a communication interface; the processing unit may be a processor or a microprocessor or an integrated circuit or a logic circuit integrated on the chip.

[0208] This application also provides a communication device, see Fig.10 , another structural diagram of the communication device of the embodiment of the present application. The communication device can be used to execute the steps executed by the first device or the second device in the above method embodiment, and reference can be made to the relevant description in the above method embodiment.

[0209] The communication device includes a processor 1001. Optionally, the communication device also includes a memory 1002 and a transceiver 1003.

[0210] In a possible implementation, the processor 1001, the memory 1002 and the transceiver 1003 are respectively connected via a bus, and the memory stores computer instructions.

[0211] Optionally, the processing unit 902 in the aforementioned embodiment may be the processor 1001 in this embodiment, so the specific implementation of the processor 1001 is not repeated. The communication unit 901 in the aforementioned embodiment may be the transceiver 1003 in this embodiment, so the specific implementation of the transceiver 1003 is not repeated.

[0212] In this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic block diagrams disclosed in this application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in this application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0213] In the present application, the memory may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or a volatile memory (volatile memory), such as a random-access memory (RAM). The memory is any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory in the present application may also be a circuit or any other device that can implement a storage function, for storing program instructions and / or data.

[0214] The present application provides another communication device, which includes a processor and an interface. Optionally, it also includes a memory, the processor is coupled to the memory, and the processor is used to read and execute computer instructions stored in the memory to implement the following Figures 4 to 8 The communication method based on polar codes in the illustrated embodiment.

[0215] The present application also provides a communication system, which includes a first device and a second device. The first device is used to execute all or part of the steps executed by the first device in the above embodiment. The second device is used to execute all or part of the steps executed by the second device in the above embodiment.

[0216] The present application provides a computer-readable storage medium. The computer-readable storage medium stores a program or instruction. When the program or instruction is executed on a computer, the computer executes Figures 4 to 8 The communication method based on polar codes in the illustrated embodiment.

[0217] The present application provides a computer program product. The computer program product includes instructions. When the instructions are executed on a computer, the computer executes the following Figures 4 to 8 The communication method based on polar codes in the illustrated embodiment.

[0218] The present application provides a chip or a chip system, which includes at least one processor and an interface, wherein the interface and the at least one processor are interconnected through a line, and the at least one processor is used to run a computer program or instruction to execute the following steps: Figures 4 to 8 The communication method based on polar codes in the illustrated embodiment.

[0219] The interface in the chip may be an input / output interface, a pin or a circuit, etc.

[0220] The chip system may be a system on chip (SOC) or a baseband chip, etc., wherein the baseband chip may include a processor, a channel encoder, a digital signal processor, a modem, an interface module, etc.

[0221] In one implementation, the chip or chip system described above in the present application further includes at least one memory, in which instructions are stored. The memory may be a storage unit inside the chip, such as a register, a cache, etc., or a storage unit of the chip (e.g., a read-only memory, a random access memory, etc.).

[0222] The technical solution provided in this application can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in this application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a terminal or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a digital video disc (DVD)), or a semiconductor medium, etc.

[0223] In the present application, under the premise of no logical contradiction, the various embodiments may reference each other, for example, the methods and / or terms between method embodiments may reference each other, for example, the functions and / or terms between device embodiments may reference each other, for example, the functions and / or terms between device embodiments and method embodiments may reference each other.

[0224] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A communication method based on polar codes, characterized in that: The method comprises: Performing Polar encoding on a first bit block to be encoded to obtain a first encoded bit block, where the first bit block to be encoded includes a first frozen bit, where the first frozen bit is determined based on at least one of a second information bit, a second frozen bit, or a preset key, where the second information bit or the second frozen bit is associated with a second encoded bit block, and where the second encoded bit block is a bit block transmitted before the first encoded bit block; The first block of coded bits is sent.

2. The method according to claim 1, characterized in that The first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

3. The method according to claim 2, characterized in that If the first to-be-coded bit block includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or, If the first to-be-encoded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or, If the first bit block to be coded includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first bit block to be coded; or, If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or, If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or, If the first block of bits to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first block of bits to be encoded.

4. The method according to claim 2 or 3, characterized in that: If an acknowledgment response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the first frozen bit is obtained by processing the second frozen bit and the second information bit based on a first function.

5. The method according to claim 2 or 3, characterized in that: If a negative response to the physical downlink shared channel is received or the physical uplink shared channel is not decoded successfully, the first frozen bit is obtained by processing at least one of the preset key or the first frozen bit based on a second function.

6. The method according to any one of claims 1 to 5, characterized in that: The first frozen bit is determined based on at least one of the second information bit, the second frozen bit, or a preset key when the frozen bit update period is reached; the second information bit is an information bit in one or more hybrid automatic repeat request HARQ processes within the frozen bit update period; the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

7. The method according to claim 6, characterized in that The frozen bit update period is a maximum time interval among multiple time intervals corresponding to multiple HARQ processes; or, the frozen bit update period is a preset time interval; The time interval is a time interval between a physical downlink shared channel of one HARQ process among the multiple HARQ processes and a confirmation or negative response of the physical downlink shared channel.

8. The method according to claim 6, characterized in that If there are N HARQ processes receiving confirmation responses for the physical downlink shared channel within the frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and the second information bits of the N HARQ processes based on a first function; N is a positive integer; Alternatively, the first frozen bit is obtained by processing the second frozen bits and the second information bits of M HARQ processes based on a first function, the M HARQ processes are any M HARQ processes among the N HARQ processes, and M is a positive integer less than or equal to N.

9. The method according to claim 6, characterized in that If a physical uplink shared channel is successfully decoded in at least one HARQ process within the frozen bit update period, the first frozen bit is obtained by processing the second frozen bit and the second information bit of at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function.

10. The method according to any one of claims 4 to 9, characterized in that: The first function or the second function includes: a combination of one or more of hashing, truncation, concatenation, sampling, and symmetric encryption.

11. A communication method based on polar codes, characterized in that: The method comprises: receiving a first block of coded bits; The first coded bit block is subjected to Polar decoding based on the first frozen bit to obtain a first bit block to be coded; the first frozen bit is determined based on at least one of the second information bit or the second frozen bit or a preset key, and the second information bit or the second frozen bit is associated with the second coded bit block; the second coded bit block is a bit block transmitted before the first coded bit block.

12. The method according to claim 11, characterized in that The first bit block to be encoded includes at least one of downlink control information, uplink control information, a bit block transmitted on a physical downlink shared channel, a bit block transmitted on a physical uplink shared channel, a bit block transmitted on a physical downlink control channel, and a bit block transmitted on a physical uplink control channel.

13. The method according to claim 12, characterized in that If the first to-be-coded bit block includes first downlink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second downlink control information before the first downlink control information; or, If the first to-be-encoded bit block includes first uplink control information, the second information bit is an information bit transmitted on a physical downlink shared channel or a physical uplink shared channel associated with second uplink control information before the first uplink control information; or, If the first bit block to be coded includes information bits transmitted on a first physical downlink shared channel, the second information bits are information bits transmitted on a second physical downlink shared channel before the first bit block to be coded; or, If the first to-be-coded bit block includes information bits transmitted on a first physical uplink shared channel, the second information bits are information bits transmitted on a second physical uplink shared channel before the first to-be-coded bit block; or, If the first bit block to be coded includes information bits transmitted on a first physical downlink control channel, the second information bits are information bits transmitted on a second physical downlink control channel before the first bit block to be coded; or, If the first block of bits to be encoded includes information bits transmitted on a first physical uplink control channel, the second information bits are information bits transmitted on a second physical uplink control channel before the first block of bits to be encoded.

14. The method according to any one of claims 11 to 13, characterized in that The first frozen bit is obtained by processing the second information bit and the second frozen bit based on a first function; or, The first frozen bit is obtained by processing at least one of a preset key or a second frozen bit based on a second function.

15. A communication device, characterized in that: The method comprises a communication unit and a processing unit, wherein the communication unit and the processing unit are used to execute the method according to any one of claims 1 to 10 or 11 to 14.

16. A communication device, characterized in that: include: A processor, configured to enable the communication device to perform the method according to any one of claims 1 to 10 or 11 to 14 through logic circuits and / or execution instructions.

17. The device according to claim 16, characterized in that Also included is a memory for storing the instructions.

18. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores instructions, and when the instructions are executed on a computer, the computer is caused to perform the method according to any one of claims 1 to 10 or 11 to 14.

19. A chip system, characterized in that: The chip system comprises a processor and an interface, wherein the processor is used to execute a computer program so that the chip system implements the method as described in any one of claims 1 to 10 or 11 to 14.

20. A computer program product, characterized in that The method comprises instructions which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 10 or 11 to 14.

21. A communication system, characterized in that: The communication system comprises an apparatus for executing the method according to any one of claims 1 to 10, and an apparatus for executing the method according to any one of claims 11 to 14.

Images