Coding and decoding method and device

Abstract

The invention provides a coding and decoding method and device, and the method comprises the steps: obtaining a first sequence which is a to-be-coded bit sequence, and the length of the first sequence is K; determining a mother code sequence corresponding to the first sequence according to the K; performing polarization coding on the check bit and the first sequence according to the mother code sequence; the check bits comprise a first check bit and a second check bit; the check bits are determined according to the following mode: determining the number # imgabs0 # of first check bits corresponding to the first sequence according to a first corresponding relationship, wherein the first corresponding relationship comprises a corresponding relationship between K and the first check bits; according to the reliability and the row weight, a # imgabs1 # position in the mother code sequence is determined to be used for placing a first sequence and a first check bit; determining a second check bit position in the mother code sequence; and determining the check bit according to the # imgabs2 positions, the second check bit position, the target parity check PC equation and the first sequence.

Description

Technical Field

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

[0002] Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication. The signal after channel coding at the sending device is transmitted to the receiving device through the channel. The receiving device performs corresponding channel decoding on the received signal to restore the original signal.

[0003] Polar codes are selected as the control channel coding method in the fifth generation (5G) standard. Polar codes are a known channel coding scheme that can be strictly proven to "reach" channel capacity, with characteristics such as high performance and low complexity. Based on these characteristics, Polar codes have great development and application prospects in the field of communications. However, with the rapid evolution of wireless communication systems (such as new radio (NR) systems), these communication scenarios have put forward higher requirements on the performance of Polar codes. Summary of the invention

[0004] The present application provides a coding and decoding method and device to provide a polar coding and decoding scheme to improve the performance of Polar code.

[0005] 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 in the first communication device. Taking the first communication device performing the method as an example, the method includes: obtaining a first sequence, 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 according to K; performing polarization coding on the check bits and the first sequence according to the mother code sequence; the check bits include a first check bit and a second check bit; wherein the check bits are determined according to the following method: according to the first corresponding relationship, determining the number of first check bits corresponding to the first sequence The first corresponding relationship includes the corresponding relationship between K and the first check bit; according to the reliability and the row weight, the mother code sequence is determined A position is 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.

[0006] Through 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. The positions are used to place the first sequence and the first check bit, and the position of the second check bit in the mother code sequence is determined, so that check bits of appropriate lengths can be flexibly generated to improve the performance of Polar code-based communication; and the first communication device determines the positions of the information bits and the first check bit of the first sequence from the mother code sequence according to the reliability and the row weight, which can further improve the code spectrum and enhance the error correction performance.

[0007] In one possible design, the method further includes: the first communication device determines the target PC equation according to the second corresponding relationship; wherein the second corresponding relationship includes a corresponding relationship between K and an indicating parameter of the target PC equation. Through the above method, the first communication device can flexibly generate a target PC equation that is adapted to the length of the bit sequence to be encoded.

[0008] In a possible design, the first correspondence also includes a correspondence between a target transmission code length E and a first check 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 indication parameter of a target PC equation. Through the above method, the first communication device can flexibly generate the number of first check bits that is compatible with the length of the bit sequence to be encoded and the transmission code length, and flexibly generate a target PC equation that is compatible with the length of the bit sequence to be encoded and the transmission code length.

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

[0010] In a possible design, the first corresponding relationship includes a 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. Through the above method, the first communication device can flexibly determine the number of first check bits that is compatible with the length of the bit sequence to be encoded and the transmission code length from the first corresponding relationship including multiple message lengths, multiple transmission code lengths and the number of first check bits.

[0011] In one possible design, the second correspondence includes a correspondence 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. Through the above method, the first communication device can flexibly determine the indication 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 correspondence including multiple message lengths, multiple transmission code lengths and the indication parameters of the PC equation.

[0012] In a possible design, 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 indicating parameters of the PC equation corresponding to the same message length are the same. Through 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 for storing 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.

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

[0014] In a 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.

[0015] 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 different code length ranges, the corresponding number of first check bits is different; and / or, 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 different code length ranges, the corresponding indication parameters of the PC equation are different.

[0016] In a 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.

[0017] 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 indication parameters of the PC equation can be flexibly configured, so that it can be applicable to different scenarios. The corresponding first correspondence and second correspondence can be configured in different scenarios.

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

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

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

[0021] In a possible design, the first corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship being a corresponding relationship between a k, an e, and the number of first check bits;

[0022]

[0023]

[0024] Among them, k represents the message length and e represents the transmission code length.

[0025] In a possible design, 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;

[0026]

[0027] Among them, k represents the message length and e represents the transmission code length.

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

[0029]

[0030]

[0031] Among them, k represents the message length and e represents the transmission code length.

[0032] In a possible design, the second corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship being a corresponding relationship between a k, an e, and the number of first check bits;

[0033]

[0034] Among them, k represents the message length and e represents the transmission code length.

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

[0036]

[0037] Among them, k represents the message length and e represents the transmission code length.

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

[0039]

[0040]

[0041] Among them, k represents the message length and e represents the transmission code length.

[0042] 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 is a sequence to be decoded, obtaining a length K of the first sequence; determining a mother code sequence corresponding to the first sequence according to K; determining the number of first check bits corresponding to the first sequence according to the first corresponding relationship The first corresponding relationship includes the corresponding relationship between K and the first check bit; according to the reliability and the row weight, the mother code sequence is determined Locations, A position is 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 a first check bit position, a second check bit position, and a target parity check PC equation to obtain check bits and information bits in the first sequence; the check bits include the first check bit and the second check bit.

[0043] Through 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. The positions are used to place the first sequence and the first check bit, and the position of the second check bit in the mother code sequence is determined, so that the check bits of the appropriate length can be flexibly generated to improve the performance of Polar code-based communication. In addition, the second communication device determines the positions of the information bits and the first check bit of the first sequence from the mother code sequence according to the reliability and the row weight, which can further improve the code spectrum and enhance the error correction performance.

[0044] In one possible design, the method further includes: the first communication device determines the target PC equation according to the second corresponding relationship; wherein the second corresponding relationship includes a corresponding relationship between K and an indicating parameter of the target PC equation. Through the above method, the first communication device can flexibly generate a target PC equation that is adapted to the length of the bit sequence to be encoded.

[0045] In a possible design, the first correspondence also includes a correspondence between a target transmission code length E and a first check 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 indication parameter of a target PC equation. Through the above method, the first communication device can flexibly generate the number of first check bits that is compatible with the length of the bit sequence to be encoded and the transmission code length, and flexibly generate a target PC equation that is compatible with the length of the bit sequence to be encoded and the transmission code length.

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

[0047] In a possible design, the first corresponding relationship includes a 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. Through the above method, the first communication device can flexibly determine the number of first check bits that is compatible with the length of the bit sequence to be encoded and the transmission code length from the first corresponding relationship including multiple message lengths, multiple transmission code lengths and the number of first check bits.

[0048] In one possible design, the second correspondence includes a correspondence 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. Through the above method, the first communication device can flexibly determine the indication 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 correspondence including multiple message lengths, multiple transmission code lengths and the indication parameters of the PC equation.

[0049] In a possible design, 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 indicating parameters of the PC equation corresponding to the same message length are the same. Through 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 for storing 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.

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

[0051] In a 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.

[0052] 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 different code length ranges, the corresponding number of first check bits is different; and / or, 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 different code length ranges, the corresponding indication parameters of the PC equation are different.

[0053] In a 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.

[0054] 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 indication parameters of the PC equation can be flexibly configured, so that it can be applicable to different scenarios. The corresponding first correspondence and second correspondence can be configured in different scenarios.

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

[0056] In a 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.

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

[0058] In a possible design, 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;

[0059]

[0060] Among them, k represents the message length and e represents the transmission code length.

[0061] In a possible design, 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;

[0062]

[0063]

[0064] Among them, k represents the message length and e represents the transmission code length.

[0065] In a possible design, the first corresponding relationship includes at least one corresponding relationship in the following table, each corresponding relationship being a corresponding relationship between a k, an e, and the number of first check bits;

[0066]

[0067]

[0068] Among them, k represents the message length and e represents the transmission code length.

[0069] In a possible design, 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;

[0070]

[0071] Among them, k represents the message length and e represents the transmission code length.

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

[0073]

[0074]

[0075] Among them, k represents the message length and e represents the transmission code length.

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

[0077]

[0078] Among them, k represents the message length and e represents the transmission code length.

[0079] In a third aspect, a communication device is provided, which may be the aforementioned first communication device or the second communication device. The communication device may include a communication unit and a processing unit to perform the aforementioned first aspect or the second aspect, or to perform any possible implementation of the first aspect or the second aspect. The communication unit is used 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 used to perform processing operations.

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

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

[0082] Optionally, the communication device also includes various modules that can be used to execute the above-mentioned first aspect or second aspect, or execute any possible implementation of the first aspect or second aspect.

[0083] In a fourth aspect, a communication device is provided, which may be the aforementioned first communication device or the second communication device. The communication device may include a processor and a memory to execute the aforementioned first aspect or the second aspect, or to execute any possible implementation of the first aspect or the second aspect. Optionally, a transceiver is further included, 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, and when the processor executes the computer program or instruction in the memory, the communication device executes the aforementioned first aspect or the second aspect, or executes any possible implementation of the first aspect or the second aspect.

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

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

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

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

[0088] 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. Optionally, the transceiver may be a transceiver circuit. Optionally, the input / output interface may be an input / output circuit.

[0089] 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 a related circuit on the chip or the chip system, etc. The processor may also be embodied as a processing circuit or a logic circuit.

[0090] 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 manner thereof, is implemented.

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

[0092] In an eighth aspect, a communication device is provided, the communication device includes a processor and may also include a storage medium, the storage medium stores instructions, and when the instructions are executed by the processor, they are used to implement the above-mentioned first aspect or second aspect, or any possible implementation method thereof. The communication device can be a chip system. The chip system can be composed of a chip, or it can include a chip and other discrete devices.

[0093] In a ninth aspect, a communication system is provided, comprising the first communication device described in the first aspect and the second communication device described in the second aspect.

[0094] 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 implements the above-mentioned first aspect or second aspect, or any possible implementation method thereof.

[0095] For each of the above-mentioned aspects from the third to the tenth aspect and the technical effects that may be achieved by each of the aspects, 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 of the second aspect, or each aspect, and no further details will be given here. BRIEF DESCRIPTION OF THE DRAWINGS

[0096] Figure 1 A schematic diagram of a communication system architecture provided in an embodiment of the present application;

[0097] Figure 2 A schematic diagram of a coding process provided in an embodiment of the present application;

[0098] Figure 3 A schematic diagram of a flow chart of an encoding method provided in an embodiment of the present application;

[0099] Figure 4 A schematic diagram of a process for determining the positions of check bits and information bits in a mother code sequence provided in an embodiment of the present application;

[0100] Figure 5 A flowchart of a decoding method provided in an embodiment of the present application;

[0101] Figure 6 A schematic diagram of a shift register provided in an embodiment of the present application;

[0102] Figure 7 A schematic diagram of a shift register provided in an embodiment of the present application;

[0103] Figure 8 A transmission performance schematic diagram provided for an embodiment of the present application;

[0104] Fig. 9 A schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0105] Fig.10 A schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0106] Fig.11 A schematic diagram of the structure of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0107] 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), worldwide 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 narrow band internet of things (NB-IoT) communication system, etc. The technical solution of the embodiment of the present application can also be applied to a satellite communication system, wherein the satellite communication system can be integrated with the above-mentioned communication system.

[0108] In order to facilitate understanding of the embodiments of the present application, Figure 1 The communication system architecture shown in FIG. 1 is used as an example to illustrate the application scenarios used in this application. Figure 1As shown, the communication system includes a network device 101 and a terminal device 102. The communication apparatus provided in the embodiment of the present application can be applied to the network device 101 or to the terminal device 102. It can be understood that Figure 1 Only one possible communication system architecture to which the embodiments of the present application can be applied is shown. In other possible scenarios, the communication system architecture may also include other devices.

[0109] The network device 101 is a node in a radio access network (RAN), which may be referred to as an access network device, a RAN node, etc. Optionally, the RAN may be a cellular system related to 3GPP, for example, 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 (open RAN, O-RAN or ORAN), a cloud radio access network (cloud radio access network, CRAN), or a wireless fidelity (wireless fidelity, WiFi) system. The RAN may also be a communication system that integrates two or more of the above systems.

[0110] 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 the vehicle to everything (V2X) technology may be a road side unit (RSU).

[0111] 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 can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as a remote radio unit (RRU), an active antenna unit (AAU) or a remote radio head (RRH).

[0112] 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 (opencentralized unit, O-CU) or an open CU, DU may also be called an open distributed unit (opendistributed unit, O-DU), CU-CP may also be called an open-centralized unit-control plane (opencentralized unit control plane, O-CU-CP), CU-UP may also be called an open-centralized unit-user plane (open centralized unit user plane, O-CU-UP), and RU may also be called an open radio unit (openradio unit, O-RU). For the convenience of description, CU, CU-CP, CU-UP, DU and RU are used as examples for description in this application. Any of the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

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

[0114] The terminal device 102, which may also be referred to as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device that provides voice or data connectivity to users, and may also be an IoT device. For example, the terminal device includes a handheld device with wireless connection function, a vehicle-mounted device, etc. At present, terminal devices can be: mobile phones, tablet computers, laptops, PDAs, mobile internet devices (MID), 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.

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

[0116] The network devices and terminals can be fixed or movable. The network devices and terminals can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on aircraft, balloons, and artificial satellites in the air. The embodiments of the present application do not limit the application scenarios of the network devices and terminals.

[0117] In the embodiments of the present application, "at least one" refers to one or more, and "plurality" 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: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after 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.

[0118] In this application, "exemplary", "in some embodiments", "in other embodiments", etc. are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Rather, the use of the word "exemplary" is intended to present concepts in a concrete way.

[0119] In this application, "of", "corresponding", and "corresponding" can sometimes be used interchangeably. It should be noted that when the distinction is not emphasized, the meanings they express are consistent. In the embodiments of this application, communication and transmission can sometimes be used interchangeably. It should be noted that when the distinction is not emphasized, the meanings they express are consistent. For example, transmission can include sending and / or receiving, which can be a noun or a verb.

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

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

[0122] by Figure 1 Taking the communication system shown in the figure as an example, in order to ensure the reliability of communication between devices, the sending end can encode the information to be sent, and correspondingly, the receiving end decodes the encoded information after receiving it. Figure 2In the encoding and decoding process shown, the source of the transmitter is sent on the channel after source coding, channel coding, rate matching and modulation. After receiving the signal, the receiver obtains the destination after demodulation, rate matching, channel decoding and source decoding. Among them, the transmitter and the receiver can be used as a network device or a terminal device respectively. 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 a transmitter or a receiver. In addition, the present application does not exclude that both the transmitter and the receiver are terminal devices, and D2D communication is performed between the transmitter and the receiver. The method provided in the embodiment of the present application can be used in the channel coding process.

[0123] like Figure 3 The method can be applied to a first communication device; wherein the first communication device can be as follows Figure 2 The transmitting end in the encoding and decoding process shown in FIG. 1 ; correspondingly, the second communication device may be as follows Figure 2 The receiving end in the encoding and decoding process shown. Exemplarily, when the first communication device is a terminal device or a module (such as a chip) in a terminal device, the second communication device can be a terminal device or a module (such as a chip) in a terminal device, or the second communication device can also be a network device or a module (such as a chip) in a network device; when the first communication device is a network device or a module (such as a chip) in a network device, the second communication device can be a module (such as a chip) in a terminal device. The method includes:

[0124] Step 300: A first communication device obtains a first sequence.

[0125] 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 encoded.

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

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

[0128] The mother code sequence may also be referred to as 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 descending order of reliability; illustratively, N is an integer greater than 0.

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

[0130] When determining the mother code sequence, the first communication device may determine the mother code sequence according to the length K of the first sequence, or may determine the mother code sequence according to the length K of the first sequence and a transmission code length E; wherein 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.

[0131] The specific manner in which the first communications device determines the mother code sequence may be implemented by conventional means.

[0132] Step 302: The first communication device performs polarization encoding on the check bits and the first sequence according to the mother code sequence; wherein the check bits include a first check bit and a second check bit.

[0133] The first communication device determines positions of the check bits and the information bits in the first sequence in a mother code sequence during polarization coding; and the first communication device performs polarization coding on the check bits and the first sequence according to positions of the check bits and the information bits in the first sequence in the mother code sequence.

[0134] The following describes a process for determining positions of check bits and information bits in a mother code sequence and a polarization coding process.

[0135] 1. The first communication device determines positions of check bits and information bits in a mother code sequence.

[0136] 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 follows: Figure 4 As shown, the following steps are included:

[0137] Step 400: The first communication device determines the number of first check bits.

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

[0139] Exemplarily, the check bits in the embodiment of the present application may include two types, namely, a first check bit and a second check bit. These two types of check bits may be divided based on the position of the check bit in the mother code sequence. For example, the first check bit may be a check bit that sacrifices the reliability of the message bit, and the second check bit may be a check bit that does not sacrifice the reliability of the message bit. It can be understood that the position of the first check bit in the mother code sequence may be at a position with higher reliability. Since the message bit is normally located at a position with higher reliability in the mother code sequence, when the position of the first check bit in the mother code sequence is a position with higher reliability, it will occupy the message bit position, thereby sacrificing the reliability of the message bit; the position of the second check bit in the mother code sequence may be at a position with lower reliability. Since the message bit is normally located at a position with higher reliability in the mother code sequence, when the position of the second check bit in the mother code sequence is a position with lower reliability, it will not occupy the message bit position, thereby not sacrificing the reliability of the message bit.

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

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

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

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

[0144] In possible implementation manner 2, when determining the number of first check bits, the embodiment of the present application may also consider the transmission code length, wherein 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 corresponding relationship may include a corresponding relationship between multiple message lengths, multiple transmission code lengths, and the number of first check bits.

[0145] For the above possible implementation manner 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.

[0146] For the above possible implementation manner 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 check bits corresponding to the first sequence from a first correspondence relationship including multiple message lengths, multiple transmission code lengths, and the number of first check bits according to the length K of the first sequence and the target transmission code length E.

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

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

[0149] For example, N=32, E=30, and the mother code sequence is 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 Punch the code sequence, and remove the puncturing position from the mother code sequence to obtain 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}.

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

[0151] 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}.

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

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

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

[0155] Exemplarily, the first communication device determines the set The minimum row weight w min , from the collection In the order of reliability from high to low, The row weight is equal to w min The position of is used as the position of the first check bit. The weight of the bank is equal to w min The position is less than , then in the set Determine the trip weight equal to w min After the position, 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.

[0156] 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, 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}.

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

[0158] Exemplary, set is {12, 20, 14, 15, 22, 27, 26, 23, 29, 16, 24, 28, 30, 31, 32}, the positions of the first check 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}.

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

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

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

[0162] Exemplarily, 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 mother code sequence The positions of 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}.

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

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

[0165] 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}.

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

[0167] The valid check bit may be an information bit carried by a subchannel before the subchannel carrying the check bit.

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

[0169] 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; correspondingly, the first communication device can use the position of the first check bit and the other positions of the second check bit except the valid check bit as frozen bits.

[0170] For example, the set DF corresponding to the position of the check bit 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 bit is simplified is {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 .

[0171] 2. The first communication device performs polarization encoding on the check bits and the first sequence according to positions of the check bits and the information bits in the first sequence in the mother code sequence.

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

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

[0174] 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 bits in the first sequence.

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

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

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

[0178] 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 highest bit); then the corresponding target PC equation is D 4 +D 3 +D 1 .

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

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

[0181] In possible implementation manner 2, the embodiment of the present application may also consider the transmission code length when determining the indication parameters of the PC equation, wherein 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 corresponding relationship may include a corresponding relationship between multiple message lengths, multiple transmission code lengths, and the indication parameters of the PC equation.

[0182] With respect to the above-mentioned possible implementation method 1, after acquiring 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.

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

[0184] After determining the check bits (including the first check bits and the second check bits), the first communication device maps the check bits and the information bits of the first sequence to generate a precoding sequence; illustratively, the first communication device may perform mapping according to the determined positions of the information bits and the positions of the check bits in the mother code sequence, map the information bits to the positions of the information bits in the mother code sequence, and map the check bits to the positions of the check bits in the mother code sequence, thereby generating the precoding sequence.

[0185] After the first communication device generates the precoding sequence, it performs polarization coding on the precoding sequence to obtain a coded codeword sequence; and the first communication device performs rate matching on the codeword sequence according to the target transmission code length E to obtain a second sequence. The length of the second sequence can be the target transmission code length E.

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

[0187] Based on the same inventive concept as the above encoding method, accordingly, the 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 as follows Figure 2 The receiving end in the encoding and decoding process shown in FIG. Figure 5 A flowchart of a decoding method is shown. The method comprises:

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

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

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

[0191] It should be noted that the manner in which the second communication device determines the mother code sequence corresponding to the first sequence can be referred to the introduction to step 301 above, and will not be repeated here.

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

[0193] 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 the corresponding relationship between the length K of the first sequence and the first check bit.

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

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

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

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

[0198] Optionally, the second communication device determines the target sequence according to the reliability and the row weight. locations.

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

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

[0201] 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 the positions, please refer to the introduction of step 402 above, which will not be repeated here.

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

[0203] 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 referred to the introduction to step 403 above, and will not be repeated here.

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

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

[0206] If the first communication device performs encoding 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 decoding.

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

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

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

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

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

[0212] In possible implementation manner 2, the embodiment of the present application may also consider the transmission code length when determining the indication parameters of the PC equation, wherein 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 corresponding relationship may include a corresponding relationship between multiple message lengths, multiple transmission code lengths, and the indication parameters of the PC equation.

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

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

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

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

[0217] Step 2, determine the bit type of the current decoding position: if it is a frozen bit, the decoding fixed output is 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.

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

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

[0220] The first corresponding relationship and the second corresponding relationship in the above encoding process and decoding process are described in detail below.

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

[0222] Example 1:

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

[0224] Among them, in the first corresponding relationship, a message length and a transmission code length correspond to a number of first check bits; when the message length and / or the transmission code length are different, the corresponding number of first check bits can be the same or different. In the second corresponding relationship, a message length and a transmission code length correspond to an indication parameter of a PC equation; when the message length and / or the transmission code length are different, the corresponding indication parameter of the PC equation can be the same or different.

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

[0226] Exemplarily, there are multiple corresponding relationships shown in Table 1, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e, and a number of first check bits. In Table 1, the value determined according to 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 check bits. For example, when k=3 and e=32, the corresponding number of first check bits is 3; for another example, when k=5 and e=26, the corresponding number of first check bits is 1.

[0227] Optionally, the first corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 1.

[0228] In Table 1, it is taken as an example that the value range of k is 3 to 11 and the value range of e is 4 to 32.

[0229] Table 1

[0230]

[0231]

[0232] Exemplarily, there are multiple corresponding relationships as shown in Table 2, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e, and an indication parameter of a PC equation. In Table 2, the value determined according to the row where the message length k is located and the column where the transmission code length e is located is the indication parameter of the PC equation. For example, when k=3 and e=32, the corresponding indication parameter of the PC equation is 9; for another example, when k=4 and e=22, the corresponding indication parameter of the PC equation is 96.

[0233] Optionally, the second corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 2.

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

[0235] Table 2

[0236]

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

[0238] As shown in Table 3, there are multiple corresponding relationships, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 3, the values ​​determined according to 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 check bits and the indication parameter of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 3 and the indication parameter of the PC equation is 9; for another example, when k=4 and e=22, the corresponding number of first check bits is 1 and the indication parameter of the PC equation is 96.

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

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

[0241] Table 3:

[0242]

[0243] 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 1, 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 indication parameters of the target PC equation, a precoding sequence is generated according to the determined information bit position and check bit position in the mother code sequence.

[0244] Exemplarily, the pseudo code for generating the precoding sequence by the first communication device is as follows, wherein, taking the determined indicating parameter of the target PC equation as 26 as an example, the shift register used can be as follows: Figure 6 As shown. When the indicator parameter of the target PC equation is 26, its binary representation is [1 1 0 1 0] (the leftmost bit is the highest bit), the target PC equation is D 4 +D 3 +D 1 , that is, the tap positions are y4, y3, and y1; L is the highest power index 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.

[0245]

[0246]

[0247] Example 2:

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

[0249] Among them, in the first corresponding relationship, a message length and a transmission code length correspond to a number of first check bits; when the message length and / or the transmission code length are different, the corresponding number of first check bits can be the same or different. In the second corresponding relationship, a message length and a transmission code length correspond to an indication parameter of a PC equation; when the message length and / or the transmission code length are different, the corresponding indication parameter of the PC equation can be the same or different.

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

[0251] Exemplarily, multiple corresponding relationships are shown in Table 4, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e, and a number of first check bits. In Table 4, the value determined according to 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 check bits. For example, when k=3 and e=32, the corresponding number of first check bits is 2; for another example, when k=6 and e=23, the corresponding number of first check bits is 3.

[0252] Optionally, the first corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 4.

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

[0254] Table 4

[0255]

[0256]

[0257] Exemplarily, there are multiple corresponding relationships as shown in Table 5, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e and an indication parameter of a PC equation. In Table 5, the value determined according to the row where the message length k is located and the column where the transmission code length e is located is the indication parameter of the PC equation. For example, when k=3 and e=32, the corresponding indication parameter of the PC equation is 88; for another example, when k=5 and e=10, the corresponding indication parameter of the PC equation is 70.

[0258] Optionally, the second corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 5.

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

[0260] Table 5

[0261]

[0262]

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

[0264] As shown in Table 6, there are multiple corresponding relationships, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 6, according to the row where the message length k is located and the column where the transmission code length e is located, the values ​​determined are the number of first check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 2 and the indication parameter of the PC equation is 88; for another example, when k=4 and e=22, the corresponding number of first check bits is 3 and the indication parameter of the PC equation is 9.

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

[0266] In Table 6, it is taken as an example that the value range of k is 3 to 11 and the value range of e is 4 to 32.

[0267] Table 6

[0268]

[0269] 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 indication parameters of the target PC equation, a precoding sequence is generated according to the determined information bit position and check bit position in the mother code sequence.

[0270] Exemplarily, the pseudo code for generating the precoding sequence by the first communication device is as follows, wherein, taking the determined indicating parameter of the target PC equation as 52 as an example, the shift register used can be as follows: Figure 7 As shown. When 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 highest 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 index of the target PC equation, such as D here 5 +D 4 +D 2 Corresponding L=5, the number of shift registers is 6.

[0271]

[0272] 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 the 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.

[0273] Among them, when the message length is different and / or the transmission code length is different, the set threshold corresponding to the valid check bit may also be different. Exemplarily, 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 10 (that is, when k=11 and e=32, the number of valid check 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 corresponding to the number of valid check bits is 12 (that is, when k=9 and e=30, the number of valid check bits in the mother code sequence is less than or equal to 12).

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

[0275] Exemplarily, there are multiple corresponding relationships as shown in Table 7, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e, and a set threshold value corresponding to the number of valid check bits. In Table 7, the value determined according to the row where the message length k is located and the column where the transmission code length e is located is the set threshold value corresponding to the number of valid check bits. For example, when k=3 and e=32, the set threshold value corresponding to the number of valid check bits is 6; for another example, when k=5 and e=10, the set threshold value corresponding to the number of valid check bits is 3.

[0276] Optionally, the third corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 7.

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

[0278] Table 7

[0279]

[0280]

[0281] 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 one table. For example, a table includes the correspondence between the message length k, the transmission code length e and the number of first check bits, the indication parameter of the PC equation, and the set threshold corresponding to the number of valid check bits. For another example, a table includes the correspondence between the message length k, the transmission code length e and the number of first check bits, and the set threshold corresponding to the number of valid check bits.

[0282] In the above examples 1 and 2, the number of first check bits and the indication parameters of the PC equation are independently designed for each group of message lengths and transmission code lengths. In addition, in the embodiments of the present application, the number of first check bits and the indication parameters of the PC equation can also be designed for message lengths and / or transmission code lengths within different ranges.

[0283] Optionally, in the first corresponding relationship, 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 corresponding relationship, for message lengths within the first length range, the indication parameters of the PC equation corresponding to the same message length are the same.

[0284] 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 the 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 equations are the same.

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

[0286] Example 3:

[0287] In this example, in the first corresponding relationship, the same message length within the first length range corresponds to the same number of first check bits; in the second corresponding relationship, the same message length within the first length range corresponds to the same indication parameters of the PC equation; 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.

[0288] 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 26 of the PC equation can be referred to as a set of PC parameters.

[0289] In this example, each message length in the first length range uses a set of PC parameters, and different message lengths in the first length range correspond to different sets of PC parameters. 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.

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

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

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

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

[0294] 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;

[0295] 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;

[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: 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;

[0297] 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;

[0298] 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: 1≤ek≤7 corresponds to a set of PC parameters; 8≤ek≤10 and 15≤ek≤21 correspond to a set of PC parameters; 11≤ek≤14 corresponds to a 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] Exemplarily, there are multiple corresponding relationships as shown in Table 8, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 8, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 26; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 17.

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

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

[0303] Table 8

[0304]

[0305]

[0306] 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 correspond to one table respectively.

[0307] 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 the 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.

[0308] Among them, when the message length is different and / or the transmission code length is different, the set threshold corresponding to the valid check bit may also be different. Exemplarily, 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 (that is, 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 (that is, when k=9 and e=30, the number of valid check bits is less than or equal to 10).

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

[0310] Exemplarily, there are multiple corresponding relationships as shown in Table 9, where each corresponding relationship is a corresponding relationship between a message length k, a transmission code length e, and a set threshold value corresponding to the number of valid check bits. In Table 9, the value determined according to the row where the message length k is located and the column where the transmission code length e is located is the set threshold value corresponding to the number of valid check bits. For example, when k=3 and e=32, the set threshold value corresponding to the number of valid check bits is 0; for another example, when k=5 and e=10, the set threshold value corresponding to the number of valid check bits is 2.

[0311] Optionally, the third corresponding relationship in the embodiment of the present application may include at least one corresponding relationship in Table 9.

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

[0313] Table 9

[0314]

[0315]

[0316] 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 one table. For example, a table includes the correspondence between the message length k, the transmission code length e and the number of first check bits, the indication parameter of the PC equation, and the set threshold corresponding to the number of valid check bits. For another example, a table includes the correspondence between the message length k, the transmission code length e and the number of first check bits, and the set threshold corresponding to the number of valid check bits.

[0317] Example 4:

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

[0319] In this example, all message lengths within the first length range use a set of PC parameters. 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-6.

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

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

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

[0323] 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, and the same as the PC parameters corresponding to 3≤k≤6;

[0324] 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 same as the PC parameters corresponding to 3≤K≤6;

[0325] 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 same as the PC parameters corresponding to 3≤k≤6;

[0326] 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, and the same as the PC parameters corresponding to 3≤K≤6;

[0327] 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 same as the PC parameters corresponding to 3≤K≤6;

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

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

[0330] Exemplarily, there are multiple corresponding relationships as shown in Table 10, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 10, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 52; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 52.

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

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

[0333] Table 10

[0334]

[0335] 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 correspond to one table respectively.

[0336] Example 5:

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

[0338] In this example, all message lengths within the first length range use a set of PC parameters. 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-6.

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

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

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

[0342] 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;

[0343] 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;

[0344] 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;

[0345] 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, which are the same as the PC parameters of 3≤K≤6;

[0346] 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, which are the same as the PC parameters of 3≤K≤6;

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

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

[0349] Exemplarily, there are multiple corresponding relationships as shown in Table 11, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 11, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 52; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 52.

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

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

[0352] Table 11

[0353]

[0354]

[0355] 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 correspond to one table respectively.

[0356] Example 6:

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

[0358] In this example, all message lengths within the first length range use a set of PC parameters. 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-6.

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

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

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

[0362] 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, and the same as the PC parameters of 3≤k≤6;

[0363] 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;

[0364] 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;

[0365] 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, which are the same as the PC parameters of 3≤k≤6;

[0366] 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;

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

[0368] 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 the first check bits n, and the indicator parameter p of the PC equation.

[0369] Exemplarily, there are multiple corresponding relationships as shown in Table 12, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 12, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 52; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 52.

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

[0371] In Table 12, it is taken as an example that the value range of k is 3 to 11 and the value range of e is 4 to 32.

[0372] Table 12

[0373]

[0374] 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 correspond to one table respectively.

[0375] Example 7:

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

[0377] In this example, all message lengths within the first length range use a set of PC parameters. 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-6.

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

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

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

[0381] 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, which are the same as the PC parameters of 3≤k≤6;

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

[0383] 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 the first check bits n, and the indicator parameter p of the PC equation.

[0384] Exemplarily, there are multiple corresponding relationships as shown in Table 13, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 13, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 52; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 52.

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

[0386] In Table 13, it is taken as an example that the value range of k is 3 to 11 and the value range of e is 4 to 32.

[0387] Table 13

[0388]

[0389] 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 correspond to one table respectively.

[0390] Example 8:

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

[0392] In this example, all message lengths within the first length range use a set of PC parameters. 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-6.

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

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

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

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

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

[0398] Exemplarily, there are multiple corresponding relationships as shown in Table 14, each of which is a corresponding relationship between a message length k, a transmission code length e, a number of first check bits, and an indication parameter of the PC equation. In Table 14, the values ​​determined according to 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 check bits n and the indication parameter p of the PC equation. For example, when k=3 and e=32, the corresponding number of first check bits is 0 and the indication parameter of the PC equation is 52; for another example, when k=8 and e=29, the corresponding number of first check bits is 4 and the indication parameter of the PC equation is 26.

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

[0400] In Table 14, it is taken as an example that the value range of k is 3 to 11 and the value range of e is 4 to 32.

[0401] Table 14

[0402]

[0403]

[0404] 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 correspond to one table respectively.

[0405] 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. The missing parts in the above tables in the embodiments of the present application indicate that the corresponding relationship of the corresponding positions does not exist; for example, in the above tables, there is no value in the corresponding position where k is 5 and e is 4, indicating that there is no corresponding relationship where k is 5 and e is 4.

[0406] 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 each message length; 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.

[0407] The embodiments of the present application are based on the above-mentioned 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 polarizes and rate-matches the first sequence to obtain the second sequence according to the number of first check bits and the indicating parameters of the PC equation determined by any of the above-mentioned methods, and the first communication device sends the second sequence to the second communication device. Compared with the related art, the scheme provided by the embodiments of the present application has greatly improved transmission performance. 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 scheme provided by the embodiments 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 scheme provided by the embodiments of the present application is lower than the signal-to-noise ratio in the related art scheme.

[0408] like Figure 8The embodiment of the present application provides a schematic diagram of transmission performance of the scheme and related technologies 1 and 2; wherein the horizontal axis represents different transmission code lengths, and the vertical axis represents the signal-to-noise ratio when the bit error rate is guaranteed to be less than 1%. Exemplarily, related technology 1 can be a PC-polar coding scheme with nested PC equations; related technology 2 can be an LTE-RM code and an FHT decoding scheme.

[0409] It is to be understood that each device in the above embodiment can perform some or all of the steps in each embodiment. These steps or operations are only examples, and the embodiments of the present application can also perform other operations or deformations of various operations. In addition, each step can be performed in a different order 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 internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0410] The communication device provided in the embodiment of the present application is described below.

[0411] Fig. 9 This is a schematic diagram of the structure of the communication device of the embodiment of the present application. Fig. 9 , the communication device can be used to perform Figure 3 , Figure 4 For details of the process performed by the first communication device in any of the embodiments shown, please refer to the relevant introduction in the above method embodiments.

[0412] The communication device 900 includes a communication unit 901 and a processing unit 902 .

[0413] The processing unit 902 is used for data processing. The communication unit 901 can realize the corresponding communication function. The communication unit 901 can also be called a communication interface or a communication module or a transceiver unit or a transceiver module.

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

[0415] The communication device 900 can be used to perform the actions performed by the first communication device in the above method embodiment. The communication device 900 can be a first communication device or a component (such as a chip) that can be configured in the first communication device. The processing unit 902 is used to perform the processing-related operations of the first communication device in the above method embodiment. The communication unit 901 is used to perform the reception-related operations of the first communication device in the above method embodiment.

[0416] Optionally, the communication unit 901 may include a sending unit and a receiving unit. The sending unit is used to perform the sending operation in the above method embodiment. The receiving unit is used to perform the receiving operation in the above method embodiment.

[0417] It should be noted that the communication unit 901 may include a sending unit but not a receiving unit. Alternatively, the communication device 900 may include a receiving unit but not a sending unit. Specifically, it may depend on whether the above solution executed by the communication device 900 includes a sending action and a receiving action.

[0418] Optionally, the communication device 900 is used to perform the above Figure 3 , Figure 4 The actions performed by the first communication device in any of the embodiments shown.

[0419] Fig.10 This is a schematic diagram of the structure of the communication device of the embodiment of the present application. Fig.10 , the communication device can be used to perform Figure 5 For details of the process performed by the second communication device in any of the embodiments shown, please refer to the relevant introduction in the above method embodiments.

[0420] The communication device 1000 includes a communication unit 1001 and a processing unit 1002 .

[0421] The processing unit 1002 is used for data processing. The communication unit 1001 can realize the corresponding communication function. The communication unit 1001 can also be called a communication interface or a communication module or a transceiver unit or a transceiver module.

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

[0423] The communication device 1000 can be used to perform the actions performed by the second communication device in the above method embodiment. The communication device 1000 can be a second communication device or a component (such as a chip) that can be configured in the second communication device. The processing unit 1002 is used to perform the processing-related operations of the second communication device in the above method embodiment. The communication unit 1001 is used to perform the reception-related operations of the second communication device in the above method embodiment.

[0424] Optionally, the communication unit 1001 may include a sending unit and a receiving unit. The sending unit is used to perform the sending operation in the above method embodiment. The receiving unit is used to perform the receiving operation in the above method embodiment.

[0425] It should be noted that the communication unit 1001 may include a sending unit but not a receiving unit. Alternatively, the communication device 1000 may include a receiving unit but not a sending unit. Specifically, it may depend on whether the above solution executed by the communication device 1000 includes a sending action and a receiving action.

[0426] Optionally, the communication device 1000 is used to perform the above Figure 5 The actions performed by the second communication device in any of the embodiments shown.

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

[0428] In one possible approach, the communication device may be as follows Fig.11 As shown, the device may be a communication device or a chip in a communication device, wherein the communication device may be the first communication device in the above embodiment or the second communication device in the above embodiment. The device includes a processor 1101 and a communication interface 1102, and may also include a memory 1103. Among them, the processing unit 902 and the processing unit 1002 may be the processor 1101. The communication unit 901 and the communication unit 1001 may be the communication interface 1102. Optionally, the processor 1101 and the memory 1103 may also be integrated together.

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

[0430] The processor 1101 is used to execute the program code stored in the memory 1103, specifically to execute the actions of the processing unit 902 or the processing unit 1002, which will not be described in detail in this application. The communication interface 1102 is specifically used to execute the actions of the communication unit 901 or the communication unit 1001, which will not be described in detail in this application.

[0431] The specific connection medium between the communication interface 1102, the processor 1101 and the memory 1103 is not limited in the embodiment of the present application. Fig.11 In the embodiment, the memory 1103, the processor 1101 and the communication interface 1102 are connected via a bus 1104. Fig.11 The connections between other components are shown in bold lines, which are only for illustration and are not intended to be limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.11 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

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

[0433] The present application also provides a communication system, including a Figure 3 or Figure 4 A first communication device and a method for implementing Figure 5 The second communication device in the embodiment of the present invention.

[0434] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may 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 may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0435] 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 process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart 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 generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0436] These computer program instructions may also be stored in a computer-readable memory capable of directing 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 an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0437] 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, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

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

Claims

1. A 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; determining, according to the K, a mother code sequence corresponding to the first sequence; 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 operations in 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