Communication method and communication apparatus based on polar code

Abstract

A communication method and communication apparatus based on a polar code. In the method, when an encoding side encodes a current first bit block to be encoded, a frozen bit, which is used for current encoding and encryption, is determined on the basis of a second information bit or a second frozen bit associated with a second encoded bit block, which is previously transmitted, such that secure communication based on integrated encoding and encryption is realized, and the randomness of the frozen bit is also improved, and thus the frozen bit cannot be easily acquired by an eavesdropper, thereby helping to avoid the leakage of the frozen bit, and improving the security of encoding and encryption.

Description

A communication method and communication device based on polarization code

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on November 2, 2023, with application number 202311454153.9, and the priority of the Chinese patent application entitled “A communication method and communication device based on polar code”, all contents of which are incorporated by reference into this application. Technical Field

[0002] 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

[0003] Existing secure transmission solutions for communication systems rely on key management and high-level encryption algorithms. Key management and maintenance require complex communication protocols and incur additional signaling overhead. Furthermore, protocol vulnerabilities can be exploited maliciously, posing security risks to the communication system. Directly applying high-level encryption algorithms to encrypt physical layer data or signaling can lead to high computational complexity and excessive signal processing latency.

[0004] Integrated coding and encryption technology enhances transmission security by integrating encryption capabilities into channel coding, without compromising error correction performance. For example, integrated coding and encryption can be designed for Polar codes. Decoding and decryption require both communicating parties to agree on the value of frozen bits. If the frozen bits are incorrect, correct decoding and decryption will be impossible. However, if the frozen bits are leaked or obtained through exhaustive search, the security of all information bits will be compromised.

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

[0006] Summary of the Invention

[0007] The present application provides a communication method and communication device based on 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 the leakage of frozen bits and improve the security of physical layer transmission.

[0008] 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 an encoding side (such as a network device or a terminal), or a component of the encoding side, or a logic module that can implement all or part of the encoding function. The first device performs 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, which 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 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.

[0009] In this method, when encoding the current first block of bits to be encoded, the encoding side determines the frozen bits used for the current encoding and encryption based on the second information bit or second frozen bit associated with the second block of encoded bits transmitted previously. This not only achieves secure communication with integrated encoding and encryption, but also improves the randomness of the frozen bits, making them less likely to be obtained by eavesdroppers, thus preventing the leakage of frozen bits and improving the security of encoding and encryption. If the eavesdropper wishes to obtain updated frozen bits, it can only perform an exhaustive search, which is computationally very expensive. Even if the current first frozen bit is obtained by the eavesdropper, the encoding side will continue to update the frozen bits in subsequent transmissions and perform encoding and encryption based on the new frozen bits, making it impossible for the eavesdropper to continue decoding data.

[0010] In one 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.

[0011] In this method, the first bit block to be encoded can be multiple different types of information or bit blocks. That is, the method provided in this application is applicable to multiple coding scenarios and can perform Polar encoding on multiple different types of information or bit blocks.

[0012] In one possible implementation, 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 preceding the first downlink control information; or,

[0013] 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 preceding the first uplink control information; or

[0014] 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

[0015] 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

[0016] If the first to-be-coded bit block 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 to-be-coded bit block; or

[0017] If the first block of bits to be coded 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 coded.

[0018] In this method, when the first bit blocks to be encoded are information or bit blocks of different types, the second information bits are information or bit blocks of corresponding types in the encoding process.

[0019] In a possible implementation, 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.

[0020] In a possible implementation, if an acknowledgment response for the physical downlink shared channel is received or the 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.

[0021] 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 an 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.

[0022] In a possible implementation, if a negative acknowledgement for 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.

[0023] In one 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 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 the second function to obtain the first frozen bit.

[0024] 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 a NACK, then the frozen bits may not be updated, or a preset key (or a bit string obtained after processing the preset key) may be used to update the frozen bits, thereby improving the randomness of the frozen bits.

[0025] In one possible implementation, when a frozen bit update period expires, a first frozen bit is determined based on at least one of a second information bit, a second frozen bit, or a 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; and the second frozen bit is a frozen bit in one or more HARQ processes within the frozen bit update period.

[0026] In one possible implementation, when multiple coded bit blocks are transmitted in multiple hybrid automatic repeat request (HARQ) processes, the first device determines a frozen bit update period. When a frozen bit update period expires, the first device determines a first frozen bit based on at least one of a second information bit, 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.

[0027] 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.

[0028] In one 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 the time interval between a physical downlink shared channel of one HARQ process among the multiple HARQ processes and an acknowledgment or a negative acknowledgement of the physical downlink shared channel.

[0029] 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 computational 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 for enabling multiple HARQ processes to update frozen bits.

[0030] In one possible implementation, if acknowledgments for a physical downlink shared channel are received in N HARQ processes within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and second information bits of the N HARQ processes based on a first function, where N is a positive integer. Alternatively, the first frozen bit is obtained by processing the second frozen bits and second information bits of M HARQ processes based on the first function, where the M HARQ processes are any M HARQ processes from the N HARQ processes, and M is a positive integer less than or equal to N.

[0031] In one possible implementation, if confirmation responses for the 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 the first function to obtain the first frozen bits.

[0032] 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 the N HARQ processes, and M is a positive integer less than or equal to N.

[0033] 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 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 excessively frequent updates of the frozen bit, thereby reducing computing overhead.

[0034] In one 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 the at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function.

[0035] In one 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 the at least one HARQ process that successfully decodes the physical uplink shared channel based on the first function to obtain a first frozen bit.

[0036] 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 conducive to improving the randomness of the frozen bit.

[0037] 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.

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

[0039] In a 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. 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 coded. The first frozen bit is determined based on at least one of the second information bit, 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.

[0040] In this method, when decoding the currently received coded bit block, the decoding side 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.

[0041] In one 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.

[0042] In this method, the first bit block to be encoded can be multiple different types of information or bit blocks. That is, the method provided in this application is applicable to multiple coding scenarios and can perform Polar encoding on multiple different types of information or bit blocks.

[0043] In one possible implementation, 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 preceding the first downlink control information; or,

[0044] 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 preceding the first uplink control information; or

[0045] 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

[0046] 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

[0047] If the first to-be-coded bit block 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 to-be-coded bit block; or

[0048] If the first block of bits to be coded 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 coded.

[0049] In this method, when the first bit blocks to be encoded are information or bit blocks of different types, the second information bits are information or bit blocks of corresponding types in the encoding process.

[0050] In one possible implementation, 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 the second frozen bit based on a second function.

[0051] 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 performing decoding and decryption based on the first frozen bit to obtain the information bit.

[0052] In a third aspect, the present application provides a communication method based on polar codes, which is implemented by 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 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, 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 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.

[0053] In this method, when encoding the current first block of bits to be encoded, the encoding side determines the frozen bits used for the current encoding and encryption based on the second information bit or second frozen bit associated with the previously transmitted second block of encoded bits. This not only achieves secure communication with integrated encoding and encryption, but also improves the randomness of the frozen bits, making them less susceptible to acquisition by eavesdroppers, thereby preventing leakage of the frozen bits and improving the security of the encoding and encryption. When decoding the currently received block of encoded bits, the decoding side determines the first frozen bit based on the second information bit and second frozen bit in the previously decoded result, and performs decoding based on the first frozen bit, achieving secure communication with integrated decoding and decryption.

[0054] 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.

[0055] In a fourth aspect, the present application provides a communication device. The communication device can implement encoding functions, and can be, for example, a network device, a device of a network device, or a device that can be used in conjunction with a network device; or it can be a terminal, a device of a terminal, or a device that can be used in conjunction with a terminal. In one possible implementation, the communication device can include a functional module, which can be implemented as a hardware circuit, software, or a combination of a hardware circuit and software.

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

[0057] In one 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.

[0058] In one possible implementation, 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 preceding the first downlink control information; or,

[0059] 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 preceding the first uplink control information; or

[0060] 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

[0061] 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

[0062] If the first to-be-coded bit block 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 to-be-coded bit block; or

[0063] If the first block of bits to be coded 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 coded.

[0064] In a possible implementation, 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.

[0065] In a possible implementation, if an acknowledgment 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.

[0066] In a possible implementation, if a negative acknowledgement for 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.

[0067] In one possible implementation, if a negative response is received for the physical downlink shared channel or the 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.

[0068] In one possible implementation, when a frozen bit update period expires, a first frozen bit is determined based on at least one of a second information bit, a second frozen bit, or a preset key. 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.

[0069] In one possible implementation, when multiple coded bit blocks are transmitted in multiple hybrid automatic repeat request (HARQ) processes, the processing unit is configured to determine a frozen bit update period. When a frozen bit update period expires, the processing unit is configured to determine a first frozen bit based on at least one of a second information bit, 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.

[0070] In one 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 the time interval between a physical downlink shared channel of one HARQ process among the multiple HARQ processes and an acknowledgment or a negative acknowledgement of the physical downlink shared channel.

[0071] In one possible implementation, if acknowledgments for a physical downlink shared channel are received in N HARQ processes within a frozen bit update period, the first frozen bit is obtained by processing the second frozen bits and second information bits of the N HARQ processes based on a first function, where N is a positive integer. Alternatively, the first frozen bit is obtained by processing the second frozen bits and second information bits of M HARQ processes based on the first function, where the M HARQ processes are any M HARQ processes from the N HARQ processes, and M is a positive integer less than or equal to N.

[0072] In one possible implementation, if confirmation responses for the 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.

[0073] 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 the N HARQ processes, and M is a positive integer less than or equal to N.

[0074] In one 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 the at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function.

[0075] In one 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 configured to process the second frozen bit and the second information bit of the at least one HARQ process that successfully decodes the physical uplink shared channel based on a first function to obtain a first frozen bit.

[0076] 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.

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

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

[0079] In one 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.

[0080] In one possible implementation, 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 preceding the first downlink control information; or,

[0081] 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 preceding the first uplink control information; or

[0082] 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

[0083] 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

[0084] If the first to-be-coded bit block 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 to-be-coded bit block; or

[0085] If the first block of bits to be coded 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 coded.

[0086] In one possible implementation, 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 the second frozen bit based on a second function.

[0087] In a sixth aspect, the present application provides a communication device, comprising: a processor configured to, through logic circuits and / or execution instructions, enable the communication device to implement the method of the first and second aspects, as well as any possible implementation of the first and second aspects. Optionally, the communication device further comprises a memory configured to store the instructions, which, when executed by the processor, enables the communication device to implement the method of the first and second aspects, as well as any possible implementation of the first and second aspects. Optionally, the processor and memory are coupled.

[0088] In the 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 methods in the first and second aspects, as well as any possible implementation of the first and second aspects.

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

[0090] 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 of the first aspect and the second aspect, as well as any possible implementation of the first aspect and the second aspect.

[0091] In a tenth aspect, the present application provides a chip comprising a processor (or a logic circuit). Optionally, the chip may further comprise 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 one possible implementation, if the chip is the smallest processing unit in the entire machine, the chip may be a processor, or may comprise a processor and a memory, or may comprise 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.

[0092] 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 methods of the first and second aspects, as well as any possible implementation of the first and second aspects. The chip system may be composed of a chip alone, or may include a chip and other discrete components. BRIEF DESCRIPTION OF THE DRAWINGS

[0093] FIG1 is a schematic diagram of a communication system provided by the present application;

[0094] FIG2 is a schematic diagram of an integrated coding and encryption technology solution designed to utilize the channel quality advantage of legitimate channels over eavesdropping channels;

[0095] FIG3 is a schematic diagram of an integrated coding and encryption technology based on frozen bits;

[0096] FIG4 is a flow chart of a communication method based on polar codes provided by the present application;

[0097] FIG5 is a flowchart illustrating a specific implementation of the polar code-based communication method provided in the present application;

[0098] FIG6 is a schematic diagram of a frozen bit update based on PDSCH provided by the present application;

[0099] FIG7 is a schematic diagram of a PUSCH-based frozen bit update provided by the present application;

[0100] FIG8 is a schematic diagram of a polar code-based communication method provided by the present application applied to a multi-HARQ process transmission scenario;

[0101] FIG9 is a schematic diagram of a communication device provided by the present application;

[0102] FIG10 is a schematic diagram of another communication device provided in this application. DETAILED DESCRIPTION

[0103] In the embodiments of this application, " / " can indicate that the associated objects are in an "or" relationship. For example, A / B can mean A or B. "And / or" can be used to describe the existence of three relationships between associated objects. For example, "A and / or B" can mean: A exists alone, A and B exists simultaneously, or B exists alone. A and B can be singular or plural. To facilitate the description of the technical solutions of the embodiments of this application, the words "first" and "second" may be used in the embodiments of this application to distinguish between technical features with the same or similar functions. The words "first" and "second" do not limit the number or order of execution, and the words "first" and "second" do not necessarily mean different. In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. The use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner for easier understanding.

[0104] 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.

[0105] In order to improve the security of integrated coding and encryption, the present application provides a communication method and communication device based on polarization polar code. The communication method 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.

[0106] Among them, the communication method based on polar codes provided in this application can be applied to the communication system shown in Figure 1. For example, the communication system includes a network device and a terminal. Figure 1 only describes one network device and one terminal as an example, and this 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.

[0107] Among them, the communication system of the present application may include but is not limited to communication systems of various radio access technologies (RATs), for example, a new radio (NR) system, or 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 physical signals such as preambles, reference signals, etc.; physical layer control information such as downlink control information (DCI), uplink control information (UCI), etc.; control plane (CP) data such as radio resource control (RRC) messages, etc.; user plane (UP) data. Optionally, the above information can also be information related to other specific scenarios or applications, such as related data (such as gradient information, training data, model parameters, etc.) enabled or generated by artificial intelligence (AI) and machine learning (ML), enabling sensing functions or related data generated by sensing, etc.

[0108] A terminal, also known as a terminal device (terminal), user equipment (UE), mobile station (MS), or mobile terminal (MT), is a device that provides voice and / or data connectivity to users. It can also be an IoT device. For example, a terminal includes a handheld device with wireless connectivity, an in-vehicle device, and so on. Currently, some examples of terminals include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), 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) devices, augmented reality (AR) devices, smart point of sale (POS) machines, customer-premises equipment (CPE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity 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 evolved 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 in device-to-device (D2D) communication.

[0109] Among them, the network device of the present application refers to a radio access network (RAN) node (or device) that connects a terminal to a wireless network, which can also be called an access network device, or a RAN node (or device). In one possible scenario, the network device may include: a base station, a transmission reception point (TRP), an evolved Node B (eNB), a transmitting point (TP), a next-generation base station (gNB), a next-generation base station in a sixth-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 device 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. Network devices can also serve as base stations in D2D communication, vehicle-to-everything (V2X) communication, drone communication, and machine-to-machine communication. Alternatively, network devices can be servers, wearable devices, vehicles, or onboard devices. For example, the access network device in vehicle-to-everything (V2X) technology can be a roadside unit (RSU).

[0110] 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). 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.

[0111] 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, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0112] It should be noted that:

[0113] "Sending" and "receiving" in the embodiments of the present application indicate the direction of signal transmission. For example, "sending information to a terminal" can be understood as the destination end of the information being the terminal device, which can include direct sending through the air interface, and also includes indirect sending through the air interface by other units or modules. "Receiving information from a network device" can be understood as the source end of the information being the network device, which can include direct receiving from the network device through the air interface, and also includes indirect 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.

[0114] 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.

[0115] It is understandable that information may be processed 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.

[0116] 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, the information to be indicated can be directly indicated, such as the information to be indicated itself or the index of the information to be indicated. The information to be indicated can also be indirectly indicated by indicating other information, wherein there is an association between the other information and the information to be indicated; it is also possible to indicate only a part of the information to be indicated, while the other parts of the information to be indicated are known or agreed in advance, for example, the indication of specific information can be achieved with the help 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.

[0117] 1. For ease of understanding, the following is a detailed introduction to the definitions of relevant terms involved in this application:

[0118] 1. Integrated coding and encryption technology:

[0119] Existing secure transmission solutions for communication systems rely on key management and high-level encryption algorithms. However, key management and maintenance require the support of complex communication protocols and incur additional signaling overhead. Furthermore, protocol vulnerabilities can be exploited by adversaries, posing security risks to the communication system. Furthermore, directly applying high-level encryption algorithms to encrypt physical layer data or signaling can lead to high computational complexity and excessive signal processing latency.

[0120] By integrating encryption into channel coding, integrated coding and encryption technology enhances transmission security without compromising error correction performance. On the one hand, the integration of encryption and coding reduces overhead and processing latency caused by excessive multi-protocol layer processing. On the other hand, the lack of encryption in underlying control signaling makes it vulnerable to eavesdropping. However, integrated coding and encryption technology provides security for underlying control signaling.

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

[0122] Polar codes have a unique coding structure, making them suitable for combination with encryption. Furthermore, Polar codes are used in control channels, making integrated coding and encryption operations on them practically valuable. Therefore, most current integrated coding and encryption solutions are based on Polar codes. For example, Figure 2 shows a schematic diagram of an integrated coding and encryption solution designed to leverage the channel quality advantages of legitimate channels over eavesdropping channels. Here, the legitimate transmitter Alice performs Polar coding on the information bits to be transmitted and sends them to the legitimate receiver Bob. Based on the principle of channel polarization, the equivalent channel quality experienced by each information bit to be transmitted by the legitimate transmitter will vary. The equivalent channels experienced by each bit can be categorized as "good channels" and "bad channels," as shown in Figure 2. Assuming ideal channel polarization, bits transmitted on a good channel will be error-free, while bits transmitted on a bad channel may be error-prone. If the channel quality from sender Alice to eavesdropper Eve is worse than the channel quality from Alice to receiver Bob (i.e., the legitimate link has a channel quality advantage), the polarized "good channels" in the channel from Alice to Eve will be fewer than the polarized "good channels" in the channel from Alice to Bob, as shown in Figure 2. Consequently, 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 over these equivalent channels, they will only be correctly received by Bob and not by Eve, thus maintaining confidentiality. For equivalent bit channels that are "good channels" for both Bob and Eve, random bits—those that carry no information—are sent. This way, even if these bits are received by Eve, they will not leak useful information. For the "bad channels" polarized in Bob's channel, frozen bits are sent; neither Bob nor Eve can correctly receive these bits.

[0123] However, the above method assumes that the legitimate channel has a higher channel quality than the eavesdropped channel (for example, a higher received signal-to-noise ratio) and that the sender knows the channel state information (CSI) of the eavesdropped channel. These assumptions are difficult to meet in practice. In addition, the above method may cause additional rate loss.

[0124] 3. Integrated coding and encryption technology based on frozen bits:

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

[0126] Based on this, the present application provides a communication method and communication device based on 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 or preset keys of the previous transmission, which is beneficial to avoid the leakage of frozen bits and improve the security of physical layer transmission.

[0127] 2. The communication method based on polar codes provided by this application:

[0128] For example, Figure 4 is a flow chart of a communication method based on polar codes provided by the present application. The method can be implemented by interaction between a first device and a second device, where the first device is a device that implements encoding and encryption functions (e.g., a terminal or network device), and the second device implements decoding and decryption functions (e.g., a network device or terminal).

[0129] S101: A first device performs Polar encoding on a first bit block to be encoded to obtain a first encoded bit block.

[0130] The first bit block to be coded includes a first frozen bit, and the first frozen bit is used for integrated coding and encryption processing of the first bit block to be coded. For example, assuming that the information bits to be coded in the first bit block to be coded are 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 dk =ECC(m k ,f k ), where ECC(x,y) represents the Polar encoding operation.

[0131] Optionally, the first bit block to be coded 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 coded 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 coded is downlink control information, the downlink control information carries information bits m to be coded. 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.

[0132] 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 coded. For example, assuming that the second coded bit block is represented by d k-1 In the second bit block to be coded, the information bits to be coded are represented as mk-1 , the second frozen bit is represented by 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.

[0133] Optionally, if an acknowledgment 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 an acknowledgment 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 is successfully decoded by the receiving end or the PUSCH of the previous transmission is 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 represented by 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 the specific implementation of the first function is described in detail in subsequent embodiments. Optionally, the second information bit is all or part of the information bits in the PDSCH of the previous transmission, or the second information bit is all or part of the information bits 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 bits in the PDSCH associated with the coded bit block of the current transmission are 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 in the next encryption (i.e., updated frozen bits) are expressed as f k+1 =g1(f k ,i k ). It can be seen that this application can use the information bits of the previous transmission to update the frozen bits used in this Polar encoding, realizing secure communication with integrated encoding and encryption.

[0134] Optionally, if a negative acknowledgement is received for the physical downlink shared channel 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 acknowledgement is received for the physical downlink shared channel 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 example, the first frozen bits are represented by f k =g2(key), where g2 represents a second function for generating frozen bits. The specific implementation of the second function will be described in detail in subsequent embodiments. Key represents a preset key.

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

[0136] The first device is an encoder and can send a first coded bit block to a decoder. For example, assuming that the first coded bit block includes DCI, 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.

[0137] Optionally, the first device sends the first coded bit block, which actually undergoes modulation and other processes before being transmitted through a channel. Correspondingly, the second device receives the first coded bit block, which actually receives the first coded bit block after transmission through the channel and demodulation. The resulting coded bit block may not be completely identical to the first coded bit block, but carries the same information bits.

[0138] 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 bits to obtain a first bit block to be coded. Optionally, for the decoding end, if the generation rule of the first frozen bits is unknown to the decoding end, the decoding end may assume that the generation rule of the first frozen bits is f k =g1(f k-1 ,i k-1 ), or f k =f k-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 coded can be finally obtained, that is, the information bits transmitted this time. Optionally, if the generation rule of the first frozen bits is known to the decoding end, the decoding end can obtain the first frozen bits based on the generation rule, and decode based on the first frozen bits to obtain the first bit block to be coded (including the information bits transmitted this time). Optionally, the generation rule of the first frozen bits 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 bits is to update the first frozen bits 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 bits (f k =g1(f k-1 ,i k-1 ) or f k =g2(key)), so the terminal, as the 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 cases: 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, both the terminal and the base station can know whether the terminal correctly decoded the PDSCH. Therefore, the encoding end and the decoding end both determine to generate the first frozen bit in the same manner. Therefore, the terminal, as the decoding end, knows the generation rule of the first frozen bit.

[0139] 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 second frozen bit associated with the second encoded bit block transmitted previously. This not only realizes the secure communication of integrated encoding and encryption, but also improves the randomness of the frozen bit, making it difficult for the eavesdropper to obtain it, which is conducive to avoiding the leakage of the frozen bit and improving the security of encoding and encryption.

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

[0141] Example 1: In a non-multi-HARQ process transmission scenario, a frozen bit update method and an integrated encoding and encryption solution.

[0142] For example, FIG5 is a flowchart of a specific implementation of the polar code-based communication method provided by the present application. The process is implemented by interaction between a first device (encoding end) and a second device (decoding end), and includes the following steps:

[0143] S201: A first device determines a first frozen bit.

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

[0145] For example, the relationship between the second information bit and the first block of bits to be coded may include but is not limited to one or more of the following: if the first block of bits to be coded 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 coded 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 coded 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 coded; if the first block of bits to be coded 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 coded; if the first block of bits to be coded 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 coded; if the first block of bits to be coded 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 coded. 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 applicable to 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 integrated encoding and encryption in different transmission scenarios and improving data security. The following description will be based on an example in which the first bit block to be encoded includes the first DCI, and the second information bit is an 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.

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

[0147] For example, FIG6 is a schematic diagram of a frozen bit update based on PDSCH provided by the present application. In the embodiment of FIG6, the first device is an encoding end (for example, a base station), and the second device is a decoding end (for example, a terminal). k-1 The second DCI in the second block to be coded, PDSCH k-1 For the PDSCH associated with the second DCI (including the second information bit), ACK / NACK on PUCCH indicates the confirmation / negative response carried on the PUCCH (that is, for the PDSCH k-1 ACK / NAK); DCI k The first DCI in the first block to be coded, PDSCH k For 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 equal 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 transmitting the PDSCH.

[0148] 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 as 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 bits sent on the PDSCH associated with the second DCI are represented as i k-1 , then the implementation of S201 may include the following process:

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

[0150] 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(fk-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 beneficial to improve 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 the frozen bit of the previous transmission.

[0151] 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:

[0152] 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 expressed as g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ‖i k-1 )), where trunc means truncation, Hash is a hash function, || 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 there is no restriction on which comes first. For example, the second frozen bit may come first and the second information bit may come second, or the second information bit may come first and the second frozen bit may come second.

[0153] B. The first frozen bit is the output of a hash function whose input parameters 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 ‖i 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).

[0154] 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.

[0155] 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 expressed as g1(f k-1 ,i k-1 )=trunc(Hash(f k-1 ‖i k-1 ‖key)), where key represents the preset key.

[0156] 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 the preset encryption algorithm. The specific encryption algorithm is not limited in this application.

[0157] F. The first frozen bit is obtained by concatenating the second frozen bit and the second information bit and then randomly sampling the result, 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 the preset encryption algorithm. The specific encryption algorithm is not limited in this application.

[0158] 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))), where AES represents the Advanced Encryption Standard (AES) encryption algorithm, or other symmetric encryption algorithms can be selected, which is not limited in this application.

[0159] 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.

[0160] 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, if 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 will not be 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.

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

[0162] A. The first frozen bit is obtained by using 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)).

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

[0164] C. The first frozen bit is the output of a hash function whose input parameters 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 expressed as g2(key)=Hash(key|f k-1 ,length).

[0165] D. The first frozen bit is the output of a hash function whose input parameters include a random sampling result obtained by concatenating 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).

[0166] 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 as m k , the first frozen bit of Polar code is represented as f k The second UCI sent in the k-1th transport block is denoted as d k-1 The information bits sent on the PUSCH associated with the second UCI are represented by 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 by f k =g1(f k-1 ,i k-1 ); If the second UCI-associated indication information 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 f k =g2(key).

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

[0168] For example, FIG7 is a schematic diagram of a frozen bit update based on PUSCH provided by the present application. In the embodiment of FIG7, the first device is an encoding end (for example, a base station), and the second device is a decoding end (for example, a terminal). The DCI in FIG7 k-1 The second DCI in the second block to be coded, PUSCHk-1 PUSCH associated with the second DCI (including the second information bit); DCI k The first DCI in the first block to be coded, PUSCH k For 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.

[0169] 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 as 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 bits sent on the PUSCH associated with the second DCI are represented by i k-1 , then the implementation of S201 may include the following process:

[0170] Option 1: If the 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.

[0171] 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 Indicates part or all of the information bits sent on the PUSCH in the k-1th transport 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 bits (excluding the second frozen bits) based on the first function to obtain the first frozen bits, except that each update of the frozen bits is based on part or all of the information bits sent on the previous PUSCH rather than on the frozen bits of the previous transmission. The specific implementation of the first function is optionally described above and is not repeated here.

[0172] Option 2: If the physical uplink shared channel is not successfully decoded, 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.

[0173] 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, if the PUSCH of the previous transmission was not successfully decoded by the base station, and this transmission may be a retransmission, the frozen bit will not be 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 facilitates 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 is described above and is not repeated here.

[0174] 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 as m k , the first frozen bit of Polar code is represented as f k The second UCI sent in the k-1th transport 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 by f k =g1(f k-1 ,i k-1 ); If the second UCI-associated indication information indicates that the second UCI-associated PDSCH is not successfully decoded by the receiving end, the first frozen bit is represented by f k =f k-1 or f k =g2(key).

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

[0176] 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 ).

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

[0178] 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.

[0179] 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.

[0180] For example, in the PDSCH-based frozen bit update method, 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.

[0181] For another example, in the frozen bit update method based on PUSCH, since the decoding end cannot determine whether the encoding end has successfully decoded the physical uplink shared channel, the generation rule of the first frozen bit is unknown to the decoding end. 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 bits of this transmission.

[0182] 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 the secure communication of integrated encoding and encryption, but also improves the randomness of the frozen bit, making it difficult for the eavesdropper to obtain it, which is conducive to avoiding the leakage of the frozen bit and improving the security of encoding and encryption.

[0183] Example 2: Frozen bit update method and integrated coding and encryption solution for multi-HARQ process transmission scenario.

[0184] For example, FIG8 is a schematic diagram of the application of the polar code based communication method provided by the present application to a multi-HARQ process transmission scenario. Assume that there are K transport blocks (TB), such as TB1 to TB K; Assume that each TB includes DCI and PDSCH (as shown in 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, as shown in Figure 8 . Optionally, the HARQ process corresponding to each transport block is determined by the HARQ process identifier (HARQ process ID) carried by the DCI within the transport block. The frozen bits of the DCI within each HARQ process are only updated using the transport block data of that HARQ process (e.g., PDSCH data in Figure 8 ).

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

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

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

[0188] Another possible implementation assumes that multiple HARQ processes jointly update frozen bits, and then assumes that there is a frozen bit update period. 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 expires. 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. For example, when multiple coded bit blocks are transmitted in multiple hybrid automatic repeat request (HARQ) processes, the first device determines the frozen bit update period. When a frozen bit update period expires, 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.

[0189] 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 one HARQ process among the multiple HARQ processes and an acknowledgment or a negative response of the physical downlink shared channel.

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

[0191] For example, there is a pre-set interval, K1, between ACK / NACK transmissions from the PDSCH to the PUCCH. This interval is defined by the parameter dl-DataToUL-ACK in the PUCCH configuration (PUCCH-config) in RRC signaling. Based on this feature, the maximum K1 across all HARQ processes can be used as the frozen bit update period. It is understood that using the maximum K1 as the frozen bit update period facilitates updating frozen bits in all HARQ processes, improving security.

[0192] 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 transmitted PDSCHs within the frozen bit update period, or based on the successfully transmitted PDSCHs within the HARQ process with the smallest HARQ process number within the frozen bit update period, or based on the successfully transmitted PDSCHs within the HARQ process with the largest HARQ process number within the frozen bit update period, or based on the successfully transmitted PDSCHs within any HARQ process within the frozen bit update period. 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 excessively frequent updates of the frozen bits, thereby reducing computational overhead.

[0193] Optionally, the encoding end updates the frozen bits according to the ACK / NACK status of the PDSCH of each HARQ process within the frozen bit update period. For example, if there are N HARQ processes receiving acknowledgments 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, the first frozen bit f is determined based on the second frozen bit and the second information bit. 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, HARQ process numbers greater than the minimum 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 among 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, then 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 f k =g2(key), the first frozen bits of the M2 HARQ processes can be determined, and the M2 HARQ processes use their respective first frozen bits for Polar coding.

[0194] (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, traverses 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 DCI decoding and frozen bit synchronization.

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

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

[0197] Another possible implementation assumes that multiple HARQ processes jointly update frozen bits, and then assumes that there is a frozen bit update period. When the frozen bit update period expires, the first frozen bit is determined based on at least one of the second information bit, the second frozen bit, or a 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. For example, when multiple coded bit blocks are transmitted in multiple hybrid automatic repeat request (HARQ) processes, the first device determines the frozen bit update period. When a frozen bit update period expires, 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.

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

[0199] 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 bits are updated based on the PUSCH in the last HARQ process. For the specific updating method, refer to the corresponding description above. Otherwise, the frozen bits are not updated. For another example, if PUSCH is successfully decoded in the first HARQ process within the frozen bit update period, the frozen bits are updated based on the PUSCH in the first HARQ process. For the specific updating method, refer to the corresponding description above. Otherwise, the frozen bits are not updated.

[0200] (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, traverses 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.

[0201] 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 case one and case two, which will not be repeated here.

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

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

[0204] 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.

[0205] In one possible implementation, the apparatus is a device for implementing an encoding function, such as a network device or a terminal. Specifically, the processing unit 902 is configured 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 being determined based on at least one of a second information bit, a second frozen bit, or a preset key, the second information bit or the second frozen bit being associated with a second encoded bit block, and the second encoded bit block being a bit block transmitted before the first encoded bit block. The communication unit 901 is configured to send the first encoded bit block.

[0206] The specific execution process of the communication unit 901 and the processing unit 902 in this embodiment can refer to the description of the steps performed 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 polar codes implemented by this device, when the encoding side encodes the current first bit block to be encoded, it determines the frozen bits 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 achieves secure communication with integrated encoding and encryption, but also improves the randomness of the frozen bits, making them less likely to be obtained by eavesdroppers, thereby preventing leakage of frozen bits and improving the security of encoding and encryption.

[0207] In one possible implementation, the apparatus is an apparatus for implementing a decoding function, such as a terminal or a network device. Specifically, the communication unit 901 is configured to receive a first coded bit block. The processing unit 902 is configured to perform Polar decoding on the first coded bit block based on a 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, 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.

[0208] The specific execution process of the communication unit 901 and the processing unit 902 in this embodiment 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 polar code-based communication method implemented by this 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 achieving secure communication with integrated decoding and decryption.

[0209] In one 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, microprocessor, integrated circuit, or logic circuit integrated on the chip.

[0210] The present application also provides a communication device, as shown in Figure 10, which is another structural diagram of the communication device according to an embodiment of the present application. The communication device can be used to execute the steps performed by the first device or the second device in the above method embodiment, and reference can be made to the relevant descriptions in the above method embodiment.

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

[0212] In a possible implementation, the processor 1001, the memory 1002, and the transceiver 1003 are connected via buses, and computer instructions are stored in the memory.

[0213] Optionally, the processing unit 902 in the aforementioned embodiment may specifically be the processor 1001 in this embodiment, and thus the specific implementation of the processor 1001 will not be described in detail. The communication unit 901 in the aforementioned embodiment may specifically be the transceiver 1003 in this embodiment, and thus the specific implementation of the transceiver 1003 will not be described in detail.

[0214] In this application, a 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. The steps of the methods disclosed in this application may be directly executed by a hardware processor, or by a combination of hardware and software modules within the processor.

[0215] 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), or a volatile memory, such as a random-access memory (RAM). The memory is any other medium that can be used to carry or store 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.

[0216] 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 configured to read and execute computer instructions stored in the memory to implement the polar code-based communication method in the embodiments shown in Figures 4 to 8.

[0217] The present application also provides a communication system including a first device and a second device. The first device is configured to execute all or part of the steps executed by the first device in the above embodiment. The second device is configured to execute all or part of the steps executed by the second device in the above embodiment.

[0218] 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 the polar code-based communication method in the embodiments shown in Figures 4 to 8.

[0219] 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 polar code-based communication method in the embodiments shown in Figures 4 to 8.

[0220] The present application provides a chip or chip system, which includes at least one processor and an interface, the interface and the at least one processor are interconnected by a line, and the at least one processor is used to run a computer program or instruction to execute the polarization code-based communication method in the embodiments shown in Figures 4 to 8.

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

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

[0223] In one implementation, the chip or chip system described above in this application further includes at least one memory, in which instructions are stored. The memory may be a storage unit within 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.).

[0224] The technical solutions provided in this application can be implemented in whole or in part through software, hardware, firmware, or any combination thereof. When implemented using software, they 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 processes or functions described in this application are 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. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. 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. 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.

[0225] In this application, under the premise that there is 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.

[0226] Obviously, those skilled in the art may 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 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 claim 2 or 3, characterized in that: The method further comprises: If an acknowledgement response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the second frozen bits and the second information bits are processed based on the first function to obtain the first frozen bits.

7. The method according to claim 2 or 3, characterized in that: The method further comprises: 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 determined to be the same as the second frozen bit; or at least one of the preset key or the second frozen bit is processed based on the second function to obtain the first frozen bit.

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

9. The method according to claim 8, characterized in that The method further comprises: When there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, determining a frozen bit update period; When the time of a frozen bit update cycle is reached, 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 the information bit in one or more HARQ processes within the frozen bit update cycle; the second frozen bit is the frozen bit in one or more HARQ processes within the frozen bit update cycle.

10. The method according to claim 8 or 9, 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 the time interval between the physical downlink shared channel of one HARQ process in the multiple HARQ processes and the physical downlink shared channel of the HARQ process. The time interval between confirmation or negative responses of a shared channel.

11. The method according to claim 8, 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.

12. The method according to claim 8, characterized in that The method further comprises: If confirmation responses for the physical downlink shared channel are received in N HARQ processes within the frozen bit update period, the second frozen bits and second information bits of the N HARQ processes are processed based on the first function to obtain the first frozen bits.

13. The method according to claim 8, characterized in that The method further comprises: The second frozen bits and the second information bits of the M HARQ processes are processed based on the first function to obtain the first frozen bits; wherein 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.

14. The method according to claim 8, 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.

15. The method according to claim 8, characterized in that The method further comprises: If a physical uplink shared channel is successfully decoded in at least one HARQ process within the frozen bit update period, the second frozen bit and the second information bit of the at least one HARQ process that successfully decodes the physical uplink shared channel are processed based on the first function to obtain the first frozen bit.

16. The method according to any one of claims 4 to 15, 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.

17. 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.

18. The method according to claim 17, 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.

19. The method according to claim 18, 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.

20. The method according to any one of claims 17 to 19, 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.

21. A communication device, characterized in that: including a communication unit and a processing unit; The processing unit is configured 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 the second information bit, the second frozen bit, or a preset key, The second information bit or the second frozen bit is associated with a second coded bit block, where the second coded bit block is a bit block transmitted before the first coded bit block; The communication unit is used to send the first coded bit block.

22. The device according to claim 21, 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.

23. The device according to claim 22, 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.

24. The device according to claim 22 or 23, 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.

25. The device according to claim 22 or 23, 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.

26. The device according to claim 22 or 23, characterized in that The processing unit is also used for: If an acknowledgement response for the physical downlink shared channel is received or the physical uplink shared channel is successfully decoded, the second frozen bits and the second information bits are processed based on the first function to obtain the first frozen bits.

27. The device according to claim 22 or 23, characterized in that The processing unit is also used for: 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 determined to be the same as the second frozen bit; or at least one of the preset key or the second frozen bit is processed based on the second function to obtain the first frozen bit.

28. The device according to any one of claims 21 to 27, 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.

29. The device according to claim 28, characterized in that The processing unit is also used for: When there are multiple coded bit blocks transmitted in multiple hybrid automatic repeat request HARQ processes respectively, determining a frozen bit update period; When the time of a frozen bit update cycle is reached, 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 the information bit in one or more HARQ processes within the frozen bit update cycle; the second frozen bit is the frozen bit in one or more HARQ processes within the frozen bit update cycle.

30. The device according to claim 28 or 29, 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.

31. The device according to claim 28, 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 bit and the second information bit of M HARQ processes based on the first function, the M HARQ processes are any M HARQ processes among the N HARQ processes, and M is less than or equal to is a positive integer equal to said N.

32. The device according to claim 28, characterized in that The processing unit is also used for: If confirmation responses for the physical downlink shared channel are received in N HARQ processes within the frozen bit update period, the second frozen bits and second information bits of the N HARQ processes are processed based on the first function to obtain the first frozen bits.

33. The device according to claim 28, characterized in that The processing unit is also used for: The second frozen bits and the second information bits of the M HARQ processes are processed based on the first function to obtain the first frozen bits; wherein 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.

34. The device according to claim 28, 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.

35. The device according to claim 28, characterized in that The processing unit is also used for: If a physical uplink shared channel is successfully decoded in at least one HARQ process within the frozen bit update period, the second frozen bit and the second information bit of the at least one HARQ process that successfully decodes the physical uplink shared channel are processed based on the first function to obtain the first frozen bit.

36. The device according to any one of claims 24 to 35, 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.

37. A communication device, characterized in that: including a communication unit and a processing unit; The communication unit is configured 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 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.

38. The device according to claim 37, 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.

39. The device according to claim 38, 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.

40. The device according to any one of claims 37 to 39, 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.

41. 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 16 or claims 17 to 20 through logic circuits and / or execution instructions.

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

43. 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 16 or claims 17 to 20.

44. 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 claimed in any one of claims 1 to 16 or claims 17 to 20.

45. 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 16 or claims 17 to 20.

46. ​​A communication system, characterized in that: The communication system comprises an apparatus for executing the method according to any one of claims 1 to 16, and an apparatus for executing the method according to any one of claims 17 to 20.

47. A chip, characterized in that: The chip comprises a processor or a logic circuit, and the processor or the logic circuit is used to implement the method according to any one of claims 1 to 16 or claims 17 to 20.

Images