KR101503655B1 - Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes - Google Patents

Abstract

The present invention uses a low density parity check (LDPC) code in a communication system employing a high order modulation scheme. The LDPC code is used for channel coding / Decoding method and apparatus.
The present invention proposes a method for obtaining an optimized shortening and puncturing pattern in consideration of a higher order modulation scheme in applying shortening or puncturing to support various codeword lengths, If the information bits are input after the shortening is performed after the shortening is required after applying the parity check matrix to the parity check matrix of the LDPC code, an LDPC codeword is generated by encoding the information data bits using a predetermined coding scheme using the parity check matrix, If necessary, apply perforation to transmit.

Description

TECHNICAL FIELD The present invention relates to a method and apparatus for channel coding / decoding in a communication system using a low-density parity-check code,

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a communication system using a low-density parity-check (LDPC) code, and more particularly to an LDPC code having a variable codeword length and a code rate from a given LDPC code in a high- And more particularly, to a channel encoding / decoding apparatus and method for generating a code.

In a wireless communication system, the performance of a link is significantly degraded due to various noise, fading phenomena, and inter-symbol interference (ISI) of a channel. Therefore, it is essential to develop overcoming techniques for noise, fading and ISI in order to realize high-speed digital communication systems requiring high data throughput and reliability, such as next generation mobile communication, digital broadcasting, and portable Internet. In recent years, error-correcting codes have been actively studied as methods for efficiently restoring information distortion and improving communication reliability.

The type of the LDPC code, that is, the error correction code, can be expressed using a bipartite graph, which is generally defined as a parity-check matrix and is collectively referred to as a Tanner graph. The bipartite graph indicates that the vertices constituting the graph are divided into two different types. In the case of the LDPC code, a binary graph composed of a variable node and a vertex called a check node Is expressed. The variable node corresponds one-to-one to the encoded bit.

1 is an example of a parity check matrix H ₁ of the LDPC code including four rows and eight columns. Referring to FIG. 1, an LDPC code is generated to generate a codeword having a length of 8 because there are eight columns. Each column corresponds to eight encoded bits.

FIG. 2 is a graph showing a Tanner graph corresponding to H ₁ in FIG.

2, the Tanner graph of the LDPC code includes eight variable nodes x ₁ (202), x ₂ (204), x ₃ (206), x ₄ (208), x ₅ (210) ₆ 212, x ₇ 214 and x ₈ 216 and four check nodes 218, 220, 222 and 224. Here, the i-th column and the j-th row of the parity check matrix H ₁ of the LDPC code correspond to the variable nodes x _i and j-th check nodes, respectively. The value of 1, that is, a value other than 0 at the intersection of the i-th column and the j-th row of the parity check matrix H ₁ of the LDPC code means that the value of the variable It means that there is an edge between the node x _i and the jth check node.

In the Tanner graph of the LDPC code, the degree of the variable node and the check node means the number of line segments connected to the respective nodes. This means that in the parity check matrix of the LDPC code, Is equal to the number of non-zero entries. For example, the variable nodes x ₁ 202, x ₂ 204, x ₃ 206, x ₄ 208, x ₅ 210, x ₆ 212, x ₇ 214), x ₈ (216) orders, respectively order 4, 3, 3, 3, 2, 2, 2, and 2, check nodes (218, 220, 222, 224) the order of the is, as each sequence of 6, 5, 5, 5. In addition, the number of non-zero elements in each column of the parity check matrix H ₁ of FIG. 1 corresponding to the variable nodes of FIG. 2 corresponds to the numbers 4, 3, 3, 3, 2, 2, 2, and the number of non-zero elements in each row of the parity check matrix H ₁ of FIG. 1 corresponding to the check nodes of FIG. 2 corresponds to the order numbers 6, 5, 5, 5, respectively.

In order to express the degree distribution of nodes of the LDPC code, the ratio of the number of variable nodes having a degree i to the total number of variable nodes is fi, the number of check nodes having a degree j and the total number of check nodes Let g _{j be the} ratio of For example, f ₂ = 4/8, f ₃ = 3/8, and f ₄ = 1/8 in the case of the LDPC codes corresponding to FIGS. 1 and 2 and f _i = 0, g ₅ = 3/4, g ₆ = 1/4, and j ≠ 5 and 6, g _j = 0. Assuming that the length of the LDPC code is N, that is, the number of columns is N, and the number of rows is N / 2, the density of non-zero elements in the parity check matrix having the above- .

If N increases in Equation (1), the density of 1 in the parity check matrix continues to decrease. Generally, the LDPC code is inversely proportional to the nonzero element density with respect to the code length N, so that when N is large, the LDPC code has a very low density. The term low-density in the name of an LDPC code comes from this reason.

FIG. 3 schematically shows an LDPC code adopted as a standard technique in DVB-S2, which is one of the European digital broadcasting standards.

및

은 각각 LDPC 부호의 부호어 길이와 정보어의 길이를 나타내고,

은 패리티 길이를 의미한다. 그리고

과

는

를 만족한다. 이때,

도 정수가 되도록 한다. Referring to Figure 3,

And

Represent the codeword length and information length of the LDPC code, respectively,

Denotes the parity length. And

and

The

. At this time,

Is also an integer.

번째 열(column)부터

번째 열까지의 구조는 이중 대각(dual diagonal) 형태이다. 따라서, 패리티 부분에 해당하는 열의 차수(degree) 분포는 그 값이 '1'인 마지막 열을 제외하고 모두 '2'를 가진다. Referring to FIG. 3, a portion corresponding to a parity portion in a parity check matrix,

From the first column

The structure up to the second column is a dual diagonal form. Therefore, the degree distribution of the column corresponding to the parity part has '2' except for the last column in which the value is '1'.

번째 열까지는 다음의 규칙을 이용하여 생성된다.In the parity check matrix, the portion corresponding to the information word portion, i.e.,

Up to the first column is created using the following rules.

개의 열을

개의 열들로 구성된 복수 개의 그룹으로 그룹화(grouping)하여, 총

개의 열 그룹(column group)을 생성한다. 각 열 그룹에 속해있는 각각의 열을 구성하는 방법은 하기 규칙 2에 따른다. <Rule 1>: In the parity check matrix,

Columns

Grouping into a plurality of groups of four columns,

&Lt; / RTI &gt; column groups. The method for constructing each column belonging to each column group is as follows.

번째

열 그룹의 각 0 번째 열에서의 1이 있는 위치를 결정한다. 여기서, 각

번째 열 그룹의 0 번째 열의 차수를

라 할 때, 각 1이 있는 행의 위치를

이라 가정하면,

번째 열 그룹 내의

번째 열에서 1이 있는 행의 위치

는 하기 <수학식 2>와 같이 정의된다. <Rule 2>: First

th

Determine the position of 1 in each 0th column of the column group. Here,

The order of the 0th column in the ith column group is

, The position of each row with 1

Assuming that,

Within the first column group

The position of the row with 1 in the third column

Is defined as < EMI ID = 2.0 >

번째

열 그룹 내에 속하는 열들의 차수는 모두

로 일정함을 알 수 있다. 상기 규칙에 따라 패리티 검사 행렬에 대한 정보를 저장하고 있는 DVB-S2 LDPC 부호의 구조를 쉽게 이해하기 위하여 다음과 같은 구체적인 예를 살펴보기로 한다.According to the above rule

th

The order of the columns belonging to the column group is

As shown in Fig. In order to easily understand the structure of the DVB-S2 LDPC code storing information on the parity check matrix according to the above rule, a specific example will be described as follows.

이며, 3개의 열 그룹의 0 번째 열에 대한 1이 있는 행의 위치 정보는 다음과 같이 나타낼 수 있다.As a concrete example

, And the position information of the row having the 1 in the 0th column of the 3 column groups can be expressed as follows.

For the sake of convenience, the positional information of the row having the 0th 1 of each column group may be represented by only the positional information for each column group as follows.

0 1 2

0 11 13

0 10 14

번째 행의 수열은

번째 열 그룹에 대한 행의 위치 정보를 순차적으로 나타낸 것이다. That is,

The sequence of the second row is

And the position information of the row for the ith column group.

If the parity check matrix is configured using information corresponding to the concrete example and < Rule 1 > and < Rule 2 >, an LDPC code having the same concept as the DVB-S2 LDPC code shown in FIG. 4 can be generated.

It is known that the DVB-S2 LDPC code designed through the rules 1 and 2 can be efficiently encoded using a structural form. The steps of the LDPC encoding process using the parity check matrix of the DVB-S2 will be described as follows.

,

,

,

를 특징으로 하는 DVB-S2 LDPC 부호를 이용하는 부호화 과정을 설명하였다. 또한 설명의 편의를 위해 길이가

인 정보어 비트들을

로 나타내고, 길이가

인 패리티 비트들을

로 나타낸다. As a specific example,

,

,

,

A description has been given of a coding process using a DVB-S2 LDPC code. Also, for convenience of explanation,

Information bits

And the length is

Parity bits

Respectively.

. Step 1 : The LDPC encoder initializes the parity bits as follows.

.

Step 2 : From the 0th row of the sequence representing the stored parity check matrix, information of the row where 1 is located in the first column group of the information word is read.

0 2084 1613 1548 1286 1460 3196 4297 2481 3369 3451 4620 2622

를 이용하여 하기의 <수학식 3>과 같이 특정 패리티 비트

들을 업데이트한다. 여기서,

는 각각의

값을 의미한다. The called information and information bits

As shown in Equation (3) below,

Lt; / RTI &gt; here,

Respectively,

Lt; / RTI >

는

로 표기하기도 하며,

는 이진(binary) 덧셈을 의미한다. In Equation (3)

The

Also,

Means binary addition.

이후의 다음 359개의 정보어 비트

,

에 대해서 먼저 하기의 <수학식 4>에 대한 값을 결정한다. Step 3 :

The following 359 information bits

,

The value for Equation (4) below is determined.

는 각각의

값을 의미한다. 상기 <수학식 4>는 <수학식 2>와 동일한 개념의 수식임에 유의한다. In Equation (4)

Respectively,

Lt; / RTI &gt; Note that Equation (4) is an equation having the same concept as Equation (2).

에 대해서

을 업데이트한다. 예를 들어

, 즉,

에 대해서 하기의 <수학식 5>와 같이

들을 업데이트한다. Next, an operation similar to Equation (3) is performed using the value obtained from Equation (4). In other words,

about

Lt; / RTI &gt; E.g

, In other words,

As shown below in Equation (5)

Lt; / RTI >

이다. LDPC 부호화기는 위와 같은 과정을

에 대해서 마찬가지로 수행한다. In the case of Equation (5)

to be. The LDPC encoder performs the above procedure

.

에 대해서

의 정보를 호출하고, 특정

을 업데이트한다. 여기서,

는

을 의미한다.

이후의 다음 359개의 정보어 비트

에 대해서 <수학식 4>를 유사하게 적용하여

를 업데이트한다. Step 4 : As in step 2 above,

about

And calls the information

Lt; / RTI &gt; here,

The

.

The following 359 information bits

Equation (4) is applied similarly to Equation

Lt; / RTI >

Step 5 : Repeat steps 2, 3 and 4 for all 360 information bit groups.

Step 6 : Finally, the parity bit is determined by Equation (6).

들이 LDPC 부호화가 완료된 것이다. The parity bit in Equation (6)

The LDPC coding is completed.

As described above, in DVB-S2, encoding is performed as described in steps 1 to 6. [

In order to apply an LDPC code to an actual communication system, the LDPC code should be designed to be compatible with the data transmission rate (dara rate) required in the communication system. In particular, in a communication system supporting a variety of broadcasting services as well as an adaptive communication system employing a hybrid automatic retransmission request (HARQ) scheme and an adaptive modulation and coding (AMC) scheme, In order to support various data transmission rates, LDPC codes having various codeword lengths are required.

However, in the case of the LDPC code used in the DVB-S2 system as described above, only two codeword lengths are required due to limited use, and each requires an independent parity check matrix. For this reason, it is necessary to support various codeword lengths in order to increase the scalability and flexibility of the system. Especially, in DVB-S2 system, it is necessary to transmit hundreds to thousands of bits of data for transmission of signaling information. Since there are only 16200 and 64800 lengths of DVB-S2 LDPC codes, support for various codeword lengths is essential . However, storing an independent parity check matrix for each codeword length of an LDPC code degrades the memory efficiency. Therefore, a new parity check matrix is not designed, and various codeword lengths are efficiently obtained from the existing parity check matrix There is a need for support.

In a communication system that requires various codeword lengths of an LDPC code, a higher-order modulation scheme is used, but unlike a communication system using only BPSK or QPSK, the reliability of bits included in a higher-order modulation symbol is different .

In order to explain the difference in reliability in the higher-order modulation scheme, signal constellation in the case of applying a QAM (Quadrature Amplitude Modulation) scheme, which is a higher-order modulation scheme commonly used in communication systems, will be described below. The modulated symbols in QAM are composed of real part and imaginary part, and various modulation symbols can be constructed by varying the size and sign of each real part and imaginary part. In order to examine the characteristics of the QAM, a QPSK modulation scheme will be described.

5 (a) is a schematic diagram of a signal constellation of a general QPSK (Quadrature Phase Shift Keying) modulation scheme.

y ₀ determines the sign of the real part and y ₁ determines the sign of the imaginary part. That is, when y ₀ is 0, the sign of the real part is positive (plus, +), and when y ₀ is 1, the sign of the real part is negative (minus, -). Also, if y ₁ is 0, the sign of the imaginary part is plus (+), and if y ₁ is 1, the sign of the imaginary part is minus (-). y ₀ , y ₁ (Y ₀ , y ₁ ) corresponding to one modulated signal in the QPSK modulation scheme because the error occurrence probability of y ₀ , y ₁ is the same because each is a sign bit indicating the sign of the real part and the imaginary part. Reliability is the same. Here, denoted by y _{0 , q,} y _{1 , q} , the second subscript index q indicates the q-th output of the modulated signal constituent bits.

5 (b) is a schematic diagram of a signal constellation of a general 16-QAM modulation system.

Referring to FIG. 5 (b), (y ₀ , y ₁ , y ₂ , y ₃ ) corresponds to one modulation signal bit. In particular, the bits y ₀ and y ₂ determine the sign and magnitude of the real part, respectively, and the bits y ₁ and y ₃ respectively determine the sign and magnitude of the imaginary part. That is, y ₀ and y ₁ determine the sign of the real and imaginary parts of the signal, and y ₂ and y ₃ Determines the magnitude of the real and imaginary parts of the signal. Since it is easier to determine the sign than to determine the magnitude of the modulated signal, the probability of error for y ₂ and y ₃ is y ₀ and y ₁ Respectively. Therefore, the probability that the errors of the bits will not occur (i.e., reliability) is y ₀ = y ₁ > y ₂ = y ₃ . That is, unlike QPSK, the modulated signal constituent bits (y ₀ , y ₁ , y ₂ , y ₃ ) of the QAM have characteristics that the reliability of each bit is different.

In the 16-QAM modulation scheme, two bits out of the four bits constituting the signal determine the sign of the real part and the imaginary part of the signal, and the remaining two bits indicate the size of the real part and imaginary part of the signal (y ₀ , y ₁ , y ₂ , y ₃ ) and the role of each bit can be changed.

5 (c) is a schematic diagram of a signal constellation of a general 64-QAM modulation system.

Here, bits y ₀ , y _2, and y ₄ of (y ₀ , y ₁ , y ₂ , y ₃ , y ₄ , y ₅ ) corresponding to one modulation signal bit determine the sign and magnitude of the real part, ₁ , y ₃ and y ₅ determine the sign and magnitude of the imaginary part. Y ₀ and y ₁ determine the signs of the real and imaginary parts, respectively, and y _{2 and} y ₄ The combination and the combination of y _{3 and} y ₅ determine the size of the real and imaginary parts, respectively. The reliability of y ₀ and y ₁ is higher than the reliability of y _{2 ,} y ₃ , y _{4 and} y ₅ because it is easier to distinguish the code than to determine the size of the modulated symbol. y _{2 and} y ₃ are determined according to whether the size of the modulated symbol is larger or smaller than _{4 and} y _{4 and} y ₅ are determined based on whether the size of the modulated symbol is close to 4 and 0 based on 2, 6 &lt; / RTI &gt; Therefore _, the size of the determination range of y _{2 and} y ₃ is 4, and the determination range of y _{4 and} y ₅ is 2. Therefore _, the reliability of y _{2 ,} y ₃ is higher than y _{4 ,} y ₅ . As a result, the probability (i.e., reliability) that an error of each bit will not occur is y ₀ = y ₁ > y ₂ = y ₃ > y ₄ = y ₅ .

In the 64-QAM modulation scheme, two of the 6 bits constituting the signal determine the sign of the real part and the imaginary part of the signal, and the four bits are only required to indicate the size of the real part and the imaginary part of the signal. Therefore, the order of (y ₀ , y ₁ , y ₂ , y ₃ , y ₄ , y ₅ ) and the role of each bit may vary. In the case of a signal constellation of 256-QAM or higher, the role and reliability of the modulation signal constituting bits are changed in the same manner as described above. A detailed description thereof will be omitted.

Briefly, in the BPSK and QPSK modulation schemes, since the reliability of the bits contained in the symbols is the same, the reliability of each codeword bit in the LDPC codeword after shortening or puncturing is the same, There was no need to consider the modulation scheme when making the decision. However, since higher order modulation schemes such as 16-QAM, 64-QAM, and 256-QAM have different roles and reliability of the bits included in the symbol, the modulation scheme and the signal constellation bit mapping scheme are determined. There is a problem that the reliability corresponding to each codeword bit in the LDPC codeword after the puncturing is applied is different from that before the shortening or puncturing is applied.

Accordingly, there is a need for an apparatus and method for generating an LDPC code using shortening or puncturing considering a higher order modulation scheme.

The present invention generates an LDPC code by generating an LDPC code having a different codeword length from a given LDPC code by using shortening or puncturing considering a higher order modulation scheme and then using the generated LDPC code And provides a channel encoding / decoding method and apparatus in a communication system.

The present invention also provides a method and apparatus for channel coding / decoding in a communication system using a low-density inspection code ensuring optimal performance considering a DVB-S2 structure.

이고, 16-QAM(quadrature amplitude modulation)이고, 부호어 길이가 16200이고, 정보 비트의 길이가 7200일 경우, 상기 미리 결정된 순서에 기반으로 하는 단축될 비트 그룹의 순서는 18, 17, 16, 15, 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19, 0이고, 상기 복수의 비트 그룹 중 어느 하나는 BCH(bose-chaudhuri-hocquenghem) 패리티 비트를 포함하고, 상기 BCH 패리티 비트는 단축을 취하지 않는다.
본 발명의 실시 예에 따른 채널 부호화 장치는 저밀도 패리티 검사 부호를 사용한 시스템에서 채널 부호화 장치에 있어서, 정보 비트들을 복수의 비트 그룹으로 구분하고, 단축될 정보 비트의 수를 결정하고, 상기 결정된 단축될 정보 비트의 수를 근거로 하여 단축될 비트 그룹의 수를 결정하고, 미리 결정된 순서에 따라서 상기 결정된 비트 그룹의 정보 비트들을 단축하는 단축 패턴 적용부; 및 상기 단축된 정보 비트들을 부호화하는 부호화기를 포함하고, 상기 단축 패턴 적용부는 상기 단축될 정보 비트의 수를 결정하기 위해 단축에 의해 획득될 수 있는 정보 비트 수(K₂)를 결정하고, 상기 단축 패턴 적용부는, 상기 미리 결정된 순서에 따라서 0 번째 비트 그룹부터 (m-1) 번째 비트 그룹까지 해당하는 정보 비트를 단축하고, 상기 미리 결정된 순서에 따라서 m 번째 비트 그룹 내의 (7200-K₂-360m) 정보 비트를 단축하고, K₂는 단축에 의해 얻어질 수 있는 정보 비트의 수이고, (7200-K₂)는 단축될 정보 비트의 수이고,

이고, 16-QAM(quadrature amplitude modulation)이고, 부호어 길이가 16200이고, 정보 비트의 길이가 7200일 경우, 상기 미리 결정된 순서에 기반으로 하는 단축될 비트 그룹의 순서는 18, 17, 16, 15, 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19, 0이고, 상기 복수의 비트 그룹 중 어느 하나는 BCH(bose-chaudhuri-hocquenghem) 패리티 비트를 포함하고, 상기 BCH 패리티 비트는 단축을 취하지 않는다.A channel coding method according to an embodiment of the present invention is a channel coding method in a system using a low density parity check code, the method comprising: dividing information bits into a plurality of bit groups; Determining a number of information bits to be shortened; Determining a number of bit groups to be shortened based on the determined number of information bits to be shortened; Shortening information bits of the determined bit group according to a predetermined order; And encoding the shortened information bits, the method further comprising: determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened, A step of shortening the corresponding information bits from the 0th bit group to the (m-1) th bit group according to the determined order; And shortening (7200-K ₂ -360m) information bits in the m-th bit group according to the predetermined order, wherein K ₂ is the number of information bits obtainable by the shortening, and (7200- K ₂ ) The number of information bits to be shortened,

16, QAM (Quadrature Amplitude Modulation), a codeword length of 16,200, and an information bit length of 7200, the order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 15 , 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19, 0 and one of the plurality of bit groups is a BCH (bose-chaudhuri-hocquenghem ) Parity bits, and the BCH parity bit does not take a short.
A channel encoding apparatus according to an embodiment of the present invention is a channel encoding apparatus in a system using a low density parity check code, in which information bits are divided into a plurality of bit groups, the number of information bits to be shortened is determined, A short pattern application unit for determining the number of bit groups to be shortened based on the number of information bits and shortening the information bits of the determined bit group according to a predetermined order; And an encoder for coding the shortened information bits, wherein the shortening pattern application unit determines a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened, The pattern applying unit may shorten the information bits corresponding to the 0th bit group to the (m-1) th bit group according to the predetermined order, and calculate the (7200-K ₂ -360m ) shortened information bits, K ₂ is the number of information bits that can be obtained by shortening, (7200-K ₂₎ is the number of information bits to be shortened,

16, QAM (Quadrature Amplitude Modulation), a codeword length of 16,200, and an information bit length of 7200, the order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 15 , 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19, 0 and one of the plurality of bit groups is a BCH (bose-chaudhuri-hocquenghem ) Parity bits, and the BCH parity bit does not take a short.

The present invention can generate a separate LDPC code having different codeword lengths by optimizing performance using information of a parity check matrix given in a higher order modulation scheme and a communication system using an LDPC code.

The present invention can be shortened by applying different shortening patterns according to the modulation method.

1 is a diagram illustrating an example of a parity check matrix of an LDPC code having a length of 8,
2 shows a Tanner graph of an example of a parity check matrix of an LDPC code having a length of 8,
FIG. 3 is a schematic diagram of a DVB-S2 LDPC code,
4 is a diagram illustrating an example of a parity check matrix of a DVB-S2 type LDPC code,
5A is a diagram showing an example of QPSK modulation used in a digital communication system,
5 (b) is a diagram showing an example of 16-QAM modulation used in a digital communication system,
FIG. 5 (c) is a diagram showing an example of 64-QAM modulation used in a digital communication system,
6 is a block diagram of a transceiver block in a communication system using an LDPC code,
7 (a) shows an example of signal constellation bit mapping in a 16-QAM modulation scheme,
FIG. 7 (b) is a diagram showing an example of a change in signal constellation bit mapping by shortening in the 16-QAM modulation system,
8 (a) shows an example of signal constellation bit mapping in a 64-QAM modulation scheme,
8 (b) is a diagram showing an example of a change in signal constellation bit mapping by the shortening in the 64-QAM modulation method,
9 is a flowchart for generating an LDPC code having a different codeword length from a parity check matrix of a stored LDPC code according to an embodiment of the present invention.
10 is a block diagram of a transmitting apparatus using the shortened LDPC code proposed in the present invention.
11 is a block diagram of a transmitting apparatus using the shortened / punctured LDPC code proposed in the present invention.
12 is a block diagram of a receiving apparatus using an LDPC code to which the shortening proposed in the present invention is applied;
FIG. 13 is a block diagram of a receiving apparatus using an LDPC code to which both the shortening and the puncturing are applied according to the present invention.
14 is a flowchart showing a receiving operation in a receiving apparatus according to an embodiment of the present invention;

Preferred embodiments according to the present invention will be described in detail with reference to the accompanying drawings. It should be noted that only the parts necessary for understanding the operation according to the present invention will be described in the following description, and the description of other parts will be omitted so as not to overstep the gist of the present invention.

The present invention proposes a method of supporting an LDPC code having various codeword lengths suitable for a higher order modulation scheme by using a parity check matrix of a specific type of structured LDPC code. Also, the present invention proposes a device supporting a variety of codeword lengths in accordance with a higher order modulation scheme in a communication system using a specific type of LDPC code, and a control method thereof. In particular, the present invention proposes a method and apparatus for generating a smaller LDPC code using a parity check matrix of a given LDPC code.

6 is a block diagram of a transceiver block of a communication system using an LDPC code.

는 수신기(630)로 전송되기 전에 송신기(610)의 LDPC 부호화기(encoder)(611)로 입력된다. 그러면 상기 LDPC 부호화기(encoder)(611)는 입력된 메시지

를 부호화하고 부호화 신호 c를 변조기(Modulator)(613)로 출력한다. 상기 변조기(613)는 부호화된 신호 c를 변조하고 무선 채널(620)을 통해 변조 신호 s를 수신기(530)로 전송한다. 그러면, 수신기(630)의 복조기(Demodulator)(631)는 수신된 신호 r을 복조하고, 복조 신호 x를 LDPC 복호기(Decoder)(633)로 출력한다. 상기 LDPC 복호기(Decoder)(633)는 복조 신호 x를 복호화한 후, 무선 채널(620)을 통해 받은 데이터를 통해 메시지의 추정치(estimate)

를 추정해낸다.Referring to Figure 6,

Is input to the LDPC encoder 611 of the transmitter 610 before being transmitted to the receiver 630. Then, the LDPC encoder (611)

And outputs a coded signal c to a modulator 613. [ The modulator 613 modulates the encoded signal c and transmits the modulated signal s over the wireless channel 620 to the receiver 530. The demodulator 631 of the receiver 630 then demodulates the received signal r and outputs the demodulated signal x to the LDPC decoder 633. [ The LDPC decoder 633 decodes the demodulated signal x and outputs an estimate of the message through the data received through the wireless channel 620. [

.

The LDPC encoder 611 generates a parity check matrix according to a codeword length required by the communication system from a preset scheme. Particularly, in the present invention, the LDPC encoder 611 can support various codeword lengths without the need for additional additional storage information using LDPC codes.

In the present invention, a method called shortening or puncturing is used as a method of obtaining various codeword lengths from a given LDPC code. Conventionally, there are known methods for optimizing the performance according to the code rate or codeword length when applying shortening or puncturing to an LDPC code. However, in the conventional methods for determining the shortening and puncturing patterns, optimization has been performed considering only BPSK (Binary Phase Shift Keying) or QPSK (Quadrature Phase Shift Keying). Therefore, the optimized shortening and puncturing patterns are applied to a given LDPC code Only one thing could exist.

However, optimized puncturing and shortening patterns when signal constellation bit mapping schemes are determined using higher order modulation may be different from those for BPSK or QPSK modulation schemes.

In the BPSK or QPSK modulation scheme, the reliability of the bits included in the symbol is the same. As a result, since the reliability of each codeword bit in the LDPC codeword after applying the shortening or puncturing is also the same, there is no need to consider the modulation scheme in the process of determining the shortening and puncturing pattern. However, as described in the related art, in the higher order modulation schemes such as 16-QAM, 64-QAM and 256-QAM, since the reliability of the bits included in the symbols is different, the modulation scheme and the signal constellation bit mapping scheme are determined The reliability corresponding to each codeword bit in the LDPC codeword after the shortening or puncturing is applied may be different from that before the shortening or puncturing is applied.

7 (a), 7 (b), 8 (a) and 8 (b) show the case where the modulation scheme is 16-QAM and 64-QAM, respectively. FIG. 8 is a diagram showing an example of bit mapping mapped. Particularly, FIG. 7A is a diagram showing an example of signal constellation bit mapping in the 16-QAM modulation system, and FIG. 7B shows an example of a change in signal constellation bit mapping by the shortening in the 16- Fig. Here, the LDPC codeword is divided into 8 partial blocks or 12 partial blocks.

Referring to FIG. 7 (a), y ₀ and y ₁ denote highly reliable bits for determining the sign of the real part and the imaginary part in the 16-QAM symbol, respectively. That is, the magnitude relation of reliability is y ₀ = y ₁ > y ₂ = y ₃ . 7A, since y ₁ and y ₃ are mapped to the LDPC codeword bits corresponding to the highest order variable node, 1/2 of the highest order variable nodes corresponds to the higher reliability part, and the remaining half Are connected to low-reliability parts.

Assuming that half of the highest order variable nodes are shortened as shown in FIG. 7 (b), when the symbol bits corresponding to the non-shortened highest order variable nodes are considered in the shortened LDPC codeword, 8 is mapped to y ₃ , and 1/8 is mapped to y ₁ . That is, the ratio is very different from the ratio before shortening.

8 (a) will be described. 8A is a diagram showing an example of a signal constellation bit mapping in a 64-QAM modulation system, and FIG. 8B is a diagram showing an example of a change in a signal constellation bit mapping by a shortening in a 64-QAM modulation system FIG.

The reliability of each bit included in the symbol in FIG. 8A is expressed as y ₀ = y ₁ > y ₂ = y ₃ > y ₄ = y ₅ . In this case, it can be seen that 1/3 of the variable nodes corresponding to the highest degree in the LDPC codeword correspond to y ₅ , which is the least reliable. However, when two-thirds of the highest-order variable nodes are shortened as in the case of FIG. 8B, 5/6 of the remaining non-shortened highest order variable nodes correspond to the least reliable y ₅ , Quot; ratio &quot;.

As described above, when the higher order modulation scheme and the signal constellation bit mapping scheme are fixed for a given LDPC code, the ratio of the LDPC codeword bits mapped to each bit of the modulation symbol becomes very different according to the shortening scheme, Or the shortening or puncturing pattern used in the QPSK modulation scheme may not be appropriate.

It is well known that the degree distribution of the parity check matrix of the LDPC code optimized according to the modulation scheme is very different in the LDPC code. That is, the order distribution of the LDPC code optimized for the BPSK or QPSK modulation scheme and the order distribution of the LDPC code optimized for the 16-QAM, 64-QAM, and 256-QAM are all different.

For the same reason, it is obvious that all of the optimized shortening or puncturing patterns according to the higher order modulation scheme have different patterns, assuming that the LDPC code having one order distribution is given. In conclusion, in order to obtain an optimized shortening or puncturing pattern of an LDPC code, it is necessary to obtain a shortening pattern considering the modulation scheme to be applied.

To explain the method of determining the shortening or puncturing pattern considering the modulation scheme, shortening will be described first. Refers to a method of generating an LDPC codeword from a given parity check matrix by performing LDPC encoding and then not actually transmitting a specific portion of the LDPC codeword. The parity check matrix of the DVB-S2 LDPC code of FIG. 3 will be described in detail below to facilitate understanding of the shortening method.

이며, 상기 패리티 검사 행렬의 앞부분은 길이가

인 정보어 비트들

이 대응되고, 상기 패리티 검사 행렬의 뒷부분은 길이가

인 패리티 비트들

이 대응된다. 통상적으로 정보어 비트들은 0, 1의 값을 자유롭게 가지게 되는데 단축법에서는 단축시킬 특정 부분의 정보어 비트들의 값에 제한을 두게 된다. 예를 들어

에서부터

까지

개의 정보어 비트를 단축한다는 의미는 통상적으로

임을 의미한다. 즉,

에서부터

까지

개의 정보어 비트에 대한 값을 0으로 제한함으로써 상기 도 3의 DVB-S2 LDPC 부호의 패리티 검사 행렬에서 앞부분의

개의 열을 실질적으로 사용하지 않는 것과 동일한 효과를 얻게 되는 것이다. "단축법"이라는 용어는 이러한 이유로 유래되었다. 따라서 본 발명에서 단축을 적용했다는 의미는 단축된 정보어 비트들의 값을 0으로 간주함을 의미하기도 한다. The parity check matrix of the DVB-S2 LDPC code shown in FIG.

, And the front part of the parity check matrix has a length

Information bits

, And the rear part of the parity check matrix has a length of

In parity bits

Respectively. Normally, information bits are free to have values of 0 and 1, but in the shortening method, they limit the values of information bits of a specific part to be shortened. E.g

From

Till

The term " shortening "

. In other words,

From

Till

By limiting the value of the information bits of the DVB-S2 LDPC code of FIG. 3 to 0,

It is possible to obtain the same effect as not substantially using the heat of the rows. The term "shortening" has been derived for this reason. Therefore, in the present invention, the meaning of applying the shortening means that the value of the shortened information bits is regarded as 0.

Since the shortening method can share or generate the position information of the information bits shortened in the transmitting end and the receiving end when the system is set up, even if the transmitting end does not transmit the shortened bits, the receiving end does not transmit the position corresponding to the shortened bits It is possible to perform decoding in a state where it is known that the information bit is already 0.

이고, 정보어의 길이가

이므로 부호율이

이 되어 처음 주어진 부호율

보다 항상 작게 된다. In the shortening method, the length of the codeword actually transmitted from the transmitting end is

And the length of the information word is

Therefore,

Lt; RTI ID = 0.0 &gt;

.

인 LDPC 부호어 중에서

개의 약속된 위치에 비트들을 단지 전송하지 않음으로써 길이가

인 LDPC 부호어를 전송하는 것과 동일한 효과를 얻는다. 패리티 검사 행렬에서 천공된 비트들에 해당하는 열들은 복호 과정에서 모두 그대로 사용되므로 단축법과는 차이가 있다. In general, the puncturing method can be applied to both information bits and parity bits. Also, the puncturing method and the shortening method have a common feature that the codeword length of the code is made small, but unlike the shortening method, the puncturing method is not a concept of limiting the value of a specific bit. In particular, the puncturing method is a method of processing a specific part of a specific information word or a generated parity bit by merely transmitting it as an erasure at the receiving end. That is, if the length already generated

Among the LDPC codewords

By not only transmitting the bits in the promised position of &lt; RTI ID = 0.0 &gt;

Lt; RTI ID = 0.0 &gt; LDPC codeword. &Lt; / RTI &gt; Since the columns corresponding to the punctured bits in the parity check matrix are used as they are in the decoding process, they are different from the shortening method.

In addition, according to the embodiment of the present invention, since the position information on punctured bits can be shared or estimated by the transmitting terminal and the receiving terminal equally when the system is set up, the receiving terminal processes the punctured bits by merely canceling the decoding .

이고, 정보어의 길이는 변함없이

이므로 부호율이

이 되어 처음 주어진 부호율

보다 항상 크게 된다. In the puncturing method, the length of a codeword actually transmitted from the transmitting end is

, And the length of the information word is unchanged

Therefore,

Lt; RTI ID = 0.0 &gt;

Is always greater.

We now describe the simplification and puncturing method suitable for DVB-S2 LDPC codes. The DVB-S2 LDPC code is a kind of LDPC code having a specific structure as mentioned in the background art. Therefore, it is possible to apply the shortening and puncturing more efficiently unlike the case of the general LDPC code.

,

이고, 단축법과 천공법을 이용하여 DVB-S2 LDPC 부호로부터 최종적으로 얻고자 하는 LDPC 부호의 부호어 길이와 정보어 길이를 각각

,

이라 하자. 만일 우리가

,

라고 정의하면, DVB-S2 LDPC 부호의 패리티 검사행렬에서

비트만큼 단축을 취하고,

비트만큼 천공을 취하면 부호어 길이와 정보어 길이를 각각

,

인 상기 LDPC 부호를 생성할 수 있다. 이렇게 생성된 상기 LDPC 부호는

또는

일 때, 부호율이

가 되어 일반적으로 DVB-S2 LDPC 부호의 부호율

와는 다르게 되므로 대수적 특성이 변하게 된다. 여기서

인 경우에는 단축이나 천공을 모두 적용하지 않거나 또는 단축만 취한 경우에 해당된다. For convenience of explanation, the DVB-S2 LDPC code has a codeword length and an information word length of

,

, And the codeword length and information length of the LDPC code to be finally obtained from the DVB-S2 LDPC code using the shortening method and the puncturing method are respectively

,

. If we

,

, The parity check matrix of the DVB-S2 LDPC code

Taking the bit as short as possible,

If the puncturing is performed by bits, the length of the codeword and the length of the information word are respectively

,

The LDPC code can be generated. The generated LDPC code is

or

, The code rate is

The coding rate of the DVB-S2 LDPC code

And the algebraic characteristic is changed. here

, It is applied when neither shortening nor perforation is applied or only shortening is taken.

값이

개의 열에 대응되어 총

개의 열그룹(column group)이 각각 구조적인 형태를 가진다. 따라서 DVB-S2 LDPC 부호는 한 개의

값을 사용하지 않으면

개의 열을 사용하지 않는 것과 동일하다. 이러한 특징을 고려하여 도 9를 참조하여 설명될 단축 과정을 제안한다.However, the DVB-S2 LDPC code has one LDPC code as described in <Rule 1> and <Rule 2>

The value is

Corresponding to the columns

Each of the column groups has a structural form. Therefore, the DVB-S2 LDPC code is one

If the value is not used

It is the same as not using columns. Considering this characteristic, a shortening process to be described with reference to FIG. 9 is proposed.

FIG. 9 illustrates a process of generating an LDPC code from a parity check matrix of a stored LDPC code according to an embodiment of the present invention to another codeword.

와 정보어 길이

를 결정한다. 이후, LDPC 부호화기는 저장되어 있는 패리티 검사 행렬의 호출된 정보로부터 요구되는 LDPC 부호의 정보어 길이에 맞는 단축을 취하는데, 하기 907 단계 내지 913 단계와 같은 단축 과정을 진행한다.First, in step 901, the LDPC encoder determines a symbol transmission modulation scheme, and in step 903, it calls a column group information of a DVB-S2 LDPC code to be shortened. That is, the stored parity check matrix information is called. Then, in step 905, the LDPC encoder calculates the codeword length from the column group information of the DVB-S2 LDPC code

And information word length

. Thereafter, the LDPC encoder takes a shortening according to the length of the information word of the LDPC code required from the called information of the stored parity check matrix, and performs a shortening process as in steps 907 to 913 below.

를 구한다. 여기서

는

보다 같거나 작은 최대 정수를 의미한다. Shortening step 1 : The LDPC encoder performs step 907

. here

The

Means a maximum integer that is equal to or less than.

중에서

개의 열그룹에 대한 시퀀스를 선택한다. 선택된 시퀀스를

라 정의한다. LDPC 부호화기는 상기 수열

에서 상기 부분 수열

을 제외한 나머지

개의 열그룹에 대한 수열은 없는 것으로 간주한다. Shortening Step 2 : The LDPC encoder performs step 909

Between

Select sequences for the column groups. The selected sequence

. An LDPC encoder

Lt; RTI ID = 0.0 &gt;

Except for

It is assumed that there are no sequences for the column groups.

개의

로부터 DVB-S2 LDPC 부호의 정보어에 대응되는 열그룹의 위치를 결정한다. 이 경우에 단축된 DVB-S2 LDPC 부호를 생성한다. 이때 단축된 LDPC 부호는 정보어의 길이가

이 됨에 유의한다. 또한 이 값은 항상

보다 크거나 같다. Shortening step 3 : The LDPC encoder selects in step 911 the shortened step 2

doggy

The position of the column group corresponding to the information word of the DVB-S2 LDPC code is determined. In this case, a shortened DVB-S2 LDPC code is generated. At this time, the shortened LDPC code has a length of information word

. This value is always

Greater than or equal to.

개의 열을 추가적으로 단축한다. Shortening step 4 : The LDPC encoder generates the shortened LDPC code generated in the shortening step 3 in step 913

Further shortens the number of rows.

The additional shortening in the shortening step 4 can be implemented more easily by performing the steps from the bottom of the column group in which the additional shortening is performed in order, or sequentially from the front.

As described above, in the embodiment of the present invention, unlike the bit unit shortening method which is conventionally used for shortening the DVB-S2 LDPC code, the structure of the DVB-S2 LDPC code is used, It is possible to apply an efficient shortening method using a method that does not use the information about the information.

In step 2 of the shortening process of the DVB-S2 LDPC code, the selection criteria of the sequence for the column group will be briefly summarized as follows.

이며 정보어의 길이가

인 일반적인 LDPC 부호에 대해서 주어진 변조 방식을 고려하여 얻을 수 있는 최적의 차수 분포와, 부호어 길이가

이며 정보어의 길이가

인 DVB-S2 LDPC 부호에서 단축을 취하여 얻은 부호어 길이가

이며, 정보어의 길이가

인 단축된 LDPC 부호의 차수 분포가 가능한 한 유사하도록 열 그룹을 위한 단축 패턴 시퀀스를 선택한다. <Criteria 1>: The LDPC encoder has a codeword length of

And the length of the information word is

The optimal order distribution obtained by taking a given modulation scheme into consideration for a general LDPC code having a codeword length of

And the length of the information word is

The length of the codeword obtained by shortening the length of the DVB-S2 LDPC code is

And the length of the information word is

The shortening pattern sequence for the column group is selected such that the order distribution of the shortened LDPC code is as close as possible.

&Lt; Standard 2 >: A short pattern sequence for a column group is selected so that the cyclic characteristic on the Tanner graph is a good code among the shortened codes selected in <Reference 1>. According to the embodiment of the present invention, the criterion of the cyclic characteristic is selected as the sequence having the smallest number of the minimum length cycles while the minimum length cycle is the largest in the Tanner graph.

The optimal order distribution of a general LDPC code considering the modulation scheme in the criterion 1 can be obtained through a density evolution analysis method known to those skilled in the art. However, the process of determining the order distribution through the density evolution method is not essential to the gist of the present invention, and therefore, detailed description is not provided.

If there is not a small number of all possible (shortening pattern) sequences for a column group, the entire sequence is examined thoroughly regardless of two conditions such as <criterion 1> and <criterion 2> (Shortening pattern) sequence for the column group to be held. However, the selection criterion for the column group to be applied in the shortening step 2 of the DVB-S2 LDPC code is to select an LDPC code satisfying the above two conditions when all possible (shortening pattern) sequences for the column group are large (Shortening pattern) can be selected efficiently.

와

가 고정된 값을 때 적용된다. 그런데 만일 시스템에서 요구하는

,

의 값이 매우 가변적일 경우에는

의 값에 따라서 최적화된 단축 패턴이 상호 연관성이 없을 수도 있다. 즉, 시스템에서 요구하는

,

의 값이 매우 가변적일 경우에는 최적화된 성능을 위해서는

값에 따라서 최적화된 단축 패턴을 모두 따로 저장해야 된다는 단점이 있을 수 있다. &Lt; Standard 1 > and < Standard 2 &

Wow

Is applied at a fixed value. However, if the system requires

,

If the value of &lt; RTI ID = 0.0 &gt;

The optimized shortening patterns may not be correlated with each other. That is,

,

If the value is very variable, then for optimized performance

There may be a disadvantage that all the optimized shortening patterns must be stored separately.

,

의 값이 매우 가변적일 경우에는 시스템의 효율성을 위해 아래에서 설명될 방법으로 준최적(suboptimal)의 단축 패턴을 찾을 수 있다. Therefore,

,

If the value is very variable, a suboptimal shortening pattern can be found for the efficiency of the system as described below.

< Suboptimal  How to find a short pattern sequence>

First, it is assumed that the selection of one column group is required for shortening. Since there is only one column group to be selected, the column group having the best performance can be selected. When two column groups need to be selected for shortening, the column group having the best performance among the remaining column groups including the one selected column group is selected. Similarly, if it is necessary to select i column groups for shortening, one column group having the best performance among the remaining column groups including the (i-1) column groups selected for the shortening in the previous step is selected.

값의 변화에 무관하게 비교적 안정된 성능을 가지게 된다. 따라서 비교적 안정된 성능과 용이한 단축 패턴의 저장성에 대한 장점이 있게 된다. While this method does not guarantee optimal selection in all cases, it does not guarantee optimal selection from shortening patterns having one constant rule

It has relatively stable performance irrespective of the change of the value. Therefore, there is an advantage of relatively stable performance and storage stability of an easy shortening pattern.

로 설정했다고 하면, 상기 열그룹의 순서를 의미하는 수열만 저장하고 있으면, 임의의

값에 대하여 상기 단축 단계 1부터 단축 단계 4의 과정을 거쳐 효율적인 단축이 가능하다. And a DVB-S2 LDPC code having a total of G column groups corresponding to information bits is taken as an example. The method of determining the shortening pattern is applied so that the order of the column groups to be shortened is

, If only a series of sequences indicating the order of the column groups is stored,

Value can be efficiently shortened through the process from the shortening step 1 to the shortening step 4.

이 16200이며 정보어의 길이

이 7200인 DVB-S2 LDPC 부호에 대하여 BPSK/QPSK, 16QAM, 64QAM 변조 방식에 대하여 준최적화된 단축 패턴 및 단축 방법을 하기 <표 1> 및 <표 2>에 나타내었다. In order to show an example of the difference of the shortening patterns found by the above methods according to each modulation method,

Is 16200 and the length of the information word

Table 1 and Table 2 show the shortening patterns and the shortening method for the BPSK / QPSK, 16QAM, and 64QAM modulation schemes for the 7200 DVB-S2 LDPC code.

Referring to Table 1 and Table 2, the shortening method is performed through a certain process when the length of the information word to be shortened is shortened irrespective of the modulation scheme. However, the permutation function relationship, You can see all the difference depending on the method. That is, if a certain reduction method is applied without considering the modulation method, a large performance deterioration may occur depending on the modulation method.

The quasi-optimized shortening pattern as shown in Table 2 for Table 1 may not be unique according to the condition to be obtained. For example, there may be several column groups having similar performance in the middle of the method of finding the sub-optimal shortening pattern sequence. In this case, since the selection of the next column group may vary depending on the selection of the column group, the quasi-optimized shortening pattern may not be unique depending on the performance difference of the shortening process. In fact, the shortening pattern shown in the following Table 3 is very similar to the shortening method performance shown in Table 1 above.

The bit mapping method corresponding to the signal constellation used in the 16-QAM and 64-QAM modulation schemes of Table 3 applies the same bit mapping schemes as those shown in FIGS. 7A, 7B, 8A and 8B .

Referring to FIG. 9, if puncturing is required after step 913, the LDPC encoder applies puncturing in the LDPC coding process in step 915. FIG. The puncturing method will be described as follows.

,

인 DVB-S2 LDPC 부호로부터 단축법과 천공법을 통하여 우리가 최종적으로 얻고자하는 LDPC 부호의 부호어 길이와 정보어 길이를 각각

,

라 하고,

,

라고 정의하면, DVB-S2 LDPC 부호의 패리티 검사행렬에서

비트만큼 단축을 취하고,

비트만큼 천공을 취하면 부호어 길이와 정보어 길이를 각각

,

인 상기 LDPC 부호를 얻을 수 있었다. 이때 만일 편의를 위해 패리티 부분만 천공법을 적용한다고 가정할 때, 패리티의 길이는

이므로 패리티 비트에서

마다 1 비트씩 천공하는 방법이 있다. 하지만 천공법은 이러한 방법 외에도 다양한 방법을 적용할 수 있다. The codeword length and the information word length are respectively

,

The length of the codeword and the length of the information word of the LDPC code we ultimately obtain from the DVB-S2 LDPC code

,

However,

,

, The parity check matrix of the DVB-S2 LDPC code

Taking the bit as short as possible,

If the puncturing is performed by bits, the length of the codeword and the length of the information word are respectively

,

The above-mentioned LDPC code can be obtained. Assuming that the parity part is applied to the parity part only for convenience, the length of the parity is

Therefore,

A method of puncturing one bit at a time. However, in addition to this method, various methods can be applied to the puncturing method.

10 is a block diagram of a transmission apparatus using a shortened LDPC code according to an embodiment of the present invention.

10, a transmitting apparatus includes a controller 1010, a shortening pattern applying unit 1020, an LDPC code parity check matrix extracting unit 1040, and an LDPC encoder 1060.

The LDPC code parity check matrix extraction unit 1040 extracts the shortened LDPC code parity check matrix. The LDPC code parity check matrix may be extracted using a memory, received in a transmitting apparatus, or generated in a transmitting apparatus. The LDPC code parity check matrix extraction unit 1040 determines a transmission modulation scheme of a symbol to be transmitted and groups the columns corresponding to the information words in the parity check matrix of the LDPC code to generate a plurality of column groups, do.

The shortening pattern applying unit 1020 determines a range of information words to be obtained through the shortening and groups the column groups ordered according to the shortening pattern determined in consideration of the determined modulation method on the basis of the range of the information word, Unit-based reduction is performed.

The control unit 1010 controls the shortening pattern applying unit 1020 to determine a shortening pattern according to the transmission modulation method and the length of the information word. The shortening pattern applying unit 1020 applies 0 to the position corresponding to the shortened bit, , Or removes a bit corresponding to a shortened bit in a parity check matrix of a given LDPC code. As a method for determining the shortening pattern, a shortening pattern may be generated by using a shortening pattern stored using a memory, a shortening pattern may be generated using a sequence generator (not shown), or a density evolution may be performed on a parity check matrix and a given information word length Analysis algorithm or the like.

The LDPC encoder 1060 performs coding based on the LDPC code shortened by the controller 1010 and the shortening pattern applying unit 1020.

FIG. 11 is a block diagram showing a transmitting apparatus of a DVB-S2 LDPC code applying both shortening and puncturing.

In particular, the transmission apparatus of FIG. 11 is a system in which a puncturing pattern application unit 1180 is added to the transmission apparatus of FIG. 11, it can be seen that the shortening is performed in the pre-input stage of the LDPC encoder 1060, and the puncturing is performed in the output stage of the LDPC encoder 1060.

The puncturing pattern application unit 1180 applies puncturing to the output of the LDPC encoder 1060. The method of applying the puncturing is omitted because the step 915 of FIG. 9 has been described.

FIG. 12 is a block diagram of a receiving apparatus using an LDPC code to which shortening according to an embodiment of the present invention is applied.

In particular, in FIG. 12, when a signal transmitted in the communication system using the shortened DVB-S2 LDPC code is received and the transmission modulation scheme and length of the shortened DVB-S2 LDPC code are known from the received signal, An example of a receiving apparatus for restoring data desired by a user from a signal is shown.

12, the receiving apparatus includes a controller 1210, a short pattern determination or estimation unit 1220, a demodulator 1230, and an LDPC decoder 1240.

The demodulator 1230 receives and demodulates the shortened LDPC code, and transmits the demodulated signal to the shortening pattern determination or estimation unit 1220 and the LDPC decoder 1240.

Under the control of the controller 1210, the shortening pattern determination or estimation unit 1220 estimates or determines information on the shortening pattern of the LDPC code from the demodulated signal, and outputs the position information of the shortened bit to the LDPC decoder 1240). In the method for determining or estimating the shortening pattern in the shortening pattern determination or estimation unit 1220, a shortening pattern stored using a memory may be used, a shortening pattern may be generated using a sequence generator (not shown) A parity check matrix and a given information word length can be obtained using a density evolution analysis algorithm or the like.

The controller 1210 controls the LDPC decoder 1240 to transmit a suitable shortening pattern to the decoder 1240 in accordance with the modulation scheme and the information word length, Since the probability that the value of the bit is 0 is 1 (i.e., 100%), it is possible to prevent the shortened bits in the operation of the LDPC decoder 1240 from participating in the operation of the LDPC decoder 1240, 1 to determine whether to participate in decryption.

When the length of the DVB-S2 LDPC code shortened by the shortening pattern determination or estimation unit 1220 is known, the LDPC decoder 1240 restores desired data from the received signal.

In particular, FIG. 13 is a block diagram of a receiving apparatus using an LDPC code to which the shortening and puncturing are applied according to the embodiment of the present invention.

FIG. 13 is a diagram in which the shortening, puncturing pattern judging or estimating unit 1320 is substituted for the shortening pattern judging or estimating unit 1220 of the receiving apparatus of FIG.

Referring to FIG. 13, in the case where both the short axis and the perforation are applied in the transmitting apparatus, the short axis and puncturing pattern determination or estimation unit 1320 may first perform pattern determination or estimation on the short axis in the receiving apparatus, Judgment or estimation may be performed first, or a pattern judgment or estimation for shortening and a pattern judgment or estimation for puncturing may occur at the same time.

In addition, the LDPC decoder 1240 can simultaneously decode the information about the shortening and puncturing.

14 is a flowchart illustrating a receiving operation in a receiving apparatus according to an embodiment of the present invention.

The demodulator 1230 receives and demodulates the shortened LDPC code in step 1401. The shortening pattern determination or estimation unit 1220 determines or estimates a shortening / puncturing pattern from the signal demodulated in step 1403.

The shortening pattern determination or estimation unit 1220 determines in step 1405 whether there is a shortened or punctured bit.

If there is no shortened or punctured bit, the LDPC decoder 1240 performs decoding in step 1411. [ However, if there is a shortened or punctured bit, the shortening pattern determination or estimation unit 1220 transfers the location information of the shortened / punctured bit to the LDPC decoder 1240 in step 1407.

In step 1409, the LDPC decoder 1240 determines that the value of the shortened bit is 0 and the punctured bit is the erased bit based on the position information of the shortened / punctured bit, LDPC decoding is performed.

Claims (8)

A channel coding method in a system using a low density parity check code,
Dividing information bits into a plurality of bit groups;
Determining a number of information bits to be shortened;
Determining a number of bit groups to be shortened based on the determined number of information bits to be shortened;
Shortening information bits of the determined bit group according to a predetermined order; And
And encoding the shortened information bits,
Further comprising the step of determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
A step of shortening a corresponding information bit from a 0th bit group to an (m-1) th bit group according to the predetermined order; And
Further comprising the step of shortening (7200-K ₂ -360m) information bits in the m-th bit group according to the predetermined order,
K ₂ is the number of information bits that can be obtained by the shortening, and (7200-K ₂ ) The number of information bits to be shortened,

ego,
The order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 15, and 14 (16-QAM), the codeword length is 16200 and the length of the information bits is 7200, , 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit does not take a short axis. In a channel coding apparatus in a system using a low-density parity-check code,
Determining a number of information bits to be shortened, determining a number of bit groups to be shortened based on the determined number of information bits to be shortened, A shortening pattern applying unit for shortening information bits of a bit group; And
And an encoder for encoding the shortened information bits,
The shortening pattern application unit determines a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
Wherein the shortening pattern application unit shortens the information bits from the 0th bit group to the (m-1) th bit group according to the predetermined order, and updates the (7200-K ₂ -360m) Information bits are shortened,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of information bits to be shortened,

ego,
The order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 15, and 14 (16-QAM), the codeword length is 16200 and the length of the information bits is 7200, , 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened. A channel coding method in a system using a low density parity check code,
Dividing information bits into a plurality of bit groups;
Determining a number of information bits to be shortened;
Determining a number of bit groups to be shortened based on the determined number of information bits to be shortened;
Shortening information bits of the determined bit group according to a predetermined order; And
And encoding the shortened information bits,
Further comprising the step of determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
A step of shortening a corresponding information bit from a 0th bit group to an (m-1) th bit group according to the predetermined order; And
Further comprising the step of shortening (7200-K ₂ -360m) information bits in the m-th bit group according to the predetermined order,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of information bits to be shortened,

ego,
The order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 4, and 15 (64-QAM), the codeword length is 16200, , 14, 13, 12, 3, 11, 10, 9, 2, 8, 7, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit does not take a short axis. In a channel coding apparatus in a system using a low-density parity-check code,
Determining a number of information bits to be shortened, determining a number of bit groups to be shortened based on the determined number of information bits to be shortened, A shortening pattern applying unit for shortening information bits of a bit group; And
And an encoder for encoding the shortened information bits,
The shortening pattern application unit determines a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
Wherein the shortening pattern determination unit shortens the information bits from the 0th bit group to the (m-1) th bit group according to the predetermined order, and updates the information bits in the (7200-K ₂ -360m) Information bits are shortened,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of information bits to be shortened,

ego,
The order of the bit groups to be shortened based on the predetermined order is 18, 17, 16, 4, and 15 (64-QAM), the codeword length is 16200, , 14, 13, 12, 3, 11, 10, 9, 2, 8, 7, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened. A channel decoding method in a system using a low density parity check code,
Demodulating the received signal;
Determining a number of shortened information bits;
Determining a number of shortened bit groups in the plurality of bit groups based on the number of the shortened information bits;
Obtaining an order of a predetermined bit group;
Determining location information of the information bit based on the order of the predetermined bit group; And
And decoding the data considering the position information of the determined shortened information bit,
Further comprising the step of determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of said shortened information bits,
Determining that a corresponding information bit from the 0th bit group to the (m-1) th bit group is shortened according to the order of the predetermined bit group; And
The pre-determined according to the order of the group of bits and further comprising the step of determining to be a m-th bit in the group (7200-K ₂ -360m) information bit speed,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of shortened information bits,

ego,
The order of the shortened bit groups based on the order of the predetermined bit groups is 18, 17, 16, 16, and 16, when the length of the information bits is 1600, the codeword length is 16200, and the order of the predetermined bit groups is 16: QAM (quadrature amplitude modulation) 15, 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened. In a channel decoding apparatus in a system using a low-density parity-check code,
A demodulator for demodulating the received signal;
Determining the number of shortened information bits, determining the number of shortened bit groups in the plurality of bit groups based on the number of shortened information bits, obtaining a sequence of predetermined bit groups, A short pattern determining unit for determining position information of the shortened information bit based on the order of the groups; And
And a decoder for decoding the data in consideration of the determined location information of the shortened information bit,
Wherein the shortening pattern determination section includes determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
Wherein the shortening pattern determination unit determines that the corresponding information bits from the 0th bit group to the (m-1) th bit group are shortened according to the order of the predetermined bit group, a second group of bits in the (7200-K ₂ -360m) information bit determines that the speed,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of shortened information bits,

ego,
The order of the shortened bit groups based on the order of the predetermined bit groups is 18, 17, 16, 16, and 16, when the length of the information bits is 1600, the codeword length is 16200, and the order of the predetermined bit groups is 16: QAM (quadrature amplitude modulation) 15, 14, 13, 12, 11, 4, 10, 9, 8, 7, 3, 2, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened. A channel decoding method in a system using a low density parity check code,
Demodulating the received signal;
Determining a number of shortened information bits;
Determining a number of shortened bit groups in the plurality of bit groups based on the number of the shortened information bits;
Obtaining an order of a predetermined bit group;
Determining location information of the information bit based on the order of the predetermined bit group; And
And decoding the data considering the position information of the determined shortened information bit,
Further comprising the step of determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of said shortened information bits,
Determining that a corresponding information bit from the 0th bit group to the (m-1) th bit group is shortened according to the order of the predetermined bit group; And
The pre-determined according to the order of the group of bits and further comprising the step of determining to be a m-th bit in the group (7200-K ₂ -360m) information bit speed,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of shortened information bits,

ego,
The order of the shortened bit groups based on the order of the predetermined bit groups is 18, 17, 16, and 16, when the length of the information bits is 6400 and the length of the information bits is 16,200, 64-QAM (quadrature amplitude modulation) 4, 15, 14, 13, 12, 3, 11, 10, 9, 2, 8, 7, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened. In a channel decoding apparatus in a system using a low-density parity-check code,
A demodulator for demodulating the received signal;
Determining the number of shortened information bits, determining the number of shortened bit groups in the plurality of bit groups based on the number of shortened information bits, obtaining a sequence of predetermined bit groups, A short pattern determining unit for determining position information of the shortened information bit based on the order of the groups; And
And a decoder for decoding the data in consideration of the determined location information of the shortened information bit,
Wherein the shortening pattern determination section includes determining a number of information bits (K ₂ ) that can be obtained by shortening to determine the number of information bits to be shortened,
Wherein the shortening pattern determination unit determines that the corresponding information bits from the 0th bit group to the (m-1) th bit group are shortened according to the order of the predetermined bit group, a second group of bits in the (7200-K ₂ -360m) information bit determines that the speed,
K ₂ is the number of information bits that can be obtained by the shortening, (7200-K ₂ ) is the number of shortened information bits,

ego,
The order of the shortened bit groups based on the order of the predetermined bit groups is 18, 17, 16, and 16, when the length of the information bits is 6400 and the length of the information bits is 16,200, 64-QAM (quadrature amplitude modulation) 4, 15, 14, 13, 12, 3, 11, 10, 9, 2, 8, 7, 1, 6, 5, 19,
Wherein one of the plurality of bit groups includes a bose-chaudhuri-hocquenghem (BCH) parity bit, and the BCH parity bit is not shortened.

Images