AU2012302460A1 - Method and apparatus for transmitting and receiving information in a broadcasting/communication system - Google Patents
Method and apparatus for transmitting and receiving information in a broadcasting/communication system Download PDFInfo
- Publication number
- AU2012302460A1 AU2012302460A1 AU2012302460A AU2012302460A AU2012302460A1 AU 2012302460 A1 AU2012302460 A1 AU 2012302460A1 AU 2012302460 A AU2012302460 A AU 2012302460A AU 2012302460 A AU2012302460 A AU 2012302460A AU 2012302460 A1 AU2012302460 A1 AU 2012302460A1
- Authority
- AU
- Australia
- Prior art keywords
- bits
- punctured
- indicates
- parity
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
- H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/152—Bose-Chaudhuri-Hocquenghem [BCH] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
- H03M13/6362—Error control coding in combination with rate matching by puncturing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0072—Error control for data other than payload data, e.g. control data
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A method and apparatus are provided for transmitting and receiving information in a broadcasting/communication system. The method includes comparing a number of bits of an information word to be transmitted with a predetermined threshold value; if the number of bits of the information word is less than the predetermined threshold value, determining a first parameter pair; if the number of bits of the information word is not less than the predetermined threshold value, determining a second parameter pair; determining a number of bits to be punctured based on one of the first parameter pair and the second parameter pair; and puncturing the determined number of bits to be punctured, with respect to parity bits of a codeword generated by encoding the information word.
Description
WO 2013/032156 PCT/KR2012/006516 1 Description Title of Invention: METHOD AND APPARATUS FOR TRANSMITTING AND RECEIVING INFORMATION IN A BROADCASTING/COMMUNICATION SYSTEM Technical Field [1] The present invention relates generally to transmission and reception of information in a broadcasting/communication system, and more particularly, to a method and apparatus for controlling a code rate according to transmission and reception of signaling information in a broadcasting/communication system. Background Art [2] A broadcasting/communication system may experience poor link performance due to noise, a fading phenomenon, and Inter-Symbol Interference (ISI). Thus, to implement high-speed digital broadcasting/communication systems, which require high data throughput and reliability, development of a technique for overcoming noise, fading, and ISI is essential. To address these issues, research is currently being conducted on an error-correcting code, e.g., a Low-Density Parity Check (LDPC) code, for improving the reliability of broadcasting/communication by efficiently restoring distortion of information to an original state. [3] More specifically, an LDPC encoder receives LDPC information bits (or an LDPC information word or an LDPC uncoded block) having Kldc bits to generate LDPC coded bits (or an LPDC code word, an LDPC codeword, or an LDPC coded block) having Nldc bits. If the length of LDPC information bits input to the LDPC encoder, K Idpc, is shorter than the length of an input information bits (or input information word) to be encoded, Ksig, then a transmission end performs encoding after a shortening process. If the number of parity bits used by the transmission end, i.e., a parity bit length, N Syis shorter than the length of parity bits output from the encoder, (N'ty,=NidPc-K idpc), the transmission end punctures the parity bits output from the encoder by (Nsty NX P-ity). [4] If the shortening bit length increases, a code rate decreases, such that Bit Error Rate(BER)/Frame Error Rate (FER) performance may be improved in comparison to a code before shortening. However, if the puncturing bit length increases, a code rate also increases, such that the BER/FER performance may be degraded in comparison to a code before puncturing. Therefore, to maintain similar performance regardless of the length of an information word for system stability, a technique for selecting the ap propriate number of puncturing bits according to the length of an information word is required.
WO 2013/032156 PCT/KR2012/006516 2 Disclosure of Invention Technical Problem [5] Accordingly, the present invention is designed to address at least the problems and/or disadvantages described above and to provide at least the advantages described below. [6] An aspect of the present invention is to provide a method and apparatus for transmitting and receiving information in a broadcasting/communication system. [7] Another aspect of the present invention is to provide a method and apparatus for con trolling a code rate in a broadcasting/communication system. [8] Another aspect of the present invention is to provide a method and apparatus for selecting a shortening/puncturing rate according to a length of an information word in a broadcasting/communication system. [9] Another aspect of the present invention is to provide a method and apparatus for de termining a number of bits to be punctured according to a length of an input in formation word in a broadcasting/communication system. Solution to Problem [10] In accordance with an aspect of the present invention, a method for transmitting in formation in a broadcasting/communication system is provided. The method includes comparing a number of bits of an information word to be transmitted with a prede termined threshold value, if the number of bits of the information word is less than the threshold value, determining a first parameter pair, if the number of bits of the in formation word is not less than the threshold value, determining a second parameter pair, determining a number of bits to be punctured based on one of the first parameter pair and the second parameter pair, and puncturing the determined number of bits to be punctured, with respect to parity bits of a codeword generated by encoding the in formation word. [11] In accordance with another aspect of the present invention, an apparatus for transmitting information in a broadcasting/communication system is provided. The apparatus includes an encoder for encoding an information word to be transmitted and outputting a codeword; a controller for comparing a number of bits of the information word with a predetermined threshold value, determining a first parameter pair, if the number of bits of the information word is less than the predetermined threshold value, determining a second parameter pair, if the number of bits of the information word is not less than the predetermined threshold value, and determining a number of bits to be punctured, based on one of the first parameter pair and the second parameter pair; and a puncturer for puncturing the determined number of bits to be punctured, with respect to parity bits of the codeword. [12] In accordance with another aspect of the present invention, a method for receiving in- WO 2013/032156 PCT/KR2012/006516 3 formation in a broadcasting/communication system is provided. The method includes comparing a number of bits of an information word transmitted by a transmission end with a predetermined threshold value, determining a first parameter pair, if the number of bits of the information word is less than the predetermined threshold value, de termining a second parameter pair, if the number of bits of the information word is not less than the predetermined threshold value, determining a number of bits to be punctured, based on one of the first parameter pair and the second parameter pair, generating values corresponding to bits punctured by the transmission end and padding the generated values to a modulated signal of a received signal to generate a decoder input by using the determined number of bits to be punctured, and decoding the decoder input to reconstruct information word bits. [13] In accordance with another aspect of the present invention, an apparatus for receiving information in a broadcasting/communication system is provided. The apparatus includes a demodulator for demodulating a received signal; a controller for obtaining information about a number of bits of an information word transmitted from a transmission end, comparing the number of bits of the information word transmitted by the transmission end with a predetermined threshold value, determining a first parameter pair, if the number of bits of the information word is less than the prede termined threshold value, determining a second parameter pair, if the number of bits of the information word is not less than the predetermined threshold value, and de termining a number of bits to be punctured, based on one of the first parameter pair and the second parameter pair; a puncturing processor for generating values corre sponding to the bits punctured by the transmission end by using the determined number of bits to be punctured, and padding the generated values to an output signal of the demodulator; and a decoder for receiving and decoding output values of the puncturing processor to reconstruct information word bits. Brief Description of Drawings [14] The above and other aspects, features, and advantages of certain embodiments of the present invention will be more apparent from the following detailed description taken in conjunction with the accompanying drawings, in which: [15] FIG. 1 is a graph illustrating a change in a code rate according to an embodiment of the present invention; [16] FIGs. 2 and 3 are graphs illustrating efficiency of an LDPC code according to an em bodiment of the present invention; [17] FIG. 4 is a graph illustrating a change in an effective code rate according to an em bodiment of the present invention; [18] FIG. 5 is a graph illustrating efficiency of an LDPC code according to an em- WO 2013/032156 PCT/KR2012/006516 4 bodiment of the present invention; [19] FIG. 6 is a flowchart illustrating a procedure for puncturing parity bits based on an information bit length according to an embodiment of the present invention; [20] FIG. 7 is a diagram illustrating a frame structure for transmitting two types of parity bits according to an embodiment of the present invention; [21] FIG. 8 is a diagram illustrating a structure of an LDPC code for supporting transmission of parity bits according to an embodiment of the present invention; [22] FIG. 9 is a graph illustrating a change in an effective code rate according to an em bodiment of the present invention; [23] FIG. 10 is a flowchart illustrating a procedure for determining a number of two types of parity bits according to an embodiment of the present invention; [24] FIG. 11 a block diagram illustrating a transmission end according to an embodiment of the present invention; and [25] FIG. 12 is a block diagram illustrating a receiving end according to an embodiment of the present invention. Mode for the Invention [26] Various embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Well-known functions and structures will not be described if they may unnecessarily obscure the subject matter of the present invention. Further, the terms used herein are defined based on functions in the present invention and may vary according to users, operator intention, or usual practices. Therefore, definitions of the terms should be made based on the content throughout the specification. [27] Although the following description of the present invention is based on a Digital Video Broadcasting the 2nd Generation Terrestrial (DVB-T2) system, which is the Europe digital broadcasting standard, and a Digital Video Broadcasting Next Generation Handheld (DVB-NGH) system, which is being currently standardized, the present invention is equally applied to other systems. [28] Additionally, although the following description controls a code rate corresponding to transmission of signaling information, the present invention is also applicable to the transmission of other information. [29] In a transmission end of a broadcasting/communication system, an LDPC encoder receives KldC, LDPC information bits, generates Nparity parity bits, and outputs Nidc (=Kdpc+Nty) LDPC coded bits. In the following description, for convenience' sake, the input and output of "bits" will be described, but the same description is also applied to the input and output of symbols. [30] When signaling bits of a variable length are input to an encoder, a transmission end WO 2013/032156 PCT/KR2012/006516 5 may perform shortening and/or puncturing (hereinafter referred to as "shortening/puncturing"). That is, if a length of LDPC information bits of the LDPC encoder is KldC, and signaling bits having a bit length of Ksig are input to the LDPC encoder, (Kldpc-Ksig) bits are shortened. Herein, shortening means padding (Kdipc-Ksig) '0' bits to the signaling bits for LDPC encoding, and after LDPC encoding, deleting the padded '0' bits, or reducing the size of a parity check matrix of the LDPC encoder, which has the same effect as shortening based on the padding and deletion. Further, puncturing means excluding some of encoding bits, especially, parity bits, from a transmission. [31] The transmission end of the broadcasting/communication system may use two con catenated encoders. For example, an encoder that concatenates a Bose, Chaudhuri, Hocquenghem (BCH) code with an LDPC code, i.e., a BCH/LDPC encoder, receives BCH information bits (BCH information or information bits) having Kbch bits and outputs BCH coded bits (or BCH codeword or a BCH coded block) having Nbch bits. N beh is equal to the number of LDPC information bits, Kidc, and the Nbch bits may also be referred to as LDPC information bits (or an LDPC uncoded block), which is in formation input to the LDPC encoder. The BCH coded bits, i.e., the LDPC information bits, are input to the LDPC encoder and are output as LDPC coded bits, an LDPC coded block, or an LDPC codeword having a length of Nld,,. [32] When an information word, which includes signaling bits having a variable length, is input to an encoder, a transmission end performs shortening/puncturing with respect to a codeword output from the encoder. That is, signaling bits having a bit length of Ksig are input to the BCH/LDPC encoder and (Kbch-Ksig) bits are shortened. As described above, shortening means that (Kbch-Ksig) '0' bits are padded to the input signaling bits and are BCH/LDPC encoded, and then the padded '0' bits are deleted. [33] As described above, shortening reduces a code rate, such that as the number of bits to be shortened (i.e., a shortening bit length) increases, encoding performance improves. However, when signaling information is encoded, it is preferable that encoding per formance should not vary with the length of input information. That is, when reception power in a receiver is constant, it is preferable that performance should not differ with the length of input information word. Therefore, by adjusting the number of bits to be punctured (i.e., a puncturing bit length) according to the number of bits to be shortened, stable encoding performance is provided. The number of bits to be punctured is determined according to a bit length of input information word, i.e., a bit number of the input information word, such that the number of bits to be punctured depends on the bit number of the input information word. [34] Hereinbelow, embodiments for determining an input parameter used for puncturing, i.e., the number of bits to be punctured, N,,c, will be described.
WO 2013/032156 PCT/KR2012/006516 6 [35] In one embodiment, N,..c may be calculated using one of Equations (1) to (4). [36] Equation (1) is used when a BCH code is concatenated and Equation (2) is used when a BCH code is not concatenated. That is, when the BCH code is concatenated, the number of bits to be shortened is (Kehs-Kig), such that N,,c may be calculated using Equation (1). [37] 7 N, = LA x (Kbch - K)- Bj where 0 B [38] ... (1) [39] When the BCH code is not concatenated, the number of bits to be shortened is (Kldc Ksig), such that N,,c may be calculated using Equation (2). [40] NP =A x (KC - Kj)- Bj where 0 B I [41] ... (2) [42] In Equations (1) and (2), A indicates a rate of the number of bits to be shortened to the number of bits to be punctured, and (Kch-Ksig) and (Kld-Ksi,) indicate the number of bits to be shortened. Kbh indicates the number of BCH information bits (i.e., an in formation bit length) input to generate BCH coded bits including KIdc bits through BCH encoding. KIdpC indicates the number of LDPC information bits input to generate the LDPC coded bits. Ksig indicates a bit length of an information word input to the encoder before shortening. B indicates a correction factor. The operation [ x indicates a floor function and means the largest integer less than or equal to x. [43] When the number of bits to be punctured is calculated based on Equations (1) or (2), a lower code rate can be obtained than when shortening and puncturing are not performed. In the foregoing description, if B is 0, it can be omitted. [44] Alternatively, when N,.c is calculated using Equations (3) or (4), a lower code rate can be obtained than when shortening and puncturing are not performed. [451 More specifically, when the BCH code is concatenated, the number of bits to be shortened is (Kchs-Kig), such that Nac may be calculated using Equation (3). [46] = A X (Kch - Ksg)+ B [47 ] where 0 B < N parity A(Kch - Ksgmin [48] When the BCH code is not concatenated, the number of bits to be shortened is (Kd 1 , Kig), such that Nrc may be calculated using Equation (4).
WO 2013/032156 PCT/KR2012/006516 7 [49] N,,,, LA x (Kd,, - K,,g )+ BJ [50] where 0 < B < N .- A IK parity \AKdpc Ksig min) [51] In Equations (3) and (4), A indicates a rate of the number of bits to be shortened to the number of bits to be punctured, and (Kc -Kig) and (KldpcKsig) indicate the number of bits to be shortened. Kbch indicates the number of BCH information bits (i.e., an in formation bit length) input to generate BCH coded bits composed of Kldc bits through BCH encoding. KIdc indicates the number of LDPC information bits input to generate the LDPC coded bits. Ksig indicates a bit length of an information word input to the encoder before shortening. B indicates a correction factor. Kj,_min indicates a bit length of the shortest information word among information words that can be input to the encoder. [52] In Equations (3) and (4), NQc is smaller than the number of parity bits, N,fy, only when a condition of B < Npiy - A(Klad - Kg, .) is satisfied. [53] In Equations (1) to (4), Npac may change according to the parameters A and B. Ac cordingly, a code rate may change according to A and B. When Kjdc bits are input and Nidpe coded bits are output, a code rate of an LDPC code, R, may be calculated using Equation (5). [54] K _ ldpc R= N NIdpc [55] For Ksig input information word bits, an effective code rate Rff after shortening and puncturing is calculated using Equation (6). [56] R ~Kj Reff - a i ( ... (6) Ksig + Nbch_ parity punc ) [57] In Equation (6), Nbcja,,,y indicates the number of parity bits of a BCH code, which is 0 when a BCH code is not used. [58] FIG. I is a graph illustrating a change in an effective code rate according to an em bodiment of the present invention. Specifically, FIG. 1 illustrates a change in a code rate for Kbch=2100, Kldpc= 2 160, and Nidc=8640, when A=1.35 and B=3320 are applied to Equation (3) and when A=1.32 and B=3320 are applied to Equation (3). As is shown, a code rate for transmission of information varies with A, i.e., as A increases, a WO 2013/032156 PCT/KR2012/006516 8 code rate also increases. [59] FIG. 2 illustrates a Frame Error Rate (FER) of a codeword with respect to various in formation bit lengths of 280, 396, 880, 1350, 1550, 1670, and 1900 for A=1.35 and B =3320. [601 Referring to FIG. 2, when the number of input information bits, Kig, is 280, per formance degradation occurs. Therefore, for FER= 1 Oe-4, a performance difference between the best performance and the worst performance is 0.7dB. [611 FIG. 3 illustrates an FER of a codeword with respect to various information bit lengths of 280, 396, 880, 1350, 1550, 1670, 1900 for A=1.32 and B=3320. [62] Referring to FIG. 3, a code rate is lower than that in FIG. 2, such that overall per formance improvement is achieved. In particular, when the number of input in formation bits, Ksig, is 1350, performance is much better than in other cases. It can also be seen that for FER=10e-4, a performance difference between the best performance and the worst performance is 0.7dB. [63] As described above, it is preferable that encoding performance does not differ much with an input information bit length. Thus, a method for adjusting A and B in Equations (1) to (4) according to an input information bit length is required. [64] Therefore, in accordance with an embodiment of the present invention, N, is de termined using Equations (7) and (8). [65] If Ksig < Kth Nu =LcA x (Kch - K,,g)+ Bj else .. (7) Npun =[ A 2 x (Kch - KJ) + B j [66] If K,,g < K, Npun =L A, x (Kdp, - K,,g)+ Bj else ... (8) Npuc =A 2 x (K ldpc - Kg) + B j [67] In Equations (7) and (8), different values of A and B, i.e., AI and B 1 or A 2 and B 2 are used according to an input information bit length. [68] If B, is integer, the Equation (7) can be modified to following Equation (7a). SI"""" /\ "" I " I I I "" " /I4 I II " f' A \ I " A II./I- WO 2013/032156 PCT/KR2012/006516 9 [69) ... (7a) N =IA x(K-K.)+B punch 1 l bch sig 1 [70] If A 1 =C+D (where C is integer and D is real number), the Equation (7) can be modified to following Equation (7b). [71] Nn= [A X(K1c -K,,]+B [72] = x KK + D K -K . , =CX1\Kbch -Ksjg)+[D XA (bch - sigIJ, B (7b) [73] Also, the Equation (8) can be modified in similar to the Equations (7a) and (7b). [74] In Equations (7) and (8), a case of an input information bit length being less than a predetermined threshold value KEh and a case of the input information bit length being greater than the threshold value Kh are divided. However, a plurality of threshold values may be used to divide a case of the input information bit length, such that two or more pairs of A and B may be used. [75] Kt 1 may be experimentally determined not to cause an encoding performance difference with Nunc. In particular, a value corresponding to a case where performance is relatively good or a case Where performance is relatively bad is determined as Kh 1 .In addition, different parameter pairs (A,, BI) and (A 2 , B 2 ) are determined such that for Ki, =Kh, NPc values are equal to each other. [76] As described above, the number of bits to be punctured is preferably adjusted according to the number of bits to be shortened, and the number of bits to be shortened is determined according to a bit length of an input information word. Thus, A, and A 2 indicating ratios of the number of bits to be shortened to the number of bits to be punctured may be constant values determined according to a bit length of an input in formation word. Therefore, B, and B 2 may be determined as constant values. [77] Once NPanc is determined as described above, the transmission end punctures parity bits among coded bits generated by encoding input information bits with N,.,c. [78] FIG. 4 is a graph illustrating a change in an effective code rate according to an em bodiment of the present invention, where A=1.35 and B=3320 in Equation (3), and A =1.32 and B=3320 in Equation (3) are compared with using Equations (7) and (8), which is marked as "proposed". [79] Specifically, "proposed" indicates that Kbc
,
=2100, Kldc=2160, Nldc=8640, A,=1.3, B, =3357, A 2 =1.35, B 2 =3320, and K 1 =l 350 are applied to Equation (7). As illustrated in FIG. 4, when Kig is more than 1350, which is equal to Kd, the "proposed" case shows I""% I""" /" """ r- I" r- I""" I % 1 1 r- I""" -"""""" / I""% 1 1 1 I""" ^ A \ I 1 % A II / . I""- WO 2013/032156 PCT/KR2012/006516 10 the same code rate as when A=1.35 and B=3320 in Equation (3). [80] FIG. 5 is a graph illustrating an FER according to an embodiment of the present invention. Specifically, FIG. 5 illustrates FER performance with respect to various in formation bit lengths of 280, 396, 880, 1350, 1550, 1670, and 1900. [81] Referring to FIG. 5, for an input information bit length of 280, a code rate is lower than illustrated in FIG. 2, such that performance is better. For an input information bit length of 1350, a code rate is higher than illustrated in FIG. 3, such that performance degradation occurs. Therefore, an overall performance difference is 0.3dB and an encoding performance difference is reduced when compared to FIGs. 2 and 3. [82] In the description above, the number of bits to be punctured, Np..c, is calculated by using the foregoing equations. However, in the following description, a value obtained using the foregoing equations is assumed to be a temporary value of Npnc, i.e., a temporary number of bits to be punctured, Npunc lemp, and through several processes, N rene is obtained more precisely. [83] In accordance with an embodiment of the present invention, the transmission end, when performing puncturing by using N,.,c, may more precisely adjust Np,.c according to additional parameters, e.g., the number of BCH parity bits, a modulation order, etc. Hereinafter, a procedure for calculating the final number of bits to be punctured using Npunct~mp will be described. [84] Step 1: [85] The temporary number of bits to be punctured, Npun,, is calculated using Equation (9), which is substantially the same as the above-described Equation (7) and the de scription related thereto. [86] Npunctemp = If Ksig <1350, 1.3 x (K,,, -K,)+3357j ...(9) " Otherwise, L1 .35 x (KbCh - Ksjg )+ 3320J [87] An LDPC code concatenated with a BCH code is used, and in Equation (9), values ( A,, B,)=(1,3, 3357) and (A 2 , B 2 )=(1.35, 3320) of FIG. 4 are used. [88] Step 2: [891 The temporary number of bits to be encoded, NposLemp, is calculated using Npu,_temp as shown in Equation (10). [90] Npost _temp =Ksig + bchparity dpc_ parity ext _4K punch _temp ... (10) [91] In Equation (10), Ksi indicates the number of input information bits as described above, and for example, it may indicate the number of signaling information bits. N bch-parity indicates the number of BCH parity bits, and Nidpe_pri ty_ext 4K indicates a constant value determined according to a type of an LDPC code. SI"" /\ "" I " I " % I I " "" /I- I I I " f' \ I E% A II./I- WO 2013/032156 PCT/KR2012/006516 11 [92] Step 3: [93] Taking Npostemp and a modulation order into account, the final number of bits to be encoded (a bit number of each LDPC block) is calculated using Equation (11 a): [94] - ... (11a) Np,,= "post-temp x 2 77MOD 217mOD [95] In Equation (I la), indicates a modulation order, which is 1, 2, 4, and 6 for Binary Phase Shift Keying (BPSK), Quadrature PSK (QPSK), 16-ary Quadrature Amplitude Modulation (16-QAM), and 64-ary QAM (64-QAM), respectively. [96] Determining the number of encoded bits of each information word block, No, as shown in Equation (1 Ia), causes N,, to be a multiple of the number of columns of a block interleaver. The block interleaver, although not being shown and additionally described, is used when bits of each LDPC block is bit-interleaved later. [97] When the block interleaver is not used, for example, when only BPSK and QPSK are used, Equation (I Ia) can be converted into Equation (11 b). [98] .. ... (11b) post 17MOD qMOD [99] Step 4: [100] The number of bits to be punctured among parity bits of each LDPC block, N,,, is calculated using Equation (12). [101] (2 punc p temp Ost post - temp .( [102] FIG. 6 is a flowchart illustrating a procedure for puncturing parity bits based on an input information bit length according to an embodiment of the present invention. [103] Referring to FIG. 6, in step 600, the number of input information bits including signaling information for transmission (i.e., an input information bit length) is de termined. In step 602, the transmission end checks parameters for calculating the number of bits to be punctured, i.e., a puncturing bit length. That is, the transmission end determines whether to select (A , BI) or (A 2 , B 2 ) according to the input information bit length using Equations (7) and (8). Although not shown, one of two or more prede termined parameter pairs may be selected according to the input information bit length. Alternatively, in step 602, the transmission end may obtain parameter values (A,, B, I""4 ~ ~ r I"% /" TI I"I Ir-- I I -T /I""-N II r- \r A \ I e"% A I I/ZI"" WO 2013/032156 PCT/KR2012/006516 12 )=(1.3, 3357) or (A 2 , B 2 )=(1.35, 3320) to be used in Equation (9) according to a result of comparison of the input information bit length with a predetermined threshold value of 1350. [104] In step 604, the number of parity bits to be punctured (i.e., a puncturing parity bit length) is calculated based on the determined parameters, e.g., using Equations 7 and 8 or Equations (9) to (12). In step 606, parity bits of a codeword are punctured based on the calculated puncturing parity bit length. [1051 The parity bits generated with respect to the signaling bits, which are the input in formation bits, may be transmitted in a distributed manner through the same frame as a frame in which the signaling bits are transmitted and a preceding frame. The parity bits transmitted through the same frame as that which carries the signaling bits will be referred to herein as a first parity, and the parity bits transmitted through the preceding frame will be referred to herein as a second parity or an additional parity. [106] FIG. 7 is a diagram illustrates a frame structure for transmitting two types of parity bits according to an embodiment of the present invention. [107] Referring to FIG. 7, Layer-1 signaling bits are transmitted through an i-th frame 702; a first parity 710 generated for signaling bits is transmitted through the i-th frame 702, together with the signaling bits; and an additional parity 712 is transmitted through an (i- 1)-th frame 700. [108] In accordance with an embodiment of the present invention, a reception end performs decoding based on the signaling bits and the first parity 710 received through the i-th frame 702. If decoding fails, the reception end also performs decoding using the ad ditional parity 712 received through the (i- 1)-th frame 700. [109] In accordance with another embodiment of the present invention, if decoding with respect to the signaling bits and the first parity 710 fails, the reception end determines that decoding with respect to the signaling bits fails, stores an additional parity included in the i-th frame 702, and then receives an (i+l)-th frame. [110] In accordance with yet another embodiment of the present invention, the reception end stores the additional parity 712 received through the (i-1)-th frame 700 at all times, and performs decoding based on the signaling bits and the first parity 710 received through the i-th frame 702 and the stored additional parity 712. [111] Herein below, a method for determining the number of additional parity bits will be described in more detail. [112] In accordance with an embodiment of the present invention, the number of additional parity bits may be expressed using Equation (13). [113] ... (13) Nadd _ parity= I x N _ parity fJ .. " 9- 11i WO 2013/032156 PCT/KR2012/006516 13 [114] In Equation (13), indicates a ratio of the number of first parity bits to the number of additional parity bits, where a may be a fixed value, may be selected between 0 and L-1, and Li indicates an Li additional parity ratio. may be transmitted through separate signaling 'LiAPRATIO'. When j =0, additional parity bits are not used. Ne,, indicates the number of parity bits transmitted through the same frame as that for an information word (i.e., the first parity bits), and may also mean the number of parity bits to be actually transmitted. In this case, Ne, may be calculated as Nput - Npm. [115] FIG. 8 is a diagram illustrating an LDPC code for supporting parity transmission according to an embodiment of the present invention. [116] Referring to FIG. 8, an LDPC codeword includes Ki,c LDPC information bits 800, N pt parity bits 802, and MIR Incremental Redundancy (IR) parity bits 804. For con venience, the N,,A parity bits 802 and the Mm IR parity bits 804 are collectively referred to herein as parity bits. The structure of the LDPC code illustrated in FIG. 8 is designed considering the parity bits 802. Therefore, in puncturing, the IR parity bits 804 are punctured. The LDPC code of FIG. 8 may be expressed as parity bits, without discrimination between the parity bits 802 and the IR parity bits 804. [117] To encode signaling bits 806, the LDPC information bits 800 may include the signaling bits 806, parity bits 807 for a BCH code, and '0' padding bits 808 for shortening. The parity bits 802 and the IR parity bits 804 include non-punctured parity bits 810, and punctured parity bits 812. Herein, a detailed position (i.e., an index) of each bit is not relevant to the subject matter of the present invention, i.e., which bits between the parity bits 802 and the IR parity bits 804 are to be punctured and which bits therebetween are not to be punctured. Accordingly, a specific puncturing pattern, will not be described herein. [118] The parity bits 807 of the BCH code exist when a concatenated code of the BCH code and the LDPC code is used, and the BCH parity bits 807 will be omitted when only the LDPC code is used. [119] The signaling bits 806, the BCH parity bits 807, and the non-punctured parity bits 810 form a first part 814, which is later transmitted through the i-th frame 702, as il lustrated in FIG. 7. Some of the punctured parity bits 812 form an additional parity 816, which is later transmitted through the (i-1)-th frame 700, as illustrated in FIG. 7. That is, some of the punctured parity bits 812 are the same as the additional parities 807 and 712.
WO 2013/032156 PCT/KR2012/006516 14 [120] The additional parity 708 may be determined a number of ways. For example, the punctured parity bits 812 may be preferentially selected as an additional parity. [121] For Kb h = 2 lO, Kidpc= 2 1 6 0, Nld,= 4 3 2 0, and Mm = 4320, RIdpc = Kijpc/Ndpc = 1/2 and R m = Krdpc/(NJdpc+Mdpe) = 1/4. In this case, according to an embodiment of the present invention, Num may be calculated, based on Equation 7, using Equation (14) below. [122] If K.1 <1350 (4) If ig <1 N =L1.3x(Kch - Kj)+3357j else N = [1.35 X (KC, -Kj)+ 3320J [123] In Equation (14), A1=1.3, B 1 =3357, A 2 =1.35, B 2 =3320, and Kth=13 5 0. Therefore, among the parity bits 802 and the IR parity bits 804, Npan parity bits based on Equation (14) are punctured. [124] In accordance with another embodiment of the present invention, Np c parity bits obtained based on Np,.em, of Equation (9), using Equations (10) to (12), may be punctured. [125] Detailed values of parameters used to calculate Npc may be determined according to a modulation scheme used for transmission and the number of Orthogonal Frequency Division Multiplexing (OFDM) symbols. For example, when 2n-Quadrature Amplitude Modulation (QAM) is used as a modulation scheme, the number of bits to be transmitted, (Kig+Nbcpay+Npay+MIR-Np,,c) is a multiple of n. Herein, Ki, indicates the number of input signaling information bits, Nbc__,,iy indicates the number of parity bits of a BCH code, and n indicates an order of a modulation scheme. [126] The number of bits of the additional parity 712 of FIG. 7 or the additional parity 816 of FIG. 8 may be calculated using Equation (15). [127] Nadd _pariy = 0.35 .I, -(N,,,t ± Mfp -N,,c 1 = (0,1,2,3} -0.35 -1, -(6480 - N ) .. (15) [128] In Equation (15), IO=0, 11=1, I2=2, and 13=3. Further, =0.35 is applied to Equation (13), where is a value selected to satisfy Equation (16) below. [129] a= max, J(x -IL-1 +1).(Nr,,+MIR -(Kch - KsBg_max 2 )< Nprity+ MIR [130] ... (16) I-4 "" 4""I ""II" P4 NI I" I"" I" /1- 1 1 "" A- 1 \ I I"- A IIN I- WO 2013/032156 PCT/KR2012/006516 15 [131] That is, is determined to be a maximum value among values in which a sum of a. the number of first parity bits, Npaty, and the number of additional parity bits, N add-paity, which are transmitted when I, is the maximum value IL. and Kig is the maximum length among input information bits, Kig., that is, (Ntpai + Naddaparity) is maximal and the sum is less than (No,,y + Mm). [132] When the maximum length among the input information bits, Kigax, is 2100, Npm = 3320, such that Npty = 3160, and when I, is the maximum value 'L1= 13= 3, Nasddpafty = 0.35x3x3160 = 3318, such that Ncprty + Nada_pty = 6478, which is less than Np,,y + Mm = 6480. [1331 Hereinafter, an embodiment for obtaining more precise Nadd._paty considering a modulation scheme used for transmission based on Naddpa#y obtained through the foregoing equations will be described. [134] Equation (16) assumes that the BPSK modulation scheme is used. That is, U is de termined such that the number of first parity bits and the number of additional parity bits transmitted when using the BPSK modulation scheme is used is less than Nwity + MIR. Therefore, when another modulation scheme, e.g., QPSK, 16-QAM, or 64-QAM is used, correction with respect to Nadd_pAty is required such that the number of first parity bits and the number of additional parity bits is less than Npart + MIR. Therefore, the number of temporary additional parity bits may be obtained using Equation (17). [135] Ndd parity temp = min((Np,,,ty - NP, 0.35 x K -(N ,,,, - Npn)J * (17) [136] In Equation (17), K indicates an LI additional parity ratio, and is another expression of I, from Equations (13) and (15). In accordance with an embodiment of the present invention, K may be transmitted from the transmitter to the receiver through signaling 'LIAPRATIO'. For example, 'LLAPRATIO' is a 2-bit parameter, and when this parameter is '00', K=0; for the parameter of '01', K=1; K=2 for the parameter of '10'; and K=3 for the parameter of '11'. [137] Taking Naddpanjyemp of Equation (17) and a modulation order, the final number of ad ditional parity bits may be calculated using Equation (18a). [138] (1 8a) Nad-_ = add_ parity temp ad _ parity ~"~ MOD 2MOD [139] In Equation (18a), SMOD indicates a modulation order, which is 1, 2, 4, and 6 for WO 2013/032156 PCT/KR2012/006516 16 BPSK, QPSK, 16-QAM, and 64-QAM, respectively. [140] The number of additional parity bits, Nadd_,,aity, is adjusted in Equation (18a) to cause Naddparity to be a multiple of the number of columns of the block interleaver. The block interleaver is used when each bit of the additional parity is bit-interleaved. [141] When the block interleaver is not used, e.g., when only BPSK and QPSK are used, Equation (1 8a) can be converted into Equation (1 8b). [142] ... (18b) N -- Nadd _parity _temp Nadd _ aity ~- )MOD 17MOD_ [143] Naa.ay is determined according to the number of OFDM symbols used for transmission. [144] Information about the number of additional parity bits can be transmitted from the transmitter to the receiver through a signaling parameter 'LIAPSIZE'. If a plurality of LDPC coded blocks are used for transmission, LlAPSIZE indicates a product of the number of coded blocks and Naasay. For example, when two coded blocks are used, 'LIAPSIZE' may indicate 2 xNadd-pariy. The receiver may know the number of additional parity bits from that signaling parameter. [145] FIG. 9 is a graph illustrating a code rate when a number of additional parity bits is calculated using Equation (15), according to an embodiment of the present invention. [146] Specifically, the code rate is calculated using Equation (19). [147] ... (19) Ksig + tx _ parity + Nadd _parity [148] In Equation (19), Nx_paity indicates the number of parity bits of the first part 814 of FIG. 8, and Npc + MIR - N,.c = 6480 - N,.c. Nadparity indicates the number of ad ditional parity bits of the part 816 of FIG. 8. [149) In FIG. 9, Additional Parity (AP)=0 corresponds to a code rate for Io=O in which the additional parity is not used, AP=1 corresponds to a code rate for I=l, AP=2 cor responds to a code rate for I2=2, and AP=3 corresponds to a code rate for 13=3. [150] In accordance with another embodiment of the present invention, the IR parity bits 804 of the LDPC code in FIG. 8 may be selectively used. That is, the parity bits 802 are preferentially generated for input information word bits, and the IR parity bits 804 may be generated only when the IR parity is necessary, thereby improving encoding/ decoding efficiency. [151] As described above, the parity bits 802 are preferentially generated for input in formation bits, and for the parity bits 802, N,,c may be calculated based on Equation WO 2013/032156 PCT/KR2012/006516 17 (7), as shown in Equation (20). [152] ... (20) If Kig <1350 N = L1.3 x (Kbch -Ks)-963j else N =L1.35x(Kc 7K )-1000] [153] In Equation (20), if N,.c is a positive integer, only the parity bits 802 are generated and only N,.c parity bits of the parity bits 802 are punctured. However, if Nrc is a negative value, both the parity bits 802 and the IR parity bits 804 are generated, and then only (Mm + N,.c) bits of the IR parity bits 804 are punctured. [154] According to another embodiment of the present invention, N,,c (obtained using Equations (10) to (12), based on Equation (20)) parity bits are punctured. [155] FIG. 10 is a flowchart illustrating a procedure for determining a number of two types of parity bits according to an embodiment of the present invention. [156] Referring to FIG. 10, in step 1000, the number of parity bits to be punctured is calculated using Equations (7) and (8) or Equations (9) to (12). In step 1002, pa rameters, I,, and Np., which are used in Equation (13), (15), and (17), are de termined. In step 1002, already-determined U or I, may be used, and I, is expressed as K in Equations (17) and (18). As described above, K may be indicated by separate signaling 'LlAPRATIO'. [157] In step 1004, the number of additional parity bits, Nadd_,,y, is determined based on Equation (13) or Equations (17) and (18), using the parameters determined in step 1002. In step 1006, the additional parity bits are configured according to the calculated number of additional parity bits. [158] FIG. 11 is a block diagram of a transmission end according to an embodiment of the present invention. [159] Referring to FIG. 11, the transmission end includes an encoder 1101, a puncturer 1103, a controller 1105, a modulator 1107, a Radio Frequency (RF) processor 1109, and selectively, an additional parity configuring unit 1111. [160] The encoder 1101 outputs encoded bits generated by encoding information word bits for transmission. For example, when a BCH/LDPC code is used, the encoder 1101 encodes BCH information bits having Kh bits to generate a BCH codeword having K Idpc bits. Thereafter, the encoder 1101 performs LDPC-encoding on the BCH codeword, thus generating and outputting an LDPC codeword having Nidp bits. P- 1-"" / 1" 1"" - 1""P 1% II" I"- I /P1- 1 1 "" A- \ I I"- A IN /P" WO 2013/032156 PCT/KR2012/006516 18 [161] Alternatively, the encoder 1101 generates and outputs an LDPC codeword having (N idpc + MIR) bits. [162] Although not illustrated, the BCH information bits having Kbch bits may be configured by padding (Kbch - Ksig) '0' bits into Ksig input information bits. The padded (Kbch - Ksig) '0' bits are not to be transmitted. [163] The puncturer 1103 punctures a codeword provided from the encoder 1101 according to a puncturing pattern and a puncturing bit length (Kbch - Ksig), which are provided from the controller 1105. The controller 1105 calculates the puncturing bit length according to the number of information bits to control the puncturer 1103. For example, the controller 1105 determines A and B according to the number of input in formation bits (or the number of signaling bits) for transmission at the transmission end, and provides the determined A and B to the puncturer 1103. [164] Alternatively, the controller 1105 obtains the number of bits to be punctured from the determined parameters A and B, and provides the obtained number of bits to be punctured to the puncturer 1103. The modulator 1107 modulates, according to a corre sponding modulation scheme, and outputs a signal provided from the puncturer 1103. The RF unit 1109 converts the modulated signal provided from the modulator 1107 into a high-frequency signal and transmits the high-frequency signal through an antenna. [165] If additional parity bits are to be transmitted, the controller 1105 determines the number of additional parity bits, as illustrated in FIG. 10, and provides the determined number of additional parity bits to the additional parity configuring unit 1111. The ad ditional parity configuring unit 1111 configures the additional parity bits and provides them to the modulator 1107. It should be noted that additional parities generated in the current frame are transmitted through a previous frame. [166] Assuming (Nidpc, Kldpc) LDPC encoding, (Kldpc - Ksig) bits are shortened for an input information bit length Ksig. If a BCH code is concatenated, (Kbh - Ksig) bits are shortened for a BCH information bit length Kbch [167] FIG. 12 is a block diagram of a reception end according to an embodiment of the present invention. [168] Referring to FIG. 12, the reception end includes an RF unit 1200, a demodulator 1202, a shortening/puncturing processor 1204, a decoder 1206, a controller 1208, and selectively, an additional parity processing unit 1210. [169] The RF unit 1200 receives a signal transmitted from the RF unit 1109 of the transmission end and provides the signal to the demodulator 1202. [170] The demodulator 1202 demodulates the signal provided from the RF unit 1200 by utilizing a demodulation scheme corresponding to a modulation scheme used in the modulator 1107 of the transmission end. For example, the demodulator 1202 obtains a WO 2013/032156 PCT/KR2012/006516 19 Log Likely Ratio (LLR), by taking a log of a ratio of a probability of each bit being 1 to a probability of each bit being 0 for each of shortened/punctured encoded bits and additional parity bits transmitted from the modulator 1107, and provides the obtained LLR to the shortening/puncturing processor 1204 and the additional parity processing unit 1210. The additional parity processor 1201 is optional, in that it is not used when additional parity is not received. [171] The shortening/puncturing processor 1204 receives an output signal of the de modulator 1202, generates values corresponding to shortening and puncturing with respect to the bits shortened and punctured by the transmission end, and pads the values to the output signal of the demodulator 1202. For example, for a shortened bit, an LLR value is the (+) or (-) maximum value among a decoder input value, and for a punctured bit, an LLR value is '0'. The shortening/puncturing processor 1204 receives information about the number of shortened and punctured bits and index from the controller 1208. That is, the controller 1208 calculates a puncturing bit length according to the number of information bits of the encoder 1101 of the transmission end and controls the shortening/puncturing processor 1204. [172] For example, the controller 1208 determines A and B according to the number of bits of signaling information for transmission at the transmission end, as illustrated in FIG. 6, and provides the determined A and B to the shortening/puncturing processor 1204. [173] Alternatively, the controller 1208 obtains the number of bits to be punctured from the determined parameters A and B and provides the obtained number of bits to be punctured to the shortening/puncturing processor 1204. Information about the number of input information bits input to the encoder of the transmission end may be transmitted to the controller 1208 of the receiver through, for example, additional signaling. [174] The decoder 1206 receives and decodes output values of the shortening/puncturing processor 1204 to reconstruct information word bits. For example, when a BCH/LDPC code is used, the decoder 1206 receives Nidc or (NldPC+MIR) LLR values and performs LDPC-decoding thereon to reconstruct Kldc bits, and then reconstruct Kbch information word bits through BCH decoding. [175] When additional parity bits are transmitted, the controller 1208 determines the number of additional parity bits, as illustrated in FIG. 10, and provides the determined number of additional parity bits to the additional parity processing unit 1210. The ad ditional parity processing unit 1210 receives LLR values for the additional parity bits generated by the transmission end from the demodulator 1202 and provides the LLR values to the decoder 1206. The decoder 1206 performs decoding by using both the values provided from the shortening/puncturing processor 1204 and the values provided from the additional parity processing unit 1210. It should be noted that ad- WO 2013/032156 PCT/KR2012/006516 20 ditional parities received in the current frame are used in decoding of the next frame according to processing at the transmitter. That is, in decoding of a code received in the current frame, additional parity bits received in the previous frame are used. [176] According to the above-described embodiments of the present invention, by adaptively selecting a shortening/puncturing rate based on channel status information required in a broadcasting/communication system, similar performance is maintained, regardless of a length of an information word, thereby maintaining system stability. [177] While the present invention has been particularly shown and described with reference to certain embodiments thereof, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the following claims and their equivalents.
Claims (1)
16-ary Quadrature Amplitude Modulation (16-QAM), and 64-ary QAM (64-QAM), respectively, and Nad-.paity tem, is determined by: N addar ,,, =min ((N - N ,l0.35xK(N ,, - N ), where Npaty indicates the number of parity bits, N,,, indicates the number of bits to be punctured, and K indicates an additional parity ratio. (Claim 7] A method for receiving information in a broadcasting/communication system, the method comprising: comparing a number of bits of an information word transmitted by a transmission end with a predetermined threshold value; determining a first parameter pair, if the number of bits of the in formation word is less than the predetermined threshold value; determining a second parameter pair, if the number of bits of the in formation word is not less than the predetermined threshold value; determining a number of bits to be punctured, based on one of the first parameter pair and the second parameter pair; generating values corresponding to bits punctured by the transmission end and padding the generated values to a modulated signal of a WO 2013/032156 PCT/KR2012/006516 23 received signal to generate a decoder input by using the determined number of bits to be punctured; and decoding the decoder input to reconstruct information word bits. [Claim 8] The method of claim 7, wherein determining the number of bits to be punctured comprises: calculating a temporary number of bits to be punctured based on one of the first parameter pair and the second parameter pair; calculating a temporary number of encoded bits based on the calculated temporary number of bits to be punctured; calculating a final number of encoded bits based on the temporary number of encoded bits and a modulation order; and determining the number of bits to be punctured based on the temporary number of bits to be punctured, the temporary number of encoded bits, and the final number of encoded bits. [Claim 9] The method of claim 8, wherein the temporary number of bits to be punctured is determined by: fIf Kg <1350,L 1.3 x (K,, - K,)+3357J Npunc-temp -Otherwise, L1.35x(KCh -Kig)+3320J wherein N,,,, indicates the temporary number of bits to be punctured, Kbch indicates an input bit length of a Bose, Chaudhuri, Hoc quenghem (BCH) encoder, Kjg indicates the number of bits of the in formation word, (1.3, 3357) indicates the first parameter pair, (1.35, 3320) indicates the second parameter pair, and the predetermined threshold value is 1350. [Claim 10] The method of claim 7, further comprising: determining at least one third parameter for determining an additional parity bit length; determining the additional parity bit length based on the at least one third parameter; and generating values corresponding to bits additionally punctured by the transmission end by using the additional parity bit length and padding the generated values corresponding to the additionally punctured bits to the modulated signal of the received signal to generate the decoder input. [Claim 11] The method of claim 10, wherein the at least one third parameter includes at least one of a ratio of the number of first parity bits transmitted in a frame transmitting the information word to the number WO 2013/032156 PCT/KR2012/006516 24 of additional parity bits, and a number of first parity bits, Neparay. [Claim 12] The method of claim 10, wherein the additional parity bit length is de termined by: addpariy addPariytemp Naddpariy 27MOD x27 where indicates a modulation order which is 1, 2, 4, and 6 for Binary Phase Shift Keying (BPSK), Quadrature PSK (QPSK), 16-ary Quadrature Amplitude Modulation (16-QAM), and 64-ary QAM (64-QAM), respectively, and Nddparitytemp is determined by: Nadd_,,,,,,,,, = minNp,, - N,C),LO.35 x K (Nj,., - N,J)) where Naray indicates the number of parity bits, Npu indicates the number of bits to be punctured, and K indicates an additional parity ratio. [Claim 13] An apparatus for transmitting information in a broadcasting/commu nication system and to perform all or part of the method of any of claims 1 to 6. [Claim 141 An apparatus for receiving information in a broadcasting/commu nication system and to perform all or part of the method of any of claims 7 to 12.
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR10-2011-0087464 | 2011-08-30 | ||
KR20110087464 | 2011-08-30 | ||
KR1020120005565A KR101922555B1 (en) | 2011-08-30 | 2012-01-18 | Method and apparatus transmitting and receiving information in broadcasting/communication system |
KR10-2012-0005565 | 2012-01-18 | ||
PCT/KR2012/006516 WO2013032156A1 (en) | 2011-08-30 | 2012-08-16 | Method and apparatus for transmitting and receiving information in a broadcasting/communication system |
Publications (2)
Publication Number | Publication Date |
---|---|
AU2012302460A1 true AU2012302460A1 (en) | 2014-03-06 |
AU2012302460B2 AU2012302460B2 (en) | 2016-09-08 |
Family
ID=48176721
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
AU2012302460A Ceased AU2012302460B2 (en) | 2011-08-30 | 2012-08-16 | Method and apparatus for transmitting and receiving information in a broadcasting/communication system |
Country Status (6)
Country | Link |
---|---|
JP (1) | JP5964969B2 (en) |
KR (1) | KR101922555B1 (en) |
CN (1) | CN103765781B (en) |
AU (1) | AU2012302460B2 (en) |
IN (1) | IN2014CN02200A (en) |
RU (1) | RU2609067C2 (en) |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR102221303B1 (en) * | 2013-07-05 | 2021-03-02 | 엘지전자 주식회사 | Apparatus for transmitting broadcast signals, apparatus for receiving broadcast signals, method for transmitting broadcast signals and method for receiving broadcast signals |
US9553613B2 (en) | 2013-09-18 | 2017-01-24 | Samsung Electronics Co., Ltd. | Transmitter and puncturing method thereof |
KR102177807B1 (en) * | 2014-08-22 | 2020-11-11 | 삼성전자주식회사 | Method and apparatus for shortening and puncturing of non binary codes |
KR101800423B1 (en) * | 2015-02-13 | 2017-11-23 | 삼성전자주식회사 | Transmitter and additional parity generating method thereof |
WO2016129975A2 (en) | 2015-02-13 | 2016-08-18 | Samsung Electronics Co., Ltd. | Transmitter and additional parity generating method thereof |
KR101776273B1 (en) * | 2015-02-25 | 2017-09-07 | 삼성전자주식회사 | Transmitter and method for generating additional parity thereof |
US10411737B2 (en) | 2015-02-25 | 2019-09-10 | Samsung Electronics Co., Ltd. | Transmitter and method for generating additional parity thereof |
MX373706B (en) | 2015-02-27 | 2025-03-05 | Electronics & Telecommunications Res Inst | PARITY PUNCTURE DEVICE FOR ENCODING FIXED-LENGTH SIGNALING INFORMATION AND PARITY PUNCTURE METHOD USING SAME. |
WO2016137255A1 (en) * | 2015-02-27 | 2016-09-01 | 한국전자통신연구원 | Parity puncturing device for variable-length signaling information encoding, and parity puncturing method using same |
KR102453472B1 (en) | 2015-02-27 | 2022-10-14 | 한국전자통신연구원 | Apparatus of parity puncturing for encoding variable-length signaling information and method using the same |
WO2016137204A1 (en) | 2015-02-27 | 2016-09-01 | 한국전자통신연구원 | Parity interleaving apparatus for encoding fixed-length signaling information, and parity interleaving method using same |
KR102453473B1 (en) * | 2015-02-27 | 2022-10-14 | 한국전자통신연구원 | Apparatus of parity puncturing for encoding fixed-length signaling information and method using the same |
WO2016137254A1 (en) | 2015-02-27 | 2016-09-01 | 한국전자통신연구원 | Parity interleaving apparatus for encoding variable-length signaling information and parity interleaving method using same |
KR102453474B1 (en) | 2015-02-27 | 2022-10-14 | 한국전자통신연구원 | Apparatus of parity interleaving for encoding variable-length signaling information and method using the same |
KR102453476B1 (en) | 2015-02-27 | 2022-10-14 | 한국전자통신연구원 | Apparatus of parity interleaving for encoding fixed-length signaling information and method using the same |
KR101800417B1 (en) * | 2015-03-02 | 2017-11-23 | 삼성전자주식회사 | Transmitter and segmentation method thereof |
WO2016140511A1 (en) | 2015-03-02 | 2016-09-09 | Samsung Electronics Co., Ltd. | Transmitter and method for generating additional parity thereof |
KR101800420B1 (en) * | 2015-03-02 | 2017-11-23 | 삼성전자주식회사 | Transmitter and puncturing method thereof |
US10396818B2 (en) | 2015-03-02 | 2019-08-27 | Samsung Electronics Co., Ltd. | Transmitter and segmentation method thereof |
KR101800414B1 (en) * | 2015-03-02 | 2017-11-23 | 삼성전자주식회사 | Transmitter and additional parity generating method thereof |
CN112260800B (en) * | 2015-03-02 | 2024-02-23 | 三星电子株式会社 | Transmitting apparatus and receiving apparatus |
US11258536B2 (en) | 2017-08-10 | 2022-02-22 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding/decoding channel in communication or broadcasting system |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1317070A1 (en) * | 2001-12-03 | 2003-06-04 | Mitsubishi Electric Information Technology Centre Europe B.V. | Method for obtaining from a block turbo-code an error correcting code of desired parameters |
WO2006039801A1 (en) * | 2004-10-12 | 2006-04-20 | Nortel Networks Limited | System and method for low density parity check encoding of data |
US7581159B2 (en) | 2004-11-23 | 2009-08-25 | Texas Instruments Incorporated | Simplified decoding using structured and punctured LDPC codes |
US7953047B2 (en) * | 2005-01-24 | 2011-05-31 | Qualcomm Incorporated | Parser for multiple data streams in a communication system |
US7661037B2 (en) * | 2005-10-27 | 2010-02-09 | Samsung Electronics Co., Ltd. | LDPC concatenation rules for IEEE 802.11n systems |
US7584406B2 (en) * | 2005-12-20 | 2009-09-01 | Samsung Electronics Co., Ltd. | LDPC concatenation rules for IEEE 802.11n system with packets length specific in octets |
EP2381582B1 (en) * | 2007-12-06 | 2013-04-10 | Samsung Electronics Co., Ltd. | Method and apparatus for channel encoding in a communication system using low-density parity-check codes |
KR101502623B1 (en) * | 2008-02-11 | 2015-03-16 | 삼성전자주식회사 | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes |
KR20090095432A (en) * | 2008-03-03 | 2009-09-09 | 삼성전자주식회사 | Apparatus and method for channel encoding and decoding in communication system using low-density parity-check codes |
PL2388941T3 (en) * | 2008-03-03 | 2019-03-29 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting encoded control information in a wireless communication system |
KR20090094738A (en) * | 2008-03-03 | 2009-09-08 | 삼성전자주식회사 | Apparatus and method for encoding signalling information in radio communication system |
CN101630989B (en) * | 2008-07-14 | 2012-10-03 | 上海华为技术有限公司 | Method and device for data transmission and communication system |
CN101753264B (en) * | 2008-12-18 | 2013-06-12 | 华为技术有限公司 | Acquisition method and device for evaluating threshold value of perforation pattern performance |
CN101567697B (en) * | 2009-05-25 | 2012-12-12 | 普天信息技术研究院有限公司 | Coder and method for coding rate-compatible low-density parity-check codes |
EP2337259B1 (en) * | 2009-11-18 | 2021-08-25 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting and receiving data in a communication system |
-
2012
- 2012-01-18 KR KR1020120005565A patent/KR101922555B1/en not_active Expired - Fee Related
- 2012-08-16 IN IN2200CHN2014 patent/IN2014CN02200A/en unknown
- 2012-08-16 AU AU2012302460A patent/AU2012302460B2/en not_active Ceased
- 2012-08-16 JP JP2014528262A patent/JP5964969B2/en active Active
- 2012-08-16 RU RU2014112217A patent/RU2609067C2/en active
- 2012-08-16 CN CN201280041485.8A patent/CN103765781B/en active Active
Also Published As
Publication number | Publication date |
---|---|
KR20130024704A (en) | 2013-03-08 |
CN103765781A (en) | 2014-04-30 |
JP5964969B2 (en) | 2016-08-03 |
RU2014112217A (en) | 2015-10-10 |
JP2014525710A (en) | 2014-09-29 |
IN2014CN02200A (en) | 2015-05-29 |
AU2012302460B2 (en) | 2016-09-08 |
RU2609067C2 (en) | 2017-01-30 |
KR101922555B1 (en) | 2018-11-28 |
CN103765781B (en) | 2017-05-31 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2012302460A1 (en) | Method and apparatus for transmitting and receiving information in a broadcasting/communication system | |
EP2566086B1 (en) | Method and apparatus for transmitting and receiving information in a broadcasting/communication system | |
US8887030B2 (en) | Encoder and encoding method providing incremental redundancy | |
EP2490337B1 (en) | Method and apparatus for encoding and decoding in a communication system using low-density parity check codes | |
US9385752B2 (en) | Encoder and encoding method providing incremental redundancy | |
US20180309600A1 (en) | Method and apparatus for transmitting and receiving data in a communication system | |
KR101972131B1 (en) | Apparatus and method for transmitting and receiving data in communication system | |
CN101238694A (en) | Apparatus and associated method for distributing communications in a multi-channel communications system | |
US20100192047A1 (en) | Transmitting device and transmitting method | |
CN104168084A (en) | Symbol interleaving and de-interleaving method and device adaptive to modulation coding scheme | |
KR20230107872A (en) | Data decoding method and apparatus in communication or broadcasting system | |
EP2538597B1 (en) | Method and apparatus for transmitting and receiving data in a broadcasting system | |
KR102509968B1 (en) | Apparatus and method of transmission using harq in communication or broadcasting system | |
CN104184550A (en) | Symbol interlacing and de-interlacing method and device adaptive to three-dimensional information | |
WO2011104144A1 (en) | Encoder and encoding method providing incremental redundancy |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FGA | Letters patent sealed or granted (standard patent) | ||
MK14 | Patent ceased section 143(a) (annual fees not paid) or expired |