EP2381582B1 - Method and apparatus for channel encoding in a communication system using low-density parity-check codes - Google Patents

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention
• The present invention relates generally to a communication system using Low-Density Parity-Check (LDPC) codes, and in particular, to a channel encoding/decoding method and apparatus for generating LDPC codes having various codeword lengths and code rates from a given LDPC code.
2. Description of the Related Art
• In wireless communication systems, the link performance significantly decreases due to various noises in channels, a fading phenomenon, and Inter-Symbol Interference (ISI). Therefore, in order to realize high-speed digital communication systems requiring high data throughput and reliability, such as the next-generation mobile communication, digital broadcasting, and portable internet, it is necessary to develop a technology for eliminating noise, fading, and ISI. Recently, an intensive study of an error-correcting code has been conducted as a method for increasing communication reliability by efficiently recovering distorted information.
• An LDPC code, first introduced by Gallager in 1960s, has lost favor over time due to its implementation complexity which could not be resolved by the technology at that time. However, as the turbo code, which was discovered by Berrou, Glavieux, and Thitimajshima in 1993, shows the performance approximating Shannon's channel limit, research has been conducted on iterative decoding and channel encoding based on a graph along with analyses on performance and characteristic of the turbo code. Due to this research, the LDPC code was restudied in the late 1990s, and proved that LDPC code has performance approximating the Shannon's channel limit if it undergoes decoding by applying iterative decoding based on a sum-product algorithm on a Tanner graph (a special case of a factor graph) corresponding to the LDPC code.
• The LDPC code is typically represented using a graph representation technique, and many characteristics can be analyzed through the methods based on graph theory, algebra, and probability theory. Generally, a graph model of channel codes is useful for description of codes, and by mapping information on encoded bits to vertexes in the graph and mapping relations between the bits to edges in the graph, it is possible to consider a communication network in which the vertexes exchange predetermined messages through the edges, thus making it possible to derive a natural decoding algorithm. For example, a decoding algorithm derived from a trellis, which can be regarded as a kind of graph, can include the well-known Viterbi algorithm and a Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm.
• US 2007/0162814 A1 discloses an apparatus and method of an LDPC encoding system, referring to encoding and decoding within a communication system.
• The LDPC code is generally defined as a parity-check matrix, and can be represented using a bipartite graph, which is referred to as a Tanner graph. The bipartite graph means that vertexes constituting the graph are divided into two different types, and the LDPC code is represented with the bipartite graph composed of vertexes, some of which are called variable nodes and the other of which are called check nodes. The variable nodes are one-to-one mapped to the encoded bits.
• With reference to FIGs. 1 and 2, a description will be made of a graph representation method for the LDPC code.
• FIG. 1 shows an example of a parity-check matrix H₁ of the LDPC code composed of 4 rows and 8 columns. Referring to FIG. 1, since the number of columns is 8, the parity-check matrix H₁ means an LDPC code that generates a length-8 codeword, and the columns are mapped to 8 encoded bits.
• FIG. 2 is a diagram illustrating a Tanner graph corresponding to H₁ of FIG. 1.
• Referring to FIG. 2, the Tanner graph of the LDPC code is composed of 8 variable nodes x₁ (202), x₂ (204), x₃ (206), x₄ (208), x₅ (210), x₆ (212), x₇ (214) and x₈ (216), and 4 check nodes 218, 220, 222 and 224. An i^th column and a j^th row in the parity-check matrix H₁ of the LDPC code are mapped to a variable node x_i and a j^th check node, respectively. In addition, a value of 1, i.e., a non-zero value, at the point where an i^th column and a j^th row in the parity-check matrix H₁ of the LDPC code cross each other, means that there is an edge between the variable node x_i and the j^th check node on the Tanner graph of FIG. 2.
• In the Tanner graph of the LDPC code, a degree of the variable node and a check node means the number of edges connected to each respective node, and the degree is equal to the number of non-zero entries in a column or row corresponding to the associated node in the parity-check matrix of the LDPC code. For example, in FIG. 2, degrees of the variable nodes x₁ (202), x₂ (204), x₃ (206), x₄ (208), x₅ (210), x₆ (212), x₇ (214) and x₈ (216) are 4, 3, 3, 3, 2, 2, 2 and 2, respectively, and degrees of check nodes 218, 220, 222 and 224 are 6, 5, 5 and 5, respectively. In addition, the numbers of non-zero entries in the columns of the parity-check matrix H₁ of FIG. 1, which correspond to the variable nodes of FIG. 2, are coincident with their degrees 4, 3, 3, 3, 2, 2, 2 and 2, and the numbers of non-zero entries in the rows of the parity-check matrix H₁ of FIG. 1, which correspond to the check nodes of FIG. 2, are coincident with their degrees 6, 5, 5 and 5.
• In order to represent degree distribution for the nodes of the LDPC code, a ratio of the number of degree-i variable nodes to the total number of variable nodes is defined as f_i, and a ratio of the number of degree-j check nodes to the total number of check nodes is defined as g_j. For example, for the LDPC code corresponding to FIGs. 1 and 2, f₂=4/8, f₃=3/8, f₄=1/8, and f_i=0 for i≠2, 3, 4; and g₅=3/4, g₆=1/4, and g_j=0 for j≠5, 6. When a length of the LDPC code is defined as N, i.e., the number of columns is defined as N, and when the number of rows is defined as N/2, the density of non-zero entries in the entire parity-check matrix having the above degree distribution is computed as Equation (1). $$\frac{2{\mathrm{<figure-callout\; id="2"\; label="f"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">f</figure-callout>}}_{2}N+3{\mathrm{<figure-callout\; id="3"\; label="f"\; filenames="imgf0003.png"\; state="\{\{state\}\}">f</figure-callout>}}_{3}N+4{\mathrm{<figure-callout\; id="4"\; label="f"\; filenames="imgf0003.png,imgf0005.png"\; state="\{\{state\}\}">f</figure-callout>}}_{4}N}{N\cdot N/2}=\frac{5.25}{N}$$

  
• In Equation (1), as N increases, the density of '1's in the parity-check matrix decreases. Generally, as for the LDPC code, since the code length N is inversely proportional to the density of non-zero entries, the LDPC code with a large N has a very low density. The wording 'low-density' in the name of the LDPC code originates from the above-mentioned relationship.
• Next, with reference to FIG. 3, a description will be made of characteristics of a parity-check matrix of a structured LDPC code to be applied in the present invention. FIG. 3 schematically illustrates an LDPC code adopted as the standard technology in DVB-S2, which is one of the European digital broadcasting standards.
• In FIG. 3, N₁ denotes a length of an LDPC codeword, K ₁ provides a length of an information word, and (N ₁-K ₁) provides a parity length. Further, M ₁ and q are determined to satisfy q=(N₁-K₁ )/M₁. Preferably, K ₁/M ₁ should be an integer. For convenience, the parity-check matrix of FIG. 3 is called a first parity-check matrix H₁.
• Referring again to FIG. 3, a structure of a parity part, i.e., K ₁ ^th column through (N ₁-1)^th column, in the parity-check matrix, has a dual diagonal shape. Therefore, as for degree distribution over columns corresponding to the parity part, all columns have a degree '2', except for the last column having a degree '1'.
• In the parity-check matrix, a structure of an information part, i.e., 0^th column through (K ₁-1)^th column, is made using the following rules.
• Rule 1: It generates a total of K ₁/M ₁ column groups by grouping K ₁ columns corresponding to the information word in the parity-check matrix into multiple groups of M ₁ columns.. A method for forming columns belonging to each column group follows Rule 2 below.
• Rule 2: It first determines positions of '1's in each 0^th column in i ^th column groups (where i=1,...,K₁/M₁). When a degree of a 0^th column in each i ^th column group is denoted by D_i , if positions of rows with 1 are assumed to be $R_{i,0}^{\left(1\right)}=R_{i,0}^{\left(2\right)},\dots ,R_{i,0}^{\left(D\right)},$

  

  positions $R_{i,j}^{\left(k\right)}\left(\mathrm{k}=1,2,\dots ,{\mathrm{D}}_i\right)$

  

  of rows with 1 are defined as Equation (2), in a j ^th column (where j=1,2,...,M ₁-1) in an i ^th column group. $$\begin{array}{l}{R}_{i,j}^{\left(k\right)}=\left\{R_{i,\left(j-1\right)}^{\left(k\right)}+q\right\}\mathrm{mod}\left(N_1-K_1\right),\\ k=1,2,\dots ,D_i,i=1,\dots ,{\mathrm{<figure-callout\; id="1"\; label="K"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">K</figure-callout>}}_1/{\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">M</figure-callout>}}_1,j=1,\dots ,M_1-1\end{array}$$

  
• According to the above rules, it is can be appreciated that degrees of columns belonging to an i ^th column group are all equal to D_i . For a better understanding of a structure of a DVB-S2 LDPC code that stores information on the parity-check matrix according to the above rules, the following detailed example will be described.
• As a detailed example, for N ₁=30, K ₁=15, M ₁=5 and q=3, three sequences for the information on the position of rows with 1 (hereafter, these sequences are called "Weight-1 Position Sequences" for convenience' sake) for 0^th columns in 3 column groups can be expressed as; $${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(1\right)}=0,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(2\right)}=1,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(3\right)}=2,$$

  

  $${\mathrm{<figure-callout\; id="2"\; label="R"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{2,0}^{\left(1\right)}=0,{\mathrm{<figure-callout\; id="2"\; label="R"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{2,0}^{\left(2\right)}=11,{\mathrm{<figure-callout\; id="2"\; label="R"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{2,0}^{\left(3\right)}=13,$$

  

  $${\mathrm{<figure-callout\; id="3"\; label="R"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{3,0}^{\left(1\right)}=0,{\mathrm{<figure-callout\; id="3"\; label="R"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{3,0}^{\left(2\right)}=10,{\mathrm{<figure-callout\; id="3"\; label="R"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{3,0}^{\left(3\right)}=14.$$

  
• Regarding the weight-1 position sequence for 0^th columns in each column group, only the corresponding position sequences can be expressed as follows for each column group, for convenience' sake. For example:
• 0 1 2
• 0 11 13
• 0 10 14.
• In other words, the i ^th weight-1 position sequence in the i ^th line sequentially represents the information on the position of rows with 1 for the i ^th column group.
• It is possible to generate an LDPC code having the same concept as that of a DVB-S2 LDPC code of FIG. 4, by forming a parity-check matrix using the information corresponding to the detailed example, and Rule 1 and Rule 2.
• It is known that the DVB-S2 LDPC code designed in accordance with Rule 1 and Rule 2 can be efficiently encoded using the structural shape. A process of performing LDPC encoding using the DVB-S2 based parity-check matrix will be described below by way of example.
• In the following exemplary description, as a detailed example, a DVB-S2 LDPC code with N ₁=16200, K ₁=10800, M ₁=360 and q=15 undergoes an encoding process. For convenience, information bits having a length K ₁ are represented as (i ₀,i ₁,...,i _K1-1), and parity bits having a length (N ₁ -K ₁) are expressed as (p ₀, p ₁,..., p _N1 -_K1-1).
• Step 1: An encoder initializes parity bits as follows: $${\mathrm{<figure-callout\; id="0"\; label="p"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">p</figure-callout>}}_0={\mathrm{<figure-callout\; id="1"\; label="p"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">p</figure-callout>}}_1=\dots =p_{N_1-K_1-1}=0$$

  
• Step 2: The encoder reads information on a row where 1 is located within the first column group of an information word, from the 0^th weight-1 position sequence of the stored sequences indicating the parity-check matrix.
  0 2084 1613 1548 1286 1460 3196 4297 2481 3369 3451 4620 2622 $${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(1\right)}=0,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(2\right)}=2048,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(3\right)}=1613,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(4\right)}=1548,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(5\right)}=1286,$$

  

  $${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(6\right)}=1460,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(7\right)}=3196,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(8\right)}=4297,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(9\right)}=2481,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(10\right)}=3369,$$

  

  $${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(11\right)}=3451,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(12\right)}=4620,{\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>\; </figure-callout>}}_{1,0}^{\left(13\right)}=2622.$$

  
• The encoder updates particular parity bits p_x in accordance with Equation (3) using the read information and the first information bit i ₀. Herein, x means a value of ${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>}}_{1,0}^{\left(k\right)}$

  

  for k =1,2,...,13. $$\begin{array}{l}{\mathrm{<figure-callout\; id="0"\; label="p"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">p</figure-callout>}}_0={\mathrm{<figure-callout\; id="0"\; label="p"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">p</figure-callout>}}_0\oplus {\mathrm{<figure-callout\; id="0"\; label="i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">i</figure-callout>}}_0,p_{2064}=p_{2064}\oplus i_0,p_{1613}=p_{1613}\oplus i_0,\\ p_{1548}=p_{1548}\oplus i_0,p_{1286}=p_{1286}\oplus i_0,p_{1460}=p_{1460}\oplus i_0,\\ p_{3196}=p_{3196}\oplus i_0,p_{4297}=p_{4297}\oplus i_0,p_{2481}=p_{2481}\oplus i_0,\\ p_{3369}=p_{3369}\oplus i_0,p_{3451}=p_{3451}\oplus i_0,p_{4620}=p_{4620}\oplus i_0,\\ p_{2622}=p_{2622}\oplus {\mathrm{<figure-callout\; id="0"\; label="i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">i</figure-callout>}}_0\end{array}$$

  
• In Equation (3), p_x = p_x ⊕ i ₀ can also be expressed as p_x ← p_x ⊕ i ₀ and ⊕ means binary addition.
• Step 3: The encoder first finds out a value of Equation (4) for the next 359 information bits i_m (where m=1, 2, ..., 359) after i ₀. $$\left\{x+\left(m\mathrm{<figure-callout\; id="1"\; label="mod\; \; M"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">mod</figure-callout>}{M}_{}{}_1\right)\times q\right\}\mathrm{mod}\left(N_1-{\mathrm{<figure-callout\; id="1"\; label="K"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">K</figure-callout>}}_1\right),{\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">M</figure-callout>}}_1=360,m=1,2,,\dots ,359$$

  
• In Equation (4), x means a value of ${\mathrm{<figure-callout\; id="1"\; label="R"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">R</figure-callout>}}_{1,0}^{\left(k\right)}$

  

  for k =1,2,...,13 . It should be noted that Equation (4) has the same concept as Equation (2).
• Next, the encoder performs an operation similar to Equation (3) using the value found in Equation (4). That is, the encoder updates P _{{x+(m mod M1)×q) mod (N1-K1)} for i_m . For example, for m=1, i.e., for i ₁, the encoder updates parity bits P _{(x+q)mod(N 1 -K 1)} as defined in Equation (5). $$\begin{array}{l}{\mathrm{<figure-callout\; id="15"\; label="p"\; filenames="imgf0003.png"\; state="\{\{state\}\}">p</figure-callout>}}_{15}={\mathrm{<figure-callout\; id="15"\; label="p"\; filenames="imgf0003.png"\; state="\{\{state\}\}">p</figure-callout>}}_{15}\oplus {\mathrm{<figure-callout\; id="1"\; label="i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">i</figure-callout>}}_1,p_{2099}=p_{2099}\oplus i_1,p_{1628}=p_{1628}\oplus i_1,\\ p_{1563}=p_{1548}\oplus i_1,p_{1301}=p_{1301}\oplus i_1,p_{1475}=p_{1475}\oplus i_1,\\ p_{3211}=p_{3196}\oplus i_1,p_{4312}=p_{4312}\oplus i_1,p_{2496}=p_{2496}\oplus i_1,\\ p_{3384}=p_{3384}\oplus i_1,p_{3466}=p_{3466}\oplus i_1,p_{4635}=p_{4635}\oplus i_1,\\ p_{2637}=p_{2637}\oplus {\mathrm{<figure-callout\; id="1"\; label="i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">i</figure-callout>}}_1\end{array}$$

  
• It should be noted that q=15 in Equation (5). The encoder performs the above process for m=1, 2, ..., 359, in the same manner as shown above.
• Step 4: As in Step 2, the encoder reads information of ${\mathrm{<figure-callout\; id="2"\; label="R"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">R</figure-callout>}}_{2,0}^{\left(K\right)}\left(k=1,2,\dots ,13\right),$

  

  the 1^st weight-1 position sequence, for a 361^st information bit i ₃₆₀, and updates particular p_x , where x means ${\mathrm{<figure-callout\; id="2"\; label="R"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">R</figure-callout>}}_{2,0}^{\left(k\right)}\mathrm{.}$

  

  The encoder updates P _{{x+(m mod M1)×q} mod(N1-K1)}, _{m=361,362,...,719} by similarly applying Equation (4) to the next 359 information bits i ₃₆₁, i ₃₆₂, ..., i ₇₁₉ after i ₃₆₀.
• Step 5: The encoder repeats Steps 2, 3 and 4 for all groups each having 360 information bits.
• Step 6: The encoder finally determines parity bits using Equation (6). $$p_i=p_i\oplus p_{i-1},i=1,2,\dots ,N_1-k_1-1$$

  
• The parity bits p_i of Equation (6) are parity bits that underwent LDPC encoding.
• As described above, DVB-S2 performs encoding through the process of Step 1 through Step 6.
• In order to apply the LDPC code to the actual communication system, the LDPC code should be designed to be suitable for the data rate required in the communication system. Particularly, not only in an adaptive communication system employing a Hybrid Automatic Retransmission Request (HARQ) scheme and an Adaptive Modulation and Coding (AMC) scheme, but also in a communication system supporting various broadcast services, LDPC codes having various codeword lengths are needed to support various data rates according to the system requirements.
• However, as described above, the LDPC code used in the DVB-S2 system has only two types of codeword lengths due to its limited use, and each type of the LDPC code needs an independent parity-check matrix. For these reasons, there is a long-felt need in the art for a method for supporting various codeword lengths to increase extendibility and flexibility of the system. Particularly, in the DVB-S2 system, transmission of data comprising several hundreds to thousands of bits is needed for transmission of signaling information. However, since only 16200 and 64800 are available for a length of the DVB-S2 LDPC code, it is necessary to support various codeword lengths.
• In addition, since storing independent parity-check matrix separately for each codeword length of the LDPC code reduces the overall memory efficiency, there is a demand for a scheme capable of efficiently supporting various codeword lengths from the given existing parity-check matrix, without designing a new parity-check matrix.
SUMMARY OF THE INVENTION
• The invention provides a method according to claim 1 and an apparatus according to claim 2.
• An exemplary aspect of the present invention is to provide a channel encoding method and apparatus for generating LDPC codes having different codeword lengths from a given LDPC code, using shortening or puncturing in a communication system using LDPC codes.
• Another exemplary aspect of the present invention is to provide a channel encoding method and apparatus for guaranteeing the optimal performance with regard to DVB-S2 architecture in a communication system using LDPC codes.
• According to an exemplary aspect of the present invention, there is provided a method for a channel encoding in a communication system using a Low-Density Parity-Check (LDPC) code. The method may include, for example, generating a plurality of column groups by grouping columns corresponding to an information word in a parity-check matrix of the LDPC code, and ordering the column groups; determining a range of an information word desired to be obtained by performing shortening; based on the determined range of the information word, performing column group-by-column group shortening on the column groups in order according to a predetermined shortening pattern; and LDPC encoding the shortened information word.
• According to another exemplary aspect of the present invention, there is provided a method for a channel encoding in a communication system using a Low-Density Parity-Check (LDPC) code. The method may include generating a plurality of column groups by grouping columns corresponding to an information word in a parity-check matrix of the LDPC code, and ordering the column groups; determining a range of an information word desired to be obtained by performing shortening; based on the determined range of the information word, performing column group-by-column group shortening on the column groups in order according to a predetermined shortening pattern; and LDPC encoding the shortened information word; wherein performing column group-by-column group shortening comprises including 168 Bose-Chaudhuri-Hocquenghem (BCH) parity bits in an information word desired to be obtained by performing shortening, and shortening columns except for columns in positions corresponding to the 168 BCH parity bits.
• According to still another exemplary aspect of the present invention, there is provided an apparatus for a channel encoding in a communication system using a Low-Density Parity-Check (LDPC) code. The apparatus includes a parity-check matrix extractor for generating a plurality of column groups by grouping columns corresponding to an information word in a parity-check matrix of the LDPC code, and ordering the column groups; a shortening pattern applier for determining a range of an information word desired to be obtained by performing shortening, and based on the determined range of the information word, performing column group-by-column group shortening on the column groups in order according to a predetermined shortening pattern; and an encoder for LDPC encoding the shortened information word.
• According to yet another exemplary aspect of the present invention, there is provided an apparatus for a channel encoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code. The apparatus includes a parity-check matrix extractor for generating a plurality of column groups by grouping columns corresponding to an information word in a parity-check matrix of the LDPC code, and ordering the column groups; a shortening pattern applier for determining a range of an information word desired to be obtained by performing shortening, and based on the determined range of the information word, and for performing column group-by-column group shortening on the column groups in order according to a predetermined shortening pattern; and an encoder for LDPC encoding the shortened information word; wherein in performing column group-by-column group shortening, the shortening pattern applier includes, for example, 168 Bose-Chaudhuri-Hocquenghem (BCH) parity bits in an information word desired to be obtained by performing shortening, and by shortening columns except for columns in positions corresponding to the 168 BCH parity bits.
• According to still another exemplar aspect not being part of the present invention but provided for better understanding, there is provided a method for decoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code. The method includes, for example, demodulating a signal transmitted from a transmitter; determining a position of a shortened bit by estimating information on a shortening pattern of an LDPC code from the demodulated signal; and decoding data using the determined position of the shortened bit.
• According to even still another exemplary aspect not being part of the present invention but provided for better understanding, there is provided an apparatus for decoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code. The apparatus includes, for example, a demodulator for demodulating a signal transmitted from a transmitter; a shortening pattern determiner for determining a position of a shortened bit by estimating information on a shortening pattern of an LDPC code from the demodulated signal; and a decoder for decoding data using the determined position of the shortened bit.
• According to even still another exemplary aspect of the present invention, there is provided a method for reading parity check matrix information; determining a length K₂, where K₂ denotes a length of information bits to be obtained by shortening, wherein the information bits include 168 BCH parity bits; based on the length K₂, performing shortening on information bits in an order according to a predetermined shortening pattern defined in the following table.
• According to even still another exemplary aspect of the present invention, there is provided an apparatus for a parity-check matrix extractor for reading parity check matrix information; a shortening pattern applier for determining a length K2, where K2 denotes a length of information bits to be obtained by shortening, wherein the information bits include 168 BCH parity bits, and based on the length K2, performing shortening on information bits in an order according to a predetermined shortening pattern defined in the following table.
BRIEF DESCRIPTION OF THE DRAWINGS
• The above and other aspects, features and advantages of the present invention will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which:
• FIG. 1 is a diagram illustrating an exemplary parity-check matrix of a length-8 LDPC code;
• FIG. 2 is a diagram illustrating a Tanner graph for an exemplary parity-check matrix of a length-8 LDPC code;
• FIG. 3 is a diagram illustrating a schematic structure of a DVB-S2 LDPC code;
• FIG. 4 is a diagram illustrating an exemplary parity-check matrix of a DVB-S2 LDPC code;
• FIG. 5 is a block diagram illustrating a structure of a transceiver in a communication system using LDPC codes;
• FIG. 6 is a flowchart illustrating a process of generating an LDPC code having a different codeword length from a parity-check matrix of a stored LDPC code according to an exemplary embodiment of the present invention;
• FIG. 7 is a block diagram illustrating a structure of a transmission apparatus using shortened LDPC codes according to an embodiment of the present invention;
• FIG. 8 is a block diagram illustrating a structure of a transmission apparatus using shortened/punctured LDPC codes according to an exemplary embodiment of the present invention;
• FIG. 9 is a block diagram illustrating a structure of a reception apparatus using LDPC codes to which shortening is applied, according to an illustrative example;
• FIG. 10 is a block diagram illustrating a structure of a reception apparatus using LDPC codes to which shortening and puncturing are both applied, according to illustrative example ; and
• FIG. 11 is a flowchart illustrating a reception operation in a reception apparatus according to an illustrative example.
• Throughout the drawings, the same drawing reference numerals will be understood to refer to the same elements, features and structures.
DETAILED DESCRIPTION
• Preferred exemplary embodiments of the present invention will now be described in detail with reference to the annexed drawings. In the following description, a detailed description of known functions and exemplary configurations incorporated herein may have been omitted for clarity and conciseness when their inclusion might obscure appreciation of the invention by a person of ordinary skill in the art.
• The present invention provides a method for supporting LDPC codes having various codeword lengths using a parity-check matrix of a structured LDPC code of a particular type. In addition, the present invention provides an apparatus for supporting various codeword lengths in a communication system using LDPC codes of a particular type, and a method for controlling the same. Particularly, the present invention provides a method and apparatus for generating an LDPC code using a parity-check matrix of a given LDPC code, the generated LDPC code being shorter in length than the given LDPC code.
• FIG. 5 is a block diagram illustrating a structure of a transceiver in a communication system using LDPC codes.
• Referring to FIG. 5, a message u is input to an LDPC encoder 511 in a transmitter 510 before being transmitted to a receiver 530. Then the LDPC encoder 511 encodes the input message u, and outputs the encoded signal to a modulator 513. The modulator 513 modulates the encoded signal, and transmits the modulated signal to the receiver 530 over a wireless channel 520. Then a demodulator 531 in the receiver 530 demodulates the signal transmitted by the transmitter 510, and outputs the demodulated signal to an LDPC decoder 533. Then the LDPC decoder 533 estimates an estimation value u of the message based on the data received through the wireless channel 520.
• The LDPC encoder 511 generates a parity-check matrix according to a codeword length required by a communication system, using a preset scheme. Particularly, according to the present invention, the LDPC encoder 511 can support various codeword lengths using the LDPC code without the separate need for additional storage information. A detailed operation of the LDPC encoder for supporting various codeword lengths will be described in detail below with reference to FIG. 6.
• FIG. 6 is a flowchart illustrating an encoding operation of an LDPC encoder according to an exemplary embodiment of the present invention. To be specific, FIG. 6 illustrates a method for generating LDPC codes having different codeword lengths from a parity-check matrix of a previously stored LDPC code.
• Herein, the method of supporting various codeword lengths uses a shortening technique and a puncturing technique.
• The term 'shortening technique' as used herein means a method that does not substantially use a specified part of a given particular parity-check matrix. For a better understanding of the shortening technique, a parity-check matrix of the DVB-S2 LDPC code shown in FIG. 3 will be described in detail.
• Referring now to the parity-check matrix of the DVB-S2 LDPC code shown in FIG. 3, its total length is N ₁, the leading part corresponds to length-K ₁ information bits (i ₀, i ₁,..., i _{K 1-1}), and the rear part corresponds to length-(N ₁-K ₁) parity bits (p ₀ , p ₁,..., p_N1-K1-1 ). Commonly, the information bits freely have a value of 0 or 1, and the shortening technique limits values of information bits of a particular part which is to be subjected to shortening. For example, shortening N_s information bits i ₀ through i _Ns-1 commonly means that i ₀ = i ₁= ... = i _{Ns -1}. In other words, by limiting values for N_s information bits i₀ through i _{Ns -1}, to 0, the shortening technique can obtain the same effect as substantially not using N_s leading columns in the parity-check matrix of the DVB-S2 LDPC code shown in FIG. 3. The term 'shortening technique' originates from the above-stated limitation operation. Therefore, applying the shortening herein means considering values of the shortened information bits, as 0.
• With respect to the shortening technique, when the system is set up, a transmitter and a receiver can share or generate the same position information for the shortened information bits. Therefore, though the transmitter has not transmitted the shortened bits, the receiver performs decoding, knowing that information bits in the positions corresponding to the shortened bits have a value of 0.
• In the shortening technique, since a length of a codeword that the transmitter actually transmits is N ₁ -N_s and a length of an information word is also K₁-N _s, the code rate becomes (K ₁ - N _s)/N ₁ - N_s ), which is always less than the first given code rate K ₁/N ₁ .
• Next, the puncturing technique will be described in detail. Generally, the puncturing technique can be applied to both the information bits and parity bits. Although the puncturing technique and the shortening technique are in common in reducing codeword lengths of codes, the puncturing technique, unlike the shortening technique, described herein above, does not have the concept that limits values of particular bits. The puncturing technique is a method for simply not transmitting particular information bits or a particular part of generated parity bits, so that a receiver can perform erasure processing on the corresponding bits. In other words, by simply not transmitting bits in N_p predefined positions in a generated length-N ₁ LDPC codeword, the puncturing technique can obtain the same effect as transmitting a length-(N ₁-N_p ) LDPC codeword. Since columns corresponding to the bits punctured in the parity-check matrix are all used intact in a decoding process, the puncturing technique is different from the shortening technique.
• Since, according to the invention position information for the punctured bits can be equally shared or estimated by the transmitter and the receiver when the system is set up, the receiver performs erasure processing on the corresponding punctured bits, before performing decoding.
• In the puncturing technique, since a length of a codeword that the transmitter actually transmits is N₁-N_p and a length of an information word is K ₁ constantly, the code rate becomes K₁ /(N₁-N_p), which is always greater than the first given code rate K₁ /N₁.
• A description will now be made of the exemplary shortening technique and the exemplary puncturing technique suitable for the DVB-S2 LDPC code. The DVB-S2 LDPC code, as mentioned above, is a kind of an LDPC code having a particular structure. Therefore, compared with the normal LDPC code, the DVB-S2 LDPC code can undergo more efficient shortening and puncturing.
• For convenience of this example, assume that a codeword length and an information length of an LDPC code are N ₂ and K ₂, respectively that the invention desires to finally obtain from the DVB-S2 LDPC code whose codeword length and information length are N ₁ and K ₁, respectively, using the shortening technique and the puncturing technique. If N ₁ -N ₂= N_Δ and K ₁-K ₂₌ K _Δ, it is possible to generate the LDPC code whose codeword length and information length are N ₂ and K ₂, respectively, by shortening K _Δ bits and puncturing (N _Δ-K _Δ) bits from the parity-check matrix of the DVB-S2 LDPC code. For the generated LDPC code with N _Δ>0 or K _Δ>0, since its code rate K ₁-K _Δ/N ₁-N _Δ is generally different from the code rate K₁ /N₁ of the DVB-S2 LDPC code, its algebraic characteristic changes. For N _Δ = K _Δ', the LDPC code is generated by applying none of shortening and puncturing or performing only shortening.
• However, regarding the DVB-S2 LDPC code, as described in Rule 1 and Rule 2, as one $R_{i,j}^{\left(k\right)}(k=1,2,\dots ,D_i,$

  

  i ₁ =1,...,K ₁ /M ₁ , i =0,...,M₁ -1) value corresponds to M ₁ columns, a total of K ₁/N ₁ column groups each have a structural shape. Therefore, the DVB-S2 LDPC code is equal to an LDPC code that does not use M ₁ columns, if it does not use one $R_{i,j}^{\left(k\right)}$

  

  value. The following shortening process is proposed considering such characteristics.
• In step 601, the LDPC encoder 511 reads column group information of a DVB-S2 LDPC code to be subjected to shortening. That is, the LDPC encoder 511 reads the stored parity-check matrix information. Thereafter, in step 603, the LDPC encoder 511 determines a codeword length N ₂ and an information length K ₂ for a shortened LDPC codeword to transmit actually after shortening. Thereafter, the LDPC encoder 511 performs a shortening process of steps 605 to 611, in which the LDPC encoder 511 performs shortening corresponding to a required information length of an LDPC code, based on the read information of the stored parity-check matrix.
• Shortening Step 1: The LDPC encoder 511 determines $\mathrm{A}=\lfloor \frac{K_2}{M1}\rfloor$

  

  in step 605, where └x┘ means the maximum integer which is less than or equal to x.
• Shortening Step 2: The LDPC encoder 511 selects a sequence for (A+1) column groups among $R_{i,\mathrm{<figure-callout\; id="1"\; label="j\; k\; i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">j</figure-callout>}}^{\left(k\right)}\left(i_{}\right)\left({}_1=1,\dots ,{\mathrm{<figure-callout\; id="1"\; label="K"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">K</figure-callout>}}_1/{\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\right)$

  

  in step 607, and the selected sequence is defined as $S_{i,j}^{\left(k\right)}\left(i_1=1,\dots ,A+1\right)\mathrm{.}$

  

  The LDPC encoder 511 considers that there is no sequence $R_{i,0}^{\left(k\right)}\mathrm{.}$

  

  for the remaining K₁ /M₁-A-1 column groups.
• Shortening Step 3: The LDPC encoder 511 generates a shortened DVB-S2 LDPC code from the A+1 $S_{i,0}^{\left(k\right)}$

  

  values selected in Shortening Step 2, using Rule 1 and Rule 2 in step 609. It should be noted that the shortened LDPC code has an information length of (A+1)/M₁ , which is always greater than or equal to K ₂.
• Shortening Step 4: The LDPC encoder 511 additionally shortens (A+1)/M₁-K₂ columns from the shortened LDPC code generated in Shortening Step 3 in step 611.
• For a description of detailed examples, a detailed description will now be made of a process of generating a new LDPC code whose codeword length is N ₂=4050 and whose information length is K ₂=1170, by shortening 12150 bits among the information bits using a DVB-S2 LDPC code that has a characteristic of N ₁=16200, K ₁=13320, M ₁=360 and q=9.
• Example of Shortening Step 1: The LDPC encoder 511 determines $\mathrm{A}=\lfloor \frac{1170}{360}\rfloor =3.$

  
• Example of Shortening Step 2: The LDPC encoder 511 selects a sequence for 4 column groups among a total of 37 $R_{i,0}^{\left(k\right)}$

  

  values. In this particular example, the LDPC encoder 511 selects the following sequence. $${\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(1\right)}=3,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(2\right)}=2409,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(3\right)}=499,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(4\right)}=1481,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(5\right)}=908,$$

  

  $${\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(6\right)}=559,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(7\right)}=716,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(8\right)}=1270,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(9\right)}=333,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(10\right)}=2508,$$

  

  $${\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(11\right)}=2264,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(12\right)}=1702,{\mathrm{<figure-callout\; id="1"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{1,0}^{\left(13\right)}=2805,$$

  

  $${\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{2,0}^{\left(1\right)}=6,{\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{2,0}^{2)}=2114,{\mathrm{<figure-callout\; id="2"\; label="S"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{2,0}^{\left(3\right)}=842,$$

  

  $${\mathrm{<figure-callout\; id="3"\; label="S"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{3,0}^{\left(1\right)}=0,{\mathrm{<figure-callout\; id="3"\; label="S"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{3,0}^{2)}=1885,{\mathrm{<figure-callout\; id="3"\; label="S"\; filenames="imgf0003.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{3,0}^{\left(3\right)}=2369,$$

  

  $${\mathrm{<figure-callout\; id="4"\; label="S"\; filenames="imgf0003.png,imgf0005.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{4,0}^{\left(1\right)}=7,{\mathrm{<figure-callout\; id="4"\; label="S"\; filenames="imgf0003.png,imgf0005.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{4,0}^{2)}=2326,{\mathrm{<figure-callout\; id="4"\; label="S"\; filenames="imgf0003.png,imgf0005.png"\; state="\{\{state\}\}">\; <figure-callout\; id="0"\; label="S"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">S</figure-callout>\; </figure-callout>}}_{4,0}^{\left(3\right)}=1579.$$

  
• Example of Shortening Step 3: The LDPC encoder 511 generates a shortened DVB-S2 LDPC code from the 4 $S_{i,0}^{\left(k\right)}$

  

  values selected in Example of Shortening Step 2, using Rule 1 and Rule 2. For the shortened LDPC code, a length of its information word is 4x360=1440.
• Example of Shortening Step 4: The LDPC encoder 511 additionally shortens 1440-1170=270 columns from the shortened LDPC code generated in Example of Shortening Step 3. The LDPC encoder 511 performs encoding based on the shortened LDPC code.
• According to the exemplary embodiment, since sequence information for K₁ /M₁-A-1 = 13320/360-4=33 column groups among $R_{i,\mathrm{<figure-callout\; id="1"\; label="j\; k\; i"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">j</figure-callout>}}^{\left(k\right)}\left(i_{}\right)\left({}_1=1,\dots ,{\mathrm{<figure-callout\; id="1"\; label="K"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">K</figure-callout>}}_1/{\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="imgf0001.png,imgf0002.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\right)$

  

  values are not used, which is equivalent to shortening a total of 33x360=11880 bits in the Example of Shortening Step 2. In addition, since the LDPC encoder 511 has additionally shortened 270 information bits through the Example of Shortening Step 3 and the Example of Shortening Step 4, it is finally equivalent to shortening 12150 information bits. Therefore, the result of the embodiment provides a shortened LDPC code with a codeword length N ₂=4050 and an information length K ₂=1170.
• As described above, the present invention can apply an efficient shortening technique that, compared with a bit-by-bit shortening technique which is commonly used for shortening of the DVB-S2 LDPC code, employs a method of not using information on column groups of the DVB-S2 LDPC code depending on the structural features of the DVB-S2 LDPC code.
• Selection criteria of a sequence for a column group can be summarized as follows in Step 2 in the shortening process of the DVB-S2 LDPC code.
• Criterion 1: The LDPC encoder 511 selects a shortened LDPC code with a codeword length N ₂ and an information length K ₂, obtained by performing shortening on a DVB-S2 LDPC code with a codeword length N ₁ and an information length K ₁, degree distribution of the selected shortened LDPC code being almost similar to the optimal degree distribution of the normal LDPC code with a codeword length N ₂ and an information length K ₂.
• Criterion 2: The LDPC encoder 511 selects a code having the good cycle characteristic on the Tanner graph among the shortened codes selected in Criterion 1. In the present invention, regarding a criterion for a cycle characteristic, the LDPC encoder 511 selects a case where the minimum-length cycles in the Tanner graph is as large as possible and the number of the minimum-length cycles is as small possible.
• Although the optimal degree distribution of the normal LDPC code can be found out in Criterion 1 using a density evolution analysis method, a detailed description thereof will be omitted since it is irrelevant to the understanding of the present invention.
• If the number of selections of a weight-1 position sequence for the column group is not great, the LDPC encoder 511 may select a weight-1 position sequence for the column group having the best performance by fully searching all the cases regardless of Criterion 1 and Criterion 2. However, the selection criteria for column groups, applied in Shortening Step 2 of the DVB-S2 LDPC code, can increase its efficiency by selecting an LDPC code satisfying the both conditions when the number of selections of the weight-1 position sequence for the column group is too large.
• To describe an example of a good sequence obtained by applying the selection criteria of a weight-1 position sequence for the column group, a DVB-S2 code with N ₁=16200, K ₁=3240, M ₁=360 and q=36 will be considered. The DVB-S2 LDPC code has the following weight-1 position sequence on column groups.
• 6295 9626 304 7695 4839 4936 1660 14411203 5567 6347 12557
• 10691 4988 3859 3734 3071 3494 7687 10313 5964 8069 8296 11090
• 10774 3613 5208 11177 7676 3549 8746 6583 7239 12265 2674 4292
• 11869 3708 5981 8718 4908 10650 6805 3334 2627 10461 9285 11120
• 7844 3079 10773
• 3385 10854 5747
• 1360 12010 12202
• 6189 4241 2343
• 9840 12726 4977
• The i ^th weight-1 position sequence in the i ^th line sequentially represents the information on the position of rows with 1 for the i ^th column group. Therefore, it can be appreciated that the DVB-S2 LDPC code is composed of 9 column groups and its information length is 9 360 = 3240. If a codeword length and an information length desired to be obtained by performing shortening are N ₂ and K ₂, respectively, it is possible to find out the optimized shortening pattern using Shortening Step 1 through Shortening Step 4.
• However, when values of N ₂ and K ₂ required by the system are highly variable, the optimized shortening pattern may have no correlation according to the value of N ₂. For example, assuming that the optimal selection for a case necessary for shortening 2 column groups from the DVB-S2 LDPC code is not using information on rows with 1 in 4^th and 8^th column groups, since selecting and shortening 1^st, 5^th and 6^th column groups can also be optimal when selecting 3 column groups, they have no correlation with each other. Therefore, when values of N ₂ and K ₂ required by the system are highly variable, it is undesirably necessary to store all shortening patterns optimized according to a value of K ₂, for the optimized performance.
• Thus, if values of N ₂ and K ₂ required by the system are highly variable, suboptimal shortening patterns can be found using the following method, for system efficiency.
• First, assume that selection of 1 column group is needed for shortening. In this case, since the number of selectable column groups is only 1 in an optimal sense, it is possible to select the highest-performance column group. Next, when there is a need for selection of 2 column groups for shortening, the LDPC encoder 511 selects a column group showing the best performance among the remaining column groups, including the selected 1 column group. In the same manner, when there is a need for selection of i column groups for shortening, the LDPC encoder 511 selects one highest-performance column group among the remaining column groups, including (i-1) column groups selected in the previous step for shortening.
• This method of shortening, though it cannot guarantee the optimal selection, can have stabilized performance from one shortening pattern regardless of a change in the value of K ₂.
• For a detailed example, when values of N ₂ and K ₂ required by the system are highly variable, it is possible to find out suboptimal shortening patterns according to N ₂ and K ₂, for 9 cases shown in Table 1. Herein, N ₂=N ₁ -K ₂, since the puncturing technique is not considered. Table 1

  Range of K 2	Shortening Method
  1) 2880 ≤ K 2 < 3240	Shortens 3240-K 2 bits from an information word corresponding to the 8th sequence
  	6189 4241 2343
  	for the 8th column group among the weight-1 position sequences.
  2) 2520 ≤ K 2 < 2880	Shortens all columns included in the column group, which correspond to the 8th sequence among the weight-1 position sequences, and additionally shortens 2880-K 2 bits from an information word corresponding to the 4th sequence
  	11869 3708 5981 8718 4908 10650 6805 3334 2627 10461 9285 11120
  	for the 4th column group.
  3) 2160 ≤ K 2 < 2520	Shortens all columns included in the column group, which correspond to the 8th and 4th sequences among the weight-1 position sequences, and additionally shortens 2520-K 2 bits from an information word corresponding to the 7th sequence
  	1360 12010 12202
  	for the 7th column group.
  4) 1800 ≤ K 2 < 2160	Shortens all columns included in the column group, which correspond to the 8th, 4th and 7th sequences among the weight-1 position sequences, and additionally shortens 2160-K 2 bits from an information word corresponding to the
  	6th sequence
  	3385 10854 5747
  	for the 6th column group.
  5) 1440 ≤ K 2 < 1800	Shortens all columns included in the column group, which correspond to the 8th, 4th, 7th and 6th sequences among the weight-1 position sequences, and additionally shortens 1880-K 2 bits from an information word corresponding to the 3rd sequence
  	10774 3613 5208 11177 7676 3549 8746 6583 7239 12265 2674 4292
  	for the 3rd column group.
  6) 1080 ≤ K 2 < 1440	Shortens all columns included in the column group, which correspond to the 8th, 4th, 7th, 6th and 3rd sequences among the weight-1 position sequences, and additionally shortens 1440-K 2 bits from an information word corresponding to the 5th sequence
  	7844 3079 10773
  	for the 5th column group.
  7) 720 ≤ K 2 < 1080	Shortens all columns included in the column group, which correspond to the 8th, 4th, 7th, 6th, 3rd and 5th sequences among the weight-1 position sequences, and additionally shortens 1080-K 2 bits from an information word corresponding to the 2nd sequence
  	10691 4988 3859 3734 3071 3494 7687 10313 5964 8069 8296 11090
  	for the 2nd column group.
  8) 528 ≤ K 2 < 720	Shortens all columns included in the column group, which
  	correspond to the 8th, 4th, 7th, 6th, 3rd, 5th and 2nd sequences among the weight-1 position sequences, and additionally shortens 720-K 2 bits from an information word corresponding to the 9th sequence
  	9840 12726 4977
  	for the 9th column group. However, since 168 BCH parity bits are mapped to a part of the column group, which corresponds to the 9th sequence, by a DVB-S2 encoding scheme, columns in the positions corresponding to the BCH parity do not undergo shortening.
  9) 168 ≤ K 2 < 528	Shortens all columns included in the column group, which correspond to the 8th, 4th, 7th, 6th, 3rd, 5th, 2nd and 9th sequences among the weight-1 position sequences, and additionally shortens 528-K 2 bits from an information word corresponding to the 1st sequence
  	6295 9626 304 7695 4839 4936 1660 144 11203 5567 6347 12557
  	for the 1st column group. Herein, K 2=168 means the case where only the columns corresponding to the BCH parity remain in the DVB-S2 LDPC code. In other words, there are no pure information word bits. This is not considered.

• The shortening order in Table 1 is determined by, for example, dividing the information word into 9 intervals, and then applying Criterion 1 and Criterion 2 thereto.
• Referring to Table 1, it can be appreciated that all columns corresponding to the 8^th, 4^th, 7^th, 6^th, 3^rd, 5^th, 2^nd, 9^th and 1^st sequences included in the column group sequentially undergo shortening according to the required information length for the LDPC code. That is, a value of 0 is mapped to the information bits that will undergo shortening in order of the columns corresponding to the 8^th, 4^th, 7^th, 6^th, 3^rd, 5^th, 2^nd, 9^th and 1^st rows according to the required information length. Alternatively, it can also be considered that the meaningful information bits, which are not fixed to 0, are sequentially mapped to the columns corresponding to the 1^st, 9^th, 2^nd, 5^th, 3^rd, 6^th, 7^th, 4^th and 8^th sequences according to the information length. The order '8, 4, 7, 6, 3, 5, 2, 9, 1' of the columns can also be expressed as '7, 3, 6, 5, 2, 4, 1, 8, 0', by representing the 1^st column as a 0^th block.
• In Step 8) and Step 9) in Table 1, since the last 168 bits of the 9^th column group, or the last column group, in the part corresponding to information bits of the DVB-S2 LDPC code with N ₁=16200, K ₁=3240, M ₁=360 and q=36 are mapped to Bose-Chaudhuri-Hocquenghem (BCH) parity bits, they cannot undergo shortening. Actually, when a DVB-S2 LDPC code with N ₁=16200 is designed such that 168 BCH parity bits are always included in LDPC information bits having the lengths K ₁ and K ₂.
• The shortening order information shown in Table 1 can also be expressed as Table 2, in brief. Table 2

  Major variables of S2 LDPC code DVB-			N 1=16200, K 1=3240, M 1=360, q=36
  Range of K 2			Shortening Method
  1) 528 ≤ K 2 < 3240			For an integer $$m=\lfloor \frac{3240-{\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">K</figure-callout>}}_2}{360}\rfloor ,$$ shortens all of m column
  			groups corresponding to π(0)th, π(1)th, ..., and π(m-1)th column groups, and additionally shortens 3240-K2-360m information bits from a π(m)th column group. Herein, π denotes a permutation function meaning a shortening pattern, and a relationship therebetween is shown at the bottom of the table.
  			However, when a part of a π(7)=8th column group is shortened, the columns in the positions corresponding to the 168 BCH parity bits are not subjected to shortening.
  2) 168 ≤ K 2 < 528			Shortens all of π(0)th, π(1)th, ..., and π(6)th column groups,
  			and shortens all columns except for the columns in the positions corresponding to 168 BCH parity bits from the π(7)=8th column group. Further, additionally shortens 528-K2 information bits from a π(8)=0th column group.
  π(0)	π(1)	π(2)	π(3)	π(4)	π(5)	π(6)	π(7)	π(8)
  7	3	6	5	2	4	1	8	0

• For a description of another exemplary embodiment, a DVB-S2 code with N ₁=16200, K ₁=7200, M ₁=360 and q=25 will be described. The DVB-S2 LDPC code has the following weight-1 position sequences.
• 20 712 2386 6354 4061 1062 5045 5158
• 21 2543 5748 4822 2348 3089 6328 5876
• 22 926 5701 269 3693 2438 3190 3507
• 23 2802 4520 3577 5324 1091 4667 4449
• 24 5140 2003 1263 4742 6497 1185 6202
• 0 4046 6934
• 1 2855 66
• 26694212
• 3 3439 1158
• 4 3850 4422
• 5 5924 290
• 6 1467 4049
• 7 7820 2242
• 8 4606 3080
• 9 4633 7877
• 10 3884 6868
• 11 8935 4996
• 12 3028 764
• 13 5988 1057
• 14 7411 3450
• The i ^th sequence sequentially represents the information on the position of rows with 1 for an i ^th column group. Therefore, it can be appreciated that the DVB-S2 LDPC code is composed of 20 column groups, and the information length is 20×360=7200. When the codeword length and the information length desired to be obtained by performing shortening are N ₂ and K ₂, respectively, it is possible to find out suboptimal shortening patterns as defined in Table 3. Table 3

  Major variables DVB-S2 LDPC code of				N 1=16200, K 1=7200, M 1=360, q=25
  Range of K2				Shortening Method
  1) 528 ≤ K 2 < 7200				For an integer $$m=\lfloor \frac{7200-{\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="imgf0003.png,imgf0004.png"\; state="\{\{state\}\}">K</figure-callout>}}_2}{360}\rfloor ,$$ shortens all of m column
  				groups corresponding to π(0)th, π(1)th, ..., and π(m-1)th column groups, and additionally shortens 7200-K 2-360m information bits from a π(m)th column group. Herein, π denotes a permutation function meaning a shortening pattern, and a relationship therebetween is shown at the bottom of the table.
  			However, when a part of a π(18)=19th column group is shortened, the columns in the positions corresponding to the 168 BCH parity bits are not subjected to shortening.
  2) 168 ≤ K 2 < 528			Shortens all of π(0)th, π(1)th, ..., and π(17)th column groups, and shortens all columns except for the columns in the positions corresponding to 168 BCH parity bits from the π(18)=19th column group. Further, additionally shortens 528-K2 information bits from a π(19)=0th column group.
  π(0)	π(1)	π(2)	π(3)	π(4)	π(5)	π(6)	π(7)	π(8)	π(9)
  18	17	16	15	14	13	12	11	4	10
  π(10)	π(11)	π(12)	π(13)	π(14)	π(15)	π(16)	π(17)	π(18)	π(19)
  9	8	3	2	7	6	5	1	19	0

• In the shortening process, the additional shortening can be more easily implemented if the process is sequentially performed from the rear or the front of the column group where the additional shortening is achieved.
• After step 611 in FIG. 6, when puncturing is needed, the LDPC encoder 511 applies puncturing in an LDPC encoding process in step 613. The puncturing method will be described below in brief.
• If a codeword length and an information length of an LDPC code are defined as N ₂ and K ₂, respectively, then the invention intends to obtain eventually from the DVB-S2 LDPC code with a codeword length N ₁ and a information length K ₁ using the shortening technique and the puncturing technique, and it is given that N ₁-N ₂=Δ and K ₁-K ₂=KΔ, it is possible to get the LDPC code with a codeword length N ₂ and an information length K ₂ by shortening KΔ bits and puncturing (N _Δ-K _Δ) bits from a parity-check matrix of the DVB-S2 LDPC code. Assuming that for convenience' sake, only the parity part is subjected to puncturing, since the parity length is N ₁-K ₁, there is a method of puncturing 1 bit from the parity part at every (N ₁-K ₁)/(N _Δ-K _Δ) bits. However, various other methods can also be applied as the puncturing technique.
• For N _Δ- K _Δ=0, there is no need to apply the puncturing technique. In this particular case, it is possible to get a high-efficiency shortened DVB-S2 LDPC code by applying a similar generation method for the DVB-S2 LDPC code using the shortening pattern shown in Table 1.
• Shown in FIG. 7 is a detailed example of a transmission apparatus for implementing a shortening process for the DVB-S2 LDPC code. FIG. 7 is a block diagram illustrating an exemplary structure of a transmission apparatus using shortened LDPC codes according to an embodiment of the present invention.
• The transmission apparatus includes, for example, a controller 710, a shortening pattern applier 720, an LDPC code's parity-check matrix extractor 740, and an LDPC encoder 760.
• The LDPC code's parity-check matrix extractor 740 extracts a shortened LDPC code parity-check matrix. The LDPC code parity-check matrix can be extracted from a memory, or can be given in the transmission apparatus, or can be generated by the transmission apparatus.
• The controller 710 controls the shortening pattern applier 720 so that it can determine a shortening pattern according to an information length. The shortening pattern applier 720 inserts zero (0)-bits at the positions of shortened bits, or removes columns corresponding to the shortened bits from the parity-check matrix of a given LDPC code. A method of determining the shortening pattern can use a shortening pattern stored in a memory, generate a shortening pattern using a sequence generator (not shown), or use a density evolution analysis algorithm for a parity-check matrix and its given information length.
• The controller 710 controls the shortening pattern applier 720 so that it can shorten a part of the information bits of the LDPC code in the patterns shown in Table 1 through Table 3.
• The LDPC encoder 760 performs encoding based on the LDPC code shortened by the controller 710 and the shortening pattern applier 720.
• FIGS. 8 and 9 are block diagrams illustrating structures of a transmission apparatus and a reception apparatus for a DVB-S2 LDPC code to which shortening and puncturing are both applied, respectively.
• FIG. 8 is a block diagram illustrating an exemplary structure of a transmission apparatus using shortened/punctured LDPC codes according to an embodiment of the present invention.
• The transmission apparatus of FIG. 8 further comprises a puncturing pattern applier 880 added to the transmission apparatus of FIG. 7. Referring to FIG. 8, it can be appreciated that shortening is carried out in the front stage of the LDPC encoder 760 and puncturing is performed in the output stage of the LDPC encoder 760.
• The puncturing pattern applier 880 applies puncturing to the output of the LDPC encoder 760. The method of applying puncturing has been described in detail in step 613 of FIG. 6.
• FIG. 9 is a block diagram illustrating an exemplary structure of a reception apparatus using LDPC codes to which shortening is applied, according to illustrative example.
• Shown in FIG. 9 is an example of a reception apparatus that receives a signal transmitted from a communication system using the shortened DVB-S2 LDPC code, and restores the data desired by a user from the received signal when a length of the shortened DVB-S2 LDPC code is determined from the received signal.
• The reception apparatus includes, for example, a controller 910, a shortening pattern decision/estimation unit 920, a demodulator 930, and a LDPC decoder 940.
• The demodulator 930 receives and demodulates a shortened LDPC code, and provides the demodulated signal to the shortening pattern decision/estimation unit 920 and the LDPC decoder 940.
• The shortening pattern decision/estimation unit 920, under the control of the controller 910, estimates or decides information on a shortening pattern of an LDPC code from the demodulated signal, and provides position information of the shortened bits to the LDPC decoder 940. A method of deciding or estimating a shortening pattern in the shortening pattern decision/estimation unit 920 can use a shortening pattern stored in a memory, or generate a shortening pattern using sequence generator (not shown), or use a density evolution analysis algorithm for a parity-check matrix and its given information length.
• Since a probability that values of shortened bits will be zero (0) in the LDPC decoder 940 is 1 (or 100%), the controller 910 decides whether it will decode the shortened bits by means of the LDPC decoder 940, using the probability value of 1.
• The LDPC decoder 940 restores data desired by the user from the received signal when it finds a length of the shortened DVB-S2 LDPC code by means of the shortening pattern decision/estimation unit 920.
• FIG. 10 is a block diagram illustrating an exemplary structure of a reception apparatus using LDPC codes to which shortening and puncturing are both applied, according to an illustrative example.
• In the reception apparatus of FIG. 10, a shortening and puncturing pattern decision/estimation unit 1020 replaces the shortening pattern decision/estimation unit 920 of FIG. 9.
• When the transmission apparatus applies both shortening and puncturing, the shortening and puncturing pattern decision/estimation unit 1020 in the reception apparatus can first perform pattern decision/estimation on shortening, or can first perform pattern decision/estimation on puncturing, or can simultaneously perform pattern decision/estimation on shortening and pattern decision/estimation on puncturing.
• The LDPC decoder 940 preferably has information on both shortening and puncturing in order to perform decoding.
• FIG. 11 is a flowchart illustrating an exemplary reception operation in a reception apparatus according to an illustrative example.
• A demodulator 930 receives and demodulates a shortened LDPC code in step 1101. Thereafter, a shortening pattern decision/estimation unit 920 decides or estimates a shortening/puncturing pattern(s) from the demodulated signal in step 1103.
• The shortening pattern decision/estimation unit 920 determines in step 1105 whether there is any shortened/punctured bit. If there is no shortened/punctured bit, a LDPC decoder 940 performs decoding in step 1111. However, if there is shortened/punctured bit(s), a shortening and puncturing pattern decision/estimation unit 1020 provides the position information of the shortened/punctured bits to the LDPC decoder 940 in step 1107.
• In step 1109, based on the position information of the shortened/punctured bits, the LDPC decoder 940 determines that the probability that values of the shortened bits will be 0 is 1, and determines that the punctured bits are erased bits. Thereafter, the LDPC decoder 940 proceeds to step 1111 where it performs LDPC decoding.
• As is apparent from the foregoing description, the present invention provides shortening patterns, thus making it possible not to substantially use some columns. In addition, the present invention can generate separate LDPC codes having different codeword lengths using information on a given parity-check matrix in a communication system using LDPC codes.
• The above-described methods according to the present invention can be realized in hardware or as software or computer code that can be stored in a recording medium such as a CD ROM, an RAM, a floppy disk, a hard disk, or a magneto-optical disk or downloaded over a network, so that the methods described herein can be executed by such software using a general purpose computer, or a special processor or in programmable or dedicated hardware, such as an ASIC or FPGA. As would be understood in the art, the computer, the processor or the programmable hardware include memory components, e.g., RAM, ROM, Flash, etc. that may store or receive software or computer code that when accessed and executed by the computer, processor or hardware implement the processing methods described herein.
• While the invention has been shown and described with reference to a certain preferred embodiment thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the range of the invention as defined by the appended claims.

Claims (2)

1. A method for channel encoding in a communication system using a Low-Density Parity-Check (LDPC) code for which a parity check matrix has N₁ columns, where N₁ is 16200, the parity check matrix having an information part and a parity part, wherein the information part has K₁ columns, where K₁ is 7200, wherein the parity part has (N₁-K₁) columns, wherein (N₁-K₁) is 9000; wherein the information part comprises a plurality of column groups, each column group having M₁ columns, where M₁ is 360, and the number of column groups is K₁/M₁, where K₁/M₁ is 20,
   wherein the sequences of positions of '1's in the 0^th column in the i^th column group, i=0, ..., 19, denoted by $R_{i,0}^{\left(1\right)},R_{i,0}^{\left(2\right)},\dots ,R_{i,0}^{\left(D_i\right)},$

   

   are

   20 712 2386 6354 4061 1062 5045 5158

   21 2543 5748 4822 2348 3089 6328 5876

   22 926 5701 269 3693 2438 3190 3507

   23 2802 4520 3577 53241091 4667 4449

   24 5140 2003 1263 4742 6497 1185 6202

   0 4046 6934

   1 2855 66

   2 6694 212

   334391158

   4 3850 4422

   5 5924 290

   6 1467 4049

   7 7820 2242

   8 4606 3080

   9 4633 7877

   10 3884 6868

   11 8935 4996

   12 3028 764

   13 5988 1057

   14 7411 3450,

   where a degree of the 0^th column in each i^th column group is denoted by D_i; wherein the structure of the information part is made using the following rule:
   determining position of rows with '1's, denoted by $R_{i,j}^{\left(k\right)},$

   

   by $$\begin{array}{l}{R}_{i,j}^{\left(k\right)}=\left\{R_{i,\left(j-1\right)}^{\left(k\right)}+q\right\}\mathrm{mod}\left(N_1-K_1\right),\\ k=1,2,\dots ,D_i,i=0,\dots ,19,j=1,\dots ,359\end{array};$$

   

   
   where q is an integer satisfying q = (N₁- K₁)/M₁ = 25;
   the method comprising:

   (a) reading parity check matrix information;

   (b) determining a length K₂, where K₂ denotes a length of information bits to be obtained by shortening, wherein the information bits include 168 BCH parity bits;

   (c) based on the length K₂, performing shortening on information bits in an order according to a predetermined shortening pattern defined in the following table Scope of K₂ Shortening Method 1) 528 ≤ K₂ < 7200 For an integer $$m=\lfloor \frac{7200-K_2}{360}\rfloor ,$$

   

   shortens all information bits corresponding to the π(0)^th, π(1)^th, ..., and π(m-1)^th column groups, and additionally shortens 7200-K₂-360m information bits from the π(m)^th column group. Herein, π denotes a permutation function shown at the bottom of the table. However, when a part of information bits corresponding to the π(18)^th =19^th column group is shortened, the 168 BCH parity bits are not subjected to shortening. 2) 168 ≤ K₂ < 528 Shortens all information bits corresponding to the π(0)^th, π(1)^th, ..., and π(17)^th column groups, and shortens all information bits except for the 168 BCH parity bits from the information bits corresponding to the π(18)=19^th column group. Further, additionally shortens 528-K₂ information bits corresponding to the π(19)=0^th column group. 1t(O) π(1) π(2) π(3) π(4) π(5) π(6) π(7) π(8) π(9) 18 17 16 15 14 13 12 11 4 10 π(10) π(11) π(12) π(13) π(14) π(15) π(16) π(17) π(18) π(19) 9 8 3 2 7 6 5 1 19 0 ;and

   (d) LDPC encoding the shortened information bits using the parity check matrix.
2. An apparatus for channel encoding in a communication system using a Low-Density Parity-Check (LDPC) code for which a parity check matrix has N₁ columns, where N₁ is 16200, the parity check matrix having an information part and a parity part, wherein the information part has K₁ columns, where K₁ is 7200, wherein the parity part has (N₁-K₁) columns, wherein (N₁-K₁) is 9000; wherein the information part comprises a plurality of column groups, each column group having M₁ columns, where M₁ is 360, and the number of column groups is K₁/M₁, where K₁/M₁ is 20,
   wherein the sequences of positions of '1's in the 0^th column in the i^th column group, i=0, ..., 19, denoted by $R_{i,0}^{\left(1\right)},R_{i,0}^{\left(2\right)},\dots ,R_{i,0}^{\left(D_i\right)},$

   

   are

   20 712 2386 6354 4061 1062 5045 5158

   21 2543 5748 4822 2348 3089 6328 5876

   22 926 5701 269 3693 2438 3190 3507

   23 2802 4520 3577 5324 1091 4667 4449

   24 5140 2003 1263 4742 6497 1185 6202

   0 4046 6934

   1 2855 66

   2 6694 212

   3 3439 1158

   4 3850 4422

   5 5924 290

   6 1467 4049

   7 7820 2242

   8 4606 3080

   9 4633 7877

   10 3884 6868

   11 8935 4996

   12 3028 764

   13 5988 1057

   14 7411 3450,

   where a degree of the 0^th column in each i^th column group is denoted by D_i; wherein the structure of the information part is made using the following rule:
   determining position of rows with '1's, denoted by $R_{i,j}^{\left(k\right)},$

   

   by $$\begin{array}{l}{R}_{i,j}^{\left(k\right)}=\left\{R_{i,\left(j-1\right)}^{\left(k\right)}+q\right\}\mathrm{mod}\left(N_1-K_1\right),\\ k=1,2,\dots ,D_i,i=0,\dots ,19,j=1,\dots ,359\end{array};$$

   

   
   where q is an integer satisfying q = (N₁- K₁)/M₁ = 25;
   the apparatus comprising:
   a parity-check matrix extractor (740) for reading parity check matrix information;
   a shortening pattern applier (720) for determining a length K₂, where K₂ denotes a length of information bits to be obtained by shortening, wherein the information bits include 168 BCH parity bits, and based on the length K₂, performing shortening on information bits in an order according to a predetermined shortening pattern defined in the following table Scope of K₂ Shortening Method 1) 528 ≤ K₂ < 7200 For an integer $$m=\lfloor \frac{7200-K_2}{360}\rfloor ,$$

   

   shortens all information bits corresponding to the π(0)^th, π(1)^th, ..., and π(m-1)^th column groups, and additionally shortens 7200-K₂-360m information bits from the π(m)^th column group. Herein, π denotes a permutation function shown at the bottom of the table. However, when a part of information bits corresponding to the π(18)^th =19^th column group is shortened, the 168 BCH parity bits are not subjected to shortening. 2) 168 ≤ K₂ < 528 Shortens all information bits corresponding to the π(0)^th, π(1)^th, ..., and π(17)^th column groups, and shortens all information bits except for the 168 BCH parity bits from the information bits corresponding to the π(18)=19^th column group. Further, additionally shortens 528-K₂ information bits corresponding to the π(19)=0^th column group. π(0) π(1) π(2) π(3) π(4) π(5) π(6) π(7) π(8) π(9) 18 17 16 15 14 13 12 11 4 10 π(10) π(11) π(12) π(13) π(14) π(15) π(16) π(17) π(18) π(19) 9 8 3 2 7 6 5 1 19 0 ; and
   an encoder (760) for LDPC encoding the shortened information bits using the parity check matrix.

Images