Coding method, decoding method, communication apparatus, and communication system

Abstract

The present application relates to the technical field of communications, and discloses a coding method, a decoding method, a communication apparatus, and a communication system. On one hand, a third codeword is generated on the basis of a first codeword and a second codeword; rate matching is performed on the third codeword such that the third codeword corresponds to a first time-frequency resource; and rate matching is performed on the second codeword such that the second codeword corresponds to a second time-frequency resource, so that a first-type terminal can concatenate information to be decoded received on the first time-frequency resource and information to be decoded received on the second time-frequency resource, decodes the concatenated codewords as a single long code, and simultaneously obtains information bits on the first time-frequency resource and information bits on the second time-frequency resource by means of decoding, thereby obtaining long-code decoding gain, thus helping to ensure the decoding performance of the first-type terminal. On the other hand, a second-type terminal independently decodes the information to be decoded received on the second time-frequency resource to obtain the corresponding information bits, thereby helping to ensure the decoding performance of the second-type terminal.

Description

An encoding method, a decoding method, a communication device, and a communication system.

[0001] Cross-references to related applications

[0002] This application claims priority to Chinese Patent Application No. 202510382210.X, filed on March 27, 2025, with the State Intellectual Property Office of the People's Republic of China, entitled "An Encoding Method, Decoding Method, Communication Device and Communication System", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of communication technology, and in particular to an encoding method, a decoding method, a communication device, and a communication system. Background Technology

[0004] Terminals can be divided into Class I terminals and Class II terminals. Class I terminals are also known as ordinary terminals, high-capability terminals, or normal terminals, while Class II terminals are also known as limited-capability terminals, low-capability terminals, or Class I terminals in energy-saving mode.

[0005] Type I terminals can receive data on pre-configured time-frequency resources (such as physical broadcast channel (PBCH) resources), while Type II terminals, due to limited capabilities, can only receive data within a portion of the frequency domain of those time-frequency resources. For example, Type I terminals can receive data on a first bandwidth, while Type II terminals can receive data on a second bandwidth, where the second bandwidth is a proper subset of the first bandwidth.

[0006] Because of the existence of the two types of terminals mentioned above, how to encode and map data when communication devices (such as network devices or terminals) broadcast or multicast data in order to ensure the decoding performance of the first type of terminal and the second type of terminal remains to be solved. Summary of the Invention

[0007] This application provides an encoding method, a decoding method, a communication device, and a communication system to ensure the decoding performance of different types of terminals.

[0008] In a first aspect, embodiments of this application provide an encoding method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal, etc.), a component in the communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the functions of the communication device. The method includes: acquiring an information bit sequence, the information bit sequence including a first bit sequence and a second bit sequence; performing a first polarization encoding on the first bit sequence to obtain a first codeword of length N1, where N1 is the length of the parent code sequence of the first polarization encoding; performing a second polarization encoding on the second bit sequence to obtain a second codeword of length N2, where N2 is the length of the parent code sequence of the second polarization encoding; obtaining a third codeword of length N3 based on the first codeword and the second codeword, where N3 is equal to either N1 or N2; performing rate matching with the third codeword according to a first rate matching method to obtain a fourth codeword; performing rate matching with the second codeword according to a second rate matching method to obtain a fifth codeword; and transmitting a sixth codeword through a first time-frequency resource and a second time-frequency resource, the sixth codeword including the fourth codeword and the fifth codeword, where the fourth codeword corresponds to the first time-frequency resource and the fifth codeword corresponds to the second time-frequency resource; wherein the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

[0009] Based on the above scheme, on the one hand, a third codeword is generated based on the first and second codewords, and rate-matched to correspond to the first time-frequency resource. Similarly, the second codeword is rate-matched to correspond to the second time-frequency resource. Thus, the first type of terminal can concatenate the information to be decoded received on the first and second time-frequency resources, and decode the concatenated codeword as a long code. This allows simultaneous decoding of information bits on both time-frequency and second resources, thereby capturing the gain from long code decoding and ensuring the decoding performance of the first type of terminal. On the other hand, the second type of terminal can independently decode the information to be decoded received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure its decoding performance. Therefore, this scheme guarantees the decoding performance of both the first and second type of terminals.

[0010] Secondly, embodiments of this application provide a decoding method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a first type of terminal, a component within that first type of terminal (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the first type of terminal. The method includes: acquiring information to be decoded; wherein the information to be decoded includes first information and second information, the first information corresponding to a fourth codeword, the fourth codeword being obtained by rate matching based on a first rate matching method and a third codeword of length N3, the second information corresponding to a fifth codeword, the fifth codeword being obtained by rate matching based on a second rate matching method and a second codeword of length N2, the third codeword being obtained based on a first codeword of length N1 and the second codeword, the first codeword being obtained by performing a first polarization encoding on a first bit sequence in an information bit sequence, the second codeword being obtained by performing a second polarization encoding on a second bit sequence in the information bit sequence, N1 being the length of the parent code sequence of the first polarization encoding, and N2 being the length of the parent code sequence of the first polarization encoding. The length of the mother code sequence of the second polarization encoding is given, wherein N3 is equal to N1 or N2; the fourth codeword corresponds to the first time-frequency resource, and the fifth codeword corresponds to the second time-frequency resource; wherein the first time-frequency resource and the second time-frequency resource correspond to the first type of terminal, and the second time-frequency resource corresponds to the second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal; the third codeword is obtained by de-rate matching according to the first rate matching method and the first information; the second codeword is obtained by de-rate matching according to the second rate matching method and the second information; the first codeword is determined according to the third codeword and the second codeword; the information bit sequence is obtained by polarization decoding of the first codeword and the second codeword.

[0011] Based on the above scheme, the first type of terminal can concatenate the information to be decoded received on the first time-frequency resource and the information to be decoded received on the second time-frequency resource, and decode the concatenated codeword as a long code. It can simultaneously decode the information bits on the first time-frequency resource and the information bits on the second time-frequency resource, thus obtaining the gain brought by long code decoding, which helps to ensure the decoding performance of the first type of terminal.

[0012] Based on the first or second aspect mentioned above, there are one or more possible implementation methods as follows:

[0013] In one possible implementation, the length of the second bit sequence is greater than or equal to the length of the first bit sequence.

[0014] Based on the above scheme, it is helpful to improve the performance gain of long codes.

[0015] In one possible implementation, when N1 equals N2, the third codeword is obtained by XORing the first codeword and the second codeword; or, when N1 is less than N2, the third codeword is obtained by XORing a seventh codeword of length N2 with the second codeword, the seventh codeword being determined based on the first codeword; wherein, N3 equals N2; or, when N1 is greater than N2, the third codeword is obtained by XORing an eighth codeword of length N1 with the first codeword, the eighth codeword being determined based on the second codeword; wherein, N3 equals N1.

[0016] Based on the above scheme, a suitable third codeword can be determined, which helps to improve decoding performance.

[0017] In one possible implementation, the first rate matching method is repetition or punching, and the second rate matching method is repetition or punching.

[0018] Based on the above scheme, using an appropriate rate matching method can help improve decoding performance.

[0019] In one possible implementation, N1 equals 512, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource and the second time-frequency resource is 432, the first rate matching method is puncturing, and the second rate matching method is puncturing.

[0020] Based on the above scheme, it can be compatible with the PBCH time-frequency structure specified in existing protocols.

[0021] In one possible implementation, N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource and the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing.

[0022] Based on the above scheme, the PBCH time-frequency structure can be flexibly configured, which helps to improve transmission efficiency.

[0023] N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing.

[0024] Based on the above scheme, the PBCH time-frequency structure can be flexibly configured, which helps to improve transmission efficiency.

[0025] N1 equals 512, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing.

[0026] Based on the above scheme, the PBCH time-frequency structure can be flexibly configured, which helps to improve transmission efficiency.

[0027] Thirdly, embodiments of this application provide an encoding method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., a network device, a terminal, etc.), a component within that communication device (e.g., a processor, a chip, or a chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The method includes: polar encoding an information bit sequence to obtain a first codeword of length N, where N is the length of the parent code sequence of the polar encoding; performing rate matching with the first codeword according to a first rate matching method to obtain a second codeword; performing rate matching with the first codeword according to a second rate matching method to obtain a third codeword; and transmitting a fourth codeword through a first time-frequency resource and a second time-frequency resource, wherein the fourth codeword includes the second codeword and the third codeword, the second codeword corresponding to the first time-frequency resource, and the third codeword corresponding to the second time-frequency resource; wherein the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

[0028] Based on the above scheme, on the one hand, the second codeword is rate-matched to correspond to the first time-frequency resource, and the third codeword is rate-matched to correspond to the second time-frequency resource. This allows the first type of terminal to soft-combine the information to be decoded received on the first and second time-frequency resources before decoding, simultaneously obtaining the information bits on both resources. This leverages the decoding gain from the soft-combining, helping to ensure the decoding performance of the first type of terminal. Furthermore, the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword), meaning they contain some overlapping information, which helps improve decoding accuracy. On the other hand, the second type of terminal can independently decode the information to be decoded received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure its decoding performance. Therefore, this scheme guarantees the decoding performance of both the first and second type of terminals.

[0029] Fourthly, embodiments of this application provide a decoding method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a first type of terminal, a component in the first type of terminal (e.g., a processor, chip, or chip system), or a logic module or software that can implement all or part of the functions of the first type of terminal. The method includes: acquiring information to be decoded, the information to be decoded including first information and second information, the first information corresponding to a second codeword, the second information corresponding to a third codeword, the second codeword being obtained by rate matching according to a first rate matching method and a first codeword of length N, the third codeword being obtained by rate matching according to a second rate matching method and the first codeword, the first codeword being obtained by polar coding of an information bit sequence, and N being the length of the polar-coded parent code sequence; the second codeword corresponding to a first time-frequency resource, and the third codeword corresponding to a second time-frequency resource; wherein the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal; performing rate matching de-matching on the first information according to the first rate matching method to obtain a seventh codeword of length N; performing rate matching de-matching on the second information according to the second rate matching method to obtain an eighth codeword of length N; performing soft merging on the seventh codeword and the eighth codeword to obtain the first codeword; and performing polar decoding on the first codeword to obtain the information bit sequence.

[0030] Based on the above scheme, the second codeword is rate-matched to correspond to the first time-frequency resource, and the third codeword is rate-matched to correspond to the second time-frequency resource. Thus, the first type of terminal can soft-combine the information to be decoded received on the first and second time-frequency resources before decoding. This allows for simultaneous decoding of the information bits on both time-frequency and second resources, thereby capturing the decoding gain from the soft-combining and improving the decoding performance of the first type of terminal. Furthermore, since the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword), the two information receiveable on the first and second time-frequency resources contain some overlapping information, which helps improve decoding accuracy.

[0031] Based on the third or fourth aspect mentioned above, there are one or more possible implementation methods as follows:

[0032] In one possible implementation, the first rate matching method is repetition, the second codeword is composed of the first codeword and the fifth codeword, and the fifth codeword is a proper subset of the first codeword; the second rate matching method is puncturing, and the third codeword is a proper subset of the first codeword.

[0033] Based on the above scheme, suitable second and third codewords can be determined, and appropriate rate matching methods can be used, which helps to improve decoding performance. Furthermore, since the second codeword contains more bit information than the third codeword, the decoding performance of the first type of terminal is better and the complexity is lower.

[0034] In one possible implementation, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the third codeword is bits 81 to 512 of the first codeword, and the fifth codeword is bits 1 to 28 of the first codeword.

[0035] Based on the above scheme, the PBCH time-frequency structure can be flexibly configured, which helps to improve transmission efficiency.

[0036] In one possible implementation, the first rate matching method is repetition, the second codeword is composed of the third codeword and the sixth codeword, the third codeword is a proper subset of the first codeword, and the sixth codeword is a proper subset of the third codeword; the second rate matching method is punching.

[0037] Based on the above scheme, suitable second and third codewords can be determined, and appropriate rate matching methods can be used, which helps to improve decoding performance.

[0038] In one possible implementation, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the length of the first codeword is 512, the third codeword is bits 81 to 512 of the first codeword, and the sixth codeword is bits 81 to 188 of the first codeword.

[0039] Based on the above scheme, the PBCH time-frequency structure can be flexibly configured, which helps to improve transmission efficiency.

[0040] Fifthly, this application provides a communication device that has the functions involved in implementing the first aspect or any implementation method of the first aspect. For example, the communication device includes modules, units, or means corresponding to the operations involved in performing the first aspect or any implementation method of the first aspect. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0041] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the first aspect or any implementation method of the first aspect described above.

[0042] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store necessary computer programs or instructions for implementing the functions involved in the first aspect or any implementation of the first aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the first aspect or any implementation of the first aspect described above.

[0043] In one possible design, the communication device includes a processor and a memory, the memory of which can store necessary computer programs or instructions for implementing the functions involved in the first aspect or any implementation method of the first aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the first aspect or any implementation method of the first aspect described above.

[0044] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the first aspect or any implementation thereof described above. Optionally, the communication device further includes a memory for storing computer programs or instructions that, when executed by the processor, implement the first aspect or any implementation thereof described above.

[0045] Understandably, the processor in the fifth aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0046] Sixthly, this application provides a communication device that has the functions involved in implementing the second aspect or any implementation method of the second aspect. For example, the communication device includes modules, units, or means corresponding to performing the operations involved in the second aspect or any implementation method of the second aspect. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0047] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the second aspect or any implementation method of the second aspect described above.

[0048] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store necessary computer programs or instructions for implementing the functions involved in the second aspect or any implementation of the second aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the second aspect or any implementation of the second aspect described above.

[0049] In one possible design, the communication device includes a processor and a memory, the memory of which can store necessary computer programs or instructions for implementing the functions involved in the second aspect or any implementation method of the second aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the second aspect or any implementation method of the second aspect described above.

[0050] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the second aspect or any implementation thereof described above. Optionally, the communication device further includes a memory for storing computer programs or instructions that, when executed by the processor, implement the second aspect or any implementation thereof described above.

[0051] Understandably, the processor in the sixth aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0052] Seventhly, this application provides a communication device that has the functions involved in implementing the third aspect or any implementation method of the third aspect. For example, the communication device includes modules, units, or means corresponding to performing the operations involved in the third aspect or any implementation method of the third aspect. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0053] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the third aspect or any implementation method of the third aspect described above.

[0054] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store necessary computer programs or instructions for implementing the functions involved in the third aspect or any implementation of the third aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the third aspect or any implementation of the third aspect described above.

[0055] In one possible design, the communication device includes a processor and a memory, the memory of which can store necessary computer programs or instructions for implementing the functions involved in the third aspect or any implementation method of the third aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the third aspect or any implementation method of the third aspect described above.

[0056] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the third aspect or any implementation thereof described above. Optionally, the communication device further includes a memory for storing computer programs or instructions that, when executed by the processor, implement the third aspect or any implementation thereof.

[0057] Understandably, the processor in the seventh aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor, or the memory and processor can be separate. In specific implementations, the memory can be integrated with the processor on the same chip, or they can be set on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0058] Eighthly, this application provides a communication device that has the functions involved in implementing the fourth aspect or any implementation method of the fourth aspect. For example, the communication device includes modules, units, or means corresponding to performing the operations involved in the fourth aspect or any implementation method of the fourth aspect. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0059] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the fourth aspect or any implementation method of the fourth aspect described above.

[0060] In one possible design, the communication device includes a processor that may be coupled to a memory. The memory may store necessary computer programs or instructions for implementing the functions involved in the fourth aspect or any implementation of the fourth aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the fourth aspect or any implementation of the fourth aspect described above.

[0061] In one possible design, the communication device includes a processor and a memory, the memory of which can store necessary computer programs or instructions for implementing the functions involved in the fourth aspect or any implementation method of the fourth aspect described above. The processor can execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the fourth aspect or any implementation method of the fourth aspect described above.

[0062] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the fourth aspect or any implementation thereof described above. Optionally, the communication device further includes a memory for storing computer programs or instructions that, when executed by the processor, implement the fourth aspect or any implementation thereof described above.

[0063] Understandably, the processor in the eighth aspect can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor, or the memory and processor can be separate. In specific implementations, the memory can be integrated with the processor on the same chip, or it can be set on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0064] Ninthly, this application provides a communication system, which may include a first communication device and a second communication device; wherein the first communication device is used to perform the method described in the first aspect or any possible implementation of the first aspect, and the second communication device is used to perform the method described in the second aspect or any possible implementation of the second aspect.

[0065] In a tenth aspect, this application provides a communication system, which may include a first communication device and a second communication device; wherein the first communication device is used to perform the method described in the third aspect or any possible implementation of the third aspect, and the second communication device is used to perform the method described in the fourth aspect or any possible implementation of the fourth aspect.

[0066] In one aspect, this application provides a computer-readable storage medium storing a computer program (or computer-readable instructions) in which, when a computer reads and executes some or all of the computer-readable instructions, the first to fourth aspects, or any possible implementation of the first to fourth aspects, are executed.

[0067] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM) or other optical disk storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.

[0068] In a twelfth aspect, this application provides a computer program product that, when read and executed by a computer, causes the first to fourth aspects, or any possible implementation of the first to fourth aspects, to be executed.

[0069] In a thirteenth aspect, this application provides a chip (or chip system) including a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, such that the first to fourth aspects, or any possible implementation of the first to fourth aspects, are executed. Attached Figure Description

[0070] Figure 1 is a schematic diagram of the architecture of the communication system applicable to the embodiments of this application;

[0071] Figure 2 is a schematic diagram of a processing flow of information source and information sink according to an embodiment of this application;

[0072] Figure 3(a) shows an 8×8 polarization transformation matrix provided in an embodiment of this application;

[0073] Figure 3(b) is a schematic diagram of the serial cancellation decoding calculation process provided in the embodiment of this application;

[0074] Figure 3(c) is a schematic diagram of the decoding path in the serial cancellation list decoding method provided in the embodiments of this application;

[0075] Figure 4 is a schematic diagram of the time-frequency structure of PBCH;

[0076] Figure 5 is a schematic diagram of a PRB carrying a PBCH;

[0077] Figure 6 is a schematic diagram of drilling holes in PRB;

[0078] Figure 7 is a schematic diagram of PBCH resource classification;

[0079] Figure 8 is an example diagram of encoding method 1;

[0080] Figure 9 is an example diagram of encoding method 2;

[0081] Figure 10 is a flowchart illustrating the encoding method provided in an embodiment of this application;

[0082] Figure 11 shows the time-frequency structure of PBCH and another schematic diagram for classifying PBCH resources;

[0083] Figure 12 is a schematic diagram of the encoding process and resource mapping at the sending end;

[0084] Figure 13 is a flowchart illustrating the decoding method provided in an embodiment of this application;

[0085] Figure 14 is a schematic diagram of the decoding process at the receiving end;

[0086] Figure 15 is a flowchart illustrating the encoding method provided in an embodiment of this application;

[0087] Figure 16 is a schematic diagram of resource mapping;

[0088] Figure 17 is another schematic diagram of resource mapping;

[0089] Figure 18 is a flowchart illustrating the decoding method provided in an embodiment of this application;

[0090] Figure 19 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

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

[0092] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0093] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, wireless fidelity, Wi-Fi, Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, 5th generation (5G) mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, without limitation. This application describes the communication system shown in Figure 1 as an example. When applying the technical solution of this application to other communication systems, the devices, components, modules, etc. in the embodiment can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0094] Figure 1 is a schematic diagram of the architecture of the communication system applied in the embodiments of this application. As shown in Figure 1, the communication system includes an access network 100. Optionally, the communication system may also include a core network 200 and an Internet 300. The access network 100 may include at least one network device, such as 110a and 110b in Figure 1, and may also include at least one terminal, such as 120a-120j in Figure 1. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop computer, 120h is a printer, and 120i is a drone. The same terminal or network device can provide different functions in different application scenarios. For example, the mobile phones in Figure 1 are 120a, 120e, 120f and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can access micro-station 110b, connect to laptop 120g and printer 120h. Mobile phone 120j can control drone 120i.

[0095] The communication system provided in this application may also include AI network elements for implementing some or all AI-related operations. AI network elements can also be referred to as AI nodes, AI devices, AI entities, AI modules, AI models, or AI units, etc. The AI ​​network elements may be built into the network elements of the communication system. For example, an AI network element may be an AI module built into: access network equipment, core network equipment, cloud server, or operation, administration, and maintenance (OAM) to implement AI-related functions. The OAM may act as the network management system for core network equipment and / or access network equipment. Alternatively, the AI ​​network element may also be an independently configured network element in the communication system. Optionally, the terminal or its built-in chip may also include AI entities for implementing AI-related functions.

[0096] (1) Network equipment

[0097] A network device is a network-side device with wireless transceiver capabilities. A network device can be a device in a radio access network (RAN) that provides wireless communication functionality to terminals; this is called RAN equipment. The RAN can be an access network within the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these.

[0098] RAN equipment can also be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc.

[0099] RAN equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a CU control plane (CP) (i.e., CU-CP) and a CU user plane (UP) (i.e., CU-UP). The DU performs the functions of the radio link control (RLC) layer and medium access control (MAC) layer of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. The CU and DU can be set up separately, or they can be included in the same network element, such as in the baseband unit (BBU). The RU can be included in radio frequency equipment or radio frequency units, such as in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. RAN equipment can be a macro base station (as shown in Figure 1, 110a), a micro base station or an indoor station (as shown in Figure 1, 110b), or a relay node or donor node, etc. The embodiments of this application do not limit the specific technology or equipment form used in the network equipment.

[0100] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0101] (2) Terminal

[0102] A terminal is a user-side device with wireless transceiver capabilities. Terminals can also be called terminal equipment, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as D2D communication, V2X communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle device (such as vehicle assembly, vehicle module, vehicle chip, on-board unit (OBU) or telematics box (T-BOX)), drone, helicopter, airplane, ship, robot, robotic arm, smart home device, satellite terminal, Internet of Things terminal, virtual reality (VR) device, augmented reality (AR) device, smart point of sale (POS) machine, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), etc. In the embodiments of this application, the device used to implement the terminal's functions can be the terminal itself, or a device capable of supporting the terminal in implementing those functions, such as a chip system or a combination of devices or components capable of implementing terminal functions. This device can be installed in the terminal. The embodiments of this application do not limit the specific technology or device form used in the terminal.

[0103] In this embodiment of the application, the functions of the terminal can also be performed by modules (such as chips or modems) in the terminal, or by devices that include terminal functions.

[0104] Network devices and terminals can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed in the air on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminals.

[0105] The roles of network devices and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile network device. For terminals 120j that access the wireless access network 100 via 120i, terminal 120i is a network device; however, for network device 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol. In this case, relative to 110a, 120i is also a network device. Therefore, both network devices and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be called communication devices with network device functions, and 120a-120j in Figure 1 can be called communication devices with terminal functions.

[0106] Network devices and terminals can communicate with each other, between network devices, or between terminals through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.

[0107] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0108] The following is an explanation of the relevant terms used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.

[0109] (1) Channel coding and channel decoding

[0110] Figure 2 illustrates a processing flow diagram for the source and sink. As shown in Figure 2, the transmitting end (i.e., the source) obtains the bit sequence to be encoded (i.e., the information bit sequence) through source encoding, and then performs channel encoding on the bit sequence to be encoded to obtain the encoded bit sequence. Correspondingly, after the receiving end (i.e., the sink) obtains the symbol sequence to be decoded, it performs channel decoding on the symbol sequence to be decoded to obtain the information bit sequence, and then performs source recovery on the information bit sequence to obtain useful information.

[0111] Since source coding does not consider interference resistance, if the bit sequence output from source coding is directly transmitted through the channel, noise interference in the channel will cause bit errors, reducing communication reliability. Therefore, channel coding, which encodes the bit sequence output from source coding again, can improve communication reliability. Channel decoding is the inverse process of channel coding.

[0112] There are various channel coding methods, such as polar coding or LDPC coding. Polar codes were selected as the control channel coding method in the 5G standard. Polar codes are a coding scheme that can be rigorously proven to "achieve" the Shannon channel capacity, and have the advantages of good decoding performance and low complexity. LDPC codes were selected as the data channel coding method in the 5G standard. LDPC codes are linear block codes with a sparse parity-check matrix, which not only have good performance approaching the Shannon limit, but also have low decoding complexity and flexible structure.

[0113] (2) Modulation and demodulation

[0114] As shown in Figure 2, the transmitting end can also map the encoded bit sequence to the modulation symbol sequence, and then transmit the modulation symbol sequence; correspondingly, the receiving end can receive the modulation symbol sequence and obtain the symbol sequence to be decoded by demodulation.

[0115] Modulation refers to the process by which the transmitting end maps the encoded bit sequence to a constellation based on a constellation diagram to obtain a modulated symbol sequence. Demodulation is the reverse process of modulation. Common modulation methods include quadrature amplitude modulation (QAM) and amplitude shift keying (ASK) modulation.

[0116] (3) Information bit sequence

[0117] An information bit sequence refers to a sequence of bits to be transmitted. For example, if the bits to be transmitted are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the resulting information bit sequence is 10101100101. In this application, K represents the length of the information bit sequence. The information bits may include payload bits. Optionally, the information bits may also include check bits, such as a cyclic redundancy check (CRC) code.

[0118] (4) Code length

[0119] Code length refers to the length of the bit sequence to be transmitted obtained by encoding the information bit sequence. The code length is greater than or equal to the length of the information bit sequence. In this application, E represents the code length.

[0120] (5) Bitrate

[0121] The code rate is the ratio of the length of the information bit sequence to the code length. In this application, R represents the code rate, therefore R = K / E.

[0122] The length, code length, and code rate of the information bit sequence can be pre-configured by higher-layer signaling, MAC layer signaling, or downlink physical layer signals, and can also be obtained or calculated by the transmitting and receiving devices. For example, the transmitting and receiving devices can determine the code length based on the coding method, the frame structure used to transmit the information bits, the number of layers, and the modulation scheme. For example, the transmitting and receiving devices can obtain the code rate based on higher-layer signaling, MAC layer signaling, or downlink physical layer signals, or determine the code rate based on the modulation and coding scheme (MCS).

[0123] (6) Rate matching

[0124] Rate matching refers to removing some bits from the encoded bit sequence without transmitting them, or repeating some bits.

[0125] The rate matching method will be further explained in three categories below.

[0126] Punching: Punching refers to directly creating holes in certain bit positions within the encoded bit sequence without transmitting them, thus generating bit sequences of arbitrary length. On the decoding side, since there is no information at the corresponding punctured positions, the log-likelihood ratio (LLR) of the corresponding bit is set to 0.

[0127] Shortening: Shortening involves fixing certain bit positions in the encoded bit sequence so that they do not need to be transmitted. On the decoding side, since the corresponding "shortened" positions are known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity.

[0128] Repetition: "Repetition" refers to obtaining a longer bit sequence by repeatedly sending a portion of the encoded bit sequence.

[0129] Taking polar codes as an example, the encoding length (i.e., the mother code length) of a polar code is an integer power of 2. In practical applications, the required length may be a non-encoded length. In this case, it is necessary to remove some bits from the encoded bit sequence without transmitting them, or to repeatedly transmit some bits.

[0130] It should be noted that rate matching of the encoded bit sequence may also include interleaving operations (such as sub-block interleaving or triangular interleaving). Interleaving can occur before or after rate matching, and it is considered part of the rate matching process. For example, the encoded bit sequence can be interleaved first to obtain an interleaved bit sequence, and then rate matching can be performed on the interleaved bit sequence using puncturing, shortening, or repetition. Another example is that the encoded bit sequence can be rate matched first using puncturing, shortening, or repetition to obtain a rate-matched bit sequence, and then interleaved. Yet another example is that interleaving operations may occur both before and after rate matching using puncturing, shortening, or repetition.

[0131] (7) Polar codes

[0132] (7.1) Polar coding

[0133] Polar codes employ encoding strategies that utilize noiseless channels to transmit useful user information, or utilize noisy channels to transmit agreed-upon information or no information at all. The generator matrix of a polar code is G. N Its encoding process is as follows It is a binary row vector with length N; and Defined as the Kronecker product of log2 N matrices F2, x1 N It is the encoded bit sequence (also called a codeword). With the generating matrix G N Multiplying the bits yields the encoded bit sequence; the multiplication process is the encoding process. G N Also known as an Arikan polarization nucleus or a canonical polarization nucleus of length N.

[0134] During the encoding process of polar codes, A portion of the bits are used to carry information, called the information bit set, and the set of indices of these bits is denoted as A; the other portion of the bits are set to fixed values ​​agreed upon in advance by the receiver and the transmitter, called the fixed bit set or frozen bit set, and the set of its bit indices is denoted by the complement of A, denoted as A'. c These freeze bits are typically set to 0, but they can be set arbitrarily as long as the receiver and sender agree in advance.

[0135] Currently, in NR, the frozen bits and information bits of the polar code are determined based on the reliability sequence corresponding to the mother code length. The reliability sequence corresponding to the mother code length can be calculated offline to reduce the encoding complexity. The mother code length is an integer power of 2, which is the length of the bit sequence after polar code encoding; the mother code length can also be called the encoding length. Taking a mother code length of 8 as an example, assuming the reliability sequence is [0 1 2 4 3 5 6 7], the reliability of the bits from highest to lowest is: the bit corresponding to bit number 7, the bit corresponding to bit number 6, the bit corresponding to bit number 5, the bit corresponding to bit number 3, the bit corresponding to bit number 4, the bit corresponding to bit number 2, the bit corresponding to bit number 1, and the bit corresponding to bit number 0. Here, a bit can be understood as a bit sub-channel. The bit number can be understood as the index or identifier of the bit. For example, when constructing a polar code with a master code length of 8 and an information length of 4, the bits corresponding to bit number 7, bit number 6, bit number 5, and bit number 3 are selected from the end to the beginning as information bits, while the bits corresponding to bit number 4, bit number 2, bit number 1, and bit number 0 are selected as frozen bits.

[0136] Figure 3(a) shows an 8×8 polarization transformation matrix, where the left side can be understood as the side to be encoded, and the bits on the left are represented by u. The right side can be understood as the encoding side (or codeword side), and the bits on the right are represented by x. The process from left to right is the process of the transmitter encoding the bit sequence to be encoded. The information bits to be encoded are represented by the sequence u(0, 0, 0, 0, 0, 0, 1, 1). After the polarization transformation matrix, the encoded bits are represented by the sequence x(0, ​​1, 0, 1, 0, 1, 0, 1). Then, x is mapped to a modulation symbol for transmission in channel W. The bits corresponding to high channel reliability are used to map information bits, and the bits corresponding to low channel reliability are used to map frozen bits. As shown in Figure 3(a), {u0, u1, u2, u4} are frozen bits, i.e., the positions of frozen bits, and {u3, u5, u6, u7} are information bits, i.e., the positions of information bits. In this embodiment, information bits are also called information bits, and frozen bits are also called frozen bits.

[0137] Referring to Figure 3(a), in the encoding process, two adjacent columns constitute a coding layer. The left column of bits represents the input bits of the coding layer, and the right column represents the output bits. For example, in the leftmost coding layer, the input bit sequence is (0, 0, 0, 0, 0, 0, 1, 1), and the output bit sequence is (0, 0, 0, 0, 0, 0, 0, 1). The operation symbols in the middle of the coding layer... This represents the XOR operation, specifically... express The bits in the current row and A single XOR operation between the bits in the row. The bits on the right represent the result of the operation. For example, in the leftmost coding layer, the first input bit (value 0) and the second input bit (value 0) are processed... The operation yields the first output bit (with a value of 0).

[0138] (7.2) Polarization Decoding

[0139] There are several methods for decoding polar codes, such as successive cancellation (SC) decoding and successive cancellation list (SCL) decoding.

[0140] The SC decoding method refers to calculating the LLR of each decoded bit sequentially based on the LLR sequence corresponding to the bit sequence to be decoded, and making a bit-by-bit decision. When the decoded bit is an information bit, if the LLR of the decoded bit is greater than 0, then the decoded bit is 0; if the LLR of the decoded bit is less than 0, then the decoded bit is 1. When the decoded bit is a fixed bit, the decoding result is set to 0 regardless of the LLR value. Figure 3(b) is a schematic diagram of the SC decoding calculation process. Taking 4 decoded bits as an example, there are 8 calculation nodes in Figure 3(b), including 4 f nodes and 4 g nodes. The f nodes and g nodes correspond to the f operation and the g operation, respectively. The operation of the f node requires the two LLR inputs on its right side, and the operation of the g node requires the two LLR inputs on its right side and the output of the previous stage as inputs. Only after the input items are calculated can the output be calculated. According to the above calculation rules, the decoded bits obtained by calculating sequentially from the right side in Figure 3(b) are ①→②→③→④, and the decoding is completed.

[0141] The SCL decoding method refers to using the LLR sequence corresponding to the bit sequence to be decoded. When decoding each information bit, the decoding results corresponding to 0 and 1 are saved as two branch decoding paths (referred to as path splitting). Figure 3(c) shows a schematic diagram of the decoding paths in the SCL decoding method. As shown in Figure 3(c), each level represents one decoded bit. If the decoding result is 0, the path is developed along the left subtree; if the decoding result is 1, the path is developed along the right subtree. When the total number of decoding paths exceeds the preset path width L (generally L = 2, 4, 8, 16, or 32), the L paths with the best path metric (PM) value are selected, saved, and the path is further developed to decode subsequent bits. The PM value is used to judge the quality of the path, and the PM value is calculated using LLR. For each level of decoded bits, the PM values ​​of the L paths are sorted in ascending order, and the correct path is selected based on the PM value. This process is repeated until the last bit is decoded.

[0142] (8)PBCH

[0143] The 3GPP Release 18 protocol requires 5G NR to support applications in narrowband spectrum below 5 MHz. Examples include smart grids, public safety and defense facilities, and future railway mobile communication systems in Europe—scenarios where dedicated frequency division duplex (FDD) bandwidth resources are extremely limited in low-frequency bands. To support these bandwidth-constrained scenarios, NR needs to support communication with bandwidths of 3MHz to 5MHz within the n100, n106, n26, n28, and n85 frequency bands.

[0144] For the physical layer, the main impact is the further compression of existing NR PBCH band resources. This is achieved by punching holes in the top and bottom four PRBs of the existing 20 physical resource blocks (PRBs) to support narrower bandwidth.

[0145] Figure 4 shows a schematic diagram of the time-frequency structure of PBCH. The horizontal axis (time axis) represents four orthogonal frequency division multiplexing (OFDM) symbols, and the vertical axis (frequency axis) represents 20 PRBs. Each PRB includes 12 resource elements (REs). Each RE occupies one subcarrier, therefore each PRB occupies 12 subcarriers. The middle 127 REs of the first OFDM symbol carry the primary synchronization signal (PSS), and the middle 127 REs of the third OFDM symbol carry the secondary synchronization signal (SSS). The PSS is a 127-bit M-sequence, of which there are three types, and the specific type is determined based on the current physical cell identifier (PCI). The SSS is a 127-bit pseudo-random sequence, generated by superimposing two M-sequences. The PSS and SSS together determine the 1008 PCIs in the 5G system. The PSS carries three cell numbers. Once the terminal successfully detects the PSS, it only needs to search for the SSS in the search space of 1008 / 3 = 336 SSS sequences. After detecting the SSS, the SSS and PSS can form a complete PCI. The PSS and SSS are only responsible for accessing the cell. All PSS and SSS within a cell are the same. Therefore, the terminal cannot determine the relative position of the SSB in the burst set based on the PSS and SSS. Thus, the network needs to explicitly inform the terminal of this information (i.e., the relative position of the SSB in the burst set). This information, along with other essential information for accessing the cell, is mainly carried on the 56-bit payload of the PBCH. These 56 bits consist of 32 bits of PBCH data and 24 bits of CRC. The 32 bits of PBCH data consist of 24 bits of RRC payload and 8 bits of information added by the physical layer. Only by correctly deciphering the payload in the PBCH can the remaining system information block (SIB) broadcast by the network be obtained. PBCH is distributed across 20 PRB resources on the 2nd to 4th OFDM symbols, accounting for 75%. The remaining 25% is PBCH-DMRS. Here, DMRS refers to the demodulation reference signal.

[0146] Figure 5 shows a schematic diagram of a PRB carrying the PBCH. A PRB is divided into three equal parts, each containing four REs. One RE is used to store the PBCH-DMRS, and the remaining three REs are used to store the PBCH-coded and modulated symbols (i.e., PBCH bit payload or PBCH data). The position of the PBCH-DMRS is not fixed and needs to be determined based on the PCI obtained by joint detection from the PSS and SSS. The offset of the PBCH-DMRS is equal to PCI mod 4, where mod represents the modulo operation, so the offset can be 0, 1, 2, or 3. In the example in Figure 5, offset = 1. The reason for binding the position of the PBCH-DMRS to the PCI is to avoid co-channel interference caused by the same PBCH-DMRS position used by neighboring cells at the same frequency.

[0147] Based on the number of PRBs used to carry the PBCH and the overhead ratio of PBCH-DMRS, the rate-matched length E of the PBCH can be obtained. Here, E = number of PRBs used to carry the PBCH (i.e., 20 + 4 + 4 + 20 = 48) * number of REs in one PRB (i.e., 12) * PBCH ratio used to carry PBCH data (i.e., 0.75) * number of bits carried by each RE (i.e., the number of bits contained in QPSK modulation, i.e., 2) = 864 bits. Here, QPSK refers to quadrature phase shift keying.

[0148] According to the rate matching method of polar codes, NR PBCH is encoded with a maximum mother code length of N = 512. Then, after interleaving the 32-bit sub-blocks as described in Table 5.4.1.1-1 of NR standard 38.212, the interleaved bit sequence y0~y511 is obtained. Then, y0~y511 is concatenated with y0~y351 to obtain the sequence to be modulated, and QPSK modulation is performed according to the mapping method in 5.1.3 of NR standard 38.211. In this process, two adjacent bits in the sequence to be modulated are mapped to one QPSK symbol. Concatenating y0~y511 with y0~y351 to obtain the sequence to be modulated can also be described as repeatedly transmitting the first 352 bits of y0~y511 according to the rate matching method of repeated transmission.

[0149] In 3GPP Release 18, it is required that the PSS and SSS remain unchanged. Based on this requirement, in order to further reduce bandwidth, a feasible approach is to puncture the PRBs other than the PSS and SSS. Figure 6 is a schematic diagram of PRB puncturing. In this example, following the puncturing method shown in Figure 6, the top 4 PRBs and bottom 4 PRBs of the PBCH on the second OFDM symbol in the PBCH structure shown in Figure 4 can be punctured, as can the top 4 PRBs and bottom 4 PRBs of the PBCH on the fourth OFDM symbol in the PBCH structure shown in Figure 4. That is, only the middle 12 PRBs of the 20 PRBs are used to transmit the PBCH, while the 4 PRBs at each end of the second OFDM symbol, the PRBs of the third OFDM symbol, and the 4 PRBs at each end of the fourth OFDM symbol are not used to transmit the PBCH.

[0150] Therefore, the length E' of the rate-matched PBCH after puncturing = the number of PRBs used to carry the PBCH (i.e., 12 + 12 = 24) * the number of REs in one PRB (i.e., 12) * the proportion of PBCH used to carry PBCH data (i.e., 0.75) * the number of bits carried by each RE (i.e., the number of bits contained in QPSK modulation, i.e., 2) = 432 bits. It can be seen that the length E' of the rate-matched PBCH after puncturing (i.e., 432 bits) is exactly half the length E of the rate-matched PBCH before puncturing (i.e., 864 bits).

[0151] Figure 7 is a schematic diagram of PBCH resource classification. As can be seen, when using the PBCH puncturing method shown in Figure 6, the PBCH resources shown in Figure 4 can be divided into two categories of PBCH resources, as shown in Figure 7. The first category of PBCH resources can be called the first time-frequency resource, the time-frequency resource within the first bandwidth, or the out-of-band time-frequency resource. The second category of PBCH resources can be called the second time-frequency resource, the time-frequency resource within the second bandwidth, or the in-band time-frequency resource.

[0152] The first time-frequency resource consists of sub-time-frequency resource #1, sub-time-frequency resource #2, sub-time-frequency resource #3, sub-time-frequency resource #4, sub-time-frequency resource #5 and sub-time-frequency resource #6. Among them, sub-time-frequency resource #1 occupies the second OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 0 to 47; sub-time-frequency resource #2 occupies the third OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 0 to 47; sub-time-frequency resource #3 occupies the fourth OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 0 to 47; sub-time-frequency resource #4 occupies the second OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 192 to 239; sub-time-frequency resource #5 occupies the third OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 192 to 239; sub-time-frequency resource #6 occupies the fourth OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 192 to 239.

[0153] The second time-frequency resource consists of sub-time-frequency resource #a and sub-time-frequency resource #b. Sub-time-frequency resource #a occupies the second OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 48 to 191; sub-time-frequency resource #b occupies the fourth OFDM symbol in the time domain and the subcarrier indices in the frequency domain are 48 to 191.

[0154] The above resource allocation method can be applied to the following scenarios: For the first type of terminal (also known as a high-capability terminal, a relatively high-capability terminal, a normal terminal, a normal terminal, or a terminal with unrestricted capabilities), it can receive data on both the first time-frequency resource (e.g., PBCH data, PBCH-DMRS, etc.) and the second time-frequency resource (e.g., PBCH data, PBCH-DMRS, etc.); For the second type of terminal (also known as a low-capability terminal, a terminal with poor capabilities, a terminal with reduced capabilities, a terminal with limited capabilities, or a first-type terminal that has enabled energy-saving mode), it can receive data on the second time-frequency resource (e.g., PBCH data, PBCH-DMRS, etc.), but cannot receive data on the first time-frequency resource (e.g., PBCH data, PBCH-DMRS, etc.).

[0155] The first type of terminal supports a wider bandwidth than the second type of terminal, or this can be understood as the first type of terminal having greater capabilities than the second type of terminal, and this capability includes at least the supported bandwidth. The supported bandwidth can be the receiving bandwidth and / or the transmitting bandwidth.

[0156] For the above resource allocation method, there are two different encoding methods.

[0157] Encoding method 1 involves encoding the information bit sequence and mapping the encoded bit sequence to a first time-frequency resource and a second time-frequency resource for transmission. That is, a portion of the encoded bit sequence is mapped to the first time-frequency resource, and the other portion is mapped to the second time-frequency resource.

[0158] This encoding method 1 is also called the long code encoding method, or the in-band and out-of-band joint encoding method.

[0159] Regarding encoding method 1, the first type of terminal can obtain the decoding information corresponding to the complete encoded bit sequence from both the first and second time-frequency resources, and complete the correct decoding based on the decoding information. The second type of terminal can only obtain the decoding information corresponding to a portion of the encoded bit sequence from the second time-frequency resource, therefore the decoding process suffers from severe puncturing and significant performance loss.

[0160] Figure 8 shows an example of encoding method 1. In this example, N = E = 4, K = 2. Here, E represents the code length or the length of the encoded bit sequence, and K represents the length of the information bit sequence or the message bit sequence. Using the polar coding method, a polar code with a master code length of N = 4 is constructed, and the K (i.e., 2) positions with the highest reliability are selected to carry information bits. In this example, 2 information bits are mapped to positions 3 and 4, and positions 1 and 2 are used to carry frozen bits. For example, the bits corresponding to positions 1 and 2 in the encoded bit sequence can be mapped to the first time-frequency resource for transmission, and the bits corresponding to positions 3 and 4 in the encoded bit sequence can be mapped to the second time-frequency resource for transmission.

[0161] Regarding the example in Figure 8, the first type of terminal can receive the first decoding information corresponding to the complete encoded bit sequence on both the first and second time-frequency resources. Therefore, it can correctly decode the first decoding information to obtain two information bits. The second type of terminal can only obtain the second decoding information corresponding to a portion of the encoded bit sequence on the second time-frequency resource and perform decoding based on this second decoding information. Since this second decoding information only corresponds to a portion of the encoded bit sequence, the decoding performance suffers a significant loss.

[0162] Encoding method 2 divides the information bit sequence into a first bit sequence and a second bit sequence. The first bit sequence is subjected to first polarization encoding to obtain a first codeword of length N1, where N1 is the length of the parent code sequence of the first polarization encoding. The first codeword is then rate-matched and mapped to a first time-frequency resource for transmission. The second bit sequence is then subjected to second polarization encoding to obtain a second codeword of length N2, where N2 is the length of the parent code sequence of the second polarization encoding. The second codeword is then rate-matched and mapped to a second time-frequency resource for transmission. The first bit sequence contains a portion of the bits from the information bit sequence, and the second bit sequence contains another portion of the bits from the information bit sequence. The length of the second bit sequence is greater than or equal to the length of the first bit sequence. For example, the information bit sequence contains K bits, the first bit sequence contains K1 bits, and the second bit sequence contains K2 bits, where K1 + K2 = K, and K2 ≥ K1.

[0163] This encoding method 2 is also called the short code encoding method, or the in-band and out-of-band independent encoding method.

[0164] Regarding encoding method 2, the first type of terminal can obtain the first decoding information corresponding to the first codeword on the first time-frequency resource, and the second decoding information corresponding to the second codeword on the second time-frequency resource. The first and second decoding information are then jointly decoded to obtain an information bit sequence. The second type of terminal can only obtain the second decoding information on the second time-frequency resource. Since the second bit sequence corresponding to the second decoding information contains more information bits (i.e., K2 ≥ K1) from the information bit sequence, and the second codeword is encoded separately, encoding method 2 has better decoding performance for the second type of terminal compared to encoding method 1.

[0165] Encoding method 2 solves the problem of severe decoding performance loss in the second type of terminal by independently encoding in-band and out-of-band. However, for the first type of terminal, it decodes two independent short codes (i.e., the first information to be decoded and the second information to be decoded) instead of a long code. Therefore, compared with the above encoding method 1, it loses the gain brought by long code encoding.

[0166] Figure 9 shows an example of encoding method 2. In this example, N1 = E1 = 2, K1 = 1, N2 = E2 = 2, K2 = 1, and K = K1 + K2 = 2. K represents the length of the information bit sequence or the message bit sequence, which is divided into K1 bits and K2 bits. The sequence consisting of the K1 bits is called the first bit sequence, and the sequence consisting of the K2 bits is called the second bit sequence. E1 represents the first code length, E2 represents the second code length, N1 represents the first mother code length, and N2 represents the second mother code length.

[0167] Using polar coding, a first mother code of length N1 = 2 is constructed, and K1 positions (i.e., 1 position) with the highest reliability are selected to carry K1 information bits. In this example, K1 information bits are mapped to position 2, and position 1 is used to carry frozen bits. The encoded bit sequence (i.e., the first codeword) is mapped to the first time-frequency resource for transmission.

[0168] Using polar coding, a second mother code of length N² = 2 is constructed, and K² (i.e., 1) positions with the highest reliability are selected to carry K² information bits. In this example, K² information bits are mapped to position 2', and position 1' is used to carry frozen bits. The encoded bit sequence (i.e., the second codeword) is then mapped to the second time-frequency resource for transmission.

[0169] Regarding the example in Figure 9, the first type of terminal can receive the first codeword-corresponding information to be decoded in the first time-frequency resource, and decode the first codeword-corresponding information to obtain one information bit; and receive the second codeword-corresponding information to be decoded in the second time-frequency resource, and decode the second codeword-corresponding information to obtain another information bit. Since the first type of terminal decodes two independent short codes (i.e., the first codeword-corresponding information and the second codeword-corresponding information) instead of decoding a long code, it loses the gain brought by long code encoding compared to the above encoding method 1.

[0170] The second type of terminal can only obtain the second information to be decoded on the second time-frequency resource. Since the second bit sequence corresponding to the second information to be decoded contains more information bits in the information bit sequence (i.e., K2≥K1), and the second codeword is encoded separately, the second type of terminal has better decoding performance than the above encoding method 1.

[0171] In summary, the first type of terminal can receive data on pre-configured time-frequency resources (such as PBCH resources), while the second type of terminal, due to limited capabilities, can only receive data within a portion of the frequency domain of those resources. For example, the first type of terminal can receive data on a first bandwidth, while the second type of terminal can receive data on a second bandwidth, where the second bandwidth is a proper subset of the first bandwidth. Because of the existence of these two types of terminals, how communication devices (such as network devices or terminals) encode and map data to resources to ensure the decoding performance of both types of terminals when broadcasting or multicasting data remains to be solved.

[0172] To address the aforementioned issues, this application provides corresponding solutions.

[0173] The methods provided in the embodiments of this application are described in detail below. The methods provided in the embodiments of this application involve a first communication device and / or a second communication device. The first communication device is a signal transmitting end, and the second and third communication devices are signal receiving ends. Unless otherwise specified, the "first communication device" in this application can refer to a communication device (e.g., network device, terminal, encoding device, etc.), a component of that communication device (e.g., processor, chip, or chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the communication device. The "second communication device" in this application can refer to a first type of terminal (also called a decoding device), a component of that first type of terminal (e.g., processor, chip, or chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the first type of terminal. The "third communication device" in this application can refer to a second type of terminal (also called a decoding device), a component of that second type of terminal (e.g., processor, chip, or chip system, etc.), or a logic module or software capable of implementing all or part of the functions of the second type of terminal. For example, the first communication device is a network device, the second communication device is a first-class terminal, and the third communication device is a second-class terminal.

[0174] For ease of explanation, the following description will use the example of a network device as the first communication device, a first-type terminal as the second communication device, and a second-type terminal as the third communication device. The network device, first-type terminal, and second-type terminal mentioned below can be replaced with the first communication device, second communication device, and third communication device, respectively.

[0175] Figure 10 is a flowchart illustrating an encoding method provided in an embodiment of this application. This method is an implementation method on the encoding side, and includes the following steps:

[0176] Step 1001: The network device obtains the information bit sequence.

[0177] The information bit sequence includes a first bit sequence and a second bit sequence. For example, the length of the information bit sequence is K, the length of the first bit sequence is K1, the length of the second bit sequence is K2, and K1 + K2 = K.

[0178] In one possible implementation, the length of the second bit sequence is greater than or equal to the length of the first bit sequence. This method helps improve the performance gain of long codes.

[0179] Step 1002: The network device performs first polarization encoding on the first bit sequence to obtain a first codeword of length N1.

[0180] Where N1 is the length of the mother code sequence of the first polarization encoding, and N1 is an integer power of 2.

[0181] The size of N1 is determined based on the code length (i.e. the length of the encoded bit sequence) and the target code rate.

[0182] Step 1003: The network device performs second polarization encoding on the second bit sequence to obtain a second codeword of length N2.

[0183] Where N2 is the length of the mother code sequence of the second polarization encoding, and N2 is an integer power of 2.

[0184] N1 and N2 can be equal or unequal.

[0185] The size of N2 is determined based on the code length (i.e. the length of the encoded bit sequence) and the target code rate.

[0186] Step 1004: The network device obtains a third codeword of length N3 based on the first codeword and the second codeword.

[0187] N3 is equal to N1 or N2.

[0188] In one possible implementation, when N1 equals N2, the network device performs an XOR operation on the first codeword and the second codeword to obtain the third codeword, at which point N3 = N2 = N1. Specifically, the XOR operation involves XORing the bit values ​​at the same positions of the first codeword and the second codeword.

[0189] In another possible implementation, when N1 is less than N2 (i.e., the length of the first codeword is less than the length of the second codeword), the network device first determines the seventh codeword based on the first codeword. The length of the seventh codeword is equal to N2. For example, the seventh codeword consists of the first codeword and some bits of the first codeword. Then, the network device performs an XOR operation between the seventh codeword and the second codeword to obtain the third codeword. Here, N3 = N2. Specifically, the XOR operation involves XORing the bits at the same positions of the seventh codeword and the second codeword.

[0190] In another possible implementation, when N1 is greater than N2 (i.e., the length of the first codeword is greater than the length of the second codeword), the network device first determines the eighth codeword based on the second codeword. The length of the eighth codeword is equal to N1. For example, the eighth codeword consists of the second codeword and some bits of the second codeword. Then, the network device performs an XOR operation between the eighth codeword and the first codeword to obtain the third codeword. Here, N3 = N1. Specifically, the XOR operation involves XORing the bit values ​​at the same positions of the eighth codeword and the first codeword.

[0191] Step 1005: The network device performs rate matching based on the first rate matching method and the third codeword to obtain the fourth codeword.

[0192] As one implementation method, the network device uses a first rate matching method to rate match the third codeword to obtain the fourth codeword.

[0193] As another implementation method, interleaving operations (such as sub-block interleaving or triangular interleaving) may also be included before and / or after rate matching. For example, the network device first interleaves the third codeword to obtain an interleaved bit sequence, and then performs rate matching on the interleaved bit sequence according to the first rate matching method to obtain the fourth codeword. Alternatively, the network device performs rate matching on the third codeword according to the first rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the fourth codeword. Again, the network device first interleaves the third codeword to obtain an interleaved bit sequence, then performs rate matching on the interleaved bit sequence according to the first rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the fourth codeword.

[0194] Step 1006: The network device performs rate matching according to the second rate matching method and the second codeword to obtain the fifth codeword.

[0195] As one implementation method, the network device uses a second rate matching method to rate match the second codeword to obtain the fifth codeword.

[0196] As another implementation method, interleaving operations (such as sub-block interleaving or triangular interleaving) may be included before and / or after rate matching. For example, the network device first interleaves the second codeword to obtain an interleaved bit sequence, and then performs rate matching on the interleaved bit sequence according to the second rate matching method to obtain the fifth codeword. Alternatively, the network device performs rate matching on the second codeword according to the second rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the fifth codeword. Again, the network device first interleaves the second codeword to obtain an interleaved bit sequence, then performs rate matching on the interleaved bit sequence according to the second rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the fifth codeword.

[0197] In one implementation method, the first rate matching method is repetition or punching, and the second rate matching method is repetition or punching.

[0198] Step 1007: The network device sends the sixth codeword through the first time-frequency resource and the second time-frequency resource.

[0199] The sixth codeword includes the fourth and fifth codewords. The fourth codeword corresponds to the first time-frequency resource, and the fifth codeword corresponds to the second time-frequency resource. The first and second time-frequency resources correspond to Type 1 terminals, and the second time-frequency resource corresponds to Type 2 terminals. Alternatively, it can be understood that the first and second time-frequency resources together (or in combination) correspond to Type 1 terminals, while only the second time-frequency resource corresponds to Type 2 terminals. Since the bandwidth supported by Type 1 terminals includes the bandwidth on both the first and second time-frequency resources, Type 1 terminals can receive the fourth codeword on the first time-frequency resource and the fifth codeword on the second time-frequency resource. Since the bandwidth supported by Type 2 terminals includes the bandwidth on the second time-frequency resource but not the bandwidth on the first time-frequency resource, Type 2 terminals can receive the fifth codeword on the second time-frequency resource but cannot receive the fourth codeword on the first time-frequency resource.

[0200] Based on the above scheme, on the one hand, a third codeword is generated based on the first and second codewords, and rate-matched to correspond to the first time-frequency resource. Similarly, the second codeword is rate-matched to correspond to the second time-frequency resource. Thus, the first type of terminal can concatenate the information to be decoded received on the first and second time-frequency resources, and decode the concatenated codeword as a long code. This allows simultaneous decoding of information bits on both time-frequency and second resources, thereby capturing the gain from long code decoding and ensuring the decoding performance of the first type of terminal. On the other hand, the second type of terminal can independently decode the information to be decoded received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure its decoding performance. Therefore, this scheme guarantees the decoding performance of both the first and second type of terminals.

[0201] The following will illustrate this with specific examples.

[0202] Example 1

[0203] Taking the example in Figure 7, the first type of terminal can receive data on the first and second time-frequency resources shown in Figure 7, and the second type of terminal can receive data on the second time-frequency resource. According to the preceding description, the number of bits of PBCH data carried by both the first and second time-frequency resources is 432. Based on this example, in a first possible implementation, the length N1 of the first polarization-coded mother code sequence in the embodiment of Figure 10 can be 512, the length N2 of the second polarization-coded mother code sequence can be 512, and the first rate matching method used in step 1005 is puncturing, as well as the second rate matching method used in step 1006 is puncturing. In a second possible implementation, the length N1 of the first polarization-coded mother code sequence in the embodiment of Figure 10 can be 256, the length N2 of the second polarization-coded mother code sequence can be 512, and the first rate matching method used in step 1005 is repetition, as well as the second rate matching method used in step 1006 is puncturing.

[0204] Example 2

[0205] Figure 11 shows the time-frequency structure of the PBCH and another schematic diagram of PBCH resource classification. In this example, the horizontal axis (i.e., the time axis) represents 4 OFDM symbols, and the vertical axis (i.e., the frequency axis) represents 22 PRBs. Each PRB includes 12 REs. Each RE occupies one subcarrier, therefore each PRB occupies 12 subcarriers. The structure of the bottom 12 PRBs in Figure 11 is the same as the structure of the middle 12 PRBs in the example of Figure 4, as described above. The 30 (i.e., 3*10=30) PRBs located at the top of Figure 11, corresponding to symbols 2-4, are all used to carry the PBCH, which includes PBCH data and PBCH-DMRS. PBCH data accounts for 75% of the PBCH, and PBCH-DMRS accounts for 25%.

[0206] The PBCH that occupies symbols 2-4 in the time domain and the top 10 PRBs in the frequency domain of Figure 11 is called the first time-frequency resource (or out-of-band time-frequency resource). The PBCH that occupies symbols 1-4 in the time domain and the bottom 12 PRBs in the frequency domain is called the second time-frequency resource (or in-band time-frequency resource).

[0207] It can be seen that the length E' after rate matching corresponding to the first time-frequency resource is equal to the number of PRBs used to carry PBCH (i.e., 3*10=30) * the number of REs in one PRB (i.e., 12) * the proportion of PBCH used to carry PBCH data (i.e. 0.75) * the number of bits carried by each RE (i.e. the number of bits contained in QPSK modulation, i.e. 2) = 540 bits.

[0208] The length E' of the second time-frequency resource after rate matching = the number of PRBs used to carry PBCH (i.e., 12 + 12 = 24) * the number of REs in one PRB (i.e., 12) * the proportion of PBCH used to carry PBCH data (i.e., 0.75) * the number of bits carried by each RE (i.e., the number of bits contained in QPSK modulation, i.e., 2) = 432 bits.

[0209] Based on the example in Figure 11, a first type of terminal can receive data on the first and second time-frequency resources shown in Figure 11, and a second type of terminal can receive data on the second time-frequency resource. As described above, the number of bits of PBCH data carried by the first time-frequency resource is 540, and the number of bits of PBCH data carried by the second time-frequency resource is 432. Based on this example, in a first possible implementation, the length N1 of the first polarization-coded mother code sequence in the embodiment of Figure 10 can be 256, the length N2 of the second polarization-coded mother code sequence can be 512, and the first rate matching method used in step 1005 is repetition, while the second rate matching method used in step 1006 is puncturing. In a second possible implementation, the length N1 of the first polarization-coded mother code sequence in the embodiment of Figure 10 can be 512, the length N2 of the second polarization-coded mother code sequence can be 512, and the first rate matching method used in step 1005 is repetition, while the second rate matching method used in step 1006 is puncturing.

[0210] The following description, with reference to Figure 12, illustrates the complete encoding process and resource mapping at the sending end (i.e., the network device). Figure 12 is a schematic diagram of the encoding process and resource mapping at the sending end, as detailed below:

[0211] (1) The first bit sequence of length K1 in the information bit sequence (using...) (represented) concatenating the first CRC of L1 length, to obtain the first bit sequence to be encoded (using) express).

[0212] in, The first bit sequence is defined as having a bit length of K1. The subscript 0 indicates the label of the first bit in the first bit sequence, and the superscript K1-1 indicates the label of the last bit in the first bit sequence. Other symbols described later (e.g.) In the symbols (etc.), the subscript and superscript refer to the label of the first and last information of the symbol, respectively. This will be explained uniformly here and will not be repeated later.

[0213] "Out-of-band" indicates that the final mapping is to out-of-band time-frequency resources (i.e., the first time-frequency resource). In addition, "in-band" as described later indicates that the final mapping is to in-band time-frequency resources (i.e., the second time-frequency resource). This is explained uniformly here and will not be repeated later.

[0214] (2) Perform first polarization encoding on the first bit sequence to be encoded to obtain the first codeword of length N1 (using... express).

[0215] (3) The second bit sequence of length K2 in the information bit sequence (using...) (represented) concatenating a second CRC of L2 length, to obtain a second bit sequence to be encoded (using) express).

[0216] (4) Perform second polarization encoding on the second bit sequence to be encoded to obtain a second codeword of length N2 (using... express).

[0217] (5) Determine the third codeword of length N3 based on the first and second codewords. Refer to the previous description for the specific process.

[0218] It should be noted that there is no requirement for the order of steps (1) and (2) above with steps (3) and (4).

[0219] (6) Perform rate matching on the third codeword to obtain the fourth codeword of length E1 (using...). express).

[0220] Taking the example in Figure 11, N1 = 512, E1 = 540, and the rate matching mode is repetition.

[0221] (7) Modulate the fourth codeword to obtain the first symbol sequence of length M1 (using... express).

[0222] Taking QPSK modulation as an example, when N1 = 512 and E1 = 540, then M1 = 270.

[0223] (8) Map the first symbol sequence to the first time-frequency resource for transmission.

[0224] (9) Perform rate matching on the second codeword to obtain the fifth codeword of length E2 (using...). express).

[0225] Taking the example in Figure 11 as an example, N2 = 512, E2 = 432, and the rate matching method is punching.

[0226] (10) Modulate the fifth codeword to obtain a second symbol sequence of length M2 (using... express).

[0227] Taking QPSK modulation as an example, when N2 = 512 and E2 = 432, then M2 = 216.

[0228] (11) The second symbol sequence is mapped to the second time-frequency resource for transmission.

[0229] It should be noted that there is no requirement for the order of steps (6), (7), and (8) above with steps (9), (10), and (11).

[0230] Figure 13 is a flowchart illustrating a decoding method provided in an embodiment of this application. This method is an implementation method on the decoding side corresponding to the embodiment in Figure 10, and is executed by a first type of terminal. The method includes the following steps:

[0231] Step 1301: The first type of terminal obtains the information to be decoded.

[0232] The information to be decoded includes first information and second information.

[0233] The first information corresponds to the fourth codeword. That is, in step 1005 above, after the network device determines the fourth codeword, it sends the fourth codeword to the first time-frequency resource. Correspondingly, the first type of terminal obtains the first received signal from the first time-frequency resource and obtains the first information based on the first received signal.

[0234] The second information corresponds to the fifth codeword. That is, in step 1006 above, after the network device determines the fifth codeword, it sends the fifth codeword to the second time-frequency resource. Correspondingly, the first type of terminal obtains the second received signal from the second time-frequency resource and obtains the second information based on the second received signal.

[0235] The meanings of the fourth codeword, the fifth codeword, the first time-frequency resource, the second time-frequency resource, and the first type of terminal can be found in the relevant descriptions in the embodiment of Figure 10, and will not be repeated here.

[0236] Step 1302: The first type of terminal performs rate matching according to the first rate matching method and the first information to obtain the third codeword.

[0237] As one implementation method, the first type of terminal uses a first rate matching method to derate the first information to obtain the third codeword.

[0238] As another implementation method, deinterleaving operations (such as de-blocking or de-trianglement) may be included before and / or after rate matching. For example, the first type of terminal first deinterleaves the first information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the first rate matching method to obtain the third codeword. Another example: the first type of terminal performs rate matching on the first information according to the first rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the third codeword. Yet another example: the first type of terminal first deinterleaves the first information to obtain a deinterleaved bit sequence, then performs rate matching on the deinterleaved bit sequence according to the first rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the third codeword.

[0239] Step 1303: The first type of terminal performs de-rate matching according to the second rate matching method and the second information to obtain the second codeword.

[0240] As one implementation method, the first type of terminal uses the second rate matching method to de-rate match the second information to obtain the second codeword.

[0241] As another implementation method, deinterleaving operations (such as de-blocking or de-trianglement) may be included before and / or after rate matching. For example, the first type of terminal first deinterleaves the second information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the second rate matching method to obtain the second codeword. Another example: the first type of terminal performs rate matching on the second information according to the second rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the second codeword. Yet another example: the first type of terminal first deinterleaves the second information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the second rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the second codeword.

[0242] Step 1304: The first type of terminal determines the first codeword based on the third codeword and the second codeword.

[0243] The meanings of the first codeword, the second codeword, the third codeword, the first rate matching method, and the second rate matching method can be found in the relevant descriptions in the embodiment of Figure 10, and will not be repeated here.

[0244] Step 1305: The first type of terminal performs polarization decoding on the first codeword and the second codeword to obtain the information bit sequence.

[0245] That is, the first type of terminal concatenates the first codeword and the second codeword to obtain a long code, and then decodes the long code, thus obtaining the gain brought by long code decoding. The information bit sequence includes a first bit sequence of length K1 and a second bit sequence of length K2.

[0246] It should be noted that steps 1304 and 1305 above can also be replaced by: the first type of terminal performing polarization decoding on the third codeword and the second codeword to obtain the information bit sequence, that is, concatenating the third codeword and the second codeword to obtain a long code, and decoding the long code.

[0247] Based on the above scheme, the first type of terminal can concatenate the information to be decoded received on the first time-frequency resource and the information to be decoded received on the second time-frequency resource, and decode the concatenated codeword as a long code. It can simultaneously decode the information bits on the first time-frequency resource and the information bits on the second time-frequency resource, thus obtaining the gain brought by long code decoding, which helps to ensure the decoding performance of the first type of terminal.

[0248] For the second type of terminal, the decoding process is as follows: The second type of terminal acquires the second information on the second time-frequency resource, performs rate matching dematching according to the second rate matching method and the second information to obtain the second codeword, and performs polarization decoding on the second codeword to obtain the second bit sequence. Based on this scheme, the second type of terminal can independently decode the information to be decoded (i.e., the second information) received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure the decoding performance of the second type of terminal.

[0249] The complete decoding process of the receiving end (i.e., the first type of terminal and the second type of terminal) is described below with reference to Figure 14. Figure 14 is a schematic diagram of the decoding process of the receiving end.

[0250] For the first type of terminal, the decoding process is as follows:

[0251] (1) Obtain the first received signal from the first time-frequency resource (using...) (represented), and the second received signal is obtained from the second time-frequency resource (using) express).

[0252] (2) Demodulate the first received signal to obtain the first LLR sequence of length E1 (using... (represented), and the second received signal is demodulated to obtain a second LLR sequence of length E2 (using) express).

[0253] (3) Derate matching the first LLR sequence to obtain a third LLR sequence of length N1 (using... (represented), and a fourth LLR sequence of length N2 obtained by rate matching of the second LLR sequence (using) express).

[0254] Taking the example in Figure 11 as an example, N1 = 512, E1 = 540, M1 = 270, N2 = 512, E2 = 432, M2 = 216.

[0255] (4) Concatenate the third and fourth LLR sequences to obtain a fifth LLR sequence of length N1+N2 (using...). express).

[0256] (5) Polarization decoding is performed on the fifth LLR sequence to obtain the decoding result (using...). express).

[0257] The decoding result includes the first bit of information of length K1 (using... (represented), the second bit of information of length K2 (using) (represented by L1 length) and L2 length of the first CRC and the second CRC.

[0258] The first type of terminal uses a first CRC to verify the first bit information and a second CRC to verify the second bit information. If both verifications are correct, the decoding is considered correct; if at least one verification fails, the decoding is considered incorrect. In the case of correct decoding, the first bit information is the same as the first bit sequence described in the embodiment of Figure 10, and the second bit information is the same as the second bit sequence described in the embodiment of Figure 10.

[0259] In one implementation, L1 is less than L2.

[0260] The sizes of N1, E1, M1, L1, K1, N2, E2, M2, L2, K2 in the example of Figure 14 are the same as those in the example of Figure 12.

[0261] The decoding process of the first type of terminal described above can improve the error correction performance and FAR performance of the first type of terminal as much as possible without sacrificing the false alarm rate (FAR) performance of the second type of terminal. This is because the CRC obtained by decoding the first type of terminal includes both the first CRC and the second CRC.

[0262] For the second type of terminal, the decoding process is as follows:

[0263] (1) Obtain the second received signal from the second time-frequency resource (using...) express).

[0264] (2) Demodulate the second received signal to obtain a second LLR sequence of length E2 (using... express).

[0265] (3) Derate the second LLR sequence to obtain a fourth LLR sequence of length N2 (using...). express).

[0266] Taking the example in Figure 11 as an example, N1 = 512, E1 = 540, M1 = 270, N2 = 512, E2 = 432, M2 = 216.

[0267] (4) Polarization decoding is performed on the fourth LLR sequence to obtain the decoding result (using...). express).

[0268] The decoding result includes the second bit of information of length K2 (using... (represented) and the second CRC of length L2.

[0269] The second type of terminal uses a second CRC to verify the second bit information. If the verification is correct, the decoding is considered correct; if the verification fails, the decoding is considered incorrect. In the case of correct decoding, the second bit information is the same as the second bit sequence described in the embodiment of Figure 10.

[0270] The above, combined with Figures 10-14, presents one encoding and decoding method that can guarantee the decoding performance of both Type I and Type II terminals. Below, combined with Figures 15-18, another encoding and decoding method is presented, which can also guarantee the decoding performance of both Type I and Type II terminals.

[0271] Figure 15 is a flowchart illustrating an encoding method provided in an embodiment of this application. This method is an implementation method on the encoding side, and includes the following steps:

[0272] Step 1501: The network device performs polar coding on the information bit sequence to obtain the first codeword of length N.

[0273] Where N is the length of the polar-coded mother code sequence, and N is an integer power of 2.

[0274] The size of N is determined based on the code length (i.e. the length of the encoded bit sequence) and the target code rate.

[0275] The length of the information bit sequence can be represented by K.

[0276] Step 1502: The network device performs rate matching based on the first rate matching method and the first codeword to obtain the second codeword.

[0277] As one implementation method, the network device uses a first rate matching method to rate match the first codeword to obtain the second codeword.

[0278] As another implementation method, interleaving operations (such as sub-block interleaving or triangular interleaving) may be included before and / or after rate matching. For example, the network device first interleaves the first codeword to obtain an interleaved bit sequence, and then performs rate matching on the interleaved bit sequence according to the first rate matching method to obtain the second codeword. Alternatively, the network device performs rate matching on the first codeword according to the first rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the second codeword. Or, for yet another example, the network device first interleaves the first codeword to obtain an interleaved bit sequence, then performs rate matching on the interleaved bit sequence according to the first rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain the second codeword.

[0279] Step 1503: The network device performs rate matching based on the second rate matching method and the first codeword to obtain the third codeword.

[0280] As one implementation method, the network device uses a second rate matching method to rate match the first codeword to obtain the third codeword.

[0281] As another implementation method, interleaving operations (such as sub-block interleaving or triangular interleaving) may be included before and / or after rate matching. For example, the network device first interleaves the first codeword to obtain an interleaved bit sequence, and then performs rate matching on the interleaved bit sequence according to a second rate matching method to obtain a third codeword. Alternatively, the network device performs rate matching on the first codeword according to a second rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain a third codeword. Again, the network device first interleaves the first codeword to obtain an interleaved bit sequence, then performs rate matching on the interleaved bit sequence according to a second rate matching method to obtain a rate-matched bit sequence, and then interleaves the rate-matched bit sequence to obtain a third codeword.

[0282] In one implementation method, the first rate matching method is repetition or punching, and the second rate matching method is repetition or punching.

[0283] Step 1504: The network device sends a fourth codeword through the first time-frequency resource and the second time-frequency resource. The fourth codeword includes the second codeword and the third codeword.

[0284] The second codeword corresponds to the first time-frequency resource, and the third codeword corresponds to the second time-frequency resource. The first and second time-frequency resources correspond to Type 1 terminals, and the second time-frequency resource corresponds to Type 2 terminals. Alternatively, it can be understood that the first and second time-frequency resources together (or in combination) correspond to Type 1 terminals, while only the second time-frequency resource corresponds to Type 2 terminals. Since the bandwidth supported by Type 1 terminals includes the bandwidth on both the first and second time-frequency resources, Type 1 terminals can receive the second codeword on the first time-frequency resource and the third codeword on the second time-frequency resource. Since the bandwidth supported by Type 2 terminals includes the bandwidth on the second time-frequency resource but not the bandwidth on the first time-frequency resource, Type 2 terminals can receive the third codeword on the second time-frequency resource but cannot receive the second codeword on the first time-frequency resource.

[0285] Based on the above scheme, on the one hand, the second codeword is rate-matched to correspond to the first time-frequency resource, and the third codeword is rate-matched to correspond to the second time-frequency resource. Thus, the first type of terminal can soft-combine the information to be decoded received on the first time-frequency resource and the information to be decoded received on the second time-frequency resource before decoding. This allows simultaneous decoding of the information bits on both the first and second time-frequency resources, thus capturing the decoding gain brought by soft-combining and helping to ensure the decoding performance of the first type of terminal. Furthermore, the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword). Therefore, the information to be decoded received on the first and second time-frequency resources contains some overlapping information, which helps improve decoding accuracy. Also, since the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword), only one CRC is needed, instead of two different CRCs. Therefore, compared to the embodiment in Figure 10, the CRC overhead is smaller. On the other hand, the second type of terminal can independently decode the information to be decoded received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure the decoding performance of the second type of terminal. Therefore, this scheme guarantees the decoding performance of both the first and second type of terminals.

[0286] The following will illustrate this with specific examples.

[0287] Example a

[0288] Taking the example in Figure 11, the first type of terminal can receive data on the first time-frequency resource and the second time-frequency resource shown in Figure 11, and the second type of terminal can receive data on the second time-frequency resource. According to the previous description, the number of bits of PBCH data carried by the first time-frequency resource is 540, and the number of bits of PBCH data carried by the second time-frequency resource is 432.

[0289] Based on this example, in one possible implementation, the length N of the polar-coded mother code sequence in the embodiment of Figure 15 can be 512, and the first rate matching method used in step 1502 is repetition, while the second rate matching method used in step 1503 is puncturing. The second codeword consists of the first codeword and the fifth codeword, and the fifth codeword is a proper subset of the first codeword. The second rate matching method is puncturing, and the third codeword is a proper subset of the first codeword.

[0290] Figure 16 is a schematic diagram of resource mapping. In this example, after encoding a first codeword of length N = 512, the first codeword is stored in a circular buffer, with the 512 bits of the first codeword indexed from 1 to 512. Then, a second codeword is obtained from the circular buffer, consisting of 512 bits indexed from 1 to 512 and 28 bits indexed from 1 to 28. This second codeword is modulated and mapped to the first time-frequency resource for transmission. Alternatively, it can be stated that the second codeword consists of the first codeword and a fifth codeword, where the fifth codeword is a proper subset of the first codeword, specifically bits 1 to 28 of the first codeword. Finally, a third codeword is obtained from the circular buffer, consisting of 432 bits indexed from 81 to 512. This third codeword is modulated and mapped to the second time-frequency resource for transmission.

[0291] It can be seen that the first rate matching method used to construct the second codeword is repetition, that is, the first 1 to 28 bits of the first codeword are repeatedly sent. The second rate matching method used to construct the third codeword is puncturing, that is, the first 1 to 80 bits of the first codeword are punctured.

[0292] Example b

[0293] Taking the example in Figure 11, the first type of terminal can receive data on the first time-frequency resource and the second time-frequency resource shown in Figure 11, and the second type of terminal can receive data on the second time-frequency resource. According to the previous description, the number of bits of PBCH data carried by the first time-frequency resource is 540, and the number of bits of PBCH data carried by the second time-frequency resource is 432.

[0294] Based on this example, in one possible implementation, the length N of the polar-coded mother code sequence in the embodiment of Figure 15 can be 512, and the first rate matching method used in step 1502 is repetition, while the second rate matching method used in step 1503 is puncturing. The second codeword consists of a third codeword and a sixth codeword, where the sixth codeword is a proper subset of the third codeword, and the third codeword is a proper subset of the first codeword. The second rate matching method is puncturing.

[0295] Figure 17 shows another schematic diagram of resource mapping. In this example, after encoding a first codeword of length N = 512, bits 81 to 512 of the first codeword are stored in a ring buffer, with the indices of these bits 81 to 512 represented by 81 to 512. Then, a second codeword is obtained from the ring buffer, consisting of 432 bits indices 81 to 512 and 108 bits indices 81 to 188. This second codeword is modulated and mapped to the first time-frequency resource for transmission. Alternatively, the second codeword can be described as consisting of a third codeword and a sixth codeword, where the sixth codeword is a proper subset of the third codeword, and the third codeword is a proper subset of the first codeword. Here, the third codeword is bits 81 to 512 of the first codeword, and the sixth codeword is bits 81 to 188 of the first codeword. The third codeword is obtained from the ring buffer, consisting of 432 bits indices 81 to 512, modulated, and mapped to the second time-frequency resource for transmission.

[0296] It can be seen that the first rate matching method used to construct the second codeword is repetition, that is, the 81st to 188th bits of the first codeword are repeatedly sent. The second rate matching method used to construct the third codeword is puncturing, that is, the 1st to 80th bits of the first codeword are punctured.

[0297] The main difference between Example b and Example a is that in Example a, some bits of the first codeword (i.e., bits 1 to 80) appear only in the second codeword and not in the third codeword. In Example b, the second and third codewords contain the same bits (i.e., bits 81 to 512) from the first codeword.

[0298] In example b above, the ring buffer only needs to store bits 81 to 512 of the first codeword, while in example a, the ring buffer only needs to store the complete first codeword, i.e., 512 bits. Therefore, the buffering overhead in example b is smaller. However, in example a, because the second codeword contains more bit information from the first codeword than the third codeword, the decoding performance of the first type of terminal is better and the complexity is lower.

[0299] Figure 18 is a flowchart illustrating a decoding method provided in an embodiment of this application. This method is an implementation method on the decoding side, and includes the following steps:

[0300] Step 1801: The first type of terminal obtains the information to be decoded.

[0301] The information to be decoded includes first information and second information.

[0302] The first information corresponds to the second codeword. That is, in step 1502 above, after the network device determines the second codeword, it sends the second codeword to the first time-frequency resource. Correspondingly, the first type of terminal obtains the first received signal from the first time-frequency resource and obtains the first information based on the first received signal.

[0303] The second information corresponds to the third codeword. That is, in step 1503 above, after the network device determines the third codeword, it sends the third codeword to the second time-frequency resource. Correspondingly, the second type of terminal obtains the second received signal from the second time-frequency resource and obtains the second information based on the second received signal.

[0304] The meanings of the second codeword, the third codeword, the first time-frequency resource, the second time-frequency resource, and the first type of terminal can be found in the relevant descriptions in the embodiment of Figure 15, and will not be repeated here.

[0305] Step 1802: The first type of terminal performs rate matching on the first information according to the first rate matching method to obtain a seventh codeword of length N.

[0306] As one implementation method, the first type of terminal uses a first rate matching method to derate the first information to obtain the seventh codeword.

[0307] As another implementation method, deinterleaving operations (such as de-blocking or de-trianglement) may be included before and / or after rate matching. For example, the first type of terminal first deinterleaves the first information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the first rate matching method to obtain the seventh codeword. Another example: the first type of terminal performs rate matching on the first information according to the first rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the seventh codeword. Yet another example: the first type of terminal first deinterleaves the first information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the first rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the seventh codeword.

[0308] Step 1803: The first type of terminal performs rate matching on the second information according to the second rate matching method to obtain the eighth codeword of length N.

[0309] As one implementation method, the first type of terminal uses the second rate matching method to derate the second information to obtain the eighth codeword.

[0310] As another implementation method, deinterleaving operations (such as de-blocking or de-trianglement) may be included before and / or after rate matching. For example, the first type of terminal first deinterleaves the second information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the second rate matching method to obtain the eighth codeword. Another example: the first type of terminal performs rate matching on the second information according to the second rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the eighth codeword. Yet another example: the first type of terminal first deinterleaves the second information to obtain a deinterleaved bit sequence, and then performs rate matching on the deinterleaved bit sequence according to the second rate matching method to obtain a rate-matched bit sequence, and then performs deinterleaving on the rate-matched bit sequence to obtain the eighth codeword.

[0311] Step 1804: The first type of terminal performs a soft merge of the seventh codeword and the eighth codeword to obtain the first codeword.

[0312] The meanings of the first codeword / first rate matching method and the second rate matching method can be found in the relevant descriptions in the embodiment of Figure 15, and will not be repeated here.

[0313] Step 1805: The first type of terminal performs polarization decoding on the first codeword to obtain the information bit sequence.

[0314] That is, the first type of terminal performs soft merging of the seventh codeword and the eighth codeword before decoding, thus obtaining decoding gain.

[0315] Based on the above scheme, the second codeword is rate-matched to correspond to the first time-frequency resource, and the third codeword is rate-matched to correspond to the second time-frequency resource. Thus, the first type of terminal can soft-combine the information to be decoded received on the first time-frequency resource and the information to be decoded received on the second time-frequency resource before decoding. This allows simultaneous decoding of the information bits on both the first and second time-frequency resources, thereby capturing the decoding gain brought by soft-combining and helping to ensure the decoding performance of the first type of terminal. Furthermore, the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword). Therefore, the information to be decoded received on the first and second time-frequency resources contains some overlapping information, which helps improve decoding accuracy. Also, since the information to be decoded received on the first and second time-frequency resources corresponds to the same master code (i.e., the first codeword), only one CRC is needed, instead of two different CRCs. Therefore, compared to the embodiment in Figure 13, the CRC overhead is smaller.

[0316] For the second type of terminal, the decoding process is as follows: The second type of terminal acquires the second information on the second time-frequency resource, performs rate matching dematching according to the second rate matching method and the second information, obtains an eighth codeword of length N, and performs polarization decoding on the eighth codeword to obtain the information bit sequence. Based on this scheme, the second type of terminal can independently decode the information to be decoded (i.e., the second information) received on the second time-frequency resource to obtain the corresponding information bits, thus also helping to ensure the decoding performance of the second type of terminal.

[0317] The above mainly describes the solution provided by the embodiments of this application from the perspective of the interaction between the first communication device and the second communication device. It is understood that, in order to achieve the above functions, the first communication device and the second communication device may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0318] In this application embodiment, the first communication device and the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0319] In the case of using integrated units, FIG19 shows a possible exemplary block diagram of the device involved in the embodiments of this application. As shown in FIG19, the device 1900 may include a processing unit 1902 and a communication unit 1903. The processing unit 1902 is used to control and manage the operation of the device 1900. The communication unit 1903 is used to support communication between the device 1900 and other devices. Optionally, the communication unit 1903 is also called a transceiver unit, and may include a receiving unit and / or a sending unit, respectively used to perform receiving and sending operations. The device 1900 may also include a storage unit 1901 for storing the program code and / or data of the device 1900.

[0320] The device 1900 can be the first communication device in the above embodiments. The processing unit 1902 can support the device 1900 in performing the operations of the first communication device in the above method embodiments. Alternatively, the processing unit 1902 mainly performs the internal operations of the first communication device in the method embodiments, and the communication unit 1903 can support communication between the device 1900 and other devices.

[0321] For example, in one embodiment, the processing unit 1902 is configured to acquire an information bit sequence, the information bit sequence including a first bit sequence and a second bit sequence; perform a first polarization encoding on the first bit sequence to obtain a first codeword of length N1, where N1 is the length of the parent code sequence of the first polarization encoding; perform a second polarization encoding on the second bit sequence to obtain a second codeword of length N2, where N2 is the length of the parent code sequence of the second polarization encoding; obtain a third codeword of length N3 based on the first codeword and the second codeword, where N3 is equal to either N1 or N2; and perform a first rate matching method. A fourth codeword is obtained by rate matching with the third codeword; a fifth codeword is obtained by rate matching with the second codeword according to the second rate matching method; a communication unit 1903 is used to send a sixth codeword through a first time-frequency resource and a second time-frequency resource, the sixth codeword including the fourth codeword and the fifth codeword, the fourth codeword corresponding to the first time-frequency resource, and the fifth codeword corresponding to the second time-frequency resource; wherein, the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

[0322] For example, in another embodiment, processing unit 1902 is used to polarize the information bit sequence to obtain a first codeword of length N, where N is the length of the polarized encoded parent code sequence; to perform rate matching with the first codeword according to a first rate matching method to obtain a second codeword; to perform rate matching with the first codeword according to a second rate matching method to obtain a third codeword; communication unit 1903 is used to send a fourth codeword through a first time-frequency resource and a second time-frequency resource, the fourth codeword including the second codeword and the third codeword, the second codeword corresponding to the first time-frequency resource, and the third codeword corresponding to the second time-frequency resource; wherein, the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

[0323] The device 1900 can be the second communication device in the above embodiments. The processing unit 1902 can support the device 1900 in performing the operations of the second communication device in the above method embodiments. Alternatively, the processing unit 1902 mainly performs the internal operations of the second communication device in the method embodiments, and the communication unit 1903 can support communication between the device 1900 and other devices.

[0324] For example, in one embodiment, the communication unit 1903 is used to acquire information to be decoded; wherein, the information to be decoded includes first information and second information, the first information corresponds to a fourth codeword, the fourth codeword is obtained by rate matching according to a first rate matching method and a third codeword of length N3, the second information corresponds to a fifth codeword, the fifth codeword is obtained by rate matching according to a second rate matching method and a second codeword of length N2, the third codeword is obtained according to a first codeword of length N1 and the second codeword, the first codeword is obtained by performing a first polarization encoding on a first bit sequence in the information bit sequence, the second codeword is obtained by performing a second polarization encoding on a second bit sequence in the information bit sequence, N1 is the length of the parent code sequence of the first polarization encoding, and N2 is the length of the parent code sequence of the first polarization encoding. The length of the mother code sequence of the second polarization encoding is N3, which is equal to N1 or N2; the fourth codeword corresponds to the first time-frequency resource, and the fifth codeword corresponds to the second time-frequency resource; wherein the first time-frequency resource and the second time-frequency resource correspond to the first type of terminal, and the second time-frequency resource corresponds to the second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal; the processing unit 1902 is used to perform de-rate matching according to the first rate matching method and the first information to obtain the third codeword; perform de-rate matching according to the second rate matching method and the second information to obtain the second codeword; determine the first codeword according to the third codeword and the second codeword; and perform polarization decoding on the first codeword and the second codeword to obtain the information bit sequence.

[0325] For example, in another embodiment, the communication unit 1903 is used to acquire information to be decoded, the information to be decoded including first information and second information, the first information corresponding to a second codeword, the second information corresponding to a third codeword, the second codeword being obtained by rate matching according to a first rate matching method and a first codeword of length N, the third codeword being obtained by rate matching according to a second rate matching method and the first codeword, the first codeword being obtained by polar coding of an information bit sequence, where N is the length of the polar-coded parent code sequence; the second codeword corresponding to a first time-frequency resource, and the third codeword corresponding to a second time-frequency resource. Source; wherein, the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal; processing unit 1902 is used to perform de-rate matching on the first information according to the first rate matching method to obtain the seventh codeword of the N length; perform de-rate matching on the second information according to the second rate matching method to obtain the eighth codeword of the N length; perform soft merging on the seventh codeword and the eighth codeword to obtain the first codeword; and perform polarization decoding on the first codeword to obtain the information bit sequence.

[0326] It should be understood that the division of units in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, all units in the device can be implemented entirely through software calls from processing elements; all units can be implemented entirely in hardware; or some units can be implemented through software calls from processing elements, and some units can be implemented in hardware. For example, each unit can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as a program in memory, called and executed by a processing element of the device. Moreover, these units can be fully or partially integrated together, or implemented independently. The processing element mentioned here can also be called a processor, which can be an integrated circuit with signal processing capabilities. In the implementation process, the operations of the above methods or the various units mentioned above can be implemented through integrated logic circuits in the processor element or through software calls from processing elements.

[0327] In one example, a unit in any of the above devices can be one or more integrated circuits configured to implement the methods described above, such as: one or more application-specific integrated circuits (ASICs), or one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these forms of integrated circuits. As another example, when a unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a processor, such as a general-purpose central processing unit (CPU), or other processor capable of calling programs. Furthermore, these units can be integrated together and implemented as a System-on-a-Chip (SoC).

[0328] The receiving unit described above is an interface circuit of the device, used to receive signals from other devices. For example, when the device is implemented as a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The transmitting unit described above is an interface circuit of the device, used to transmit signals to other devices. For example, when the device is implemented as a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.

[0329] Based on the same technical concept, this application also provides a communication device for implementing the functions of the first or second communication device described above. As shown in FIG20, the device may be a communication equipment or a component within a communication equipment (e.g., a processor, chip, or chip system). The device includes a processor 2001 and a communication interface 2002, and optionally, a memory 2003. The memory 2003 may be independent of the processor 2001 or integrated into the processor 2001; no specific limitation is made. It is understood that FIG20 only shows the main components of the communication device. In one possible implementation, the communication device may further include an input / output device (not shown in the figure).

[0330] The processor 2001 is used to execute the program code stored in the memory 2003, specifically to perform the actions of the aforementioned processing unit 1902, which will not be described in detail here. The communication interface 2002 is specifically used to perform the actions of the aforementioned communication unit 1903, which will not be described in detail here.

[0331] Processor 2001 can be a CPU, a digital processing unit, etc. Processor 2001 can be used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data, such as, but not limited to, baseband-related processing. Communication interface 2002 can be used for transmitting and receiving signals, such as, but not limited to, radio frequency transceiver. The above devices can be disposed on separate chips, or at least partially or entirely on the same chip. For example, processor 2001 can be further divided into an analog baseband processor and a digital baseband processor. The analog baseband processor can be integrated with the transceiver on the same chip, while the digital baseband processor can be disposed on a separate chip. With the continuous development of integrated circuit technology, more and more devices can be integrated on the same chip. For example, a digital baseband processor can be integrated with multiple application processors (such as, but not limited to, graphics processors, multimedia processors, etc.) on the same chip. Such a chip can be called a system-on-a-chip (SoC). Whether to dispose of individual devices independently on different chips or integrate them on one or more chips often depends on the specific needs of the product design. The embodiments of this application do not limit the specific implementation of the above-mentioned devices.

[0332] The communication interface 2002 can be a transceiver, an interface circuit such as a transceiver circuit, or a transceiver chip, etc. Optionally, the communication interface 2002 may include radio frequency (RF) circuitry and an antenna. The RF circuitry is mainly used for converting baseband signals to RF signals and processing RF signals. The antenna is mainly used for transmitting and receiving RF signals in the form of electromagnetic waves. Optionally, the communication interface 2002 can be an input / output interface or chip pins.

[0333] Input / output devices, such as touchscreens, displays, and keyboards, are primarily used to receive user input data and output data to the user.

[0334] Memory 2003 is used to store the program executed by processor 2001. Memory 2003 can be non-volatile memory, such as a hard disk drive (HDD) or solid-state drive (SSD), or it can be volatile memory, such as cache or random-access memory (RAM). Memory 2003 can be any other medium capable of carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but is not limited to this.

[0335] When the communication device is powered on, the processor 2001 can read the software program in the memory 2003, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 2001 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit processes the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 2001. The processor 2001 converts the baseband signal into data and processes the data.

[0336] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.

[0337] This application embodiment does not limit the specific connection medium between the communication interface 2002, processor 2001, and memory 2003. In Figure 20, the memory 2003, processor 2001, and communication interface 2002 are connected via a bus 2004, which is represented by a thick line in Figure 20. The connection methods between other components are only illustrative and not intended to be limiting. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, only one thick line is used in Figure 20, but this does not indicate that there is only one bus or one type of bus.

[0338] Optionally, the communication device described above can be a standalone device or part of a larger device. For example, the communication device can be:

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

[0340] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;

[0341] (3) Application-specific integrated circuit (ASIC), such as modem;

[0342] (4) Modules that can be embedded in other devices;

[0343] (5) Receivers, smart terminals, wireless devices, handheld devices, mobile units, vehicle-mounted devices, cloud devices, artificial intelligence devices, etc.;

[0344] (6) Others, etc.

[0345] This application provides a chip (or chip system) including a processor for implementing any of the above-described method embodiments.

[0346] This application provides a computer-readable storage medium storing a computer program or instructions that, when executed, implement any of the above-described method embodiments.

[0347] This application provides a computer program product, which includes a computer program or instructions that, when executed, implement any of the above-described method embodiments.

[0348] This application provides a communication system, including a first communication device and a second communication device in the above method embodiments.

[0349] In this application embodiment, "multiple" can refer to two or more. Therefore, in this application embodiment, "multiple" can also be understood as "at least two". "At least one" can be understood as one or more, such as one, two, or more. For example, "including at least one" means including one, two, or more. For example, including at least one of A, B, and C, then it could include A, B, C, A and B, A and C, B and C, or A, B, and C. "And / or" describes the association relationship between related objects. Specifically, there can be three relationships. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / ", unless otherwise specified, generally indicates that the preceding and following related objects have an "or" relationship.

[0350] Furthermore, the terms "system" and "network" in the embodiments of this application can be used interchangeably, as can "according to" and "based on". The ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are generally used to distinguish different objects and are not used to limit the order, sequence, priority, or importance of multiple objects. For example, the first communication device and the second communication device in the embodiments of this application are used to distinguish between two communication devices, and do not limit the priority or importance of these two communication devices.

[0351] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0352] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0353] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0354] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

Claims

1. An encoding method, characterized in that, include: Obtain an information bit sequence, the information bit sequence comprising a first bit sequence and a second bit sequence; The first bit sequence is subjected to first polarization encoding to obtain a first codeword of length N1, where N1 is the length of the parent code sequence of the first polarization encoding. The second bit sequence is subjected to second polarization encoding to obtain a second codeword of length N2, where N2 is the length of the parent code sequence of the second polarization encoding. Based on the first codeword and the second codeword, a third codeword of length N3 is obtained, where N3 is equal to either N1 or N2; A fourth codeword is obtained by performing rate matching based on the first rate matching method and the third codeword; The fifth codeword is obtained by performing rate matching based on the second rate matching method and the second codeword. The sixth codeword is transmitted through the first time-frequency resource and the second time-frequency resource. The sixth codeword includes the fourth codeword and the fifth codeword. The fourth codeword corresponds to the first time-frequency resource, and the fifth codeword corresponds to the second time-frequency resource. Wherein, the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

2. The method as described in claim 1, characterized in that, The length of the second bit sequence is greater than or equal to the length of the first bit sequence.

3. The method as described in claim 1 or 2, characterized in that, When N1 equals N2, the third codeword is obtained by XORing the first codeword and the second codeword; or... When N1 is less than N2, the third codeword is obtained by XORing the seventh codeword of length N2 with the second codeword, where the seventh codeword is determined based on the first codeword; wherein, N3 is equal to N2; or, When N1 is greater than N2, the third codeword is obtained by XORing the eighth codeword of length N1 with the first codeword, and the eighth codeword is determined based on the second codeword; wherein, N3 is equal to N1.

4. The method according to any one of claims 1 to 3, characterized in that, The first rate matching method is repetition or punching, and the second rate matching method is repetition or punching.

5. The method as described in claim 4, characterized in that, N1 equals 512, N2 equals 512, the number of bits of the Physical Broadcast Channel (PBCH) data carried by the first and second time-frequency resources is 432, the first rate matching method is puncturing, and the second rate matching method is puncturing; or... N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first and second time-frequency resources is 432, the first rate matching method is repetition, and the second rate matching method is puncturing; or... N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing; or... N1 equals 512, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing.

6. A decoding method, characterized in that, include: Obtain the information to be decoded; wherein, the information to be decoded includes first information and second information. The first information corresponds to the fourth codeword, which is obtained by rate matching based on the first rate matching method and the third codeword of length N3. The second information corresponds to the fifth codeword, which is obtained by rate matching based on the second rate matching method and the second codeword of length N2. The third codeword is obtained based on the first codeword and the second codeword of length N1. The first codeword is obtained by performing a first polarization encoding on the first bit sequence in the information bit sequence. The second codeword is obtained by performing a second polarization encoding on the second bit sequence in the information bit sequence. N1 is the length of the parent code sequence of the first polarization encoding, N2 is the length of the parent code sequence of the second polarization encoding, and N3 is equal to N1 or N2. The fourth codeword corresponds to the first time-frequency resource, and the fifth codeword corresponds to the second time-frequency resource. The first time-frequency resource and the second time-frequency resource correspond to the first type of terminal, and the second time-frequency resource corresponds to the second type of terminal. The bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal. De-rate matching is performed based on the first rate matching method and the first information to obtain the third codeword; De-rate matching is performed based on the second rate matching method and the second information to obtain the second codeword; The first codeword is determined based on the third codeword and the second codeword; Polarization decoding is performed on the first codeword and the second codeword to obtain the information bit sequence.

7. The method as described in claim 6, characterized in that, The length of the second bit sequence is greater than or equal to the length of the first bit sequence.

8. The method as described in claim 6 or 7, characterized in that, When N1 equals N2, the third codeword is obtained by XORing the first codeword and the second codeword; or... When N1 is less than N2, the third codeword is obtained by XORing the seventh codeword of length N2 with the second codeword, where the seventh codeword is determined based on the first codeword; wherein, N3 is equal to N2; or, When N1 is greater than N2, the third codeword is obtained by XORing the eighth codeword of length N1 with the first codeword, and the eighth codeword is determined based on the second codeword; wherein, N3 is equal to N1.

9. The method according to any one of claims 6 to 8, characterized in that, The first rate matching method is repetition or punching, and the second rate matching method is repetition or punching.

10. The method as described in claim 9, characterized in that, N1 equals 512, N2 equals 512, the number of bits of the Physical Broadcast Channel (PBCH) data carried by the first and second time-frequency resources is 432, the first rate matching method is puncturing, and the second rate matching method is puncturing; or... N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first and second time-frequency resources is 432, the first rate matching method is repetition, and the second rate matching method is puncturing; or... N1 equals 256, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing; or... N1 equals 512, N2 equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the first rate matching method is repetition, and the second rate matching method is puncturing.

11. An encoding method, characterized in that, include: The information bit sequence is polar encoded to obtain a first codeword of length N, where N is the length of the parent code sequence of the polar encoding. The second codeword is obtained by rate matching based on the first rate matching method and the first codeword; A third codeword is obtained by performing rate matching between the second rate matching method and the first codeword; A fourth codeword is transmitted through a first time-frequency resource and a second time-frequency resource. The fourth codeword includes the second codeword and the third codeword. The second codeword corresponds to the first time-frequency resource, and the third codeword corresponds to the second time-frequency resource. Wherein, the first time-frequency resource and the second time-frequency resource correspond to a first type of terminal, the second time-frequency resource corresponds to a second type of terminal, and the bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal.

12. The method as described in claim 11, characterized in that, The first rate matching method is repetition, and the second codeword is composed of the first codeword and the fifth codeword, wherein the fifth codeword is a proper subset of the first codeword; The second rate matching method is puncturing, and the third codeword is a proper subset of the first codeword.

13. The method as described in claim 12, characterized in that, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the third codeword is bits 81 to 512 of the first codeword, and the fifth codeword is bits 1 to 28 of the first codeword.

14. The method as described in claim 11, characterized in that, The first rate matching method is repetition, and the second codeword is composed of the third codeword and the sixth codeword, wherein the third codeword is a proper subset of the first codeword, and the sixth codeword is a proper subset of the third codeword; The second rate matching method is punching.

15. The method as described in claim 14, characterized in that, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the length of the first codeword is 512, the third codeword is bits 81 to 512 of the first codeword, and the sixth codeword is bits 81 to 188 of the first codeword.

16. A decoding method, characterized in that, include: Obtain the information to be decoded, which includes first information and second information. The first information corresponds to a second codeword, and the second information corresponds to a third codeword. The second codeword is obtained by rate matching based on a first rate matching method and a first codeword of length N. The third codeword is obtained by rate matching based on a second rate matching method and the first codeword. The first codeword is obtained by polar encoding an information bit sequence, where N is the length of the parent code sequence of the polar encoding. The second codeword corresponds to a first time-frequency resource, and the third codeword corresponds to a second time-frequency resource. The first and second time-frequency resources correspond to a first type of terminal, and the second time-frequency resource corresponds to a second type of terminal. The bandwidth supported by the first type of terminal is greater than the bandwidth supported by the second type of terminal. According to the first rate matching method, the first information is de-rate matched to obtain the seventh codeword of length N; According to the second rate matching method, the second information is de-rate matched to obtain the eighth codeword of length N; The seventh codeword and the eighth codeword are softly merged to obtain the first codeword; The first codeword is polarized decoded to obtain the information bit sequence.

17. The method as described in claim 16, characterized in that, The first rate matching method is repetition, and the second codeword is composed of the first codeword and the fifth codeword, wherein the fifth codeword is a proper subset of the first codeword; The second rate matching method is puncturing, and the third codeword is a proper subset of the first codeword.

18. The method as described in claim 17, characterized in that, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the third codeword is bits 81 to 512 of the first codeword, and the fifth codeword is bits 1 to 28 of the first codeword.

19. The method as described in claim 16, characterized in that, The first rate matching method is repetition, and the second codeword is composed of the third codeword and the sixth codeword, wherein the third codeword is a proper subset of the first codeword, and the sixth codeword is a proper subset of the third codeword; The second rate matching method is punching.

20. The method as described in claim 19, characterized in that, N equals 512, the number of bits of PBCH data carried by the first time-frequency resource is 540, the number of bits of PBCH data carried by the second time-frequency resource is 432, the length of the first codeword is 512, the third codeword is bits 81 to 512 of the first codeword, and the sixth codeword is bits 81 to 188 of the first codeword.

21. A communication device, characterized in that, The device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and implement the method of any one of claims 1 to 5, or the method of any one of claims 6 to 10, or the method of any one of claims 11 to 15, or the method of any one of claims 16 to 20.

22. The apparatus as claimed in claim 21, characterized in that, The communication device further includes a memory for storing computer programs or instructions, which, when executed by the processor, implement the method of any one of claims 1 to 5, or the method of any one of claims 6 to 10, or the method of any one of claims 11 to 15, or the method of any one of claims 16 to 20.

23. A computer program product, characterized in that, The computer program product includes instructions that, when executed, implement the method of any one of claims 1 to 5, or the method of any one of claims 6 to 10, or the method of any one of claims 11 to 15, or the method of any one of claims 16 to 20.

24. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions that, when executed, implement the method of any one of claims 1 to 5, or the method of any one of claims 6 to 10, or the method of any one of claims 11 to 15, or the method of any one of claims 16 to 20.

25. A chip, characterized in that, The chip includes a processor, which is configured to implement the method of any one of claims 1 to 5, or the method of any one of claims 6 to 10, or the method of any one of claims 11 to 15, or the method of any one of claims 16 to 20.

26. A communication system, characterized in that, It includes a first communication device and a second communication device; the first communication device is used to implement the method according to any one of claims 1 to 5, and the second communication device is used to implement the method according to any one of claims 6 to 10.

27. A communication system, characterized in that, It includes a first communication device and a second communication device; the first communication device is used to implement the method according to any one of claims 11 to 15, and the second communication device is used to implement the method according to any one of claims 16 to 20.

28. A communication device, characterized in that, It includes units or modules that implement the method of any one of claims 1 to 5, or units or modules that implement the method of any one of claims 6 to 10, or units or modules that implement the method of any one of claims 11 to 15, or units or modules that implement the method of any one of claims 16 to 20.

Images