[go: up one dir, main page]

WO2018143489A1 - Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur - Google Patents

Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur Download PDF

Info

Publication number
WO2018143489A1
WO2018143489A1 PCT/KR2017/001074 KR2017001074W WO2018143489A1 WO 2018143489 A1 WO2018143489 A1 WO 2018143489A1 KR 2017001074 W KR2017001074 W KR 2017001074W WO 2018143489 A1 WO2018143489 A1 WO 2018143489A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
input signal
encoder
delayer
signal
Prior art date
Application number
PCT/KR2017/001074
Other languages
English (en)
Korean (ko)
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 엘지전자 주식회사
Priority to PCT/KR2017/001074 priority Critical patent/WO2018143489A1/fr
Publication of WO2018143489A1 publication Critical patent/WO2018143489A1/fr

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/25Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]

Definitions

  • the present invention relates to a channel coding method in a wireless communication system, and more particularly, to a turbo code encoder and an encoding method having an improved error correction efficiency.
  • Wireless access systems are widely deployed to provide various kinds of communication services such as voice and data.
  • a wireless access system is a multiple access system capable of supporting communication with multiple users by sharing available system resources (bandwidth, transmission power, etc.).
  • multiple access systems include code division multiple access (CDMA) systems, frequency division multiple access (FDMA) systems, time division multiple access (TDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, and single carrier frequency (SC-FDMA). division multiple access) system.
  • CDMA code division multiple access
  • FDMA frequency division multiple access
  • TDMA time division multiple access
  • OFDMA orthogonal frequency division multiple access
  • SC-FDMA single carrier frequency division multiple access
  • channel codes are essentially used in broadcast systems.
  • a transmitter may perform encoding on an input symbol by using an encoder and transmit an encoded symbol.
  • the receiving end may restore the input symbol by receiving the encoded symbol and performing decoding on the received symbol.
  • the size of the input symbol and the size of the encoded symbol may be defined differently according to the communication system.
  • LTE Long Term Evolution
  • 3GPP 3rd Generation Partnership Project
  • an input symbol has a maximum size of 6144 bits and a coded symbol size 18432 (6144 * 3) bits.
  • Turbo coding in an LTE communication system may be referred to by 3GPP Technical Specification 36.212.
  • the LTE turbo code has a slight improvement in performance even if the signal to noise ratio (SNR) increases due to the structure of the code.
  • SNR signal to noise ratio
  • it may be considered to use a code having a lower error rate, but in this case, there is a problem that the complexity increases.
  • the current LTE turbo code has a problem that an error floor occurs when the size of information increases. Accordingly, there is a need for a channel coding method capable of satisfying Ultra Reliable Radio (URR) and Low Latency Radio (LLR).
  • URR Ultra Reliable Radio
  • LLR Low Latency Radio
  • the present invention has been made to solve the above problems, and an object of the present invention is to provide a method for generating a turbo code having a tail duty structure while having backward compatibility with a conventional LTE turbo code. To provide.
  • Another object of the present invention is to provide an apparatus supporting these methods.
  • the turbo code encoding method of the present application for solving the above problems comprises the steps of pre-coding the input signal; Determining an end state based on the precoding; Determining a preset cyclic state based on the determined end state and the length of the input signal; And encoding the input signal into a turbo code having a tail-biting structure based on the determined cyclic state, wherein the encoder includes a forward path from an input terminal to an output terminal and the output terminal.
  • the input terminal of the recursive path may be applied with a value obtained by XORing the input signal, the input signal delayed three times, and the input signal delayed four times.
  • a turbo code encoder for solving the above-described problems may include: a first node, a second node, and a third configured to output an exclusive OR (XOR) of the received signal values, respectively; A node, a fourth node, a fifth node, a sixth node, a seventh node, and an eighth node; A first delayer, a second delayer, a third delayer, and a fourth delayer, each of which is configured to delay and output the received signal once, and is sequentially connected between the first node and the fifth node.
  • XOR exclusive OR
  • a first switching circuit connected between the fourth node and the fifth node; And a second switching circuit connected between the seventh node and the eighth node, wherein the first node receives an input signal and a signal from the eighth node, and supplies the second node and the first delay unit to the second node and the first delay node.
  • Output a signal wherein the second node is configured to receive signals from the first delayer and the first node, and output a signal to the third node, wherein the third node is configured to output the signal to the second node.
  • the sixth node is configured to receive signals from the second delayer and the third delayer and to output a signal to the eighth node, wherein the seventh node is configured to output the signal to the eighth node.
  • the encoder of the present invention may have backward compatibility with a conventional LTE turbo encoder.
  • the encoder of the present invention may perform turbo code encoding having a tail biting structure.
  • the encoder of the present invention may perform turbo code encoding, which may satisfy the URLLC environment.
  • FIG. 1 illustrates an encoding process according to an example.
  • FIG. 2 illustrates an encoding process of a transport block according to an example.
  • FIG 3 illustrates a Recursive Systematic Convolutional (RSC) encoder according to an example.
  • FIG 5 shows an example of a trellis according to an RSC encoder.
  • FIG. 6 shows an example of a trellis structure.
  • FIG. 7 is a block diagram of a turbo code encoder according to an embodiment.
  • FIG. 8 is a flowchart of an encoding method according to an embodiment.
  • FIG. 9 is a configuration diagram of a base station and a terminal according to an embodiment of the present invention.
  • CDMA code division multiple access
  • FDMA frequency division multiple access
  • TDMA time division multiple access
  • OFDMA orthogonal frequency division multiple access
  • SC-FDMA single carrier frequency division multiple access
  • CDMA may be implemented with a radio technology such as Universal Terrestrial Radio Access (UTRA) or CDMA2000.
  • TDMA may be implemented with wireless technologies such as Global System for Mobile communications (GSM) / General Packet Radio Service (GPRS) / Enhanced Data Rates for GSM Evolution (EDGE).
  • GSM Global System for Mobile communications
  • GPRS General Packet Radio Service
  • EDGE Enhanced Data Rates for GSM Evolution
  • OFDMA may be implemented in a wireless technology such as IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802-20, Evolved UTRA (E-UTRA), or the like.
  • UTRA is part of the Universal Mobile Telecommunications System (UMTS).
  • 3rd Generation Partnership Project (3GPP) long term evolution (LTE) employs OFDMA in downlink and SC-FDMA in uplink as part of Evolved UMTS (E-UMTS) using E-UTRA.
  • LTE-A Advanced is an evolution of 3GPP LTE.
  • FIG. 1 illustrates an encoding process according to an example.
  • the encoding process of FIG. 1 may be applied to many channel codes including a turbo code used in an LTE communication system.
  • a turbo code used in an LTE communication system.
  • the encoding process will be described based on terms according to standard documents of the LTE communication system.
  • the transmitting end may generate a transport block (TB) (S101).
  • the transmitting end adds a CRC bit for the transport block to the transport block (S102).
  • the transmitter may generate a code block from the transport block to which the CRC bit is added (S103).
  • the transmitting end may segment the transport block into code blocks based on the input size of the encoder.
  • the transmitter may add a CRC bit to each divided code block (S104). In this case, for example, the size of the code block and the code block CRC bits may consist of 6144 bits.
  • the transmitter may perform encoding and modulation (S105) on each block composed of a code block and CRC bits. For example, as described above, turbo coding may be applied.
  • the decoding process may be performed in the reverse order of the encoding process of FIG. 1.
  • the receiver may decode each code block by using a decoder corresponding to each encoder, and finally configure one transport block to check whether the CRC passes through the transport block.
  • the size of the input symbol may be different from the size of a transport block (TB) from the Media Access Control (MAC) layer. If the size of the transport block is larger than the maximum input symbol size of the turbo code, the transport block may be divided into a plurality of code blocks (CBs). According to the standard of the LTE communication system, the size of the code block may be the same as subtracting the Cyclic Redundancy Check (CRC) bit from 6144 bits.
  • An input symbol of a turbo code may be defined as data comprising a code block and a CRC or data including a transport block (eg, a transport block is less than 6144 bits) and a CRC. The CRC bit is a very small value (e.g.
  • a code block may refer to a code block itself or a CRC bit corresponding to a code block
  • a transport block refers to a transport block itself or a CRC bit corresponding to a transport block. can do.
  • FIG. 2 illustrates an encoding process of a transport block according to an example.
  • FIG. 2 illustrates an encoding process of the transport block 201 corresponding to the encoding process described above with reference to FIG. 1.
  • a transport block CRC 202 is added to the transport block 201.
  • the transport block CRC 202 may be used for identification of the transport block 201 in the decoding process.
  • the transport block 201 and transport block CRC 202 are then divided into three code blocks 203.
  • the code block 203 is divided into three code blocks, but the transport block 201 may be divided into a plurality of code blocks based on an input size of the encoder 205.
  • Code block CRC 204 is added to each code block 203.
  • the code block CRC 204 may be used for identification of the code block 203 at the receiving end.
  • Code block 203 and code block CRC 204 may be encoded via encoder 205 and modulator 206.
  • FIG 3 illustrates a Recursive Systematic Convolutional (RSC) encoder according to an example.
  • the RSC encoder 300 of FIG. 3 may be used for turbo coding.
  • m denotes input data
  • C1 denotes a systematic bit string
  • C2 denotes a coded bit string.
  • the RSC encoder 300 has a 1/2 code rate.
  • RSC encoder 300 may be configured by feeding back the encoded output to the input of a nonrecursive-non-systematic convoluational encoder.
  • the encoder 300 includes two delayers 301 and 302.
  • the values D of the delayers 301 and 302 may be determined according to a coding scheme.
  • Delays 301 and 302 may be configured as memory or shift registers.
  • the coding scheme of the LTE turbo encoder 400 is a parallel concatenation with two eight-state element encoders 410 and 420 and one turbo code internal interleaver 430.
  • Parallel Concatenated Convolutional Code (PCCC) is a parallel concatenation with two eight-state element encoders 410 and 420 and one turbo code internal interleaver 430.
  • Parallel Concatenated Convolutional Code (PCCC) is a parallel concatenation with two eight-state element encoders 410 and 420 and one turbo code internal interleaver 430.
  • PCCC Parallel Concatenated Convolutional Code
  • the turbo encoder 400 is composed of a first constituent encoder 410, a second element encoder 420, and a turbo code internal interleaver 430.
  • the first element encoder 410 and the second element encoder 420 are eight-state element encoders.
  • Each of the first element encoder 410 and the second element encoder 420 has a structure similar to that of the RSC encoder of FIG. 3.
  • the first element encoder 410 and the second element encoder 420 each include three delayers 411, 412, 413, 421, 422, and 423.
  • D is a value determined according to a coding scheme.
  • c k is the input to the turbo encoder 400.
  • the outputs from the first element encoder 410 and the second element encoder 420 are denoted as z k and z ' k , respectively.
  • the value output from the turbo code internal interleaver 430 is denoted by c ' k .
  • the delays 411, 412, 413, 421, 42, and 423 may delay the input value by one clock.
  • the delays 411, 412, 413, 421, 42, 423 may be configured to delay the input value for more than one clock according to the internal setting.
  • the delays 411, 412, 413, 421, 42, and 423 may be configured as shift registers, and may be configured to delay the input bits by a predetermined clock and then output the input bits to the next delays 411, 412, 413, 421, 42, 423. .
  • the turbo code internal interleaver 430 may reduce the effects of burst errors that may occur when transmitting signals over a wireless channel.
  • the turbo code internal interleaver 430 may be a Quadratic Polynomial Permutation (QPP) interleaver.
  • QPP Quadratic Polynomial Permutation
  • Turbo codes are high performance forward error correction (FEC) codes and are used in LTE communication systems.
  • a data block coded by turbo code may consist of three subblocks.
  • One subblock may correspond to m-bit payload data.
  • Another subblock may consist of n / 2 bits of parity bits for the payload, calculated using a recursive systematic convolution (RSC) code.
  • the remaining sub-blocks may be composed of n / 2 bits of parity bits for permutation of payload data, calculated using an RSC code.
  • the above-described permutation may be performed by an interleaver.
  • two subblocks of parity bits different from each other with the payload may be configured as one block. For example, if m is equal to n / 2, one block has a code rate of 1/3.
  • a process of reaching the input bit z k by the input c k may be divided into two paths.
  • the two paths are a first path connected without input feedback from the input to the output and a second path fed back from the input to the input.
  • c k is input, input via a delay unit 411, a rough input c k, and the retarder (411, 412, and 413), c k is applied to the output stage.
  • the relationship between the input end and the output end of the first path may be expressed by a polynomial.
  • the polynomial for the first path is called a forward generator polynomial and may be expressed as g1 of the following equation.
  • a rough input c k is fed back to the input end.
  • the polynomial for the second path is called a recursive generator polynomial and can be expressed as g0 in the following equation.
  • Equations 1 and 2 "+” means exclusive OR (XOR), and 1 means that the input goes through 0 delays.
  • D n means that the input goes through n delays.
  • FIG 5 shows an example of a trellis according to an RSC encoder.
  • FIG. 5 shows the configuration of the trellis of the RSC encoder shown in FIG.
  • S i represents a state of the i th input data.
  • each circle represents each node.
  • the line between each node means a branch.
  • the solid line refers to the branch for input value 1
  • the dotted line refers to the branch for input value 0.
  • the value on the branch is expressed as m / C1C2 (input value / systematic bit, coded bit). It may also have a state that is exponentially proportional to the number of memories of the encoder. For example, if the encoder includes a memory, 2 a states can be included in the trellis.
  • Trellis is a state machine that shows the possible state transitions of an encoder between two states.
  • a convolutional encoder such as an RSC encoder, may perform encoding according to a trellis diagram. Codewords encoded by the RSC encoder may be decoded according to an algorithm based on the trellis structure. For example, Viterbi or BCJR (Bahl, Cocke, Jelinek and Raviv) algorithms can be used.
  • FIG. 6 shows an example of a trellis structure.
  • n represents the length of a codeword.
  • trellis can be terminated by adding additional bits after the input sequence.
  • a sequence consisting of a sequence of zeros is called a tail bit. The tail bit terminates the trellis so that nodes in one state of the trellis have a value of zero.
  • the length of a codeword may be determined in consideration of the length k of input data and the length t of tail bits.
  • the length n of the codeword may have a value of (k + t) / R.
  • the length t of the tail bits can be determined as the length by which all delays (eg, memories) of the encoder can be reset.
  • the RSC encoder of FIG. 3 may use a total of 2 bits of tail bits.
  • the turbo encoder of the LTE communication as shown in FIG. 4 may use 3 bits of tail bits.
  • the tail bit has a relatively short length compared to the length of the input data.
  • code rate loss due to the tail bits may occur when the length of the codeword is limited.
  • trellis termination using tail bits is widely used. This is because the computational complexity is low and the error correction performance is excellent.
  • a puncturing code is a method of puncturing some of codewords.
  • some codewords are not transmitted because some of the codewords are punctured.
  • puncturing codes may be used to reduce code rate loss due to the addition of tail bits.
  • the receiving end may decode by using the trellis corresponding to the sum of the length k of the input data and the length t of the tail bit. That is, the receiver may perform decoding on the assumption that it has received a non-punctured codeword. In this case, the receiving end may assume that there is no input value for the branch from the node corresponding to the punctured bit (ie, the bit not transmitted at the transmitting end). That is, input data is assumed to be 0 or 1 with equal probability for branches of the node.
  • double binary turbo codes have a tail biting structure.
  • the tail biting structure is a method of terminating trellis by making the initial state and the end state of the encoder the same. That is, the trellis is terminated by forming a circulation state in which the start state and the end state are the same, and no tail bit is required.
  • dual binary LTE turbo code requires pre-encoding to determine the recursive state. Therefore, a decrease in the encoding speed may occur due to the addition of the encoding process.
  • precoding can be performed in two steps. First, encoding is performed by setting the initial state to '0', and thereafter, the starting state and the last state are set to be the same according to a predetermined relationship based on the encoded last state.
  • Turbo code can provide error correction performance that is close to Shannon's theoretical limit while having a relatively simple structure. However, if the specific SNR is exceeded, further improvement of the decoding performance is insignificant. That is, the turbo code has an error-floor in which further error rate improvement is insignificant when a certain SNR is exceeded.
  • two methods can be considered. For example, it may be considered to use code that does not generate an error-floor compared to current turbo code. Also, for example, concatenate code may be used by adding overhead to the current turbo code.
  • Reliable communication refers to a new communication service realized through Error Free Transmission or Service Availability for realizing a mission critical service (MCS). Reliability communications may be required in communications with Real-Time requirements, such as Machine-to-Machine (M2M) communications. In addition, with respect to medical reasons or emergencies, reliable communication may be required.
  • MCS mission critical service
  • M2M Machine-to-Machine
  • Ultra Reliable and Low-Latency Communication URLLC
  • an error floor is required to occur at a Block Error Rate (BLER) of 10-5 or less.
  • BLER Block Error Rate
  • the error floor refers to a point where the error rate decreases in spite of an increase in information size.
  • the LTE turbo code consists of three memories (delays).
  • the LTE turbo code is configured to have an error floor at the lowest BLER of polynomials that may consist of three memories. Therefore, the error floor cannot be improved without structural changes of the encoder of the LTE turbo code.
  • FIG. 7 is a block diagram of a turbo code encoder according to an embodiment.
  • the encoder 700 includes a first delayer 711, a second delayer 712, a third delayer 713, and a fourth delayer 714. That is, the encoder 700 may include four memories or shift registers and perform turbo code encoding.
  • the first through eighth nodes 721, 722, 723, 724, 725, 726, 727, and 728 are configured to perform an exclusive-OR (XOR). Inputs and outputs to the nodes 721, 722, 723, 724, 725, 726, 727, and 728 are set in accordance with the direction of the arrow.
  • the fourth node 724 and the eighth node 728 includes a switch.
  • block 750 is completely isolated from the encoder 700. Except for block 750, the encoder 700 is configured to perform the same operations as the encoder of FIG. 3. That is, the encoder 700 of FIG. 7 has a form in which a block 750 including additional memory is added to the RSC encoder used in the LTE turbo encoder. Therefore, for backward compatibility with the conventional LTE turbo encoder, the switch connection of the fourth node 724 and the eighth node 728 may be changed. Operation of the LTE turbo encoder is as described above with reference to FIGS. 4 and 5.
  • the encoder 700 of FIG. 7 includes a first delayer 711, a second delayer 712, and a third delayer 713 sequentially connected between the first node 721 and the fifth node 725. And a fourth retarder 714.
  • the first node 721 receives the input signal and the signal from the eighth node 728, and outputs a signal to the second node 722 and the first delayer 711.
  • the second node 722 receives the signals from the first delayer 711 and the first node 721, and outputs a signal to the third node 723.
  • the third node 723 receives the signals from the second node 722 and the third delayer 713 and outputs the signals to the fourth node 724.
  • the fourth node 724 receives a signal from the third node 723, receives a signal from the fifth node 725 through the first switching circuit, and outputs an output signal.
  • the fifth node receives the signals from the third delayer 713 and the fourth delayer 714 and outputs the signals to the fourth node 724 via the first switching cycle.
  • the sixth node 726 receives the signals from the second delayer 712 and the third delayer 713 and outputs the signals to the eighth node 728.
  • the seventh node receives signals from the second delayer 712 and the fourth delayer 714, and outputs a signal to the eighth node 728 through the second switching circuit.
  • the eighth node 728 receives a signal from the sixth node 726, receives a signal from the seventh node 727 through the second switching circuit, and outputs a signal to the first node 721. .
  • Each of the nodes 721, 722, 723, 724, 725, 726, 727, and 728 is configured to perform an XOR operation on the input signal and output the same.
  • the first and second switching circuits are configured to selectively disconnect the connection. For example, when the first and second switching circuits are turned off, the fourth node 724 cannot receive the signal from the fifth node 725 and the eighth node 728. Cannot receive a signal from the seventh node 7270.
  • Figure 7 recursively (recursive) primitive polynomial (primitive polynomial) g new0 for the path is equal to the mathematical expression.
  • a recursive path is formed by a path of signals applied to the first node 721.
  • the output terminal is supplied with an XOR operation value of the input, the input delayed three times, and the input delayed four times.
  • the primitive polynomial g new1 for the forward (forward) path is equal to the mathematical expression.
  • the forward path is formed by the path of signals applied to the fourth node 724.
  • the encoder 700 in the recursive path from the output end of the encoder 700 to the input end, an XOR operation value of an input, one delayed input, and four delayed inputs is applied to the input terminal. Meanwhile, in FIG. 7, the encoder 700 includes two switching circuits, but two switching circuits may be implemented as one switching circuit.
  • Equations 3 and 4 “+” means exclusive OR (XOR), and 1 means that the input goes through 0 delays. In addition, D n means that the input goes through n delays.
  • the recursive generator polynomial of the encoder 700 of Equation 3 may be converted into a full rank transfer function.
  • a tail biting technique may be applied to the encoder 700.
  • the encoder 700 of FIG. 7 includes four memories (delays 711, 712, 713, and 714). Thus, the encoder 700 has 24 states. As described above, in order to apply the tail biting technique, a pre-coding step may be used.
  • the length of the information bit is assumed to be K.
  • pre-encoding is performed using a K bit sequence.
  • the state may be set with reference to Tables 1 and 2 below.
  • the value of the intersection of the row corresponding to the end state and the column corresponding to the value of K mod 15 indicates the same state as the start and end states.
  • an initial value for precoding may be set to '0'.
  • K is 100
  • K mod 15 is 10.
  • the end state of precoding may be assumed to be 8.
  • a state in which the start state and the end state are the same that is, the cyclic state
  • encoding may be performed based on the determined cyclic state.
  • the coded code has a tail biting structure.
  • Tables 1 and 2 described above do not include the case where the value of K mod 15 is zero.
  • turbo code encoding having a tail biting structure may be performed according to a method described below.
  • the size of the information bit may be K 'and K' mod 15 may be zero.
  • encoding may be performed based on information bits having a size of K '+ 1 bits.
  • one bit of a predetermined value may be added to the information bits of the K ′ bit.
  • the preset value may be transmitted by the transmitting end to the receiving end.
  • Pre-coding may be performed on information bits of K ′ + 1 bits.
  • the cyclic state may be determined in Tables 1 and 2 based on the end state of the pre-coding and the value of (K ′ + 1) mod 15.
  • the encoder adds one preset bit to the end of the K 'bit. That is, a bit sequence of K '+ 1 bits having a predetermined 1 bit as a Least Significant Bit (LSB) may be used.
  • the encoder performs precoding based on a bit sequence of K '+ 1 bits, and determines the cyclic state in Tables 1 and 2 described above.
  • One bit of the preset value is used for precoding, but may not actually be transmitted to the receiving end.
  • a 3-bit tail biting bit can be used.
  • the tail biting technique can be applied only to the added memory (fourth delay 714).
  • the fourth delayer 714 is connected only to the third delayer 713. Therefore, when three tail bitting bits are used, such as LTE turbo coding, it may be assumed that the code input to the fourth delayer 714 has a tail biting structure. In this case, the states of the first delayer 711 and the second delayer 712 may not be considered in determining the tail biting state of the fourth delayer.
  • the encoder 700 may be assumed to be an encoder having two memories. In this case, the encoder 700 is considered to have four states. In this case, the recursive state may be determined according to Table 3 based on the value of K mod 3 and the end state of the pre-encoding. Where K represents the size of the information bit.
  • the size of the information bit may be K 'and K' mod 3 may be zero.
  • encoding may be performed based on information bits having a size of K '+ 1 bits.
  • one bit of a predetermined value may be added to the information bits of the K ′ bit.
  • the preset value may be transmitted by the transmitting end to the receiving end.
  • Pre-coding may be performed on information bits of K ′ + 1 bits.
  • the cyclic state may be determined in Tables 1 and 2 based on the end state of the precoding and the value of (K ′ + 1) mod 3.
  • the transmitting end and the receiving end know the value of the added 1 bit, the previous state can be known by using the added bit.
  • the added 1 bit is used in precoding, but may not actually be transmitted to the receiving end.
  • FIG. 8 is a flowchart of an encoding method according to an embodiment.
  • the encoder may be the encoder 700 of FIG. 7.
  • the first switching circuit and the second switching circuit of the encoder 700 of FIG. 7 are all connected (that is, turned on). With both the first switching circuit and the second switching circuit disconnected (ie, turned off), the encoder can operate in the same manner as the LTE turbo encoder described above with respect to FIGS. 4 and 5. have.
  • the encoder pre-encodes an input signal to be transmitted (S801).
  • the encoder determines an end state based on the result of the precoding (S802).
  • the encoder determines a preset cyclic state based on the length and the end state of the input signal (S803). How to determine the cyclic state can be referred to by the description associated with Tables 1 to 3 described above.
  • the encoder encodes an input signal into a turbo code having a tail biting structure based on the determined cyclic state (S804).
  • the encoder may transmit an encoded codeword.
  • FIG. 9 is a diagram for schematically describing a configuration of devices to which the embodiments of the present invention described with reference to FIGS. 1 to 8 may be applied as an embodiment of the present invention.
  • the base station apparatus 10 may include a receiving module 11, a transmitting module 12, a processor 13, a memory 14, and a plurality of antennas 15. .
  • the transmission module 12 may transmit various signals, data, and information to an external device (eg, a terminal).
  • the reception module 11 may receive various signals, data, and information from an external device (eg, a terminal).
  • the receiving module 11 and the transmitting module 12 may be referred to as transceivers.
  • the processor 13 may control the overall operation of the base station apparatus 10.
  • the plurality of antennas 15 may be configured according to, for example, a two-dimensional antenna arrangement.
  • the processor 13 of the base station apparatus 10 may be configured to receive channel state information according to examples proposed by the present invention.
  • the processor 13 of the base station apparatus 10 performs a function of processing information received by the base station apparatus 10, information to be transmitted to the outside, and the like. And may be replaced by a component such as a buffer (not shown).
  • the terminal device 20 may include a receiving module 21, a transmitting module 22, a processor 23, a memory 24, and a plurality of antennas 25.
  • the plurality of antennas 25 refers to a terminal device that supports MIMO transmission and reception.
  • the transmission module 22 may transmit various signals, data, and information to an external device (eg, a base station).
  • the reception module 21 may receive various signals, data, and information from an external device (eg, a base station).
  • the receiving module 21 and the transmitting module 22 may be referred to as transceivers.
  • the processor 23 may control operations of the entire terminal device 20.
  • the processor 23 of the terminal device 20 may be configured to transmit channel state information according to examples proposed by the present invention.
  • the processor 23 of the terminal device 20 performs a function of processing the information received by the terminal device 20, information to be transmitted to the outside, etc., and the memory 24 stores the calculated information and the like for a predetermined time. And may be replaced by a component such as a buffer (not shown).
  • terminal device 10 may be implemented so that the above-described matters described in various embodiments of the present invention can be applied independently or two or more embodiments are applied at the same time, overlapping description will be described for clarity Omit.
  • a downlink transmission entity or an uplink reception entity is mainly described using a base station
  • a downlink reception entity or uplink transmission entity is mainly described using a terminal as an example.
  • the scope of the present invention is not limited thereto.
  • the description of the base station is a cell, an antenna port, an antenna port group, an RRH, a transmission point, a reception point, an access point, a repeater, or the like as a downlink transmission entity to a terminal or an uplink reception entity from a terminal.
  • the repeater becomes a downlink transmission entity to the terminal or an uplink reception entity from the terminal, or when the repeater becomes an uplink transmission entity to the base station or a downlink reception entity from the base station,
  • the principles of the present invention described through various embodiments may be equally applied.
  • Embodiments of the present invention described above may be implemented through various means.
  • embodiments of the present invention may be implemented by hardware, firmware, software, or a combination thereof.
  • a method according to embodiments of the present invention may include one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), and Programmable Logic Devices (PLDs). It may be implemented by field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, and the like.
  • ASICs Application Specific Integrated Circuits
  • DSPs Digital Signal Processors
  • DSPDs Digital Signal Processing Devices
  • PLDs Programmable Logic Devices
  • FPGAs field programmable gate arrays
  • processors controllers, microcontrollers, microprocessors, and the like.
  • the method according to the embodiments of the present invention may be implemented in the form of a module, a procedure, or a function that performs the functions or operations described above.
  • the software code may be stored in a memory unit and driven by a processor.
  • the memory unit may be located inside or outside the processor, and may exchange data with the processor by various known means.
  • each component or feature is to be considered optional unless stated otherwise.
  • Each component or feature may be embodied in a form that is not combined with other components or features. It is also possible to combine some of the components and / or features to form an embodiment of the invention.
  • the order of the operations described in the embodiments of the present invention may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment. It is obvious that the claims may be combined to form an embodiment by combining claims that do not have an explicit citation relationship in the claims or as new claims by post-application correction.
  • Embodiments of the present invention can be applied to various wireless access systems and broadcast communication systems.
  • various radio access systems include 3rd Generation Partnership Project (3GPP), 3GPP2 and / or IEEE 802.xx (Institute of Electrical and Electronic Engineers 802) systems.
  • Embodiments of the present invention can be applied not only to the various radio access systems, but also to all technical fields to which the various radio access systems are applied.

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

L'invention concerne un procédé de codage de turbo-code amélioré et un codeur associé. Le codeur selon la présente invention peut comprendre quatre retardateurs. En outre, le codeur peut déterminer un état de circulation par précodage et, sur la base de l'état de circulation, générer un turbo-code ayant une structure en boucle. De plus, le codeur peut comprendre un circuit de commutation et fonctionner comme les codeurs turbo-codes LTE classiques en éteignant le circuit de commutation.
PCT/KR2017/001074 2017-02-01 2017-02-01 Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur WO2018143489A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/KR2017/001074 WO2018143489A1 (fr) 2017-02-01 2017-02-01 Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/KR2017/001074 WO2018143489A1 (fr) 2017-02-01 2017-02-01 Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur

Publications (1)

Publication Number Publication Date
WO2018143489A1 true WO2018143489A1 (fr) 2018-08-09

Family

ID=63039867

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2017/001074 WO2018143489A1 (fr) 2017-02-01 2017-02-01 Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur

Country Status (1)

Country Link
WO (1) WO2018143489A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100031125A1 (en) * 2006-09-28 2010-02-04 Broadcom Corporation Tail-biting turbo coding to accommodate any information and/or interleaver block size
US20120324316A1 (en) * 2011-06-17 2012-12-20 Lsi Corporation Turbo Parallel Concatenated Convolutional Code Implementation on Multiple-Issue Processor Cores
US20130064323A1 (en) * 2002-12-27 2013-03-14 Broadcom Corporation Turbo Coding for Upstream and Downstream Transmission in Cable Systems

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130064323A1 (en) * 2002-12-27 2013-03-14 Broadcom Corporation Turbo Coding for Upstream and Downstream Transmission in Cable Systems
US20100031125A1 (en) * 2006-09-28 2010-02-04 Broadcom Corporation Tail-biting turbo coding to accommodate any information and/or interleaver block size
US20120324316A1 (en) * 2011-06-17 2012-12-20 Lsi Corporation Turbo Parallel Concatenated Convolutional Code Implementation on Multiple-Issue Processor Cores

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ERICSSON: "Further Enhanced Turbo Codes for NR", R1-1611325, 3GPP TSG RAN WG1 MEETING #87, 6 November 2016 (2016-11-06), Reno, USA, XP051190693 *
ORANGE ET AL.: "Enhanced Turbo Codes for NR: Implementation Details", R1-167413, 3GPP TSG-RAN WG1 MEETING #86, 12 August 2016 (2016-08-12), Gothenburg, Sweden, XP051142038 *

Similar Documents

Publication Publication Date Title
WO2018062660A1 (fr) Procédé d'adaptation de débit de code qc ldpc et dispositif associé
US20170279464A1 (en) Method of ldpc code encoding for reducing signal overhead and apparatus therefor
US10903857B2 (en) Data retransmission method for polar code, and device therefor
US10116332B2 (en) Method for configuring circular buffer including outer code parity and apparatus therefor
WO2017018859A1 (fr) Procédé et appareil de codage de canal et de décodage de canal dans un système de communication sans fil
US10075197B1 (en) Method and apparatus for transmitting hamming weight and codeword
US11777525B2 (en) Method for transmitting LDPC code using row-orthogonal and apparatus therefor
WO2018128435A2 (fr) Procédé de sélection de code de base ldpc dans un code multi-lpdc, et dispositif associé
WO2018084617A1 (fr) Procédé de division de bloc de transport de code ldpc et appareil associé
WO2018164297A1 (fr) Procédé de décodage en couches pour code ldpc et dispositif associé
WO2018225885A1 (fr) Procédé de codage de code sc-ldpc et dispositif s'y rapportant
WO2018151555A1 (fr) Procédé de transmission d'informations, et dispositif de transmission
WO2018143772A1 (fr) Procédé de transmission de blocs de transport et dispositif de transmission
WO2018079987A1 (fr) Procédé de division de bloc de transport de code ldpc et appareil associé
WO2019098689A1 (fr) Procédé et appareil pour effectuer un codage et un décodage dans un système de communication sans fil
WO2018151545A1 (fr) Procédé de transmission d'informations et dispositif de transmission
US10312945B2 (en) Channel coding method using concatenated code structure and apparatus therefor
WO2018226019A1 (fr) Procédé de transmission de code ldpc faisant appel à une structure orthogonale en rangée, et appareil associé
WO2018143489A1 (fr) Codeur de turbo-code et procédé de codage pour améliorer l'efficacité de correction d'erreur
KR100912600B1 (ko) 임의 개수의 정보 비트들을 위한 테일바이팅 터보 코드
WO2010087682A2 (fr) Appareil et procédé destinés à transmettre un signal au moyen du groupement de bits dans un système de communication sans fil
WO2017213329A1 (fr) Procédé de décodage de code de correction d'erreurs sur la base d'un canal d'effacement binaire présentant un ratio de probabilité, et dispositif associé
US8132085B2 (en) Method and apparatus for frame control header decoding using cyclic shifting of bits
Zhao et al. The applied research of convolutional turbo code based on WiMAX protocol
JP2001326577A (ja) 直接連接畳込み符号器、及び、直接連接畳込み符号化方法

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

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

Country of ref document: EP

Kind code of ref document: A1