WO2019158031A1 - 编码的方法、译码的方法、编码设备和译码设备 - Google Patents

编码的方法、译码的方法、编码设备和译码设备 Download PDF

Info

Publication number
WO2019158031A1
WO2019158031A1 PCT/CN2019/074794 CN2019074794W WO2019158031A1 WO 2019158031 A1 WO2019158031 A1 WO 2019158031A1 CN 2019074794 W CN2019074794 W CN 2019074794W WO 2019158031 A1 WO2019158031 A1 WO 2019158031A1
Authority
WO
WIPO (PCT)
Prior art keywords
length
polarization
code
coding
sequence
Prior art date
Application number
PCT/CN2019/074794
Other languages
English (en)
French (fr)
Inventor
徐晨
李榕
张华滋
皇甫幼睿
王献斌
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2019158031A1 publication Critical patent/WO2019158031A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
    • H03M13/255—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with Low Density Parity Check [LDPC] codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Definitions

  • the present application relates to the field of communications, and in particular, to a coding method, a decoding method, an encoding device, and a decoding device.
  • information data is transmitted between a transmitting device (for example, a network device or a terminal device) and a receiving device (for example, a terminal device or a network device). Since the wireless propagation environment is complex and variable, it is susceptible to interference and appears. error. In order to reliably transmit the information data, the source device performs channel coding and the like on the information data. The receiving device needs to perform channel decoding and the like to restore the information data. These processes can reduce transmission errors and improve the reliability of data transmission.
  • Low density parity check (LDPC) code is a kind of linear block coding with sparse check matrix, which has the characteristics of flexible structure and low decoding complexity. Because it uses a partially parallel iterative decoding algorithm, it has a higher throughput than the traditional Turbo code.
  • the LDPC code is considered to be the next-generation error correction code of the communication system, and can be used to improve the reliability and power utilization of channel transmission; and can be widely applied to space communication, optical fiber communication, personal communication systems, ADSL, and magnetic recording equipment. At present, LDPC codes have been considered as one of channel coding methods in new radio (NR) communication technologies.
  • the current LDPC code of the enhanced mobile broadband (eMBB) scenario in the NR standard may have an error floor in the partial code length code rate, which requires higher data packet error rate.
  • the Ultra-reliable low latency communications (URLLC) scenario is intolerable.
  • the present application provides a coding method, a decoding method, an encoding device, and a decoding device, which can reduce the error leveling phenomenon of the LDPC code.
  • a method of encoding comprising:
  • Polarization-encoded parameters are determined according to the length K of the information bits and/or the first target code length M of the first coding sequence, the polarization-encoded parameters including the code rate of the polarization coding or the code length M of the polarization coding o , wherein the code rate of the polarization code represents a ratio of K to M o , wherein K, M and M o are positive integers;
  • the error code capability of the Polar code is used to bypass the trapping set of the LDPC code by cascading the LDPC code of the Polar code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • the parameter of the polarization coding is a code rate of the polarization coding, and the first target code according to the length K of the information bit and/or the first coding sequence.
  • Length M determine the parameters of the polarization encoding, including:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R o2 are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • a can be equal to 0 and b ⁇ [0.85, 0.95], or a ⁇ [1/48000, 1/47000] and b ⁇ [0.85, 0.9];
  • the values of a and b can be taken as a pair of values in the two sets of values shown in Table 1.
  • the values of a and b may be a pair of values in the first group.
  • the value of a is 0, and the value of b is 0.85, 0.90, 0.92, 0.93, or 0.95.
  • the values of a and b may be a pair of values in the second group.
  • the value of a is 1/48000, and the value of b is 0.9.
  • the value of a is 1/48000, and the value of b is 0.85.
  • the value of a is 1/47500.
  • the value of b is The value of the value is 0.85; or the value of a is 1/47500, and the value of b is 0.88; or the value of a is 1/47000, and the value of b is 0.90.
  • the embodiment of the present application is not limited thereto.
  • the values of a and b may be any one of the two ranges of values shown in Table 1.
  • the embodiment of the present application can ensure that the code rate Ro of the polarization coding should be as large as possible, so that the performance loss of the concatenated code can be reduced, and in the case where the information bit length K is less than 35000, Ro in the implementation of the present application The value is up to 0.95. Therefore, the code rate Ro of the polarization coding in the embodiment of the present application can ensure that the polarization coding has sufficient error correction capability. Therefore, the embodiment of the present application can correct the decoding result that falls in the trapping set. In order to avoid or reduce the error leveling phenomenon of the LDPC code.
  • R o is a piecewise function of K. That is to say, the transmitting device can determine the code rate of the polarization code according to the length K of the information bit by using the second formula described above.
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R o2 are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • R o1 ⁇ R o2 ⁇ ...R o2 and both belong to [0.85 to 0.95].
  • the second formula for calculating R o described above may be in the form of a face.
  • the embodiment of the present application can ensure that the code rate R o of the polarization coding should be as large as possible, so that the performance loss of the concatenated code can be reduced, and the value of R o in the implementation of the present application is at most 0.95. Therefore, the polarization coding rate R o in the embodiment of the present application can ensure that the polarization coding has sufficient error correction capability. Therefore, the embodiment of the present application can correct the decoding result falling in the trapping set. In order to avoid or reduce the error leveling phenomenon of the LDPC code.
  • the parameter of the polarization coding is a code length M o of the polarization coding, where the length K according to the information bit and/or the first sequence of the first coding sequence
  • the target code length M determines the parameters of the polarization coding, including:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • the calculation of M o according to the above formula can ensure that the code rate R o of the polarization coding should be as large as possible, and can ensure that the polarization coding has sufficient error correction capability. Therefore, the embodiment of the present application can fall into the trap.
  • the decoding result in the trapping set is error-corrected, thereby avoiding or reducing the error leveling phenomenon of the LDPC code.
  • the information bit is polarization-encoded according to the polarization-encoded parameter, to obtain a second code sequence whose second target code length is M o , include:
  • the second coding sequence of length M o is obtained, the second coding sequence comprising the p sub-coding sequences.
  • the embodiment of the present application performs polarization coding on the information bit segment, which can reduce the delay of the concatenated coding.
  • the embodiment of the present application can prevent the error from exceeding the error length by segmentation, avoid repeated coding, and improve coding efficiency.
  • p is the smallest integer that satisfies the following inequality:
  • the number of bits per block of information is the number of bits per block of information.
  • each information block is rounded up by K/p. Therefore, when K/p is a decimal, the sum of the lengths of the p information blocks may be greater than K. In this case, the application is implemented. For example, information bits need to be filled.
  • the filling manner may be to fill K seg ⁇ pK 0 bits or 1 bit for the head, tail or intermediate position of any piece of information bits; or to fill the head, tail or intermediate position of any K seg ⁇ pK segment information bits. 1 0 bit or 1 bit.
  • the information bits when information bit filling needs to be performed, the information bits may be first segmented and refilled, that is, K information bits may be first divided into p segments, and then at least one segment of the p segments is filled with information bits to obtain p. Information blocks. It should be understood that the number of bits of the p information blocks are equal.
  • the information bits when information bit filling is required, the information bits may be first filled and then segmented, that is, K information bits may be padded first, and then the information bits obtained after the padding are indexed and divided into p. Information blocks.
  • the determining, according to the K information bits, the p information blocks specifically includes:
  • the information bits of length K are divided into p segments, and at least one information block in the p segment information blocks is padded to obtain the p information blocks.
  • the embodiment of the present application may first divide the information bits into 4 segments. For example, the length of the segmented information blocks is 4, 4, and 3 respectively. , 3. Then, the last two blocks of the four information blocks can be filled with 1 bit, for example, padding 0 bits, or 1 bit. The length of each information block after padding is 4. It should be understood that the padded 1 bit can be filled in the head, tail or intermediate position of the information block to be filled, and the embodiment of the present application is not limited thereto.
  • the embodiment of the present application may first divide the information bits into 4 segments. For example, the length of the segmented information blocks is 4, 4 respectively. , 4, 2. Then, the last information block of the four information blocks can be filled with 2 bits, for example, 2 0 bits, or 2 1 bits. The length of each information block after padding is 4. It should be understood that the padded 2 bits may be filled in the head, tail or intermediate position of the information block to be filled, and the embodiment of the present application is not limited thereto.
  • Determining the p information blocks according to the K information bits specifically includes: filling the information bits of length K such that the number of bits after padding is equal to K seg ⁇ p,
  • the information bits after the completion of the filling are divided into p segments, P information blocks are obtained, and the p information blocks are separately polarization coded.
  • the embodiment of the present application may first fill 2 information bits for K information bits. For example, padding 0 bits or 1 bit. It should be understood that the padded 2 bits may be the head, tail or intermediate position of the information bit, and the embodiment of the present application is not limited thereto. After the padding is completed, the information bits of length 16 are obtained. Then, the information bit of length 16 can be divided into lengths into 4 segments, each segment of information is equal in length, and each segment of information is 4 bits in length. The p-segment information block is then polarization coded separately.
  • the transmission side apparatus may first determine the size of the K and K SEG, if it is determined K ⁇ K seg, Example manner described above to the information bits are segmented embodiment of the present application, and Polarization coding is performed separately for each segment.
  • the transmitting end device may not need to make a judgment, and may directly determine the value of p according to the formula of determining p above. When p is 1, the transmitting end device does not need to segment the information bits. When the value of p is greater than 1, the transmitting device divides the information bits into p segments, and performs polarization encoding on the p information blocks.
  • the embodiment of the present application is not limited thereto.
  • the transmitting device needs to combine the p sub-coding sequences to obtain a length of The second coding sequence of M o .
  • the sending end device may sequentially cascade or interleave the p sub-coding sequences to obtain the second coding sequence.
  • Embodiments of the present application can reduce the complexity of encoding and decoding by sequentially cascading p sub-coding sequences.
  • the embodiment of the present application can enhance the anti-interference ability by interleaving the p sub-code sequences.
  • a method for decoding comprising: acquiring a first sequence to be decoded of length M;
  • the polarization-encoded parameters including a coded rate of polarization coding or a code of polarization coding a length M o , wherein the code rate of the polarization code represents a ratio of K to M o , wherein the sequence length of the LDPC code is equal to the code length M o of the polarization code, where K, M and M o are positive integers Performing LDPC decoding on the first to-be-decoded sequence to obtain a second to-be-decoded sequence of length M o ; performing polarization translation on the second to-be-decoded sequence according to the polarization-encoded parameter The code obtains a decoded information bit of length K.
  • the error correction capability of the Polar code bypasses the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • the method performed by the decoding end corresponds to the method performed by the encoding end, and a detailed description is omitted as appropriate in order to avoid redundancy.
  • the parameter of the polarization coding is a code rate of the polarization coding, the length of the information bit according to the coded K and/or the first to be decoded
  • the length M of the sequence, determining the parameters of the polarization encoding includes determining the code rate of the polarization encoding according to the length K of the encoded information bits using any one of the following two formulas:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R on are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • the parameter of the polarization coding is a code length M o of the polarization coding, the length K according to the coded information bit, and/or the first to The length M of the decoding sequence determines the parameters of the polarization encoding, including:
  • Determining the parameters of the polarization encoding according to the length K of the encoded information bits and/or the length M of the first to-be-decoded sequence including:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • the performing, by performing a polarization decoding on the second to-be-decoded sequence, to obtain a decoding information bit of length K includes:
  • the second sequence to be decoded is divided into p sub-codes to be decoded, and p is an integer greater than or equal to 2;
  • the error correction capability of the Polar code bypasses the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • an encoding device comprising a respective module or unit for performing the method of the first aspect or any of the possible implementations of the first aspect.
  • a decoding apparatus comprising various modules or units for performing the method of any of the possible implementations of the second aspect or the second aspect.
  • an encoding device including a transceiver, a processor, and a memory.
  • the processor is configured to control a transceiver transceiver signal for storing a computer program for calling and running the computer program from the memory, such that the terminal device performs the first aspect or any of the possible implementations of the first aspect The method in .
  • a decoding apparatus including a transceiver, a processor, and a memory.
  • the processor is configured to control a transceiver transceiver signal for storing a computer program, the processor for calling and running the computer program from the memory, such that the terminal device performs any of the second aspect or the second aspect The method in .
  • a computer readable medium having stored thereon a computer program, which when executed by a computer, implements the method of the first aspect or any of the possible implementations of the first aspect.
  • a computer readable medium having stored thereon a computer program, which when executed by a computer, implements the method of any of the possible implementations of the second aspect or the second aspect.
  • a computer program product is provided, the computer program product being implemented by a computer to implement the method of any of the first aspect or the first aspect of the first aspect.
  • a computer program product is provided, the computer program product being implemented by a computer to implement the method of any of the first aspect or the first aspect of the first aspect.
  • a processing apparatus including a processor and an interface
  • the foregoing interface may further complete the data interaction process by using a transceiver.
  • the processing device in the eleventh aspect may be a chip, and the processor may be implemented by using hardware or by software.
  • the processor may be a logic circuit, an integrated circuit, or the like;
  • the processor can be a general purpose processor implemented by reading software code stored in a memory, which can be integrated in the processor and can exist independently of the processor.
  • FIG. 1 is a schematic diagram of a system scenario applicable to an embodiment of the present application.
  • FIG. 2 is a schematic diagram of a data transmission process in an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of a communication method according to an embodiment of the present application.
  • FIG. 4 is a schematic block diagram of an encoding process in accordance with one embodiment of the present application.
  • FIG. 5 is a schematic flow chart of an encoding method according to an embodiment of the present application.
  • FIG. 6 is a comparison diagram of coding performance of the method of the embodiment of the present application and the existing method.
  • FIG. 7 is a schematic block diagram of an encoding process according to another embodiment of the present application.
  • FIG. 8 is a schematic block diagram of a decoding process in accordance with an embodiment of the present application.
  • FIG. 9 is a schematic flow chart of a decoding method according to an embodiment of the present application.
  • FIG. 10 is a schematic block diagram of a decoding process according to another embodiment of the present application.
  • FIG. 11 is a schematic block diagram of an encoding device in accordance with an embodiment of the present application.
  • Figure 12 is a schematic block diagram of a decoding device in accordance with one embodiment of the present application.
  • FIG. 13 is a schematic block diagram of an encoding device according to another embodiment of the present application.
  • FIG. 14 is a schematic block diagram of a decoding device according to another embodiment of the present application.
  • the embodiments of the present application are applicable to various communication systems, and therefore, the following description is not limited to a specific communication system.
  • GSM global system of mobile communication
  • CDMA code division multiple access
  • WCDMA wideband code division multiple access
  • System general packet radio service (GPRS), long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (time division duplex, TDD), universal mobile telecommunication system (UMTS), wireless local area networks (WLAN), wireless fidelity (WiFi), and next-generation communication systems
  • the fifth generation (5th generation, 5G) communication system for example, a new radio (NR) system.
  • the network device may be a global system of mobile communication (GSM) or a base transceiver station (BTS) in code division multiple access (CDMA), or may be a broadband A base station (nodeB, NB) in a code division multiple access (WCDMA), or an evolved base station (eNB/eNodeB) in long term evolution (LTE), or a relay station or an access point, or a network side device in a future 5G network, for example, a transmission point (TRP or TP) in an NR system, a base station (gNB) in an NR system, a radio unit in an NR system, such as a remote radio unit One or a group of base stations (including multiple antenna panels) in a 5G system, etc.
  • Different network devices may be located in the same cell or in different cells, and are not limited herein.
  • the gNB may include a centralized unit (CU) and a distributed unit (DU).
  • the gNB may also include a radio unit (RU).
  • the CU implements some functions of the gNB, and the DU implements some functions of the gNB.
  • the CU implements radio resource control (RRC), the function of the packet data convergence protocol (PDCP) layer, and the DU implements the wireless chain.
  • RRC radio resource control
  • PDCP packet data convergence protocol
  • the DU implements the wireless chain.
  • the functions of the radio link control (RLC), the media access control (MAC), and the physical (PHY) layer Since the information of the RRC layer eventually becomes information of the PHY layer or is transformed by the information of the PHY layer, high-level signaling, such as RRC layer signaling or PHCP layer signaling, can also be used in this architecture.
  • the network device can be a CU node, or a DU node, or a device including a CU node and a DU node.
  • the CU may be divided into network devices in the access network RAN, and the CU may be divided into network devices in the core network CN, which is not limited herein.
  • the terminal device may also be referred to as a user equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, and a terminal.
  • UE user equipment
  • the access terminal may be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), with wireless communication.
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistant
  • Functional handheld devices computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, drone devices, and terminal devices in future 5G networks or public land mobile networks in the future (public land mobile network)
  • the terminal device and the like in the PLMN are not limited in this embodiment of the present application.
  • the terminal device may also be a wearable device.
  • Wearable devices also known as wearable smart devices, are a general term for applying wearable technology to intelligently design everyday wearable devices and develop wearable devices such as glasses, gloves, watches, apparel, and shoes.
  • a wearable device is a portable device that is worn directly on the body or integrated into the user's clothing or accessories.
  • Wearable devices are more than just a hardware device, but they also implement powerful functions through software support, data interaction, and cloud interaction.
  • Generalized wearable smart devices include full-featured, large-size, non-reliable smartphones for full or partial functions, such as smart watches or smart glasses, and focus on only one type of application, and need to work with other devices such as smartphones. Use, such as various smart bracelets for smart signs monitoring, smart jewelry, etc.
  • the embodiments of the present application can be applied to any of the foregoing communication systems.
  • the embodiment of the present application can be applied to an LTE system and a subsequent evolved system, such as 5G, or other wireless communication systems that use various radio access technologies, such as using code points.
  • a wireless network using Massive Multiple-Input Multiple-Output (Massive MIMO) technology a wireless network using distributed antenna technology, and the like.
  • Massive Multiple-Input Multiple-Output Massive Multiple-Input Multiple-Output
  • FIG. 1 is a schematic diagram of a scenario of a communication system applicable to an embodiment of the present application.
  • the communication system 100 includes a network side device 102, and the network side device 102 may include a plurality of antenna groups.
  • Each antenna group may include multiple antennas, for example, one antenna group may include antennas 104 and 106, another antenna group may include antennas 106 and 110, and an additional group may include antennas 112 and 114.
  • Two antennas are shown in Figure 1 for each antenna group, although more or fewer antennas may be used for each group.
  • Network side device 102 may additionally include a transmitter chain and a receiver chain, as will be understood by those of ordinary skill in the art, which may include various components associated with signal transmission and reception (eg, processors, modulators, multiplexers, Demodulator, demultiplexer or antenna, etc.).
  • a transmitter chain and a receiver chain may include various components associated with signal transmission and reception (eg, processors, modulators, multiplexers, Demodulator, demultiplexer or antenna, etc.).
  • the network side device 102 can communicate with a plurality of terminal devices (e.g., the terminal device 116 and the terminal device 122). However, it will be appreciated that the network side device 102 can communicate with any number of terminal devices similar to the terminal device 116 or 122.
  • Terminal devices 116 and 122 may be, for example, cellular telephones, smart phones, portable computers, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, PDAs, and/or any other suitable for communicating over wireless communication system 100. device.
  • terminal device 116 is in communication with antennas 112 and 114, wherein antennas 112 and 114 transmit information to terminal device 116 over forward link 116 and receive information from terminal device 116 over reverse link 120.
  • terminal device 122 is in communication with antennas 104 and 106, wherein antennas 104 and 106 transmit information to terminal device 122 over forward link 124 and receive information from terminal device 122 over reverse link 126.
  • the forward link 116 can utilize a different frequency band than that used by the reverse link 120, and the forward link 124 can utilize the reverse link. 126 different frequency bands used.
  • FDD frequency division duplex
  • the forward link 116 and the reverse link 120 can use a common frequency band, a forward link 124, and a reverse link.
  • Link 126 can use a common frequency band.
  • Each set of antennas and/or areas designed for communication is referred to as a sector of the network side device 102.
  • the antenna group can be designed to communicate with terminal devices in sectors of the network side device 102 coverage area.
  • the transmit antenna of the network side device 102 can utilize beamforming to improve the signal to noise ratio of the forward links 116 and 124.
  • the neighboring cell is compared with the manner in which the network side device transmits a signal to all of its terminal devices through a single antenna. Mobile devices in the middle are subject to less interference.
  • the network side device 102, the terminal device 116, or the terminal device 122 may be a wireless communication transmitting device and/or a wireless communication receiving device.
  • the wireless communication transmitting device can encode the data for transmission.
  • the wireless communication transmitting device may acquire (eg, generate, receive from other communication devices, or store in memory, etc.) a certain number of data bits to be transmitted over the channel to the wireless communication receiving device.
  • Such data bits may be included in a transport block (or multiple transport blocks) of data that may be segmented to produce multiple code blocks.
  • the communication system 100 may be a public land mobile network PLMN network or a device to device (D2D) network or a machine to machine (M2M) network or other network, and FIG. 1 is merely an example for convenience of understanding.
  • PLMN public land mobile network
  • D2D device to device
  • M2M machine to machine
  • FIG. 1 is merely an example for convenience of understanding.
  • a simplified schematic diagram of the network may also include other network devices, which are not shown in FIG.
  • the transmitting end device sends the information data to the receiving end device.
  • the transmitting end device may be a network device in the communication system, such as a base station, and the corresponding receiving end.
  • the device can be a terminal.
  • the sender device may also be a terminal device
  • the receiver device may also be a network device.
  • the sending end device may also be referred to as an encoding device, and the receiving end device may also be referred to as a decoding device.
  • the embodiment of the present application is not limited thereto.
  • the transmitting end device when the transmitting end device needs to send information data, the transmitting end device first needs to perform channel coding on the information bits to be transmitted, obtain a target code sequence, modulate the target code sequence, and finally transmit and modulate through the channel. After the sequence.
  • the receiving device after receiving the sequence of the channel transmission, the receiving device respectively demodulates and obtains the information data after channel decoding.
  • rate matching is performed after channel coding, and the process of multiplexing, bit scrambling, and then the modulation process may be performed, and then interleaving, cell-related scrambling, and resource mapping to physical resources of the channel may be performed for transmission.
  • the receiving end can perform a corresponding inverse process to obtain the sink information.
  • the LDPC code of the enhanced mobile broadband (eMBB) scenario in the NR standard may have an error floor phenomenon at a partial code length code rate (that is, many medium code length LDPC code words are displayed.
  • the error leveling phenomenon that is, the steep signal-to-noise ratio and the bit error rate/block error rate curve suddenly become flat in a certain high signal-to-noise ratio region.
  • Ultra-reliable low latency communications (URLLC) scenarios where data packet loss rates are required are not tolerable.
  • the embodiment of the present application proposes a The method of information transmission can bypass or avoid reducing the error leveling phenomenon of the LDPC code by cascading the LDPC code of the Polar code and bypassing the trapping set of the LDPC code by using the error correction capability of the Polar code.
  • Polar code is the first and only known channel coding method that can be rigorously proven to "reach" the channel capacity. At different code lengths, especially for finite codes, the performance of Polar codes is much better than Turbo codes and LDPC codes. In addition, Polar codes have lower computational complexity in terms of encoding and decoding. These advantages make Polar code have great development and application prospects in 5G.
  • the polarization code is an encoding method that can achieve Shannon capacity and has low coding and decoding complexity.
  • B N is an N ⁇ N transposed matrix, such as a bit reversal matrix. Is the Kronecker power of F 2 , defined as
  • the Polar code is a channel dependent encoding, which performs Polar Codes code polarization processing on N identical channels W to obtain N polarized channels.
  • N polarized channels The Bhattacharyya parameter either tends to zero or tends to 1.
  • the set of position index numbers corresponding to the channel is called an Information Set.
  • the other part of the bit is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit. Complement Said.
  • K information symbols are placed at positions corresponding to the information set, and the remaining (NK) positions (called Frozen Sets) are placed with fixed known symbols, and generally (NK) fixed.
  • the known symbols are all 0 symbols, where K ⁇ N.
  • the transceiver terminal needs to be pre-agreed, and the fixed bit sequence can be arbitrarily set.
  • the encoded bit sequence of the Polar code can be obtained by the following method:
  • indicates the number of elements in the collection, ie K represents the collection
  • the number of elements in the middle also indicates the number of information bits to be encoded, also Is the matrix G N by the set
  • the LDPC code is another code that approximates the Shannon limit. It is a kind of linear block code with sparse check matrix, which means that the check matrix of LDPC code has far more zero elements than non-zero elements, and the distribution of non-zero elements is irregular. Wherein, a linear block code whose code length is equal to N and whose length of information bits is equal to K can be uniquely determined by its check matrix.
  • Quasi-Cyclic Low Density Parity Check is a subclass of LDPC.
  • the parity check matrix of the QC-LDPC is obtained by expanding a base matrix.
  • the base matrix is denoted as Hb
  • the parity check matrix is denoted as H.
  • the position of the non-zero element in the base matrix for example, the row and column where the non-zero element is located, can be described by a base graph (BG).
  • the size of the base matrix H b is m b ⁇ n b
  • the size of the check matrix H is (m b ⁇ Z) ⁇ (n b ⁇ Z), where Z is called the spreading factor of the check matrix.
  • each element of the check matrix H Is a zero matrix or cyclic shift matrix, wherein the cyclic shift matrix is obtained by cyclically shifting the a ij bit of the unit matrix I of the Z ⁇ Z size. Therefore, a ij is also referred to as the shift factor of the cyclic shift matrix, and in some examples, a ij can also be expressed as P i,j .
  • the range of a ij is -1 ⁇ a ij ⁇ Z.
  • each information bit position after expansion is used to place information bits. If K is not divisible by k b , resulting in Z ⁇ k b >K, there will be (Z ⁇ k b -K) redundant information bit positions in the parity check matrix H of the extended LDPC, which may be referred to as padding bits.
  • the method as described in FIG. 3 can be applied to any of the above communication systems.
  • the method of FIG. 3 is a method for information transmission implemented by the present application from a system perspective, wherein a transmitting device encodes data and a receiving device decodes data.
  • the method 300 shown in FIG. 3 includes:
  • the transmitting device performs cascading coding on the information bits on the polarization code and the LDPC code to obtain a first coding sequence.
  • the sending end device sends the first coding sequence to the receiving end device.
  • the transmission of the first code sequence through the channel becomes the first sequence to be decoded (which may also be referred to as soft information).
  • the receiving device receives the first sequence to be decoded.
  • the receiving end device performs decoding of the LDPC code and the polarization code on the first to-be-decoded sequence to obtain decoding information bits.
  • the error correction capability of the Polar code bypasses the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • FIG. 4 is a schematic block diagram of a process of encoding in accordance with an embodiment of the present application.
  • the length of the information bit u is K
  • the length of the code sequence x is M
  • a second transmitting device for encoding LDPC encoding sequence x o, to obtain a first coding sequence x, a length M, the LDPC coding rate is obtained R i M o / M.
  • the second coding sequence x o may be referred to as an outer code coding sequence
  • the first coding sequence x may be referred to as an inner code coding sequence
  • the method 500 shown in Figure 5 can be performed by a transmitting device. Specifically, the method 500 as shown in FIG. 5 includes:
  • the parameters of the polarization encoding include a code rate of polarization coding or a code length M o of polarization coding, wherein a code rate of the polarization code represents a ratio of K to M o .
  • the transmitting device can first determine the length K of the information bits and the first target code length M of the first coding sequence. That is to say, the transmitting end device can determine that the input of the concatenated encoding is an information bit of length K, and can determine that the output of the concatenated encoding is the first encoding sequence of length M.
  • the transmitting device needs to perform polarization encoding first, however, in the case where only the input of the polarization encoding is known as the information bit of length K, the polarization encoding cannot be performed, so it is necessary to determine the parameters of the polarization encoding.
  • M o is the code length of the polarization coding.
  • the polarization coding can be performed as long as the code rate R o of the polarization coding or the code length of the polarization coding is known.
  • the error correction capability of the LDPC code is mainly utilized, and the Polar code is used as an outer code to perform auxiliary error correction on the soft decoding result of the LDPC, so the code rate Ro of the polarization coding should be as much as possible. Large, so that the performance loss of the concatenated code can be reduced, and the code rate Ro of the polarization coding in the embodiment of the present application also needs to ensure that the polarization coding has sufficient error correction capability to fall into the trap set.
  • the decoding result in the error correction is performed to avoid or reduce the error leveling phenomenon of the LDPC code.
  • Es/N0 the signal-to-noise ratio
  • BLER packet error rate
  • the error packet rate curve of LDPC coding has a phenomenon of error leveling, which indicates that LDPC decoding enters the trap set at this time;
  • the rate curve has no error leveling phenomenon, because the auxiliary error correction capability of the outer code Polar code successfully corrects the errors occurring in the LDPC decoding. Therefore, the performance of the concatenated code is significantly better than the LDPC code in the working range of the URLLC scene.
  • M o is 1024 and R o is 0.92. It is easy to know from the principle of channel coding.
  • the following scheme can be used in the embodiment of the present application to determine the parameters of the polarization coding.
  • the parameter of the polarization coding is a code rate of the polarization coding, and the first target code length M according to the length K of the information bit and/or the first coding sequence.
  • the parameters of the polarization encoding including:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R o2 are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • R o is a linear function of K. That is to say, the transmitting device can determine the code rate of the polarization code according to the length K of the information bit using the first formula described above.
  • a can be equal to 0 and b ⁇ [0.85, 0.95], or a ⁇ [1/48000, 1/47000] and b ⁇ [0.85, 0.9];
  • the values of a and b can be taken as a pair of values in the two sets of values shown in Table 1.
  • the values of a and b may be a pair of values in the first group.
  • the value of a is 0, and the value of b is 0.85, 0.90, 0.92, 0.93, or 0.95.
  • the values of a and b may be a pair of values in the second group.
  • the value of a is 1/48000, and the value of b is 0.9.
  • the value of a is 1/48000, and the value of b is 0.85.
  • the value of a is 1/47500.
  • the value of b is The value of the value is 0.85; or the value of a is 1/47500, and the value of b is 0.88; or the value of a is 1/47000, and the value of b is 0.90.
  • the embodiment of the present application is not limited thereto.
  • the values of a and b may be any one of the two ranges of values shown in Table 1.
  • the specific values of a and b may be one of the following two values in Table 2.
  • Second value a 0 1/48000 b 0.9 0.9
  • the value of a indicates that the value of R o is also related to the size of K.
  • K the larger the increase of R o is.
  • the certain parameter may take the endpoint value of the interval range.
  • the value range of b is [0.85 ⁇ 0.95]
  • b can take an endpoint value of 0.85 or 0.95.
  • the endpoint values can also be taken, which will not be described one by one below.
  • the embodiment of the present application can ensure that the code rate Ro of the polarization coding should be as large as possible, thereby reducing the performance loss of the concatenated code, and in the case where the information bit length K is less than 35000, the R in the implementation of the present application The value of o is up to 0.95. Therefore, the code rate Ro of the polarization coding in the embodiment of the present application can ensure that the polarization coding has sufficient error correction capability. Therefore, the embodiment of the present application can correct the decoding result that falls in the trapping set. In order to avoid or reduce the error leveling phenomenon of the LDPC code.
  • R o is a piecewise function of K. That is to say, the transmitting device can determine the code rate of the polarization code according to the length K of the information bit by using the second formula described above.
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R o2 are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • R o1 ⁇ R o2 ⁇ ...R o2 and both belong to [0.85 to 0.95].
  • the second formula for calculating R o described above may be in the form of a face.
  • the embodiment of the present application can ensure that the code rate R o of the polarization coding should be as large as possible, so that the performance loss of the concatenated code can be reduced, and the value of R o in the implementation of the present application is at most 0.95. Therefore, the polarization coding rate R o in the embodiment of the present application can ensure that the polarization coding has sufficient error correction capability. Therefore, the embodiment of the present application can correct the decoding result falling in the trapping set. In order to avoid or reduce the error leveling phenomenon of the LDPC code.
  • Mo may be the length of the mother code of the polarization coding, or may be the length after the rate matching of the mother code. When there is rate matching, the Mo may also be called a target of polarization coding.
  • the code length is not limited to this embodiment.
  • the parameter of the polarization coding is a code length M o of the polarization coding, the first target code according to the length K of the information bit and/or the first coding sequence.
  • Length M determine the parameters of the polarization encoding, including:
  • the parameters of the polarization coding including:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • M o is a function of K and M. That is to say, the transmitting end device can determine the code length of the polarization code according to the length K of the information bit and the first target code length M of the first coding sequence using the first formula.
  • the values of x, y, and z may be one of the three sets of values shown in Table 3.
  • the values of x, y, and z may be one value in the first group.
  • the value of x is 1, the value of y is 0, and the value of z is 90, 95, 100, 105, or 110. Etc., the embodiments of the present application are not limited thereto.
  • the values of x, y, and z may be one of the values in the second group.
  • the value of x is 1.1
  • the value of y is -1/90
  • the value of z is 0.
  • the value of x is 1.2
  • the value of y is -1/100
  • the value of z is 0, etc., embodiments of the present application are not limited thereto.
  • the values of x, y, and z may be one of the values in the third group.
  • the value of x is a value of 10/8 to 20/19.
  • the value of x is 10/8, 20/17, 20/18, or 20/19, and the value of y is 0.
  • the value of z is 0, and the embodiment of the present application is not limited thereto.
  • First group Second Group The third group x 1 1.1 to 1.3 10/8 ⁇ 20/19 y 0 -1/90 ⁇ -1/110 0 z 90-110 0 0
  • the specific values of x, y, and z may be one of the three values in Table 4 below.
  • Second value Third value x 1 20/17 10/9 y 0 -1/100 0 z 100 0 0
  • the embodiment of the present application can ensure that the code rate R o of the polarization coding should be as large as possible, and the polarization coding can be guaranteed. Having sufficient error correction capability, the embodiment of the present application can correct the decoding result falling in the trapping set, thereby avoiding or reducing the error leveling phenomenon of the LDPC code.
  • M o is a piecewise function of K. That is to say, the transmitting end device can determine the code length M o of the polarization code according to the length K of the information bit using the second formula described above.
  • the application embodiment is not limited to this.
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • the second formula for calculating M o described above may be in the following form.
  • the embodiment of the present application can ensure that the code rate R o of the polarization code should be as large as possible, and can ensure that the polarization coding has sufficient error correction capability. Therefore, the present application Embodiments are capable of error correcting decoding results that fall into a trapping set, thereby avoiding or reducing erroneous leveling of the LDPC code.
  • the transmitting end device may perform polarization coding on the information bits of length K according to the length K of the information bits and the code length M o of the polarization coding. And obtaining a second coding sequence whose second target code length is M o .
  • the embodiment of the present application may divide the K information bits into p segments to obtain p information blocks, where p is an integer greater than or equal to 1. ;
  • the second coding sequence of length M o is obtained, the second coding sequence comprising the p sub-coding sequences.
  • the embodiment of the present application performs polarization coding on the information bit segment, which can reduce the delay of the concatenated coding.
  • the embodiment of the present application can prevent the error from exceeding the error length by segmentation, avoid repeated coding, and improve coding efficiency.
  • p is the smallest integer that satisfies the following inequality:
  • the number of bits per block of information is the number of bits per block of information.
  • the information bit of length K can be divided into two segments to obtain a first information block and a second information block, and are respectively subjected to Polar coding to obtain lengths of M o /2 respectively.
  • the sub-coding sequence is then cascaded together to obtain the second coding sequence of length M o
  • the second coding sequence is LDPC-encoded to obtain a first coding sequence of length M.
  • each information block is rounded up by K/p. Therefore, when K/p is a decimal, the sum of the lengths of the p information blocks may be greater than K. In this case, the application is implemented. For example, information bits need to be filled.
  • the filling manner may be to fill K seg ⁇ pK 0 bits or 1 bit for the head, tail or intermediate position of any piece of information bits; or to fill the head, tail or intermediate position of any K seg ⁇ pK segment information bits. 1 0 bit or 1 bit.
  • the information bits when information bit filling needs to be performed, the information bits may be first segmented and refilled, that is, K information bits may be first divided into p segments, and then at least one segment of the p segments is filled with information bits to obtain p. Information blocks. It should be understood that the number of bits of the p information blocks are equal.
  • the information bits when information bit filling is required, the information bits may be first filled and then segmented, that is, K information bits may be padded first, and then the information bits obtained after the padding are indexed and divided into p. Information blocks.
  • the determining, according to the K information bits, the p information blocks specifically includes:
  • the information bits of length K are divided into p segments, and at least one information block in the p segment information blocks is padded to obtain the p information blocks.
  • the embodiment of the present application may first divide the information bits into 4 segments. For example, the length of the segmented information blocks is 4, 4, and 3 respectively. , 3. Then, the last two blocks of the four information blocks can be filled with 1 bit, for example, padding 0 bits, or 1 bit. The length of each information block after padding is 4. It should be understood that the padded 1 bit can be filled in the head, tail or intermediate position of the information block to be filled, and the embodiment of the present application is not limited thereto.
  • the embodiment of the present application may first divide the information bits into 4 segments. For example, the length of the segmented information blocks is 4, 4 respectively. , 4, 2. Then, the last information block of the four information blocks can be filled with 2 bits, for example, 2 0 bits, or 2 1 bits. The length of each information block after padding is 4. It should be understood that the padded 2 bits may be filled in the head, tail or intermediate position of the information block to be filled, and the embodiment of the present application is not limited thereto.
  • Determining the p information blocks according to the K information bits specifically includes: filling the information bits of length K such that the number of bits after padding is equal to K seg ⁇ p,
  • the information bits after the completion of the filling are divided into p segments, P information blocks are obtained, and the p information blocks are separately polarization coded.
  • the embodiment of the present application may first fill 2 information bits for K information bits. For example, padding 0 bits or 1 bit. It should be understood that the padded 2 bits may be the head, tail or intermediate position of the information bit, and the embodiment of the present application is not limited thereto. After the padding is completed, the information bits of length 16 are obtained. Then, the information bit of length 16 can be divided into lengths into 4 segments, each segment of information is equal in length, and each segment of information is 4 bits in length. The p-segment information block is then polarization coded separately.
  • the transmission side apparatus may first determine the size of the K and K SEG, if it is determined K ⁇ K seg, Example manner described above to the information bits are segmented embodiment of the present application, and Polarization coding is performed separately for each segment.
  • the transmitting end device may not need to make a judgment, and may directly determine the value of p according to the formula of determining p above. When p is 1, the transmitting end device does not need to segment the information bits. When the value of p is greater than 1, the transmitting device divides the information bits into p segments, and performs polarization encoding on the p information blocks.
  • the embodiment of the present application is not limited thereto.
  • the transmitting device needs to combine the p sub-coding sequences to obtain a length of The second coding sequence of M o .
  • the sending end device may sequentially cascade or interleave the p sub-coding sequences to obtain the second coding sequence.
  • Embodiments of the present application can reduce the complexity of encoding and decoding by sequentially cascading p sub-coding sequences.
  • the embodiment of the present application can enhance the anti-interference ability by interleaving the p sub-code sequences.
  • the first coding sequence After the first coding sequence is obtained by the transmitting end, it may be sent to the receiving end device through a channel through a process such as modulation.
  • the embodiment of the present application is not limited thereto.
  • the error correction capability of the Polar code is used to bypass the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code.
  • FIG. 8 is a schematic block diagram of a process of decoding in accordance with an embodiment of the present application.
  • the receiving end device acquires a first to-be-decoded sequence of length M, and the transmitting end device performs LDPC decoding on the first to-be-decoded sequence of length M to obtain a length of M o .
  • the two to-be-decoded sequences (which may also be referred to as soft information bits) are then LDPC-decoded to the second to-be-decoded sequence to obtain decoded information bits of length K.
  • the receiving end device first obtains a sequence y to be decoded from the channel, and has a length of M. First, the receiving end device performs LDPC decoding to obtain a soft information bit y i , the length is M o , and then y i is subjected to Polar decoding. , recovering information bits (ie decoding information bits).
  • the decoding action performed by the receiving end device in the embodiment of the present application corresponds to the action performed by the transmitting end device, and the decoding action performed by the receiving end device is substantially opposite to the action performed by the transmitting end. Therefore, in order to avoid repetition, the following The detailed description is omitted as appropriate.
  • the method 900 shown in FIG. 9 includes:
  • the first sequence to be decoded corresponds to a first code sequence of length M transmitted by the source device.
  • the parameters of the polarization coding include a code rate of polarization coding or a code coded by polarization coding. Length M o , wherein the code rate of the polarization code represents a ratio of K to M o , wherein the sequence length of the LDPC code is equal to the code length M o of the polarization code.
  • the parameter of the polarization coding is a code rate of the polarization coding, and the length K according to the coded information bit and/or the length M of the first to-be-decoded sequence, Determine the parameters of the polarization encoding, including:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R on are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • the parameter of the polarization coding is a code length M o of the polarization coding, the length K according to the coded information bit and/or the length of the first sequence to be coded M, determine the parameters of the polarization encoding, including:
  • Determining the parameters of the polarization encoding according to the length K of the encoded information bits and/or the length M of the first to-be-decoded sequence including:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • step 920 corresponds to step 510.
  • step 920 reference may be made to the corresponding description in 510. To avoid repetition, details are not described herein.
  • the receiving side apparatus after determining the parameters of polarization coding, 8, the receiving side apparatus according to length K and the coded information bits polarization code length M o, M o is the length of the second to be translated
  • the code sequence is subjected to polarization coding to obtain decoded information bits of length K.
  • the receiver device also needs segmentation decoding.
  • performing the polarization decoding on the second to-be-decoded sequence to obtain a decoding information bit of length K including:
  • the second sequence to be decoded is divided into p sub-codes to be decoded, and p is an integer greater than or equal to 2;
  • p is the smallest integer that satisfies the following inequality:
  • the number of bits per block of information is the number of bits per block of information.
  • the present embodiment may be split application of length M o a second sequence to be coded into two sub-sequences to be decoded, i.e., a first sub-sequence to be coded to be decoded and a second sub- Sequences, and respectively performing Polar decoding, obtain two information blocks, that is, a first information block and a second information block, and then combine the two information blocks to obtain the decoding information bits of length K.
  • the p sub-coding sequences are interleaved to obtain a second encoding sequence.
  • the receiving end is set to decode, correspondingly, deinterleaving is required.
  • the receiving device deinterleaves the p sub-decoded sequences, and then de-interleaves the p sub-subsequent
  • the decoding sequences are respectively decoded to obtain p information blocks, and then the p information blocks are combined to obtain decoded information bits of length k.
  • the receiving end device divides the second sequence to be decoded into p sub-codes to be decoded, and p is an integer greater than or equal to 2;
  • the combining the p information blocks to obtain the information bits of length K includes:
  • the p-segment information bits are sequentially concatenated to obtain the information bits of length K.
  • the manner in which the receiving device is to be padded is corresponding to the manner in which the transmitting device fills the bits. To avoid repetition, details are not described herein again.
  • the foregoing describes a scheme for performing deinterleaving prior to polarization decoding.
  • the p sub-decoded sequences may be polarization-decoded to obtain p information blocks.
  • the p pieces of information are deinterleaved and de-padded, and finally the decoded information bits of length K are obtained.
  • deinterleaving may be performed first, followed by defilling processing.
  • the receiving end device divides the second to-be-decoded sequence into p sub-to-be-decoded sequences, where p is an integer greater than or equal to 2;
  • de-filling may also be performed first, followed by de-interleaving.
  • the receiving end device divides the second to-be-decoded sequence into p sub-to-be-decoded sequences, where p is an integer greater than or equal to 2;
  • the p-segment information bits are deinterleaved and concatenated to obtain the decoded information bits of length K.
  • the processing of deinterleaving and de-filling performed by the receiving device corresponds to the processing of interleaving and padding performed by the transmitting device.
  • the processing of deinterleaving and de-filling performed by the receiving device corresponds to the processing of interleaving and padding performed by the transmitting device.
  • the error correction capability of the Polar code is used to bypass the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code.
  • FIG. 3 to FIG. 10 are merely exemplary, and the examples of FIG. 3 to FIG. 10 are merely for helping those skilled in the art to understand the embodiment of the present invention, instead of the present invention.
  • Embodiments are limited to the specific numerical values or specific scenarios illustrated. It will be obvious to those skilled in the art that various modifications and changes can be made in the embodiments of the present invention in the scope of the embodiments of the present invention.
  • the value range of each parameter in the foregoing embodiment may be flexibly changed, for example, the range of the parameter may be expanded or reduced, and the embodiment of the present application is not limited thereto.
  • the size of the sequence numbers of the foregoing processes does not mean the order of execution sequence, and the order of execution of each process should be determined by its function and internal logic, and should not be applied to the embodiment of the present application.
  • the implementation process constitutes any limitation.
  • FIG. 11 is a schematic block diagram of an encoding device in accordance with an embodiment of the present application.
  • the encoding device shown in FIG. 11 may be a transmitting device as shown in FIG. 1, and performs the functions of the transmitting device in the foregoing method embodiment.
  • the source device may be a network device in a communication system, such as a base station, and the corresponding receiver device may be a terminal device.
  • the sender device may also be a terminal device, and the receiver device may also be a network device.
  • the encoding device 1100 shown in FIG. 11 includes a processing unit 1110 and a transceiving unit 1120.
  • the processing unit is configured to determine a parameter of polarization coding according to a length K of the information bit and/or a first target code length M of the first coding sequence, where the parameter of the polarization coding includes a code rate or a pole of the polarization coding Code length M o , wherein the code rate of the polarization code represents a ratio of K to M o , where K, M and M o are positive integers;
  • the transceiver unit is configured to send the first code sequence.
  • the error correction capability of the Polar code bypasses the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • the parameter of the polarization coding is a code rate of the polarization coding
  • the processing unit is specifically configured to use the following two formulas according to the length K of the information bit. Any one of which determines the code rate of the polarization coding:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R o2 are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • the parameter of the polarization coding is a code length M o of the polarization coding
  • the processing unit is specifically configured to use, according to the length K of the information bit, the first coding sequence.
  • the first target code length M using the following formula, determines the code length M o of the polarization encoding:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • processing unit is specifically configured to:
  • the encoding apparatus 1000 illustrated in FIG. 10 is capable of implementing the various processes performed by the encoding device (eg, the transmitting device) in the method embodiments of FIGS. 1 through 9.
  • the operations and/or functions of the various modules in the encoding device 1000 are respectively implemented in order to implement the corresponding processes in the above method embodiments.
  • the detailed description is omitted here.
  • FIG. 11 is a schematic block diagram of a decoding device in accordance with an embodiment of the present application.
  • the decoding device shown in FIG. 11 may be a receiving end device as shown in FIG. 1, and performs the functions of the receiving end device in the foregoing method embodiment.
  • the source device may be a network device in a communication system, such as a base station, and the corresponding receiver device may be a terminal device.
  • the sender device may also be a terminal device, and the receiver device may also be a network device.
  • the decoding device 1100 shown in FIG. 11 includes a processing unit 1110 and a transceiving unit 1120.
  • the transceiver unit is configured to acquire a first sequence to be decoded of length M;
  • the processing unit is configured to determine a polarization coded parameter according to a length K of the encoded information bit and/or a length M of the first to-be-decoded sequence, where the polarization coded parameter includes a code rate of polarization coding Or a coded length M o of the polarization code, wherein a code rate of the polarization code represents a ratio of K to M o , wherein a sequence length of the LDPC code is equal to a code length M o of the polarization code, where K, M And M o is a positive integer;
  • the error correction capability of the Polar code bypasses the trapping set of the LDPC code, thereby avoiding or reducing the error leveling phenomenon of the LDPC code, and improving system performance.
  • the parameter of the polarization coding is a code rate of the polarization coding
  • the processing unit is specifically configured to use the following two according to the length K of the coded information bits. Any one of the formulas, determining the code rate of the polarization coding:
  • R o a ⁇ K + b
  • R o represents the code rate of the polarization code
  • a and b are constants
  • R o1 , R o2 ... R on are constants
  • K thd1 , K thd2 ... K thdn+1 are constants.
  • the parameter of the polarization coding is a code length M o of the polarization coding
  • the processing unit is specifically configured to use the length K of the information bit according to the coding and the first to Decoding the length M of the sequence, using the following formula, determining the code length M o of the polarization encoding:
  • Determining the parameters of the polarization encoding according to the length K of the encoded information bits and/or the length M of the first to-be-decoded sequence including:
  • a 1 , a 2 ... a n , M o1 , M o2 ... M on are constants, and K thd1 , K thd2 ... K thdn+1 are constants.
  • processing unit is specifically configured to:
  • the second sequence to be decoded is divided into p sub-codes to be decoded, and p is an integer greater than or equal to 2;
  • the decoding apparatus 1100 shown in FIG. 11 can implement the various processes involved in the decoding apparatus (eg, the receiving end apparatus) in the method embodiments of FIGS. 1 through 9.
  • the operations and/or functions of the respective modules in the decoding device 1100 are respectively implemented in order to implement the corresponding processes in the foregoing method embodiments.
  • the detailed description is omitted here.
  • FIG. 12 is a schematic block diagram of an encoding device according to another embodiment of the present application. Specifically, the encoding device shown in FIG. 12 can be applied to the system shown in FIG. 1 to perform the functions of the encoding device in the above method embodiment.
  • the encoding device 1200 includes a processor 1210 and a transceiver 1220, wherein the processor 1210 is connected to the transceiver 1220.
  • the encoding device may further include a memory 1230, the processor 1210. Connected to memory 1230, wherein processor 1210, transceiver 1220, and memory 1230 communicate with one another via internal connection paths to communicate control and/or data signals.
  • the transceiver 1220 can be an antenna or control circuit having a transceiving function, and the transceiver can include a receiver for receiving data and a transmitter for transmitting data.
  • the memory 1230 can be used to store instructions, the processor 1210 is configured to execute instructions stored in the memory 1230, control the transceiver 1220 to receive information or signals, and the controller 1210 can execute the instructions in the memory 1230 to complete the above-described FIG. 1 to FIG.
  • the various methods of the encoding device are involved in the method embodiment. To avoid repetition, we will not repeat them here.
  • the encoding device 1200 can correspond to the encoding device 1000 of FIG. 10 described above, the functionality of the processing unit 1010 in the encoding device 1000 can be implemented by the processor 1210, and the functionality of the transceiving unit 1020 can be implemented by the transceiver 1220. In order to avoid repetition, a detailed description is omitted as appropriate herein.
  • FIG. 13 is a schematic block diagram of a decoding device according to another embodiment of the present application. Specifically, the decoding apparatus shown in FIG. 13 can be applied to the system shown in FIG. 1, and the functions of the decoding apparatus in the above-described method embodiments are performed.
  • the decoding device 1300 includes a processor 1310 and a transceiver 1320, wherein the processor 1310 is connected to the transceiver 1320.
  • the decoding device may further include a memory 1330 for processing.
  • the processor 1310 is coupled to the memory 1330, wherein the processor 1310, the transceiver 1320, and the memory 1330 communicate with one another via internal interconnect paths to communicate control and/or data signals.
  • the transceiver 1320 can be an antenna or control circuit having a transceiving function, and the transceiver can include a receiver for receiving data and a transmitter for transmitting data.
  • the memory 1330 can be used to store instructions, the processor 1310 is configured to execute instructions stored in the memory 1330, control the transceiver 1320 to receive information or signals, and the controller 1310 can execute the instructions in the memory 1330 to complete the above-described FIG. 1 to FIG. 9 Method embodiments relate to various processes of a decoding device. To avoid repetition, we will not repeat them here.
  • the decoding device 1300 may correspond to the decoding device 1100 in FIG. 11 described above, and the function of the processing unit 1110 in the decoding device 1100 may be implemented by the processor 1310, and the function of the transceiver unit 1120 may be implemented by the transceiver 1320. . In order to avoid repetition, a detailed description is omitted as appropriate herein.
  • the processor in the embodiments of the present application may be an integrated circuit chip having signal processing capabilities.
  • each step of the foregoing method embodiment may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software.
  • the above processor may be a general purpose processor, a digital signal processor (DSP), an application specific integrated crucit (ASIC), a field programmable gate array (FPGA) or the like. Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application can be implemented or executed.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present application may be directly implemented by the hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like.
  • the storage medium is located in the memory, and the processor reads the information in the memory and combines the hardware to complete the steps of the above method.
  • the memory in the embodiments of the present application can be either volatile memory or non-volatile memory, or can include both volatile and non-volatile memory.
  • the non-volatile memory may be a read-only memory (ROM), a programmable read only memory (ROMM), an erasable programmable read only memory (erasable PROM, EPROM), or an electrical Erase programmable EPROM (EEPROM) or flash memory.
  • the volatile memory can be a random access memory (RAM) that acts as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DDR SDRAM double data rate synchronous DRAM
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronously connected dynamic random access memory
  • DR RAM direct memory bus random access memory
  • the embodiment of the present application further provides a processing apparatus, including a processor and an interface, and the processor is configured to execute the method in any of the foregoing method embodiments.
  • the above processing device may be a chip.
  • the processing device may be a field-programmable gate array (FPGA), may be an application specific integrated circuit (ASIC), or may be a system on chip (SoC). It can be a central processor unit (CPU), a network processor (NP), a digital signal processor (DSP), or a microcontroller. Unit, MCU), can also be a programmable logic device (PLD) or other integrated chip.
  • FPGA field-programmable gate array
  • ASIC application specific integrated circuit
  • SoC system on chip
  • CPU central processor unit
  • NP network processor
  • DSP digital signal processor
  • MCU can also be a programmable logic device (PLD) or other integrated chip.
  • PLD programmable logic device
  • the embodiment of the present application further provides a computer readable medium having stored thereon a computer program, the computer program being executed by a computer to implement the method of any of the foregoing method embodiments.
  • the embodiment of the present application further provides a computer program product, which is implemented by a computer to implement the method of any of the foregoing method embodiments.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be wired from a website site, computer, server or data center (for example, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (eg infrared, wireless, microwave, etc.) to another website site, computer, server or data center.
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium can be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a high-density digital video disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD) ))Wait.
  • a magnetic medium eg, a floppy disk, a hard disk, a magnetic tape
  • an optical medium eg, a high-density digital video disc (DVD)
  • DVD high-density digital video disc
  • SSD solid state disk
  • a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer.
  • an application running on a computing device and a computing device can be a component.
  • One or more components can reside within a process and/or execution thread, and the components can be located on one computer and/or distributed between two or more computers.
  • these components can execute from various computer readable media having various data structures stored thereon.
  • a component may, for example, be based on signals having one or more data packets (eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems) Communicate through local and/or remote processes.
  • data packets eg, data from two components interacting with another component between the local system, the distributed system, and/or the network, such as the Internet interacting with other systems
  • system and “network” are used interchangeably herein.
  • the term “and/or” in this context is merely an association describing the associated object, indicating that there may be three relationships, for example, A and / or B, which may indicate that A exists separately, and both A and B exist, respectively. B these three situations.
  • the character "/" in this article generally indicates that the contextual object is an "or" relationship.
  • B corresponding to A means that B is associated with A, and B can be determined according to A.
  • determining B from A does not mean that B is only determined based on A, and that B can also be determined based on A and/or other information.
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of cells is only a logical function division.
  • multiple units or components may be combined or integrated. Go to another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, or an electrical, mechanical or other form of connection.
  • the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present application.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another.
  • a storage medium may be any available media that can be accessed by a computer.
  • computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure.
  • Any connection may suitably be a computer readable medium.
  • the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave
  • the coaxial cable , fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwave are included in the fixing of the associated media.
  • a disk and a disc include a compact disc (CD), a laser disc, a compact disc, a digital versatile disc (DVD), a floppy disc, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

本申请提供了编码的方法、译码的方法、编码设备和译码设备，该编码方法包括根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中K，M以及M o为正整数；根据所述极化编码的参数对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；对所述第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的所述第一编码序列；发送所述第一编码序列。本申请实施例能够降低LDPC码的错误平层现象。

Description

编码的方法、译码的方法、编码设备和译码设备
本申请要求于2018年02月14日提交中国专利局、申请号为201810152255.8、申请名称为“编码的方法、译码的方法、编码设备和译码设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，特别涉及一种编码的方法、译码的方法、编码设备和译码设备。
背景技术
在通信系统中，信息数据在发送端设备(例如，网络设备或者终端设备)和接收端设备(例如，终端设备或者网络设备)之间传输，由于无线传播环境复杂多变，容易受到干扰，出现差错。为了可靠地发送信息数据，发送端设备对信息数据进行信道编码等处理。接收端设备需要进行信道解码等处理，恢复成信息数据。这些过程可以减少传输差错，提高数据传输的可靠性。
低密度奇偶校验(low density parity check，LDPC)码是一类具有稀疏校验矩阵的线性分组编码，具有结构灵活，译码复杂度低的特点。由于它采用部分并行的迭代译码算法，从而比传统的Turbo码具有更高的吞吐率。LDPC码被认为是通信系统的下一代纠错码，可用来提高信道传输的可靠性和功率利用率；并可以广泛应用于空间通信、光纤通信、个人通信系统、ADSL和磁记录设备等。目前在新无线(new radio，NR)通信技术中已考虑采用LDPC码作为信道编码方式之一。
然而，目前NR标准中增强型移动宽带(enhanced mobile broadband，eMBB)场景的LDPC码在部分码长码率下会出现错误平层(error floor)的现象，这在对数据误包率要求更高的高可靠低时延通信(Ultra-reliable low latency communications，URLLC)场景是不能容忍的。
因此，如何避免或者降低LDPC码的错误平层现象，成为亟待解决的问题。
发明内容
本申请提供一种编码的方法、译码的方法、编码设备和译码设备，能够降低LDPC码的错误平层现象。
第一方面，提供了一种编码的方法，该方法包括：
根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中K，M以及M o为正整数；
根据所述极化编码的参数对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；
对所述第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的所述第一编码序列；
发送所述第一编码序列。
因此，本申请实施例通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
可选地，在第一方面的一种实现方式中，所述极化编码的参数为极化编码的码率，所述根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，包括：
根据所述信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000001
其中，R o表示所述极化码的码率，a和b为常数，R o1,R o2...R o2为常数，K thd1，K thd2...K thdn+1为常数。
其中a可以等于0且b∈[0.85，0.95]，或者a∈[1/48000，1/47000]且b∈[0.85,0.9]；
也就是说a和b的取值可以如表1所示的两组取值中的一对取值。
例如，a和b的取值可以为第一组中的一对取值，例如，a的取值为0，b的取值为0.85、0.90、0.92、0.93或0.95等。
或者，a和b的取值可以为第二组中的一对取值。例如，a的取值为1/48000，b的取值为0.9；或者，a的取值为1/48000，b的取值为0.85；或者a的取值为1/47500，b的取值为0.85；或者a的取值为1/47500，b的取值为0.88；或者，a的取值为1/47000，b的取值为0.90等，本申请实施例并不限于此，可选的，a和b的取值可以为表1所示的两组取值范围中的任意一对取值。
根据上述计算R o的第一个公式，以及上述a和b的取值能够得出，R o的取值最小为0.85。因此，本申请实施例能够保证极化编码的码率Ro应尽可能大，从而能够减小级联码的性能损失，并且，在信息比特长度K小于35000的情况下，本申请实施中的Ro的取值最大为0.95。因此，本申请实施例中极化编码的码率Ro能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
对于上述计算R o的第二个公式，R o为K的分段函数。也就是说发送端设备可以根据信息比特的长度K使用上述第二个公式即可确定极化码的码率。
需要说明的是，在上述计算R o的第二个公式，即R o为K的分段函数的公式中，定义了R o＝R o1,K thd1＜K＜K thd2；R o＝R o2,K thd2＜K＜K thd3。其中并没有指出K＝K thd2 的情况，应注意，K＝K thd2可以落入K thd1＜K＜K thd2的情况，即上述公式可以变形为R o＝R o1，K thd1＜K≤K thd2；K＝K thd2也可以落入K thd2＜K＜K thd3的情况，即上述公式可以变形为R o＝R o2，K thd2≤K＜K thd3本申请实施例并不限于此。
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。例如，R o1＜R o2＜…R o2且均属于[0.85～0.95]。
0＜K thd1<K thd2…＜K thdn+1。例如，作为一个实施例，上述计算R o的第二个公式可以为面的形式。
Figure PCTCN2019074794-appb-000002
根据上述R o的第二个公式，以及上述参数的取值能够得出，R o的取值最小为0.85。因此，本申请实施例能够保证极化编码的码率R o应尽可能大，从而能够减小级联码的性能损失，并且，本申请实施中的R o的取值最大为0.95。因此，本申请实施例中极化编码码率R o能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
可选地，在第一方面的一种实现方式中，所述极化编码的参数为极化编码的码长M o，所述根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，包括：
根据所述信息比特的长度K和所述第一编码序列的第一目标码长M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000003
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000004
表示取整；
或者，
根据所述信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000005
其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
根据上述公式计算M o，本申请实施例能够保证极化编码的码率R o应尽可能大，且能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
可选地，在第一方面的一种实现方式中，所述根据所述极化编码的参数对所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列，包括：
根据K个信息比特，确定p个信息块，p为大于或等于1的整数；
对所述p个信息块分别进行极化编码，得到p个子编码序列；
获得长度为M o的所述第二编码序列，所述第二编码序列包括所述p个子编码序列。
因此，本申请实施例对信息比特分段进行极化编码，能够减小级联编码的时延。
并且，进一步的，本申请实施例通过分段能够避免误码超过误码长度，避免重复编码，提高编码效率。
可选地，作为另一实施例，p为满足以下不等式的最小整数：
Figure PCTCN2019074794-appb-000006
即
Figure PCTCN2019074794-appb-000007
其中，
Figure PCTCN2019074794-appb-000008
表示向上取整，K thd为预设分段阈值。
每个信息块的比特个数为
Figure PCTCN2019074794-appb-000009
例如，K thd的取值范围可以是[0.85～0.95]×2 m，其中m为正整数。例如，假设K thd＝0.95×2 9＝472，当K＝944时，p＝2。
应理解，上述每个信息块的长度为K/p的向上取整，因此，当K/p为小数时，该p个信息块的长度之和会大于K，这种情况下，本申请实施例需要进行信息比特进行填充。
具体的，填充方式可以是对任意一段信息比特的头、尾或中间位置填充K seg×p-K个0比特或1比特；或是对任意K seg×p-K段信息比特的头、尾或中间位置填充1个0比特或1比特。
应理解，本申请实施例中在需要进行信息比特填充时，可以先分段再填充，即可以先将K个信息比特分成p段，然后对p段中的至少一段进行信息比特填充，获得p个信息块。应理解，该p个信息块的比特个数均相等。可选地，本申请实施例中在需要进行信息比特填充时，可以先填充，再分段，即可以先对K个信息比特进行填充，然后对填充后获得的信息比特进行分度，分成p个信息块。
下面首先介绍，先分段再填充的具体方案。
具体地，作为一个实施例，在一种实现方式中，K seg×p＞K，
所述将根据K个信息比特，确定p个信息块，，具体包括：
将所述长度为K的信息比特分为p段，并对所述p段信息块中的至少一个信息块进行填充，得到所述p个信息块。
例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先将信息比特分为4段，例如，进行分段后的信息块的长度分别为4,4,3,3。那么可以将该4个信息块中的后两个信息块分别填充1个比特，例如，填充0比特，或1比特。使得填充后的每个信息块的长度均为4。应理解，该填充的的1个比特可以填充在需要填充的信息块的头部、尾部或者中间位置，本申请实施例并不限于此。
再例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先将信息比特分为4段，例如，进行分段后的信息块的的长度分别为4,4,4,2。那么可以将该4个信息块中的最后一个信息块填充2个比特，例如，填充2个0比特，或2个1比特。使得填充后的每个信息块的长度均为4。应理解，该填充的的2个比特可以填充在需要填充的信息块的的头部、尾部或者中间位置，本申请实施例并不限于此。
下面介绍，先先填充，再分段的具体方案。
可选地，作为一个实施例，在一种实现方式中，K seg×p＞K，
根据K个信息比特，确定p个信息块具体包括：将所述长度为K的信息比特进行填充，使得填充后的比特数等于K seg×p，
之后将填充完成后的信息比特分成p段，获得P个信息块，并对该p信息块分别进行极化编码。
例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先对K个信息比特填充2个比特。例如，填充0比特或者1比特。应理解，该填充的2个比特可以为该信息比特的头部、尾部或者中间位置，本申请实施例并不限于此。填充完成后获取长度为16的信息比特。那么可以将该长度为16的信息比特分成长度分成4段，每段信息块长度相等，每段信息块长度为4个比特。然后分别对该p段信息块进行极化编码。
需要说明的是，在实际应用中，发送端设备可以首先判断K与K seg的大小，如果确定K≥K seg时，本申请实施例即可按照上文描述的方式对信息比特分段，并对各段分别进行极化编码。可替代地，发送端设备可以不需要进行判断，可以直接按照上述确定p的公式确定出p的取值，当p为1时，发送端设备不需要对信息比特分段。当p的取值大于1时，则发送端设备则将信息比特分成p段，并分别对p个信息块进行极化编码，本申请实施例并不限于此。
可选地，作为另一实施例，在发送端设备将信息比特分成p段，并分别进行极化编码得到p个子编码序列后，发送端设备需要将所述p个子编码序列组合，得到长度为M o的所述第二编码序列。具体的，发送端设备可以将所述p个子编码序列顺序级联或者交织级联，得到所述第二编码序列。
本申请实施例通过将p个子编码序列顺序级联能够降低编码及译码的复杂度。
本申请实施例通过将p个子编码序列交织级联能够增强抗干扰能力。
第二方面，提供了一种译码的方法，该方法包括：获取长度为M的第一待译码序列；
根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中，LDPC编码的序列长度与极化编码的码长M o相等，其中K，M以及M o为正整数；对所述第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列；根据所述极化编码的参数，对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特。
因此，本申请实施例，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
应理解，译码端执行的方法与编码端执行的方法对应，为了避免重复，适当省略详细描述。
可选地，在第一方面的一种实现方式中，所述极化编码的参数为极化编码的码率，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：根据所述编码的信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000010
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R on为常数，K thd1，K thd2…K thdn+1为常数。
可选地，在第一方面的一种实现方式中，所述极化编码的参数为极化编码的码长M o，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K和所述第一待译码序列的长度M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000011
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000012
表示取整；
或者，
所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000013
其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
可选地，在第一方面的一种实现方式中，所述对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特，包括：
将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
将所述p个信息块组合，得到长度为K的所述译码信息比特。
因此，本申请实施例，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
第三方面，提供了一种编码设备，所述编码设备包括用于执行第一方面或第一方面任一种可能实现方式中的方法的各个模块或单元。
第四方面，提供了一种译码设备，所述译码设备包括用于执行第二方面或第二方面任一种可能实现方式中方法的各个模块或单元。
第五方面，提供了一种编码设备，包括收发器、处理器和存储器。该处理器用于控制收发器收发信号，该存储器用于存储计算机程序，该处理器用于从存储器中调用并运行该计算机程序，使得该终端设备执行第一方面或第一方面任一种可能实现方式中的方法。
第六方面，提供了一种译码设备，包括收发器、处理器和存储器。该处理器用于控制 收发器收发信号，该存储器用于存储计算机程序，该处理器用于从存储器中调用并运行该计算机程序，使得该终端设备执行第二方面或第二方面任一种可能实现方式中的方法。
第七方面，提供了一种计算机可读介质，其上存储有计算机程序，该计算机程序被计算机执行时实现第一方面或第一方面任一种可能的实现方式中的方法。
第八方面，提供了一种计算机可读介质，其上存储有计算机程序，该计算机程序被计算机执行时实现第二方面或第二方面中的任一种可能的实现方式中的方法。
第九方面，提供了一种计算机程序产品，该计算机程序产品被计算机执行时实现第一方面或第一方面任一种可能的实现方式中的方法。
第十方面，提供了一种计算机程序产品，该计算机程序产品被计算机执行时实现第一方面或第一方面任一种可能的实现方式中的方法。
第十一方面，提供了一种处理装置，包括处理器和接口；
该处理器，用于作为上述第一方面至第六方面或第一方面至第六方面中的任一种可能的实现方式中的方法执行主体来执行这些方法，其中相关的数据交互过程(例如进行或者接收数据传输)是通过上述接口来完成的。在具体实现过程中，上述接口可以进一步通过收发器来完成上述数据交互过程。
应理解，上述十一方面中的处理装置可以是一个芯片，该处理器可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，该处理器可以是逻辑电路、集成电路等；当通过软件来实现时，该处理器可以是一个通用处理器，通过读取存储器中存储的软件代码来实现，该存储器可以集成在处理器中，可以位于该处理器之外，独立存在。
附图说明
图1是本申请实施例可应用的系统场景示意图。
图2是本申请实施例中数据传输过程示意图。
图3是本申请实施例的通信方法流程示意图。
图4是根据本申请一个实施例的编码过程示意框图。
图5是根据本申请一个实施例的编码方法流程示意图。
图6是本申请实施例方法与现有方法的编码性能对比图。
图7是根据本申请另一实施例的编码过程示意框图。
图8是根据本申请一个实施例的译码过程示意框图。
图9是根据本申请一个实施例的译码方法流程示意图。
图10是根据本申请另一实施例的译码过程示意框图。
图11是根据本申请一个实施例的编码设备的示意框图。
图12是根据本申请一个实施例的译码设备的示意框图。
图13是根据本申请另一实施例的编码设备的示意框图。
图14是根据本申请另一实施例的译码设备的示意框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请实施例可应用于各种通信系统，因此，下面的描述不限制于特定通信系统。例如，本申请实施例可以应用于全球移动通讯(global system of mobile communication，GSM)系统、码分多址(code division multiple access，CDMA)系统、宽带码分多址(wideband code division multiple access，WCDMA)系统、通用分组无线业务(general packet radio service，GPRS)、长期演进(long term evolution，LTE)系统、LTE频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)、通用移动通信系统(universal mobile telecommunication system，UMTS)、无线局域网(wireless local area networks，WLAN)、无线保真(wireless fidelity，WiFi)以及下一代通信系统，即第五代(5th generation，5G)通信系统，例如，新空口(new radio，NR)系统。
本申请实施例中，网络设备可以是全球移动通讯(global system of mobile communication，GSM)或码分多址(code division multiple access，CDMA)中的基站(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)中的基站(nodeB，NB)，还可以是长期演进(long term evolution，LTE)中的演进型基站(evolutional node B，eNB/eNodeB)，或者中继站或接入点，或者未来5G网络中的网络侧设备，例如，NR系统中传输点(TRP或TP)、NR系统中的基站(gNB)、NR系统中的射频单元，如远端射频单元、5G系统中的基站的一个或一组(包括多个天线面板)天线面板等。不同的网络设备可以位于同一个小区，也可以位于不同的小区，具体的在此不做限定。
在一些部署中，gNB可以包括集中式单元(centralized unit，CU)和分布式单元(Distributed Unit，DU)。gNB还可以包括射频单元(radio unit，RU)。CU实现gNB的部分功能，DU实现gNB的部分功能，比如，CU实现无线资源控制(radio resource control，RRC)，分组数据汇聚层协议(packet data convergence protocol，PDCP)层的功能，DU实现无线链路控制(radio link control，RLC)、媒体接入控制(media access control，MAC)和物理(physical，PHY)层的功能。由于RRC层的信息最终会变成PHY层的信息，或者，由PHY层的信息转变而来，因而，在这种架构下，高层信令，如RRC层信令或PHCP层信令，也可以认为是由DU发送的，或者，由DU+RU发送的。可以理解的是，网络设备可以为CU节点、或DU节点、或包括CU节点和DU节点的设备。此外，CU可以划分为接入网RAN中的网络设备，也可以将CU划分为核心网CN中的网络设备，在此不做限制。
本申请实施例中，终端设备也可以称为用户设备(user equipment，UE)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字处理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备、无人机设备以及未来5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等，本申请实施例对此并不限定。
作为示例而非限定，在本发明实施例中，该终端设备还可以是可穿戴设备。可穿戴设 备也可以称为穿戴式智能设备，是应用穿戴式技术对日常穿戴进行智能化设计、开发出可以穿戴的设备的总称，如眼镜、手套、手表、服饰及鞋等。可穿戴设备即直接穿在身上，或是整合到用户的衣服或配件的一种便携式设备。可穿戴设备不仅仅是一种硬件设备，更是通过软件支持以及数据交互、云端交互来实现强大的功能。广义穿戴式智能设备包括功能全、尺寸大、可不依赖智能手机实现完整或者部分的功能，例如：智能手表或智能眼镜等，以及只专注于某一类应用功能，需要和其它设备如智能手机配合使用，如各类进行体征监测的智能手环、智能首饰等。
本申请实施例可以适应于上述任意通信系统，例如，本申请实施例可以适用于LTE系统以及后续的演进系统如5G等，或其他采用各种无线接入技术的无线通信系统，如采用码分多址，频分多址，时分多址，正交频分多址，单载波频分多址等接入技术的系统，尤其适用于需要信道信息反馈和/或应用二级预编码技术的场景，例如应用大规模阵列天线(Massive Multiple-Input Multiple-Output，Massive MIMO)技术的无线网络、应用分布式天线技术的无线网络等。
图1是本申请实施例可应用的通信系统的场景示意图。如图1所示，该通信系统100包括网络侧设备102，网络侧设备102可包括多个天线组。每个天线组可以包括多个天线，例如，一个天线组可包括天线104和106，另一个天线组可包括天线106和110，附加组可包括天线112和114。图1中对于每个天线组示出了2个天线，然而可对于每个组使用更多或更少的天线。网络侧设备102可附加地包括发射机链和接收机链，本领域普通技术人员可以理解，它们均可包括与信号发送和接收相关的多个部件(例如处理器、调制器、复用器、解调器、解复用器或天线等)。
网络侧设备102可以与多个终端设备(例如终端设备116和终端设备122)通信。然而，可以理解，网络侧设备102可以与类似于终端设备116或122的任意数目的终端设备通信。终端设备116和122可以是例如蜂窝电话、智能电话、便携式电脑、手持通信设备、手持计算设备、卫星无线电装置、全球定位系统、PDA和/或用于在无线通信系统100上通信的任意其它适合设备。
如图1所示，终端设备116与天线112和114通信，其中天线112和114通过前向链路116向终端设备116发送信息，并通过反向链路120从终端设备116接收信息。此外，终端设备122与天线104和106通信，其中天线104和106通过前向链路124向终端设备122发送信息，并通过反向链路126从终端设备122接收信息。
例如，在频分双工(frequency division duplex，FDD)系统中，例如，前向链路116可利用与反向链路120所使用的不同频带，前向链路124可利用与反向链路126所使用的不同频带。
再例如，在时分双工(time division duplex，TDD)系统和全双工(full duplex)系统中，前向链路116和反向链路120可使用共同频带，前向链路124和反向链路126可使用共同频带。
被设计用于通信的每组天线和/或区域称为网络侧设备102的扇区。例如，可将天线组设计为与网络侧设备102覆盖区域的扇区中的终端设备通信。在网络侧设备102通过前向链路116和124分别与终端设备116和122进行通信的过程中，网络侧设备102的发射 天线可利用波束成形来改善前向链路116和124的信噪比。此外，与网络侧设备通过单个天线向它所有的终端设备发送信号的方式相比，在网络侧设备102利用波束成形向相关覆盖区域中随机分散的终端设备116和122发送信号时，相邻小区中的移动设备会受到较少的干扰。
在给定时间，网络侧设备102、终端设备116或终端设备122可以是无线通信发送装置和/或无线通信接收装置。当发送数据时，无线通信发送装置可对数据进行编码以用于传输。具体地，无线通信发送装置可获取(例如生成、从其它通信装置接收、或在存储器中保存等)要通过信道发送至无线通信接收装置的一定数目的数据比特。这种数据比特可包含在数据的传输块(或多个传输块)中，传输块可被分段以产生多个码块。
此外，该通信系统100可以是公共陆地移动网络PLMN网络或者设备对设备(device to device，D2D)网络或者机器对机器(machine to machine，M2M)网络或者其他网络，图1仅为便于理解而示例的简化示意图，网络中还可以包括其他网络设备，图1中未予以画出。
图2是现有的一种信息传输的方法流程图。如图2所示，发送端设备向接收端设备发送信息数据，需要说明的是，在本发明各实施例中，发送端设备可以是通信系统中的网络设备，如基站，则相应的接收端设备可以是终端。可替代地，发送端设备也可以是终端设备，接收端设备也可以是网络设备。
应理解，本申请实施例中，发送端设备也可以称为编码设备，接收端设备也可以称为译码设备，本申请实施例并不限于此。
具体的，如图2所示，发送端设备需要发送信息数据时，发送端设备首先需要对需要发送的信息比特进行信道编码，得到目标码序列，对目标码序列进行调制，最后通过信道发送调制后的序列。
相应地，接收端设备接收到该信道传输的序列后，分别经过解调，信道解码后获得信息数据。
应理解，图2中信息传输的方法只是示意性的，在实际传输过程中还可以包括其他过程，本申请实施例并不限于此。
例如，在信道编码之后进行速率匹配，并且还可以经过复用、比特加扰的过程，然后再进行调制过程，之后还可以进行交织、小区相关加扰、资源映射到信道的物理资源上进行传输，相反地，接收端可以进行对应的逆过程，获取到信宿信息。
目前NR标准中增强型移动宽带(enhanced mobile broadband，eMBB)场景的LDPC码在部分码长码率下会出现错误平层(error floor)的现象(即很多中等码长的LDPC码字都显示出错误平层现象，即到了一定的高信噪比区域内原本陡峭的信噪比与误比特率(Bit error rate)/误包率(Block error rate)曲线突然变得平坦起来)，这在对数据误包率要求更高的高可靠低时延通信(Ultra-reliable low latency communications，URLLC)场景是不能容忍的。
由于LDPC的错误平层现象主要是码设计时引入的陷阱集(trapping set)(其阻碍消息传播译码算法趋于正确的码字)导致的，鉴于上述问题，本申请实施例，提出了一种信息传输的方法，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC 码的trapping set从而能够避免或者降低LDPC码的错误平层现象。
以下，作为示例而非限定，结合附图3详细描述本申请实施例的信息传输的方法。
在描述本申请实施例之前，下面分别解释极化编码和LDPC编码。
极化(Polar)码是第一种、也是已知的唯一一种能够被严格证明“达到”信道容量的信道编码方法。在不同码长下，尤其对于有限码，Polar码的性能远优于Turbo码和LDPC码。另外，Polar码在编译码方面具有较低的计算复杂度。这些优点让Polar码在5G中具有很大的发展和应用前景。
极化码是可以取得香农容量且具有低编译码复杂度的编码方式。Polar码是一种线性块码。其生成矩阵为G N.，其编码过程为
Figure PCTCN2019074794-appb-000014
其中，
Figure PCTCN2019074794-appb-000015
是一个二进制的行矢量，
Figure PCTCN2019074794-appb-000016
码长N＝2 n，n≥0。
Figure PCTCN2019074794-appb-000017
B N是一个N×N转置矩阵，例如比特反转(bit reversal)矩阵。
Figure PCTCN2019074794-appb-000018
是F 2的克罗内克幂(Kronecker power)，定义为
Figure PCTCN2019074794-appb-000019
具体而言，Polar码是一种依赖于信道(Channel dependent)的编码，它对N个相同的信道W进行Polar Codes码极化处理，得到N个极化信道，当然，这N个极化信道的巴氏参数(Bhattacharyya parameter)要么趋于0，要么趋于1。Polar Codes码在实际应用时，一个重要的工作是针对不同信道W，计算所有N＝2 n个极化信道的可靠度，然后选取其中的K个可靠度较高的极化信道，把这些极化信道对应的位置索引号集合称为信息集合(Information Set)
Figure PCTCN2019074794-appb-000020
另外的一部分比特置为收发端预先约定的固定值，称之为固定比特，其序号的集合用
Figure PCTCN2019074794-appb-000021
的补集
Figure PCTCN2019074794-appb-000022
表示。Polar码编码时，把K个信息符号放置到信息集合对应的位置上，其余(N-K)个位置(称为冻结集合(Frozen Set))放置固定已知符号，一般可以取该(N-K)个固定已知符号为全0符号，其中，K<N。实际上，只需要收发端预先约定，固定比特序列可以被任意设置。从而，Polar码的编码比特序列可通过如下方法得到：
Figure PCTCN2019074794-appb-000023
这里
Figure PCTCN2019074794-appb-000024
为
Figure PCTCN2019074794-appb-000025
中的信息比特集合，
Figure PCTCN2019074794-appb-000026
为长度K的行矢量，即
Figure PCTCN2019074794-appb-000027
|·|表示集合中元素的数目，即K表示集合
Figure PCTCN2019074794-appb-000028
中元素的数目，也表示待编码信息比特的数量，也
Figure PCTCN2019074794-appb-000029
是矩阵G N中由集合
Figure PCTCN2019074794-appb-000030
中的索引对应的那些行得到的子矩阵，
Figure PCTCN2019074794-appb-000031
是一个K×N的矩阵。集合
Figure PCTCN2019074794-appb-000032
的选取决定了Polar码的性能。
LDPC码是另一种逼近香农极限的编码。其是一类具有稀疏校验矩阵的线性分组码，也就是说LDPC码的校验矩阵中零元素远远多于非零元素，且非零元素的分布没有规律。其中，一个码长等于N，信息比特的长度等于K的线性分组码可以由其校验矩阵唯一确定。
准循环低密度奇偶检验码(Quasi-Cyclic Low Density Parity Check，QC-LDPC)是LDPC的一个子类。QC-LDPC的校验矩阵(parity check matrix)是对一个基矩阵进行扩展得到的，以下将基矩阵记作Hb，将校验矩阵记作H。其中，基矩阵中非零元素的位置，例如，非零元素所在的行和列，可以通过基图(base graph，BG)来描述。
如果基矩阵H b的大小为m b×n b，则校验矩阵H的大小为(m b·Z)×(n b·Z)，其中，将Z称作校验矩阵的扩展因子。
下面给出QC-LDPC的校验矩阵H的表达式：
Figure PCTCN2019074794-appb-000033
上述公式中，校验矩阵H的每一个元素
Figure PCTCN2019074794-appb-000034
是零矩阵或循环移位矩阵，其中，循环移位矩阵是对Z×Z大小的单位矩阵I循环移位a ij位得到的。因此，也将a ij称作循环移位矩阵的移位因子，在有些示例中，a ij也可表示为P i,j。a ij的取值范围是-1≤a ij<Z。
如果校验矩阵H是满秩矩阵，则可以在基矩阵的(n b-m b)列放置(n b-m b)·Z个信息比特，因此，可以将基矩阵的(n b-m b)列称作信息列，并令k b＝n b-m b。
采用QC-LDPC编码时，如果信息比特的长度K被k b整除，那么在扩展后的每一个信息比特位置都用来放置信息比特。如果K不被k b整除，导致Z·k b＞K，则在扩展后LDPC的校验矩阵H中会有(Z·k b-K)个多余的信息比特位置，可称作填充比特。
如图3所述的方法，可以应用于上述任一通信系统。图3的方法为从系统角度描述的本申请实施的信息传输的方法，其中，发送端设备对数据进行编码，接收端设备对数据进行解码。
具体地，如图3所示的方法300包括：
310，发送端设备对信息比特进行极化码与LDPC码的级联编码，获得第一编码序列。
320，发送端设备向接收端设备发送该第一编码序列。
具体地，该第一编码序列经过信道的传输成为第一待译码序列(也可以称为软信息)。
相应的，接收端设备接收该第一待译码序列。
330，接收端设备对该第一待译码序列进行LDPC码与极化码的译码，获得译码信息比特。
因此，本申请实施例，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
下面，结合具体的例子，分别描述本申请实施例中发送端设备执行的编码的方法和接收端设备执行的译码的方法。
图4是根据本申请实施例的编码的过程示意框图。
具体地，如图4所示，发送端设备根据信息比特的长度K和第一编码序列的第一目标码长M，确定极化编码的参数R o或者M o，其中，R o＝K/M o，然后，发送端设备根据所述R o或者M o，对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；接着，发送端设备对所述第二编码序列进行低LDPC编码，得到长度为M的所述第一编码序列；发送所述第一编码序列。
例如，信息比特u的长度为K，编码序列x的长度为M，码率为R＝K/M，编码具体流程如下：
发送端设备将信息比特u进行Polar编码，获得第二编码序列x o，长度为M o，得到Polar编码的码率为R o＝K/M o。
发送端设备将第二编码序列x o进行LDPC编码，获得第一编码序列x，长度为M，得到LDPC编码码率为R i＝M o/M。
对于级联编码而言，例如图4所示，所述第二编码序列x o可以被称为外码编码序列，第一编码序列x可以被称为内码编码序列。
具体地，下面结合图5具体地例子，详细描述本申请实施中发送端设备编码的具体过程。
图5所示的方法500可以由发送端设备执行。具体地，如图5所示的方法500包括：
510，根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数。
具体地，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值。
具体而言，发送端设备首先能够确定信息比特的长度K和第一编码序列的第一目标码长M。也就是说发送端设备能够确定级联编码的输入为长度为K的信息比特，并能够确定级联编码的输出为长度为M的第一编码序列。
由于发送端设备需要先进行极化编码，然而在仅知道极化编码的输入为长度为K的信息比特的情况下，无法进行极化编码，因此需要确定极化编码的参数。
应理解，极化编码的码率为R o＝K/M o。其中，M o为极化编码的码长。
也就是说在确定极化编码的输入为长度为K的信息比特的情况下，只要知道了极化编码的码率R o或者极化编码的码长即可进行极化编码。
下面详细描述本申请实施例中根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数的具体例子。
应理解，本申请实施例的级联码中，主要利用LDPC码的纠错能力，Polar码作为外码对LDPC的软译码结果进行辅助纠错，因此极化编码的码率Ro应尽可能大，从而能够减小级联码的性能损失，并且，在本申请实施例中极化编码的码率Ro也需要保证极化编码具有足够的纠错能力，以对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
图6为K＝944，M＝5664时LDPC编码与Polar-LDPC级联码的性能对比图。从图中可以看出，在信噪比(Es/N0)较低，即误包率(BLER)较大的区域，级联码的性能较差，这是因为级联码中引入的Polar外码带来了码率的损失。同时可以看到，在信噪比升高的过程中，LDPC编码的误包率曲线出现了错误平层的现象，这说明了此时LDPC译码进入了陷阱集中；而级联码的误包率曲线则没有出现错误平层现象，这是因为外码Polar码的辅助纠错能力成功纠正了LDPC译码中出现的错误。故在URLLC场景关注的工作区间内，级联码的性能明显优于LDPC码。图中M o为1024，R o为0.92。由信道编码的原理易知，当M o(R o)增大(减小)时，Polar码的纠错能力增加，造成的码率损失增大，故图中的误包率曲线将会右移，在URLLC场景关注的工作区间内可能较LDPC编码有性能损失；M o(R o)减小(增大)时，造成的码率损失减小，图中的误包率曲线将会左移，但是此时Polar码的纠错能力减小，有可能失去对LDPC译码结果的纠错能力，即同样出现错误平层现象。故需要对M o和R o进行设计。
因此，基于上述考虑，本申请实施例中可以采用如下方案确定极化编码的参数。
可选地，作为一个实施例，所述极化编码的参数为极化编码的码率，所述根据所述信息比特的长度K和/或所述第一编码序列的第一目标码长M，确定极化编码的参数，包括：
根据所述信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000035
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。
对于上述计算R o的第一个公式，R o为K的线性函数。也就是说发送端设备可以根据信息比特的长度K使用上述第一个公式即可确定极化码的码率。
其中a可以等于0且b∈[0.85，0.95]，或者a∈[1/48000，1/47000]且b∈[0.85,0.9]；
也就是说a和b的取值可以如表1所示的两组取值中的一对取值。
例如，a和b的取值可以为第一组中的一对取值，例如，a的取值为0，b的取值为0.85、0.90、0.92、0.93或0.95等。
或者，a和b的取值可以为第二组中的一对取值。例如，a的取值为1/48000，b的取值为0.9；或者，a的取值为1/48000，b的取值为0.85；或者a的取值为1/47500，b的取值为0.85；或者a的取值为1/47500，b的取值为0.88；或者，a的取值为1/47000，b的取值为0.90等，本申请实施例并不限于此，可选的，a和b的取值可以为表1所示的两组取值范围中的任意一对取值。
表1
  第一组 第二组
a 0 [1/48000～1/47000]
b [0.85～0.95] [0.85-0.9]
可选地，在一个实施例中，具体的a和b的取值可以为以下表2两种取值中的一种。
表2
  第一种取值 第二种取值
a 0 1/48000
b 0.9 0.9
其中a的取值表示R o的取值也与K的大小相关，K越大，R o增加一个越大的增量。a＝0可以理解为是一种特殊情况，这样设计能够降低系统的复杂。
应理解，本申请实施例中某一参数的取值属于一个区间范围时，该某一参数可以取该 区间范围的端点值，例如，如表1所示，b的取值范围为[0.85～0.95]，那么b可以取端点值0.85或0.95。下文中的其他参数取值为某一区间范围时，与此类似，同样也可以取端点值，下面不再一一说明。
根据上述计算R o的第一个公式，以及上述a和b的取值能够得出，R o的取值最小为0.85。因此，本申请实施例能够保证极化编码的码率Ro应尽可能大，从而能够减小级联码的性能损失，并且，在信息比特长度K小于35000的情况下，本申请实施中的R o的取值最大为0.95。因此，本申请实施例中极化编码的码率Ro能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
对于上述计算R o的第二个公式，R o为K的分段函数。也就是说发送端设备可以根据信息比特的长度K使用上述第二个公式即可确定极化码的码率。
需要说明的是，在上述计算R o的第二个公式，即R o为K的分段函数的公式中，定义了R o＝R o1，K thd1＜K＜K thd2；R o＝R o2，K thd2＜K＜K thd3。其中并没有指出K＝K thd2的情况，应注意，K＝K thd2可以落入K thd1＜K＜K thd2的情况，即上述公式可以变形为R o＝R o1，K thd1＜K≤K thd2；K＝K thd2也可以落入K thd2＜K＜K thd3的情况，即上述公式可以变形为R o＝R o2，K thd2≤K＜K thd3本申请实施例并不限于此。
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。例如，R o1＜R o2＜…R o2且均属于[0.85～0.95]。
0＜K thd1<K thd2…＜K thdn+1。例如，作为一个实施例，上述计算R o的第二个公式可以为面的形式。
Figure PCTCN2019074794-appb-000036
根据上述R o的第二个公式，以及上述参数的取值能够得出，R o的取值最小为0.85。因此，本申请实施例能够保证极化编码的码率R o应尽可能大，从而能够减小级联码的性能损失，并且，本申请实施中的R o的取值最大为0.95。因此，本申请实施例中极化编码码率R o能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
具体地，发送端设备可以根据上述公式确定R o，进而发送端设备即可以根据公式然后在进行R o＝K/M o，确定极化编码的码长M o，进而发送端设备可以进行极化编码。
应理解，本申请实施例中M o可以为极化编码的母码长度，也可以为母码进行速率匹配后的长度，在有速率匹配时，该M o也可以称为极化编码的目标码长，本申请实施例并不限于此。
可替代地，作为一个实施例，所述极化编码的参数为极化编码的码长M o，所述根据所述信息比特的长度K和/或所述第一编码序列的第一目标码长M，确定极化编码的参数，包括：
根据所述信息比特的长度K和所述第一编码序列的第一目标码长M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000037
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000038
表示取整，例如，
Figure PCTCN2019074794-appb-000039
表示向上、向下或是四舍五入取整等，本申请实施例并不限于此。
或者，所述根据所述信息比特的长度K和/或所述第一编码序列的第一目标码长M，确定极化编码的参数，包括：
根据所述信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000040
其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
对于上述计算M o的第一个公式，M o为K和M的函数。也就是说发送端设备可以根据信息比特的长度K和第一编码序列的第一目标码长M使用上述第一个公式即可确定极化码的码长。
例如，x、y和z的取值可以为表3所示的三组取值中的一种取值。
x、y和z的取值可以为第一组中的一种取值，例如，x的取值为1，y的取值为0，z的取值为90、95、100、105或110等，本申请实施例并不限于此。
或者，x、y和z的取值可以为第二组中的一种取值。例如，x的取值为1.1，y的取值为-1/90，z的取值为0；或者，x的取值为1.2，y的取值为-1/100，z的取值为0等，本申请实施例并不限于此，
或者，x、y和z的取值可以为第三组中的一种取值。例如，x的取值为10/8～20/19中的一个取值，例如，x的取值为10/8、20/17、20/18或20/19，y的取值为0，z的取值为0等，本申请实施例并不限于此，
表3
  第一组 第二组 第三组
x 1 1.1～1.3 10/8～20/19
y 0 -1/90～-1/110 0
z 90-110 0 0
可选地，在一个实施例中，具体的x、y和z的取值可以是以下表4中的三种取值的一种。
表4
  第一种取值 第二种取值 第三种取值
x 1 20/17 10/9
y 0 -1/100 0
z 100 0 0
根据上述计算M o的第一个公式，以及上述x、y和z的取值能够得出，本申请实施例能够保证极化编码的码率R o应尽可能大，且能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
对于上述计算M o的第二个公式，M o为K的分段函数。也就是说发送端设备可以根据信息比特的长度K使用上述第二个公式即可确定极化码的码长M o。
需要说明的是，在上述计算M o的第二个公式，即M o为K的分段函数的公式中，定义了M o＝a 1×K+M o1,K thd1＜K＜K thd2；M o＝a 2×K+M o2,K thd2＜K＜K thd3。其中并没有指出K＝K thd2的情况，应注意，K＝K thd2可以落入K thd1＜K＜K thd2的情况，即上述公式可以变形为M o＝a 1×K+M o1,K thd1＜K≤K thd2；K＝K thd2也可以落入K thd2＜K＜K thd3的情况，即上述公式可以变形为M o＝a 2×K+M o2,K thd2≤K＜K thd3；本申请实施例并不限于此。
其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。例如，作为一个实施例，上述计算M o的第二个公式可以为下面的形式。
Figure PCTCN2019074794-appb-000041
根据上述M o的第二个公式，能够得出，本申请实施例能够保证极化码的码率R o应尽可能大，且能够保证极化编码具有足够的纠错能力，因此，本申请实施例能够对落入陷阱集(trapping set)中的译码结果进行纠错，从而避免或者降低LDPC码的错误平层现象。
520，根据极化编码的参数对长度为K的信息比特进行极化编码，获得第二目标码长为M o的第二编码序列。
具体地，在确定出极化编码的参数后，如图4所示，发送端设备可以根据信息比特的长度K和极化编码的码长M o，对长度为K的信息比特进行极化编码，得到第二目标码长为M o的第二编码序列。
可替代地，作为另一实施例，在确定出极化编码的参数后，本申请实施例可以将所述K个信息比特分成p段，获得p个信息块，p为大于或等于1的整数；
对所述p个信息块的每个信息块分别进行极化编码，得到p个子编码序列；
获得长度为M o的所述第二编码序列，所述第二编码序列包括所述p个子编码序列。
因此，本申请实施例对信息比特分段进行极化编码，能够减小级联编码的时延。
并且，进一步的，本申请实施例通过分段能够避免误码超过误码长度，避免重复编码，提高编码效率。
可选地，作为另一实施例，p为满足以下不等式的最小整数：
Figure PCTCN2019074794-appb-000042
即
Figure PCTCN2019074794-appb-000043
Figure PCTCN2019074794-appb-000044
表示向上取整，K thd为预设分段阈值。
每个信息块的比特个数为
Figure PCTCN2019074794-appb-000045
例如，K thd的取值范围可以是[0.85～0.95]×2 m，其中m为正整数。例如，假设K thd＝0.95×2 9＝472，当K＝944时，p＝2。
例如，如图7所示，本申请实施例可以将长度为K的信息比特分成两段，得到第一信息块和第二信息块，并分别进行Polar编码，分别获得长度为M o/2的子编码序列，之后将该两个子编码序列级联在一起，得到长度为M o的所述第二编码序列，最后对第二编码序列进行LDPC编码，得到长度为M的第一编码序列。
应理解，上述每个信息块的长度为K/p的向上取整，因此，当K/p为小数时，该p个信息块的长度之和会大于K，这种情况下，本申请实施例需要进行信息比特进行填充。
具体的，填充方式可以是对任意一段信息比特的头、尾或中间位置填充K seg×p-K个0比特或1比特；或是对任意K seg×p-K段信息比特的头、尾或中间位置填充1个0比特或1比特。
应理解，本申请实施例中在需要进行信息比特填充时，可以先分段再填充，即可以先将K个信息比特分成p段，然后对p段中的至少一段进行信息比特填充，获得p个信息块。应理解，该p个信息块的比特个数均相等。可选地，本申请实施例中在需要进行信息比特填充时，可以先填充，再分段，即可以先对K个信息比特进行填充，然后对填充后获得的信息比特进行分度，分成p个信息块。
下面首先介绍，先分段再填充的具体方案。
具体地，作为一个实施例，在一种实现方式中，K seg×p＞K，
所述将根据K个信息比特，确定p个信息块，，具体包括：
将所述长度为K的信息比特分为p段，并对所述p段信息块中的至少一个信息块进行填充，得到所述p个信息块。
例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先将信息比特分为4段，例如，进行分段后的信息块的长度分别为4,4,3,3。那么可以将该4个信息块中的后两个信息块分别填充1个比特，例如，填充0比特，或1比特。使得填充后的每个信息块的长度均为4。应理解，该填充的的1个比特可以填充在需要填充的信息块的头部、尾部或者中间位置，本申请实施例并不限于此。
再例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先将信息比特分为4段，例如，进行分段后的信息块的的长度分别为4,4,4,2。那么可以将该4个信息块中的最后一个信息块填充2个比特，例如，填充2个0比特，或2个1比特。使得填充后的每个信息块的长度均为4。应理解，该填充的的2个比特可以填充在需要填充的信息块的的头部、尾部或者中间位置，本申请实施例并不限于此。
下面介绍，先先填充，再分段的具体方案。
可选地，作为一个实施例，在一种实现方式中，K seg×p＞K，
根据K个信息比特，确定p个信息块具体包括：将所述长度为K的信息比特进行填 充，使得填充后的比特数等于K seg×p，
之后将填充完成后的信息比特分成p段，获得P个信息块，并对该p信息块分别进行极化编码。
例如，K的取值为14，p的取值为4，那么，本申请实施例可以首先对K个信息比特填充2个比特。例如，填充0比特或者1比特。应理解，该填充的2个比特可以为该信息比特的头部、尾部或者中间位置，本申请实施例并不限于此。填充完成后获取长度为16的信息比特。那么可以将该长度为16的信息比特分成长度分成4段，每段信息块长度相等，每段信息块长度为4个比特。然后分别对该p段信息块进行极化编码。
需要说明的是，在实际应用中，发送端设备可以首先判断K与K seg的大小，如果确定K≥K seg时，本申请实施例即可按照上文描述的方式对信息比特分段，并对各段分别进行极化编码。可替代地，发送端设备可以不需要进行判断，可以直接按照上述确定p的公式确定出p的取值，当p为1时，发送端设备不需要对信息比特分段。当p的取值大于1时，则发送端设备则将信息比特分成p段，并分别对p个信息块进行极化编码，本申请实施例并不限于此。
可选地，作为另一实施例，在发送端设备将信息比特分成p段，并分别进行极化编码得到p个子编码序列后，发送端设备需要将所述p个子编码序列组合，得到长度为M o的所述第二编码序列。具体的，发送端设备可以将所述p个子编码序列顺序级联或者交织级联，得到所述第二编码序列。
本申请实施例通过将p个子编码序列顺序级联能够降低编码及译码的复杂度。
本申请实施例通过将p个子编码序列交织级联能够增强抗干扰能力。
530，对第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的第一编码序列。
在发送端得到第一编码序列后，可以经过调制等处理过程通过信道发送至接收端设备，本申请实施例并不限于此。
因此，本申请实施例，通过将LDPC码级联Polar码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set从而能够避免或者降低LDPC码的错误平层现象。
上文描述了本申请实施例发送端设备进行的编码的详细过程。下面详细描述本申请实施中接收端设备译码的具体过程。
图8是根据本申请实施例的译码的过程示意框图。
具体地，如图8所示，接收端设备获取长度为M的第一待译码序列，发送端设备对长度为M的第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列(也可以称为软信息比特)，之后对第二待译码序列进行LDPC译码，得到长度为K的译码信息比特。
具体而言，接收端设备首先从信道得到待译码序列y，长度为M，首先接收端设备进行LDPC译码，得到软信息比特y i，长度为M o然后，将y i进行Polar译码，恢复出信息比特
Figure PCTCN2019074794-appb-000046
(即译码信息比特)。
具体地，下面结合图9具体地例子，详细描述本申请实施中接收端设备译码的具体过程。应理解，本申请实施例中接收端设备执行的译码动作与发送端设备执行的动作相对应，接收端设备执行的译码动作大体与发送端执行的动作相反，因此，为了避免重复，下文适当省略详细描述。
具体的，如图9所示的方法900包括：
910，获取长度为M的第一待译码序列。
应理解，该第一待译码序列对应发送端设备发送的长度为M的第一编码序列。
920，根据编码的信息比特的长度K和/或第一待译码序列的长度M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中，LDPC编码的序列长度与极化编码的码长M o相等。
可选地，作为另一实施例，所述极化编码的参数为极化编码的码率，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000047
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R on为常数，K thd1，K thd2…K thdn+1为常数。
可替代地，作为另一实施例，所述极化编码的参数为极化编码的码长M o，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K和所述第一待译码序列的长度M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000048
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000049
表示取整；
或者，
所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000050
其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
应理解，步骤920与步骤510对应，步骤920的描述可以参见510中的相应描述，为了避免重复，此处不再详述。
930，对第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列。
940，根据所述极化编码的参数，对第二待译码序列进行极化译码，得到长度为K的译码信息比特。
具体地，在确定出极化编码的参数后，如图8所示，接收端设备可以根据信息比特的长度K和极化编码的码长M o，对长度为M o所述第二待译码序列进行极化编码，得到长度为K的译码信息比特。
需要说明的是，与发送端设备编码的方式对应，在发送端设备分段编码的情况下，接收端设备也需要分段译码。
具体的，作为另一实施例，所述对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特，包括：
将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
将所述p个子信息块组合，得到长度为K的所述译码信息比特。
可选地，作为另一实施例，p为满足以下不等式的最小整数：
Figure PCTCN2019074794-appb-000051
即
Figure PCTCN2019074794-appb-000052
Figure PCTCN2019074794-appb-000053
表示向上取整，K thd为预设分段阈值。
每个信息块的比特个数为
Figure PCTCN2019074794-appb-000054
例如，K thd的取值范围可以是[0.85～0.95]×2 m，其中m为正整数。例如，假设K thd＝0.95×2 9＝472，当K＝944时，p＝2。
例如，如图10所示，本申请实施例可以将长度为M o的第二待译码序列拆分成两个子待译码序列，即第一子待译码序列和第二子待译码序列，并分别进行Polar译码，得到2个信息块，即第一信息块和第二信息块，之后将该两个信息块组合在一起，得到长度为K的所述译码信息比特。
当发送端设备在Polar编码时，将p个子编码序列交织级联，得到第二编码序列的情况下。接收端设置在译码时相应地，需要进行解交织。
可选地，作为另一实施例，在对各个子待译码序列进行极化译码之前，接收端设备对所述p个子待译码序列进行解交织，然后对解交织后的p个子待译码序列分别进行译码得到p个信息块，然后，将该p个信息块组合在一起即可得到长度为k的译码信息比特。
具体的，作为一个实施例，在840中，接收端设备将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列进行解交织，获取交织后的p个子待译码序列，
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
将所述p个信息块组合，得到长度为K的所述译码信息比特。
应理解，在发送端设备在极化编码填充比特时，相应地，接收端设备需要进行取填充。
进一步地，作为另一实施例，所述将所述p个信息块组合，得到长度为K的所述信息比特，包括：
对所述p个信息块中的至少一个信息块进行去填充，得到所述p个信息块对应的p段信息比特；
将所述p段信息比特顺序级联，得到长度为K的所述信息比特。
具体地，接收端设备去填充的处理方式与发送端设备填充比特的方式对应，为避免重复，此处不再赘述。
前文描述了在极化译码之前先进行解交织的方案。
可选地，本申请实施例中，也可以先对p个子待译码序列进行极化译码，得到p个信息块，
然后对p个信息块进行解交织和去填充处理，最后得到长度为K的译码信息比特，
应理解，在极化译码之后，可以先进行解交织，再进行去填充处理。
具体而言，作为另一实施例，在840中，接收端设备将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
对所述p个信息块进行解交织，获取交织后的p个信息块，
对交织后的所述p个信息块中的至少一个信息块进行去填充，得到交织后的p个信息块对应的p段信息比特；
将所述p段信息比特顺序级联，得到长度为K的所述译码信息比特；
应理解，在极化译码之后，也可以先进行去填充，再进行解交织。
具体而言，作为另一实施例，在840中，接收端设备将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
对所述p个信息块中的至少一个信息块进行去填充，得到所述p个信息块对应的p段信息比特；
将所述p段信息比特解交织级联，得到长度为K的所述译码信息比特。
具体的，接收端设备执行的解交织与去填充的处理与发送端设备执行的交织和填充比特的处理对应，此处，为了避免重复，不再一一赘述。
因此，本申请实施例，通过将LDPC码级联Polar码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set从而能够避免或者降低LDPC码的错误平层现象。
还应理解，本申请实施例中，图3至图10的例子仅是示例性的，图3至图10的例子仅仅是为了帮助本领域技术人员理解本发明实施例，而非要将本发明实施例限于所例示的具体数值或具体场景。本领域技术人员根据所给出的图3至图10的例子显然可以进行各种等价的修改或变化，这样的修改或变化也落入本发明实施例的范围内。
例如，上述实施例中各个参数的取值范围可以灵活的变化，例如参数的范围可扩大或者缩小等，本申请实施例并不限于此。
应理解，在本申请的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
上文中，结合图1至图10详细描述了本发明实施例中发送端设备执行的编码的方法 和接收端设备执行的译码的方法，下面结合图11和图13描述本申请实施例的编码设备。结合图12和图14描述本申请实施例的译码设备。
图11是根据本申请一个实施实施例的编码设备的示意框图。具体地，如图11所示的编码设备可以为如图1所示的发送端设备，执行上述方法实施例中发送端设备的功能。应理解，发送端设备可以是通信系统中的网络设备，如基站，则相应的接收端设备可以是终端设备。可替代地，发送端设备也可以是终端设备，接收端设备也可以是网络设备。
如图11所示的编码设备1100包括处理单元1110和收发单元1120。
所述处理单元用于根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中K，M以及M o为正整数；
根据所述极化编码的参数对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；
对所述第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的所述第一编码序列；
所述收发单元用于发送所述第一编码序列。
因此，本申请实施例，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
可选地，作为另一实施例，所述极化编码的参数为极化编码的码率，所述所述处理单元具体用于根据所述信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000055
其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。
可选地，作为另一实施例，所述极化编码的参数为极化编码的码长M o，所述处理单元具体用于根据所述信息比特的长度K和所述第一编码序列的第一目标码长M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000056
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000057
表示取整；
或者，
根据所述信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000058
其中a 1，a 2…a n，M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
可选地，作为另一实施例，所述处理单元具体用于:
根据K个信息比特，确定p个信息块，p为大于或等于1的整数；
对所述p个信息块分别进行极化编码，得到p个子编码序列；
获得长度为M o的所述第二编码序列，所述第二编码序列包括所述p个子编码序列.
应理解，图10所示的编码设备1000能够实现图1至图9方法实施例中编码设备(例如，发送端设备)执行的各个过程。编码设备1000中的各个模块的操作和/或功能，分别为了实现上述方法实施例中的相应流程。具体可参见上述方法实施例中的描述，为避免重复，此处适当省略详述描述。
图11是根据本申请一个实施实施例的译码设备的示意框图。具体地，如图11所示的译码设备可以为如图1所示的接收端设备，执行上述方法实施例中接收端设备的功能。应理解，发送端设备可以是通信系统中的网络设备，如基站，则相应的接收端设备可以是终端设备。可替代地，发送端设备也可以是终端设备，接收端设备也可以是网络设备。
如图11所示的译码设备1100包括处理单元1110和收发单元1120。
所述收发单元用于获取长度为M的第一待译码序列；
所述处理单元用于根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中，LDPC编码的序列长度与极化编码的码长M o相等，其中K，M以及M o为正整数；；
对所述第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列；
根据所述极化编码的参数，对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特。
因此，本申请实施例，通过将Polar码级联LDPC码的方式，利用Polar码的纠错能力绕过LDPC码的trapping set，从而能够避免或者降低LDPC码的错误平层现象，能够提高系统性能。
可选地，作为另一实施例，其特征在于，所述极化编码的参数为极化编码的码率，所述处理单元具体用于根据所述编码的信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
R o＝a×K+b；或者，
Figure PCTCN2019074794-appb-000059
其中，R o表示所述极化码的码率，a和b为常数，R o1,R o2...R on为常数，K thd1， K thd2...K thdn+1为常数。
可选地，作为另一实施例，所述极化编码的参数为极化编码的码长M o，所述处理单元具体用于根据所述编码的信息比特的长度K和所述第一待译码序列的长度M，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000060
其中x，y，z为常数，
Figure PCTCN2019074794-appb-000061
表示取整；
或者，
所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
根据所述编码的信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
Figure PCTCN2019074794-appb-000062
其中a 1，a 2…a n，M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
可选地，作为另一实施例，其特征在于，所述处理单元具体用于：
将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
对所述p个子待译码序列分别进行极化译码，得到p个信息块；
将所述p个信息块组合，得到长度为K的所述译码信息比特。
应理解，图11所示的译码设备1100能够实现图1至图9方法实施例中涉及译码设备(例如，接收端设备)的各个过程。译码设备1100中的各个模块的操作和/或功能，分别为了实现上述方法实施例中的相应流程。具体可参见上述方法实施例中的描述，为避免重复，此处适当省略详述描述。
图12是根据本申请另一实施实施例的编码设备的示意框图。具体地，如图12所示的编码设备可以应用于如图1所示的系统中，执行上述方法实施例中编码设备的功能。
具体地，如图12所示，该编码设备1200包括：处理器1210和收发器1220，其中，处理器1210和收发器1220相连，可选地，该编码设备还可以包括存储器1230，处理器1210和存储器1230相连，其中，处理器1210、收发器1220和存储器1230之间通过内部连接通路互相通信，传递控制和/或数据信号。
该收发器1220可以为具有收发功能的天线或者控制电路，收发器可包括用于接收数据的接收机和用于发送数据的发射机。该存储器1230可以用于存储指令，该处理器1210用于执行该存储器1230存储的指令，控制收发器1220收发送信息或信号，控制器1210在执行存储器1230中的指令能够完成上述图1至图9方法实施例中涉及编码设备的各个过程。为避免重复，此处不再赘述。
应理解，编码设备1200可以与上述图10中的编码设备1000相对应，编码设备1000中的处理单元1010的功能可以由处理器1210实现，收发单元1020的功能可以由收发器1220实现。为避免重复，此处适当省略详细描述。
图13是根据本申请另一实施实施例的译码设备的示意框图。具体地，如图13所示的译码设备可以应用于如图1所示的系统中，执行上述方法实施例中译码设备的功能。
具体地，如图13所示，该译码设备1300包括：处理器1310和收发器1320，其中，处理器1310和收发器1320相连，可选地，该译码设备还可以包括存储器1330，处理器1310和存储器1330相连，其中，处理器1310、收发器1320和存储器1330之间通过内部连接通路互相通信，传递控制和/或数据信号。
该收发器1320可以为具有收发功能的天线或者控制电路，收发器可包括用于接收数据的接收机和用于发送数据的发射机。该存储器1330可以用于存储指令，该处理器1310用于执行该存储器1330存储的指令，控制收发器1320收发送信息或信号，控制器1310在执行存储器1330中的指令能够完成上述图1至图9方法实施例中涉及译码设备的各个过程。为避免重复，此处不再赘述。
应理解，译码设备1300可以与上述图11中的译码设备1100相对应，译码设备1100中的处理单元1110的功能可以由处理器1310实现，收发单元1120的功能可以由收发器1320实现。为避免重复，此处适当省略详细描述。
应注意，本申请实施例中的处理器(例如，图12和图13中的处理器)可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated crcuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
可以理解，本申请实施例中的存储器(例如，图12和图13中的存储器)可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本申请实施例还提供了一种处理装置，包括处理器和接口；所述处理器，用于执行上 述任一方法实施例中的方法。
应理解，上述处理装置可以是一个芯片。例如，该处理装置可以是现场可编程门阵列(field-programmable gate array，FPGA)，可以是专用集成芯片(application specific integrated circuit，ASIC)，还可以是系统芯片(system on chip，SoC)，还可以是中央处理器(central processor unit，CPU)，还可以是网络处理器(network processor，NP)，还可以是数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU)，还可以是可编程控制器(programmable logic device，PLD)或其他集成芯片。
本申请实施例还提供了一种计算机可读介质，其上存储有计算机程序，该计算机程序被计算机执行时实现上述任一方法实施例的方法。
本申请实施例还提供了一种计算机程序产品，该计算机程序产品被计算机执行时实现上述任一方法实施例的方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。该计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行该计算机指令时，全部或部分地产生按照本申请实施例该的流程或功能。该计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。该计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，该计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。该计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。该可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(digital video disc，DVD))、或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
应理解，本文中涉及的第一、第二、第三、第四以及各种数字编号仅为描述方便进行的区分，并不用来限制本申请实施例的范围。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序和/或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程和/或执行线程中，部件可位于一个计算机上和/或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自与本地系统、分布式系统和/或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地和/或远程进程来通信。
应理解，说明书通篇中提到的“一个实施例”或“一实施例”意味着与实施例有关的特定特征、结构或特性包括在本申请的至少一个实施例中。因此，在整个说明书各处出现 的“在一个实施例中”或“在一实施例中”未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式结合在一个或多个实施例中。应理解，在本申请的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
另外，本文中术语“系统”和“网络”在本文中常被可互换使用。本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
应理解，在本申请实施例中，“与A相应的B”表示B与A相关联，根据A可以确定B。但还应理解，根据A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各示例的组成及步骤。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、装置或单元的间接耦合或通信连接，也可以是电的，机械的或其它的形式连接。
作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以是两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到本申请可以用硬件实现，或固件实现，或它们的组合方式来实现。当使用软件实现时，可以将上述功能存储在计算机可读介质中或作为计算机可读介质上的一个或多个指令或代码进行传输。计算机可读介质包括计算机存储介质和通信介质，其中通信介质包括便于从一个地方向另一个地方传送计算机程序的任何介质。存储介质可以是计算机能够存取的任何可用介质。以此为例但不限于：计算机可读介质可以包括RAM、ROM、EEPROM、CD-ROM或其他光盘存储、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构 形式的期望的程序代码并能够由计算机存取的任何其他介质。此外。任何连接可以适当的成为计算机可读介质。例如，如果软件是使用同轴电缆、光纤光缆、双绞线、数字用户线(DSL)或者诸如红外线、无线电和微波之类的无线技术从网站、服务器或者其他远程源传输的，那么同轴电缆、光纤光缆、双绞线、DSL或者诸如红外线、无线和微波之类的无线技术包括在所属介质的定影中。如本申请所使用的，盘(Disk)和碟(disc)包括压缩光碟(CD)、激光碟、光碟、数字通用光碟(DVD)、软盘和蓝光光碟，其中盘通常磁性的复制数据，而碟则用激光来光学的复制数据。上面的组合也应当包括在计算机可读介质的保护范围之内。
总之，以上所述仅为本申请技术方案的较佳实施例而已，并非用于限定本申请的保护范围。凡在本申请的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。

Claims (20)

  1. 一种编码的方法，其特征在于，包括：
    根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中K，M以及M o为正整数；
    根据所述极化编码的参数对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；
    对所述第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的所述第一编码序列；
    发送所述第一编码序列。
  2. 根据权利要求1所述的方法，其特征在于，所述极化编码的参数为极化编码的码率，所述根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，包括：
    根据所述信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
    R o＝a×K+b；或者，
    Figure PCTCN2019074794-appb-100001
    其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。
  3. 根据权利要求1所述的方法，其特征在于，所述极化编码的参数为极化编码的码长M o，所述根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，包括：
    根据所述信息比特的长度K和所述第一编码序列的第一目标码长M，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100002
    其中x，y，z为常数，
    Figure PCTCN2019074794-appb-100003
    表示取整；
    或者，
    根据所述信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100004
    其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，
    所述根据所述极化编码的参数对所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列，包括：
    根据K个信息比特，确定p个信息块，p为大于或等于1的整数；
    对所述p个信息块分别进行极化编码，得到p个子编码序列；
    获得长度为M o的所述第二编码序列，所述第二编码序列包括所述p个子编码序列。
  5. 一种译码的方法，其特征在于，包括：
    获取长度为M的第一待译码序列；
    根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中，LDPC编码的序列长度与极化编码的码长M o相等，其中K，M以及M o为正整数；
    对所述第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列；
    根据所述极化编码的参数，对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特。
  6. 根据权利要求5所述的方法，其特征在于，所述极化编码的参数为极化编码的码率，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
    根据所述编码的信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
    R o＝a×K+b；或者，
    Figure PCTCN2019074794-appb-100005
    其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R on为常数，K thd1，K thd2…K thdn+1为常数。
  7. 根据权利要求5所述的方法，其特征在于，所述极化编码的参数为极化编码的码长M o，所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
    根据所述编码的信息比特的长度K和所述第一待译码序列的长度M，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100006
    其中x，y，z为常数，
    Figure PCTCN2019074794-appb-100007
    表示取整；
    或者，
    所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，包括：
    根据所述编码的信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100008
    其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
  8. 根据权利要求5至7中任一项所述的方法，其特征在于，
    所述对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特，包括：
    将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
    对所述p个子待译码序列分别进行极化译码，得到p个信息块；
    将所述p个信息块组合，得到长度为K的所述译码信息比特。
  9. 一种编码设备，其特征在于，包括：
    处理单元和收发单元，
    所述处理单元用于根据信息比特的长度K和/或第一编码序列的第一目标码长M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中K，M以及M o为正整数；
    根据所述极化编码的参数对长度为K的所述信息比特进行极化编码，获得第二目标码长为M o的第二编码序列；
    对所述第二编码序列进行低密度奇偶校验LDPC编码，得到长度为M的所述第一编码序列；
    所述收发单元用于发送所述第一编码序列。
  10. 根据权利要求9所述的编码设备，其特征在于，所述极化编码的参数为极化编码的码率，所述所述处理单元具体用于根据所述信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
    R o＝a×K+b；或者，
    Figure PCTCN2019074794-appb-100009
    其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R o2为常数，K thd1，K thd2…K thdn+1为常数。
  11. 根据权利要求9所述的编码设备，其特征在于，所述极化编码的参数为极化编码的码长M o，所述处理单元具体用于根据所述信息比特的长度K和所述第一编码序列的第一目标码长M，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100010
    其中x，y，z为常数，
    Figure PCTCN2019074794-appb-100011
    表示取整；
    或者，
    根据所述信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100012
    其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
  12. 根据权利要求9至11中任一项所述的编码设备，其特征在于，所述处理单元具体用于:
    根据K个信息比特，确定p个信息块，p为大于或等于1的整数；
    对所述p个信息块分别进行极化编码，得到p个子编码序列；
    获得长度为M o的所述第二编码序列，所述第二编码序列包括所述p个子编码序列。
  13. 一种译码设备，其特征在于，包括：
    处理单元和收发单元，
    所述收发单元用于获取长度为M的第一待译码序列；
    所述处理单元用于根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编码的参数，所述极化编码的参数包括极化编码的码率或者极化编码的码长M o，其中，所述极化码的码率表示K与M o的比值，其中，LDPC编码的序列长度与极化编码的码长M o相等，其中K，M以及M o为正整数；；
    对所述第一待译码序列进行LDPC译码，得到长度为M o的第二待译码序列；
    根据所述极化编码的参数，对所述第二待译码序列进行极化译码，得到长度为K的译码信息比特。
  14. 根据权利要求13所述的译码设备，其特征在于，所述极化编码的参数为极化编码的码率，所述处理单元具体用于根据所述编码的信息比特的长度K，使用以下两个公式中的任意一种，确定所述极化编码的码率：
    R o＝a×K+b；或者，
    Figure PCTCN2019074794-appb-100013
    其中，R o表示所述极化码的码率，a和b为常数，R o1，R o2…R on为常数，K thd1，K thd2…K thdn+1为常数。
  15. 根据权利要求13所述的译码设备，其特征在于，所述极化编码的参数为极化编码的码长M o，所述处理单元具体用于根据所述编码的信息比特的长度K和所述第一待译码序列的长度M，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100014
    其中x，y，z为常数，
    Figure PCTCN2019074794-appb-100015
    表示取整；
    或者，
    所述根据编码的信息比特的长度K和/或所述第一待译码序列的长度M，确定极化编 码的参数，包括：
    根据所述编码的信息比特的长度K，使用以下公式，确定所述极化编码的码长M o：
    Figure PCTCN2019074794-appb-100016
    其中a 1，a 2…a n,M o1，M o2…M on为常数，K thd1，K thd2…K thdn+1为常数。
  16. 根据权利要求13至15中任一项所述的译码设备，其特征在于，所述处理单元具体用于：
    将所述第二待译码序列分成p个子待译码序列，p为大于或等于2的整数；
    对所述p个子待译码序列分别进行极化译码，得到p个信息块；
    将所述p个信息块组合，得到长度为K的所述译码信息比特。
  17. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有计算机指令，当所述计算机指令在计算机上运行时，使得计算机执行如权利要求1至4中任一项所述的方法。
  18. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有计算机指令，当所述计算机指令在计算机上运行时，使得计算机执行如权利要求5至8中任一项所述的方法。
  19. 一种芯片，其特征在于，包括存储器和处理器，所述存储器用于存储计算机程序，所述处理器用于从所述存储器中调用并运行所述计算机程序，使得安装有所述芯片的通信设备执行如权利要求1至4中任一项所述的方法。
  20. 一种芯片，其特征在于，包括存储器和处理器，所述存储器用于存储计算机程序，所述处理器用于从所述存储器中调用并运行所述计算机程序，使得安装有所述芯片的通信设备执行如权利要求5至8中任一项所述的方法。
PCT/CN2019/074794 2018-02-14 2019-02-11 编码的方法、译码的方法、编码设备和译码设备 WO2019158031A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810152255.8 2018-02-14
CN201810152255.8A CN110166167B (zh) 2018-02-14 2018-02-14 编码的方法、译码的方法、编码设备和译码设备

Publications (1)

Publication Number Publication Date
WO2019158031A1 true WO2019158031A1 (zh) 2019-08-22

Family

ID=67619672

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/074794 WO2019158031A1 (zh) 2018-02-14 2019-02-11 编码的方法、译码的方法、编码设备和译码设备

Country Status (2)

Country Link
CN (1) CN110166167B (zh)
WO (1) WO2019158031A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113541866A (zh) * 2021-06-25 2021-10-22 广州慧睿思通科技股份有限公司 确定dci长度的方法、装置、网络设备以及存储介质
CN114124148A (zh) * 2021-11-26 2022-03-01 中国人民解放军国防科技大学 一种基于极化编码的低截获扩频通信方法、装置及介质
CN115208514A (zh) * 2022-06-24 2022-10-18 中国人民解放军海军航空大学 基于对偶空间的极化码参数识别方法、装置及计算机设备
WO2024087012A1 (zh) * 2022-10-25 2024-05-02 华为技术有限公司 编译码装置及方法

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110659804B (zh) * 2019-08-26 2022-05-13 北京师范大学 S-t动态分析方法与系统及其应用
CN115955293A (zh) 2019-09-27 2023-04-11 华为技术有限公司 一种极化码分段编码的方法及通信设备
CN115913252A (zh) * 2021-09-30 2023-04-04 华为技术有限公司 编码方法、译码方法及装置
CN114915376B (zh) * 2022-04-29 2023-09-26 京信网络系统股份有限公司 译码方法、编码方法、装置、设备和存储介质
CN117134779A (zh) * 2022-05-19 2023-11-28 中兴通讯股份有限公司 数据处理方法、电子设备、存储介质及程序产品
CN117955591A (zh) * 2022-10-31 2024-04-30 华为技术有限公司 Uwb系统中ldpc码字的长度确定方法及相关装置
CN115833847B (zh) * 2023-02-15 2023-06-13 南京创芯慧联技术有限公司 Polar码译码方法、装置、通信设备和存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103746708A (zh) * 2013-10-25 2014-04-23 中国农业大学 一种Polar-LDPC级联码的构造方法
WO2017196827A1 (en) * 2016-05-11 2017-11-16 Idac Holdings, Inc. Multi-stage forward error correction with parity codes
CN107592181A (zh) * 2017-08-02 2018-01-16 华为技术有限公司 一种Polar码编码方法及装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8588623B2 (en) * 2009-10-12 2013-11-19 Nec Laboratories America, Inc. Coded polarization-multiplexed iterative polar modulation
CN105227189B (zh) * 2015-09-24 2019-01-01 电子科技大学 分段crc辅助的极化码编译码方法
CN106972865B (zh) * 2017-03-20 2020-05-08 中山大学 一种递归的分组马尔可夫叠加编码方法
CN107204780B (zh) * 2017-04-25 2020-02-07 东南大学 polar-LDPC级联码的合并BP解码算法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103746708A (zh) * 2013-10-25 2014-04-23 中国农业大学 一种Polar-LDPC级联码的构造方法
WO2017196827A1 (en) * 2016-05-11 2017-11-16 Idac Holdings, Inc. Multi-stage forward error correction with parity codes
CN107592181A (zh) * 2017-08-02 2018-01-16 华为技术有限公司 一种Polar码编码方法及装置

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113541866A (zh) * 2021-06-25 2021-10-22 广州慧睿思通科技股份有限公司 确定dci长度的方法、装置、网络设备以及存储介质
CN114124148A (zh) * 2021-11-26 2022-03-01 中国人民解放军国防科技大学 一种基于极化编码的低截获扩频通信方法、装置及介质
CN114124148B (zh) * 2021-11-26 2023-09-22 中国人民解放军国防科技大学 一种基于极化编码的低截获扩频通信方法、装置及介质
CN115208514A (zh) * 2022-06-24 2022-10-18 中国人民解放军海军航空大学 基于对偶空间的极化码参数识别方法、装置及计算机设备
CN115208514B (zh) * 2022-06-24 2023-09-05 中国人民解放军海军航空大学 基于对偶空间的极化码参数识别方法、装置及计算机设备
WO2024087012A1 (zh) * 2022-10-25 2024-05-02 华为技术有限公司 编译码装置及方法

Also Published As

Publication number Publication date
CN110166167B (zh) 2022-05-10
CN110166167A (zh) 2019-08-23

Similar Documents

Publication Publication Date Title
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2018049951A1 (zh) 信息传输的方法、发送端设备和接收端设备
TWI745579B (zh) 用於極性碼的有效率交錯器設計
JP2022174079A (ja) 符号化方法、復号方法、装置、および装置
WO2019179404A1 (zh) 通信方法、通信装置和系统
WO2017124844A1 (zh) 确定极化码传输块大小的方法和通信设备
TWI775799B (zh) 用於資訊編碼的刪餘和重複
WO2018219064A1 (zh) 一种确定校验矩阵的方法及装置、计算机存储介质
CN109391367B (zh) 通信方法和装置
US11750217B2 (en) Polar coding method and apparatus
WO2020048537A1 (zh) 级联编码的方法和装置
JP2023126812A (ja) ブロック符号化のためのレートマッチング
US11936402B2 (en) Puncturing of polar codes with complementary sequences
WO2018166455A1 (zh) 编码方法、编码装置和通信装置
US10211951B2 (en) Decoding method and apparatus
WO2019037782A1 (zh) 极化码的译码方法和译码器
US11463108B2 (en) Information processing method and communications apparatus
WO2019012457A1 (en) IMPROVED INFORMATION SEQUENCES OF POLAR CODES
US20190363826A1 (en) Data processing method and apparatus
WO2022268130A1 (zh) 一种网络编码方法及装置
WO2018184493A1 (zh) 数据编码和译码的方法和装置
WO2018161946A1 (zh) 数据处理的方法和装置
WO2019042370A1 (zh) 数据传输方法及装置
WO2018141270A1 (zh) 编码方法、通信方法及装置
WO2022171019A1 (zh) 一种编码和译码方法及相关装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19754723

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19754723

Country of ref document: EP

Kind code of ref document: A1