HK40008606B

HK40008606B - Method for performing encoding on basis of parity check matrix of low density parity check (ldpc) code in wireless communication system and terminal using same

Info

Publication number: HK40008606B
Application number: HK19132490.4A
Authority: HK
Inventors: Byun Ilmu; Shin Jongwoong; Kim Jinwoo; Noh Kwangseok; Kim Bonghoe
Original assignee: Lg 电子株式会社
Priority date: 2017-03-30
Filing date: 2018-03-30
Publication date: 2022-11-25

Description

Method of performing encoding based on parity check matrix of Low Density Parity Check (LDPC) code in wireless communication system and terminal using the same

Technical Field

The present disclosure relates to wireless communication, and more particularly, to a method of performing encoding based on a parity check matrix of an LDPC code in a wireless communication system and a user equipment using the same.

Background

Conventional Low Density Parity Check (LDPC) encoding methods have been used in wireless communication systems, such as IEEE 802.11n Wireless Local Area Network (WLAN) systems, IEEE 802.16e mobile WiMax systems, and DVB-S2 systems. The LDPC encoding method is basically a kind of linear block code, and thus, the operation of the LDPC encoding method is performed by multiplying a parity check matrix by an input vector.

It is predicted that data transmission for fifth generation (5G) communication will support from a maximum of 20Gbps to a minimum of several tens of bps (e.g., 40 bits in the case of LTE). In other words, in order to support a wide range of data transmission, various code rates need to be supported. To meet such requirements, various encoding methods based on LDPC codes are under discussion.

Disclosure of Invention

Technical problem

An object of the present disclosure is to provide a method of performing encoding based on a parity check matrix of an LDPC code and a user equipment using the same, which are advantageous in terms of delay in transmission of short blocks having a relatively short length.

Technical scheme

According to an aspect of the present disclosure, provided herein is a method of performing encoding based on a parity check matrix of a Low Density Parity Check (LDPC) code, including: generating, by the user equipment, a parity check matrix, wherein the parity check matrix corresponds to a feature matrix, each element in the feature matrix corresponds to a shift index value determined by a modulo operation between a corresponding element in a base matrix and a lifting value Zc, and the base matrix is a 42 × 52 matrix; and performing, by the user equipment, encoding on the input data using the parity check matrix, wherein the lifting value is associated with a length of the input data.

Advantageous effects

According to an embodiment of the present disclosure, there are provided a method of performing encoding based on a parity check matrix of an LDPC code and a user equipment using the same, which are advantageous in terms of delay in transmission of a short block having a relatively short length.

Drawings

Fig. 1 is a block diagram of a wireless communication system in accordance with an embodiment of the present disclosure.

Fig. 2 is a diagram referred to explain the characteristics of the submatrix P.

Fig. 3 is a diagram illustrating a parity check matrix according to an embodiment of the present disclosure.

Fig. 4 is a diagram illustrating a feature matrix corresponding to a parity check matrix according to an embodiment of the present disclosure.

Fig. 5 is a diagram illustrating a structure of a base matrix for a parity check matrix according to an embodiment of the present disclosure.

Fig. 6 illustrates a matrix a belonging to a base matrix according to an embodiment of the present disclosure.

Fig. 7a and 7b illustrate a matrix C belonging to a base matrix according to an embodiment of the present disclosure.

Fig. 8a and 8b illustrate a matrix C belonging to a base matrix according to an embodiment of the present disclosure.

Fig. 9 is a flowchart illustrating a method of performing encoding based on a parity check matrix of an LDPC code according to an embodiment of the present disclosure.

Fig. 10 is a flowchart illustrating a method of performing a decoding process for a transport block based on either one of two types of parity check matrices according to another embodiment of the present disclosure.

Fig. 11 is a flowchart illustrating a method of performing code block segmentation based on an LDPC parity check matrix according to another embodiment of the present disclosure.

Fig. 12 is a flowchart illustrating a method of performing a decoding process based on a parity check matrix according to another embodiment of the present disclosure.

Detailed Description

The above described features and the following detailed description are merely exemplary details given to facilitate the description and understanding of the present disclosure. More particularly, the present disclosure may be embodied in another form and is not limited to only the exemplary embodiments presented herein. The following exemplary embodiments are merely examples given to fully disclose the present disclosure and to describe the present disclosure to those skilled in the art to which the present disclosure pertains. Thus, if multiple methods exist for implementing elements of the disclosure, it should be clear that the disclosure can be implemented in any one particular or similar way.

In the present disclosure, if a structure is described as including a specific element, or if a process is described as including a specific process step, this indicates that other elements or other process steps may be further included. More particularly, the terms used in the present disclosure are given only to describe specific exemplary embodiments of the present disclosure and it will be apparent that such terms are not to be used to limit the concepts or ideas of the present disclosure. Furthermore, it will also be apparent that examples given to facilitate understanding of the invention also include additional embodiments of the given examples.

Each of the terms used in the present disclosure is given a meaning that can be generally understood by those skilled in the art to which the present disclosure pertains. Each of the terms commonly used herein should be understood and interpreted according to their consistent meaning in the context of the present disclosure. Moreover, unless clearly defined otherwise, terms used in the present disclosure should not be construed to be unduly ideal or formal meaning. The drawings are given to describe example embodiments of the disclosure.

Referring to fig. 1, a wireless communication system may include a transmitting User Equipment (UE)10 and a receiving UE 20.

The transmitting UE 10 may include an LDPC encoder 100 and a modulator 200. The LDPC encoder 100 may receive data m, encode the received data m, and output a codeword c. Modulator 200 may receive codeword c and perform radio modulation on the received codeword c. The radio modulated codeword may be transmitted to the receiving UE 20 through an antenna.

It is understood that a processor (not shown) of the transmitting UE 10 includes the LDPC encoder 100 and the modulator 200 and is connected to an antenna of the transmitting UE 10.

The receiving UE 20 may include a demodulator 300 and an LDPC decoder 400. Demodulator 300 may receive the radio modulated codeword through the antenna and demodulate the radio modulated codeword into codeword c. LDPC decoder 400 may receive codeword c, decode codeword c, and output data m.

It is understood that a processor (not shown) of the receiving UE 20 includes the demodulator 300 and the LDPC decoder 400 and is connected to an antenna of the receiving UE 20.

In other words, the wireless communication system of fig. 1 may encode data m into codeword c using the LDPC encoder 100 and decode the codeword c into data m using the LDPC decoder 400.

Thus, data can be stably transmitted and received between the transmitting UE 10 and the receiving UE 20. The LDPC encoding method and decoding method according to the present embodiment may be performed based on the parity check matrix H.

In the present disclosure, the data m may be referred to as input data. The parity check matrix H may represent a matrix for checking whether an error is included in the codeword c received by the LDPC decoder 400. The parity check matrix H may be prestored in a memory (not shown) of each of the transmitting UE 10 and the receiving UE 20.

Hereinafter, embodiments of the present disclosure will be described on the premise that a quasi-cyclic LDPC code is applied. The parity check matrix H may include a plurality of sub-matrices P. Each sub-matrix P may be a zero matrix O, or a circulant matrix obtained by shifting an identity matrix I.

To encode data from a general linear block code, a matrix G needs to be generated. From the above assumption, since the present embodiment is based on the quasi-cyclic LDPC method, the LDPC encoder 100 can encode data m into a codeword c using the parity check matrix H without an additional generator matrix G.

The LDPC encoder 100 may encode the data m into a codeword c using a parity check matrix H.

Equation 1

c＝[m p]

Referring to equation 1, a codeword c generated by the LDPC encoder 100 may be divided into data m and check bits p.

For example, the data m may correspond to a binary data set [ m _0, m _1, m _2, …, m _ K-1 ]. That is, it can be understood that the length of data m to be encoded is K.

For example, the check bit p may correspond to a binary data set [ p _0, p _1, p _2, … p _ N +2Zc-K-1 ]. That is, it can be understood that the length of the check bits p is N +2 Zc-K. In this case, N may be 50Zc (i.e., N ═ 50 Zc). Zc will be described in detail later with reference to the drawings.

From the perspective of LDPC encoder 100, the check bits p used to encode data m may be derived using a parity check matrix H.

Further, it may be assumed that, on the channel coding chain, initial data of a transport block size (hereinafter, "TBS") exceeding a preset threshold size (i.e., Kcb, e.g., 8448 bits) is received from a higher layer.

In this case, the initial data may be divided into at least two data depending on the length K of the data to be encoded (where K is a natural number). In other words, the length K of the data m can be understood as a Code Block Size (CBS).

It is understood that the parity check matrix H according to an embodiment of the present disclosure is applied when the CBS does not exceed a predetermined threshold (e.g., 2040 bits).

Meanwhile, the LDPC decoder 400 may determine whether an error exists in the received codeword c based on the parity check matrix H. Whether an error exists in the received codeword c may be checked by the LDPC decoder 400 based on equation 2.

Equation 2

H·c^T＝0

As indicated in equation 2, when the transpose matrix that multiplies the parity check matrix H by the codeword c is "0", the codeword c received by the receiving UE 20 may be determined not to include an error value.

When the transpose matrix that multiplies the parity check matrix H by the codeword c is not "0," the codeword c received by the receiving UE 20 may be determined to include an error value.

Fig. 2 is a diagram referred to explain the characteristics of the submatrix P.

Referring to fig. 1 and 2, the parity check matrix H may include a plurality of sub-matrices P _ y (where y is an integer). In this case, it can be understood that each sub-matrix P _ y is a matrix obtained by shifting an identity matrix I having a size Zc × Zc to the right by a specific value y.

In particular, since the subscript y of the submatrix P _1 of fig. 2 is "1", the submatrix P _1 may be understood as a matrix obtained by shifting all elements included in the identity matrix I having a Zc × Zc size by one column to the right. In this disclosure, Zc may be referred to as a boost value.

Although not shown in fig. 2, since the subscript y of the submatrix P _0 is "0", the submatrix P _0 may be understood as an identity matrix I having a Zc × Zc size.

In addition, since the subscript y of the sub-matrix P _1 is "-1", the sub-matrix P _1 may be understood as a zero matrix having a size of ZC × ZC.

Referring to fig. 1 to 3, a submatrix P _ am, n may be defined at each position m, n by each row m (where m is a natural number of 1 to 42) and each column n (where n is a natural number of 1 to 52) of the parity check matrix H of fig. 3.

The subscript (i.e., am, n) of the position m, n corresponding to the definition of the parity check matrix H of fig. 3 is set to an integer value and may be referred to as a shift index value.

Each of the submatrices P _ am, n of fig. 3 may be understood as a matrix obtained by shifting an identity matrix I having a size Zc × Zc to the right by a shift index value am, n corresponding to a position (m, n). That is, the actual size of the parity check matrix H of fig. 3 may be understood as (m × Zc) × (n × Zc).

For example, the boost value Zc according to the present embodiment may be any one of 15, 30, 60, 120, and 240. As another example, the boost value Zc may be any one of 3,6, 12, 24, 48, 96, 192, and 384.

Referring to fig. 1 to 4, elements (i.e., a1,1 to am, n) according to a position m determined by each row m (where m is a natural number of 1 to 42) and each column n (where n is a natural number of 1 to 52) of the feature matrix Hc of fig. 4 may be set as shift index values at corresponding positions of the parity check matrix H of fig. 3.

That is, the parity check matrix H of fig. 3 may be obtained by elements of the positions m, n of the feature matrix Hc according to fig. 4 and the preset lifting value Zc.

The elements am, n of the feature matrix Hc of fig. 4 may be defined as indicated below in equation 3.

Equation 3

The boost value Zc of equation 3 may be any one of 15, 30, 60, 120, and 240. As another example, the boost value Zc may be any one of 3,6, 12, 24, 48, 96, 192, and 384.

In equation 3, Vm, n may be an element of a corresponding position m, n in a base matrix (hereinafter "Hb") to be described later.

For example, it may be assumed that the shift index value am, n corresponding to the position m, n of the parity check matrix H obtained by equation 3 is equal to or greater than "1".

In this case, the sub-matrix P _ am, n corresponding to the position m, n of fig. 3 may be understood as a matrix obtained by right-shifting all elements included in the identity matrix I having a size of Zc × Zc (where Zc is a natural number) by a shift index value (i.e., am, n) corresponding to the position (m, n) of fig. 3.

As another example, it may be assumed that the shift index value am, n corresponding to the position m, n of the parity check matrix H obtained by equation 3 is "0".

In this case, the sub-matrix P _ am, n corresponding to the position m, n of fig. 3 may maintain the identity matrix I having a size Zc × Zc (where Zc is a natural number).

As yet another example, it may be assumed that the shift index value am, n corresponding to the position m, n of the parity check matrix H obtained by equation 3 is "1".

In this case, the sub-matrix P _ am, n corresponding to the position m, n of fig. 3 may be replaced with a zero matrix having a size Zc × Zc.

Referring to fig. 1 to 5, the parity check matrix of fig. 3 may be generated based on the feature matrix Hc and the lifting value Zc of fig. 4. The feature matrix Hc of fig. 4 may be obtained by the operation of equation 3 based on the base matrix Hb and the boost value Zc of fig. 5.

Referring to fig. 1 to 5, the base matrix Hb of fig. 3 according to the present embodiment may include 4 sub-matrices A, B, C and D.

The size of the base matrix Hb according to the present embodiment may be 42 × 52. The predetermined element Vm, n may be arranged at each position m, n defined by each row m (where m is a natural number of 1 to 42) and each column n (where n is a natural number of 1 to 52) of the base matrix Hb.

The matrix a of fig. 5 may include a plurality of elements corresponding to the 1 st column to the 17 th column of the base matrix Hb in the 1 st row to the 7 th row of the base matrix Hb. The matrix a will be described in detail later with reference to fig. 6.

The matrix B of fig. 5 may include a plurality of elements corresponding to the 18 th column to the 52 th column of the base matrix Hb in the 1 st row to the 7 th row of the base matrix Hb, all of which are "-1".

The matrix C of fig. 5 may include a plurality of elements corresponding to the 1 st column to the 17 th column of the base matrix Hb in the 8 th row to the 42 th row of the base matrix Hb. The matrix C will be described in detail later with reference to fig. 7a and 7 b.

The matrix D of fig. 5 may include a plurality of elements corresponding to the 18 th to 52 th columns of the base matrix Hb in the 8 th to 42 th rows of the base matrix Hb. The matrix D will be described in detail later with reference to fig. 8a and 8 b.

In addition, elements corresponding to a plurality of particular predetermined columns of the base matrix Hb may be punctured. For example, elements corresponding to column 1 and column 2 of the base matrix Hb may be punctured.

Hereinafter, the respective elements Vm, n of the matrices A, B, C and D included in the base matrix Hb will be described in detail with reference to the subsequent drawings.

Fig. 6 illustrates a matrix a included in a base matrix according to an embodiment of the present disclosure.

Referring to fig. 1 to 6, an element Vm defined by the 1 st row (m ═ 1) and the 1 st to 17 th columns (n ═ 1, …,17) of the matrix a belonging to the base matrix Hb may be {145,131,71,21, -1, -1,23, -1, -1,112,1,0, -1, -1, -1 }.

The elements Vm, n defined by the 2 nd row (m ═ 2) and the 1 st to 17 th columns (n ═ 1, …,17) of the matrix a belonging to the base matrix Hb may be {142, -1, -1,174,183,27,96,23,9,167, -1,0,0, -1, -1, -1 }.

The elements Vm defined by the 3 rd row (m ═ 3) and the 1 st to 17 th columns (n ═ 1, …,17) of the matrix a belonging to the base matrix Hb may be {74,31, -1,3,53, -1, -1, -1,155, -1,0, -1,0,0, -1, -1, -1 }.

The element Vm defined by the 4 th row (m-4) and the 1 st to 17 th columns (n-1, …,17) of the matrix a belonging to the base matrix Hb may be { -1,239,171, -1,95,110,159,199,43,75,1, -1, -1,0, -1, -1, -1 }.

The elements Vm defined by the 5 th row (m-5) and the 1 st to 17 th columns (n-1, …,17) of the matrix a belonging to the base matrix Hb may be {29,140, -1, -1, -1, -1, -1, -1, -1,180, -1, -1,0, -1, -1 }.

The element Vm defined by the 6 th row (m ═ 6) and the 1 st to 17 th columns (n ═ 1, …,17) of the matrix a belonging to the base matrix Hb may be {121,41, -1, -1, 169, -1,88, -1, -1, 207, -1, -1,0, -1 }.

The element Vm defined by the 7 th row (m ═ 7) and the 1 st to 17 th columns (n ═ 1, …,17) of the matrix a belonging to the base matrix Hb may be {137, -1, -1, -1,72, -1,172, -1,124, -1, 56, -1, -1, -1,0 }.

Referring to fig. 6, a column set corresponding to 1 st to 10 th columns (n ═ 1, … 10) of matrix a may be referred to as an information column. The maximum value of the information column Kb to the base matrix Hb according to the present embodiment may be "10". That is, the number Kb of information columns of the base matrix Hb may be variably defined according to TBS B of initial data received from a higher layer.

The number of information columns Kb may be associated with the length K of the input data to be encoded (e.g., m in fig. 1) and the boost value Zc as indicated in equation 4.

According to the embodiment of fig. 6, the boost value Zc of equation 4 may be any one of 15, 30, 60, 120 and 240. In the present disclosure, the boost value Zc may be a value that is commonly used in the base matrix Hb.

Equation 4

Zc＝K/Kb

Referring to equation 4, the maximum information bit value K of the input data (m in fig. 1) encoded (or capable of being encoded) based on the parity check matrix according to the present disclosure may be 150, 300, 600, 1200, or 2400.

In addition, unlike the embodiment of fig. 6, the boost value Zc may be any one of 3,6, 12, 24, 48, 96, 192, and 384. In this case, the maximum information bit value K of the input data (m in fig. 1) encoded (or capable of being encoded) based on the parity check matrix may be 30, 60, 120, 240, 480, 960, 1920, or 3840.

For reference, the 7 × 17 matrix a of fig. 6 according to the present embodiment may be as indicated in table 1.

TABLE 1

Referring to fig. 1 to 6 and 7a, elements Vm, n may be { -1,86, -1, -1, -1,186, -1,87, -1, -1,172, -1,154, -1, -1, -1} corresponding to the 1 st to 17 th columns (n ═ 1, …,17) of the base matrix Hb in the 8 th row (m ═ 8) of the matrix C belonging to the base matrix Hb.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 9 th row (m ═ 9) of the matrix C belonging to the base matrix Hb, n may be {176,169, -1, -1, -1, -1, -1, -1, -1, -1,225, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 10 th row (m ═ 10) of the matrix C belonging to the base matrix Hb, n may be { -1,167, -1, -1, -1,238, -1,48,68, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 11 th row (m ═ 11) of the matrix C belonging to the base matrix Hb, n may be {38,217, -1, -1, -1, -1, -1, -1,208,232, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 12 th row (m ═ 12) of the matrix C belonging to the base matrix Hb, n may be {178, -1, -1, -1, -1,214, -1,168, -1, -1, -1,51, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 13 th row (m ═ 13) of the matrix C belonging to the base matrix Hb, n may be { -1,124, -1,122, -1, -1, -1, -1, -1, -1, -72, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 14 th row (m ═ 14) of the matrix C belonging to the base matrix Hb may be {48,57, -1, -1, -1, -1,167, -1, -1, -1, -1,219, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 15 th row (m ═ 15) of the matrix C belonging to the base matrix Hb, n may be { -1,82, -1, -1, -1,232, -1, -1,204, -1,162, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 16 th row (m ═ 16) of the matrix C belonging to the base matrix Hb, n may be {38, -1, -1, -1, -1, -1, -1, -1, -1, -1,217,157, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 17 th row (m ═ 17) of the matrix C belonging to the base matrix Hb, n may be { -1,170, -1, -1, -1, -1, -1, -1, -1,23, -1,175,202, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 18 th row (m ═ 18) of the matrix C belonging to the base matrix Hb, n may be { -1,196, -1, -1, -1, -1,173, -1, -1, -1, -1, -1,195,218, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 19 th row (m ═ 19) of the matrix C belonging to the base matrix Hb, n may be {128, -1, -1, -1, -1, -1, -1, -1,211,210, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 20 th row (m ═ 20) of the matrix C belonging to the base matrix Hb may be {39,84, -1, -1, -1, -1, -1,88, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 21 st row (m ═ 21) of the matrix C belonging to the base matrix Hb, n may be { -1,117, -1, -1,227, -1, -1, -1, -1, -1, -6, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 22 nd row (m ═ 22) of the matrix C belonging to the base matrix Hb may be {238, -1, -1, -1, -1,13, -1, -1, -1, -1,11, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 23 rd row (m ═ 23) of the matrix C belonging to the base matrix Hb, n may be { -1,195,44, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 24 th row (m ═ 10) of the matrix C belonging to the base matrix Hb, n may be {5, -1, -1,94, -1,111, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 25 th row (m ═ 25) of the matrix C belonging to the base matrix Hb, n may be { -1,81,19, -1, -1, -1, -1,130, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 26 th row (m ═ 26) of the matrix C belonging to the base matrix Hb may be {66, -1, -1, -1, -1, -1, -1,95, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 27 th row (m ═ 27) of the matrix C belonging to the base matrix Hb, n may be { -1, -1,146, -1, -1, -1,66, -1, -1, -1, -1,190,86, -1, -1, -1 }.

For reference, a portion of the matrix C mentioned in fig. 7a according to the present embodiment may be as indicated in table 2.

TABLE 2

Referring to fig. 1 to 6 and 7b, elements Vm, n corresponding to the 1 st to 17 th columns (n ═ 1, …,17) of the base matrix Hb in the 28 th row (m ═ 10) of the matrix C belonging to the base matrix Hb may be {64, -1, -1, -1, -1, -1, -1, -1, -1,181, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 29 th row (m ═ 29) of the matrix C belonging to the base matrix Hb, n may be { -1,7,144, -1, -1,16, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 30 th row (m ═ 30) of the matrix C belonging to the base matrix Hb may be {25, -1, -1, -1, -1, -1,57, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 31 th row (m ═ 31) of the matrix C belonging to the base matrix Hb, n may be { -1, -1,37, -1, -1,139, -1,221, -1,17, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 32 nd row (m ═ 32) of the matrix C belonging to the base matrix Hb, n may be { -1,201, -1, -1, -1, -1, -1, -1, -1, -1, -1, -46, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 33 rd row (m ═ 33) of the matrix C belonging to the base matrix Hb may be {179, -1, -1, -1,14, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 34 th row (m ═ 34) of the matrix C belonging to the base matrix Hb, n may be { -1, -1,46, -1, -1, -1, -1, -1,2, -1, -1,106, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 35 th row (m ═ 35) of the matrix C belonging to the base matrix Hb, n may be {184, -1, -1, -1, -1, -1, -1, -1,135,141, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 36 th row (m ═ 36) of the matrix C belonging to the base matrix Hb, n may be { -1,85, -1, -1, -1, -1,225, -1, -1, -1, -1, -1,175, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 37 th row (m ═ 37) of the matrix C belonging to the base matrix Hb, n may be {178, -1,112, -1, -1, -1, -1, -1, -1,106, -1, -1, -1, -1, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 38 th row (m ═ 38) of the matrix C belonging to the base matrix Hb, n may be { -1, -1, -1, -1, -1, -1, -154, -1, -1,114, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 39 th row (m ═ 39) of the matrix C belonging to the base matrix Hb, n may be { -1,42, -1, -1, -1, -1,41, -1, -1, -1,105, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 40 th row (m ═ 40) of the matrix C belonging to the base matrix Hb may be {167, -1, -1, -1, -1,45, -1, -1, -1, -1,189, -1, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 41 th row (m ═ 41) of the matrix C belonging to the base matrix Hb, n may be { -1, -1,78, -1, -1, -1, -1, -1,67, -1, -1,180, -1, -1, -1, -1 }.

The elements Vm corresponding to the 1 st column to the 17 th column (n ═ 1, …,17) of the base matrix Hb in the 42 th row (m ═ 42) of the matrix C belonging to the base matrix Hb, n may be { -1,53, -1, -1, -1,215, -1, -1, -1,230, -1, -1, -1 }.

For reference, a portion of the matrix C mentioned in fig. 7b according to the present embodiment may be as indicated in table 3.

TABLE 3

Fig. 8a and 8b illustrate a matrix D belonging to a base matrix according to an embodiment of the present disclosure.

Referring to fig. 1 to 8a, a matrix D belonging to a base matrix Hb may include a plurality of elements corresponding to 18 th to 52 th columns (n: 18, …,52) of the base matrix Hb in 8 th to 25 th rows (m: 8, …,25) of the base matrix Hb.

Referring to fig. 1 to 7 and 8b, the matrix D belonging to the base matrix Hb may include a plurality of elements corresponding to 18 th to 52 th columns (n: 18, …,52) of the base matrix Hb in 26 th to 42 th rows (m: 8, …,25) of the base matrix Hb.

The 18 diagonal elements illustrated in fig. 8a may be understood as a plurality of elements corresponding to a plurality of positions defined by a plurality of rows (m 8, …,25) and a plurality of columns (n 18, …,52) satisfying equation 5 indicated below.

Similarly, the 17 diagonal elements illustrated in fig. 8b may be understood as elements corresponding to positions defined by rows (m-26, …,42) and columns (n-18, …,52) satisfying equation 5 indicated below.

Equation 5

m+10＝n

Referring to fig. 1 to 9, the UE according to the embodiment may generate a parity check matrix of an LDPC code in step S910.

The parity check matrix according to this embodiment may correspond to a feature matrix. The feature matrix may comprise a maximum of 10 information columns for the input data.

Each element of the feature matrix may correspond to a shift index value determined by a modulo operation between an element of the base matrix corresponding to a position of the element of the feature matrix and the lifting value. In addition, the base matrix may be a 42 × 52 matrix. As described above, the base matrix may be defined in the form as shown in fig. 5.

In the present disclosure, the boost value may be associated with the length of the input data. In the present disclosure, the boost value may be defined as one of 15, 30, 60, 120, and 240.

The matrix a belonging to the base matrix Hb of the present disclosure (i.e., a of fig. 5) may include a plurality of elements corresponding to the 1 st to 17 th columns of the base matrix in the 1 st to 7 th rows of the base matrix. In this case, a plurality of elements of the matrix a (i.e., a of fig. 5) may correspond to the elements shown in fig. 6.

The matrix B belonging to the base matrix Hb of the present disclosure (i.e., B of fig. 5) may include a plurality of elements corresponding to 18 th to 52 th columns of the base matrix in 1 st to 7 th rows of the base matrix.

In particular, all elements corresponding to the 18 th to 52 th columns of the base matrix in the 1 st row of the base matrix Hb may be "-1". All elements corresponding to the 18 th to 52 th columns of the base matrix in the 2 nd row of the base matrix may be "-1". All elements corresponding to the 18 th to 52 th columns of the base matrix in the 3 rd row of the base matrix may be "-1". All elements corresponding to the 18 th to 52 th columns of the base matrix in the 4 th row of the base matrix may be "-1".

All elements corresponding to the 18 th to 52 th columns of the base matrix in the 5 th row of the base matrix may be "-1". All elements corresponding to the 18 th to 52 th columns of the base matrix in the 6 th row of the base matrix may be "-1". All elements corresponding to the 18 th to 52 th columns of the base matrix in the 7 th row of the base matrix may be "-1".

A matrix C belonging to the base matrix Hb of the present disclosure (i.e., C of fig. 5) may include a plurality of elements corresponding to 1 st to 17 th columns of the base matrix in 8 th to 42 th rows of the base matrix. A plurality of elements of the matrix C (i.e., C of fig. 5) may correspond to the elements described in fig. 7a and 7 b.

In the matrix D belonging to the base matrix Hb of the present disclosure (i.e., D of fig. 5), a plurality of elements corresponding to the 18 th to 52 th columns of the base matrix in the 8 th to 42 th rows of the base matrix may correspond to all elements of the 35 × 35 identity matrix.

Notably, the aforementioned modulo operation of equation 3 may be performed when the elements in the base matrix corresponding to the feature matrix are integers equal to or greater than 0.

When the corresponding element in the base matrix is-1, the modulo operation of equation 3 is not performed, and-1 may be determined as an element of the feature matrix. In this disclosure, when the corresponding element in the base matrix Hb is "-1", the corresponding element may correspond to a zero matrix.

For example, when the shift index value is "0" or a natural number equal to or greater than "1", each element of the feature matrix may correspond to a Zc × Zc identity matrix. All elements of the identity matrix may be shifted to the right according to the shift index value.

In step S920, the UE according to the present embodiment may encode input data using a parity check matrix.

If the present embodiment described with reference to fig. 1 to 9 is applied, a parity check matrix (e.g., fig. 3) of an LDPC code having high reliability in terms of delay can be obtained when shift index values of the feature matrix of fig. 4 are changed according to lengths of information bits based on a single base matrix of fig. 5.

According to the embodiment of fig. 10, the first parity check matrix may be defined based on a base matrix having a size of 46 × 68. For example, the first parity check matrix may have a first maximum information bit value (e.g., 8448).

According to the embodiment of fig. 10, the second parity check matrix may be defined based on a base matrix having a size of 42 × 52. For example, the second parity check matrix may have a second maximum information bit value (e.g., 3840). In this case, it can be understood that the second parity check matrix based on the 42 × 52 sized base matrix is based on the above description given with reference to fig. 1 to 9.

In the present disclosure, during an initial transmission of a Transport Block (TB) having a code rate R and a retransmission of the same TB, the first parity check matrix or the second parity check matrix may be determined according to a predetermined rule.

In step S1010, the UE may determine whether a code rate R derived from a Modulation and Coding Scheme (MCS) index according to the received Downlink Control Information (DCI) is equal to or less than a predetermined value (e.g., 0.25). Step S1020 may be performed if the code rate R derived from the MCS index is equal to or less than a predetermined value.

In step S1020, the UE may decode a Code Block (CB) based on a second parity check matrix, which is based on a base matrix having a size of 42 × 52.

Step S1030 may be performed if it is determined in step S1010 that the code rate R derived from the MCS index exceeds a predetermined value.

In step S1030, the UE may decode the CB based on a first parity check matrix, which is based on a base matrix having a size of 46 × 68.

Which one of the first parity check matrix and the second parity check matrix is used by the UE as a parity check matrix for an encoding or decoding process may be different according to a code rate, TBS, CB size, a type of service provided to the UE, or a type of a partial frequency band in which the UE receives a signal.

Fig. 11 is a flowchart illustrating a method of performing CB partitioning based on an LDPC parity check matrix according to another embodiment of the present disclosure.

According to the embodiment of fig. 11, the first parity check matrix may be defined based on a base matrix having a size of 46 × 68. The first parity check matrix may have a first maximum information bit value (e.g., 8448). For example, a first maximum information bit value (e.g., 8448) may represent a length of input data that can be encoded based on the first parity check matrix.

According to the embodiment of fig. 11, the second parity check matrix may be defined based on a base matrix having a size of 42 × 52. The second parity check matrix may have a second maximum information bit value (e.g., 3840). For example, the second maximum information bit value (e.g., 3840) may represent a length of the input data that can be encoded based on the second parity check matrix.

In this case, the second parity check matrix based on the base matrix having the size of 42 × 52 may be understood based on the above description given with reference to fig. 1 to 9.

Referring to fig. 10 and 11, in step S1110, the UE may determine any one of a first parity check matrix having a first maximum information bit value and a second parity check matrix having a second maximum information bit value as a parity check matrix for encoding the TB based on a code rate for the TB.

To simplify and clarify the description of fig. 10, it may be assumed that the code rate for the TB is equal to or less than a predetermined value (e.g., 0.25). According to the above assumption, the UE may determine the second parity check matrix as a parity check matrix for encoding the TB.

If the second parity check matrix is determined to be the parity check matrix, the process goes to step S1120. Although not shown in fig. 11, if the second parity check matrix is determined to be a parity check matrix, the UE may add a 16-bit second Cyclic Redundancy Check (CRC) to the TB.

If the first parity check matrix is determined to be a parity check matrix, the process may end. Although not shown in fig. 11, if the first parity check matrix is determined to be a parity check matrix, the UE may add a 24-bit first CRC to the TB.

In S1120, the UE may perform CB partitioning for the TB based on the second maximum information bit value of the second parity check matrix. For example, if CB partitioning is performed, at least two CBs may be obtained from the TB. The code block segmentation of step S1120 may be performed based on the second maximum information bit value even if the length of the TB exceeds the first maximum information bit value.

For example, the UE may identify whether the first parity check matrix is applied or the second parity check matrix is applied according to a pre-agreed rule between the UE and the base station. The UE may then determine whether the CRC applied to the CB and/or TB is a first type CRC or a second type CRC based on the identified result.

In the above example, if the code rate is derived during uplink transmission, the Resource Elements (REs) occupied by multiplexing information, such as Channel Quality Indicator (CQI), may be excluded from the calculation process of the code rate. In addition, a code rate applied to each CB may be calculated in a state in which REs occupied by punctured information (such as ACK/NACK) are considered.

According to the embodiment of fig. 12, a first parity check matrix based on a base matrix having a size of 46 × 68 may be defined. For example, the first parity check matrix may have a first maximum information bit value (e.g., 8448).

According to the embodiment of fig. 12, a second check matrix based on a base matrix having a size of 42 × 52 may be defined. For example, the second parity check matrix may have a second maximum information bit value (e.g., 3840). In this case, it can be understood that the second parity check matrix based on the 42 × 52 sized base matrix is based on the above description given with reference to fig. 1 to 9.

Referring to fig. 10 to 12, in step S1210, the UE may determine whether the DCI indicates retransmission scheduling. If the DCI does not indicate retransmission scheduling, the process may end. If the DCI indicates retransmission scheduling (i.e., when the new data indicator is not switched or the new data indicator is set to "0"), the process proceeds to step S1220.

In step S1220, the UE may perform a decoding process based on the parity check matrix that has been applied during the initial reception of the TB. In this case, the parity check matrix may be the first parity check matrix or the second parity check matrix.

In particular, the UE may perform a decoding process based on a parity check matrix corresponding to a case where a TB mapped to the retransmission process ID is received first (i.e., a case where the new data indicator is switched or the new data indicator is set to "1").

Claims

1. A method of encoding information by a transmitting device using a parity check matrix of a low density parity check code for transmission over a communication channel, the method comprising:

determining, by the transmitting device, a parity check matrix comprising at least 7Z rows and 17Z columns,

wherein the parity check matrix comprises a plurality of sub-matrices each having a size Z x Z for a non-zero integer Z, and wherein a sub-matrix (m, n) of the parity check matrix is an m-th sub-matrix in a row direction of the parity check matrix and an n-th sub-matrix in a column direction of the parity check matrix,

wherein, among the sub-matrices of the parity check matrix, each sub-matrix (m, n) is, for 0 ≦ m ≦ 6 and 0 ≦ n ≦ 16:

for each value of m 0 and n {0,1,2,3,6,9,10,11}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain, the shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {145,131,71,21,23,112,1,0},

for each value of n other than n ═ 0,1,2,3,6,9,10,11, for m equal to 0, equal to an all-zero matrix of size Z × Z,

for each value where m is 1 and n is {0,3,4,5,6,7,8,9,11,12}, an index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain, the shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {142,174,183,27,96,23,9,167,0,0},

for each value of n other than n ═ 0,3,4,5,6,7,8,9,11,12, for m equal to 1, equal to an all-zero matrix of size Z × Z,

for each value of m 2 and n {0,1,3,4,8,10,12,13}, by making it largerCircularly shifting the column of a unit matrix of small Z x Z to the right by an index value a_m,nTo obtain, the shift index value a_m,nIs defined by modulo operation on Z by the corresponding values in {74,31,3,53,155,0, 0},

for m 2 and for each value of n other than n {0,1,3,4,8,10,12,13}, is equal to an all-zero matrix of size Z × Z,

for each value of m 3 and n {1,2,4,5,6,7,8,9,10,13}, an index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain, the shift index value a_m,nIs defined by modulo operation of Z by a corresponding value of {239,171,95,110,159,199,43,75,1,0},

for m 3 and for each value of n other than n {1,2,4,5,6,7,8,9,10,13}, is equal to an all-zero matrix of size Z × Z,

for each value where m is 4 and n is {0,1,11,14}, the index value a is cyclically shifted to the right by shifting the columns of a unit matrix of size Z × Z by the index value a_m,nTo obtain, the shift index value a_m,nDefined by performing modulo operation on Z corresponding to values in {29,140,180,0},

for m 4 and for each value of n other than n {0,1,11,14}, equals an all-zero matrix of size Z x Z,

for each value where m is 5 and n is {0,1,5,7,11,15}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain, the shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {121,41,169,88,207,0},

for each value of m equal to 5 and for n other than n {0,1,5,7,11,15}, equal to an all-zero matrix of size Z × Z,

for each value where m is 6 and n is {0,5,7,9,11,16}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain, the shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {137,72,172,124,56,0},

for each value of n, except for n {0,5,7,9,11,16}, for m equal to 6, equal to an all-zero matrix of size Z × Z,

generating, by the transmitting device, encoded data based on encoding the information with the determined parity check matrix; and

transmitting, by a transceiver of the transmitting device, the encoded data over the communication channel.

2. The method of claim 1, wherein the parity check matrix has at least 42Z rows and at least 52Z columns, the 42Z rows comprising 42Z x Z sized sub-matrices indexed by m in the row direction of the parity check matrix, where 0 ≦ m ≦ 41, and the at least 52Z columns comprising 52Z x Z sized sub-matrices indexed by n in the column direction of the parity check matrix, where 0 ≦ n ≦ 51, and

wherein, for m 7, 41 and for n 17, 51:

each sub-matrix (m, m +10) is an unshifted identity matrix of size Z × Z, and

each of the submatrices except the submatrix (m, m +10) is an all-zero matrix of size Z × Z.

3. The method of claim 1, wherein generating, by the transmitting device, the encoded data based on encoding the information with the determined parity check matrix comprises:

generating a plurality of parity check bits satisfying the following condition based on the information and the parity check matrix

Wherein H is the parity check matrix, andis the information.

4. The method of claim 1, wherein Z relates to a size of the information encoded by the transmitting device.

5. The method of claim 4, wherein Z represents a boost value, the boost value being any one of 15, 30, 60, 120, or 240.

6. The method of claim 1, further comprising:

determining a base matrix of at least 42 x 52 size, wherein an element at a position (m, n) of the base matrix indicates whether the sub-matrix (m, n) is equal to a shift index value a by cyclically shifting right a column of a unitary matrix of size zxz_m,nAnd the resulting matrix.

7. The method of claim 1, further comprising:

determining, by the transmitting device, a modulation and coding scheme index according to downlink control information received by the transmitting device;

deriving, by the transmitting device, a code rate from the modulation and coding scheme index;

determining, by the transmitting device, that the code rate does not meet a threshold criterion; and

based on determining that the code rate does not satisfy the threshold criteria, determining the parity check matrix and performing encoding on the information using the parity check matrix to generate the encoded data.

8. The method of any of claims 1 to 7, wherein the parity check matrix has 42Z rows, the 42Z rows comprising 42Z x Z sized sub-matrices, the sub-matrices being indexed by m in the row direction of the parity check matrix, where 0 ≦ m ≦ 41, and

wherein: among the sub-matrices of the parity check matrix, each sub-matrix (m, n) is for 7. ltoreq. m.ltoreq.41 and 0. ltoreq. n.ltoreq.16:

for each of m 7 and n {1,5,7,11,13}, the index value a is shifted cyclically by shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by corresponding values of 86,186,87,172,154,

for each value of m 7 and n, except n {1,5,7,11,13}, is equal to an all-zero matrix of size Z x Z,

for each of m 8 and n 0,1,12, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on the corresponding value Z in 176,169,225,

for each value of m 8 and n, except n 0,1,12, is equal to an all-zero matrix of size Z x Z,

for each of m 9 and n {1,8,10,11}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in 167,238,48,68,

for each value of m 9 and n, except n {1,8,10,11}, is equal to an all-zero matrix of size Z x Z,

for each of m 10 and n 0,1,6,7, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 38,217,208,232,

for each value of m 10 and n, except n 0,1,6,7, is equal to an all-zero matrix of size Z x Z,

for each of m 11 and n {0,7,9,13}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift cordsIndex a_m,nIs defined by performing modulo operation on Z by corresponding values in 178,214,168,51,

for m 11 and for each value of n other than n {0,7,9,13}, is equal to an all-zero matrix of size Z × Z,

for each of m-12 and n-1, 3,11, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding values in 124,122,72,

for each value of m-12 and n, except n {1,3,11}, is equal to an all-zero matrix of size Z x Z,

for each of m 13 and n 0,1,8,13, the index value a is shifted cyclically by shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in {48,57,167,219},

for m 13 and for each value of n other than n {0,1,8,13}, is equal to an all-zero matrix of size Z × Z,

for each of m 14 and n {1,6,11,13}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z for its corresponding value in 82,232,204,162,

for m 14 and for each value of n other than n {1,6,11,13}, is equal to an all-zero matrix of size Z × Z,

for each of m 15 and n 0,10,11, the index value a is shifted cyclically by shifting the column of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 38,217,157,

for each value of m 15 and n, except n {0,10,11}, is equal to an all-zero matrix of size Z x Z,

for m 16 and forn is {1,9,11,12}, by circularly shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in {170,23,175,202},

for each value of m 16, and for each value of n other than n {1,9,11,12}, is equal to an all-zero matrix of size Z x Z,

for each of m-17 and n-1, 5,11,12, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 196,173,195,218,

for each value of m 17 and n, except n {1,5,11,12}, is equal to an all-zero matrix of size Z x Z,

for each of m 18 and n 0,6,7, the index value a is shifted cyclically by shifting the columns of the unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 128,211,210,

for each value of m 18, and for each value of n other than n {0,6,7}, is equal to an all-zero matrix of size Z x Z,

for each of m 19 and n 0,1,10, the index value a is shifted cyclically by shifting the column of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing a modulo operation on the corresponding value of Z in 39,84,88,

for m 19 and for each value of n other than n 0,1,10, equal to an all-zero matrix of size Z x Z,

for each of m-20 and n-1, 4,11, the index value a is shifted by cyclically shifting the column of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on the corresponding value in 117,227,6 to Z,

for each value of m-20 and n, except n {1,4,11}, is equal to an all-zero matrix of size Z x Z,

for each of m 21 and n 0,8,13, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding values in 238,13,11,

for m 21 and for each value of n other than n {0,8,13}, is equal to an all-zero matrix of size Z x Z,

for each of m 22 and n {1,2}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing a modulo operation on the corresponding value of Z in 195,44,

for m 22 and for each value of n other than n {1,2}, equals an all-zero matrix of size Z x Z,

for each of m 23 and n {0,3,5}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in {5,94,111},

for m 23 and for each value of n other than n {0,3,5}, equals an all-zero matrix of size Z x Z,

for each of m 24 and n {1,2,9}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding values in 81,19,130,

for m 24 and for each value of n other than n {1,2,9}, equals an all-zero matrix of size Z × Z,

for each of m 25 and n 0,5, the index value a is shifted cyclically by shifting the column of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shiftBit index value a_m,nIs defined by performing modulo operation on Z by the corresponding value in 66,95,

for m 25 and for each value of n other than n {0,5}, equals an all-zero matrix of size Z x Z,

for each of m 26 and n {3,8,13,14}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in {146,66,190,86},

for m 26 and for each value of n other than n {3,8,13,14}, is equal to an all-zero matrix of size Z x Z,

for each of m 27 and n 0,6, the index value a is shifted cyclically by shifting the column of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 64,181,

for m 27 and for each value of n other than n {0,6}, equals an all-zero matrix of size Z x Z,

for each of m 28 and n {1,2,5}, an index value a is shifted by cyclically shifting to the right a column of a unit matrix of size Z × Z by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding value in 7,144,16,

for m 28 and for each value of n other than n {1,2,5}, is equal to an all-zero matrix of size Z x Z,

for each of m-29 and n-0, 4, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding value in 25,57,

for m-29 and for each value of n other than n {0,4}, equals an all-zero matrix of size Z x Z,

for each of m 30 and n 2,5,7,9, by dividing the size Z × ZCircularly shifting the column of the unit matrix to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding value in {37,139,221,17},

for each value of m 30 and n, except n {2,5,7,9}, is equal to an all-zero matrix of size Z x Z,

for each of m 31 and n {1,13}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in 201,46,

for m 31 and for each value of n other than n {1,13}, is equal to an all-zero matrix of size Z x Z,

for each of m-32 and n-0, 5,12, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in 179,14,116,

for each value of m 32, and for each value of n other than n {0,5,12}, is equal to an all-zero matrix of size Z x Z,

for each of m 33 and n 2,7,10, the index value a is shifted cyclically by shifting the column of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding values in 46,2,106,

for each value of m 33, and for each value of n other than n {2,7,10}, is equal to an all-zero matrix of size Z x Z,

for each of m-34 and n-0, 12,13, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 184,135,141,

for m 34 and for each value of n other than n 0,12,13, is equal to an all-zero matrix of size Z x Z,

for each of m 35 and n {1,5,11}, index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 85,225,175,

for each value of m 35, and for each value of n other than n {1,5,11}, is equal to an all-zero matrix of size Z x Z,

for each of m 36 and n {0,2,7}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 178,112,106,

for m 36 and for each value of n other than n {0,2,7}, equals an all-zero matrix of size Z x Z,

for each of m 37 and n {10,13}, index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 154,114,

for m 37 and for each value of n other than n {10,13}, is equal to an all-zero matrix of size Z x Z,

for each of m 38 and n {1,5,11}, an index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in 42,41,105,

for each value of m 38, and for each value of n other than n {1,5,11}, is equal to an all-zero matrix of size Z x Z,

for each of m 39 and n 0,7,12, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nModulo Z by the corresponding value in {167,45,189}The operation is defined by the following steps,

for m 39 and for each value of n other than n 0,7,12, is equal to an all-zero matrix of size Z x Z,

for each of m 40 and n 2,10,13, the index value a is shifted cyclically by shifting the column of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {78,67,180},

for m equal to 40 and for each value of n other than n {2,10,13}, equals an all-zero matrix of size Z × Z, and

for each of m 41 and n {1,5,11}, index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 53,215,230,

for each value of m 41 and n except n {1,5,11}, equals an all-zero matrix of size Z × Z.

9. A transmitting device configured to encode information for transmission over a communication channel based on a parity check matrix of a low density parity check code, the transmitting device comprising:

at least one processor; and

at least one computer memory operatively connected to the at least one processor and storing instructions that, when executed, cause the at least one processor to perform operations comprising:

for each value of m 2 and n {0,1,3,4,8,10,12,13}, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain, the shift index value a_m,nIs defined by modulo operation on Z by the corresponding values in {74,31,3,53,155,0, 0},

for each value of m-5, n-0, 1,5,7,11,15, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain, the shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in {121,41,169,88,207,0},

for each value of m 5 and n except for n {0,1,5,7,11,15}, each sub-matrix (m, n) is equal to an all-zero matrix of size Z × Z,

generating encoded data based on encoding the information with the determined parity check matrix; and

and transmitting the coded data.

10. The transmission device of claim 9, wherein the parity check matrix has at least 42Z rows and at least 52Z columns, the 42Z rows including 42 zxz sized sub-matrices, the sub-matrices being indexed by m in a row direction of the parity check matrix, where 0 ≦ m ≦ 41, and the at least 52Z columns including 52 zxz sized sub-matrices, the sub-matrices being indexed by n in a column direction of the parity check matrix, where 0 ≦ n ≦ 51, and

wherein, for m 7, 41 and for n 17, 51:

each sub-matrix (m, m +10) is an unshifted identity matrix of size Z × Z, and

11. The transmitting device of claim 9, wherein Z relates to a size of the information encoded by the transmitting device.

12. The transmitting device of claim 11, wherein Z represents a boost value, the boost value being any one of 15, 30, 60, 120, or 240.

13. The transmission apparatus according to any one of claims 9 to 12, wherein the parity check matrix has 42Z rows, the 42Z rows including 42 zxz-sized sub-matrices, the sub-matrices being indexed by m in a row direction of the parity check matrix, where 0 ≦ m ≦ 41, and

for each of m 11 and n {0,7,9,13}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by corresponding values in 178,214,168,51,

for each value of m 2 and n other than n {1,3,11}, equals an all-zero matrix of size Z x Z,

for each of m 13 and n 0,1,8,13, the index value a is shifted cyclically by shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nBy corresponding values in {48,57,167,219 })The Z is defined by performing a modulo operation on it,

for each of m 16 and n {1,9,11,12}, an index value a is shifted by cyclically shifting a column of a unit matrix of size Z × Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in {170,23,175,202},

for each of m 18 and n 0,6,7, a list of Z is obtainedCircularly shifting the column of the unit matrix of Z to the right by an index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 128,211,210,

for each of m 25 and n 0,5, the index value a is shifted cyclically by shifting the column of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding value in 66,95,

for each of m 27 and n 0,6, the index value a is shifted cyclically by shifting the column of a unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nModulo operation on Z by the corresponding value in 64,181The definition of the method is that,

for each of m 30 and n 2,5,7,9, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding value in {37,139,221,17},

for each of m-32 and n-0, 5,12, the index value a is shifted by cyclically shifting the columns of a unit matrix of size Z × Z to the right by the index value a_m,nTo obtain eachSub-matrix (m, n), the shift index value a_m,nIs defined by modulo operation of Z by the corresponding values in 179,14,116,

37 for m and 37 forn is {10,13} each, by circularly shifting the columns of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nDefined by modulo operation on Z by the corresponding value in 154,114,

for each of m 39 and n 0,7,12, the index value a is shifted by cyclically shifting the columns of the unit matrix of size Z × Z to the right by the shift index value a_m,nTo obtain each sub-matrix (m, n), said shift index value a_m,nIs defined by performing modulo operation on Z by the corresponding values in {167,45,189},