KR102043663B1

KR102043663B1 - Ldpc(low density parity check) - rs(reed solomon) 2-dimensional code for terrestrial cloud broadcasting

Info

Publication number: KR102043663B1
Application number: KR1020140102102A
Authority: KR
Inventors: 박성익; 권선형; 김흥묵; 허남호
Original assignee: 한국전자통신연구원
Priority date: 2013-09-10
Filing date: 2014-08-08
Publication date: 2019-12-02
Also published as: KR20150029534A

Abstract

Low Density Parity Check (LDPC) -Reed Solomon (RS) two-dimensional code for terrestrial cloud broadcasting. A method of transmitting a terrestrial cloud broadcast signal may include encoding information to be transmitted into a two-dimensional code including an LDPC code and an RS code, and outputting the information encoded by the two-dimensional code in units of rows.

Description

LDPC-RS two-dimensional code for terrestrial cloud broadcasting {LDPC (LOW DENSITY PARITY CHECK)-RS (REED SOLOMON) 2-DIMENSIONAL CODE FOR TERRESTRIAL CLOUD BROADCASTING}

Embodiments of the present invention provide a low density parity check (LDPC) code and a reed solomon (RS) code to correct errors occurring in a wireless channel in a terrestrial cloud broadcasting system operating in a single frequency network. It relates to a constructed two-dimensional code.

Current terrestrial TV broadcasts generate co-channel interference, which is three times the service radius, so that the same frequency cannot be reused in an area within three times the service radius. The area where such frequencies cannot be reused is called a white space, and the spectral efficiency is very low due to the occurrence of the white space. Therefore, in order to improve spectral efficiency, a need has arisen for the development of a transmission technology that facilitates white space removal and frequency reuse that focuses not only on increasing transmission capacity but also on reception robustness.

Accordingly, September 2012 IEEE Transactions on Broadcasting, vol. 58, no. In the academic literature "Cloud Transmission: A New Spectrum-Reuse Friendly Digital Terrestrial Broadcasting Transmission System" published in 3, terrestrial cloud broadcasting technology, which is easy to reuse frequency and does not generate white space, is easy to build and operate a single frequency network. Proposed.

Using such terrestrial cloud broadcasting technology, a broadcaster may transmit the same or different broadcast content nationwide through a single broadcast channel. However, in order to do this, the receiver should be able to receive one or more terrestrial cloud broadcast signals in an overlapping area, that is, an overlapping area in a single frequency network, and separately demodulate the received terrestrial cloud broadcast signals. It should be possible. That is, in the situation where co-channel interference exists and timing and frequency synchronization of respective transmission signals are not guaranteed, the receiver should be able to demodulate one or more cloud broadcast signals. For this purpose, the terrestrial cloud broadcasting system must operate in an environment in which the power of noise is greater than that of the broadcast signal, that is, in a negative signal to noise ratio (SNR) environment.

In addition, terrestrial cloud broadcasting systems are generally designed with the worst case in mind to provide quality service to all viewers. That is, the viewer is designed to stably receive the terrestrial broadcast signal even at the edge (part of the end or boundary) of the broadcast zone. This means that most broadcast zones have a much higher SNR than the edges. For example, more than 80% of the broadcast area is known to have an SNR of at least 5 decibels (dB) above the edge. Therefore, the terrestrial cloud broadcasting system should be able to decode information with a low latency and complexity in a region with a high SNR than in a region with a low SNR.

The technical problem of the present invention can be operated in a negative signal to noise ratio (SNR) environment for terrestrial cloud broadcasting, and LDPC (which can decode information with minimum complexity and latency in a high SNR environment). Low Density Parity Check) -Reed Solomon (RS) two-dimensional code.

According to an aspect of the present invention, a method for transmitting a terrestrial cloud broadcast signal includes encoding information to be transmitted into a two-dimensional code including a low density parity check (LDPC) code and a reed solomon (RS) code, and encoded by the two-dimensional code. And outputting information in rows.

In an embodiment, the two-dimensional code may be a code in which a row corresponds to the RS code and a column corresponds to the LDPC code.

In another embodiment, the LDPC code may be an LDPC code of a QC (Quasi-Cyclic) structure.

In another embodiment, the LDPC code is an A matrix of size g × K, a B matrix of size g × g, a C matrix of size (NKg) × (K + g), and a size of (NKg) × ( NKg) and a matrix D of g × (NKg), where N is a length of a codeword, K is a length of information, and g is a value that varies according to a code rate.

In another embodiment, the encoding may include encoding the information to be transmitted in a row unit by using the RS code and secondly by column by using the LDPC code.

As another embodiment, after the encoding, the method may further include dividing the information encoded with the 2D code into a plurality of blocks based on the size of the cyclic sequence matrix constituting the LDPC code.

As another embodiment, the outputting may include outputting information divided into the plurality of blocks in block units.

As another embodiment, the outputting may include outputting the information divided into the plurality of blocks in units of bits.

As another embodiment, the information encoded with the two-dimensional code may be restored by partial decoding using information of the LDPC codeword and a part of parity when the signal-to-noise ratio of the received signal is greater than or equal to the first threshold.

As another embodiment, the information encoded with the 2D code may be restored to RS decoding only without LDPC decoding when the signal-to-noise ratio of the received signal is greater than or equal to a second threshold.

According to another aspect of the present invention, a transmitting device for transmitting a terrestrial cloud broadcast signal includes an encoder and a two-dimensional code for encoding information to be transmitted into a two-dimensional code including a low density parity check (LDPC) code and a reed solomon (RS) code. It may include an output unit for outputting the encoded information in a row unit.

By using a two-dimensional code consisting of a Low Density Parity Check (LDPC) code and a Reed Solomon (RS) code, information can be decoded even in a negative signal to noise ratio (SNR) environment, and partly parity in a high SNR environment. Only the information can be successfully decrypted.

Since a decoding algorithm that has a different complexity and latency is adaptively used according to the SNR, information can be decoded with a minimum complexity and latency in an environment with high SNR.

1 is a diagram illustrating a parity check matrix of a QC-LDPC code applied to the present invention.
2 is a diagram showing the structure of an LDPC-RS two-dimensional code according to the present invention.
3 is a diagram illustrating a process of encoding information using an LDPC-RS two-dimensional code according to the present invention.
4 is a graph showing the BER performance in the AWGN channel of the LDPC-RS two-dimensional code according to the present invention.
5 is a graph showing BER performance in the fading channel of the LDPC-RS two-dimensional code according to the present invention.
FIG. 6 is a diagram illustrating an LDPC-RS two-dimensional code in which information for RS encoding is arranged horizontally. FIG.
7 is a diagram illustrating an LDPC-RS two-dimensional code in which information for RS encoding is arranged vertically.
8 is a diagram illustrating that the LDPC-RS two-dimensional code of FIGS. 6 and 7 have the same form in terms of two-dimensional code.
9 is a diagram for explaining partial decoding of an LDPC-RS two-dimensional code according to the present invention.
10 and 11 are diagrams illustrating an information transmission method using an LDPC-RS two-dimensional code according to an embodiment of the present invention.
12 is a flowchart illustrating a method of transmitting a terrestrial cloud broadcast signal according to an embodiment of the present invention.
13 is a diagram illustrating a case where only RS decoding is performed on an LDPC-RS two-dimensional code applied to the present invention.
14 is a block diagram showing a transmission device for transmitting a codeword encoded with an LDPC-RS two-dimensional code according to an embodiment of the present invention.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is said to "include" a certain component, it means that it can further include other components, without excluding other components unless specifically stated otherwise. In addition, the term "~ unit" described in the specification means a unit for processing at least one function or operation, which may be implemented in hardware or software or a combination of hardware and software.

1 is a diagram illustrating a parity check matrix of a QC-LDPC code applied to the present invention.

The Low Density Parity Check (LDPC) code is known as the error correction code that is closest to the Shannon limit in the Additive White Gaussian Noise (AWGN) channel, and is approximately better than the Turbo code. And parallel decoding (parallelizable decoding) is possible. In general, the LDPC code is defined by a randomly generated low density parity check matrix (PCM). However, the randomly generated LDPC code not only requires a lot of memory to store the PCM, but also takes a long time to access the memory.

Therefore, in order to solve such a memory problem, a QC-LDPC code, which is an LDPC code having a QC (Quasi-Cyclic) structure, may be used. The QC-LDPC code is composed of a zero matrix or a circulant permutation matrix (CPM), and is defined by PCM H as shown in Equation 1 below.

Here, P is a CPM size L × L and is equal to the following equation (2).

Here, P ⁱ is the CPM that size L × L is an identity matrix moved (Identity Matrix) I (= P 0) to the right of i (0≤i <L) times, P ^∞ is of size L × L Spirit It is a matrix. Thus, since the QC-LDPC code only needs to store exponent ⁱ to store P ⁱ , the memory required to store PCM is significantly reduced.

Therefore, the QC-LDPC code defined by the PCM as shown in FIG. 1 may be applied to the present invention. In FIG. 1, N denotes the length of a codeword and K denotes the length of information. g is a value that varies with code rate. The matrices A and C are g × K and (NKg) × (K + g), respectively, and are composed of a zero matrix and a cyclic permutation matrix of size L × L. The matrix Z is a zero matrix of size g × (NKg) and the matrix D is an identity matrix of size (NKg) × (NKg). The matrix B is a dual diagonal matrix having a size g × g, and is represented by Equation 3 below.

Where I _L _{× L} represents an identity matrix of size L × L. As shown in Equation 3, the double diagonal matrix B is an element matrix constituting the double diagonal is an identity matrix and the remaining element matrix is a zero matrix. The element matrix constituting the double diagonal of the double diagonal matrix B may be continuous with the element matrix constituting the diagonal of the identity matrix D.

The QC-LDPC code shown in FIG. 1 shows very good performance near the Shannon limit. In addition, since a part of parity (part corresponding to matrix D ) is composed of the identity matrix, the code rate from the lower code rate mother code through puncturing or truncating technique is used. It can be easily converted to this high code. In other words, the QC-LDPC code has a rate-compatible characteristic such as a Raptor code due to the special structure of the PCM as shown in FIG. 1. However, the QC-LDPC code has an error floor in a region where the bit error rate (BER) is 10 ⁻⁸ . In addition, because burst errors occur in the fading channel, a complex bit and frequency interleaver must be used to ensure performance in the fading channel. Therefore, in the present invention, information can be encoded by using the LDPC-RS two-dimensional code as shown in FIG.

FIG. 2 is a diagram illustrating a structure of an LDPC-RS two-dimensional code according to the present invention, and FIG. 3 is a diagram illustrating a process of encoding information using an LDPC-RS two-dimensional code according to the present invention.

In FIG. 2, N _{RS_Info} , N _{RS_Parity} and N _RS respectively indicate information, parity, and codeword lengths for an RS code, and N _{LDPC_Info} , N _{LDPC_Parity} and N _LDPC are LDPC codes, respectively. Indicates the length of information, parity, and codeword. As shown in FIG. 2, a row of the LDPC-RS two-dimensional code according to the present invention corresponds to an RS code and a column corresponds to an LDPC code. Here, the LDPC code corresponding to the sequence of the LDPC-RS two-dimensional code may have the same structure as that of the QC-LDPC code illustrated in FIG. 1, that is, the same PCM.

Accordingly, the transmitting apparatus for terrestrial cloud broadcasting according to the present invention encodes information to be transmitted in row by row using an RS code, as shown in FIG. 3, and secondarily, LDPC. The code can be encoded in columns by column and then output. The receiving device that receives the information (codeword) encoded by the LDPC-RS two-dimensional code can first decode the LDPC codeword and secondly decode the RS codeword.

4 is a graph showing BER performance in the AWGN channel of the LDPC-RS two-dimensional code according to the present invention, Figure 5 is a graph showing the BER performance in the fading channel of the LDPC-RS two-dimensional code according to the present invention.

In FIG. 4, for example, BER performance in an AWGN channel of LDPC code having a length of 16200 or 64800 bits and a code rate of 1/4, and an error of up to 160 bytes in length and up to 7 bytes are corrected. The BER performance in the AWGN channel of the shortened RS code and the LDPC-RS two-dimensional code consisting of the LDPC code is shown, respectively. As a modulation method, QPSK (Quadratic Phase Shift Keying) is used, and a LLR (Log-likelihood Ratio) based sum-product algorithm that performs 50 iterative decoding is used to decode the LDPC codeword. The hard coded hard-decision Berlekamp-Massey algorithm is commonly used to decode RS codewords.

Referring to FIG. 4, the RS output of the LDPC-RS two-dimensional code (the output after decoding the LDPC codeword after decoding the LDPC code) in the AWGN channel not only shows better performance than the output of the existing LDPC code but also occurs in the LDPC code. It can be seen that it removes the error floor phenomenon. In addition, it can be seen that the BER performance of the LDPC-RS two-dimensional code exhibits a sharp-slope slope than the LDPC code.

Meanwhile, the LDPC-RS two-dimensional codeword according to the present invention may be output in a column by column or in a row by row, as shown in Table 1 below.

Output of two-dimensional code effect Case I (column by column)
Output in LDPC codeword order No interleaving Case II (row by row)
Output in RS codeword order Time & frequency interleaving

Referring to Table 1, Case I, that is, output in column units (output in LDPC codeword order) does not have any interleaving effect, while Case II, that is, output in units of rows (output in RS codeword order) It has a time & frequency interleaving effect by a block interleaver. Accordingly, there is no performance difference between Case I and Case II in the AWGN channel, but shows a very large performance difference as shown in FIG. 5 in the fading channel.

In FIG. 5, the LDPC output shows the performance when only the LDPC codeword is decoded, and the RS output shows the performance when both the LDPC codeword and the RS codeword are decoded. The LDPC and RS codes used in FIG. 5 are the same as in FIG. 4, and the length of the LDPC code is 64800 bits, and the error correction capability of the RS code is fixed to 7 bytes, respectively. In addition, a TU (Typical Urban) -6 channel at 120 km / h was considered for fading.

As shown in FIG. 5, Case II has a much better performance than Case I in the fading channel. The reason for this is that Case I (column by column output) cannot properly distribute a large number of cluster errors in the fading channel, whereas Case II (row by row output) has a time and frequency interleaving effect. This is because it can be properly distributed through the block interleaver. Therefore, in order to effectively distribute the clustering error occurring in the fading panel, the LDPC-RS two-dimensional codeword according to the present invention may be output in units of rows.

FIG. 6 is a diagram illustrating an LDPC-RS two-dimensional code in which information for RS encoding is arranged horizontally, and FIG. 7 is a diagram illustrating an LDPC-RS two-dimensional code in a form where information for RS encoding is arranged vertically. 8 is a diagram illustrating that the LDPC-RS two-dimensional code of FIGS. 6 and 7 have the same form in terms of two-dimensional code. Hereinafter, a case where the code rate of the LDPC code is 1/4, the length is 64800 bits, and the length of the RS code is 160 bytes (1280 bits) will be described.

The RS code encodes information in units of bytes. Accordingly, the LDPC-RS two-dimensional code has a form in which the input bytes (8 bits) for RS coding are arranged in rows as shown in FIGS. 6 and 7, and the input bytes for RS coding are arranged in columns. Arrangement is possible. Referring to FIG. 8, the LDPC-RS two-dimensional code applied to the present invention is composed of 8100 RS codewords and 160 LDPC codewords in both cases, and it can be seen that the LDPC-RS two-dimensional code is exactly the same in terms of two-dimensional code.

9 is a diagram for explaining partial decoding of an LDPC-RS two-dimensional code according to the present invention.

The LDPC code used for the above-described LDPC-RS two-dimensional code has a rate-compatible characteristic similar to that of the Raptor code, and thus the code rate is determined through puncturing or truncating. Can be varied. In other words, the LDPC code can be successfully decoded only by the information constituting the LDPC codeword and a part of parity. Therefore, in a region where the received signal-to-noise ratio (SNR) is relatively good, instead of decoding using a whole LDPC codeword, that is, full decoding, a portion of the LDPC codeword (information portion and parity) may be used. Since only partial decoding can be performed, that is, partial decoding, complexity and latency can be greatly reduced. Here, the complexity refers to the amount of computation required during decoding, and the latency refers to the time that the decoder must wait to begin decoding. Hereinafter, partial decoding of the LDPC-RS two-dimensional code according to the present invention will be described in more detail with reference to FIG. 9.

The LDPC codeword constituting the LDPC-RS two-dimensional codeword may be divided into a plurality of blocks as shown in FIG. 9. Since the LDPC code used for the LDPC-RS two-dimensional code has a QC structure and is composed of a CPM having a size L as described above, the size of the blocks may be determined as a multiple of L. For example, FIG. 9 illustrates a case where an LDPC codeword having a length of 64800 bits is divided into 2160 blocks having a length of 30 bits (the size of a CPM). Blocks of the divided LDPC codeword may be sequentially transmitted in the horizontal direction as shown in FIG. 9. That is, it may be output in a row by row in order to obtain the time and frequency interleaving effect.

In this way, when the vertical LDPC codeword is divided into a plurality of blocks and then transmitted in the horizontal direction, not only the time and frequency interleaving effects due to the block interleaver of the LDPC-RS two-dimensional code but also the rate-compatible code of the LDPC code are available. This feature allows for fast decoding with low complexity and low latency.

For example, 780 blocks (540 information blocks + 240 parity blocks) and 1080 blocks among a total of 2160 blocks (540 information blocks + 1620 parity blocks) constituting the LDPC codeword. (540 information blocks and 540 parity blocks), 1300 blocks (540 information blocks and 760 parity blocks) and 1620 blocks (540 information blocks and 1080 parity blocks), respectively. The code rate and length of the received LDPC codeword are 23400 bits (16200 bits of information + 7200 bits of parity) and 2400 code rates of 32400 bits (16200 bits of information + 16200 bits of parity), respectively. ), 39000 bits (16200 bits of information + 22800 bits of parity) at 2/5 code rates, and 48600 bits (16200 bits of information + 32400 bits of parity) at 1/3 code rates. That is, when only a part of the 2160 blocks constituting the LDPC code is received and partially decoded, complexity and latency are greater than full decoding of the existing 1/4 code rate and 64800 bit long LDPC code. Can be reduced.

Table 2 below shows the LDPC mother code of code rate 1/4, the code rate, length, number of '1's in PCM, and complexity for puncturing or truncating LDPC codes. The amount of reduction (proportional to the number of 1s of PCM) and the amount of latency reduction are respectively shown.

Code rate Length (N) Number of 1 in PCM Complexity reduction Latency reduction 1/4 64800 277,170 - - 1/3 48600 199,260 28% 25.0% 2/5 39000 160,260 42% 37.5% 1/2 32400 121,190 56% 50.0% 2/3 23400 82,590 70% 62.5%

10 and 11 are diagrams illustrating an information transmission method using an LDPC-RS two-dimensional code according to an embodiment of the present invention.

First, in FIG. 10, 160 blocks 1 are sequentially transmitted among the elementary blocks constituting the LDPC codeword, and then 160 blocks 2 are repeatedly transmitted to the last 160 blocks 2160. A method of transmitting sequentially is shown. On the contrary, in FIG. 11, the first bits of 160 blocks 1, that is, 160 bits are transmitted, and the second 160 bits of blocks 1 are transmitted next, and the process is repeated. A method of transmitting the thirtieth 160 bits of the blocks is shown. The bitwise transmission method as shown in FIG. 11 has an additional bit interleaving effect as compared to the blockwise transmission method as shown in FIG. However, in this case, since the receiver has to wait 4800 bits to receive one block (30 bits) which is a basic block of the LDPC codeword, a longer delay occurs when the LDPC code is decoded.

12 is a flowchart illustrating a method of transmitting a terrestrial cloud broadcast signal according to an embodiment of the present invention.

Referring to FIG. 12, the apparatus for transmitting terrestrial cloud broadcast signals according to the present invention may encode information to be transmitted (input data) into a two-dimensional code including an LDPC code and an RS code (1210). For example, the transmitting apparatus may first encode the information to be transmitted in the row unit using the RS code and secondly encode the information in the column unit using the LDPC code. The two-dimensional code may be a code in which a row corresponds to the RS code and a column corresponds to the LDPC code. The LDPC code may be an LDPC code of a QC structure.

Thereafter, the coded information (LDPC-RS codeword) may be output in units of rows in order to effectively distribute the clustering error occurring in the fading panel (1220). At this time, the transmitting apparatus divides the information encoded by the two-dimensional code into a plurality of blocks based on the size of the cyclic sequence matrix constituting the LDPC code, and outputs the information divided into the plurality of blocks in units of blocks or bits. Can be output in units. Faster decoding is possible when output in units of bits, and additional bit interleaving is achieved when output in units of blocks.

The information encoded by the LDPC-RS two-dimensional code according to the present invention can be successfully recovered by partial decoding using information constituting the LDPC codeword and a part of parity when the signal-to-noise ratio of the received signal is greater than or equal to the first threshold. have. In this case, RS decoding is not performed. In addition, the information encoded by the LDPC-RS two-dimensional code according to the present invention can be recovered without error by only RS decoding without LDPC decoding when the signal-to-noise ratio of the received signal is greater than or equal to the second threshold.

13 is a diagram illustrating a case where only RS decoding is performed on an LDPC-RS two-dimensional code applied to the present invention.

The LDPC-RS two-dimensional code according to the present invention can be successfully recovered through RS decoding only without LDPC decoding in a very high SNR environment (reception near the transmitter). As an example, when the 160 block 1 is received as shown in FIG. 13, the receiving device may decode 3 RS codewords among 3.75 RS codewords. Therefore, the receiving apparatus can recover information with minimal complexity and latency by performing RS decoding without LDPC decoding in an environment where SNR is very high (for example, a region near the transmitter).

14 is a block diagram showing a transmission device for transmitting a codeword encoded with an LDPC-RS two-dimensional code according to an embodiment of the present invention.

Referring to FIG. 14, the transmitter 1400 for transmitting the terrestrial cloud broadcast signal according to the present invention may include an encoder 1410 and an output unit 1420.

The encoder 1410 encodes the information to be transmitted into a two-dimensional code including an LDPC code and an RS code. The two-dimensional code may be a code in which a row corresponds to the RS code and a column corresponds to the LDPC code, and the LDPC code may be a QC-LDPC code. As an example, the encoder 1410 may first encode information to be transmitted on a row-by-row basis using the RS code and secondly on a column-by-column basis using the LDPC code. The coded information may be divided into a plurality of blocks based on the size of the cyclic sequence matrix constituting the LDPC code.

The output unit 1420 outputs the information encoded by the encoder 1410 in units of rows. The output unit 1420 may output information divided into a plurality of blocks in block units or in bit units.

The information encoded by the LDPC-RS two-dimensional code by the transmitting device 1400 is successfully restored by partial decoding using information constituting the LDPC codeword and a part of parity when the signal-to-noise ratio of the received signal is greater than or equal to the first threshold. If the signal-to-noise ratio for the received signal is greater than or equal to the second threshold, the signal may be successfully recovered by only RS decoding without LDPC decoding. In addition, in an area where the signal-to-noise ratio for the received signal is low (the edge of the broadcast zone), it can be successfully decoded through full decoding.

The above description is merely illustrative of the technical idea of the present invention, and those skilled in the art to which the present invention pertains may make various modifications and changes without departing from the essential characteristics of the present invention. Therefore, the embodiments disclosed in the present invention are not intended to limit the technical idea of the present invention but to describe the present invention, and the scope of the technical idea of the present invention is not limited thereto. The protection scope of the present invention should be interpreted by the following claims, and all technical ideas within the scope equivalent thereto should be construed as being included in the scope of the present invention.

Claims

In the method for transmitting a terrestrial cloud broadcast signal,
Encoding information to be transmitted into a two-dimensional code including a Low Density Parity Check (LDPC) code and a Reed Solomon (RS) code;
Dividing the information encoded with the two-dimensional code into a plurality of blocks based on the size of a cyclic sequence matrix constituting the LDPC code; And
Outputting the information encoded by the two-dimensional code in units of rows
Including,
The two-dimensional code is,
A row corresponds to the RS code and a column corresponds to the LDPC code,
The LDPC code is,
LDPC code of QC (Quasi-Cyclic) structure,
The step of encoding,
Firstly encoding the information to be transmitted on a row-by-row basis using the RS code and secondly on a column-by-column basis using the LDPC code,
The information encoded by the two-dimensional code,
If the signal-to-noise ratio for the received signal is greater than or equal to the first threshold, it is recovered by partial decoding using information constituting the LDPC codeword and a part of parity,
If the signal-to-noise ratio for the received signal is greater than or equal to a second threshold, the signal is restored to RS decoding only without LDPC decoding.
And if the signal-to-noise ratio for the received signal is less than or equal to a third threshold, decoding by full decoding.

delete

The method of claim 1,
The LDPC code is,
A matrix of size g × K, B matrix of size g × g, C matrix of size (NKg) × (K + g), D matrix of size (NKg) × (NKg), and g × of size Consisting of a Z matrix of (NKg),
And N denotes a length of a codeword, K denotes a length of information, and g denotes a value which varies according to a code rate.

delete

The method of claim 1,
The outputting step,
And transmitting the information divided into the plurality of blocks in block units.

The method of claim 1,
The outputting step,
And transmitting the information divided into the plurality of blocks in bit units.

delete

A transmitter for transmitting a terrestrial cloud broadcast signal,
An encoder for encoding the information to be transmitted into a two-dimensional code including a low density parity check (LDPC) code and a reed solomon (RS) code; And
Output unit for outputting the information encoded by the two-dimensional code in units of rows
Including,
The two-dimensional code is,
A row corresponds to the RS code and a column corresponds to the LDPC code,
The LDPC code is,
LDPC code of QC (Quasi-Cyclic) structure,
The encoder is
Firstly encoding the information to be transmitted on a row-by-row basis using the RS code and secondly on a column-by-column basis using the LDPC code,
Dividing the information encoded by the two-dimensional code into a plurality of blocks based on the size of the cyclic sequence matrix constituting the LDPC code,
The information encoded by the two-dimensional code,
If the signal-to-noise ratio for the received signal is greater than or equal to the first threshold, it is recovered by partial decoding using information constituting the LDPC codeword and a part of parity,
If the signal-to-noise ratio for the received signal is greater than or equal to a second threshold, the signal is restored to RS decoding only without LDPC decoding.
And if the signal-to-noise ratio for the received signal is less than or equal to a third threshold, decoding by full decoding.

delete

The method of claim 11,
The LDPC code is,
A matrix of size g × K, B matrix of size g × g, C matrix of size (NKg) × (K + g), D matrix of size (NKg) × (NKg), and g × of size Consisting of a Z matrix of (NKg),
And N denotes a length of a codeword, K denotes a length of information, and g denotes a value which varies according to a code rate.

delete

The method of claim 11,
The output unit,
And transmitting information divided into the plurality of blocks in block units.

The method of claim 11,
The output unit,
And transmitting the information divided into the plurality of blocks in bit units.

delete