WO2018146552A1 - Décodage assisté par crc de codes polaires - Google Patents

Décodage assisté par crc de codes polaires Download PDF

Info

Publication number
WO2018146552A1
WO2018146552A1 PCT/IB2018/000215 IB2018000215W WO2018146552A1 WO 2018146552 A1 WO2018146552 A1 WO 2018146552A1 IB 2018000215 W IB2018000215 W IB 2018000215W WO 2018146552 A1 WO2018146552 A1 WO 2018146552A1
Authority
WO
WIPO (PCT)
Prior art keywords
check code
sequence
segment
bit
encoded
Prior art date
Application number
PCT/IB2018/000215
Other languages
English (en)
Inventor
Yu Chen
Original Assignee
Alcatel Lucent
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 Alcatel Lucent filed Critical Alcatel Lucent
Publication of WO2018146552A1 publication Critical patent/WO2018146552A1/fr

Links

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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3738—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with judging correct decoding
    • 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

  • Embodiments of the present disclosure generally relate to a communication system, and more specifically, to methods and devices for data processing at a transmitting device and a receiving device in a communication system.
  • Polar code has been proposed for an enhanced mobile broadband (eMBB) control channel.
  • the polar code is also a candidate for channel coding of a machine type communication (mMTC).
  • mMTC machine type communication
  • polar coding has advantages of low complexity and capacity achieving, for example. Therefore, for example in a fifth generation (5G) mobile communication system, the polar coding will play an important role.
  • frequently used decoding scheme includes a list-based scheme or a cyclic redundant check (CRC)-aided list scheme.
  • the complexity of the polar code may be modeled as a function of L, namely L*log 2 N, where N represents the size of an encoded unpunctured codeword and L represents the list size. It can be seen from the modeling of the complexity that the complexity of the polar code increases in proportion to the list size.
  • storage spaces consumed in the decoding may also be determined by the list size.
  • a method of data processing in a communication system comprises: dividing a plurality of information bits to be encoded into at least a first segment and a second segment; encoding the first segment with a first check code to generate a first encoded sequence; encoding the second segment with a second check code to generate a second encoded sequence; and cascading the first and second encoded sequences to form a cascaded sequence; and performing polar encoding on the cascaded sequence.
  • a first ratio between a length of the second segment and a length of the first segment is greater than or equal to 1, and a second ratio between a length of the first check code and a length of the second check code is equal to the first ratio.
  • the ratio between the length of the second segment and the length of the first segment is greater than 1, and the length of the first check code is equal to the length of the second check code.
  • cascading the first and second encoded sequences comprises: generating, by changing a bit order of the first encoded sequence, a third encoded sequence in which a check bit of the first check code are adjacent to information bits associated with the check bits of the first check code; generating, by changing a bit order of the second encoded sequence, a fourth encoded sequence in which a check bit of the second check code are adjacent to information bits associated with the check bits of the second check code; and cascading the third and fourth encoded sequences to form the cascaded sequence.
  • the check bit of at least one of the first check code and the second check code is immediately adjacent to information bit associated with the check bit of the at least one check code.
  • frozen bits are distributed between a check bit of at least one of the first check code and the second check code and the information bit associated with the check bit of the at least one check code.
  • cascading the first and second encoded sequences comprises: generating, by changing a bit order of the first encoded sequence, a third encoded sequence in which the first check code is adjacent to the information bits associated with the first check code; and cascading the third and second encoded sequences to form the cascaded sequence.
  • the check bit of the first check code are immediately adjacent to the information bits associated with the check bit of the first check code.
  • frozen bits are distributed between the check bit of the first check code and the information bits associated with the check bit of the first check code.
  • a method of data processing in a communication system comprises: performing polar decoding on received polar-encoded data to obtain output bits; obtaining a first bit sequence and a second bit sequence by bit splitting of the output bits, the first and second bit sequences being generated by encoding a first segment and a second segment of a plurality of information bits using a first check code and a second check code, respectively; obtaining the first and second segments by check decoding of the first and second bit sequences; and cascading the first and second segments to obtain the plurality of information bits.
  • a communication device comprises: a processor and a memory storing instructions, the instructions, when executed by the processor, causing the communication device to: divide a plurality of information bits to be encoded into at least a first segment and a second segment; encode the first segment with a first check code to generate a first encoded sequence; encode the second segment with a second check code to generate a second encoded sequence; and cascade the first and second encoded sequences to form a cascaded sequence; and perform polar encoding on the cascaded sequence.
  • a communication device comprises: a processor and a memory storing instructions, the instructions, when executed by the processor, causing the communication device to: perform polar decoding on received polar-encoded data to obtain output bits; obtain a first bit sequence and a second bit sequence by bit splitting of the output bits, the first and second bit sequences being generated by encoding a first segment and a second segment of a plurality of information bits using a first check code and a second check code, respectively; obtain the first and second segments by check decoding of the first and second bit sequences; and cascade the first and second segments to obtain the plurality of information bits.
  • the communication device can obtain the desired decoding performance with the lower complexity, and provide a better error detection capability in the meantime.
  • FIG. 1A illustrates a schematic diagram of an example communication system in which methods in accordance with embodiments of the present disclosure can be implemented
  • FIG. IB illustrates a simplified diagram of the processing implemented at a transmitting device and a receiving device in communications in accordance with embodiments of the present disclosure
  • FIG. 2 illustrates a flowchart of a method implemented at a communication device acting as a transmitting device in accordance with embodiments of the present disclosure
  • FIG. 3 illustrates an example of a check part of a CRC generator matrix in accordance with embodiments of the present disclosure
  • FIG. 4 illustrates an example of a transposed check part of the CRC generator matrix in accordance with embodiments of the present disclosure
  • FIG. 5 illustrates a flowchart of a method implemented at a communication device acting as a receiving device in accordance with embodiments of the present disclosure
  • FIG. 6 illustrates a block diagram of an apparatus implemented at a communication device acting as a transmitting device in accordance with embodiments of the present disclosure
  • FIG. 7 illustrates a block diagram of an apparatus implemented at a communication device acting as a receiving device in accordance with embodiments of the present disclosure
  • FIG. 8 illustrates a block diagram of a communication device in accordance with embodiments of the present disclosure
  • FIG. 9 illustrates an evaluation result of a block error rate in accordance with embodiments of the present disclosure
  • FIG. 10 illustrates a schematic diagram of percentage of early termination occurrences in accordance with embodiments of the present disclosure
  • FIG. 11 illustrates a schematic diagram of decoding saving due to the early termination in accordance with embodiments of the present disclosure
  • first and second are only used to differentiate one element from another.
  • a first element may also be called a second element, or vice versa.
  • include and “comprise” are only used to demonstrate the presence of a feature, an element, a function or a component as described herein, without excluding the presence of one or more other features, elements, functions or components.
  • LTE/LTE-A Long Term Evolution/Long Term Evolution-Advanced
  • 3GPP Long Term Evolution/Long Term Evolution-Advanced
  • 5G 5th Generation Partnership Project
  • embodiments of the present invention are not limited to wireless communication systems conforming to wireless communication protocols formulated by 3GPP, but may be applicable to any communication system with similar issues, such as WLAN, a wired communication system, or other communication systems to be developed in the future.
  • the terminal device in the present disclosure may be a user equipment (UE), or any terminal having a wired or wireless communication function, including, but not limited to, a mobile phone, a computer, a personal digital assistant, a game machine, a wearable device, an on-vehicle communication device, a Machine Type Communication (MTC) device, a Device-to-Device (D2D) communication device, a sensor and the like.
  • a terminal device can be used interchangeably with a UE, a mobile station, a subscriber station, a mobile terminal, a user terminal, or a wireless device.
  • the network device may be a network node, such as a node B (Node B or NB), a base transceiver station (BTS), a base station (BS), or a base station system (BSS), a relay, remote radio head (RRH), an access node (AN), an access point (AP), and on the like.
  • Node B or NB node B
  • BTS base transceiver station
  • BS base station
  • BSS base station system
  • RRH remote radio head
  • AN access node
  • AP access point
  • FIG. 1A is a schematic diagram of an example wireless communication system 100 in which methods in accordance with embodiments of the present disclosure can be implemented.
  • the wireless communication system 100 may include one or more network devices 101.
  • the network device 101 may be implemented by a base station, such as an evolved node B (eNodeB or eNB).
  • eNodeB evolved node B
  • the network device 101 may be implementedin other manners, such as a node B, a basic transceiver station (BTS), a base station (BS), or a base station sub-system (BSS), a relay and on the like.
  • the network device 101 provides a wireless connection to a plurality of terminal devices 111-112 within the coverage thereof.
  • the terminal devices 111 and 112 may communicate with the network device via a wireless transmission channel 131 or 132, and/or may communicate with each other via a wireless transmission channel 133.
  • FIG. IB illustrates a simplified diagram of processing implemented at a transmitting device 120 and a receiving device 130 in communications.
  • the network device 101 or the terminal devices 111 and 112 in FIG. 1A may act as the transmitting device 120 and/or the receiving device 130 shown in FIG. IB.
  • the transmitting device performs channel encoding (140) on the data to be transmitted to insert redundancy, thereby mitigating distortion probably induced in the transmission channels (for example, 131, 132, and 133 in FIG. 1A).
  • the channel-encoded data may be further channel-interleaved (not shown) and/or modulated (150) before being transmitted.
  • a process reverse to that of the transmitting device is performed. That is, the received signal is demodulated (160), de- interleaved (not shown) and decoded (170) to recover the transmitted data.
  • other or different processing may be involved at the transmitting device, and the receiving device may perform a reverse operation accordingly.
  • the polar code is used in the channel encoding processing 140 in FIG. IB.
  • N 2 n , n is a natural number
  • K [1, N] information bits can be transmitted.
  • N-K bits are redundant bits which are assigned to a fixed value (for example, 0 or any other appropriate values) and which are referred to as frozen bits.
  • the value of the frozen bits is considered to be known, and therefore the frozen bits are represented by the known value or a probability corresponding to the known value, such as a specific value of a log likelihood ratio (LLR)), in decoding.
  • LLR log likelihood ratio
  • the polar code implements channel polarization by two steps of channel combination and channel splitting. It should be note that such a channel is a coding channel, namely a channel the bits are inputted into and outputted from in the encoding, rather than the transmission channels 131-133 in FIG. 1A.
  • the coding channel for each encoded bit to pass through may also be referred to as a sub-channel. Different split sub-channels have different channel transfer probabilities. Due to the presence of a channel transfer characteristics, for the polar code, if a certain bit decoded previously is error, it may affect the decoding of the following bits, thus resulting in error spread.
  • any modulation technique known or to be developed in the future may be used, such as BPSK, QPSK, 64QAM.
  • the embodiments of the present disclosure are not limited to any specific modulating scheme. It is to be understood that in the demodulation 160 of the receiving device 130, the de-modulating schemes will be varied depending on the modulating schemes. As those skilled in the art would appreciate, the receiving device may use, alternatively or in addition, other processing than de-modulation, based on varied processing used by the transmitting device.
  • the decoding 170 as shown in FIG. IB may, for example but not limited to, use a list-based decoding approach, or an approach based on sequence cancellation (SC), or any decoding approach known or to be developed in the future.
  • SC sequence cancellation
  • One of important characteristics of the polar code is that successive decoding can be used. Therefore, if the decoding may be terminated as early as possible, the decoding complexity may be reduced.
  • the check bits are attached subsequent to all the information bits and thus. Accordingly, only when all of the information bits and check bits are decoded, a cyclic redundant check (CRC) may be performed, and hence it is impossible to achieve the early termination of the decoding.
  • CRC cyclic redundant check
  • FIG. 2 is a flowchart of a method 200 in accordance with various embodiments of the present disclosure.
  • the method 200 is implemented at a communication device acting as the transmitting device in the communication network 100.
  • the communication device may be the terminal devices 111, 112, or the network device 101 in FIG. 1A.
  • the method 200 will be described with reference to the network device 101 in FIG. 1A. It is to be understood that the method 200 may also include additional steps not shown and/or may skip over the shown steps, and the scope of the present disclosure will not be limited in this regard.
  • the network device 101 divides a plurality of information bits to be encoded into at least a first segment and a second segment.
  • the plurality of information bits to be encoded are divided into at least two segments, namely, s , 3 ⁇ 4, Ss 7 where Si represents the 1 th segment of the information bits, i £ [l, s], s is an integer greater than or equal to 2.
  • the plurality of information bits are divided into two segments, namely, the first segment and the second segment.
  • the plurality of information bits may also be divided into more than two segments, and the scope of the present disclosure will not be limited in this regard.
  • the network device 101 encodes the first segment with the first check code to generate a first encoded sequence.
  • the network device 101 encodes the second segment with the second check code to generate a second encoded sequence.
  • check code and "check bit sequence” may be used interchangeably.
  • the check code may include linear block codes, such as a cyclic redundant check (CRC) code, a BCH code, a Hamming code, or a Gray code.
  • CRC cyclic redundant check
  • BCH bitCH
  • Hamming code or a Gray code.
  • CRC cyclic redundant check
  • Gray code a code that will be taken as an example of the check code in the following depiction.
  • other types of check codes may also be applicable, such as a parity check code, the check code generated based on a Hash function and on the like. The scope of the present disclosure will not be limited in this regard.
  • a check bit sequence is used to encode the entirety of the plurality of information bits.
  • the check bit sequence is divided into a plurality of segments, accordingly.
  • the check bit sequence is also divided into s segments accordingly, namely, c ⁇ , c 2 , c s.
  • the lengths of the s segments of the check bit sequence are the same. Therefore, the same check encoder may be used to encode the s segments of the information bits, thereby simplifying the implementation.
  • the UE identifier is generally used to scramble the check bit sequence.
  • the network device 101 in order to scramble the first check code and the second check code with the UE identifier, the network device 101 also divides the UE identifier, accordingly. For example, in a case where the check bit sequence with a length of 16 bits is divided into a first check code with a length of 8 bits and a second check code with a length of 8 bits, the UE identifier with a length of 16 bits is also divided into a first portion with a length of 8 bits and a second portion with a length of 8 bits. Thereafter, the first portion of the UE identifier may be used to scramble the first check code, and the second portion of the UE identifier may be used to scramble the second check code,
  • the network device 101 cascades the first encoded sequence and the second encoded sequence to form a cascaded sequence.
  • the network device 101 performs polar encoding on the cascaded sequence.
  • the information bits to be encoded are divided into a plurality of segments, and individual segments are separately check-encoded. Subsequently, the check-encoded segments are cascaded, and then further polar-encoded.
  • the polar decoding is performed at the receiving device, upon on the decoding of the check-encoded segment, the segment may be checked with the check code in the segment.
  • the conventional approach of attaching the check bits after all the information bits since the information bits in each segment become less, and the number of check bits for each segment is reduced, errors in the segment may be earlier detected so as to terminate the decoding.
  • the network device 101 may change the bit order of at least one of the first encoded sequence and the second encoded sequence so that at least one of the first check code and the second check code is adjacent to the associated information bit in the sequence having the order-changed bits.
  • the network device 101 may generate a third encoded sequence by changing the bit order of the first encoded sequence.
  • the first check code is adjacent to the information bits associated with the first check code.
  • the network device 101 may further form the cascaded sequence by cascading the third encoded sequence and the second encoded sequence.
  • the network device 101 may generate, by changing the bit order of the first encoded sequence, the third encoded sequence in which the first check code is adjacent to the information bits associated with the first check code.
  • the network device 101 may further generate a fourth encoded sequence by changing: the bit order of the second encoded sequence.
  • the fourth encoded sequence the second check code is adjacent to the information bits associated with the second check code.
  • the network device 101 may form the cascaded sequence by cascading the third encoded sequence and the fourth encoded sequence.
  • the network device 101 may change the bit order of the first encoded sequence by changing the check part of the CRC generator matrix corresponding to the first check code. Similarly, the network device 101 may change the bit order of the second encoded sequence by changing the check part of the CRC generator matrix corresponding to the second check code.
  • the CRC code is a linear block code and the corresponding CRC generator matrix may be obtained based on the CRC generator polynomial.
  • the CRC generator matrix may have the following form:
  • G represents the CRC generator matrix.
  • the left half of the CRC generator matrix G is a unit matrix and the right half is the check part.
  • the check part of the CRC generator matrix G includes k columns, corresponding to k CRC bits respectively, where k is a natural number.
  • the network device 101 may swap the rows and/or columns of the check part of the CRC generator matrix G so that the check part of the CRC generator matrix G is changed into an upper triangular matrix as below:
  • G' represents the changed check part of the CRC generator matrix G.
  • d(i) represents the maximum of the serial number (namely, index) of the rows with the value of 1 after the row/column swapping.
  • the row/column swapping is based on minimization of the value of d(i) in sequence.
  • the CRC bits may be calculated in the following equation:
  • Ci mod( ⁇ *V> tf Jil ,2) (3) where mod represents the modular operation. [0064] Transposing of the check part of the CRC generator matrix G will be described below with reference to specific examples of FIGS. 3 and 4.
  • FIG. 3 illustrates an example of the check part 300 of the CRC generator matrix G in accordance with embodiments of the present disclosure.
  • the check part 300 contains 16 rows (namely, rows 311 to 326) and 8 columns (namely, columns 331-338).
  • the columns are first swapped, and then the rows are swapped.
  • the column with the smallest number of element 1 namely, column 336) is selected from the columns 331 to 338, and the column 336 is swapped with the first column 331.
  • the row swapping is performed for the column 336 so that all the elements 0 in the column 336 are swapped below the elements 1.
  • the similar operation is performed to other columns than the column 336. It should be noted that when the row swapping is performed for the column i, if the column i-1 contains d(i-l) elements 1, the row swapping is only performed for the row d(i) of the column i, where i>2.
  • FIG. 4 illustrates a check part 400 obtained upon the above transposing of the check part 300 in accordance with embodiments of the present disclosure.
  • the check part 400 is similar to the upper triangular matrix. It shall be noted that for the purpose of discussion on the transposing of the check part 300, before the column and row swapping of the check part 300, each row of the check part 300 is multiplied with the index of the row. For example, each row of the check part 300 is multiplied with 1, 2,..., 16.
  • the check part 400 obtained by the above transposing of the check part 300 contains 16 rows (namely, rows 411 to 426) and 8 columns (columns 431 to 438).
  • the first CRC bit cl in the CRC bit sequence is associated with 1 st , 15 th , 3 rd , 11 th , 8 th and 7 th information bits among the plurality of information bits to be encoded. Therefore, it is possible to arrange the first CRC bit cl to be immediately adjacent to any of the 1 st , 15 th , 3 rd , 11 th , 8 th and 7 th information bits.
  • the first CRC bit cl may be arranged subsequent to the 7 th information bit in the form of [l 15 3 11 8 7 cl] or the first CRC bit cl may be arranged prior to the first information bit in the form of [cl 1 15 3 11 8 7], or the first CRC information bit may be distributed between the associated information bits (for example, in the form of [l 15 cl 3 11 8 7]).
  • the first CRC bit cl may be used to check these information bits, thereby achieving the early termination of the decoding process to improve the decoding performance. Details about the early termination of the decoding process will be described in the following paragraphs.
  • a frozen bit (namely, a bit assigned to a fixed value) may be arranged between the first CRC bit cl and its associated information bits.
  • FIG. 5 is a flowchart of a method 500 in accordance with embodiments of the present disclosure.
  • the method 500 is implemented at a communication device acting as the receiving device in the communication network 100.
  • the communication device is the terminal device 111, 112 or network device 101 as shown in FIG. 1.
  • the method 500 will be described below with reference to the terminal device 111 shown in FIG. 1. It is to be understood that the method 500 may also include additional steps not shown and/or may skip over the shown steps, and the scope of the present disclosure will not be limited in this regard.
  • the terminal device 111 performs the polar decoding on the received polar encoded data to obtain the output bits.
  • output bits refer to the output bits of the polar decoder of the terminal device 111.
  • An example implementation of the decoding operation will be described in detail in the following paragraphs.
  • the terminal device 111 obtains the first bit sequence and the second bit sequence by bit splitting of the output bits. The first bit sequence and the second bit sequence are generated respectively by encoding the first segment and the second segment of the plurality of information bits using the first check code and the second check code. It is to be understood that the operations at block 520 correspond to the operations at block 240 depicted with reference to FIG. 2, and further detailed description will be omitted herein.
  • the terminal device 111 obtains the first segment and the second segment of the information bits by check decoding of the first bit sequence and the second bit sequence. It is to be understood that the operations at block 530 correspond to the operations at block 230 depicted with reference to FIG. 2, and further detailed description will be omitted herein.
  • the terminal device 111 cascades the first segment and the second segment to obtain the plurality of information bits.
  • the block 510 is implemented with a polar decoder.
  • the maximum number of remaining decoding paths for each decoding by the polar decoder such as the list size L, may be configured in advance.
  • the terminal device 111 assumes a non-frozen bit to be decoded as 0 or 1 and adds it after all the existing decoding paths, thereby forming 2*L temporary decoding paths.
  • the terminal device 111 may determine the log likelihood ratios (LLR) of the 2*L decoding paths and sort the LLRs of the 2*L decoding paths in a descending order so as to remove L decoding paths with low LLRs from the 2*L decoding paths while retaining L decoding paths with high LLRs.
  • LLR log likelihood ratios
  • a first check code may be used to check these information bits for the L remaining decoding paths. If all the checks for the L remaining decoding paths fail, the terminal device 111 then terminates the polar decoding of the information bits. If a part of or all of the path checks of the L remaining decoding paths pass, the terminal device 111 then continues to decode the next bit.
  • the terminal device 111 may use the first CRC bit cl to check the 1 st , 15 th , 3 rd , 11 th , 8 th and 7 th information bits.
  • the terminal device 111 may terminate the polar decoding at the 7 th information bit, thereby reducing iterative LLR calculation in the polar decoder, hence reducing the decoding complexity and improving decoding performance.
  • the terminal device 111 may first descramble the polar-decoded check codes and then check the associated information bits for the L remaining decoding paths. For example, in the case when the first CRC bit cl is scrambled as cl', the terminal device 111 may descramble cl' as cl and check the 1 st , 15 th , 3 rd , 11 th , 8 th and 7 th information bits with cl.
  • FIG. 6 is a block diagram of an apparatus 600 according to the some embodiments of the present disclosure.
  • the apparatus 600 may be implemented at a communication device acting as the transmitting device, for example at the terminal device 111 or 112 side or at the network device 101 as shown in FIG. 1.
  • the apparatus 600 may be a software module based system, or may be a hardware component such as a transmitter or the like.
  • the apparatus 600 may be considered as an example implementation of the transmitting device itself.
  • the apparatus 600 may include: a segmenting unit 610 configured to divide a plurality of information bits to be encoded into at least a first segment and a second segment; a first check code encoding unit 620 configured to encode the first segment with a first check code to generate a first encoded sequence; a second check code encoding unit 630 configured to encode the second segment with a second check code to generate a second encoded sequence; a cascading unit 640 configured to cascade the first encoded sequence and the second encoded sequence to form a cascaded sequence; and a polar encoding unit 650 configured to perform polar encoding on the cascaded sequence.
  • a segmenting unit 610 configured to divide a plurality of information bits to be encoded into at least a first segment and a second segment
  • a first check code encoding unit 620 configured to encode the first segment with a first check code to generate a first encoded sequence
  • a second check code encoding unit 630 configured to encode the second segment with a second
  • the first ratio between the length of the second segment and the length of the first segment is greater than or equal to 1, and the second ratio between the length of the first check code and the length of the second check code is equal to the first ratio.
  • the ratio between the length of the second segment and the length of the first segment is greater than 1, and the length of the first check code is equal to the length of the second check code.
  • apparatus 600 further includes a first bit reordering unit configured to: generate, by changing the bit order of the first encoded sequence, a third encoded sequence in which the first check code is adjacent to the information bits associated with the first check code; generate, by changing the bit order of the second encoded sequence, a fourth encoded sequence in which the second check code is adjacent to the information bits associated with the second check code.
  • the cascading unit 640 is further configured to cascade the third encoded sequence and the fourth encoded sequence to form the cascaded sequence.
  • At least one of the first check code and the second check code is immediately adjacent to the information bits associated with the at least one of the first and second check codes.
  • frozen bits are distributed between at least one of the first check code and the second check code and the information bits associated with the at least one of the first and second check codes.
  • the apparatus 600 further includes a second bit reordering unit configured to generate, by changing the bit order of the first encoded sequence, a third encoded sequence in which the first check code is adjacent to the information bits associated with the first check code.
  • the cascading unit 640 is further configured to cascade the third encoded sequence and the second encoded sequence to form the cascaded sequence.
  • the first check code is immediately adjacent to the information bits associated with the first check code.
  • frozen bits are distributed between the first check code and the information bits associated with the first check code.
  • FIG. 7 is a block diagram illustrating an apparatus 700 in accordance with certain embodiments of the present disclosure.
  • the apparatus 700 may be implemented at a communication device acting as a receiving device, for example at the terminal device 111 or 112 side or the network device 101 as shown in FIG. 1.
  • the apparatus 700 may be a system based on software modules, or may be a hardware assembly such as a receiver or the like. Particularly, in some embodiments, the apparatus 700 may be considered as an example implementation of the receiving device itself.
  • the apparatus 700 may include: a polar decoding unit 710 configured to perform polar decode on received polar encoded data to obtain output bits; a bit splitting unit 720 configured to obtain a first bit sequence and a second bit sequence by bit splitting of the the output bits, the first bit sequence and the second bit sequence being generated by encoding the first segment and the second segment of a plurality of information bits using the first check code and the second check code, respectively; a check decoder 730 configured to obtain the first segment and the second segment by check decoding of the first bit sequence and the second bit sequence; and a cascading unit 740 configured to cascade the first segment and the second segment to obtain the plurality of information bits.
  • a polar decoding unit 710 configured to perform polar decode on received polar encoded data to obtain output bits
  • a bit splitting unit 720 configured to obtain a first bit sequence and a second bit sequence by bit splitting of the the output bits, the first bit sequence and the second bit sequence being generated by encoding the first segment and the second segment of
  • the first ratio between the length of the second segment and the length of the first segment is greater than or equal to 1 ; and the second ratio between the length of the first check code and the length of the second check code is equal to the first ratio.
  • the ratio between the length of the second segment and the length of the first segment is greater than 1 ; and the length of the first check code is equal to the length of the second check code.
  • the first check code is adjacent to the first information bits associated with the first check code in the first bit sequence
  • the second check code is adjacent to the second information bits associated with the second check code in the second bit sequence.
  • the apparatus 700 further includes an inverse bit reordering unit configured to: obtain a third bit sequence by changing the bit order of the first bit sequence, the first check code being located at an end portion of the third bit sequence; obtain a fourth bit sequence by changing the bit order of the second bit sequence, the second check code being located at an end portion of the fourth bit sequence; and where the bit splitting unit 720 is further configured to: extract other bits than the first check code from the third bit sequence to obtain the first segment; and extract other bits than the second check code from the fourth bit sequence to obtain the second segment.
  • the polar decoding unit 710 includes a path adjusting unit configured to: determine log likelihood ratios (LLR) of a first number of decoding paths; sort the LLRs in a descending order; and removing a second number of decoding paths with low LLRs from the first number of decoding paths, the first number being twice the second number.
  • the polar decoding unit 710 includes a check unit configured to: in response to the first check code and the first information bits associated with the first check code being decoded, check the first information bit for the remaining decoding paths using the first check code; and in response to failures of all the checks of the remaining decoding paths, terminate the polar decoding.
  • each feature as depicted with reference to FIGS. 1-4 is likewise applicable to the apparatus 600; and each feature as depicted with reference to FIG. 5 is likewise applicable to the apparatus 700.
  • each unit of the apparatus 600 and/or 700 may be a hardware module, or may be a software module.
  • the apparatus 700 may be partially or entirely implemented using software and/or firmware, for example implemented as a computer program product included on a computer readable medium.
  • FIG. 8 is a block diagram of a communication device 800 suitable for implementing embodiments of the present disclosure.
  • the device 800 may be used to implement the transmitting device or the receiving device in the embodiments of the present disclosure, for example the network device 101 or terminal device as shown in FIG. 1, or the first terminal device 111 or 112 as shown in FIG. 1.
  • the device 800 includes a processor 810.
  • the processor 810 controls operations and functionality of the device 800.
  • the processor 810 may perform various operations by means of instructions 830 stored in a memory 820 coupled thereto.
  • the memory 820 may be of any appropriate type applicable to a local technical environment, and may be implemented using any appropriate data storage technique, including but not limited to, a semiconductor-based storage device, a magnetic storage device and system, an optical storage device and system.
  • FIG. 8 only shows one memory unit, the device 800 may include a plurality of physically different memory units.
  • the processor 810 may be of any appropriate type applicable to a local technical environment, and may include, but not limited to, one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and controllers based on multicore controller architecture.
  • the device 800 may further include a plurality of processors 810.
  • the processor 810 may be coupled to a transceiver 840 which may implement transmitting and receiving of information with aid of one or more antennae 850 and/or other components.
  • the processor 810 and the memory 820 may be operated in cooperation, to implement the methods 200, 400, and/or 500 as described with reference to FIGS. 2-5. Specifically, if the communication device 800 acts as a transmitting device, the communication device 800 may be caused to perform the method 200 when the instructions 830 in the memory 820 are executed by the processor 810. If the communication device 800 acts as a receiving device, the communication device 800 may be caused to perform the method 400 and/or 500 when the instructions 830 in the memory 820 are executed by the processor 810. It is to be understood that all features as described above are all applicable to the device 800, which are omitted herein.
  • FIG. 9 illustrates an example of the evaluation result of the block error rate (BLER) in accordance with embodiments of the present disclosure.
  • the method in accordance with embodiments of the present disclosure is evaluated with the polar codes (128, 64) and (256, 128), where for the polar code (128, 64), the CRC bits are 16 bits, and the information bits are 48 bits; while for the polar code (256, 128), the CRC bits are 16 bits and the information bits are 112 bits.
  • the CRC generator polynomial [1 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1] is used, which is the same as LTE CRC 16 .
  • the CRC bits are transmitted immediately following the associated information bits and the new information bits.
  • the evaluation result in FIG. 9 shows that on average, the polar decoder can terminate the decoding at the 32 nd information bit (namely, at a half of all the information bits).
  • the total number of bits to be decoded by the polar decoder is 64 because both the information bits and the CRC bits should be decoded.
  • the method in accordance with the embodiments of the present disclosure does not affect the BLER performance because this method only changes the transmission order of the information bits and the CRC bits.
  • both the existing schemes and the embodiments of the present disclosure consider the information block to be erroneous, and therefore, the BLER would be the same.
  • FIG. 10 illustrates a schematic diagram of percentage of early termination occurrences in accordance with embodiments of the present disclosure. As can be seen from FIG. 10, in the two cases of employing different block sizes, early termination occurs in about 20% of the decoding, which is independent of the block size.
  • FIG. 11 is a schematic diagram of decoding saving due to the early termination in accordance with embodiments of the present disclosure.
  • the decoding saving due to early termination is calculated with a ratio between the total number of undecoded bits and the total number of bits to be decoded. For example, if 64 bits are to be decoded, then on average, the early termination occurs at the 32 nd bit, thereby saving 50% of the decoding. As can be seen from FIG. 11, the smaller the block size is, the more benefits will be obtained from the early termination. Furthermore, for downlink control signaling, the control information is about tens of to hundreds of bits. The evaluation result covers 48 to 112 information bits, thus being very convincing.
  • various embodiments of the present disclosure may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. Some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, a microprocessor or another computing device. While various aspects of embodiments of the present disclosure are illustrated and described as block diagrams, flowcharts, or using some other pictorial representation, it will be appreciated that the blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
  • the embodiments of the present disclosure may be described in the context of the machine executable instruction which for example includes program modules executed in the device on a real or virtual processor.
  • program modules include routines, programs, libraries, objects, classes, components, data structures, or the like that perform particular tasks or implement particular abstract data types.
  • the functionality of the program modules may be combined or split between program modules as desired in various embodiments.
  • Machine-executable instructions for program modules may be executed within a local or distributed device. In a distributed device, program modules may be located in both local and remote storage media.
  • Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by a computer or other programmable data processing devices, cause the functions/operations specified in the flowcharts and/or block diagrams to be implemented.
  • the program code may execute entirely on a machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
  • the machine readable medium may be any tangible medium that may contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
  • the machine readable medium may be a machine readable signal medium or a machine readable storage medium.
  • a machine readable medium may include but not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing.
  • machine readable storage medium More specific examples of the machine readable storage medium would include an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
  • RAM random access memory
  • ROM read-only memory
  • EPROM or Flash memory erasable programmable read-only memory
  • CD-ROM portable compact disc read-only memory
  • magnetic storage device or any suitable combination of the foregoing.

Abstract

Des modes de réalisation de la présente invention concerne des procédés et dispositifs de traitement de données dans un système de communication. Le procédé décrit ici consiste à diviser une pluralité de bits d'informations devant être codés en au moins un premier segment et un second segment (210). Le procédé consiste en outre à coder le premier segment à l'aide d'un premier code de vérification pour générer une première séquence codée (220); et à coder le second segment à l'aide d'un second code de vérification pour générer une seconde séquence codée (230). Le procédé consiste encore à mettre en cascade les première et seconde séquences codées pour former une séquence en cascade (240). Le procédé consiste de surcroît à exécuter un codage polaire sur la séquence en cascade (250). Au niveau de l'extrémité de réception, les codes de vérification peuvent être utilisés pour permettre un achèvement précoce dans le décodage de liste du code polaire.
PCT/IB2018/000215 2017-02-13 2018-02-09 Décodage assisté par crc de codes polaires WO2018146552A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710076779.9 2017-02-13
CN201710076779.9A CN108429599B (zh) 2017-02-13 2017-02-13 用于通信系统中的数据处理的方法和设备

Publications (1)

Publication Number Publication Date
WO2018146552A1 true WO2018146552A1 (fr) 2018-08-16

Family

ID=61683839

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2018/000215 WO2018146552A1 (fr) 2017-02-13 2018-02-09 Décodage assisté par crc de codes polaires

Country Status (2)

Country Link
CN (1) CN108429599B (fr)
WO (1) WO2018146552A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112583522A (zh) * 2019-09-27 2021-03-30 华为技术有限公司 一种极化码分段编码的方法及通信设备
CN112994838A (zh) * 2019-12-16 2021-06-18 中国电信股份有限公司 信道编码及译码方法和装置、信息传输系统

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112118074B (zh) * 2019-06-21 2021-12-03 华为技术有限公司 一种通信方法及装置
CN112241334B (zh) * 2020-10-30 2023-06-20 深圳供电局有限公司 一种电力数据传输的完整性校验方法
CN112558569B (zh) * 2020-12-08 2022-03-15 浙江国利网安科技有限公司 数据处理方法、装置、电子设备及存储介质
CN114996194B (zh) * 2022-06-10 2024-03-01 中国电信股份有限公司 并行总线中继方法、系统、装置、存储介质及电子设备

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108712231B (zh) * 2012-10-17 2019-04-19 华为技术有限公司 一种编译码的方法、装置及系统
KR102007770B1 (ko) * 2012-12-14 2019-08-06 삼성전자주식회사 패킷의 부호화 방법과 그 복호화 장치 및 방법
CN104124979B (zh) * 2013-04-27 2018-04-17 华为技术有限公司 极性码的译码方法和译码装置
CN105207682B (zh) * 2015-09-22 2018-07-17 西安电子科技大学 基于动态校验矩阵的极化码置信传播译码方法
CN105227189B (zh) * 2015-09-24 2019-01-01 电子科技大学 分段crc辅助的极化码编译码方法
CN105337696B (zh) * 2015-10-08 2018-03-30 东南大学 基于分段crc校验的极化解码方法
CN105262494A (zh) * 2015-10-13 2016-01-20 东南大学 一种具有迭代早停止机制的极化码bp译码方法
CN106059712B (zh) * 2016-06-28 2020-02-14 西安电子科技大学 一种高误码的任意码率卷积码编码参数盲识别方法
CN106230555B (zh) * 2016-07-29 2019-02-19 西安电子科技大学 极化码的分段循环冗余校验方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
GUO JIANFENG ET AL: "Multi-CRC Polar Codes and Their Applications", IEEE COMMUNICATIONS LETTERS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 20, no. 2, 1 February 2016 (2016-02-01), pages 212 - 215, XP011598246, ISSN: 1089-7798, [retrieved on 20160208], DOI: 10.1109/LCOMM.2015.2508022 *
MAO-CHING CHIU ET AL: "Reduced-Complexity SCL Decoding of Multi-CRC-Aided Polar Codes", 28 September 2016 (2016-09-28), pages 1 - 9, XP055384603, Retrieved from the Internet <URL:https://arxiv.org/pdf/1609.08813.pdf> [retrieved on 20170623] *
ZHOU HUAYI ET AL: "Segmented CRC-Aided SC List Polar Decoding", PROC. 2016 IEEE 83RD VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), IEEE, 15 May 2016 (2016-05-15), pages 1 - 5, XP032918751, DOI: 10.1109/VTCSPRING.2016.7504469 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112583522A (zh) * 2019-09-27 2021-03-30 华为技术有限公司 一种极化码分段编码的方法及通信设备
CN112583522B (zh) * 2019-09-27 2022-09-23 华为技术有限公司 一种极化码分段编码的方法及通信设备
US11888614B2 (en) 2019-09-27 2024-01-30 Huawei Technologies Co., Ltd. Polar code segment encoding method and communication device
CN112994838A (zh) * 2019-12-16 2021-06-18 中国电信股份有限公司 信道编码及译码方法和装置、信息传输系统
CN112994838B (zh) * 2019-12-16 2022-05-24 中国电信股份有限公司 信道编码及译码方法和装置、信息传输系统

Also Published As

Publication number Publication date
CN108429599B (zh) 2022-03-01
CN108429599A (zh) 2018-08-21

Similar Documents

Publication Publication Date Title
WO2018146552A1 (fr) Décodage assisté par crc de codes polaires
CN108702290B (zh) 级联极化编码和滑动窗口极化编码
US11171741B2 (en) Polar code transmission method and apparatus
US10749633B2 (en) Generation of polar codes with a variable block length utilizing
US10567994B2 (en) Method and device for transmitting data
US11296723B2 (en) Methods and apparatuses for data processing in communication system
CN108365848B (zh) 一种极性码的译码方法和装置
CN108462554B (zh) 一种极性码的传输方法和装置
CN108023672B (zh) 用于通信系统中的数据处理的方法和装置
US11258463B2 (en) Polar code transmission method and apparatus
WO2017121334A1 (fr) Procédé et dispositif de traitement de données
EP3748882A1 (fr) Procédé et dispositif de codage de code polaire
CN110663189B (zh) 用于极化编码的方法和装置
WO2018137518A1 (fr) Procédé et appareil de transmission de données
US20210409039A1 (en) Data processing method and device
WO2019024594A1 (fr) Procédés, appareils et dispositifs permettant de coder et décoder un code de polarisation
CN110476357B (zh) 极化码传输方法和装置
CN108282249B (zh) 一种控制信息的传输方法和装置
CN114079530A (zh) 编码方法及装置
EP4131785A1 (fr) Procédés et appareils de codage et de décodage et dispositif
US20210314087A1 (en) Channel encoding method and apparatus in wireless communications
CN109586842B (zh) Pdcch的配置方法及装置、译码方法及装置、介质、设备
CN108429600B (zh) 用于通信系统中的数据处理的方法和设备
US10999009B2 (en) Channel encoding method and apparatus in wireless communications
KR102662470B1 (ko) 조기 종료를 위해 극성 코드에서 분산 crc를 인터리빙하는 시스템 및 방법

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: 18711683

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: 18711683

Country of ref document: EP

Kind code of ref document: A1