Coding method, decoding method and apparatus

Abstract

The present application provides a coding method, a decoding method and an apparatus. The coding method comprises: acquiring a first sequence, the first sequence being a bit sequence to be coded, and the length of the first sequence being K; on the basis of K, determining a mother code sequence corresponding to the first sequence; and on the basis of the mother code sequence, performing polar coding on check bits and the first sequence, wherein the check bits comprise first check bits and second check bits, and the check bits are determined in the following manner: according to a first corresponding relationship, determining the number of the first check bits corresponding to the first sequence to be equation (I), the first corresponding relationship comprising a corresponding relationship between K and the first check bits; on the basis of reliability and row weights, determining that positions the number of which is equation (II) in the mother code sequence are used for placing the first sequence and the first check bits; determining the positions of the second check bits in the mother code sequence; and on the basis of the positions the number of which is equation (III), the positions of the second check bits, a target parity check (PC) equation and the first sequence, determining check bits.

Description

A coding and decoding method and device

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of the People's Republic of China on November 15, 2023, with application number 202311535065.1 and application name "A coding and decoding method and device", the entire contents of which are incorporated by reference into this application. Technical Field

[0003] The present application relates to the field of wireless communication technology, and in particular to a coding and decoding method and device. Background Art

[0004] Communication systems often use channel coding to improve data transmission reliability and ensure communication quality. A signal, channel-coded at the transmitting device, is transmitted over a channel to the receiving device. The receiving device then performs channel decoding on the received signal to recover the original signal.

[0005] Polar codes were selected as the control channel coding scheme in the fifth-generation (5G) standard. Polar codes are a known channel coding scheme that has been rigorously proven to achieve channel capacity, offering high performance and low complexity. These characteristics give Polar codes great potential for development and application in the communications field. However, the rapid evolution of wireless communication systems, such as new radio (NR) systems, has placed higher demands on the performance of Polar codes.

[0006] Summary of the Invention

[0007] The present application provides a coding and decoding method and apparatus to provide a polar coding and decoding solution to improve the performance of Polar codes.

[0008] In a first aspect, an embodiment of the present application provides a coding method, which can be performed by a first communication device or a module (such as a chip, a chip system, or a circuit, etc.) applied to the first communication device. Taking the first communication device performing the method as an example, the method includes: obtaining a first sequence, where the first sequence is a bit sequence to be encoded, and the length of the first sequence is K; determining a mother code sequence corresponding to the first sequence based on K; performing polarization coding on the check bits and the first sequence based on the mother code sequence; the check bits include a first check bit and a second check bit; wherein the check bits are determined in the following manner: determining the number of first check bits corresponding to the first sequence based on the first corresponding relationship The first correspondence relationship includes the correspondence relationship between K and the first check bit; according to the reliability and row weight, the mother code sequence is determined Positions are used to place the first sequence and the first check bit; determine the second check bit position in the mother code sequence; according to The parity bit is determined by the first position, the second parity bit position, the target parity check PC equation and the first sequence.

[0009] By using the above method, when determining the check bit, the first communication device can determine the number of the first check bits according to the first corresponding relationship, and determine the first check bit from the mother code sequence. Positions for placing the first sequence and the first parity bit, and determining the position of the second parity bit in the mother code sequence, can flexibly generate parity bits of appropriate length to improve the performance of Polar code-based communication. Furthermore, the first communications device determines the positions of the information bits and the first parity bit of the first sequence from the mother code sequence based on reliability and row weight, further improving the code spectrum and enhancing error correction performance.

[0010] In one possible design, the method further includes: the first communication device determining a target PC equation based on a second correspondence; wherein the second correspondence includes a correspondence between K and an indicator parameter of the target PC equation. Through this method, the first communication device can flexibly generate a target PC equation that adapts to the length of the bit sequence to be encoded.

[0011] In one possible design, the first correspondence also includes a correspondence between a target transmission code length E and a first parity bit, where E is the transmission code length after rate matching of the encoded sequence. The second correspondence also includes a correspondence between E and an indicator parameter of a target PC equation. Through the above method, the first communication device can flexibly generate a number of first parity bits that is compatible with the length of the bit sequence to be encoded and the transmission code length, as well as a target PC equation that is compatible with the length of the bit sequence to be encoded and the transmission code length.

[0012] In one possible design, the number of first check bits corresponding to K and E is less than or equal to EK, and / or the number of valid check bits corresponding to K and E is less than or equal to a set threshold.

[0013] In one possible design, the first correspondence includes a correspondence between multiple message lengths, multiple transmission code lengths, and the number of first parity bits; the multiple message lengths include K, and the multiple transmission code lengths include E. Through the above method, the first communication device can flexibly determine the number of first parity bits that is compatible with the length of the bit sequence to be encoded and the transmission code length based on the first correspondence including the multiple message lengths, multiple transmission code lengths, and the number of first parity bits.

[0014] In one possible design, the second correspondence includes correspondences between multiple message lengths, multiple transmission code lengths, and indicative parameters of the PC equation; the multiple message lengths include K, and the multiple transmission code lengths include E. Through the above method, the first communication device can flexibly determine the indicative parameters of the target PC equation that are compatible with the length of the bit sequence to be encoded and the transmission code length from the first correspondences including the multiple message lengths, multiple transmission code lengths, and the indicative parameters of the PC equation.

[0015] In one possible design, in a first correspondence, for message lengths within a first length range, the number of first check bits corresponding to the same message length is the same; and in a second correspondence, for message lengths within the first length range, the indicating parameters of the PC equation corresponding to the same message length are the same. With the above method, since the first correspondence and the second correspondence have the same number of first check bits and indicating parameters of the PC equation, the amount of data stored in the first correspondence and the second correspondence can be reduced, and the complexity of describing the first correspondence and the second correspondence can be reduced.

[0016] In one possible design, in the first corresponding relationship, different message lengths within the first length range correspond to different numbers of first check bits; and / or, in the second corresponding relationship, different message lengths within the first length range correspond to different indication parameters of the PC equation.

[0017] In one possible design, in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0018] In one possible design, in the first correspondence, for the message length within the second length range, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, in the second correspondence, for the message length within the second length range, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0019] In one possible design, in the first corresponding relationship, for the message length within the second length range, when the message length is the same and the transmission code length belongs to the same code length range, the corresponding number of first check bits is the same; in the second corresponding relationship, for the message length within the second length range, when the message length is the same and the transmission code length belongs to the same code length range, the corresponding indication parameters of the PC equation are the same.

[0020] Through the above-mentioned various designs, the correspondence between the message length, the transmission code length and the number of the first check bits, as well as the correspondence between the message length, the transmission code length and the indicator parameters of the PC equation can be flexibly configured, so that it can be applied to different scenarios, and the corresponding first correspondence and second correspondence can be configured in different scenarios.

[0021] In one possible design, the first threshold value of the first length range is 3, and the second threshold value of the first length range is 6.

[0022] In one possible design, the first threshold value of the second length range is 7, and the second threshold value of the first length range is 11.

[0023] In one possible design, the first communication device determines the set threshold corresponding to the number of valid check bits based on K, E, and a third corresponding relationship; the third corresponding relationship includes the correspondence between K, E and the set threshold corresponding to the number of valid check bits.

[0024] In one possible design, the first correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and the number of first check bits;

[0025] Where k represents the message length and e represents the transmission code length.

[0026] In one possible design, the second correspondence includes at least one correspondence in the following table, each correspondence being a correspondence between a k, an e, and an indicator parameter of a PC equation;

[0027] Where k represents the message length and e represents the transmission code length.

[0028] In one possible design, the first correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and the number of first check bits;

[0029] Where k represents the message length and e represents the transmission code length.

[0030] In one possible design, the second correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and the number of first check bits;

[0031] Where k represents the message length and e represents the transmission code length.

[0032] In one possible design, the third correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and a set threshold corresponding to the number of valid check bits;

[0033] Where k represents the message length and e represents the transmission code length.

[0034] In one possible design, the third correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and a set threshold corresponding to the number of valid check bits;

[0035] Where k represents the message length and e represents the transmission code length.

[0036] In a second aspect, an embodiment of the present application provides a decoding method, which can be performed by a second communication device or a module (such as a chip, a chip system, or a circuit, etc.) applied to the second communication device. Taking the second communication device performing the method as an example, the method includes: obtaining a second sequence, the second sequence being the sequence to be decoded, obtaining the length K of the first sequence; determining the mother code sequence corresponding to the first sequence based on K; determining the number of first check bits corresponding to the first sequence based on the first correspondence relationship. The first correspondence relationship includes the correspondence relationship between K and the first check bit; according to the reliability and row weight, the mother code sequence is determined positions, Positions are used to place the first sequence and the first check bit; determine the second check bit position in the mother code sequence; according to The second sequence is decoded by using the first parity bit position, the second parity bit position, and the target parity check PC equation to obtain the parity bits and the information bits in the first sequence; the parity bits include the first parity bit and the second parity bit.

[0037] By using the above method, when determining the check bit, the second communication device can determine the number of the first check bits according to the first corresponding relationship, and determine the first check bit from the mother code sequence. Positions for placing the first sequence and the first parity bit, as well as determining the position of the second parity bit in the mother code sequence, allow for flexible generation of parity bits of appropriate length, improving the performance of Polar code-based communications. Furthermore, the second communication device determines the positions of the first sequence's information bits and the first parity bit from the mother code sequence based on reliability and row weight, further improving the code spectrum and enhancing error correction performance.

[0038] In one possible design, the method further includes: the first communication device determining a target PC equation based on a second correspondence; wherein the second correspondence includes a correspondence between K and an indicator parameter of the target PC equation. Through this method, the first communication device can flexibly generate a target PC equation that adapts to the length of the bit sequence to be encoded.

[0039] In one possible design, the first correspondence also includes a correspondence between a target transmission code length E and a first parity bit, where E is the transmission code length after rate matching of the encoded sequence. The second correspondence also includes a correspondence between E and an indicator parameter of a target PC equation. Through the above method, the first communication device can flexibly generate a number of first parity bits that is compatible with the length of the bit sequence to be encoded and the transmission code length, as well as a target PC equation that is compatible with the length of the bit sequence to be encoded and the transmission code length.

[0040] In one possible design, the number of first check bits corresponding to K and E is less than or equal to EK, and / or the number of valid check bits corresponding to K and E is less than or equal to a set threshold.

[0041] In one possible design, the first correspondence includes a correspondence between multiple message lengths, multiple transmission code lengths, and the number of first parity bits; the multiple message lengths include K, and the multiple transmission code lengths include E. Through the above method, the first communication device can flexibly determine the number of first parity bits that is compatible with the length of the bit sequence to be encoded and the transmission code length based on the first correspondence including the multiple message lengths, multiple transmission code lengths, and the number of first parity bits.

[0042] In one possible design, the second correspondence includes correspondences between multiple message lengths, multiple transmission code lengths, and indicative parameters of the PC equation; the multiple message lengths include K, and the multiple transmission code lengths include E. Through the above method, the first communication device can flexibly determine the indicative parameters of the target PC equation that are compatible with the length of the bit sequence to be encoded and the transmission code length from the first correspondences including the multiple message lengths, multiple transmission code lengths, and the indicative parameters of the PC equation.

[0043] In one possible design, in a first correspondence, for message lengths within a first length range, the number of first check bits corresponding to the same message length is the same; and in a second correspondence, for message lengths within the first length range, the indicating parameters of the PC equation corresponding to the same message length are the same. With the above method, since the first correspondence and the second correspondence have the same number of first check bits and indicating parameters of the PC equation, the amount of data stored in the first correspondence and the second correspondence can be reduced, and the complexity of describing the first correspondence and the second correspondence can be reduced.

[0044] In one possible design, in the first corresponding relationship, different message lengths within the first length range correspond to different numbers of first check bits; and / or, in the second corresponding relationship, different message lengths within the first length range correspond to different indication parameters of the PC equation.

[0045] In one possible design, in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0046] In one possible design, in the first correspondence, for the message length within the second length range, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, in the second correspondence, for the message length within the second length range, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0047] In one possible design, in the first corresponding relationship, for the message length within the second length range, when the message length is the same and the transmission code length belongs to the same code length range, the corresponding number of first check bits is the same; in the second corresponding relationship, for the message length within the second length range, when the message length is the same and the transmission code length belongs to the same code length range, the corresponding indication parameters of the PC equation are the same.

[0048] Through the above-mentioned various designs, the correspondence between the message length, the transmission code length and the number of the first check bits, as well as the correspondence between the message length, the transmission code length and the indicator parameters of the PC equation can be flexibly configured, so that it can be applied to different scenarios, and the corresponding first correspondence and second correspondence can be configured in different scenarios.

[0049] In one possible design, the first threshold value of the first length range is 3, and the second threshold value of the first length range is 6.

[0050] In one possible design, the first threshold value of the second length range is 7, and the second threshold value of the first length range is 11.

[0051] In one possible design, the first communication device determines the set threshold corresponding to the number of valid check bits based on K, E, and a third corresponding relationship; the third corresponding relationship includes the correspondence between K, E and the set threshold corresponding to the number of valid check bits.

[0052] In one possible design, the first correspondence includes at least one correspondence in the following table, each correspondence being a correspondence between a k, an e, and an indicator parameter of a PC equation;

[0053] Where k represents the message length and e represents the transmission code length.

[0054] In one possible design, the second correspondence includes at least one correspondence in the following table, each correspondence being a correspondence between a k, an e, and an indicator parameter of a PC equation;

[0055] Where k represents the message length and e represents the transmission code length.

[0056] In one possible design, the first correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and the number of first check bits;

[0057] Where k represents the message length and e represents the transmission code length.

[0058] In one possible design, the second correspondence includes at least one correspondence in the following table, each correspondence being a correspondence between a k, an e, and an indicator parameter of a PC equation;

[0059] Where k represents the message length and e represents the transmission code length.

[0060] In one possible design, the third correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and a set threshold corresponding to the number of valid check bits;

[0061] Where k represents the message length and e represents the transmission code length.

[0062] In one possible design, the third correspondence includes at least one correspondence in the following table, where each correspondence is a correspondence between a k, an e, and a set threshold corresponding to the number of valid check bits;

[0063] Where k represents the message length and e represents the transmission code length.

[0064] In a third aspect, a communication device is provided, which may be the aforementioned first or second communication device. The communication device may include a communication unit and a processing unit to perform the aforementioned first or second aspect, or any possible implementation of the first or second aspect. The communication unit is configured to perform transceiver operations, such as functions related to sending and receiving; the communication unit may be referred to as a transceiver unit; optionally, the communication unit includes a receiving unit and a sending unit. The processing unit is configured to perform processing operations.

[0065] In one design, the communication device is a communication chip, the processing unit may be one or more processors or processor cores, and the communication unit may be an input / output circuit, an input / output interface, or an antenna port of the communication chip.

[0066] In another design, the communication unit may be a transmitter and a receiver, or the communication unit may be a transmitter and a receiver.

[0067] Optionally, the communication device further includes modules that can be used to execute the first aspect or the second aspect, or execute any possible implementation of the first aspect or the second aspect.

[0068] In a fourth aspect, a communication device is provided, which may be the aforementioned first communication device or second communication device. The communication device may include a processor and a memory to execute the aforementioned first or second aspect, or any possible implementation of the first or second aspect. Optionally, it further includes a transceiver, the memory is used to store a computer program or instruction, and the processor is used to call and run the computer program or instruction from the memory. When the processor executes the computer program or instruction in the memory, the communication device executes the aforementioned first or second aspect, or any possible implementation of the first or second aspect.

[0069] Optionally, there are one or more processors and one or more memories.

[0070] Optionally, the memory may be integrated with the processor, or the memory may be provided separately from the processor.

[0071] Optionally, the transceiver may include a transmitter (transmitter) and a receiver (receiver).

[0072] In a fifth aspect, a communication device is provided. This communication device may be the aforementioned first communication device or the aforementioned second communication device. The communication device may include a processor to execute the aforementioned first or second aspect, or any possible implementation of the first or second aspect. The processor is coupled to a memory. Optionally, the communication device also includes a memory. Optionally, the communication device also includes a communication interface, and the processor is coupled to the communication interface.

[0073] In one implementation, when the communication device is the first communication device or the second communication device, the communication interface may be a transceiver or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0074] In another implementation, when the communication device is a chip or a chip system, the communication interface may be an input / output interface, an interface circuit, an output circuit, an input circuit, a pin, or related circuits on the chip or chip system. The processor may also be embodied as a processing circuit or a logic circuit.

[0075] In a sixth aspect, a computer-readable storage medium is provided, in which a computer program or instruction is stored. When the computer program or instruction is executed by a processor, the above-mentioned first aspect or second aspect, or any possible implementation method thereof, is implemented.

[0076] In a seventh aspect, a computer program product storing instructions is provided, which, when executed by a processor, implements the above-mentioned first aspect or second aspect, or any possible implementation manner thereof.

[0077] In an eighth aspect, a communication device is provided, comprising a processor and a storage medium storing instructions that, when executed by the processor, implement the first or second aspect described above, or any possible implementation thereof. The communication device may be a system-on-a-chip. The system-on-a-chip may consist of a chip or may include a chip and other discrete components.

[0078] In a ninth aspect, a communication system is provided, which includes the first communication device described in the first aspect and the second communication device described in the second aspect.

[0079] In the tenth aspect, the present application also provides a chip, including a processor, which is coupled to a memory and is used to read and execute program instructions stored in the memory so that the chip can implement the above-mentioned first aspect or second aspect, or any possible implementation method thereof.

[0080] For each of the above-mentioned aspects from the third to the tenth aspect and the technical effects that may be achieved by each aspect, please refer to the above-mentioned description of the technical effects that can be achieved by various possible solutions in the first aspect, any aspect, or each aspect, and no further details will be given here. BRIEF DESCRIPTION OF THE DRAWINGS

[0081] FIG1 is a schematic diagram of a communication system architecture provided by an embodiment of the present application;

[0082] FIG2 is a schematic diagram of an encoding and decoding process provided in an embodiment of the present application;

[0083] FIG3 is a schematic diagram of a flow chart of an encoding method provided in an embodiment of the present application;

[0084] FIG4 is a schematic diagram of a flow chart of determining the positions of parity bits and information bits in a mother code sequence according to an embodiment of the present application;

[0085] FIG5 is a schematic diagram of a flowchart of a decoding method provided in an embodiment of the present application;

[0086] FIG6 is a schematic diagram of a shift register provided in an embodiment of the present application;

[0087] FIG7 is a schematic diagram of a shift register provided in an embodiment of the present application;

[0088] FIG8 is a schematic diagram of transmission performance provided by an embodiment of the present application;

[0089] FIG9 is a schematic diagram of a shift register provided in an embodiment of the present application;

[0090] FIG10 is a schematic diagram of a mother code sequence provided in an embodiment of the present application;

[0091] FIG11 is a schematic diagram of a mother code sequence provided in an embodiment of the present application;

[0092] FIG12 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0093] FIG13 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0094] FIG14 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0095] The technical solutions of the embodiments of the present application can be applied to various communication systems, such as: global system for mobile communications (GSM), enhanced data rate for GSM evolution (EDGE), wideband code division multiple access (WCDMA), time division-synchronization code division multiple access (TD-SCDMA), long term evolution (LTE), world-wide interoperability for microwave access (WiMAX), fifth generation (5G) mobile communication systems, such as new radio (NR) systems, etc. The technical solutions provided in the present application can also be applied to future communication systems, such as sixth generation (6G) mobile communication systems, etc. The communication system can also be a Bluetooth communication system, a wireless local area network (WLAN) / wireless communication technology (WiFi) communication system, a narrowband Internet of Things (NB-IoT) communication system, etc. The technical solutions of the embodiments of the present application may also be applied to satellite communication systems, wherein the satellite communication systems may be integrated with the above-mentioned communication systems.

[0096] To facilitate understanding of the embodiments of the present application, the application scenarios used in the present application are described using the communication system architecture shown in Figure 1 as an example. Referring to Figure 1, the communication system includes a network device 101 and a terminal device 102. The communication apparatus provided in the embodiments of the present application can be applied to the network device 101 or to the terminal device 102. It will be understood that Figure 1 only illustrates one possible communication system architecture that can be applied in the embodiments of the present application. In other possible scenarios, the communication system architecture may also include other devices.

[0097] The network device 101 is a node in a radio access network (RAN), and may be referred to as an access network device, a RAN node, or the like. Optionally, the RAN may be a 3GPP-related cellular system, such as a 4G mobile communication system (such as an LTE system), a 5G mobile communication system (such as an NR system), or a future-oriented evolution system (such as a 6G mobile communication system). The RAN may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The RAN may also be a communication system that integrates two or more of the above systems.

[0098] In one possible scenario, the access network device may be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a next generation base station in a sixth generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system. The access network device may also be a macro base station, a micro base station or an indoor station, a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the access network device may also be a server, a wearable device, a vehicle or an onboard device. For example, the access network device in vehicle to everything (V2X) technology may be a road side unit (RSU).

[0099] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes respectively implement part of the functions of the base station. For example, the RAN node can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be set separately, or they can be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

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

[0101] In the embodiments of the present application, the functions of the network device may be performed by a module (such as a chip) in the network device, or by a control subsystem that includes the network device functions. The control subsystem that includes the network device functions may be a control center in the aforementioned application scenarios such as smart grid, industrial control, smart transportation, and smart city.

[0102] Terminal device 102, also known as user equipment (UE), mobile station (MS), or mobile terminal (MT), provides voice or data connectivity to users and may also be an IoT device. For example, terminal devices include handheld devices and vehicle-mounted devices with wireless connectivity. At present, terminal devices can be: mobile phones, tablet computers, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smart watches, smart bracelets, pedometers, etc.), vehicle-mounted devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed railways, etc.), virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, smart home devices (such as refrigerators, TVs, air conditioners, electric meters, etc.), intelligent robots, workshop equipment, wireless terminals in unmanned driving, wireless terminals in remote surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, flight equipment (such as intelligent robots, hot air balloons, drones, airplanes), etc. The terminal device can also be other devices with terminal functions. For example, the terminal device can also be a device that serves as a terminal function in device-to-device (D2D) communication. In this application, terminal devices with wireless transceiver functions and chips that can be set in the aforementioned terminal devices are collectively referred to as terminal devices.

[0103] In the embodiment of the present application, the functions of the terminal device can also be performed by a module in the terminal (such as a chip or a modem), or by a device that includes terminal functions.

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

[0105] In the embodiments of the present application, "at least one" refers to one or more, and "more" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b and (or) c can represent: a, b, c, a and b, a and c, b and c, or a, b and c, where each of a, b, c can be an element itself, or a set containing one or more elements.

[0106] Throughout this application, the terms "exemplary," "in some embodiments," and "in other embodiments" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described in this application as "exemplary" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of the word "exemplary" is intended to present concepts in a concrete manner.

[0107] In this application, the terms "of," "corresponding," and "relevant" may be used interchangeably. It should be noted that, unless the distinction is emphasized, the meanings they convey are the same. In the embodiments of this application, the terms "communication" and "transmission" may be used interchangeably. It should be noted that, unless the distinction is emphasized, the meanings they convey are the same. For example, "transmission" may include "send" and "receive" and may be either a noun or a verb.

[0108] In this application, "indication" may include direct indication, indirect indication, explicit indication, and implicit indication. When describing that a certain indication information is used to indicate A, it can be understood that the indication information carries A, directly indicates A, or indirectly indicates A.

[0109] It should be pointed out that the words "first", "second", etc. involved in the embodiments of the present application are only used for the purpose of distinguishing the description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order.

[0110] Taking the communication system shown in Figure 1 as an example, to ensure the reliability of communication between devices, the transmitter can encode the information to be transmitted, and accordingly, the receiver decodes the encoded information after receiving it. As shown in the encoding and decoding process in Figure 2, the source signal of the transmitter undergoes source coding, channel coding, rate matching, and modulation in sequence before being transmitted on the channel. After receiving the signal, the receiver undergoes demodulation and rate matching, channel decoding, and source decoding in sequence to obtain the signal destination. Among them, the transmitter and receiver can respectively serve as network devices or terminal devices. It can be understood that in downlink communication, the network device is the transmitter and the terminal device is the receiver; in uplink communication, the terminal device is the transmitter and the network device is the receiver. The network device can be either the transmitter or the receiver. In addition, this application does not exclude the possibility that both the transmitter and the receiver are terminal devices, in which case D2D communication is carried out between the transmitter and the receiver. The method provided in the embodiments of the present application can be used in the channel coding process.

[0111] FIG3 is a flow chart of a coding method. The method can be applied to a first communication device; wherein the first communication device can be the transmitting end in the encoding and decoding process as shown in FIG2; correspondingly, the second communication device can be the receiving end in the encoding and decoding process as shown in FIG2. Exemplarily, when the first communication device is a terminal device or a module in a terminal device (such as a chip), the second communication device can be a terminal device or a module in a terminal device (such as a chip), or the second communication device can also be a network device or a module in a network device (such as a chip); when the first communication device is a network device or a module in a network device (such as a chip), the second communication device can be a module in a terminal device (such as a chip). The method includes:

[0112] Step 300: The first communication device obtains a first sequence.

[0113] The first sequence is a bit sequence to be encoded; optionally, the first sequence includes information bits transmitted between the first communication device and the second communication device. Exemplarily, the information bits may be information bits that have been source-coded.

[0114] Optionally, the length of the first sequence is K; it can be understood that the number of information bits included in the first sequence is K; where K is an integer greater than 0.

[0115] Step 301: A first communications device determines a mother code sequence corresponding to a first sequence according to K.

[0116] The mother code sequence may also be called a reliability sequence. The mother code sequence includes indexes corresponding to N subchannels, and the indexes corresponding to the N subchannels may be sorted in ascending order of reliability. Exemplarily, N is an integer greater than 0.

[0117] The length of the mother code sequence may be a mother code length N. Exemplarily, the mother code length N may be the length of a codeword sequence obtained after encoding a bit sequence to be encoded.

[0118] When determining the mother code sequence, the first communication device may determine the mother code sequence based on the length K of the first sequence, or may determine the mother code sequence based on the length K of the first sequence and a transmission code length E. The transmission code length E may be an actual transmission code length of a codeword sequence transmitted between the first communication device and the second communication device, and E is an integer greater than 0.

[0119] The specific manner in which the first communications apparatus determines the mother code sequence may be implemented through conventional means.

[0120] Step 302: The first communications device performs polarization coding on parity bits and a first sequence according to a mother code sequence; the parity bits include a first parity bit and a second parity bit.

[0121] During polarization coding, the first communication device determines positions of parity bits and information bits in the first sequence in a mother code sequence. The first communication device performs polarization coding on the parity bits and the first sequence based on the positions of the parity bits and the information bits in the first sequence in the mother code sequence.

[0122] The following describes the process of determining the positions of the check bits and information bits in the mother code sequence, as well as the polarization coding process.

[0123] 1. The first communications device determines positions of parity bits and information bits in a mother code sequence.

[0124] The process of the first communication device determining the positions of the check bits and the information bits in the mother code sequence may be as shown in FIG4 , including the following steps:

[0125] Step 400: The first communication device determines the number of first parity bits.

[0126] in, is the number of the first parity bits, is an integer greater than or equal to 0.

[0127] Illustratively, the parity bits in the embodiments of the present application may include two types: a first parity bit and a second parity bit. These two types of parity bits may be divided based on their position in the mother code sequence. For example, the first parity bit may be a parity bit that sacrifices the reliability of the message bit, while the second parity bit may be a parity bit that does not sacrifice the reliability of the message bit. It can be understood that the first parity bit may be located in a position with higher reliability in the mother code sequence. Since the message bit is normally located in a position with higher reliability in the mother code sequence, when the first parity bit is located in a position with higher reliability in the mother code sequence, it will occupy the position of the message bit, thereby sacrificing the reliability of the message bit. The second parity bit may be located in a position with lower reliability in the mother code sequence. Since the message bit is normally located in a position with higher reliability in the mother code sequence, when the second parity bit is located in a position with lower reliability in the mother code sequence, it will not occupy the position of the message bit, thereby not sacrificing the reliability of the message bit.

[0128] Optionally, the first communication device may determine the number of first check bits corresponding to the first sequence according to the first corresponding relationship. The first corresponding relationship includes the length K of the first sequence and the first check bit The corresponding relationship between them.

[0129] Exemplarily, after obtaining the first sequence, the first communication device determines the number of first check bits corresponding to the first sequence based on the first corresponding relationship according to the length K of the first sequence.

[0130] Optionally, the first corresponding relationship in the embodiment of the present application may be pre-generated.

[0131] In possible implementation manner 1, the first correspondence in the embodiment of the present application may include a correspondence between multiple message lengths and the number of first check bits.

[0132] In possible implementation manner 2, the embodiment of the present application may further consider the transmission code length when determining the number of first parity bits, where the transmission code length is the transmission code length after rate matching of the encoded sequence (exemplarily, the transmission code length is the actual transmission code length of the codeword sequence transmitted between the first communication device and the second communication device). In this implementation manner, the first correspondence may include a correspondence between multiple message lengths, multiple transmission code lengths, and the number of first parity bits.

[0133] For the above possible implementation method 1, after obtaining the first sequence, the first communication device determines the number of first check bits corresponding to the first sequence from a first correspondence including multiple message lengths and the number of first check bits according to the length K of the first sequence.

[0134] For the above possible implementation method 2, after obtaining the first sequence, the first communication device determines the target transmission code length E corresponding to the first sequence, and determines the number of first parity bits corresponding to the first sequence from a first correspondence including multiple message lengths, multiple transmission code lengths, and the number of first parity bits based on the length K of the first sequence and the target transmission code length E.

[0135] Step 401: The first communication device determines from the mother code sequence The positions are used to place the information bits and the first check bits in the first sequence.

[0136] The first communication device performs rate matching according to the transmission code length E, punctures or shortens the mother code sequence, and obtains a target sequence after rate matching.

[0137] For example, N=32, E=30, and the mother code sequence is {1, 2, 3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}; for example, for the mother code sequence Puncture is performed, and the sequence after removing the puncture position from the mother code sequence is the target sequence. The target sequence It can be {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}.

[0138] Optionally, the first communication device determines the target sequence with the highest reliability from the target sequence obtained after rate matching the mother code sequence. The positions are used to place the information bits and the first check bits in the first sequence.

[0139] For example, if the target sequence is {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, K=11, The first communication device determines the The positions are {12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}.

[0140] For the convenience of the following description, the first communication device determines the target sequence Locations are marked as collections

[0141] Step 402: The first communication device The position of the information bit and the position of the first check bit are determined in the positions respectively.

[0142] Optionally, the first communication device The set corresponding to the position The row weight, from The position of the first parity bit is determined in the positions.

[0143] Exemplarily, the first communication device determines the set The minimum row weight w min , from the set The reliability is determined in descending order. The weight of each row is equal to w min The position of is used as the first check bit position. Bank of China weight equals w min Less than , then in the set Determine the trip weight equal to w min After the location, continue from the collection In the order of reliability from high to low, the row weight is determined to be equal to 2*w min until the location is determined locations.

[0144] For example, the collection is {12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, gather The minimum row weight w min is 8, then from the set In the order of reliability from high to low, the four positions with a row weight equal to 8 are determined, which are {27, 26, 23, 29}. Then the positions of the first check bits include {27, 26, 23, 29}.

[0145] Accordingly, the first communication device determines the The other positions except the position of the first check bit are used as the positions of the information bits of the first sequence.

[0146] For example, a collection is {12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, the positions of the first parity bits include {27, 26, 23, 29}, and the positions of the information bits of the first sequence include {12, 20, 14, 15, 22, 16, 24, 28, 30, 31, 32}.

[0147] Step 403: The first communications device determines a position of a second check bit from the mother code sequence.

[0148] Optionally, the first communications device may determine a position of the second check bit in the mother code sequence according to a target sequence obtained after performing rate matching on the mother code sequence.

[0149] For example, the first communication device removes the bits in the target sequence used to place the information bits and the first parity bits in the first sequence. The other positions except the first position are used as the positions of the second check bits.

[0150] For example, if the target sequence is {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, the first communication device determines the target sequence from the mother code sequence. The first and second parity bits are {12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, and the positions of the second parity bits include {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25}.

[0151] Step 404: The first communication device determines the position of the check bit according to the position of the first check bit and the position of the second check bit.

[0152] Optionally, the first communication device combines the position of the first check bit and the position of the second check bit to obtain the position of the check bit.

[0153] Exemplarily, the positions of the first check bits include {27, 26, 23, 29}, and the positions of the second check bits include {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25}. In the first communication device, it can be determined that the set DF corresponding to the positions of the check bits is {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 27, 26, 23, 29}.

[0154] In a possible implementation, after determining the set DF corresponding to the parity bit positions based on step 404, the first communication device may further reduce the set DF. Optionally, the first communication device may determine the positions of valid parity bits in the parity bit positions, and form the positions of the valid parity bits into a reduced parity bit position set DF. simplified .

[0155] The valid check bit may be an information bit carried by a sub-channel before the sub-channel carrying the check bit.

[0156] Exemplarily, when determining the position of the valid check bit, the first communication device may use the position of the check bit preceded by the information bit position among the determined check bit positions as the position of the valid check bit.

[0157] Optionally, the first communication device uses the position of the valid check bit in the target sequence as the position of the updated check bit; accordingly, the first communication device can use the positions of the first check bit and the second check bit except the valid check bit as frozen bits.

[0158] For example, the set DF corresponding to the position of the check bits is {3, 4, 5, 6, 7, 8, 9, 17, 10, 18, 11, 19, 13, 21, 25, 27, 26, 23, 29}, and the positions of the information bits of the first sequence include {12, 20, 14, 15, 22, 16, 24, 28, 30, 31, 32}; then the set DF corresponding to the position of the valid check bits is simplified {13, 17, 18, 19, 21, 23, 25, 26, 27, 29}; the check bit position set finally determined by the first communication device may be the set DF simplified .

[0159] 2. The first communication device performs polarization coding on the check bits and the first sequence based on positions of the check bits and the information bits in the first sequence in the mother code sequence.

[0160] After determining positions of the check bits and the information bits in the mother code sequence, the first communication device generates a precoding sequence.

[0161] In the process of generating the precoding sequence, the first communication device generates the precoding sequence according to the mother code sequence. The parity bit is determined by the first position, the second parity bit position, the target PC equation and the first sequence.

[0162] Optionally, the first communication device determines the first check bit and the second check bit respectively according to the position of the information bit in the mother code sequence, the position of the first check bit and the second check bit, the target PC equation, and the information bit in the first sequence.

[0163] The first communication device may determine the target PC equation according to the second corresponding relationship.

[0164] Optionally, the second correspondence includes a correspondence between the length K of the first sequence and an indicative parameter of the target PC equation.

[0165] The first communication device can determine the indicative parameters of the target PC equation corresponding to K from the second corresponding relationship based on the length K of the first sequence, and can determine the target PC equation based on the determined indicative parameters of the target PC equation.

[0166] For example, if the indicator parameter of the target PC equation is 26, its binary representation is [1 1 0 1 0] (where the leftmost bit is the most significant bit); then the corresponding target PC equation is D 4 +D 3 +D 1 .

[0167] Optionally, the second corresponding relationship in the embodiment of the present application may be pre-generated.

[0168] In possible implementation manner 1, the second correspondence in the embodiment of the present application may include correspondences between multiple message lengths and indication parameters of the PC equation.

[0169] In possible implementation manner 2, embodiments of the present application may further consider the transmission code length when determining the indicative parameters of the PC equation, where the transmission code length is the transmission code length after rate matching of the encoded sequence (illustratively, the transmission code length is the actual transmission code length of the codeword sequence transmitted between the first communication device and the second communication device). In this implementation manner, the first correspondence may include correspondences between multiple message lengths, multiple transmission code lengths, and the indicative parameters of the PC equation.

[0170] For the above-mentioned possible implementation method 1, after obtaining the first sequence, the first communication device determines the indication parameters of the target PC equation from a second correspondence including multiple message lengths and indication parameters of the PC equation according to the length K of the first sequence.

[0171] For the above-mentioned possible implementation method 2, after obtaining the first sequence, the first communication device determines the target transmission code length E corresponding to the first sequence, and determines the indicative parameters of the target PC equation from a second correspondence including multiple message lengths, multiple transmission code lengths and indicative parameters of the PC equation based on the length K of the first sequence and the target transmission code length E.

[0172] After determining the parity bits (including the first parity bits and the second parity bits), the first communications device maps the parity bits and information bits of the first sequence to generate a precoding sequence. Exemplarily, the first communications device may perform mapping based on the determined positions of the information bits and the parity bits in the mother code sequence, mapping the information bits to the positions of the information bits in the mother code sequence and mapping the parity bits to the positions of the parity bits in the mother code sequence, thereby generating the precoding sequence.

[0173] After generating a precoding sequence, the first communication device performs polarization coding on the precoding sequence to obtain a coded codeword sequence. Furthermore, the first communication device performs rate matching on the codeword sequence according to a target transmission code length E to obtain a second sequence. The length of the second sequence may be the target transmission code length E.

[0174] Optionally, the first communication device may send the second sequence to the second communication device.

[0175] Based on the same inventive concept as the above-mentioned encoding method, correspondingly, an embodiment of the present application also provides a decoding method, which can be applied to a second communication device; wherein the second communication device can be the receiving end in the encoding and decoding process shown in Figure 2. A flowchart of a decoding method is shown in Figure 5. The method includes:

[0176] Step 500: The second communication device obtains the second sequence and the length K of the first sequence.

[0177] The second sequence is a sequence to be decoded obtained in the second communication device after polarization coding, rate matching, modulation, frequency conversion and other operations are performed on the first sequence sent by the first communication device and the sequence passes through a wireless transmission environment.

[0178] Step 501: The second communication device determines a mother code sequence corresponding to the first sequence according to a length K of the first sequence.

[0179] It should be noted that the manner in which the second communication apparatus determines the mother code sequence corresponding to the first sequence can be found in the above description of step 301 and is not repeated here.

[0180] Step 502: The second communication device determines the number of first parity bits corresponding to the first sequence.

[0181] Optionally, the second communication device determines the number of first check bits corresponding to the first sequence according to the first corresponding relationship. The first corresponding relationship includes a corresponding relationship between the length K of the first sequence and the first check bit.

[0182] It should be noted that the second communication device determines the number of first check bits corresponding to the first sequence For details on the method, please refer to the introduction to step 400 above, which will not be repeated here.

[0183] Step 503: The second communication device determines the locations.

[0184] in, The positions are positions in the mother code sequence for placing the information bits and the first check bit of the first sequence.

[0185] Before executing step 503, the second communication device may perform rate matching on the mother code sequence according to the target transmission code length E to obtain a rate-matched target sequence.

[0186] Optionally, the second communication device determines the target sequence based on the reliability and row weight. locations.

[0187] It should be noted that the second communication device determines the target sequence For the method of performing the above steps, please refer to the introduction of step 401, which will not be repeated here.

[0188] In a possible implementation, the second communication device determines After the position, you can further The position of the information bit and the position of the first check bit are determined in the positions.

[0189] The second communication device is from For the manner of respectively determining the position of the information bit and the position of the first check bit in each position, reference can be made to the above description of step 402 and will not be repeated here.

[0190] Step 504: The second communications device determines a second parity bit position in the mother code sequence.

[0191] It should be noted that the manner in which the second communication device determines the second check bit position from the mother code sequence can be found in the description of step 403 above, and is not repeated here.

[0192] Step 505: The second communication device The second sequence is decoded based on the position, the second check bit position, and the target parity check PC equation to obtain the information bits in the first sequence.

[0193] Optionally, the second communication device decodes the second sequence according to the position of the information bit in the mother code sequence, the position of the first check bit and the second check bit, and the target PC equation to obtain the information bits in the first sequence.

[0194] If the first communication device encodes according to the simplified check bit position set, the second communication device can also decode the second sequence according to the position of the valid check bit in the positions of the first check bit and the second check bit during the decoding process.

[0195] The second communication device may determine the target PC equation according to the second corresponding relationship.

[0196] Optionally, the second correspondence includes a correspondence between the length K of the first sequence and an indicative parameter of the target PC equation.

[0197] The second communication device can determine the indicative parameters of the target PC equation corresponding to K from the second corresponding relationship based on the length K of the first sequence, and can determine the target PC equation based on the determined indicative parameters of the target PC equation.

[0198] Optionally, the second corresponding relationship in the embodiment of the present application may be pre-generated.

[0199] In possible implementation manner 1, the second correspondence in the embodiment of the present application may include correspondences between multiple message lengths and indication parameters of the PC equation.

[0200] In possible implementation manner 2, embodiments of the present application may further consider the transmission code length when determining the indicative parameters of the PC equation, where the transmission code length is the transmission code length after rate matching of the encoded sequence (illustratively, the transmission code length is the actual transmission code length of the codeword sequence transmitted between the first communication device and the second communication device). In this implementation manner, the first correspondence may include correspondences between multiple message lengths, multiple transmission code lengths, and the indicative parameters of the PC equation.

[0201] With respect to the above-mentioned possible implementation manner 1, the second communication device determines the indicative parameters of the target PC equation from a second correspondence including multiple message lengths and indicative parameters of the PC equation according to the length K of the first sequence.

[0202] For the above-mentioned possible implementation method 2, the second communication device determines the indicative parameters of the target PC equation based on the length K of the first sequence and the target transmission code length E from a second correspondence including multiple message lengths, multiple transmission code lengths and indicative parameters of the PC equation.

[0203] The second communication device may decode the second sequence using a successive cancellation list (SCL) decoding method. The specific decoding process may include:

[0204] Step 1: Perform rate matching on the second sequence to obtain a sequence to be decoded with a mother code length.

[0205] Step 2. Determine the bit type of the current decoding position: If it is a frozen bit, the decoding output is fixed to 0, and no path splitting is performed; if the current decoding result is not 0, a penalty value greater than zero is accumulated for the metric value of the current path. If it is a message bit, it is split into 0, 1, or 2 possible values, and stored as the current decoding path (i.e., path splitting), and the decoding metric value corresponding to each path is calculated (e.g., the smaller the metric value, the better). If the current position belongs to the check bit, the check bit at the current position is calculated based on the determined target PC equation and the previous decoding result. If the calculated result is consistent with the decoder's current decoding result, the decoding metric of the current path is not accumulated. Otherwise, a penalty value greater than 0 is accumulated for the decoding metric of the current decoding path.

[0206] Step 3: Repeat step 2 until the decoder completes decoding of bits at N positions (N is the mother code length). From a maximum of List (e.g., List = 8) decoding paths, select the path with the smallest decoding metric value as the final decoding output sequence.

[0207] Step 4: Take K message bits from the decoding sequence in step 3 according to the message bit position, and the decoding is completed.

[0208] The first and second corresponding relationships in the encoding and decoding processes are described in detail below.

[0209] In the following description, the first correspondence includes the correspondence between multiple message lengths, multiple transmission code lengths and the number of first check bits, and the second correspondence includes the correspondence between multiple message lengths, multiple transmission code lengths and the indication parameters of the PC equation as examples.

[0210] Example 1:

[0211] In the first correspondence, for each message length and each transmission code length, the corresponding number of first check bits is determined respectively; and in the second correspondence, for each message length and each transmission code length, the corresponding indication parameters of the PC equation are determined respectively.

[0212] In the first correspondence, one message length and one transmission code length correspond to one number of first parity bits; when the message lengths and / or transmission code lengths are different, the corresponding numbers of first parity bits can be the same or different. In the second correspondence, one message length and one transmission code length correspond to one indicator parameter of the PC equation; when the message lengths and / or transmission code lengths are different, the corresponding indicator parameters of the PC equation can be the same or different.

[0213] Optionally, in the first corresponding relationship, the number of first check bits corresponding to a message length and a transmission code length is not greater than the difference between the corresponding transmission code length and the message length.

[0214] For example, as shown in Table 1, each correspondence is a correspondence between a message length k, a transmission code length e, and the number of first parity bits. In Table 1, the value determined based on the row where the message length k is located and the column where the transmission code length e is located is the number of first parity bits. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 3; for another example, when k = 5 and e = 26, the corresponding number of first parity bits is 1.

[0215] Optionally, the first correspondence in the embodiment of the present application may include at least one correspondence in Table 1.

[0216] In Table 1, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0217] Table 1

[0218] For example, Table 2 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, and an indicator parameter of a PC equation. In Table 2, the values ​​determined by the row containing the message length k and the column containing the transmission code length e are the indicator parameters of the PC equation. For example, when k = 3 and e = 32, the corresponding indicator parameter of the PC equation is 9; for another example, when k = 4 and e = 22, the corresponding indicator parameter of the PC equation is 96.

[0219] Optionally, the second correspondence in the embodiment of the present application may include at least one correspondence in Table 2.

[0220] In Table 2, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0221] Table 2

[0222] Alternatively, the first correspondence and the second correspondence in the embodiment of the present application can also be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0223] Table 3 shows multiple corresponding relationships, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter for the PC equation. In Table 3, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits and the indicator parameter for the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 3 and the indicator parameter for the PC equation is 9; for another example, when k = 4 and e = 22, the corresponding number of first parity bits is 1 and the indicator parameter for the PC equation is 96.

[0224] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 3, where the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0225] In Table 3, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0226] Table 3

[0227] Based on the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation in Example 1 above, the first communication device determines the number of first check bits according to the length K of the first sequence and the target transmission code length E. After obtaining the indicated parameters of the target PC equation, a precoding sequence is generated according to the determined information bit positions and check bit positions in the mother code sequence.

[0228] Exemplarily, the pseudo code for the first communication device to generate the precoding sequence is as follows, wherein, taking the determined target PC equation indicating parameter as 26 as an example, the shift register used can be as shown in FIG6 . Since the target PC equation indicating parameter is 26, its binary representation is [1 1 0 1 0] (the leftmost bit is the most significant bit), the target PC equation is D4 +D 3 +D 1 , that is, the tap positions are y4, y3, and y1; L is the highest power exponent of the target PC equation, such as D here 4 +D 3 +D 1 Correspondingly, L=4, and the number of shift registers is 5.

[0229] Example 2:

[0230] In the first correspondence, for each message length and each transmission code length, the corresponding number of first check bits is determined respectively; and in the second correspondence, for each message length and each transmission code length, the corresponding indication parameters of the PC equation are determined respectively.

[0231] In the first correspondence, one message length and one transmission code length correspond to one number of first parity bits; when the message lengths and / or transmission code lengths are different, the corresponding numbers of first parity bits can be the same or different. In the second correspondence, one message length and one transmission code length correspond to one indicator parameter of the PC equation; when the message lengths and / or transmission code lengths are different, the corresponding indicator parameters of the PC equation can be the same or different.

[0232] Optionally, in the first corresponding relationship, the number of first check bits corresponding to a message length and a transmission code length is not greater than the difference between the corresponding transmission code length and the message length.

[0233] For example, as shown in Table 4, each correspondence is a correspondence between a message length k, a transmission code length e, and the number of first parity bits. In Table 4, the value determined based on the row where the message length k is located and the column where the transmission code length e is located is the number of first parity bits. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 2; for another example, when k = 6 and e = 23, the corresponding number of first parity bits is 3.

[0234] Optionally, the first correspondence in the embodiment of the present application may include at least one correspondence in Table 4.

[0235] In Table 4, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0236] Table 4

[0237] For example, Table 5 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, and an indicator parameter of a PC equation. In Table 5, the values ​​determined by the row containing the message length k and the column containing the transmission code length e are the indicator parameters of the PC equation. For example, when k = 3 and e = 32, the corresponding indicator parameter of the PC equation is 88; for another example, when k = 5 and e = 10, the corresponding indicator parameter of the PC equation is 70.

[0238] Optionally, the second correspondence in the embodiment of the present application may include at least one correspondence in Table 5.

[0239] In Table 5, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0240] Table 5

[0241] Alternatively, the first correspondence and the second correspondence in the embodiment of the present application can also be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0242] Table 6 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter for the PC equation. In Table 6, the values ​​determined by the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p for the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 2 and the indicator parameter for the PC equation is 88. For another example, when k = 4 and e = 22, the corresponding number of first parity bits is 3 and the indicator parameter for the PC equation is 9.

[0243] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 6, where the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0244] In Table 6, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0245] Table 6

[0246] Based on the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation in the above example 2, the first communication device determines the number of first check bits according to the length K of the first sequence and the target transmission code length E. After obtaining the indicated parameters of the target PC equation, a precoding sequence is generated according to the determined information bit positions and check bit positions in the mother code sequence.

[0247] Exemplarily, the pseudo code for the first communication device to generate the precoding sequence is as follows, wherein, taking the determined indicator parameter of the target PC equation as 52 as an example, the shift register used can be as shown in FIG7 . Since the indicator parameter of the target PC equation is 26, its binary representation is [1 1 0 1 0 0] (the leftmost bit is the most significant bit), the target PC equation is D 5 +D 4 +D 2 , that is, the tap positions are y5, y4, and y2; L is the highest power exponent of the target PC equation, such as D here 5 +D 4 +D 2 Correspondingly, L=5, and the number of shift registers is 6.

[0248] In addition, in the embodiment of the present application, the number of valid check bits corresponding to the length K of the first sequence and the target transmission code length E is less than or equal to a set threshold. It can be understood that the upper limit of the number of valid check bits corresponding to the length K of the first sequence and the target transmission code length E is the set threshold.

[0249] The set threshold for valid parity bits may also vary depending on the message length and / or transmission code length. For example, when the message length k=11 and the transmission code length e=32, the set threshold for the number of valid parity bits is 10 (i.e., when k=11 and e=32, the number of valid parity bits in the mother code sequence is less than or equal to 10). When the message length k=9 and the transmission code length e=30, the set threshold for the number of valid parity bits is 12 (i.e., when k=9 and e=30, the number of valid parity bits in the mother code sequence is less than or equal to 12).

[0250] Optionally, the third corresponding relationship includes a corresponding relationship between the message length k, the transmission code length e and the set threshold value corresponding to the number of valid check bits.

[0251] For example, multiple correspondences are shown in Table 7, each of which represents a correspondence between a message length k, a transmission code length e, and a set threshold for the number of valid check bits. In Table 7, the value determined based on the row containing the message length k and the column containing the transmission code length e represents the set threshold for the number of valid check bits. For example, when k = 3 and e = 32, the set threshold for the number of valid check bits is 6; for another example, when k = 5 and e = 10, the set threshold for the number of valid check bits is 3.

[0252] Optionally, the third correspondence in the embodiment of the present application may include at least one correspondence in Table 7.

[0253] In Table 7, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0254] Table 7

[0255] It should be noted that the third correspondence shown in Table 7 above can also be arbitrarily combined with the first correspondence and the second correspondence in a single table. For example, a single table can include the correspondence between the message length k, the transmission code length e, the number of first parity bits, the indicator parameter of the PC equation, and the set threshold value corresponding to the number of valid parity bits. For another example, a single table can include the correspondence between the message length k, the transmission code length e, the number of first parity bits, and the set threshold value corresponding to the number of valid parity bits.

[0256] In Examples 1 and 2 above, the number of first parity bits and the PC equation indicator parameters are independently designed for each set of message lengths and transmission code lengths. Furthermore, in embodiments of the present application, the number of first parity bits and the PC equation indicator parameters can also be designed for message lengths and / or transmission code lengths within different ranges.

[0257] Optionally, in the first correspondence, for message lengths within the first length range, the number of first check bits corresponding to the same message length is the same; in the second correspondence, for message lengths within the first length range, the indication parameters of the PC equation corresponding to the same message length are the same.

[0258] Exemplarily, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6. For message lengths within the first length range, when the message lengths are the same and the transmission code lengths are different, the corresponding numbers of first check bits are the same, and when the message lengths are the same and the transmission code lengths are different, the corresponding indication parameters of the PC equation are the same.

[0259] The following describes this correspondence with a variety of examples.

[0260] Example 3:

[0261] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, different message lengths within the first length range correspond to different numbers of first check bits, and / or, in the second corresponding relationship, different message lengths within the first length range correspond to different indication parameters of the PC equation.

[0262] For the convenience of description below, the number of first check bits corresponding to the same message length and transmission code length and the indication parameter of the PC equation are referred to as a set of PC parameters; for example, when the message length is 3 and the transmission code length is 32, the corresponding number of first check bits is 0, and the indication parameter of the PC equation is 26, then the number of first check bits 0 and the indication parameter of the PC equation 26 can be referred to as a set of PC parameters.

[0263] In this example, each message length within the first length range uses a set of PC parameters, and different message lengths within the first length range correspond to different sets of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0264] It should be noted that a set of different PC parameters may be different numbers of first check bits and / or different indication parameters of the PC equation.

[0265] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0266] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0267] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0268] When the message length k=7, the transmission code length can be divided into two segments according to ek, and each segment corresponds to a set of PC parameters. For example: 1≤ek≤8 corresponds to a set of PC parameters; 9≤ek≤25 corresponds to a set of PC parameters;

[0269] When the message length k=8, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 1≤ek≤7 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 10≤ek≤24 corresponds to a set of PC parameters;

[0270] When the message length k=9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 1≤ek≤7 corresponds to a set of PC parameters; 8≤ek≤10 corresponds to a set of PC parameters; 11≤ek≤23 corresponds to a set of PC parameters;

[0271] When the message length k=10, the transmission code length can be divided into two segments according to ek, and each segment corresponds to a set of PC parameters. For example: 1≤ek≤7 corresponds to a set of PC parameters; 8≤ek≤22 corresponds to a set of PC parameters;

[0272] When the message length k = 11, the transmission code length can be divided into three segments based on ek, and each segment corresponds to a set of PC parameters. For example, 1≤ek≤7 corresponds to one set of PC parameters; 8≤ek≤10 and 15≤ek≤21 correspond to one set of PC parameters; and 11≤ek≤14 corresponds to one set of PC parameters.

[0273] Optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0274] For example, as shown in Table 8, there are multiple correspondences, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 8, the values ​​determined based on the row where the message length k is located and the column where the transmission code length e is located are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 26; for another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 17.

[0275] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 8, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0276] In Table 8, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0277] Table 8

[0278] It should be noted that Table 8 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0279] In addition, in the embodiment of the present application, the number of valid check bits corresponding to the length K of the first sequence and the target transmission code length E is less than or equal to a set threshold. It can be understood that the upper limit of the number of valid check bits corresponding to the length K of the first sequence and the target transmission code length E is the set threshold.

[0280] Among them, when the message length and / or transmission code length are different, the set threshold corresponding to the valid check bits may also be different. For example, when the message length k = 11 and the transmission code length e = 32, the set threshold corresponding to the number of valid check bits is 9 (i.e., when k = 11 and e = 32, the number of valid check bits is less than or equal to 9); when the message length k = 9 and the transmission code length e = 30, the set threshold corresponding to the number of valid check bits is 10 (i.e., when k = 9 and e = 30, the number of valid check bits is less than or equal to 10).

[0281] Optionally, the third corresponding relationship includes a corresponding relationship between the message length k, the transmission code length e and the set threshold value corresponding to the number of valid check bits.

[0282] For example, multiple correspondences are shown in Table 9, each of which represents a correspondence between a message length k, a transmission code length e, and a set threshold for the number of valid parity bits. In Table 9, the value determined based on the row containing the message length k and the column containing the transmission code length e represents the set threshold for the number of valid parity bits. For example, when k = 3 and e = 32, the set threshold for the number of valid parity bits is 0; for another example, when k = 5 and e = 10, the set threshold for the number of valid parity bits is 2.

[0283] Optionally, the third correspondence in the embodiment of the present application may include at least one correspondence in Table 9.

[0284] In Table 9, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0285] Table 9

[0286] It should be noted that the third correspondence shown in Table 9 above can also be arbitrarily combined with the first correspondence and the second correspondence shown in Table 8 in a single table. For example, a single table can include the correspondence between the message length k, the transmission code length e, the number of first parity bits, the indicator parameter of the PC equation, and the set threshold value corresponding to the number of valid parity bits. For another example, a single table can include the correspondence between the message length k, the transmission code length e, the number of first parity bits, and the set threshold value corresponding to the number of valid parity bits.

[0287] Example 4:

[0288] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same, and in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0289] In this example, all message lengths within the first length range use a set of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0290] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0291] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0292] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0293] When the message length k=7, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 12≤ek≤25 corresponds to a set of PC parameters; 9≤ek≤11 corresponds to a set of PC parameters; 1≤ek≤8 corresponds to a set of PC parameters, which are the same as the PC parameters corresponding to 3≤k≤6;

[0294] When the message length k=8, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤24 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as those corresponding to 3≤K≤6;

[0295] When the message length k = 9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤23 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as those corresponding to 3≤k≤6;

[0296] When the message length k = 9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤22 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters corresponding to 3≤K≤6;

[0297] When the message length k = 9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤21 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as those corresponding to 3≤K≤6;

[0298] Among them, k=7 and 9≤ek≤11, k=10 and 8≤ek≤9, k=11 and 8≤ek≤9 can correspond to the same set of PC parameters; when 7≤k≤11 and 21≤e≤32, they can correspond to the same set of PC parameters.

[0299] Optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0300] For example, as shown in Table 10, there are multiple corresponding relationships, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 10, the values ​​determined based on the row where the message length k is located and the column where the transmission code length e is located are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 52; for another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 52.

[0301] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 10, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0302] In Table 10, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0303] Table 10

[0304] It should be noted that Table 10 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0305] Example 5:

[0306] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same, and in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0307] In this example, all message lengths within the first length range use a set of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0308] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0309] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0310] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0311] When the message length k = 7, the transmission code length can be divided into four segments according to ek, and each segment corresponds to a set of PC parameters. For example: 12≤ek≤25 corresponds to a set of PC parameters; 10≤ek≤11 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤k≤6;

[0312] When the message length k=8, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤24 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤K≤6;

[0313] When the message length k = 9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤23 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤K≤6;

[0314] When the message length k = 10, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤22 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the same PC parameters as 3≤K≤6;

[0315] When the message length k = 11, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤21 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the same as the PC parameters of 3≤K≤6;

[0316] Among them: K=7 and 8≤ek≤9, K=8 and 8≤ek≤9, K=9 and 8≤ek≤9, K=10 and 8≤ek≤9 can correspond to the same set of PC parameters; K=7 and 10≤ek≤11, K=11 and 8≤ek≤9 can correspond to the same set of PC parameters; when 7≤k≤11 and 21≤e≤32, they can correspond to the same set of PC parameters.

[0317] Optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0318] For example, as shown in Table 11, there are multiple corresponding relationships, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 11, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 52; for another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 52.

[0319] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 11, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0320] In Table 11, the value range of k is 3 to 11, and the value range of e is 4 to 32 as an example.

[0321] Table 11

[0322] It should be noted that Table 11 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0323] Example 6:

[0324] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same, and in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0325] In this example, all message lengths within the first length range use a set of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0326] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0327] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0328] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0329] When the message length k = 7, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 12≤ek≤25 corresponds to a set of PC parameters; 9≤ek≤11 corresponds to a set of PC parameters; 1≤ek≤8 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤k≤6;

[0330] When the message length k = 8, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤24 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤k≤6;

[0331] When the message length k = 9, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤23 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as 3≤k≤6;

[0332] When the message length k = 10, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. For example: 10≤ek≤22 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as 3≤k≤6;

[0333] When the message length k = 11, the transmission code length can be divided into three segments according to ek, and each segment corresponds to a set of PC parameters. 10≤ek≤21 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, which are the same as the PC parameters of 3≤k≤6;

[0334] Among them: k=7 and 9≤ek≤11, k=10 and 8≤ek≤9, k=11 and 8≤ek≤9 can correspond to the same set of PC parameters; k=8 and 8≤ek≤9, k=9 and 8≤ek≤9 can correspond to the same set of PC parameters; when 7≤k≤11 and 21≤e≤32, they can correspond to the same set of PC parameters.

[0335] Exemplarily, optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0336] For example, as shown in Table 12, there are multiple correspondences, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 12, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 52; for another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 52.

[0337] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 12, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0338] In Table 12, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0339] Table 12

[0340] It should be noted that Table 12 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0341] Example 7:

[0342] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same, and in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0343] In this example, all message lengths within the first length range use a set of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0344] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0345] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0346] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0347] When 7≤k≤11, the transmission code length can be divided into four segments according to ek, and each segment corresponds to a set of PC parameters. For example: 12≤ek≤25 corresponds to a set of PC parameters; 10≤ek≤11 corresponds to a set of PC parameters; 8≤ek≤9 corresponds to a set of PC parameters; 1≤ek≤7 corresponds to a set of PC parameters, and the PC parameters are the same as those for 3≤k≤6.

[0348] Among them, when k=11, 10≤ek≤11 and 8≤ek≤9 can be combined into one segment, and the corresponding PC parameters are the same.

[0349] Exemplarily, optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0350] For example, as shown in Table 13, there are multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 13, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 52. For another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 52.

[0351] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 13, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0352] In Table 13, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0353] Table 13

[0354] It should be noted that Table 13 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0355] Example 8:

[0356] In this example, in the first corresponding relationship, the number of first check bits corresponding to the same message length within the first length range is the same; in the second corresponding relationship, the indication parameters of the PC equation corresponding to the same message length within the first length range are the same; in the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same, and in the second corresponding relationship, the indication parameters of the PC equation corresponding to each message length within the first length range are the same.

[0357] In this example, all message lengths within the first length range use a set of PC parameters. For example, the first threshold value of the first length range is 3 and the second threshold value is 6, that is, the first length range is 3 to 6.

[0358] For the message length within the second length range, in the first corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding number of first check bits is different; and / or, for the message length within the second length range, in the second corresponding relationship, when the message length is the same and the transmission code length belongs to different code length ranges, the corresponding indication parameters of the PC equation are different.

[0359] In an embodiment of the present application, the transmission code length is divided into multiple code length ranges for the message length within the second length range. When the transmission code length of the same message length belongs to different code length ranges, the corresponding set of PC parameters is different.

[0360] Exemplarily, the first threshold value of the second length range is 7, and the second threshold value is 11, that is, the second length range is 7-11.

[0361] When 7≤k≤11, when ek≤7, the transmission code length does not need to be segmented according to ek, and when ek≥8, the transmission code length can be segmented according to ek.

[0362] Optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0363] For example, as shown in Table 14, there are multiple correspondences, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 14, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, when k = 3 and e = 32, the corresponding number of first parity bits is 0 and the indicator parameter of the PC equation is 52; for another example, when k = 8 and e = 29, the corresponding number of first parity bits is 4 and the indicator parameter of the PC equation is 26.

[0364] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 14, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0365] In Table 14, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0366] Table 14

[0367] It should be noted that Table 14 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0368] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0369] In addition, in the embodiment of the present application, K is the length of the first sequence obtained by the first communication device, which specifically refers to the length of the first sequence; k in the embodiment of the present application represents different message lengths, which generally refers to the lengths of each message; accordingly, in the embodiment of the present application, E is the target transmission code length corresponding to the first sequence obtained by the first communication device, which specifically refers to the target transmission code length corresponding to the first sequence; e in the embodiment of the present application represents different transmission code lengths, which generally refers to each transmission code length; accordingly, in the embodiment of the present application, N is the mother code length corresponding to the first sequence obtained by the first communication device, which specifically refers to the mother code length corresponding to the first sequence; n in the embodiment of the present application represents different numbers of first check bits, which generally refers to the number of each first check bit.

[0370] The embodiment of the present application is based on the above-mentioned multiple designs of the number of first check bits and the indicating parameters of the PC equation corresponding to different message lengths and transmission code lengths. The first communication device performs polarization coding and rate matching on the first sequence to obtain a second sequence based on the number of first check bits and the indicating parameters of the PC equation determined by any of the above-mentioned multiple methods, and the first communication device sends the second sequence to the second communication device. Based on the solution provided by the embodiment of the present application, the transmission performance is greatly improved compared to the related art. Exemplarily, the improvement in transmission performance can be reflected in that when the bit error rate reaches a preset threshold, the signal-to-noise ratio of the solution provided by the embodiment of the present application is lower than that of the related art; for example, when the bit error rate is guaranteed to be lower than 1%, the signal-to-noise ratio of the solution provided by the embodiment of the present application is lower than the signal-to-noise ratio in the related art solution.

[0371] Figure 8 shows a schematic diagram of transmission performance of the embodiment of the present application, related technologies 1, and related technologies 2. The horizontal axis represents different transmission code lengths, and the vertical axis represents the signal-to-noise ratio (SNR) for ensuring a bit error rate below 1%. For example, related technology 1 may be a PC-polar encoding scheme with a nested PC equation; related technology 2 may be an LTE-RM code and FHT decoding scheme.

[0372] In the embodiments of the present application, different message lengths and / or transmission code lengths may have the same corresponding PC equation indicator parameters; corresponding first parity bits may be independently designed for different message lengths and / or transmission code lengths. This correspondence is described below in conjunction with Example 9.

[0373] Example 9:

[0374] Optionally, the first correspondence and the second correspondence of the embodiment of the present application can be realized through a target correspondence, which includes the first correspondence and the second correspondence; for example, the target correspondence includes the correspondence between the message length k, the transmission code length e, the number of first check bits n, and the indicator parameter p of the PC equation.

[0375] For example, as shown in Table 15, there are multiple corresponding relationships, each of which is a correspondence between a message length k, a transmission code length e, a number of first parity bits, and an indicator parameter of the PC equation. In Table 15, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, the indicator parameter p of the PC equation takes a fixed value, such as the indicator parameter p of the PC equation in Table 15, which takes a value of 26. When k = 3 and e = 32, the corresponding number of first parity bits is 3 and the indicator parameter of the PC equation is 26. For another example, when k = 8 and e = 29, the corresponding number of first parity bits is 6 and the indicator parameter of the PC equation is 26.

[0376] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 15, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0377] In Table 15, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0378] Table 15

[0379] It should be noted that Table 15 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0380] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0381] As shown in Table 15, when the indicator parameter p of the PC equation is a fixed value of 26, the length of the shift register can be 5, the number of taps can be 3, and the shift register used can be as shown in FIG9 .

[0382] In addition, an embodiment of the present application also provides a solution for a first communication device to determine a first check bit position.

[0383] Optionally, the first communication device determines the set Afterwards, the collection The bits in the set are sorted in descending order of reliability, and the first communication device can The n positions with high reliability are used as the positions of the first check bits.

[0384] Compared with the above-described solution in which the first communication device determines the position of the first check bit, in this solution the first communication device does not need to calculate the row weight, making the solution for determining the position of the first check bit simpler and reducing the amount of calculation.

[0385] Figure 10 shows a mother code sequence arranged from highest to lowest reliability. The mother code sequence includes punctured bits, information bits, and parity bits. When the transmission code length E is 23, the mother code sequence includes 9 punctured bits. For example, if n is 3, the last three bits in the mother code sequence serve as the first parity bit position.

[0386] In a solution where the first communication device can use n positions with high reliability as the positions of the first check bit, the first corresponding relationship and the second corresponding relationship of the embodiment of the present application can be as shown in Table 16.

[0387] For example, Table 16 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter of a PC equation. In Table 16, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation.

[0388] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 16, where the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0389] In Table 16, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0390] Table 16

[0391] It should be noted that Table 16 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0392] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0393] An embodiment of the present application also provides a solution for a first communication device to determine a first check bit position.

[0394] Optionally, the first communication device determines the set Afterwards, the collection The n positions with the largest index are used as the positions of the first check bits.

[0395] Compared with the scheme of determining the first parity bit position by the first communication device described above, the scheme of determining the first parity bit position by the first communication device does not need to calculate the row weight, which makes the scheme of determining the first parity bit position simpler and reduces the amount of calculation; and there is no need to sort according to reliability, and the first parity bit position is directly selected from the set. The n positions with the largest index are selected as the positions of the first check bits.

[0396] As shown in Figure 11, the mother code sequence includes puncturing bits, information bits, and check bits. When the transmission code length E is 19, the mother code sequence includes 13 puncturing bits. Taking the value of n as 3 as an example, the mother code sequence includes The three positions with the largest indexes in the sequence (excluding the punctured bits) are used as the positions of the first check bits, such as the bits with indexes 19, 20, and 21 in FIG11 .

[0397] The following are some examples to introduce how the first communication device will collect In the scheme in which the n positions with the largest index are used as the positions of the first check bits, the first corresponding relationship and the second corresponding relationship in the embodiment of the present application.

[0398] The first and second correspondences are shown in Table 17:

[0399] For example, Table 17 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter of a PC equation. In Table 17, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation.

[0400] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 17, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0401] In Table 17, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0402] Table 17

[0403] It should be noted that Table 17 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0404] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0405] The first and second correspondences are shown in Table 18:

[0406] For example, Table 18 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter of the PC equation. In Table 18, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, the indicator parameter p of the PC equation takes a fixed value, such as 16 in Table 18.

[0407] Optionally, the target correspondence in the embodiment of the present application may include at least one correspondence in Table 18, where the target correspondence includes a first correspondence and a second correspondence.

[0408] In Table 18, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0409] Table 18

[0410] It should be noted that Table 18 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0411] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0412] The first and second correspondences are shown in Table 19:

[0413] For example, Table 19 shows multiple correspondences, each of which represents a correspondence between a message length k, a transmission code length e, the number of first parity bits, and an indicator parameter of the PC equation. In Table 19, the values ​​determined based on the row containing the message length k and the column containing the transmission code length e are the number of first parity bits n and the indicator parameter p of the PC equation. For example, the indicator parameter p of the PC equation takes a fixed value, such as 16 in Table 19.

[0414] Optionally, the target correspondence relationship in the embodiment of the present application may include at least one correspondence relationship in Table 19, wherein the target correspondence relationship includes a first correspondence relationship and a second correspondence relationship.

[0415] In Table 19, the value range of k is 3 to 11, and the value range of e is 4 to 32.

[0416] Table 19

[0417] It should be noted that Table 19 is introduced by taking the example of the first correspondence and the second correspondence being realized through the target correspondence (that is, the target correspondence includes the first correspondence and the second correspondence); it can be understood that the first correspondence and the second correspondence can also be realized through different correspondences respectively. In this way, the first correspondence and the second correspondence each correspond to a table.

[0418] It is worth noting that the values ​​in the various tables in the embodiments of the present application are merely examples of the embodiments of the present application. Missing portions in the various tables in the embodiments of the present application indicate that a corresponding relationship does not exist for the corresponding positions; for example, in the various tables, the positions corresponding to k taking a value of 5 and e taking a value of 4 are missing values, indicating that a corresponding relationship for k taking a value of 5 and e taking a value of 4 does not exist.

[0419] The embodiment of the present application provides a scheme that significantly improves transmission performance compared to the PC-polar coding scheme with nested PC equations, the LTE-RM code, and the FHT decoding scheme; for example, the bit error rate under different transmission code lengths is lower than that of the PC-polar coding scheme with nested PC equations, the LTE-RM code, and the FHT decoding scheme.

[0420] It is understood that each device in the above embodiments can perform some or all of the steps in each embodiment. These steps or operations are merely examples, and the embodiments of the present application can also perform other operations or variations of various operations. In addition, each step can be performed in the different orders presented in each embodiment, and it is possible not to perform all the operations in the embodiments of the present application. Moreover, the size of the sequence number of each step does not mean the order of execution, and the execution order of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0421] The communication device provided in the embodiments of the present application is described below.

[0422] FIG12 is a schematic diagram of the structure of the communication device according to an embodiment of the present application. Referring to FIG12 , the communication device can be used to execute the process executed by the first communication device in any of the embodiments shown in FIG3 and FIG4 . For details, please refer to the relevant description of the above method embodiments.

[0423] The communication device 1200 includes a communication unit 1201 and a processing unit 1202 .

[0424] The processing unit 1202 is used to perform data processing. The communication unit 1201 can implement corresponding communication functions. The communication unit 1201 can also be called a communication interface, a communication module, a transceiver unit, or a transceiver module.

[0425] Optionally, the communication device 1200 may further include a storage unit, which may be used to store instructions and / or data. The processing unit 1202 may read the instructions and / or data in the storage unit so that the communication device implements the aforementioned method embodiment.

[0426] Communication device 1200 can be configured to perform the actions performed by the first communication device in the above method embodiments. Communication device 1200 can be the first communication device or a component (e.g., a chip) configurable in the first communication device. Processing unit 1202 is configured to perform processing-related operations of the first communication device in the above method embodiments. Communication unit 1201 is configured to perform reception-related operations of the first communication device in the above method embodiments.

[0427] Optionally, the communication unit 1201 may include a sending unit and a receiving unit. The sending unit is configured to perform the sending operation in the above method embodiment. The receiving unit is configured to perform the receiving operation in the above method embodiment.

[0428] It should be noted that the communication unit 1201 may include a sending unit but not a receiving unit. Alternatively, the communication device 1200 may include a receiving unit but not a sending unit. The specific details may depend on whether the above solution executed by the communication device 1200 includes a sending action and a receiving action.

[0429] Optionally, the communication device 1200 is used to execute the actions executed by the first communication device in any of the embodiments shown in FIG. 3 and FIG. 4 .

[0430] FIG13 is a schematic diagram of a structure of a communication device according to an embodiment of the present application. Referring to FIG13 , the communication device can be used to execute the process executed by the second communication device in any of the embodiments shown in FIG5 . For details, please refer to the relevant description in the above method embodiment.

[0431] The communication device 1300 includes a communication unit 1301 and a processing unit 1302 .

[0432] The processing unit 1302 is used to perform data processing. The communication unit 1301 can implement corresponding communication functions. The communication unit 1301 can also be called a communication interface, a communication module, a transceiver unit, or a transceiver module.

[0433] Optionally, the communication device 1300 may further include a storage unit, which may be used to store instructions and / or data. The processing unit 1302 may read the instructions and / or data in the storage unit so that the communication device implements the aforementioned method embodiment.

[0434] Communication device 1300 can be used to perform the actions performed by the second communication device in the above method embodiments. Communication device 1300 can be a second communication device or a component (e.g., a chip) configurable in the second communication device. Processing unit 1302 is used to perform processing-related operations of the second communication device in the above method embodiments. Communication unit 1301 is used to perform reception-related operations of the second communication device in the above method embodiments.

[0435] Optionally, the communication unit 1301 may include a sending unit and a receiving unit. The sending unit is configured to perform the sending operation in the above method embodiment. The receiving unit is configured to perform the receiving operation in the above method embodiment.

[0436] It should be noted that the communication unit 1301 may include a sending unit but not a receiving unit. Alternatively, the communication device 1300 may include a receiving unit but not a sending unit. The specific details may depend on whether the above solution executed by the communication device 1300 includes a sending action and a receiving action.

[0437] Optionally, the communication device 1300 is used to execute the actions executed by the second communication device in any of the embodiments shown in FIG. 5 .

[0438] The division of modules in the embodiments of the present application is schematic and is only a logical function division. In actual implementation, there may be other division methods. In addition, the functional modules in the various embodiments of the present application can be integrated into a processor, or can exist physically separately, or two or more modules can be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software functional modules. It is understood that the functions or implementations of the various modules in the embodiments of the present application can be further referred to the relevant description of the method embodiment.

[0439] In one possible embodiment, a communication device may be as shown in FIG14 . The device may be a communication device or a chip in a communication device, wherein the communication device may be the first communication device or the second communication device in the above-described embodiment. The device includes a processor 1401 and a communication interface 1402, and may also include a memory 1403. The processing unit 1202 and the processing unit 1302 may be the processor 1401. The communication unit 1201 and the communication unit 1301 may be the communication interface 1402. Optionally, the processor 1401 and the memory 1403 may be integrated together.

[0440] The processor 1401 may be a CPU, a digital processing unit, or the like. The communication interface 1402 may be a transceiver, an interface circuit such as a transceiver circuit, or a transceiver chip, or the like. The device further includes: a memory 1403 for storing programs executed by the processor 1401. The memory 1403 may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), or a volatile memory (volatile memory), such as a random-access memory (RAM). The memory 1403 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0441] The processor 1401 is used to execute the program code stored in the memory 1403, specifically to perform the actions of the processing unit 1202 or the processing unit 1302, which will not be described in detail in this application. The communication interface 1402 is specifically used to perform the actions of the communication unit 1201 or the communication unit 1301, which will not be described in detail in this application.

[0442] The specific connection medium between the communication interface 1402, processor 1401, and memory 1403 is not limited in the embodiments of the present application. In Figure 14, the embodiment of the present application shows that the memory 1403, processor 1401, and communication interface 1402 are connected via bus 1404. The bus is represented by a bold line in Figure 14. The connection method between other components is only for schematic illustration and is not limiting. Buses can be divided into address buses, data buses, control buses, etc. For ease of representation, only one bold line is used in Figure 14, but this does not mean that there is only one bus or one type of bus.

[0443] An embodiment of the present invention further provides a computer-readable storage medium for storing computer software instructions required to be executed by the above-mentioned processor, which includes a program required to be executed by the above-mentioned processor.

[0444] An embodiment of the present application further provides a communication system, including a first communication device for implementing the embodiment of FIG. 3 or FIG. 4 and a second communication device for implementing the embodiment of FIG. 5 .

[0445] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0446] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each flow and / or box in the flow chart and / or block diagram, as well as the combination of the flow chart and / or box in the flow chart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing the functions specified in one or more flow charts and / or one or more boxes in the block diagram.

[0447] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0448] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, so that the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

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

Claims

1. A coding method, characterized in that: The method comprises: Obtain a first sequence, where the first sequence is a bit sequence to be encoded and the length of the first sequence is K; determining, according to the K, a mother code sequence corresponding to the first sequence; According to the mother code sequence, polarization coding is performed on check bits and the first sequence, wherein the check bits include first check bits and second check bits; The check bit is determined according to the following method: According to the first corresponding relationship, determine the number of first check bits corresponding to the first sequence The first corresponding relationship includes a corresponding relationship between K and the number of first check bits; According to the reliability and the row weight, determine the positions for placing the first sequence and the first check bit; determining a second check bit position in the mother code sequence; According to the position, the second check bit position, the target parity check PC equation and the first sequence to determine the check bit.

2. A decoding method, characterized in that: The method comprises: Get the length K of the second sequence and the first sequence; Determine a mother code sequence corresponding to the first sequence according to the K; According to the first corresponding relationship, determine the number of first check bits corresponding to the first sequence The first corresponding relationship includes a corresponding relationship between K and a first check bit; According to the reliability and the row weight, determine the positions, positions for placing the first sequence and the first check bit; Determining a second check bit position in the mother code sequence; According to the The second sequence is decoded by using a position, the second check bit position, and a target parity check PC equation to obtain the information bits in the first sequence.

3. The method according to claim 1 or 2, characterized in that The method further comprises: The target PC equation is determined according to a second corresponding relationship; wherein the second corresponding relationship includes a corresponding relationship between K and an indicative parameter of the target PC equation.

4. The method according to claim 3, characterized in that The first corresponding relationship also includes a corresponding relationship between a target transmission code length E and the first check bit, where E is a transmission code length after rate matching of the encoded sequence; The second corresponding relationship also includes the corresponding relationship between E and the indicator parameters of the target PC equation.

5. The method according to claim 4, characterized in that The number of first check bits corresponding to the K and the E is less than or equal to EK, and / or the number of valid check bits corresponding to the K and the E is less than or equal to a set threshold.

6. The method according to claim 4 or 5, characterized in that The first corresponding relationship includes the corresponding relationship between multiple message lengths, multiple transmission code lengths and the number of first check bits; the multiple message lengths include K, and the multiple transmission code lengths include E.

7. The method according to claim 6, characterized in that The second corresponding relationship includes the corresponding relationship between multiple message lengths, multiple transmission code lengths and the indication parameters of the PC equation; the multiple message lengths include K, and the multiple transmission code lengths include E.

8. The method according to claim 6, characterized in that In the first corresponding relationship, for message lengths within the first length range, the number of first check bits corresponding to the same message lengths is the same; In the second corresponding relationship, for message lengths within the first length range, the indication parameters of the PC equations corresponding to the same message lengths are the same.

9. The method according to claim 8, characterized in that In the first corresponding relationship, different message lengths within the first length range correspond to different numbers of first check bits; and / or In the second corresponding relationship, different message lengths within the first length range have corresponding PC equations with different indication parameters.

10. The method according to claim 8, characterized in that In the first corresponding relationship, the number of first check bits corresponding to each message length within the first length range is the same; In the second corresponding relationship, the indication parameters of the PC equations corresponding to the message lengths within the first length range are the same.

11. The method according to any one of claims 6, 8 to 10, characterized in that: In the first corresponding relationship, for the message length within the second length range, when the message lengths are the same and the transmission code lengths belong to different code length ranges, the corresponding numbers of first check bits are different; and / or In the second corresponding relationship, for the message length within the second length range, when the message lengths are the same and the transmission code lengths belong to different code length ranges, the corresponding indication parameters of the PC equations are different.

12. The method according to any one of claims 6, 8 to 11, characterized in that: In the first corresponding relationship, for the message length within the second length range, when the message lengths are the same and the transmission code lengths belong to the same code length range, the number of corresponding first check bits is the same; In the second corresponding relationship, for the message length within the second length range, when the message lengths are the same and the transmission code lengths belong to the same code length range, the corresponding indication parameters of the PC equations are the same.

13. The method according to any one of claims 8 to 10, characterized in that: The first threshold value of the first length range is 3, and the second threshold value of the first length range is 6.

14. The method according to claim 11 or 12, characterized in that: The first threshold value of the second length range is 7, and the second threshold value of the first length range is 11.

15. The method according to claim 5, characterized in that The method further comprises: According to the K, the E, and the third corresponding relationship, the set threshold corresponding to the number of valid check bits is determined; the third corresponding relationship includes the corresponding relationship between the K, the E and the set threshold corresponding to the number of valid check bits.

16. The method according to claim 7, characterized in that The first corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e and an indicator parameter of a PC equation; Among them, k represents the message length and e represents the transmission code length.

17. The method according to claim 7 or 16, characterized in that The second corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e and an indicator parameter of a PC equation; Among them, k represents the message length and e represents the transmission code length.

18. The method according to claim 7, characterized in that The first corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e, and the number of first check bits; Among them, k represents the message length and e represents the transmission code length.

19. The method according to claim 7 or 18, characterized in that The second corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e and an indicator parameter of a PC equation; Among them, k represents the message length and e represents the transmission code length.

20. The method of claim 15, wherein: The third corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e, and a set threshold value corresponding to the number of valid check bits; Among them, k represents the message length and e represents the transmission code length.

21. The method of claim 15, wherein: The third corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship is a corresponding relationship between a k, an e, and a set threshold value corresponding to the number of valid check bits; Among them, k represents the message length and e represents the transmission code length.

22. A communication device, characterized in that: including a communication unit and a processing unit; The communication unit is used to perform the sending and receiving operations in the method according to any one of claims 1 and 3 to 21, and the processing unit is used to perform the processing operations in the method according to any one of claims 1 and 3 to 21.

23. A communication device, characterized in that: The communication device comprises a processor; the processor is used to execute a computer program or instruction stored in a memory to implement the method described in any one of claims 1, 3 to 21.

24. The communication device according to claim 23, characterized in that The communication device further comprises the memory, which is used to store the computer program or instructions.

25. A communication device, characterized in that: including a communication unit and a processing unit; The communication unit is used to perform the sending and receiving operations in the method according to any one of claims 2 to 21, and the processing unit is used to perform The processing operation of the method according to any one of claims 2 to 21.

26. A communication device, characterized in that: The communication device comprises a processor; the processor is used to execute a computer program or instruction stored in a memory to implement the method according to any one of claims 2 to 21.

27. The communication device according to claim 26, characterized in that The communication device further comprises the memory, which is used to store the computer program or instructions.

28. A communication system, characterized in that: It comprises the communication device according to any one of claims 22 to 24 and the communication device according to any one of claims 25 to 27.

29. A computer-readable storage medium, characterized in that: A computer program or instruction is stored, and when the computer program or instruction is executed on a computer, the computer-readable storage medium enables the computer-readable storage medium to implement the method according to any one of claims 1 to 21.

30. A chip system, characterized in that: include: A processor, wherein the processor is configured to execute the method according to any one of claims 1 to 21.

Images