Apparatus and method for channel coding / decoding in a communication system
By designing a block-large subgroup for the parity check matrix and an enhancement method, we can support LDPC codes with variable length and variable rate, which solves the problem that LDPC coding in the existing technology is difficult to adapt to various input lengths and code rates, and improves the channel coding performance of 5G communication systems.
Patent Information
- Application Number
- CN202110729706.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2017-06-26
- Filing Date
- 2017-12-20
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2037-12-20
AI Technical Summary
Existing low-density parity-check (LDPC) coding techniques are difficult to support various input lengths and code rates, and in 5G communication systems, noise, fading, and inter-symbol interference lead to link performance degradation, affecting the reliability of high-speed digital communication.
By designing block size groups and lifting methods for parity check matrices, we can support LDPC codes with variable length and variable rate. By utilizing the granularity settings of block size groups and multiple parity check matrices or sequences, we can optimize encoding and decoding performance and adapt to the needs of different communication systems.
It enables support for various input lengths and code rates in 5G communication systems, improves the flexibility and reliability of channel coding, and enhances link performance.
Smart Images

Figure CN113472359B_ABST
Abstract
Description
[0001] This application is a divisional application of an invention patent application with an application date of December 20, 2017, application number 201780079231.8, and invention name “Device and method for channel coding / decoding in communication or broadcasting systems”. Technical Field
[0002] The present disclosure relates to apparatus and methods for channel coding and decoding in a communication or broadcasting system. Background Art
[0003] In order to meet the demand for increased wireless data services since the deployment of 4G communication systems, efforts have been made to develop improved 5G or pre-5G communication systems. Therefore, 5G or pre-5G communication systems are also called "super 4G networks" or "post-LTE systems."
[0004] Consider implementing 5G communication systems in higher frequency (millimeter wave, mmWave) bands (e.g., 60 GHz band) to achieve higher data rates. In order to reduce the propagation loss of radio waves and increase the transmission distance, beamforming, massive multiple-input multiple-output (MIMO), full-dimensional MIMO (FD-MIMO), array antennas, analog beamforming, and massive antenna technology are discussed in 5G communication systems.
[0005] In addition, in 5G communication systems, deployment of system network improvements is being carried out based on the following: advanced small cells, cloud radio access networks (RAN), ultra-dense networks, device-to-device (D2D) communications, wireless backhaul, mobile networks, collaborative communications, coordinated multi-point (CoMP), and receiver-side interference cancellation.
[0006] In 5G systems, the following have been developed: hybrid FSK and QAM modulation (FQAM) and sliding window superposition coding (SWSC) as advanced coding modulation (ACM); and filter bank multi-carrier (FBMC), non-orthogonal multiple access (NOMA) and sparse code multiple access (SCMA) as advanced access technologies.
[0007] In communication or broadcasting systems, due to various types of noise, fading phenomena and inter-symbol interference (ISI) of the channel, link performance may deteriorate significantly. Therefore, in order to implement high-speed digital communication or broadcasting systems (such as next-generation mobile communications, digital broadcasting and portable Internet) that require high data throughput and reliability, it is necessary to develop technologies that overcome noise, fading and inter-symbol interference. As part of research to overcome noise, etc., research on error correction codes has been actively carried out recently, and the error correction code is a method for improving communication reliability by effectively restoring distorted information.
[0008] The above information is presented as background information only to assist with an understanding of the present disclosure. No determination has been made and no assertion has been made as to whether any of the above is applicable as prior art with respect to the present disclosure. Summary of the invention
[0009] Technical issues
[0010] Various aspects of the present disclosure are intended to address at least the above problems and / or disadvantages and provide at least the following advantages. Therefore, one aspect of the present disclosure is to provide a method and apparatus for low density parity check (LDPC) encoding / decoding that can support various input lengths and code rates.
[0011] Another aspect of the present disclosure is to provide a method and apparatus for LDPC encoding / decoding, which can support a codeword length supported by a designed parity check matrix.
[0012] The aspects of the present disclosure are not limited to the above aspects. That is, according to the following description, those skilled in the art to which the present disclosure belongs can obviously understand other aspects that are not mentioned.
[0013] Technical Solution
[0014] According to one aspect of the present disclosure, a method for channel coding in a communication or broadcasting system is provided. The method includes determining a block size of a parity check matrix, determining a sequence for generating the parity check matrix, determining a portion including the determined block size, determining a representative value corresponding to the determined portion, and transforming the sequence by applying a predefined operation on the sequence to the sequence using the representative value.
[0015] According to another aspect of the present disclosure, a method for channel coding in a communication or broadcasting system is provided. The method includes determining a block size of a parity check matrix, determining a sequence for generating the parity check matrix, determining an integer value based on a predetermined block size according to a predetermined method, and transforming the sequence by applying a predefined operation on the sequence to the sequence through the integer value.
[0016] According to the present disclosure, variable length and variable rate LDPC codes can be supported.
[0017] The effects that can be achieved by the embodiments of the present disclosure are not limited to the above aspects. That is, according to the following description, those skilled in the art to which the present disclosure belongs can obviously understand other effects that are not mentioned.
[0018] According to another aspect of the present disclosure, a method for channel coding in a communication or broadcasting system is provided. The method includes determining a block size Z, and performing coding based on the block size and a parity check matrix corresponding to the block size, wherein the block size is included in any one of a plurality of block size groups and the parity check matrix is different for each block size group.
[0019] According to another aspect of the present disclosure, a method for channel decoding in a communication or broadcasting system is provided. The method includes determining a block size Z, and performing decoding based on the block size and a parity check matrix corresponding to the block size, wherein the block size is included in any one of a plurality of block size groups and the parity check matrix is different for each block size group.
[0020] According to another aspect of the present disclosure, a device for channel coding in a communication or broadcasting system is provided. The device includes a transceiver and a controller, the controller being configured to determine a block size Z, and perform coding based on the block size and a parity check matrix corresponding to the block size, wherein the block size is included in any one of a plurality of block size groups and the parity check matrix is different for each block size group.
[0021] According to another aspect of the present disclosure, a device for channel decoding in a communication or broadcasting system is provided. The device includes a transceiver and a controller, the controller being configured to determine a block size Z, and perform decoding based on the block size and a parity check matrix corresponding to the block size, wherein the block size is included in any one of a plurality of block size groups and the parity check matrix is different for each block size group.
[0022] According to another aspect of the present disclosure, a method for channel coding performed by an apparatus in a communication system is provided, the method comprising: identifying a block size (Z) based on input bits; identifying a basic matrix and a parity check matrix based on the block size (Z); performing encoding of the input bits based on at least a portion of the parity check matrix; and sending at least a portion of the encoded input bits, wherein the block size (Z) is included in one of a plurality of block size groups, wherein the parity check matrices are different for the plurality of block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same basic matrix, and wherein bits among the input bits that are multiples of the block size (Z) are not included in at least a portion of the encoded input bits.
[0023] According to another aspect of the present disclosure, a method for channel decoding performed by an apparatus in a communication system is provided, the method comprising: receiving a signal; identifying a block size (Z) corresponding to an input bit; identifying a basic matrix and a parity check matrix based on the block size (Z); and performing decoding of the input bits based on at least a portion of the parity check matrix, wherein the block size (Z) is included in one of a plurality of block size groups, wherein the parity check matrices are different for the plurality of block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same basic matrix, and wherein bits among the input bits that are multiples of the block size (Z) are not included in at least a portion of the encoded input bits.
[0024] According to another aspect of the present disclosure, a device for channel coding of a communication system is provided, the device comprising: a transceiver; and at least one processor coupled to the transceiver and configured to: identify a block size (Z) based on input bits; identify a basic matrix and a parity check matrix based on the block size (Z); perform encoding of the input bits based on at least a portion of the parity check matrix; and send at least a portion of the encoded input bits, wherein the block size (Z) is included in one of a plurality of block size groups, wherein the parity check matrices are different for the plurality of block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same basic matrix, and wherein bits of the input bits that are multiples of the block size (Z) are not included in at least a portion of the encoded input bits.
[0025] According to another aspect of the present disclosure, a device for channel decoding in a communication system is provided, the device comprising: a transceiver; and at least one processor coupled to the transceiver and configured to: receive a signal; identify a block size (Z) corresponding to an input bit; identify a basic matrix and a parity check matrix based on the block size (Z); and perform decoding of the input bits based on at least a portion of the parity check matrix, wherein the block size (Z) is included in one of a plurality of block size groups, wherein the parity check matrices are different for the plurality of block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same basic matrix, and wherein bits of the input bits that are multiples of the block size (Z) are not included in at least a portion of the encoded input bits.
[0026] Other aspects, advantages, and salient features of the present disclosure will become apparent to those skilled in the art from the following detailed description which, in conjunction with the accompanying drawings, discloses various embodiments of the present disclosure.
[0027] Advantageous Effects of the Invention
[0028] Accordingly, an aspect of the present disclosure provides a method and apparatus for low-density parity-check (LDPC) encoding / decoding, which can support various input lengths and code rates. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] The above and other aspects, features and advantages of certain embodiments of the present disclosure will become more apparent through the following description in conjunction with the accompanying drawings, in which:
[0030] Figure 1 is a structural diagram of a system low-density parity check (LDPC) codeword according to an embodiment of the present disclosure;
[0031] Figure 2 is a diagram showing a graph representation method of an LDPC code according to an embodiment of the present disclosure;
[0032] Figure 3A and Figure 3B is a diagram for explaining the cyclic characteristics of a quasi-cycle LDPC (QC-LDPC) code according to an embodiment of the present disclosure;
[0033] Figure 4 is a block configuration diagram of a transmitting device according to an embodiment of the present disclosure;
[0034] Figure 5 is a block configuration diagram of a receiving device according to an embodiment of the present disclosure;
[0035] Fig. 6A and Figure 6B is a message structure diagram illustrating a message passing operation performed at any check node and variable node for LDPC decoding according to an embodiment of the present disclosure;
[0036] Figure 7 is a block diagram for explaining a detailed configuration of an LDPC encoder according to an embodiment of the present disclosure;
[0037] Figure 8 is a block diagram showing a configuration of an encoding device according to an embodiment of the present disclosure;
[0038] Fig. 9 is a structural diagram of an LDPC decoder according to an embodiment of the present disclosure;
[0039] Fig.10 is a diagram of a transport block structure according to an embodiment of the present disclosure;
[0040] Fig.11 is a flowchart of an LDPC encoding process according to an embodiment of the present disclosure;
[0041] Fig.12 is an exemplary diagram of a flow chart of an LDPC encoding process according to an embodiment of the present disclosure;
[0042] Fig.13is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure;
[0043] Fig.14 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure;
[0044] Fig.15 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure;
[0045] Fig.16 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure;
[0046] Fig.17A , Fig. 17B , Fig. 17C , Fig.17D , Fig.17E , Fig.17F and Figure 17G is a diagram showing a base matrix of an LDPC code according to an embodiment of the present disclosure;
[0047] Fig.18A , Fig.18B , Fig.18C , Fig.18D , Fig.18E , Fig.18F and Figure 18G The present invention is a diagram showing an embodiment of the present invention. Fig.17A A diagram showing an example of an LDPC code exponential matrix as a part of a basic matrix of a basic matrix;
[0048] Fig.19A , Fig.19B , Fig.19C , Fig.19D , Fig.19E , Fig.19F and Figure 19G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0049] Fig. 20A , Fig. 20B , Fig. 20C , Fig.20D , Fig.20E , Fig.20F and Figure 20G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0050] Fig.21A , Fig. 21B , Fig. 21C , Fig.21D , Fig.21E , Fig.21F and Figure 21Gis a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0051] Fig.22A , Fig. 22B , Fig. 22C , Fig.22D , Fig.22E , Fig.22F and Figure 22G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0052] Fig.23A , Fig. 23B , Fig.23C , Fig.23D , Fig.23E , Fig.23F and Figure 23G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0053] Fig.24A , Fig. 24B , Fig.24C , Fig.24D , Fig.24E , Fig.24F and Figure 24G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0054] Fig.25A , Fig.25B , Fig.25C , Fig.25D , Fig.25E and Fig.25F as well as Figure 25G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0055] Fig.26A , Fig.26B , Fig.26C , Fig.26D , Fig.26E , Fig.26F and Figure 26G is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0056] Fig.27A , Fig.27B , Fig.27C , Fig.27D , Fig.27E , Fig.27F , Figure 27G , Fig.27H , Fig.27I and Fig.27J is a diagram showing a basic matrix of an LDPC code according to an embodiment of the present disclosure;
[0057] Fig.28A , Fig.28B , Fig.28C , Fig.28D , Fig.28E , Fig.28F , Figure 28G , Fig.28H , Fig.28I and Fig.28J is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0058] Fig.29A , Fig.29B , Fig.29C and Fig.29D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0059] Fig. 30A , Fig. 30B , Fig. 30C and Fig.30D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0060] Fig.31A , Fig.31B , Fig.31C and Fig.31D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0061] Fig.32A , Fig.32B , Fig.32C and Fig.32D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0062] Fig.33A , Fig.33B , Fig.33C and Fig.33D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0063] Fig.34A , Fig.34B , Fig.34C and Fig.34D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0064] Fig.35A , Fig.35B , Fig.35C and Fig.35D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0065] Fig.36A , Fig.36B , Fig.36C and Fig.36D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure; and
[0066] Fig.37A , Fig.37B , Fig.37C and Fig.37D is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure;
[0067] Throughout the drawings, like reference numerals will be understood to refer to like parts, components and structures. DETAILED DESCRIPTION
[0068] The following description with reference to the accompanying drawings is provided to assist in a comprehensive understanding of the various embodiments of the present disclosure as defined by the claims and their equivalents. It includes various specific details to assist in understanding, but these are to be considered as exemplary only. Therefore, it will be appreciated by those of ordinary skill in the art that various changes and modifications may be made to the various embodiments described herein without departing from the scope and spirit of the present disclosure. In addition, descriptions of well-known functions and structures may be omitted for clarity and conciseness.
[0069] The terms and words used in the following description and claims are not limited to the bibliographical meanings, but are merely used by the inventor to enable a clear and consistent understanding of the present disclosure. Therefore, it should be apparent to those skilled in the art that the following description of various embodiments of the present disclosure is provided for illustrative purposes only and not for the purpose of limiting the present disclosure as defined by the appended claims and their equivalents.
[0070] It is to be understood that the singular forms "a," "an," and "the" include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to "a component surface" includes reference to one or more of such surfaces.
[0071] According to the following detailed description of the embodiments with reference to the accompanying drawings, various advantages and features of the present disclosure and methods for achieving the advantages and features will become apparent. However, the present disclosure is not limited to the embodiments disclosed herein, but will be implemented in various forms. The embodiments make the disclosure of the present disclosure complete and are provided so that those skilled in the art can easily understand the scope of the present disclosure. Therefore, the present disclosure will be defined by the scope of the attached claims. The same reference numerals throughout the specification represent the same elements.
[0072] Low-density parity-check (LDPC) codes first introduced by Gallager in the 1960s were forgotten for a long time due to the complexity that was probably difficult to implement at the technical level at that time. However, since the performance of turbo codes proposed by Berrou, Glavieux, and Thitimajshima in 1993 was close to Shannon's channel capacity, many studies on channel coding based on iterative decoding and its graph have been conducted by performing many different interpretations on the performance and characteristics of turbo codes. As a result, as in the re-study of LDPC codes in the late 1990s, if the LDPC codes are decoded by applying iterative decoding based on the sum-product algorithm on the Tanner graph corresponding to the LDPC codes, it is found that the performance of the LDPC codes is also close to Shannon's channel capacity.
[0073] LDPC codes can generally be defined as a parity check matrix and represented using a bipartite graph often called a Tanner graph.
[0074] Figure 1 is a structural diagram of a system LDPC codeword according to an embodiment of the present disclosure.
[0075] In the following, reference will be made to Figure 1 Describe the system LDPC codeword.
[0076] LDPC code is received by K ldpc bits or symbols to generate an information word 102 composed of N ldpc bits or symbols. In the following, for the sake of convenience, it is assumed that by receiving a codeword consisting of K ldpc The information word 102 of N bits is generated by ldpc bits of codeword 100. That is, when K ldpc The information word consists of When LDPC encoded, the codeword is generated That is, the information word and the code word are bit strings composed of a plurality of bits and information word bits, and the code word bits mean each bit constituting the information word and the code word. When the information word is a code, the code word is called a systematic code. Here, is the parity bit 104, and the number of parity bits Nparity can be expressed by Nparity=N ldpc -K ldpc To express.
[0077] The LDPC code is a linear block code and includes a process of determining a codeword satisfying the condition of Equation 1 below.
[0078] [Equation 1]
[0079]
[0080] In equation 1 above,
[0081] In the above equation 1, H represents a parity check matrix, C represents a codeword, ci represents an i-th codeword bit, and Nldpc represents an LDPC codeword length. In the above equation 1, hi represents an i-th column of the parity check matrix H.
[0082] The parity check matrix H consists of Nldpc columns equal to the number of LDPC codeword bits. The above equation 1 indicates that since the sum of the products of the i-th column hi of the parity check matrix and the i-th codeword bit ci becomes "0", the i-th column hi has a relationship with the i-th codeword ci.
[0083] Will refer to Figure 2 Describe the graph representation of LDPC codes.
[0084] Figure 2 is a Tanner graph showing an example of a parity check matrix H1 of an LDPC code consisting of 4 rows and 8 columns according to an embodiment of the present disclosure. Figure 2 , since the parity check matrix H1 has 8 columns, a codeword of length 8 is generated, the code generated by H1 represents an LDPC code, and each column corresponds to 8 bits of the code.
[0085] refer to Figure 2 , the Tanner graph of the LDPC code encoded and decoded based on the parity check matrix H1 consists of 8 variable nodes (i.e., x1(202), x2(204), x3(206), x4(208), x5(210), x6(212), x7(214), and x8(216)) and 8 check nodes 218, 220, 222, and 224. Here, the i-th column and the j-th column of the parity check matrix H1 of the LDPC code correspond to the variable node xi and the j-th check node, respectively. In addition, the value 1 at the point where the j-th column and the j-th row of the parity check matrix H1 of the LDPC code intersect each other, and a value other than 0 means that an edge connecting the variable node xi and the j-th check node exists on the Tanner graph, as shown Figure 2 shown.
[0086] The degree of the variable node and the check node on the Tanner graph of the LDPC code represents the number of edges connected to each node, which is equal to the number of entries other than 0 in the column or row corresponding to the corresponding node in the parity check matrix of the LDPC code. Figure 2, the degrees of variable nodes x1 (202), x2 (204), x3 (206), x4 (208), x5 (210), x6 (212), x7 (214), and x8 (216) are 4, 3, 3, 3, 2, 2, 2, and 2, respectively, and the degrees of check nodes 218, 220, 222, and 224 are 6, 5, 5, and 5, respectively, in sequence. In addition, in Figure 2 The variable node corresponding to Figure 2 The number of entries other than 0 in each column of the parity check matrix H1 corresponds to the above degrees 4, 3, 3, 3, 2, 2, 2, and 2 in sequence, while Figure 2 The corresponding check node of Figure 2 The number of entries other than 0 in each row of the parity check matrix H1 corresponds to the above-mentioned degrees 6, 5, 5, and 5 in sequence.
[0087] You can use the Figure 2 The LDPC code is decoded by using the iterative coding algorithm of the sum-product algorithm on the bipartite graph shown in . Here, the sum-product algorithm is a message passing algorithm. The message passing algorithm means the following algorithm: using the edge exchange messages on the bipartite graph, using the message input to the variable node or the check node to calculate the output message and update the calculated output message.
[0088] Here, the value of the i-th coded bit can be determined based on the message of the i-th variable node. The value of the i-th coded bit can be applied to both hard decisions and soft decisions. Therefore, the performance of the i-th bit ci of the LDPC codeword corresponds to the performance of the i-th variable node of the Tanner graph, which can be determined by the position and number of 1s in the i-th column of the parity check matrix. In other words, the performance of the Nldpc codeword bits of the codeword can depend on the position and number of 1s in the parity check matrix, which means that the performance of the LDPC code is greatly affected by the parity check matrix. Therefore, in order to design an LDPC code with excellent performance, a method for designing a good parity check matrix is needed.
[0089] In order to easily implement a parity check matrix used in a communication or broadcasting system, generally, a quasi-cyclic LDPC code (QC-LDPC code) using a parity check matrix of a quasi-cyclic form is mainly used.
[0090] The QC-LDPC code has a parity check matrix consisting of a 0 matrix (zero matrix) or a cyclic permutation matrix in the form of a small square matrix. At this time, the permutation matrix means a matrix in which all elements of the square matrix are 0 or 1 and each row or column includes only one 1. In addition, the cyclic permutation matrix means a matrix in which each element of the identity matrix is cyclically shifted.
[0091] Hereinafter, the QC-LDPC code will be described in detail.
[0092] First, the circulant permutation matrix P with a size of L×L = (P i,j ) is defined by the following equation 2. Here, P i,j means the entry in the i-th row and j-th column in the matrix P (here, O≤i, j≤L).
[0093] [Equation 2]
[0094]
[0095] For the permutation matrix P defined as described above, it can be understood that Pi (0≤i≤L) is a cyclic permutation matrix in the form in which each entry of the identity matrix having a size of L×L is cyclically shifted i times in the right direction.
[0096] The parity check matrix H of the simplest QC-LDPC code can be expressed by the following Equation 3.
[0097] [Equation 3]
[0098]
[0099] If P -1 is defined as a zero matrix with a size of L×L, then each index a of the zero matrix or circulant permutation matrix in the above equation 3 is i,j has one of the values of {-1, 0, 1, 2, ..., L-1}. In addition, it can be understood that the parity check matrix H of the above equation 3 has n column blocks and m row blocks, and thus has a size of mL×nL.
[0100] If the parity check matrix of the above equation 3 has a full rank, it is obvious that the size of the information word bits of the QC-LDPC code corresponding to the parity check matrix is (nm) L. For convenience, the (nm) column blocks corresponding to the information bits are called information column blocks, and the ma column blocks corresponding to the remaining parity check bits are called parity check column blocks.
[0101] Generally, a binary matrix with an m×n size obtained by replacing each of the circulant permutation matrix and the 0 matrix in the parity check matrix of the above equation 3 with 1 and 0, respectively, is called a mother matrix or basic matrix M(H) of the parity check matrix H, and an integer matrix with an mxn size obtained as shown in the following equation 4 by selecting only the exponent of each of the m×n or 0 matrices is called an exponent matrix E(H) of the parity check matrix H.
[0102] [Equation 4]
[0103]
[0104] As a result, an integer included in the exponential matrix corresponds to a cyclic permutation matrix in the parity check matrix, so for convenience, the exponential matrix can be represented by a sequence including integers. (This sequence is also called an LDPC sequence or an LDPC code sequence to distinguish it from another sequence). Generally, a parity check matrix can be represented by a sequence having the same properties algebraically as well as an exponential matrix. In the present disclosure, for convenience, a parity check matrix is represented by a sequence indicating the position of 1 within an exponential matrix or a parity check matrix, but the sequence symbols that can identify the position of 1 or 0 included in the parity check matrix are various and are therefore not limited to the symbols in this specification. Therefore, there are various sequence forms that show the same effect algebraically.
[0105] In addition, even if the transmission / reception device on the device can directly generate a parity check matrix to perform LDPC encoding and decoding, according to the characteristics of the implementation, a sequence or exponential matrix having the same algebraic effect as the parity check matrix can also be used to perform LDPC encoding and decoding. Therefore, although the present disclosure describes encoding and decoding using a parity check matrix for convenience, it should be noted that encoding and decoding can be implemented by various methods that can obtain the same effect as the parity check matrix on an actual device.
[0106] For reference, algebraically identical effect means that two or more different representations can be interpreted or converted to be logically or mathematically identical to each other.
[0107] For convenience, the embodiments of the present disclosure describe that there is only one circulant permutation matrix corresponding to a block, but the same disclosure can even be applied to the case where a block includes several circulant permutation matrices. When the sum is included in an i-th row block and a j-th column block as shown in the following Equation 5, the exponential matrix can be represented by the following Equation 6. Referring to the following Equation 6, it can be seen that the two integers correspond to the i-th row and the j-th column corresponding to the row block and the column block including the sum of the plurality of circulant permutation matrices.
[0108] [Equation 5]
[0109]
[0110] [Equation 6]
[0111]
[0112] According to the above embodiment, generally, in a QC-LDPC code, a plurality of cyclic permutation matrices may correspond to one row block and column block in a parity check matrix, but for convenience, the present disclosure describes that one cyclic permutation matrix corresponds to one block. However, the subject matter of the present disclosure is not limited thereto. For reference, a matrix having a size of L×L in which a plurality of cyclic permutation matrices overlap in one row block and column block is called a cyclic matrix or a cyclic.
[0113] Meanwhile, the mother matrix or basic matrix of the parity check matrix and the exponential matrix used in the above-mentioned equations 5 and 6 means a binary matrix obtained by replacing each circulant permutation matrix and 0 matrix with 1 and 0, respectively, similar to the definition used in equation 3. Here, the sum of a plurality of circulant permutation matrices (i.e., circulant matrices) included in one block is also replaced with 1.
[0114] Since the performance of the LDPC code is determined by the parity check matrix, it is necessary to design a parity check matrix with excellent performance for the LDPC code. In addition, an LDPC encoding and decoding method that can support various input lengths and code rates is required.
[0115] Lifting means a method for not only efficiently designing QC-LDPC codes, but also for generating parity check matrices with various lengths from a given exponential matrix or generating LDPC codewords. That is, lifting means a method for efficiently designing a very large parity check matrix by setting an L value that determines the size of a circulant permutation matrix or a 0 matrix from a given small mother matrix according to a specific rule, or generating a parity check matrix with various lengths, or generating an LDPC codeword, or generating an LDPC codeword by applying an appropriate L value to a given exponential matrix or a sequence corresponding thereto.
[0116] The existing lifting methods and the characteristics of QC-LDPC codes designed by lifting are briefly described with reference to the following document: S. Myung, K. Yang and Y. Kim, "Lifting Methods for Quasi-Cyclic LDPC Codes", IEEE Communications Letters, vol. 10, pp. 489-491, June 2006 (hereinafter referred to as Myung 2006).
[0117] First, when the LDPC code C is given 0 When the S QC-LDPC codes designed by the lifting method are set to C 1 ,…,C S , and the values corresponding to the sizes of row blocks and column blocks of the parity check matrix of each QC-LDPC code are set to L k Here, C 0Corresponding to C 1 ,...,C S The mother matrix of the code is the minimum LDPC code of the parity check matrix, and the L0 value corresponding to the size of the row block and column block is 1. In addition, for convenience, each code C k The parity check matrix H k An exponential matrix with size m×n And each index is chosen as {-1,0,1,2,...,L k -1} value.
[0118] Existing enhancement methods include C 0 ->C 1 ->...->CS operation, and has characteristics such as L(k+1)=q(k+1)Lk (where q(k+1) is a positive integer, k=0, 1,..., S-1). In addition, if C is stored only according to the characteristics of the lifting process S The parity check matrix H S , then according to the lifting method, all QC-LDPC codes C 0 ,C 1 ,…,C S It can be expressed by the following equation 7.
[0119] [Equation 7]
[0120]
[0121] or
[0122] [Equation 8]
[0123] E(H k )=E(H s )mod L k
[0124] In this way, not only is it possible to design QC-LDPC codes C greater than C0 1 ,...,C S etc., and there is also a method from the large code C k Methods of generating small codes Ci (i=k-1, k-2, . . . , 1, 0) by appropriate methods such as those shown in Equation 7 or 8 are called lifting.
[0125] According to the lifting method of equation 7 or 8 above, corresponding to each QC-LDPC code C k The size of the row block or column block of the parity check matrix is L kThe values have a multiple relationship with each other, so the exponential matrix is also selected by a specific scheme. As described above, the existing lifting method helps promote the design of QC-LDPC codes with improved error floor characteristics by making the algebraic or graphical properties of each parity check matrix designed by lifting excellent.
[0126] However, there is a problem that each of the Lk values has a multiple relationship with each other, so the length of each code is greatly limited. For example, assuming that L(k+1)=2*L k The minimum lifting method is applied to each Lk value. In this case, the size of the parity check matrix of each QC-LDPC code can be 2 k m×2 k That is, when boosting is applied in 10 operations (S=10), the size of the parity check matrix can generate a total of 10 sizes, which means that QC-LDPC codes having 10 lengths can be supported.
[0127] Therefore, the existing lifting method has a slightly disadvantageous characteristic when designing QC-LDPC codes supporting various lengths. However, considering various types of data transmission, commonly used communication systems require a very high level of length compatibility. Therefore, there is a problem that the LDPC coding technology based on the existing lifting method is difficult to apply to mobile communication systems.
[0128] In order to overcome such problems, a lifting method considered in the present disclosure will be described in detail below.
[0129] First, the S LDPC codes designed by the lifting method are set to C 1 ,…,C S , and the value corresponding to the size of one row block and column block in the parity check matrix of each LDPC code CZ is set to Z (Z = 1, ..., S). (Hereinafter, for convenience, it is referred to as the block size). In addition, the parity check matrix Hz of each code CZ has an exponential matrix of size m × n index Each of is selected as one of the values of {-1, 0, 1, 2, ..., Z-1}. For convenience, in the present disclosure, the index representing the 0 matrix is represented as -1, but it can be changed to other values according to the convenience of the system.
[0130] Therefore, the exponential matrix of the LDPC code CS with the maximum parity check matrix is defined as
[0131] The general lifting method can be expressed by the following equation 9 to obtain
[0132] [Equation 9]
[0133]
[0134] or
[0135]
[0136] In the above equation 9, the lifting function f(x, Z) is an integer function defined by integers x and Z. That is, the lifting function f(x, Z) is a function determined by the size value of the circulant matrix that configures the index matrix (or a sequence corresponding thereto) for a given parity check matrix of a QC-LDPC code and the parity check matrix of the QC-LDPC code. Therefore, briefly summarizing the process of operating the lifting method used in the present disclosure, each index is transformed by a Z value determined based on an integer corresponding to each index from an index matrix and a circulant matrix of size Z x Z given to define an LDPC code, and LDPC encoding or decoding is performed based on each transformed index.
[0137] Since the lifting method is applied to an exponential matrix of size mxn, the parity check matrix or the corresponding exponential matrix can be obtained for all cases where the codeword length is nxZ (Z=1,2,...). In addition, if the parity check matrix has a full rank, it is obvious that all cases where the size of the information word bits of the QC-LDPC code corresponding to the parity check matrix is (nm)Z (Z=1,2,...) can be supported. Therefore, it can be seen that the lifting method is a suitable method for QC-LDPC encoding / decoding, which supports a wide variety of information word lengths and codeword lengths.
[0138] However, according to the following document: S. Myung, K. Yang and J. Kim, "Quasi-Cyclic LDPC Codes for Fast Encoding", IEEE Transactions on Information Theory, vol. 51, No. 8, pp. 2894-2901, August 2005 (hereinafter referred to as Myung 2005). The cyclic characteristics of QC-LDPC codes are determined according to the mother matrix and the exponential matrix used for the parity check matrix. Since the lifting method of the above equation 9 changes the exponential matrix used for a very wide variety of Z values from an exponential matrix, it is difficult to control the cyclic characteristics of the parity check matrix.
[0139] In other words, when given an exponential matrix When transforming the exponential matrix for all Z values, it is difficult to satisfy the conditions described in the above reference [Myung 2005] so that the cyclic characteristics are always good. Therefore, according to the present disclosure, it is suggested that: by limiting the Z value according to the range of Z values to be supported, the flexibility of the codeword length and the information word length is deteriorated, but the code performance can be improved instead.
[0140] First, assume that a plurality of Z values can be divided into A sets (or groups) Zi (i=1, 2, . . . , A), as shown in Equation 10 below.
[0141] [Equation 10]
[0142] Z i ={Z|Z=X i +k·D i , k = 0, 1, ..., Y i}, i = 1, 2, ..., A.
[0143] As a detailed example of the above equation 10, block sizes Z = 1, 2, 3, ..., 15, 16, 17, 18, ..., 31, 32, 34, 36, 38, ..., 60, 62, 64, 68, 72, 76, ..., 120, 124, 128, 136, 144, 152, ..., 240, 248 and 256 are divided into 5 (=A) sets or groups as shown in the following equation 11.
[0144] [Equation 11]
[0145] Z1 = {1, 2, ..., 15}, Z2 = {16, 17, ..., 31}, Z3 = {32, 34, 36, ..., 60, 62},
[0146] Z4={64, 68, 72,..., 120, 124}, Z5={128, 136, 144,..., 240, 248}
[0147] The above equation 11 is expressed by a method similar to the above equation 10, as shown in the following equation 12.
[0148] [Equation 12]
[0149] Z i ={Z|Z=X i +k·D i , k = 0, 1, ..., Y i}, i = 1, 2, ..., A
[0150] A=5.
[0151] X 1=1,X 2 =16,X 3 =32,X 4 =64,X 5 =128.
[0152] Y 1 =15,Y 2 =Y 3 =Y 4 =Y 5 =16.
[0153] D 1 =D 2 =1,D 3 =2,D 4 =4,D 5 =8.
[0154] The above-mentioned equations 10 to 12 are only one method of expression and may be expressed by various methods, and thus are not necessarily limited thereto.
[0155] Describing the above equations 10 to 12, the block size Z to be supported is first divided into a plurality of sets or groups. For convenience, in the present disclosure, the groups of block sizes are divided according to the range of values of the block size and the increasing values of the block size, but it is obvious that the block size can be divided by various methods. For example, there may be various methods, such as grouping block sizes having a specific multiple or divisor relationship, or grouping the remainders of certain fixed numbers into the same block size.
[0156] Di, which means the width by which the block size value is increased in each group Zi, is a value that determines the granularity of the block size group. For example, according to equations 11 to 12 above, the number of block sizes included in Z1 and the number of block sizes included in Z2 are different from each other, such as 16 to 15, but have a characteristic of increasing by 1. In this way, if the Di values are equal to each other, the granularity is expressed as being equal. Referring to Z2 and Z3, the number of block sizes is the same as 16, but D2=1 and D3=2 are different from each other. In this case, the granularities are different from each other, and D2 is expressed as having a larger granularity than that of D3. That is, the smaller the Di value, the larger the granularity. Generally, the smaller the Di value, the finer the granularity.
[0157] The importance of the decision on granularity in the design of QC-LDPC codes will be described in more detail.
[0158] Assume that a mother matrix or a basic matrix is defined as a parity check matrix required to generate LDPC coding, and the size of the mother matrix or the basic matrix is m×n. In addition, for convenience, if the parity check matrix has a full rank, the number of information bits and the number of codeword bits are (nm)Z and nZ, respectively, as described above. Therefore, according to the above equations 10 to 12, if Z∈Zi, the number of information words and the number of codeword bits are given by (nm)(X i+ k·D i ) and n(X i+ k·D i )(k=0,1,...) represents.
[0159] As a result, it can be seen that the number of information bits and the number of codeword bits increase at intervals of (n×m)Di and nDi, respectively, where (nm)Xi and nXi are minimum values. That is, when determining the mother matrix or basic matrix, the increase in information word length or codeword length is determined by Di.
[0160] If all Di values are 1, the number of information bits and the number of codeword bits increase at intervals of (nm) and n, respectively, so it can be seen that the granularity is quite large. If the granularity is quite large, the length flexibility can be maximized and supported when applying QC-LDPC coding. (In the case of LDPC codes, length flexibility can be supported by traditional shortening and puncturing techniques. However, since it is not within the subject matter of the present disclosure, its detailed description will be omitted.)
[0161] However, if the particle size is large, the length flexibility is improved, but there are some problems.
[0162] First, in general, well-designed LDPC codes and other linear block codes improve the minimum distance characteristics or cyclic characteristics on the Tanner graph as the length increases. If the coding gain is expressed based on the signal-to-noise ratio (SNR) in dB, the coding gain also improves at a roughly constant rate when the code length generally increases at a predetermined rate. (However, if the codeword length gradually increases, the coding performance approaches the Shannon limit, so the improvement in coding performance is limited and the effect decreases bit by bit.) More specifically, for example, for the same code rate, if the coding gain when the code length increases from 500 to 1000 is the same as the rate of increase of the codeword when it increases from 4000 to 8000, the coding gain also has similar characteristics. On the other hand, if the coding gain when the codeword length increases from 500 to 1000 is the same as the rate of increase of the codeword when it increases from 4000 to 4500, the difference in coding gain is greater than the case where the rate is the same. (Generally, in the latter case, the effect of improving the coding gain is generally small.) As described above, it can be seen that the improvement in coding gain is closely related to the rate of increase of the codeword length.
[0163] Therefore, as shown in equations 10 to 12 above, if all D_i values are set to 1, the length flexibility has a great advantage because the number of information bits and the number of codeword bits are increased by (nm) and n, respectively, but it is more complicated when considering the hardware implementation. In addition, as the codeword length increases, the performance improvement effect gradually decreases due to the increase in the codeword length, so setting the Di value by appropriately considering the performance improvement effect compared to the complexity of the hardware implementation required in the system may be important in the design of a good system.
[0164] Therefore, if the performance improvement effect required for the performance improvement effect when the codeword or information word length increases in the system is equal to or higher than a predetermined level, the Di value can be set to a value other than 1 according to the range of the Z value. For example, as shown in equations 11 to 12 above, when the minimum block size value Z=128 at Z5, the information word length and the codeword length are 128 (nm) and 128n. If the granularity is set to high and Z=129 is therefore included in Z5, when the information word length and the codeword length are considered to be 129 (nm) and 129n, the increase rate of the length becomes a maximum value of 129 / 128, so that the increase rate of the codeword and the information word of Z1 is much less than the minimum value of 15 / 14 (corresponding to the case of Z=14,15). Therefore, it can be easily considered that the coding gain effect according to the increase in the codeword length is very small. Therefore, if the Z value is relatively large, it is more effective to approximately adjust and use the Di value to obtain the coding gain required by the system.
[0165] In the above equations 10 to 12, for convenience, only the case where the Di value is defined in a set of block sizes with a predetermined granularity is described, but the present disclosure is not limited to this. If the increase length of the block size is not constant, then among the differences of the block sizes included in a set, a value having the minimum absolute value, or an average value, or a median value, etc. for the difference between two adjacent elements can be represented as the granularity of the set. In other words, if a set of block sizes is given as {64, 68, 76, 84, 100}, for convenience, the granularity can be defined as 4, which is the minimum difference between two elements; or as 9, which is the average value of 4, 8, 8, or 16 as the difference between two adjacent elements; or as 8, which is the median value.
[0166] When the granularity is high, such as setting all Di values to 1, length flexibility is improved, but designing a good QC-LDPC code may be difficult.
[0167] Generally, the disadvantage of a system using LDPC coding is that if there are many parity check matrices independent of each other, the complexity of the implementation method is increased. Therefore, similar to the lifting method, multiple parity check matrices are designed to perform LDPC coding using a method corresponding to an exponential matrix or LDPC sequence. However, with reference to the following literature, S. Myung, K. Yang and J Kim, "Quasi-Cyclic LDPC Codes for Fast Encoding", IEEE Transactions on Information Theory, vol. 51, No. 8, pp. 2894-2901, August 2005 (hereinafter referred to as Myung 2005). Generally, QC-LDPC coding has cyclic characteristics on a special Tanner graph according to the exponential matrix and mother matrix (or basic matrix) of the parity check matrix and the block size. If parity check matrices for various block sizes are supported from one exponential matrix or LDPC sequence, it is difficult to maintain good cyclic characteristics for all block sizes. This is because the more types of block sizes, the more difficult it becomes.
[0168] The cyclic characteristics of QC-LDPC codes will be briefly described with reference to the above reference [Myung2005]. First, it is assumed that the number of cyclic permutation matrices forming 4 cycles on the mother matrix is four as shown in the following equation 13. Here, it is assumed that the size of the cyclic permutation matrix is Z×Z.
[0169] [Equation 13]
[0170]
[0171] According to reference [Myung2005], when there is a minimum positive integer r satisfying the following Expression 14, there is a cycle with a length of 4r on the Tanner graph corresponding to the parity check matrix of the above Equation 13.
[0172] [Equation 14]
[0173] r·(a 1 -a 2 +a 3 -a 4 )=0(mod Z)
[0174] Figure 3A and Figure 3B is a diagram for explaining the cyclic characteristics of a QC-LDPC code according to an embodiment of the present disclosure.
[0175] refer to Figure 3A, since a1-a2+a3-a4=0 when Z=6, a1=a2=0, a3=a4=1, it can be easily seen that 4 cycles are obtained on the Tanner diagram. Figure 3B , since in the case of Z = 6, a1 = a2 = 0, a3 = 3, a4 = 1, r·(a 1 -a 2 -a 3 -a 4 )=3·2=0(mod6) Therefore, it can be easily seen that 12 cycles are obtained.
[0176] As described above, the QC-LDPC code has a cyclic characteristic on a special Tanner graph according to the exponential matrix and the mother matrix (or basic matrix) of the parity check matrix and the block size. When supporting parity check matrices of various block sizes from one exponential matrix or LDPC sequence, as shown in equations 13 and 14 above, even when the exponential matrix is fixed, in equation 14 above, the calculated value can be changed by the modulo Z operation, so the cyclic characteristic can be changed. Therefore, it is obvious that the more types of block sizes there are, the more likely the cyclic characteristic is to deteriorate.
[0177] Therefore, as in the examples of equations (10) to (12), the code can be easily designed by adjusting the number of block sizes to be supported by appropriately setting the granularity in a set of specific block sizes.
[0178] As described above, the lifting method proposed in the present disclosure proposes a method of dividing into a plurality of block size groups with appropriately set granularity. In a detailed embodiment, at least two of the plurality of groups have different particle sizes. In another embodiment, there may be at least two block size groups that satisfy the following characteristics: the maximum value of the increase rate of adjacent block sizes included in one block size group is greater than or equal to the minimum value of the increase rate of adjacent block sizes included in another block size group. In another embodiment, the characteristics of the granularity and the increase rate of the block size may be satisfied simultaneously.
[0179] Figure 4 is a block configuration diagram of a transmitting device according to an embodiment of the present disclosure.
[0180] refer to Figure 4 The transmitting device 400 may include a segmentator 410, a zero filler 420, an LDPC encoder 430, a rate matcher 440, a modulator 450, etc. to process variable length input bits. The rate matcher 440 may include an interleaver 441 and a puncturing / repetition / zero remover 442, etc.
[0181] here, Figure 4The components shown in are components for performing encoding and modulation on variable length input bits, which is only an example. In some cases, the components may be omitted or changed. Figure 4 Some of the components shown in , and other components can be added.
[0182] On the other hand, the transmitting device 400 can send necessary parameters (for example, input bit length, modulation and code rate (ModCod), parameters for zero padding (or shortening), code rate / codeword length of LDPC code, parameters for interleaving, parameters for repetition, puncturing, etc., modulation scheme, etc.), perform encoding of the parameters based on the determined parameters, and send the encoded parameters to the receiving device 500.
[0183] Since the number of input bits is variable, when the number of input bits is greater than a preset value, the input bits may be segmented to have a length equal to or less than the preset value. In addition, each of the segmented blocks may correspond to one LDPC coding block. However, when the number of input bits is equal to or less than the preset value, the input bits are not segmented. The input bits may correspond to one LDPC coding block.
[0184] At the same time, the transmitting device 400 may store various parameters for encoding, interleaving and modulation in advance. Here, the parameters for encoding may be information about the code rate, codeword length and parity check matrix of the LDPC code. In addition, the parameters for interleaving may be information about the interleaving rule, and the parameters for modulation may be information about the modulation scheme. In addition, the information about puncturing may be the puncturing length. In addition, the information about repetition may be the repetition length. When the parity check matrix proposed in the present disclosure is used, the information about the parity check matrix may store the exponential value of the circulant matrix.
[0185] In this case, each component of the configuration transmitting apparatus 400 may perform an operation using a parameter.
[0186] Meanwhile, although not shown, in some cases, the transmitting device 400 may further include a controller (not shown) for controlling the operation of the transmitting device 400. Therefore, the operation of the transmitting device as described above and the operation of the transmitting device described in the present disclosure may be controlled by the controller, and the controller of the present disclosure may be defined as a circuit or a dedicated integrated circuit or at least one processor.
[0187] Figure 5 is a block configuration diagram of a receiving device according to an embodiment of the present disclosure.
[0188] refer to Figure 5, the receiving device 500 may include a demodulator 510, a rate dematcher 520, an LDPC decoder 530, a zero remover 540, a desegmenter 550, etc. to process variable length information. The rate dematcher 520 may include a log-likelihood ratio (LLR) inserter 522, an LLR combiner 523, a deinterleaver 524, etc.
[0189] here, Figure 5 The components shown in the figure are implemented with Figure 5 The components shown in the figure correspond to the functions of the components, which are only examples, and in some cases, some components may be omitted and changed, and other components may also be added.
[0190] The parity check matrix in the present disclosure can be determined using a memory, or can be given in advance in a transmitting device or a receiving device, or can be directly generated in a transmitting device or a receiving device. In addition, the transmitting device can store or generate a sequence, an index matrix, etc. corresponding to the parity check matrix, and apply the generated sequence or index matrix to the encoding. Similarly, even the receiving device can store or generate a sequence, an index matrix, etc. corresponding to the parity check matrix, and apply the generated sequence or index matrix to the encoding.
[0191] In the following, reference will be made to Figure 5 A detailed description of the operation of the receiver is described.
[0192] The demodulator 510 demodulates the signal received from the transmitting device 400 .
[0193] In detail, the demodulator 510 is connected with Figure 4 A component corresponding to the modulator 450 of the transmitting device 400 , and can demodulate a signal received from the transmitting device 400 , and generate a value corresponding to a bit transmitted from the transmitting device 400 .
[0194] To this end, the receiving device 500 may pre-store information about a modulation scheme of a modulated signal according to a mode in the transmitting device 400. Therefore, the demodulator 510 may demodulate a signal received from the transmitting device 400 according to the mode to generate a value corresponding to an LDPC codeword bit.
[0195] Meanwhile, a value corresponding to a bit transmitted from the transmitting apparatus 400 may be an LLR value.
[0196] In detail, the LLR value may be represented by a value obtained by applying Log (logarithm) to the ratio of the probability that the bit transmitted from the transmitting device 400 is 0 to the probability that the bit transmitted from the transmitting device 400 is 1. The LLR value itself may be a bit value, and the LLR value may be a representative value determined depending on the part to which the probability that the bit transmitted from the transmitting device 400 is 0 and the probability that the bit transmitted from the transmitting device 400 is 1 belong.
[0197] The demodulator 510 includes a process of performing multiplexing (not shown) on the LLR values. In detail, the demodulator 510 is a component corresponding to the bit demultiplexer (not shown) of the transmitting apparatus 400, and may perform an operation corresponding to the bit demultiplexer (not shown).
[0198] To this end, the receiving device 500 may pre-store information about parameters used by the transmitting device 400 to perform demultiplexing and block interleaving. Therefore, the multiplexer (not shown) may reversely perform the demultiplexing and block interleaving operations performed by the bit demultiplexer (not shown) on the LLR values corresponding to the cell words to multiplex the LLR values corresponding to the cell words in units of bits.
[0199] The rate dematcher 520 may insert the LLR value into the LLR value output from the demodulator 510. In this case, the rate dematcher 520 may insert the previously committed LLR value between the LLR values output from the demodulator 510.
[0200] In detail, the rate dematcher 520 is a component corresponding to the rate matcher 440 of the transmitting apparatus 400 , and may perform operations corresponding to the interleaver 441 and the zero remover and puncturing / repetition / zero remover 442 .
[0201] First, the rate dematcher 520 performs deinterleaving to correspond to the interleaver 441 of the transmitter. The output value of the deinterleaver 524 may allow the LLR inserter 522 to insert the LLR value corresponding to the zero bit into the position where the zero bit in the LDPC codeword is padded. In this case, the LLR value corresponding to the padded zero bit, that is, the shortened zero bit may be However, ∞ or −∞ is a theoretical value, but may actually be a maximum value or a minimum value of the LLR value used in the receiving apparatus 500 .
[0202] For this purpose, the receiving device 500 may pre-store information about parameters used by the transmitting device 400 to fill zero bits. Therefore, the rate dematcher 520 may determine the positions where zero bits in the LDPC codeword are filled, and insert LLR values corresponding to the shortened zero bits into the corresponding positions.
[0203] In addition, the LLR inserter 522 of the rate dematcher 520 may insert the LLR value corresponding to the punctured bit into the position of the punctured bit in the LDPC codeword. In this case, the LLR value corresponding to the punctured bit may be 0.
[0204] To this end, the receiving apparatus 500 may pre-store information on parameters used by the transmitting apparatus 400 to perform puncturing. Therefore, the LLR inserter 522 may insert an LLR value corresponding thereto into a position where the LDPC parity bits are punctured.
[0205] The LLR combiner 523 can combine, i.e., sum, the LLR values output from the LLR inserter 522 and the demultiplexer 510. In detail, the LLR combiner 523 is a component corresponding to the puncturing / repetition / zero remover 442 of the transmitting device 400, and can perform operations corresponding to the repeater 442. First, the LLR combiner 523 can combine the LLR values corresponding to the repeated bits with other LLR values. Here, the other LLR values can be bits that are the basis for the transmitting device 400 to generate the repeated bits, that is, LLR values for LDPC parity check bits selected as the object of repetition.
[0206] That is, as described above, the transmitting apparatus 400 selects bits from the LDPC parity bits and repeats the selected bits between the LDPC information bits and the LDPC parity bits, and transmits the repeated bits to the receiving apparatus 500 .
[0207] As a result, the LLR values for the LDPC parity bits may include LLR values for repeated LDPC parity bits and LLR values for non-repeated LDPC parity bits (i.e., LDPC parity bits generated by encoding). Therefore, the LLR combiner 523 may combine the LLR values with the same LDPC parity bits.
[0208] To this end, the receiving device 500 may pre-store information about the parameters used by the transmitting device 400 to perform repetition. Therefore, the LLR combiner 523 may determine the LLR value of the LDPC parity check bit for repetition and combine the determined LLR value with the LLR value of the LDPC parity check bit as the basis of repetition.
[0209] In addition, the LLR combiner 523 can combine the LLR value corresponding to the retransmission or incremental redundancy (IR) bit with other LLR values. Here, the other LLR values can be LLR values for bits selected to generate LDPC codeword bits, which are the basis for generating retransmission or IR bits in the transmitting device 400.
[0210] That is, as described above, when NACK is generated for HARQ, the transmitting device 400 may transmit some or all of the codeword bits to the receiving device 500 .
[0211] Therefore, the LLR combiner 523 may combine the LLR values for the bits received through retransmission or IR with the LLR values for the LDPC codeword bits received through the previous frame.
[0212] For this purpose, the receiving device 500 may pre-store information about the parameters used by the transmitting device 400 to generate the retransmission or IR bits. As a result, the LLR combiner 523 may determine the LLR value for the number of retransmission or IR bits and combine the determined LLR value with the LLR value for the LDPC parity check bit that is the basis for generating the retransmission bits.
[0213] The deinterleaver 524 may deinterleave the LLR values output from the LLR combiner 523 .
[0214] In detail, the deinterleaver 524 is a component corresponding to the interleaver 441 of the transmitting device 400 , and may perform an operation corresponding to the interleaver 441 .
[0215] To this end, the receiving device 500 may pre-store information about the parameters used by the transmitting device 400 to perform interleaving. As a result, the deinterleaver 524 may reversely perform the interleaving operation performed by the interleaver 441 on the LLR values corresponding to the LDPC codeword bits to deinterleave the LLR values corresponding to the LDPC codeword bits.
[0216] The LDPC decoder 530 may perform LDPC decoding based on the LLR value output from the rate dematcher 520 .
[0217] In detail, the LDPC decoder 530 is a component corresponding to the LDPC encoder 430 of the transmitting apparatus 400 , and may perform an operation corresponding to the LDPC encoder 430 .
[0218] To this end, the receiving apparatus 500 may pre-store information about parameters used by the transmitting apparatus 400 to perform LDPC encoding according to the mode. As a result, the LDPC decoder 530 may perform LDPC decoding based on the LLR value output from the rate dematcher 520 according to the mode.
[0219] For example, the LDPC decoder 530 may perform LDPC decoding based on an iterative decoding scheme based on a sum-product algorithm based on the LLR values output from the rate dematcher 520 , and output bits that are error-corrected depending on the LDPC decoding.
[0220] The zero remover 540 may remove zero bits from the bits output from the LDPC decoder 530 .
[0221] In detail, the zero remover 540 is a component corresponding to the zero filler 420 of the transmitting device 400 , and may perform an operation corresponding to the zero filler 420 .
[0222] To this end, the reception apparatus 500 may pre-store information on parameters used by the transmission apparatus 400 to pad zero bits. As a result, the zero remover 540 may remove zero bits padded by the zero padder 420 from bits output from the LDPC decoder 530 .
[0223] The desegmenter 550 is a component corresponding to the segmenter 410 of the transmitting apparatus 400 , and may perform an operation corresponding to the segmenter 410 .
[0224] To this end, the receiving device 500 may pre-store information about parameters used by the transmitting device 400 to perform segmentation. As a result, the desegmenter 550 may combine bits output from the zero remover 540 (ie, segments for variable length input bits) to restore bits before segmentation.
[0225] Meanwhile, although not shown, in some cases, the transmitting device 400 may further include a controller (not shown) for controlling the operation of the transmitting device 400. Therefore, the operation of the transmitting device and the operation of the receiving device described in the present disclosure as described above may be controlled by the controller, and the controller of the present disclosure may be defined as a circuit or a dedicated integrated circuit or at least one processor.
[0226] At the same time, you can Figure 2 An iterative decoding algorithm based on the sum-product algorithm is used on the bipartite graph shown in to decode the LDPC code, and the sum-product algorithm is a message passing algorithm.
[0227] In the following, reference will be made to Fig. 6A and Figure 6B Describe the message passing operations commonly used in LDPC decoding.
[0228] Fig. 6A and Figure 6B Message passing operations performed at any check node and variable node for LDPC decoding according to an embodiment of the present disclosure are shown.
[0229] Fig. 6AThere are shown a check node m 600 and a plurality of variable nodes 610, 620, 630, and 640 connected to the check node m 600. In addition, the illustrated Tn',m represents a message transferred from the variable node n' 610 to the check node m 600, and En,m represents a message transferred from the check node m 600 to the variable node n 630. Here, a set of all variable nodes connected to the check node m 600 is defined as N(m) and a set excluding the variable node n 630 from N(m) is defined as N(m) / n.
[0230] In this case, the message update rule based on the sum-product algorithm can be expressed by the following Equation 15.
[0231] [Equation 15]
[0232]
[0233] In Equation 15 above, Sign(E n,m ) represents the symbol of En,m, and |E n,m | indicates message E n,m At the same time, the function Φ(x) can be expressed by the following equation 16.
[0234] [Equation 16]
[0235]
[0236] at the same time, Figure 6B A variable node x 650 and a plurality of check nodes 660, 670, 680, and 690 connected to the variable node x 650 are shown. y',x represents the message passed from the check node y' 660 to the variable node x 650, and T y,x represents a message transferred from the variable node x 650 to the check node y 680. Here, the set of all check nodes connected to the variable node x 650 is defined as M(x), and the set excluding the check node y 680 from M(x) is defined as M(x) / y. In this case, the message update rule based on the sum-product algorithm can be represented by the following Equation 17.
[0237] [Equation 17]
[0238]
[0239] In Equation 17 above, E x Represents the initial message value of variable node x.
[0240] In addition, when determining the bit value of node x, it can be expressed by the following equation 18.
[0241] [Equation 18]
[0242]
[0243] In this case, based on P x The value is used to determine the coded bits corresponding to node x.
[0244] Fig. 6A and Figure 6B The method shown in is a general decoding method, so its detailed description will not be described again. However, in addition to Fig. 6A and Figure 6B In addition to the method described in, other methods for determining the value of the passed message at the variable node and the check node can also be applied, and their detailed description refers to "Frank R. Kschischang, Brendan J. Frey and Hans-Andrea Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, February 2001, pp. 498-519)".
[0245] Figure 7 is a block diagram for explaining a detailed configuration of an LDPC encoder according to an embodiment of the present disclosure.
[0246] K lpdc bits can form K for LDPC encoder 700 ldpc LDPC information word bits I=(i 0 ,i 1 ,...,). LDPC encoder 700 can systematically ldpc LDPC encoding is performed on the LDPC information word bits to generate a ldpc bits of LDPC codeword Λ=(c 0 ,c 1 ,...,c Nldpc-1 )=(i 0 ,i 1 ,...,i Kldpc-1 ,p 0 ,p 1 ,...,p Nldpc-Kldpc-1 ).
[0247] As described in the above Equation 1, the generation process includes a process of determining a codeword so that the product of the LDPC codeword and the parity check matrix is a zero vector.
[0248] refer to Figure 7 , the encoding device 700 includes an LDPC encoder 710. The LDPC encoder 710 can perform LDPC encoding on the input bits to generate an LDPC codeword based on a parity check matrix or an exponential matrix or a sequence corresponding thereto. In this case, the LDPC encoder 710 can perform LDPC encoding using a parity check matrix that is differently defined depending on a code rate (i.e., a code rate of an LDPC code).
[0249] At the same time, the encoding device 700 may also include a memory (not shown) for pre-storing information about the code rate, codeword length, and parity check matrix of the LDPC code, and the LDPC encoder 710 may use the information to perform LDPC encoding. When the parity check matrix proposed in the present disclosure is used, the information about the parity check matrix may store information about the exponential value of the circulant matrix.
[0250] Figure 8 is a block diagram showing the configuration of an encoding device according to an embodiment of the present disclosure.
[0251] refer to Figure 8 , the decoding device 800 may include an LDPC decoder 810.
[0252] The LDPC decoder 810 performs LDPC decoding on an LDPC codeword based on a parity check matrix or an exponential matrix or a sequence corresponding thereto.
[0253] For example, the LDPC decoder 810 may transfer LLR values corresponding to LDPC codeword bits using an iterative decoding algorithm to perform LDPC decoding, thereby generating information word bits.
[0254] Here, the LLR value is a channel value corresponding to an LDPC codeword bit and may be represented by various methods.
[0255] For example, the LLR value may be represented by a value obtained by applying Log to the ratio of the probability that a bit transmitted from the transmission side through the channel is 0 to the probability that a bit transmitted from the transmission side through the channel is 1. In addition, the LLR value may be the bit value itself determined depending on the soft decision, and the LLR value may be a representative value determined depending on the part to which the probability that a bit transmitted from the transmission side is 0 or 1 belongs.
[0256] In this case, if Figure 7 As shown, the transmitting side may use an LDPC encoder 710 to generate an LDPC codeword.
[0257] In this case, the LDPC decoder 810 may perform LDPC decoding using a parity check matrix that is differently defined depending on a code rate (ie, a code rate of an LDPC code).
[0258] Fig. 9 A structural diagram of an LDPC decoder according to an embodiment of the present disclosure is shown.
[0259] Meanwhile, as described above, the LDPC decoder 810 can perform LDPC decoding using an iterative decoding algorithm. In this case, the LDPC decoder 810 can be configured to have Fig. 9 However, iterative decoding algorithms are known, so Fig. 9 The detailed configurations shown in are only examples.
[0260] refer to Fig. 9 The decoding device 900 includes an input processor 901, a memory 902, a variable node operator 904, a controller 906, a check node operator 908, an output processor 910, etc.
[0261] The input processor 901 stores input values. In detail, the input processor 901 may store LLR values of a signal received through a radio channel.
[0262] The controller 906 determines the block size (i.e., codeword length) of the signal received through the radio channel, the number of values input to the variable node operator 904, and the address value in the memory 902 based on the parity check matrix corresponding to the code rate, the number of values input to the check node operator 908, and the address value in the memory 902, etc.
[0263] The memory 902 stores input data and output data of the variable node operator 904 and the check node operator 908 .
[0264] The variable node operator 904 receives data from the memory 902 to perform the variable node operation, depending on the information about the address of the input data and the information about the number of the input data received from the controller 906. Next, the variable node operator 904 stores the result of the variable node operation in the memory 902 based on the information about the address of the output data and the information about the number of the output data received from the controller 1106. In addition, the variable node operator 904 inputs the result of the variable node operation to the output processor 910 based on the data received from the input processor 901 and the memory 902. Here, reference has been made to Fig. 6A and Figure 6B Describes variable node operations.
[0265] The check node operator 908 receives data from the memory 902 based on the information about the address of the input data and the information about the number of the input data received from the controller 906, thereby performing a check node operation. Next, the check node operator 908 stores the result of the variable node operation in the memory 902 based on the information about the address of the output data and the information about the number of the output data received from the controller 906. Fig. 6A and Figure 6B Check node operations are described.
[0266] The output processor 910 performs a soft decision on whether the information word bit on the transmission side is 0 or 1 based on the data received from the variable node operator 904, and then outputs the result of the soft decision so that the output value of the output processor 910 is finally a decoded value. Fig. 6A and Figure 6B In the example, soft decision can be performed based on the sum value of all message values input to one variable node (initial message value and all message values input from check nodes).
[0267] Meanwhile, the decoding device 900 may further include a memory (not shown) for pre-storing information about the code rate, codeword length, and parity check matrix of the LDPC code, and the LDPC decoder 910 may use the information to perform LDPC encoding. However, this is only an example, and corresponding information may also be provided from the transmitting device.
[0268] Fig.10 is a diagram of a transport block structure according to an embodiment of the present disclosure.
[0269] refer to Fig.10 , you can add <null>bits to make the score segments the same length.
[0270] Additionally, you can add <null>bits to match the information length of the LDPC code.
[0271] Hereinabove, a method of applying various block sizes based on a QC-LDPC code has been described in a communication and broadcasting system supporting LDPC codes of various lengths.
[0272] In order to support various block sizes, a method is proposed in which a block size with appropriately set granularity is divided into a plurality of block size groups in consideration of performance improvement, length flexibility, etc. By setting an appropriate granularity according to the block size group, it is advantageous to design a parity check matrix or an exponential matrix of an LDPC code or a sequence corresponding thereto, and also achieve appropriate performance improvement and length flexibility.
[0273] Next, a method for further improving the encoding performance in the proposed method is proposed.
[0274] If the sequence is appropriately transformed and used for all block sizes from one LDPC index matrix or sequence, etc., as in the lifting method described in equations 7 to 9 above, many advantages can be obtained because only one sequence is required for the system implementation to be implemented. However, as described in equations 13 and 14 above, as the number of types of block sizes to be supported increases, it is difficult to design an LDPC code with good performance for all block sizes.
[0275] Therefore, a method that can be easily applied to solve this problem is to use multiple LDPC sequences. For example, the examples of equations 11 and 12 above are described, and different LDPC parity check matrices (or index matrices or sequences) can be used to perform LDPC encoding and decoding for block size groups Z1, Z2, Z3, Z4, and Z5. In addition, block size groups Z1 and Z2 can use one LDPC parity check matrix (or index matrix or sequence), Z3 and Z4 can use another LDPC parity check matrix (or index matrix or sequence), and Z5 can use another LDPC parity check matrix (or index matrix or sequence) to use LDPC encoding and decoding.
[0276] In the case of performing LDPC encoding and decoding from multiple LDPC index matrices or sequences as described above, since the number of block sizes to be supported is greatly reduced compared to the case of supporting all block sizes from one LDPC index matrix or sequence, it is easy to design an index matrix or sequence of an LDPC code with good coding performance.
[0277] The sequence or index matrix of the LDPC code can be appropriately designed for each block size group to perform LDPC encoding and decoding on all block sizes included in the block size group from one sequence. In this way, when the sequence or index matrix of the LDPC code is designed for each block size group, since the number of block sizes corresponding to one index matrix is limited to the elements in the group, it is easier to design the code, thereby designing an LDPC code with better coding performance.
[0278] As the number of parity check matrices or exponential matrices or sequences of LDPC codes increases, coding performance can be improved, but implementation complexity may increase. Therefore, LDPC codes should be designed by appropriately determining the number of block size groups of LDPC codes and the number of parity check matrices, or the number of LDPC sequences or exponential matrices corresponding thereto, according to the conditions required in system design.
[0279] In the present disclosure, a method of reducing implementation complexity when the number of sequences or index matrices of an LDPC code is two or more is proposed as follows.
[0280] The present invention proposes a method for designing multiple exponential matrices or sequences on a given basic matrix. That is, the number of basic matrices is 1 and exponential matrices, sequences, etc. of LDPC codes are obtained on the basic matrix, and lifting is applied according to the block size included in each block size group from the exponential matrix or sequence, thereby performing variable-length LDPC encoding and decoding.
[0281] In other words, the basic matrix of the parity check matrices corresponding to the sequences or exponential matrices of a plurality of different LDPC codes is the same.
[0282] In this way, the elements or numbers of the exponential matrix or LDPC sequence constituting the LDPC code can have different values, but the positions of the corresponding elements or numbers are exactly consistent with each other. As mentioned above, the exponential matrix or LDPC sequence each refers to the index of the cyclic permutation matrix, that is, the type of the cyclic permutation value of the bit. Therefore, by setting the positions of the elements or numbers of the LDPC sequence or exponential matrix to be the same, it is easy to grasp the position of the bit corresponding to the cyclic permutation matrix.
[0283] Another embodiment of the present disclosure is a method for reducing the complexity of implementation in a system for performing LDPC encoding and decoding, so that an exponential matrix or sequence corresponds to each of the block size groups one by one. When the number of block size groups is the same as the number of exponential matrices or sequences of the LDPC code, all multiple exponential matrices or sequences correspond to the same basic matrix. That is, the number of basic matrices is 1, and the exponential matrix, sequence, etc. of the LDPC code are obtained on the basic matrix, and lifting is applied according to the block size included in each block size group from the exponential matrix or sequence, thereby performing variable length LDPC encoding and decoding.
[0284] The lifting method used for each block size group can be the same or different. For example, when the exponential matrix given to the pth group is and the exponential matrix corresponding to the Z values included in the set is E p (Z)=(e i,j (Z)), it can be expressed by the following equation 19.
[0285] [Equation 19]
[0286] Z∈Z p ,
[0287]
[0288] or
[0289]
[0290] F p (x, Z) may be set differently for each block size group, as shown in Equation 19 above, and may be set the same for some or all of them. As a transformation function, a function that transforms the x value by applying a modulus or flooring according to Z may be used, such as f p (x,Z)=x(mod Z) or And you can use only f p (x, Z) = x, regardless of the value of Z. The latter case is a case where the sequence defined for each group is used as is without special conversion processing. In addition, there may be various methods, in which Z' may be selected as an appropriate value according to system requirements, determined as a maximum value among the values that Z may have, or determined as a maximum value among the values that Z may have within the p-th block size group, and so on.
[0291] As a result, in an embodiment of the present disclosure, when a plurality of block size groups are defined and an LDPC index matrix or sequence is determined for each block size group, a group corresponding to the determined block size is determined, an LDPC index matrix or sequence corresponding to the group is determined, and LDPC encoding and decoding are performed, and the structure of the basic matrix corresponding to the LDPC index matrix or sequence is the same. Here, the LDPC index matrix or sequence may be different for each block size group, and some of them may be the same or different, but at least two or more of them may be different.
[0292] According to another embodiment of the present disclosure, when a plurality of block size groups are defined and an LDPC index matrix or sequence is defined for each block size group, when determining a group corresponding to the determined block size, an LDPC index matrix or a sequence corresponding to the group is determined, and then LDPC encoding and decoding are performed, the structure of the basic matrix corresponding to the LDPC index matrix or sequence is the same, and at least one of the LDPC index matrices or sequences corresponding to the block size group is transformed according to a Z value determined before performing LDPC encoding. Here, the LDPC index matrix or sequence may be different for each block size group, and some of them may be the same or different, but at least two or more of them may be different.
[0293] In another embodiment of the present disclosure, a case where Z=1, 2, 3, ..., 14, 15, 16, 18, 20, ..., 28, 30, 32, 36, 40, ..., 52, 56, 60, 64, 72, 80, ..., 112, 120, 128, 144, 160, ..., 240 and 256 are supported will be described.
[0294] First, it is divided into six groups as shown in Equation 20 below.
[0295] [Equation 20]
[0296] Z1={1,2,3,...,7}, Z2={8,9,10,...,15}, Z3={16,18,20,...,30}, Z4={32,36,40,...,60}, Z5={64,72,80,...,120}, Z6={128,144,160,...,240,256}
[0297] The above Equation 20 is expressed by a method similar to the above Equation 10, as shown in the following Equation 21.
[0298] [Equation 21]
[0299] Z i ={Z|Z=X i +k·D i , k = 0, 1, ..., Y i }, _i = 1, 2, ..., A
[0300] A=6.
[0301] X 1 =1,X 2 =8,X 3 =16,X 4 =32,X 5 =64,X 6 =128.
[0302] Y 1 =7,Y 2 =Y 3 =Y 4 =Y 5 =8.Y 6 =9
[0303] D 1 =D 2 =1,D 3 =2,D 4 =4,D 5 =8,D 6 =16.
[0304] Referring to the block size groups shown in equations 20 and 21 above, since the maximum value of the increase rate of the adjacent block sizes in the block sizes included in Z5 is 72 / 64=1.125, and the minimum value of the increase rate of the adjacent block sizes in the block sizes included in Z4 is 60 / 56=1.071, it can be seen that the former value is greater than the latter value. Similarly, since the maximum value of the increase rate of the adjacent block sizes in the block sizes included in Z6 is 144 / 128=1.125, and the minimum value of the increase rate of the adjacent block sizes in the block sizes included in Z5 is 120 / 112=1.071, it can be seen that the former value is greater than the latter value.
[0305] As described above, if the granularity is set well so that the maximum value of the increase rate of the adjacent block sizes included in one of the at least two block size groups is greater than or equal to the minimum value of the increase rate of the adjacent block sizes included in the other block size group, an appropriate coding gain can be obtained. When the block size groups are set so that the maximum value of the increase rate of the adjacent block sizes included in a specific block size group is always less than the minimum value of the increase rate of the adjacent block sizes included in the other block size group, the flexibility of the information word or codeword length can be increased, but since the coding gain is less than the increase in the codeword length, the efficiency of the system is reduced.
[0306] Assume that we are given group Z p The exponential matrix of is defined as in Equation 19 above And the exponential matrix corresponding to the Z values included in the set is defined as E p (Z)=(e i,j (Z)). At this time, an LDPC index matrix or sequence transformed by applying a lifting function as in the following Equation 22 may be used.
[0307] [Equation 22]
[0308] i)Z∈Z 1 ,
[0309]
[0310] ii) p=2,3,4,5,6, Z∈Z p ,
[0311]
[0312] In some cases, appropriate transformations may be applied to the LDPC index matrix and sequence depending on the block size.
[0313] By storing each transformed sequence separately according to the block size, the transforms of the sequence shown in i) of equation 22 above can also be generated as a new group. For example, in the above example, when Z=1 and Z=2 and 3, Z=4, 5, 6 and 7 are defined as separate block size groups, and the exponential matrix transformed in the case of Z=1, the exponential matrix transformed in the case of Z=2 and 3, and the exponential matrix transformed in the case of Z=4, 5, 6 and 7 can be stored and used separately. In this case, there is a disadvantage in that the number of block size groups and the number of exponential matrices to be stored may increase as the number of matrices increases. In this case, in order to reduce complexity, by applying an appropriate lifting function according to the block size group as shown in equation 22 above, the method and apparatus for LDPC encoding and decoding based on the LDPC exponential matrix and sequence can be implemented more simply.
[0314] Techniques such as shortening or puncturing can be applied to the parity check matrix that can be obtained from the exponential matrix to support more various code rates. Fig.11 and Fig.12 A flow chart of an embodiment of an exponential matrix-based LDPC encoding and decoding process is shown in FIG.
[0315] Fig.11 is a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0316] First, if Fig.11 The information word length is determined as in operation 1110 of . In the present disclosure, in some cases, the information word length is sometimes represented by a code block size (CBS).
[0317] Next, an LDPC index matrix or sequence matching the determined CBS is determined as in operation 1120 .
[0318] LDPC encoding is performed in operation 1130 based on the index matrix or sequence. As a detailed example, it is assumed that the CBS is determined to be 1280 in operation 1110. If the information word corresponds to 32 columns in the index matrix, Z=1280 / 32=40, and thus the block size Z=40 is included in Z4. Therefore, in operation 1120, an index matrix or sequence corresponding to the block size included in Z4={32, 36, 40, ..., 60} of equation 20 above is determined, and the index matrix or sequence can be used to perform LDPC encoding in operation 1130.
[0319] The LDPC decoding process can be similar to Fig.12 as shown in .
[0320] Fig.12 is an exemplary diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0321] refer to Fig.12 If the CBS is determined to be 1280 in operation 1210, an index matrix or sequence corresponding to the block size included in Z4={32, 36, 40, ..., 60} in the above equation 20 is determined in operation 1220, and LDPC decoding is performed using the index matrix or sequence in operation 1230.
[0322] exist Fig.13 and Fig.14 A flow chart of another embodiment of LDPC encoding and decoding processing is shown in FIG.
[0323] Fig.13 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0324] First, if Fig.13 The size of the transport block size TBS to be sent is determined as in operation 1310. If the maximum information word length that can be applied at one time in a channel code given in the system is defined as the maximum CBS, when the size of TBS is greater than the maximum CBS, the transport block needs to be segmented into a plurality of information word blocks (or code blocks) to perform encoding. Fig.13 In operation 1320, after determining whether TBS is greater than or equal to the maximum CBS, if TBS is greater than the maximum CBS, the transport block is segmented in operation 1330 to determine a new CBS, and if TBS is less than or equal to the maximum CBS, the segmentation operation is omitted. After determining TBS as the CBS, in operation 1340, an LDPC index matrix or sequence is appropriately determined according to the TBS or CBS value. Next, in operation 1350, LDPC encoding is performed based on the determined index matrix or sequence.
[0325] As a detailed example, it is assumed that the TBS is determined to be 9216 in operation 1310, and the maximum CBS given in the system is 8192. Obviously, since the TBS is determined to be greater than the maximum CBS in operation 1320, two information word blocks (or code blocks) with CBS=4608 are obtained by appropriately applying segmentation in operation 1330. If the information word corresponds to 32 columns in the index matrix, Z=4608 / 32=144, so that the block size Z=144 is included in Z6. Therefore, in operation 1340, an index matrix or sequence corresponding to the block size included in Z6={128, 144, 160, ..., 240, 256} of equation 20 above is determined, and the determined index matrix or sequence can be used to perform LDPC encoding in operation 1350.
[0326] Fig.14 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0327] The LDPC decoding process can be similar to Fig.14 . If it is determined in operation 1410 that the TBS is 9216, it is determined in operation 1420 that the TBS is greater than the maximum CBS, and thus the size of the CBS 4608 to which the segmentation is applied is determined in operation 1430 to be 4608. If it is determined in operation 1420 that the TBS is less than or equal to the maximum CBS, it is determined that the TBS is the same as the CBS. Thus, in operation 1440, an index matrix or sequence of the LDPC code is determined, and in operation 1450, LDPC encoding is performed using the determined index matrix or sequence.
[0328] exist Fig.15 and Fig.16 A flow chart of an embodiment of an exponential matrix-based LDPC encoding and decoding process is shown in FIG.
[0329] Fig.15 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0330] First, if Fig.22A The transport block size TBS to be sent is determined as in operation 1510. In operation 1520, after determining whether TBS is greater than or equal to the maximum CBS in operation 1510, if TBS is greater than the maximum CBS, the transport block is segmented in operation 1530 to determine a new CBS, and if TBS is less than or equal to the maximum CBS, the segmentation operation is omitted. After determining TBS as the CBS, in operation 1540, a block size Z value to be applied to LDPC encoding is determined based on the CBS. In operation 1550, an LDPC index matrix or sequence is appropriately determined based on TBS or CBS or block size Z value. Next, in operation 1560, LDPC encoding is performed based on the determined block size, index matrix or sequence. For reference, in some cases, operation 1550 may include a process of transforming the determined LDPC index matrix or sequence based on the determined block size.
[0331] Fig.16 is another example diagram of a flowchart of an LDPC encoding process according to an embodiment of the present disclosure.
[0332] The LDPC decoding process can be similar to Fig.16 As shown in . If TBS is determined in operation 1610, it is determined in operation 1620 whether TBS is greater than or equal to the maximum CBS, and then if TBS is greater than the maximum CBS, then in operation 1630, the size of the CBS to which the segmentation is applied is determined. If it is determined in operation 1620 that TBS is less than or equal to the maximum CBS, it is determined that TBS is the same as CBS. In operation 1640, a block size Z value to be applied to LDPC decoding is determined, and then in operation 1650, an LDPC index matrix or sequence is appropriately determined for TBS, CBS, or block size Z. Next, in operation 1660, LDPC decoding can be performed using the determined block size and index matrix or sequence.
[0333] For reference, in some cases, operation 1650 may include a process of transforming the determined LDPC index matrix or sequence based on the determined block size.
[0334] This embodiment describes a method based on one of TBS, CBS or block size Z. Figures 11 to 16 The process of determining the index matrix or sequence of the LDPC code is described in operations 1120, 1220, 1340, 1440, 1550, and 1650, but there may be various other methods.
[0335] As another embodiment of the present disclosure, the block size groups are divided into five groups as shown in the following Equation 23.
[0336] [Equation 23]
[0337] Z1={1,2,3,...,15}, Z2={16,18,20,...,30}, Z3={32,36,40,...,60}, Z4={64,72,80,...,120}, Z5={128,144,160,...,240,256}
[0338] The above Equation 23 is expressed by a method similar to the above Equation 10, as shown in the following Equation 24.
[0339] [Equation 24]
[0340] Z i ={Z|Z=X i +k·D i , k = 0, 1, ..., Y i }, i = 1, 2, ..., A
[0341] A=5,
[0342] X 1 =1,X 2 =16,X 3 =32,X 4 =64,X 5 =128,
[0343] Y 1 =15,Y 2 =Y 3 =Y 4 =8,Y 5 =9
[0344] D 1 =1,D 2 =2,D 3 =4,D 4 =8,D 5 =16.
[0345] Referring to the block size groups shown in equations 23 and 24 above, since the maximum value of the increase rate of the adjacent block sizes in the block sizes included in Z4 is 72 / 64=1.125, and the minimum value of the increase rate of the adjacent block sizes in the block sizes included in Z3 is 60 / 56=1.071, it can be seen that the former value is greater than the latter value. Similarly, since the maximum value of the increase rate of the adjacent block sizes in the block sizes included in Z5 is 144 / 128=1.125, and the minimum value of the increase rate of the adjacent block sizes in the block sizes included in Z4 is 120 / 112=1.071, it can be seen that the former value is greater than the latter value.
[0346] As another embodiment of the present disclosure, the block size groups are divided into seven groups, as shown in the following Equation 25.
[0347] [Equation 25]
[0348] Z1={2,3}, Z2={4,5,6,7}, Z3={8,10,12,14}, Z4={16,20,24,28}, Z5={32,40,48,56}, Z6={64,80,96,112}, Z7={128,160,192,224,256}
[0349] Fig.17A is a diagram showing a basic matrix of an LDPC code according to an embodiment of the present disclosure. Fig.17A All elements of the empty blocks in correspond to 0 and are omitted for convenience). Fig.17A Matrix is a diagram showing a basic matrix having a size of 66×98. In addition, a partial matrix consisting of the six rows above and 38 columns from the beginning has no column having a degree of 1. That is, a parity check matrix that can be generated by applying lifting from a partial matrix means that there is no column or column block having a degree of 1.
[0350] FIG. 17B to FIG. 17G yes Fig.17A A magnified view of each of the partitioned exponential matrices shown in . Fig.17A The matrix corresponding to the figures corresponding to the reference numerals shown in the respective parts. FIG. 17B to FIG. 17G To configure a parity check matrix, and Fig.17A A basic matrix in the present disclosure may be shown.
[0351] As another embodiment of the present disclosure, Fig.18A The LDPC code index matrix used for dividing the block size groups by the following Equation 25 and applying the same lifting method is shown in FIG. Fig.18A The exponential matrix of the LDPC code shown in has a size of 66×74, and Fig.18A A partial matrix except for a total of 16 columns from the 9th column to the 24th column in the basic matrix of is provided as a basic matrix. In addition, a partial matrix consisting of the upper six rows and 14 columns from the beginning in the above-mentioned exponential matrix does not have a column with a degree of 1. That is, a parity check matrix that can be generated by applying lifting from a partial matrix means that there is no column or column block with a degree of 1.
[0352] from Fig.17A It can be seen from that, compared with the size of the partial matrix being 6×38 except for the column blocks and row blocks corresponding to the columns having a degree of 1, different code rates and information word lengths are supported for the same Z value.
[0353] Generally, when the initial supported code rate, information word length, etc. before applying a single check code extension of degree 1 are different, the basic matrices should be different from each other. Fig.17A and Fig.18A In the case of Fig.17A A method of determining an initial supported code rate or information word length of a basic matrix of a given base matrix or a portion of a basic matrix using an exponential matrix corresponding to the given base matrix or the base matrix.
[0354] For example, when the initial supported bit rate is in the form of (38-6) / (38-a), using Fig.17A LDPC encoding and decoding are applied by using the exponential matrix of the basic matrix, and when the initial supported code rate is in the form of (14-6) / (14-b), a code with Fig.17A As part of the basic matrix of the basic matrix Fig.18A LDPC encoding and decoding are applied by using an exponential matrix. In this case, the values a and b may be set to the number of column blocks corresponding to the information word puncturing, and they may have different values. However, if (38-6) / (38-a) and (14-6) / (14-b) have different values or the maximum value of (38-6)Z and the maximum value of (14-6)Z have different values.
[0355] Fig.18A The present invention is a diagram showing an embodiment of the present invention. Fig.17A FIG. 1 is a diagram showing an example of an LDPC code exponential matrix as a part of a basic matrix of the basic matrix.
[0356] For reference, FIG. 18B to FIG. 18G yes Fig.18A A magnified view of the exponential matrix for each partition shown in . Fig.18A The matrix corresponding to the figures corresponding to the reference numerals shown in the respective parts. FIG. 18B to FIG. 18G To configure a parity check matrix.
[0357] Generally, when an LDPC sequence or index matrix is well designed, LDPC codes having various lengths can be applied through one LDPC sequence or index matrix and one lifting function without applying lifting functions or LDPC sequences or index matrices differently according to block sizes having different granularities.
[0358] As another embodiment of the present disclosure, the block size groups are divided into two groups as shown in the following Equation 26.
[0359] [Equation 26]
[0360] Z1={2,4,5,8,9,10,11,16,18,20,22,32,36,40,44,64,72,80,88,128,144,160,176,256,288,320,352}
[0361] Z2={3,6,7,12,13,14,15,24,26,28,30,48,52,56,60,96,104,112,120,192,208,224,240,384}
[0362] The granularity of the block sizes included in the block size groups Z1 and Z2 shown in the above equation 26 is not only different, but also their average granularity has different values, which are 13.46 and 16.67. Among the block sizes included in Z1, the maximum value of the increase rate relative to the adjacent block size is 4 / 2=2, and the minimum value thereof is 11 / 10=22 / 20=44 / 40=88 / 80=176 / 160=352 / 320=1.1. Similarly, it can be seen that among the block sizes included in Z2, the maximum value of the increase rate of the adjacent block size is 6 / 3=2, and the minimum value thereof is 15 / 14=30 / 28=60 / 56=120 / 112=240 / 224=1.07143. That is, the maximum value of the block size increase rate of one of the two block size groups in the above equation 26 is always greater than the minimum value of the other groups.
[0363] At this time, the LDPC index matrix or sequence is transformed based on the lifting function, as shown in the following Equation 27, so that the LDPC index matrix or sequence corresponding to each Z value can be determined.
[0364] [Equation 27]
[0365]
[0366] The improvement shown in Equation 27 above can be briefly expressed by the following Equation 28.
[0367] [Equation 28]
[0368]
[0369] This can be expressed by various methods other than the above-mentioned equations 27 and 28, which can also achieve the same effect.
[0370] The process of performing LDPC encoding and decoding using the block size group and the lifting method shown in the above-mentioned Equations 26 to 28 will be briefly described below.
[0371] If the block size Z value is determined in the transmitter, the LDPC index matrix or sequence to be used for encoding is determined based on the block size Z value (or the corresponding TBS or CBS size). In the following operation, LDPC encoding is performed based on the determined block size, index matrix or sequence. For reference, before the LDPC encoding process, a process of transforming the determined LDPC index matrix or sequence based on the determined block size may be included. In addition, in the process of transforming the LDPC index matrix or sequence, different transformation methods can be applied according to the block size group including the block size, as shown in equations 27 or 28 above. When different transformation methods are applied according to the block size group in the LDPC encoding process, a process of determining a block size group including a predetermined block size in the encoding process may be included.
[0372] The LDPC decoding process can be similarly described. Determine the block size Z value to be applied to LDPC decoding, and then determine the LDPC index matrix or sequence to be used for decoding based on the block size Z value (or the corresponding TBS or CBS size). In the following operation, LDPC decoding is performed based on the determined block size, index matrix or sequence. For reference, before the LDPC decoding process, a process of transforming the determined LDPC index matrix or sequence based on the determined block size may be included. In addition, in the process of transforming the LDPC index matrix or sequence, different transformation methods can be applied according to the block size group including the block size, as shown in equations 27 or 28 above. When different transformation methods are applied according to the block size group in the LDPC decoding process, the process of determining the block size group including the predetermined block size in the encoding process may be included.
[0373] As another embodiment of the present disclosure, the block size group is divided into eight groups as shown in the following Equation 29.
[0374] [Equation 29]
[0375] Z1={2,4,8,16,32,64,128,256}
[0376] Z2={3,6,12,24,48,96,192,384}
[0377] Z3={5,10,20,40,80,160,320}
[0378] Z4={7,14,28,56,112,224}
[0379] Z5={9,18,36,72,144,288}
[0380] Z6={11,22,44,88,176,352}
[0381] Z7={13,26,52,104,208}
[0382] Z8={15,30,60,120,240}
[0383] The block size groups in equation 29 above not only have different granularities, but also have the characteristic that all rates of adjacent block sizes have the same integer. In other words, each block size is a divisor or multiple of each other.
[0384] When each of the exponential matrices (or LDPC sequences) corresponding to the pth (p=1, 2, ..., 8) group is And the exponential matrix (or LDPC sequence) corresponding to the Z values contained in the pth group is E p (Z)=(e i,j (Z)) when using f p (x, Z) = x (mod Z) applies the method for transforming the sequence as shown in the above equation 19. That is, for example, when the block size Z is determined to be Z = 28, for the exponential matrix (or LDPC sequence) corresponding to the fourth block size group including Z = 28 For the exponential matrix (or LDPC sequence) E with Z=28 4 (28) = (e i,j (28)) each element e i,j (28) can be obtained by the following equation 30.
[0385] [Equation 30]
[0386]
[0387] The transformation as in the above Equation 30 can be simply expressed by the following Equation 31.
[0388] [Equation 31]
[0389] Z∈Z p ,
[0390] E p (Z) = E p (mod Z)
[0391] FIG. 19A to FIG. 26G , an exponential matrix (LDPC sequence) of an LDPC code designed in consideration of the above-mentioned equations 29 to 31 is shown in FIG.
[0392] For reference, in the above description, it is described that the method of lifting or converting the exponential matrix in equation 19 is applied to the entire exponential matrix corresponding to the parity check matrix, while the exponential matrix can be partially applied. For example, the partial matrix corresponding to the parity check bits of the parity check matrix generally has a special structure for efficient coding. In this case, the coding method or complexity may change due to lifting. Therefore, in order to maintain the same coding method or complexity, the lifting method is not applied to a part of the exponential matrix corresponding to the parity check in the parity check matrix, or a lifting method different from the lifting method applied to the exponential matrix of the partial matrix corresponding to the information word bit can be applied. In other words, the lifting method applied to the sequence corresponding to the information word bit in the exponential matrix and the lifting method applied to the sequence corresponding to the parity check bit can be set differently. In some cases, the lifting is not applied to part or all of the sequence corresponding to the parity check bit, so that a fixed value can be used without changing the sequence.
[0393] exist FIG. 19A to FIG. 26G 29 to 31 in the embodiment of the block size group described in the above equations 29 to 31 are sequentially shown for the exponential matrix or LDPC sequence corresponding to the parity check matrix of the LDPC code designed. (Note that in FIG. 19A to FIG. 26G The empty blocks in the exponential matrix shown in represent portions of a zero matrix corresponding to size Z x Z. In some cases, an empty block may also be represented by a specified value such as -1.) Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The exponential matrices of the LDPC codes shown in have the same basic matrix.
[0394] Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A is a diagram showing an exponential matrix or LDPC sequence having a size of 46x68. In addition, a partial matrix consisting of the five rows above and 27 columns from the beginning has no column having a degree of 1. That is, a parity check matrix that can be generated by applying lifting from a partial matrix means that there is no column or column block having a degree of 1.
[0395] Fig.19A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0396] For reference, FIG. 19B to FIG. 19G yes Fig.19A A magnified view of each of the partitioned exponential matrices shown in . Fig.19A The matrix corresponding to the figures corresponding to the reference numerals shown in the respective parts. FIG. 19B to FIG. 19F to configure an exponential matrix or LDPC sequence. Similarly, FIG. 20B to FIG. 26G is an enlarged view of each of the partitioned exponential matrices.
[0397] FIG. 20A to FIG. 26G is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0398] Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A Another feature of the illustrated exponential matrix is that all columns from the 28th column to the 68th column have a degree of 1. That is, the exponential matrix having a size of 41×68 including the 6th row to the 46th row of the exponential matrix corresponds to a single parity-check code.
[0399] Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A Each exponential matrix shown in corresponds to an LDPC code designed taking into account the block size group defined in Equation 29 above. However, it is obvious that it is not necessary to support all block sizes included in the block size group according to the requirements of the system. For example, if the minimum number of information words (or code blocks) to be supported by the system is 100 or more, Z=2, 3 or 4 may not be used. As a result, Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A Each index matrix shown in can support a group (set) of block sizes defined in Equation 29 or a block size corresponding to a subset of each group.
[0400] in addition, Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The exponential matrix shown in can also be used as is, or only a part of it can be used. For example, by splicing a partial matrix consisting of 27 columns from the head of each exponential matrix and 5 rows above with another exponential matrix having a size of 41x68 corresponding to a single parity check code, a new exponential matrix is used so that LDPC encoding and decoding can be applied.
[0401] Similarly, Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The exponential matrix shown in has the same basic matrix as the partial matrix consisting of 27 columns from the beginning and 5 rows above, but it can also be obtained by combining the exponential matrix with different exponent values (or sequence values) and having a size of 5x27 with the corresponding Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The exponential matrix of a single parity-check code in the exponential matrix of 41x68 size is concatenated to apply another LDPC encoding and decoding.
[0402] Generally, LDPC codes can adjust the code rate by applying parity puncturing according to the code rate. FIG. 19A to FIG. 26G When the LDPC code of the exponential matrix shown in punctures the parity bits corresponding to the columns having a degree of 1, the LDPC decoder can perform decoding without using the corresponding part in the parity check matrix, thereby reducing the decoding complexity. However, when considering the coding performance, there is a method for improving the performance of the LDPC code by adjusting the puncturing order of the parity check bits (or the transmission order of the generated LDPC codewords).
[0403] For example, if the Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The information bits corresponding to the first two columns in the exponential matrix of are punctured, and the parity bits with order 1 are punctured, then when the code rate is 22 / 25, the LDPC codeword can be transmitted. However, if the code corresponding to Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The information bits corresponding to the first two columns in the exponential matrix of are punctured, and the parity bits corresponding to the 28th column of the exponential matrix having a degree of 1 are not punctured. Even when the parity bits corresponding to the 26th column having a degree of 2 are punctured, if puncturing is performed similarly, an LDPC codeword having a code rate of 22 / 25 can be transmitted. However, since the latter is generally better in coding performance, by using Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A The corresponding exponential matrix generates LDPC codewords and then appropriately applies rate matching to further improve performance. Of course, considering rate matching, the order of columns in the exponential matrix can be appropriately rearranged and applied to LDPC coding.
[0404] As a detailed example, when based on Fig.19A , Fig. 20A , Fig.21A , Fig.22A , Fig.23A , Fig.24A , Fig.25A and Fig.26A When the corresponding exponential matrix is applied to LDPC encoding and decoding, the following transmission order can be defined. (For convenience, the following pattern is derived by considering the first column as the 0th column and the last column as the 67th column).
[0405] Mode 1:
[0406] 2,3,4,2...,20,21,27,22,24,26,23,25,28,29,30,...,67,0,1
[0407] Mode 2:
[0408] 2,3,4,2...,20,21,27,22,26,24,23,25,28,29,30,...,67,0,1
[0409] Mode 3:
[0410] 2,3,4,2...,20,21,22,27,24,26,23,25,28,29,30,...,67,0,1
[0411] Mode 4:
[0412] 2,3,4,...,20,21,22,27,26,24,23,25,28,29,30,...,67,0,1
[0413] Modes 1 to 4 mean transmission in the order of codeword bits corresponding to the columns corresponding to the order of the mode. In other words, puncturing is applied to the codeword bits in the reverse order of the mode.
[0414] Describing the case of mode 5 by way of example, when puncturing is applied to a codeword for rate matching, first, puncturing of a predetermined length is applied in sequence starting from codeword bits corresponding to the first column having a size of Z. (In modes 1 to 4, the order of 0 and 1 may be changed).
[0415] This rate matching method can be applied using the above-mentioned pattern, or sequential puncturing can be applied after performing an appropriate interleaving method.
[0416] In addition, the mode or interleaving scheme may be applied differently according to the modulation order to improve performance. That is, in the case of a higher-order modulation scheme, the performance may be improved by applying a mode or interleaving scheme different from that of the QPSK scheme.
[0417] In addition, the mode or interleaving scheme may be applied differently according to the modulation order to improve performance. That is, in the case of a higher-order modulation scheme, the performance may be improved by applying a mode or interleaving scheme different from that of the QPSK scheme.
[0418] In addition, the mode or interleaving scheme can be applied differently according to the code rate (or actual transmission code rate) to improve performance. That is, when the code rate is lower than a specific code rate R_th, the rate matching method corresponding to mode 1 to mode 4 is applied, and when the code rate is greater than R_th, a mode different from the above mode can be used (if the code rate is equal to R_th, the mode can be selected according to a predefined method). For example, when the code rate is greater than a certain degree and therefore a large amount of parity checks are required, the mode matching method can be changed by using the following mode 5 or 6. (Any sequence can be applied after 23 of mode 5 and after 26 of mode 6.)
[0419] Mode 5:
[0420] 2,3,4,...,20,21,27,22,23,......
[0421] Mode 6:
[0422] 2,3,4,...,20,21,27,25,26......
[0423] For reference, transmission in units of Z codeword bits corresponding to one column block means that while codeword bits of one column block are sequentially transmitted, codeword bits corresponding to other column blocks are not transmitted.
[0424] This rate matching method can be applied using the above-mentioned mode, or a method for performing puncturing from a predetermined position in the system can also be applied after performing an appropriate interleaving method. For example, a redundancy version (RV) scheme can be used in an LTE system. An example of the RV technology will be briefly described as follows.
[0425] First, change modes 5 and 6 to the following modes 7 and 8, respectively.
[0426] Mode 7:
[0427] 0,1,2,3,4,...,20,21,27,22,23......
[0428] Mode 8:
[0429] 0,1,2,3,4,...,20,21,27,25,26......
[0430] Next, if the value of RV-0 indicating the transmission start position of the next codeword is set to 2, it can be set to perform puncturing from the codeword bits of the 0th and 1st column blocks according to the code rate. Here, by not only determining various initial transmission sequences according to the RV-0 value but also appropriately setting the RV-i value, it can be applied to application technologies such as LDPC encoding and decoding of HARQ. For example, when additional parity bits are sent after all codeword bits of the 2nd to 67th column blocks, additional codeword bits can also be repeatedly sent starting from the 0th and 1st, and the additional codeword bits can be sent by various methods depending on the RV-i value.
[0431] In addition, the mode or interleaving scheme may be applied differently according to the modulation order to improve performance. That is, in the case of a higher-order modulation scheme, the performance may be improved by applying a mode or interleaving scheme different from that of the QPSK scheme.
[0432] In addition, the mode or interleaving scheme can be applied differently according to the code rate (or initial transmission code rate) to improve performance. That is, when the code rate is lower than a specific code rate R_th, the rate matching method corresponding to mode 1 is applied, and when the code rate is greater than R_th, mode 2 different from mode 1 can be used (if the code rate is equal to R_th, the mode can be selected according to a predefined method).
[0433] FIG. 27A to FIG. 37D Another embodiment of the method and apparatus for LDPC encoding and decoding according to the present disclosure is shown, wherein the exponential matrices or base matrices of the sequences corresponding to a plurality of different LDPC codes are the same. More specifically, Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The basic matrix of the LDPC exponential matrix is Fig.27A Therefore, the following embodiments relate to the matrices for Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A A method and apparatus for performing LDPC encoding and decoding using a basic matrix and an exponential matrix. In the LDPC encoding and decoding process, the exponential matrix or LDPC sequence corresponding thereto can be used as is, or can be appropriately transformed according to the block size to be used for LDPC encoding and decoding. At this time, the above-mentioned transformation can be performed using the lifting method described in equations 19 to 31 above, and in some cases, various methods can be applied. For reference, since the exponential matrix or LDPC sequence proposed in the present disclosure corresponds to the cyclic shift value of the bit corresponding to the block size Z, it can be named differently as a shift matrix or a shift value matrix or a shift sequence or a shift value sequence, etc.
[0434] Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The exponential matrices shown in the figure show the exponential matrices of the LDPC codes designed for the block size groups described in the embodiment based on the above equations 29 to 31, respectively. (Note that Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The empty blocks in the exponential matrix shown in represent portions of a zero matrix corresponding to size Z x Z. In some cases, an empty block may be represented by a specified value such as -1).
[0435] The above equation 29 represents a plurality of block size groups with different granularities. The above equation 29 is merely an example, and all block size Z values included in the block size group of the above equation 29 may be used, block size values included in an appropriate subset as shown in the following equation 32 may be used, and block size groups (sets) of the above equations 29 or 32 to which appropriate values may be added or excluded may be used.
[0436] [Equation 32]
[0437] Z1'={8,16,32,64,128,256}
[0438] Z2'={12,24,48,96,192,384}
[0439] Z3'={10,20,40,80,160,320}
[0440] Z4'={14,18,56,112,224}
[0441] Z5'={9,18,36,72,144,288}
[0442] Z6'={11,22,44,88,176,352}
[0443] Z7'={13,26,52,104,208}
[0444] Z8'={15,30,60,120,240}
[0445] Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The base matrix and exponential matrix shown in are both of size 46 x 68.
[0446] Fig.27A is a diagram illustrating a basic matrix of an LDPC code according to an embodiment of the present disclosure.
[0447] FIG. 27B to FIG. 27J yes Fig.27A A magnified view of the basic matrix for each partition is shown in . Fig.27A The matrix corresponding to the figures corresponding to the reference numerals shown in the respective parts. FIG. 27B to FIG. 27J To configure a basic matrix.
[0448] Fig.28A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0449] FIG. 28B to FIG. 28J yes Fig.28A A magnified view of each partitioned LDPC index matrix shown in FIG. Fig.28A The matrix corresponding to the figures corresponding to the reference numerals shown in the respective parts. FIG. 28B to FIG. 28J to configure an exponential matrix or LDPC sequence. Similarly, Figure 29B-Figure 29D , Figure 30B-Figure 30D , Figure 31B-Figure 31D , Figure 32B-Figure 32D , Figure 33B-Figure 33D , Figure 34B-Figure 34D , Figure 35B-Figure 35D , Figure 36B-Figure 36D and Figure 37B-Figure 37D yes Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A A magnified view of the exponential matrix for each partition in .
[0450] Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A Another feature of the basic matrix and the exponential matrix shown in is that all columns from the 28th column to the 68th column have a degree of 1. That is, the exponential matrix having a size of 41×68 composed of the 6th to 46th rows of the basic matrix and the exponential matrix corresponds to a single parity check code.
[0451] Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A Parts B, C and D only show Fig.28A Parts B, C and D of the . Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A Parts E, F, G, H, I and J in Fig.28E , Fig.28F , Figure 28G , Fig.28H , Fig.28I , Fig.28J Parts E, F, G, H, I and J in are the same. That is, Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A Parts E, F, G, H, I and J are respectively Fig.28E , Fig.28F , Figure 28G , Fig.28H , Fig.28I and Fig.28J The same as shown in . Fig.28E , Fig.28F , Figure 28G , Fig.28H , Fig.28I and Fig.28J as well as Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The new exponential matrix is configured using parts B, C, and D of .
[0452] Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The basic matrix and exponential matrix shown in can be applied to the method and apparatus for LDPC encoding and decoding by rearranging the order of columns in each matrix, rearranging the order of rows, or rearranging the order of columns and rows.
[0453] FIG. 27A to FIG. 37D The basic matrix and exponential matrix shown in can be expressed in various forms having the same meaning algebraically. For example, the basic matrix and exponential matrix can be expressed using sequences as shown in the following equations 33 to 36.
[0454] The following equation 33 represents Fig.27A The position of the element 1 in each row of the base matrix. For example, the second value 2 of the second sequence in Equation 33 above means that there is an element 1 in the second column of the second row in the base matrix. (In the above example, the starting order of the elements in the sequence and matrix is considered to start from 0.)
[0455] [Equation 33] 0 1 2 3 5 6 9 10 11 12 13 15 16 18 19 20 21 22 23 0 2 3 4 5 7 8 9 11 12 14 15 16 17 19 21 22 23 24 0 1 2 4 5 6 7 8 9 10 13 14 15 17 18 19 20 24 25 0 1 3 4 6 7 8 10 11 12 13 14 16 17 18 20 21 22 25 0 1 26 0 1 3 12 16 21 22 27 0 6 10 11 13 17 18 20 28 0 1 4 7 8 14 29 0 1 3 12 16 19 21 22 24 30 0 1 10 11 13 17 18 20 31 1 2 4 7 8 14 32 0 1 12 16 21 22 23 33 0 1 10 11 13 18 34 0 3 7 20 23 35 0 12 15 16 17 21 36 0 1 10 13 18 25 37 1 3 11 20 22 38 0 14 16 17 21 39 1 12 13 18 19 40 0 1 7 8 10 41 0 3 9 11 22 42 1 5 16 20 21 43 0 12 13 17 44 1 2 10 18 45 0 3 4 11 22 46 1 6 7 14 47 0 2 4 15 48 1 6 8 49 0 4 19 21 50 1 14 18 25 51 0 10 13 24 52 1 7 22 25 53 0 12 14 24 54 1 2 11 21 55 0 7 15 17 56 1 6 12 22 57 0 14 15 18 58 1 13 23 59 0 9 10 12 60 1 3 7 19 61 0 8 17 62 1 3 9 18 63 0 4 24 64 1 16 18 25 65 0 7 9 22 66 1 6 10 67
[0502] The following equation 34 represents Fig.28A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 34 and Fig.28A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z1 of the above equation 29 or Z1' of the above equation 32.
[0503] [Equation 34] 250 69 226 159 100 10 59 229 110 191 9 195 23 190 35 239 31 1 0 2 239 117 124 71 222 104 173 220 102 109 132 142 155 255 28 0 0 0 106 111 185 63 117 93 229 177 95 39 142 225 225 245 205 251 117 0 0 121 89 84 20 150 131 243 136 86 246 219 211 240 76 244 144 12 1 0 157 102 0 205 236 194 231 28 123 115 0 183 22 28 67 244 11 157 211 0 220 44 159 31 167 104 0 112 4 7 211 102 164 109 241 90 0 103 182 109 21 142 14 61 216 0 98 149 167 160 49 58 0 77 41 83 182 78 252 22 0 160 42 21 32 234 7 0 177 248 151 185 62 0 206 55 206 127 16 229 0 40 96 65 63 75 179 0 64 49 49 51 154 0 7 164 59 1 144 0 42 233 8 155 147 0 60 73 72 127 224 0 151 186 217 47 160 0 249 121 109 131 171 0 64 142 188 158 0 156 147 170 152 0 112 86 236 116 222 0 23 136 116 182 0 195 243 215 61 0 25 104 194 0 128 165 181 63 0 86 236 84 6 0 216 73 120 9 0 95 177 172 61 0 221 112 199 121 0 2 187 41 211 0 127 167 164 159 0 161 197 207 103 0 37 105 51 120 0 198 220 122 0 169 204 221 239 0 136 251 79 138 0 189 61 19 0 81 185 28 97 0 124 42 247 0 70 134 160 31 0 192 27 199 207 0 156 50 226 0
[0550] Fig.29A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0551] The following equation 35 shows Fig.29A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 35 and Fig.29A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z4 of the above equation 29 or Z4' of the above equation 32.
[0552] [Equation 35] 205 72 103 204 141 157 170 26 166 48 181 10 166 64 177 205 36 1 0 94 40 217 158 41 139 87 119 60 50 172 170 173 160 89 222 0 0 0 182 114 77 181 46 204 180 109 73 158 208 1 110 59 185 157 13 0 0 47 219 199 148 66 212 183 1 59 110 199 142 20 184 83 147 23 1 0 16 206 0 43 183 50 84 113 152 184 0 39 210 214 197 185 183 192 26 0 8 3 80 215 111 146 0 153 172 222 92 46 96 36 25 152 0 204 153 143 30 119 205 24 105 0 39 147 44 145 71 29 0 40 133 40 200 0 63 81 0 131 29 57 44 162 181 0 133 7 101 184 121 0 155 40 193 63 6 4 0 10 103 163 105 186 53 0 35 146 191 171 212 0 185 86 208 126 215 0 104 201 41 124 178 0 206 41 156 97 82 0 151 64 61 158 164 0 223 198 42 182 16 0 119 97 193 42 0 209 24 70 67 0 176 29 169 112 142 0 45 185 84 3 0 52 160 170 133 0 194 33 118 0 142 13 64 143 0 122 147 164 66 0 60 133 55 89 0 122 131 174 167 0 22 129 183 78 0 188 206 206 54 0 129 188 184 46 0 111 150 20 24 0 181 179 27 128 0 57 130 218 0 80 12 104 96 0 185 159 206 93 0 205 118 200 0 27 193 119 150 0 96 192 65 0 138 1 108 58 0 184 119 213 21 0 187 37 94 0
[0599] Fig. 30A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0600] The following equation 36 represents Fig. 30A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 36 and Fig. 30A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z7 of the above equation 29 or Z7' of the above equation 32.
[0601] [Equation 36] 134 50 169 114 189 0 196 45 79 101 109 101 163 54 166 132 173 1 0 27 190 60 33 155 40 25 100 60 50 100 141 114 199 27 37 0 0 0 128 131 174 149 127 99 153 45 185 153 85 93 144 155 24 179 86 0 0 202 48 97 115 176 63 151 107 146 38 34 53 9 19 66 61 96 1 0 160 17 0 205 123 71 56 5 155 106 0 194 7 128 202 14 59 205 162 0 170 207 123 67 166 168 0 200 25 165 188 24 77 99 28 32 0 174 145 76 61 145 29 165 43 0 92 199 150 151 163 93 0 95 112 132 138 152 200 72 0 71 75 107 102 27 78 0 188 100 155 131 198 0 15 100 198 18 109 119 0 7 1 109 184 58 193 0 137 128 30 121 39 0 103 138 40 165 16 0 57 63 17 58 184 0 98 24 79 62 205 0 125 111 118 44 56 0 126 141 96 34 9 0 103 52 170 47 0 49 114 46 126 0 84 110 158 86 87 0 41 50 87 115 0 190 99 157 6 0 129 128 144 0 148 189 34 172 0 70 203 25 16 0 188 7 104 37 0 179 192 136 17 0 99 1 66 8 0 179 57 64 105 0 124 112 80 71 0 33 167 109 160 0 98 31 48 56 0 33 206 120 0 84 125 61 81 0 204 145 83 46 0 77 35 198 0 136 128 71 41 0 97 89 118 0 113 92 200 93 0 31 92 190 23 0 113 38 111 0
[0648] Fig.31A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0649] The following equation 37 shows that Fig.31A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 37 and Fig.31A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z1 of the above equation 29 or Z1' of the above equation 32.
[0650] [Equation 37] 106 43 185 109 230 209 30 185 143 130 154 241 80 121 246 235 124 1 0 77 142 7 1 153 163 44 212 170 141 183 170 86 227 68 56 0 0 0 208 95 240 174 15 142 7 179 217 161 36 241 227 53 72 130 140 0 0 79 244 90 171 244 209 183 221 86 252 34 108 206 250 106 131 87 1 0 66 118 0 163 14 10 130 239 118 152 0 179 150 50 5 158 196 83 234 0 119 240 81 197 105 108 0 19 29 139 51 114 219 226 181 216 0 163 34 157 162 90 211 197 141 0 70 173 129 113 100 65 0 233 159 232 59 165 192 138 0 39 72 237 113 104 210 0 170 161 233 64 119 0 142 28 167 5 234 33 0 64 181 61 195 123 117 0 28 85 102 202 71 0 242 91 28 248 87 0 73 123 237 193 149 0 18 137 185 166 95 0 140 36 236 17 43 0 15 69 136 161 88 0 63 196 78 216 0 69 34 142 133 0 129 53 133 170 50 0 71 139 73 188 0 203 77 189 209 0 127 138 42 0 220 130 11 229 0 63 134 114 84 0 233 148 6 253 0 137 50 37 119 0 230 111 109 72 0 118 2 226 184 0 156 15 81 249 0 43 125 184 70 0 19 129 181 140 0 196 247 240 0 103 196 195 74 0 72 237 116 224 0 107 72 85 0 196 168 189 214 0 121 106 247 0 227 32 8 235 0 212 208 118 143 0 49 105 169 0
[0697] Fig.32A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0698] The following equation 38 represents Fig.32A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 38 and Fig.32A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z2 of the above equation 29 or Z2' of the above equation 32.
[0699] [Equation 38] 121 259 123 181 230 315 199 361 364 329 321 26 265 185 290 271 43 1 0 124 162 190 360 274 357 89 158 375 258 320 351 330 53 48 261 0 0 0 323 360 179 259 6 63 308 4 181 280 252 2 253 163 314 243 110 0 0 170 13 11 364 209 319 274 36 168 33 342 352 212 136 96 150 286 1 0 2 106 0 255 142 130 43 95 255 207 0 227 301 365 145 209 238 156 289 0 216 312 16 226 305 185 0 304 314 325 373 371 147 77 156 246 0 165 382 201 148 4 274 248 18 0 105 351 65 25 151 105 0 333 375 289 347 116 142 172 0 76 122 307 211 52 273 0 245 169 325 314 242 0 183 59 354 255 37 87 0 188 157 27 289 340 70 0 79 314 5 184 279 0 74 104 169 226 20 0 133 197 99 367 309 0 307 241 135 49 67 0 352 46 143 267 247 0 238 322 63 187 46 0 222 1 196 42 0 5 18 77 190 0 266 305 373 99 44 0 226 95 201 122 0 275 151 308 264 0 41 160 343 0 182 110 341 9 0 132 207 305 312 0 301 183 12 292 0 177 329 378 316 0 29 379 223 230 0 376 45 71 151 0 14 119 236 24 0 82 195 24 300 0 124 329 145 54 0 109 366 151 0 63 144 110 342 0 52 182 198 344 0 76 338 298 0 325 334 57 47 0 77 339 225 0 90 8 203 274 0 38 365 302 369 0 88 30 161 0
[0746] Fig.33A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0747] The following equation 39 represents Fig.33A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 39 and Fig.33A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z3 of the above equation 29 or Z3' of the above equation 32.
[0748] [Equation 39] 90 222 46 240 158 264 202 13 295 20 164 158 12 95 73 292 176 1 0 298 164 289 305 150 189 211 266 6 313 236 99 234 189 298 239 0 0 0 145 200 253 238 242 195 148 19 221 143 33 181 280 43 198 181 242 0 0 301 84 31 131 187 133 226 314 264 30 239 158 304 102 134 305 233 1 0 257 27 0 12 316 151 3 5 88 5 0 181 105 28 235 216 97 50 171 0 143 189 203 303 247 301 0 233 302 15 129 70 231 268 62 7 0 51 202 315 144 276 111 152 287 0 286 96 236 264 39 275 0 259 70 103 203 49 31 124 0 21 58 62 262 1 223 0 154 222 133 46 151 0 188 65 298 285 294 94 0 6 121 211 96 123 222 0 168 173 105 30 318 0 108 192 176 15 136 0 65 135 20 314 219 0 117 289 215 114 15 0 64 7 171 258 269 0 208 156 236 89 282 0 175 160 246 88 0 229 195 243 247 0 86 220 78 96 256 0 131 211 270 270 0 248 239 206 255 0 126 185 23 0 120 154 221 225 0 177 162 185 52 0 258 167 91 11 0 25 109 106 52 0 10 135 245 298 0 31 139 29 256 0 289 74 142 24 0 296 274 92 249 0 305 166 301 7 0 137 37 240 0 248 182 80 122 0 42 135 124 22 0 261 180 13 0 155 36 232 194 0 126 317 195 0 313 278 85 205 0 93 2 216 232 0 247 124 68 0
[0795] Fig.34A is a diagram showing an LDPC code index matrix according to an embodiment of the present disclosure.
[0796] The following equation 40 represents Fig.34A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 40 and Fig.34A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z4 of the above equation 29 or Z4' of the above equation 32.
[0797] [Equation 40] 196 155 155 13 98 150 217 28 119 197 178 168 205 120 151 199 205 1 0 150 21 184 153 171 126 184 190 87 65 114 16 139 157 87 14 0 0 0 146 131 122 75 63 50 136 29 20 54 104 39 131 81 150 70 140 0 0 17 87 120 15 135 97 90 136 78 62 56 164 48 29 63 205 101 1 0 14 149 0 110 164 131 176 61 118 191 0 119 201 88 97 109 99 198 52 0 204 47 142 174 60 48 0 216 26 47 102 212 93 194 190 32 0 161 98 200 26 195 162 22 102 0 179 215 121 88 64 77 0 204 97 56 28 37 181 88 0 66 113 89 50 199 127 0 72 215 135 26 126 0 165 74 141 160 50 100 0 186 120 70 87 17 153 0 62 137 90 111 194 0 30 61 35 141 63 0 166 113 65 211 222 0 223 209 54 90 86 0 87 15 109 84 197 0 31 116 3 65 192 0 28 210 24 150 0 176 101 160 180 0 23 219 210 43 120 0 9 131 89 89 0 212 36 170 95 0 163 184 85 0 159 49 0 158 0 155 9 3 92 0 55 72 60 36 0 213 7 8 170 0 198 45 73 187 0 64 140 119 75 0 91 58 122 0 0 44 147 72 79 0 182 104 162 197 0 24 122 150 0 75 32 84 163 0 102 150 147 163 0 43 174 206 0 39 18 39 206 0 117 90 39 0 194 140 46 206 0 72 68 96 197 0 118 157 73 0
[0844] Fig.35A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0845] The following equation 41 represents Fig.35A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 41 and Fig.35A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z5 of the above equation 29 or Z5' of the above equation 32.
[0846] [Equation 41] 107 112 215 11 73 73 193 124 183 161 123 283 200 179 83 286 39 1 0 4 237 176 270 9 162 102 153 231 174 281 110 265 213 233 286 0 0 0 39 193 269 203 287 256 70 87 240 191 202 31 153 66 24 221 14 0 0 53 70 40 138 14 21 264 143 242 3 179 236 113 64 205 224 110 1 0 97 58 0 204 155 103 104 276 271 141 0 245 14 151 140 36 215 17 210 0 168 51 156 266 88 183 0 215 119 59 87 285 113 247 219 188 0 155 150 186 36 164 177 182 148 0 56 145 202 75 171 196 0 94 255 95 190 150 260 153 0 147 1 55 135 136 202 0 146 202 143 185 54 0 34 287 89 264 244 181 0 63 242 31 229 190 115 0 188 49 100 277 272 0 185 165 16 96 150 0 166 49 159 65 35 0 15 112 161 228 214 0 9 82 276 263 236 0 43 140 185 108 260 0 70 282 54 178 0 254 187 193 276 0 36 206 208 188 169 0 254 273 21 195 0 278 149 161 236 0 69 262 127 0 31 74 138 159 0 26 62 167 284 0 247 210 2 254 0 55 122 119 85 0 144 97 119 164 0 218 211 2 192 0 207 135 286 249 0 32 49 165 233 0 40 124 73 83 0 154 260 9 0 185 255 31 247 0 77 285 181 199 0 240 247 99 0 221 163 220 190 0 210 186 20 0 64 212 246 190 0 111 245 283 250 0 197 100 14 0
[0893] Fig.36A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0894] The following equation 42 represents Fig.36A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 42 and Fig.36A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z6 of the above equation 29 or Z6' of the above equation 32.
[0895] [Equation 42] 167 346 148 5 300 188 81 243 53 11 94 309 92 16 31 237 67 1 0 131 138 89 270 320 39 273 109 234 116 259 27 313 92 18 224 0 0 0 289 53 150 161 336 250 97 258 328 241 133 115 300 32 114 130 328 0 0 197 201 202 237 1 221 237 19 26 106 10 277 340 149 329 305 174 1 0 212 2 0 74 288 332 216 128 290 165 0 93 87 326 300 236 328 35 329 0 184 61 248 157 101 140 0 169 341 65 296 140 339 164 124 59 0 247 233 212 319 138 231 177 335 0 170 194 233 316 246 107 0 220 79 276 325 264 298 212 0 89 328 37 114 295 348 0 18 268 110 178 94 0 309 133 203 77 14 204 0 133 125 99 334 314 26 0 119 266 267 152 115 0 80 282 157 197 249 0 81 351 91 98 342 0 267 323 333 317 142 0 54 75 42 342 324 0 244 160 258 216 206 0 100 163 185 345 0 203 163 293 253 0 220 348 159 334 161 0 132 169 99 28 0 104 225 30 241 0 162 291 232 0 261 206 264 310 0 48 20 187 296 0 69 136 146 59 0 28 309 269 273 0 254 344 255 182 0 77 173 293 132 0 217 294 246 107 0 77 148 238 311 0 132 305 206 60 0 245 351 313 0 188 221 212 235 0 235 100 334 256 0 250 33 97 0 221 32 128 320 0 174 140 346 0 237 318 148 109 0 334 14 313 20 0 315 230 319 0
[0942] Fig.37A is a diagram illustrating an LDPC code index matrix according to an embodiment of the present disclosure.
[0943] Equation 43 below represents Fig.37A Each element value in each row of the basic matrix of . However, certain element values (e.g., -1) corresponding to the zero matrix of size Z x Z in the exponential matrix may be excluded at that time. For reference, the following equations 43 and Fig.37A The sequence of means an exponential matrix corresponding to a block size group corresponding to Z8 of the above equation 29 or Z8' of the above equation 32.
[0944] [Equation 43] 135 227 126 134 84 83 53 225 205 128 75 135 217 220 90 105 137 1 0 96 236 136 221 128 92 172 56 11 189 95 85 153 87 163 216 0 0 0 189 4 225 151 236 117 179 92 24 68 6 101 33 96 125 67 230 0 0 128 23 162 220 43 186 96 1 216 22 24 167 200 32 235 172 219 1 0 64 211 0 2 171 47 143 210 180 180 0 199 22 23 100 92 207 52 13 0 77 146 209 32 166 18 0 181 105 141 223 177 145 199 153 38 0 169 12 206 221 17 212 92 205 0 116 151 70 230 115 84 0 45 115 134 1 152 165 107 0 186 215 124 180 98 80 0 220 185 154 178 150 0 124 144 182 95 72 76 0 39 138 220 173 142 49 0 78 152 84 5 205 0 183 112 106 219 129 0 183 215 180 143 14 0 179 108 159 138 196 0 77 187 203 167 130 0 197 122 215 65 216 0 25 47 126 178 0 185 127 117 199 0 32 178 2 156 58 0 27 141 11 181 0 163 131 169 98 0 165 232 9 0 32 43 200 205 0 232 32 118 103 0 170 199 26 105 0 73 149 175 108 0 103 110 151 211 0 199 132 172 65 0 161 237 142 180 0 231 174 145 100 0 11 207 42 100 0 59 204 161 0 121 90 26 140 0 115 188 168 52 0 4 103 30 0 53 189 215 24 0 222 170 71 0 22 127 49 125 0 191 211 187 148 0 177 114 93 0
[0991] Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The exponential matrix shown in and the corresponding LDPC sequences of equations 34 to 43 all have Fig.27A Or the basic matrix shown in the above equation 33. An LDPC index matrix or sequence having the same basic matrix may be appropriately selected and applied to the method and apparatus for LDPC encoding and decoding.
[0992] In addition, it is obvious that you can not use Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A All exponential matrices of and the corresponding LDPC sequences of equations 34 to 43 above. For example, Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A One or more LDPC index matrices or sequences are selected from the index matrices shown in and the corresponding LDPC sequences of the above equations 34 to 43, and can be applied together with other LDPC index matrices or LDPC sequences to the method and apparatus for LDPC encoding and decoding.
[0993] If some rule can be found for a part of the fundamental matrix or the exponential matrix, the fundamental matrix can be represented more simply. For example, if it is assumed that the transceiver knows that Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The rules for partial matrices in the diagonal structure of the fundamental matrix and the exponential matrix omit part of the element positions and element values.
[0994] In addition, in the method of expressing a basic matrix or an exponential matrix, when the positions and values of elements are shown, they may be expressed in each row, but may be expressed sequentially in each column.
[0995] According to this system, it can be used as is Fig.27A , Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The basic matrix and index matrix shown in FIG. 1 may be used, or only a part thereof may be used. For example, LDPC encoding and decoding may be applied by using a new basic matrix or index matrix obtained by concatenating the upper 25 rows of each basic matrix and index matrix and another basic matrix or index matrix of size 21 x 68 corresponding to a single parity check code. For reference, it may be used as follows Fig.27B , Fig.27C , Fig.27E , Fig.27F , Fig.27H and Fig.27I A partial matrix shown and composed of Fig.28A , Fig.29A , Fig. 30A , Fig.31A , Fig.32A , Fig.33A , Fig.34A , Fig.35A , Fig.36A and Fig.37A The partial matrices composed of B, C, E, F, H and I in the figure respectively form partial matrices. However, it is obvious that the present disclosure is not limited thereto.
[0996] While the present disclosure has been shown and described with reference to various embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present disclosure as defined by the appended claims and their equivalents.< / null> < / null>
Claims
1. A method for channel coding performed by a device in a communication system, the method include: identifying a block size Z based on the number of input bits; identifying a parity check matrix based on the block size Z and the base matrix; performing encoding of input bits based on at least a portion of the parity check matrix; as well as transmitting at least a portion of the encoded input bits, wherein 2Z bits of the input bits are not included in the at least one portion of the encoded input bits, wherein the block size Z is included in one of a plurality of block size groups, where the parity check matrix is different for multiple block size groups, and The parity check matrices for multiple block size groups correspond to the same basic matrix.
2. The method according to claim 1, in, At least a portion of a parity check matrix is identified based on values comprising: 250, 69, 226, 159, 100, 10, 59, 229, 110, 191, 9, 195, 23, 190, 35, 239, 31, 1, and 0 corresponding to the row of row index 0, where 250 is for column index 0 of the base matrix, 69 is for column index 1, 226 is for column index 2, 159 is for column index 3, 100 is for column index 5, 10 is for column index 6, 59 is for column index 9, 229 is for column index 10, 110 is for column index 11, 191 is for column index 12, 9 is for column index 13, 195 is for column index 15, 23 is for column index 16, 190 is for column index 18, 35 is for column index 19, 239 is for column index 20, 31 is for column index 21, 1 is for column index 22, and 0 is for column index 23, 2, 239, 117, 124, 71, 222, 104, 173, 220, 102, 109, 132, 142, 155, 255, 28, 0, 0, and 0 corresponding to the row of row index 1, where 2 is for column index 0 of the base matrix, 239 is for column index 2, 117 is for column index 3, 124 is for column index , 71 is for column index 5, 222 is for column index 7, 104 is for column index 8, 173 is for column index 9, 220 is for column index 11, 102 is for column index 12, 109 is for column index 14, 132 is for column index 15, 142 is for column index 16, 155 is for column index 17, 255 is for column index 19, 28 is for column index 21, 0 is for column index 22, 0 is for column index 23, and 0 is for column index 24, 106, 111, 185, 63, 117, 93, 229, 177, 95, 39, 142, 225, 225, 245, 205, 251, 117, 0, and 0 corresponding to the row of row index 2, where 106 is for column index 0, 111 is for column index 1, 185 is for column index 2, 63 is for column index 4, 117 is for column index 5, 93 is for column index 6, 229 is for column index 7, 177 is for column index 8, 95 is for column index 9, 39 is for column index 10, 142 is for column index 13, 225 is for column index 14, 225 is for column index 15, 245 is for column index 17, 205 is for column index 18, 251 is for column index 19, 117 is for column index 20, 0 is for column index 24, and 0 is for column index 25, 121, 89, 84, 20, 150, 131, 243, 136, 86, 246, 219, 211, 240, 76, 244, 144, 12, 1, and 0 corresponding to the row of row index 3, where 121 is for column index 0 of the base matrix, 89 is for column index 1, 84 is for column index 3, 20 is for column index 4, 150 is for column index 6, 131 is for column index 7, 243 is for column index 8, 136 is for column index 10, 86 is for column index 11, 246 is for column index 12, 219 is for column index 13, 211 is for column index 14, 240 is for column index 16, 76 is for column index 17, 244 is for column index 18, 144 is for column index 20, 12 is for column index 21, 1 is for column index 22, and 0 is for column index 25, and 157, 102, and 0 corresponding to the row of row index 4, where 157 is for column index 0, 102 is for column index 1, and 0 is for column index 26 of the base matrix.
3. The method according to claim 1, in, Performing encoding further includes applying a boost based on the block size Z to the parity check matrix, and The plurality of block size groups include a first block size group Z1, including 24, 48, 96, 192 and 384, The plurality of block size groups include a second block size group Z2, including 22, 44, 88, 176 and 352, The plurality of block size groups include a third block size group Z3, including 20, 40, 80, 160 and 320, The plurality of block size groups include a fourth block size group Z4, including 18, 36, 72, 144 and 288, The plurality of block size groups include a fifth block size group Z5, including 16, 32, 64, 128 and 256, The plurality of block size groups include a sixth block size group Z6, including 15, 30, 60, 120 and 240, The plurality of block size groups include a seventh block size group Z7, including 14, 28, 56, 112 and 224, and Among them, the multiple block size groups include an eighth block size group Z8, which includes 26, 52, 104 and 208.
4. The method according to claim 3, in, identifying a block size Z based on the fifth block size group, and Here, the difference between the block sizes included in each of the plurality of block size groups is different.
5. The method according to claim 2, in, The values further include: 205, 236, 194, 231, 28, 123, 115, and 0 corresponding to the row of row index 5, where 205 is for column index 0 of the base matrix, 236 is for column index 1, 194 is for column index 3, 231 is for column index 12, 28 is for column index 16, 123 is for column index 21, 115 is for column index 22, and 0 is for column index 27, 183, 22, 28, 67, 244, 11, 157, 211, and 0 corresponding to the row of row index 6, where 183 is for column index 0 of the base matrix, 22 is for column index 6, 28 is for column index 10, 67 is for column index 11, 244 is for column index 13, 11 is for column index 17, 157 is for column index 18, 211 is for column index 20, and 0 is for column index 28, 220, 44, 159, 31, 167, 104, and 0 corresponding to the row of row index 7, where 220 is for column index 0, 44 is for column index 1, 159 is for column index 4, 31 is for column index 7, 167 is for column index 8, 104 is for column index 14, and 0 is for column index 29 of the base matrix, 112, 4, 7, 211, 102, 164, 109, 241, 90, and 0 corresponding to the row of row index 8, where 112 is for column index 0 of the base matrix, 4 is for column index 1, 7 is for column index 3, 211 is for column index 12, 102 is for column index 16, 164 is for column index 19, 109 is for column index 21, 241 is for column index 22, 90 is for column index 24, and 0 is for column index 30, 103, 182, 109, 21, 142, 14, 61, 216, and 0 corresponding to the row of row index 9, where 103 is for column index 0 of the base matrix, 182 is for column index 1, 109 is for column index 10, 21 is for column index 11, 142 is for column index 13, 14 is for column index 17, 61 is for column index 18, 216 is for column index 20, and 0 is for column index 31, 98, 149, 167, 160, 49, 58, and 0 corresponding to the row of row index 10, where 98 is for column index 1 of the base matrix, 149 is for column index 2, 167 is for column index 4, 160 is for column index 7, 49 is for column index 8, 58 is for column index 14, and 0 is for column index 32, 77, 41, 83, 182, 78, 252, 22, and 0 corresponding to the row of row index 11, where 77 is for column index 0 of the base matrix, 41 is for column index 1, 83 is for column index 12, 182 is for column index 16, 78 is for column index 21, 252 is for column index 22, 22 is for column index 23, and 0 is for column index 33, 160, 42, 21, 32, 234, 7 and 0 corresponding to the row of row index 12, where 160 is for column index 0 of the base matrix, 42 is for column index 1, 21 is for column index 10, 32 is for column index 11, 234 is for column index 13, 7 is for column index 18 and 0 is for column index 34, 177, 248, 151, 185, 62, and 0 corresponding to the row of row index 11, where 177 is for column index 0 of the base matrix, 248 is for column index 3, 151 is for column index 7, 185 is for column index 20, 62 is for column index 23, and 0 is for column index 35, 206, 55, 206, 127, 16, 229, and 0 corresponding to the row of row index 14, where 206 is for column index 0 of the base matrix, 55 is for column index 12, 206 is for column index 15, 127 is for column index 16, 16 is for column index 17, 229 is for column index 21, and 0 is for column index 36, 40, 96, 65, 63, 75, 179 and 0 corresponding to the row of row index 15, where 40 is for column index 0, 96 is for column index 1, 65 is for column index 10, 63 is for column index 13, 75 is for column index 18, 179 is for column index 25, and 0 is for column index 37 of the base matrix, 64, 49, 49, 51, 154, and 0 corresponding to the row of row index 16, where 64 is for column index 1, 49 is for column index 3, 49 is for column index 11, 51 is for column index 20, 154 is for column index 22, and 0 is for column index 38 of the base matrix, 7, 164, 59, 1, 144, and 0 corresponding to the row of row index 17, where 7 is for column index 0 of the base matrix, 164 is for column index 14, 59 is for column index 16, 1 is for column index 17, 144 is for column index 21, and 0 is for column index 39, 42, 233, 8, 155, 147, and 0 corresponding to the row of row index 18, where 42 is for column index 1 of the base matrix, 233 is for column index 12, 8 is for column index 13, 155 is for column index 18, 147 is for column index 19, and 0 is for column index 40, 60, 73, 72, 127, 224, and 0 corresponding to the row of row index 19, where 60 is for column index 0 of the base matrix, 73 is for column index 1, 72 is for column index 7, 127 is for column index 8, 224 is for column index 10, and 0 is for column index 41, 151, 186, 217, 47, 160, and 0 corresponding to the row of row index 20, where 151 is for column index 0 of the base matrix, 186 is for column index 3, 217 is for column index 9, 47 is for column index 11, 160 is for column index 22, and 0 is for column index 42, 249, 121, 109, 131, 171 and 0 corresponding to row index 21, where 249 is for column index 1 of the base matrix, 121 is for column index 5, 109 is for column index 16, 131 is for column index 20, 171 is for column index 21, and 0 is for column index 43, 64, 142, 188, 158, and 0 corresponding to the row of row index 22, where 64 is for column index 0 of the base matrix, 142 is for column index 12, 188 is for column index 13, 158 is for column index 17, and 0 is for column index 44, 156, 147, 170, 152, and 0 corresponding to the row of row index 23, where 156 is for column index 1 of the base matrix, 147 is for column index 2, 170 is for column index 10, 152 is for column index 18, and 0 is for column index 45, 112, 86, 236, 116, 222, and 0 corresponding to the row of row index 24, where 112 is for column index 0 of the base matrix, 86 is for column index 3, 236 is for column index 4, 116 is for column index 11, 222 is for column index 22, and 0 is for column index 46, 23, 136, 116, 182, and 0 corresponding to the row of row index 25, where 23 is for column index 1 of the base matrix, 136 is for column index 6, 116 is for column index 7, 182 is for column index 14, and 0 is for column index 47, 195, 243, 215, 61, and 0 corresponding to the row of row index 26, where 195 is for column index 0 of the base matrix, 243 is for column index 2, 215 is for column index 4, 61 is for column index 15, and 0 is for column index 48, 25, 104, 194, and 0 corresponding to the row of row index 227, where 25 is for column index 1, 104 is for column index 6, 194 is for column index 8, and 0 is for column index 49 of the base matrix, 128, 165, 181, 63, and 0 corresponding to the row of row index 28, where 128 is for column index 0 of the base matrix, 165 is for column index 4, 181 is for column index 19, 63 is for column index 21, and 0 is for column index 50, 86, 236, 84, 6, and 0 corresponding to the row of row index 29, where 86 is for column index 1 of the base matrix, 236 is for column index 14, 84 is for column index 18, 6 is for column index 25, and 0 is for column index 51, 216, 73, 120, 9, and 0 corresponding to the row of row index 30, where 216 is for column index 0, 73 is for column index 10, 120 is for column index 13, 9 is for column index 24, and 0 is for column index 52 of the base matrix, 95, 177, 172, 61, and 0 corresponding to the row of row index 31, where 95 is for column index 1 of the base matrix, 177 is for column index 7, 172 is for column index 22, 61 is for column index 25, and 0 is for column index 53, 221, 112, 199, 121, and 0 corresponding to the row of row index 32, where 221 is for column index 0 of the base matrix, 112 is for column index 12, 199 is for column index 14, 121 is for column index 24, and 0 is for column index 54, 2, 187, 41, 211, and 0 corresponding to the row of row index 33, where 2 is for column index 1 of the base matrix, 187 is for column index 2, 41 is for column index 11, 211 is for column index 21, and 0 is for column index 55, 127, 167, 164, 159, and 0 corresponding to the row of row index 34, where 127 is for column index 0 of the base matrix, 167 is for column index 7, 164 is for column index 15, 159 is for column index 17, and 0 is for column index 56, 161, 197, 207, 103, and 0 corresponding to the row of row index 35, where 161 is for column index 1 of the base matrix, 197 is for column index 6, 207 is for column index 12, 103 is for column index 22, and 0 is for column index 57, 37, 105, 51, 120, and 0 corresponding to the row of row index 36, where 37 is for column index 0, 105 is for column index 14, 51 is for column index 15, 120 is for column index 18, and 0 is for column index 58, and 198, 220, 122 and 0 corresponding to the row of row index 37, where 198 is for column index 1 of the base matrix, 220 is for column index 13, 122 is for column index 23, and 0 is for column index 59.
6. The method according to claim 1, in, Transmitting at least a portion of the encoded input bits further comprises: Performing rate matching of the encoded input bits based on the redundancy version RV index; and transmitting at least a portion of the encoded input bits based on rate matching, Among them, RV index 0 indicates the starting position corresponding to the 2Z+1th bit of the input bit, Wherein, hybrid automatic repeat request HARQ retransmission is performed based on an RV index in a plurality of RV indexes, wherein the plurality of RV indexes indicate starting positions in Z bit units respectively, wherein at least a portion of the encoded input bits are interleaved based on an interleaving pattern in Z bit units, and Therein, the interleaving pattern is identified based on the modulation order.
7. A method for channel decoding performed by a device in a communication system, the method include: Receive a signal; identifying a block size Z based on the number of input bits; identifying a parity check matrix based on the block size Z and the base matrix; as well as performing decoding of input bits based on at least a portion of the parity check matrix, wherein the block size Z is included in one of a plurality of block size groups, where the parity check matrix is different for multiple block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same base matrix, and Therein, the received signal corresponds to bits in which 2Z bits are punctured from the input bits.
8. The method according to claim 7, in, At least a portion of a parity check matrix is identified based on values comprising: 250, 69, 226, 159, 100, 10, 59, 229, 110, 191, 9, 195, 23, 190, 35, 239, 31, 1, and 0 corresponding to the row of row index 0, where 250 is for column index 0 of the base matrix, 69 is for column index 1, 226 is for column index 2, 159 is for column index 3, 100 is for column index 5, 10 is for column index 6, 59 is for column index 9, 229 is for column index 10, 110 is for column index 11, 191 is for column index 12, 9 is for column index 13, 195 is for column index 15, 23 is for column index 16, 190 is for column index 18, 35 is for column index 19, 239 is for column index 20, 31 is for column index 21, 1 is for column index 22, and 0 is for column index 23, 2, 239, 117, 124, 71, 222, 104, 173, 220, 102, 109, 132, 142, 155, 255, 28, 0, 0, and 0 corresponding to the row of row index 1, where 2 is for column index 0 of the base matrix, 239 is for column index 2, 117 is for column index 3, 124 is for column index , 71 is for column index 5, 222 is for column index 7, 104 is for column index 8, 173 is for column index 9, 220 is for column index 11, 102 is for column index 12, 109 is for column index 14, 132 is for column index 15, 142 is for column index 16, 155 is for column index 17, 255 is for column index 19, 28 is for column index 21, 0 is for column index 22, 0 is for column index 23, and 0 is for column index 24, 106, 111, 185, 63, 117, 93, 229, 177, 95, 39, 142, 225, 225, 245, 205, 251, 117, 0, and 0 corresponding to the row of row index 2, where 106 is for column index 0, 111 is for column index 1, 185 is for column index 2, 63 is for column index 4, 117 is for column index 5, 93 is for column index 6, 229 is for column index 7, 177 is for column index 8, 95 is for column index 9, 39 is for column index 10, 142 is for column index 13, 225 is for column index 14, 225 is for column index 15, 245 is for column index 17, 205 is for column index 18, 251 is for column index 19, 117 is for column index 20, 0 is for column index 24, and 0 is for column index 25, 121, 89, 84, 20, 150, 131, 243, 136, 86, 246, 219, 211, 240, 76, 244, 144, 12, 1, and 0 corresponding to the row of row index 3, where 121 is for column index 0 of the base matrix, 89 is for column index 1, 84 is for column index 3, 20 is for column index 4, 150 is for column index 6, 131 is for column index 7, 243 is for column index 8, 136 is for column index 10, 86 is for column index 11, 246 is for column index 12, 219 is for column index 13, 211 is for column index 14, 240 is for column index 16, 76 is for column index 17, 244 is for column index 18, 144 is for column index 20, 12 is for column index 21, 1 is for column index 22, and 0 is for column index 25, and 157, 102, and 0 corresponding to the row of row index 4, where 157 is for column index 0, 102 is for column index 1, and 0 is for column index 26 of the base matrix.
9. The method according to claim 7, in, Performing decoding further includes applying a boost based on the block size Z to the parity check matrix, and The plurality of block size groups include a first block size group Z1, including 24, 48, 96, 192 and 384, The plurality of block size groups include a second block size group Z2, including 22, 44, 88, 176 and 352, The plurality of block size groups include a third block size group Z3, including 20, 40, 80, 160 and 320, The plurality of block size groups include a fourth block size group Z4, including 18, 36, 72, 144 and 288, The plurality of block size groups include a fifth block size group Z5, including 16, 32, 64, 128 and 256, The plurality of block size groups include a sixth block size group Z6, including 15, 30, 60, 120 and 240, The plurality of block size groups include a seventh block size group Z7, including 14, 28, 56, 112 and 224, and Among them, the multiple block size groups include an eighth block size group Z8, which includes 26, 52, 104 and 208.
10. The method according to claim 9, in, identifying a block size Z based on the fifth block size group, and Here, the difference between the block sizes included in each of the plurality of block size groups is different.
11. The method according to claim 8, in, The values further include: 250, 69, 226, 159, 100, 10, 59, 229, 110, 191, 9, 195, 23, 190, 35, 239, 31, 1, and 0 corresponding to the row of row index 0, where 250 is for column index 0 of the base matrix, 69 is for column index 1, 226 is for column index 2, 159 is for column index 3, 100 is for column index 5, 10 is for column index 6, 59 is for column index 9, 229 is for column index 10, 110 is for column index 11, 191 is for column index 12, 9 is for column index 13, 195 is for column index 15, 23 is for column index 16, 190 is for column index 18, 35 is for column index 19, 239 is for column index 20, 31 is for column index 21, 1 is for column index 22, and 0 is for column index 23, 2, 239, 117, 124, 71, 222, 104, 173, 220, 102, 109, 132, 142, 155, 255, 28, 0, 0, and 0 corresponding to the row of row index 1, where 2 is for column index 0 of the base matrix, 239 is for column index 2, 117 is for column index 3, 124 is for column index , 71 is for column index 5, 222 is for column index 7, 104 is for column index 8, 173 is for column index 9, 220 is for column index 11, 102 is for column index 12, 109 is for column index 14, 132 is for column index 15, 142 is for column index 16, 155 is for column index 17, 255 is for column index 19, 28 is for column index 21, 0 is for column index 22, 0 is for column index 23, and 0 is for column index 24, 106, 111, 185, 63, 117, 93, 229, 177, 95, 39, 142, 225, 225, 245, 205, 251, 117, 0, and 0 corresponding to the row of row index 2, where 106 is for column index 0, 111 is for column index 1, 185 is for column index 2, 63 is for column index 4, 117 is for column index 5, 93 is for column index 6, 229 is for column index 7, 177 is for column index 8, 95 is for column index 9, 39 is for column index 10, 142 is for column index 13, 225 is for column index 14, 225 is for column index 15, 245 is for column index 17, 205 is for column index 18, 251 is for column index 19, 117 is for column index 20, 0 is for column index 24, and 0 is for column index 25, 121, 89, 84, 20, 150, 131, 243, 136, 86, 246, 219, 211, 240, 76, 244, 144, 12, 1, and 0 corresponding to the row of row index 3, where 121 is for column index 0 of the base matrix, 89 is for column index 1, 84 is for column index 3, 20 is for column index 4, 150 is for column index 6, 131 is for column index 7, 243 is for column index 8, 136 is for column index 10, 86 is for column index 11, 246 is for column index 12, 219 is for column index 13, 211 is for column index 14, 240 is for column index 16, 76 is for column index 17, 244 is for column index 18, 144 is for column index 20, 12 is for column index 21, 1 is for column index 22, and 0 is for column index 25, and 157, 102, and 0 corresponding to the row of row index 4, where 157 is for column index 0, 102 is for column index 1, and 0 is for column index 26 of the base matrix.
12. The method according to claim 7, in, The received signal corresponds to bits in which the input bits are rate matched based on a redundancy version RV index, Among them, RV index 0 indicates the starting position corresponding to the 2Z+1th bit of the input bit, Wherein, hybrid automatic repeat request HARQ retransmission is performed based on an RV index in a plurality of RV indexes, wherein the plurality of RV indexes indicate starting positions in Z bit units respectively, wherein at least a portion of the encoded input bits are interleaved based on an interleaving pattern in Z bit units, and Therein, the interleaving pattern is identified based on the modulation order.
13. A device for channel coding in a communication system, the device include: Transceiver; as well as At least one processor coupled to the transceiver and configured to: identifying a block size Z based on the number of input bits; identifying a parity check matrix based on the block size Z and the base matrix; performing encoding of input bits based on at least a portion of the parity check matrix; as well as transmitting at least a portion of the encoded input bits, wherein 2Z bits of the input bits are not included in the at least one portion of the encoded input bits, wherein the block size Z is included in one of a plurality of block size groups, where the parity check matrix is different for multiple block size groups, and The parity check matrices for multiple block size groups correspond to the same basic matrix.
14. The device according to claim 13, in, At least a portion of a parity check matrix is identified based on values comprising: 250, 69, 226, 159, 100, 10, 59, 229, 110, 191, 9, 195, 23, 190, 35, 239, 31, 1, and 0 corresponding to the row of row index 0, where 250 is for column index 0 of the base matrix, 69 is for column index 1, 226 is for column index 2, 159 is for column index 3, 100 is for column index 5, 10 is for column index 6, 59 is for column index 9, 229 is for column index 10, 110 is for column index 11, 191 is for column index 12, 9 is for column index 13, 195 is for column index 15, 23 is for column index 16, 190 is for column index 18, 35 is for column index 19, 239 is for column index 20, 31 is for column index 21, 1 is for column index 22, and 0 is for column index 23, 2, 239, 117, 124, 71, 222, 104, 173, 220, 102, 109, 132, 142, 155, 255, 28, 0, 0, and 0 corresponding to the row of row index 1, where 2 is for column index 0 of the base matrix, 239 is for column index 2, 117 is for column index 3, 124 is for column index , 71 is for column index 5, 222 is for column index 7, 104 is for column index 8, 173 is for column index 9, 220 is for column index 11, 102 is for column index 12, 109 is for column index 14, 132 is for column index 15, 142 is for column index 16, 155 is for column index 17, 255 is for column index 19, 28 is for column index 21, 0 is for column index 22, 0 is for column index 23, and 0 is for column index 24, 106, 111, 185, 63, 117, 93, 229, 177, 95, 39, 142, 225, 225, 245, 205, 251, 117, 0, and 0 corresponding to the row of row index 2, where 106 is for column index 0, 111 is for column index 1, 185 is for column index 2, 63 is for column index 4, 117 is for column index 5, 93 is for column index 6, 229 is for column index 7, 177 is for column index 8, 95 is for column index 9, 39 is for column index 10, 142 is for column index 13, 225 is for column index 14, 225 is for column index 15, 245 is for column index 17, 205 is for column index 18, 251 is for column index 19, 117 is for column index 20, 0 is for column index 24, and 0 is for column index 25, 121, 89, 84, 20, 150, 131, 243, 136, 86, 246, 219, 211, 240, 76, 244, 144, 12, 1, and 0 corresponding to the row of row index 3, where 121 is for column index 0 of the base matrix, 89 is for column index 1, 84 is for column index 3, 20 is for column index 4, 150 is for column index 6, 131 is for column index 7, 243 is for column index 8, 136 is for column index 10, 86 is for column index 11, 246 is for column index 12, 219 is for column index 13, 211 is for column index 14, 240 is for column index 16, 76 is for column index 17, 244 is for column index 18, 144 is for column index 20, 12 is for column index 21, 1 is for column index 22, and 0 is for column index 25, and 157, 102, and 0 corresponding to the row of row index 4, where 157 is for column index 0, 102 is for column index 1, and 0 is for column index 26 of the base matrix.
15. The device according to claim 13, in, The at least one processor is further configured to apply a boost based on the block size Z to the parity check matrix, and The plurality of block size groups include a first block size group Z1, including 24, 48, 96, 192 and 384, The plurality of block size groups include a second block size group Z2, including 22, 44, 88, 176 and 352, The plurality of block size groups include a third block size group Z3, including 20, 40, 80, 160 and 320, The plurality of block size groups include a fourth block size group Z4, including 18, 36, 72, 144 and 288, The plurality of block size groups include a fifth block size group Z5, including 16, 32, 64, 128 and 256, The plurality of block size groups include a sixth block size group Z6, including 15, 30, 60, 120 and 240, The plurality of block size groups include a seventh block size group Z7, including 14, 28, 56, 112 and 224, and Among them, the multiple block size groups include an eighth block size group Z8, which includes 26, 52, 104 and 208.
16. The device according to claim 15, in, identifying a block size Z based on the fifth block size group, and Here, the difference between the block sizes included in each of the plurality of block size groups is different.
17. The device according to claim 14, in, The values further include: 205, 236, 194, 231, 28, 123, 115, and 0 corresponding to the row of row index 5, where 205 is for column index 0 of the base matrix, 236 is for column index 1, 194 is for column index 3, 231 is for column index 12, 28 is for column index 16, 123 is for column index 21, 115 is for column index 22, and 0 is for column index 27, 183, 22, 28, 67, 244, 11, 157, 211, and 0 corresponding to the row of row index 6, where 183 is for column index 0 of the base matrix, 22 is for column index 6, 28 is for column index 10, 67 is for column index 11, 244 is for column index 13, 11 is for column index 17, 157 is for column index 18, 211 is for column index 20, and 0 is for column index 28, 220, 44, 159, 31, 167, 104, and 0 corresponding to the row of row index 7, where 220 is for column index 0, 44 is for column index 1, 159 is for column index 4, 31 is for column index 7, 167 is for column index 8, 104 is for column index 14, and 0 is for column index 29 of the base matrix, 112, 4, 7, 211, 102, 164, 109, 241, 90, and 0 corresponding to the row of row index 8, where 112 is for column index 0 of the base matrix, 4 is for column index 1, 7 is for column index 3, 211 is for column index 12, 102 is for column index 16, 164 is for column index 19, 109 is for column index 21, 241 is for column index 22, 90 is for column index 24, and 0 is for column index 30, 103, 182, 109, 21, 142, 14, 61, 216, and 0 corresponding to the row of row index 9, where 103 is for column index 0 of the base matrix, 182 is for column index 1, 109 is for column index 10, 21 is for column index 11, 142 is for column index 13, 14 is for column index 17, 61 is for column index 18, 216 is for column index 20, and 0 is for column index 31, 98, 149, 167, 160, 49, 58, and 0 corresponding to the row of row index 10, where 98 is for column index 1 of the base matrix, 149 is for column index 2, 167 is for column index 4, 160 is for column index 7, 49 is for column index 8, 58 is for column index 14, and 0 is for column index 32, 77, 41, 83, 182, 78, 252, 22, and 0 corresponding to the row of row index 11, where 77 is for column index 0 of the base matrix, 41 is for column index 1, 83 is for column index 12, 182 is for column index 16, 78 is for column index 21, 252 is for column index 22, 22 is for column index 23, and 0 is for column index 33, 160, 42, 21, 32, 234, 7 and 0 corresponding to the row of row index 12, where 160 is for column index 0 of the base matrix, 42 is for column index 1, 21 is for column index 10, 32 is for column index 11, 234 is for column index 13, 7 is for column index 18 and 0 is for column index 34, 177, 248, 151, 185, 62, and 0 corresponding to the row of row index 11, where 177 is for column index 0 of the base matrix, 248 is for column index 3, 151 is for column index 7, 185 is for column index 20, 62 is for column index 23, and 0 is for column index 35, 206, 55, 206, 127, 16, 229, and 0 corresponding to the row of row index 14, where 206 is for column index 0 of the base matrix, 55 is for column index 12, 206 is for column index 15, 127 is for column index 16, 16 is for column index 17, 229 is for column index 21, and 0 is for column index 36, 40, 96, 65, 63, 75, 179 and 0 corresponding to the row of row index 15, where 40 is for column index 0, 96 is for column index 1, 65 is for column index 10, 63 is for column index 13, 75 is for column index 18, 179 is for column index 25, and 0 is for column index 37 of the base matrix, 64, 49, 49, 51, 154, and 0 corresponding to the row of row index 16, where 64 is for column index 1, 49 is for column index 3, 49 is for column index 11, 51 is for column index 20, 154 is for column index 22, and 0 is for column index 38 of the base matrix, 7, 164, 59, 1, 144, and 0 corresponding to the row of row index 17, where 7 is for column index 0 of the base matrix, 164 is for column index 14, 59 is for column index 16, 1 is for column index 17, 144 is for column index 21, and 0 is for column index 39, 42, 233, 8, 155, 147, and 0 corresponding to the row of row index 18, where 42 is for column index 1 of the base matrix, 233 is for column index 12, 8 is for column index 13, 155 is for column index 18, 147 is for column index 19, and 0 is for column index 40, 60, 73, 72, 127, 224, and 0 corresponding to the row of row index 19, where 60 is for column index 0 of the base matrix, 73 is for column index 1, 72 is for column index 7, 127 is for column index 8, 224 is for column index 10, and 0 is for column index 41, 151, 186, 217, 47, 160, and 0 corresponding to the row of row index 20, where 151 is for column index 0 of the base matrix, 186 is for column index 3, 217 is for column index 9, 47 is for column index 11, 160 is for column index 22, and 0 is for column index 42, 249, 121, 109, 131, 171 and 0 corresponding to row index 21, where 249 is for column index 1 of the base matrix, 121 is for column index 5, 109 is for column index 16, 131 is for column index 20, 171 is for column index 21, and 0 is for column index 43, 64, 142, 188, 158, and 0 corresponding to the row of row index 22, where 64 is for column index 0 of the base matrix, 142 is for column index 12, 188 is for column index 13, 158 is for column index 17, and 0 is for column index 44, 156, 147, 170, 152, and 0 corresponding to the row of row index 23, where 156 is for column index 1 of the base matrix, 147 is for column index 2, 170 is for column index 10, 152 is for column index 18, and 0 is for column index 45, 112, 86, 236, 116, 222, and 0 corresponding to the row of row index 24, where 112 is for column index 0 of the base matrix, 86 is for column index 3, 236 is for column index 4, 116 is for column index 11, 222 is for column index 22, and 0 is for column index 46, 23, 136, 116, 182, and 0 corresponding to the row of row index 25, where 23 is for column index 1 of the base matrix, 136 is for column index 6, 116 is for column index 7, 182 is for column index 14, and 0 is for column index 47, 195, 243, 215, 61, and 0 corresponding to the row of row index 26, where 195 is for column index 0 of the base matrix, 243 is for column index 2, 215 is for column index 4, 61 is for column index 15, and 0 is for column index 48, 25, 104, 194, and 0 corresponding to the row of row index 227, where 25 is for column index 1, 104 is for column index 6, 194 is for column index 8, and 0 is for column index 49 of the base matrix, 128, 165, 181, 63, and 0 corresponding to the row of row index 28, where 128 is for column index 0 of the base matrix, 165 is for column index 4, 181 is for column index 19, 63 is for column index 21, and 0 is for column index 50, 86, 236, 84, 6, and 0 corresponding to the row of row index 29, where 86 is for column index 1 of the base matrix, 236 is for column index 14, 84 is for column index 18, 6 is for column index 25, and 0 is for column index 51, 216, 73, 120, 9, and 0 corresponding to the row of row index 30, where 216 is for column index 0, 73 is for column index 10, 120 is for column index 13, 9 is for column index 24, and 0 is for column index 52 of the base matrix, 95, 177, 172, 61, and 0 corresponding to the row of row index 31, where 95 is for column index 1 of the base matrix, 177 is for column index 7, 172 is for column index 22, 61 is for column index 25, and 0 is for column index 53, 221, 112, 199, 121, and 0 corresponding to the row of row index 32, where 221 is for column index 0 of the base matrix, 112 is for column index 12, 199 is for column index 14, 121 is for column index 24, and 0 is for column index 54, 2, 187, 41, 211, and 0 corresponding to the row of row index 33, where 2 is for column index 1 of the base matrix, 187 is for column index 2, 41 is for column index 11, 211 is for column index 21, and 0 is for column index 55, 127, 167, 164, 159, and 0 corresponding to the row of row index 34, where 127 is for column index 0 of the base matrix, 167 is for column index 7, 164 is for column index 15, 159 is for column index 17, and 0 is for column index 56, 161, 197, 207, 103, and 0 corresponding to the row of row index 35, where 161 is for column index 1 of the base matrix, 197 is for column index 6, 207 is for column index 12, 103 is for column index 22, and 0 is for column index 57, 37, 105, 51, 120, and 0 corresponding to the row of row index 36, where 37 is for column index 0, 105 is for column index 14, 51 is for column index 15, 120 is for column index 18, and 0 is for column index 58, and 198, 220, 122 and 0 corresponding to the row of row index 37, where 198 is for column index 1 of the base matrix, 220 is for column index 13, 122 is for column index 23, and 0 is for column index 59.
18. The device according to claim 13, in, The at least one processor is further configured to: Performing rate matching of the encoded input bits based on the redundancy version RV index; and transmitting at least a portion of the encoded input bits based on rate matching, Among them, RV index 0 indicates the starting position corresponding to the 2Z+1th bit of the input bit, Wherein, hybrid automatic repeat request HARQ retransmission is performed based on an RV index in a plurality of RV indexes, wherein the plurality of RV indexes indicate starting positions in Z bit units respectively, wherein at least a portion of the encoded input bits are interleaved based on an interleaving pattern in Z bit units, and Therein, the interleaving pattern is identified based on the modulation order.
19. A device for channel decoding in a communication system, the device include: Transceiver; as well as At least one processor coupled to the transceiver and configured to: Receive a signal; identifying a block size Z based on the number of input bits; identifying a parity check matrix based on the block size Z and the base matrix; as well as performing decoding of input bits based on at least a portion of the parity check matrix, wherein the block size Z is included in one of a plurality of block size groups, where the parity check matrix is different for multiple block size groups, wherein the parity check matrices for the plurality of block size groups correspond to the same base matrix, and Therein, the received signal corresponds to bits in which 2Z bits are punctured from the input bits.
20. The device according to claim 19, in, At least a portion of a parity check matrix is identified based on values comprising: 250, 69, 226, 159, 100, 10, 59, 229, 110, 191, 9, 195, 23, 190, 35, 239, 31, 1, and 0 corresponding to the row of row index 0, where 250 is for column index 0 of the base matrix, 69 is for column index 1, 226 is for column index 2, 159 is for column index 3, 100 is for column index 5, 10 is for column index 6, 59 is for column index 9, 229 is for column index 10, 110 is for column index 11, 191 is for column index 12, 9 is for column index 13, 195 is for column index 15, 23 is for column index 16, 190 is for column index 18, 35 is for column index 19, 239 is for column index 20, 31 is for column index 21, 1 is for column index 22, and 0 is for column index 23, 2, 239, 117, 124, 71, 222, 104, 173, 220, 102, 109, 132, 142, 155, 255, 28, 0, 0, and 0 corresponding to the row of row index 1, where 2 is for column index 0 of the base matrix, 239 is for column index 2, 117 is for column index 3, 124 is for column index , 71 is for column index 5, 222 is for column index 7, 104 is for column index 8, 173 is for column index 9, 220 is for column index 11, 102 is for column index 12, 109 is for column index 14, 132 is for column index 15, 142 is for column index 16, 155 is for column index 17, 255 is for column index 19, 28 is for column index 21, 0 is for column index 22, 0 is for column index 23, and 0 is for column index 24, 106, 111, 185, 63, 117, 93, 229, 177, 95, 39, 142, 225, 225, 245, 205, 251, 117, 0, and 0 corresponding to the row of row index 2, where 106 is for column index 0, 111 is for column index 1, 185 is for column index 2, 63 is for column index 4, 117 is for column index 5, 93 is for column index 6, 229 is for column index 7, 177 is for column index 8, 95 is for column index 9, 39 is for column index 10, 142 is for column index 13, 225 is for column index 14, 225 is for column index 15, 245 is for column index 17, 205 is for column index 18, 251 is for column index 19, 117 is for column index 20, 0 is for column index 24, and 0 is for column index 25, 121, 89, 84, 20, 150, 131, 243, 136, 86, 246, 219, 211, 240, 76, 244, 144, 12, 1, and 0 corresponding to the row of row index 3, where 121 is for column index 0 of the base matrix, 89 is for column index 1, 84 is for column index 3, 20 is for column index 4, 150 is for column index 6, 131 is for column index 7, 243 is for column index 8, 136 is for column index 10, 86 is for column index 11, 246 is for column index 12, 219 is for column index 13, 211 is for column index 14, 240 is for column index 16, 76 is for column index 17, 244 is for column index 18, 144 is for column index 20, 12 is for column index 21, 1 is for column index 22, and 0 is for column index 25, and 157, 102, and 0 corresponding to the row of row index 4, where 157 is for column index 0, 102 is for column index 1, and 0 is for column index 26 of the base matrix.
21. The device according to claim 19, in, The at least one processor is further configured to apply a boost based on the block size Z to the parity check matrix, and The plurality of block size groups include a first block size group Z1, including 24, 48, 96, 192 and 384, The plurality of block size groups include a second block size group Z2, including 22, 44, 88, 176 and 352, The plurality of block size groups include a third block size group Z3, including 20, 40, 80, 160 and 320, The plurality of block size groups include a fourth block size group Z4, including 18, 36, 72, 144 and 288, The plurality of block size groups include a fifth block size group Z5, including 16, 32, 64, 128 and 256, The plurality of block size groups include a sixth block size group Z6, including 15, 30, 60, 120 and 240, The plurality of block size groups include a seventh block size group Z7, including 14, 28, 56, 112 and 224, and Among them, the multiple block size groups include an eighth block size group Z8, which includes 26, 52, 104 and 208.
22. The device according to claim 21, in, identifying a block size Z based on the fifth block size group, and Here, the difference between the block sizes included in each of the plurality of block size groups is different.
23. The device according to claim 20, in, The values further include: 205, 236, 194, 231, 28, 123, 115, and 0 corresponding to the row of row index 5, where 205 is for column index 0 of the base matrix, 236 is for column index 1, 194 is for column index 3, 231 is for column index 12, 28 is for column index 16, 123 is for column index 21, 115 is for column index 22, and 0 is for column index 27, 183, 22, 28, 67, 244, 11, 157, 211, and 0 corresponding to the row of row index 6, where 183 is for column index 0 of the base matrix, 22 is for column index 6, 28 is for column index 10, 67 is for column index 11, 244 is for column index 13, 11 is for column index 17, 157 is for column index 18, 211 is for column index 20, and 0 is for column index 28, 220, 44, 159, 31, 167, 104, and 0 corresponding to the row of row index 7, where 220 is for column index 0, 44 is for column index 1, 159 is for column index 4, 31 is for column index 7, 167 is for column index 8, 104 is for column index 14, and 0 is for column index 29 of the base matrix, 112, 4, 7, 211, 102, 164, 109, 241, 90, and 0 corresponding to the row of row index 8, where 112 is for column index 0 of the base matrix, 4 is for column index 1, 7 is for column index 3, 211 is for column index 12, 102 is for column index 16, 164 is for column index 19, 109 is for column index 21, 241 is for column index 22, 90 is for column index 24, and 0 is for column index 30, 103, 182, 109, 21, 142, 14, 61, 216, and 0 corresponding to the row of row index 9, where 103 is for column index 0 of the base matrix, 182 is for column index 1, 109 is for column index 10, 21 is for column index 11, 142 is for column index 13, 14 is for column index 17, 61 is for column index 18, 216 is for column index 20, and 0 is for column index 31, 98, 149, 167, 160, 49, 58, and 0 corresponding to the row of row index 10, where 98 is for column index 1 of the base matrix, 149 is for column index 2, 167 is for column index 4, 160 is for column index 7, 49 is for column index 8, 58 is for column index 14, and 0 is for column index 32, 77, 41, 83, 182, 78, 252, 22, and 0 corresponding to the row of row index 11, where 77 is for column index 0 of the base matrix, 41 is for column index 1, 83 is for column index 12, 182 is for column index 16, 78 is for column index 21, 252 is for column index 22, 22 is for column index 23, and 0 is for column index 33, 160, 42, 21, 32, 234, 7 and 0 corresponding to the row of row index 12, where 160 is for column index 0 of the base matrix, 42 is for column index 1, 21 is for column index 10, 32 is for column index 11, 234 is for column index 13, 7 is for column index 18 and 0 is for column index 34, 177, 248, 151, 185, 62, and 0 corresponding to the row of row index 11, where 177 is for column index 0 of the base matrix, 248 is for column index 3, 151 is for column index 7, 185 is for column index 20, 62 is for column index 23, and 0 is for column index 35, 206, 55, 206, 127, 16, 229, and 0 corresponding to the row of row index 14, where 206 is for column index 0 of the base matrix, 55 is for column index 12, 206 is for column index 15, 127 is for column index 16, 16 is for column index 17, 229 is for column index 21, and 0 is for column index 36, 40, 96, 65, 63, 75, 179 and 0 corresponding to the row of row index 15, where 40 is for column index 0, 96 is for column index 1, 65 is for column index 10, 63 is for column index 13, 75 is for column index 18, 179 is for column index 25, and 0 is for column index 37 of the base matrix, 64, 49, 49, 51, 154, and 0 corresponding to the row of row index 16, where 64 is for column index 1, 49 is for column index 3, 49 is for column index 11, 51 is for column index 20, 154 is for column index 22, and 0 is for column index 38 of the base matrix, 7, 164, 59, 1, 144, and 0 corresponding to the row of row index 17, where 7 is for column index 0 of the base matrix, 164 is for column index 14, 59 is for column index 16, 1 is for column index 17, 144 is for column index 21, and 0 is for column index 39, 42, 233, 8, 155, 147, and 0 corresponding to the row of row index 18, where 42 is for column index 1 of the base matrix, 233 is for column index 12, 8 is for column index 13, 155 is for column index 18, 147 is for column index 19, and 0 is for column index 40, 60, 73, 72, 127, 224, and 0 corresponding to the row of row index 19, where 60 is for column index 0 of the base matrix, 73 is for column index 1, 72 is for column index 7, 127 is for column index 8, 224 is for column index 10, and 0 is for column index 41, 151, 186, 217, 47, 160, and 0 corresponding to the row of row index 20, where 151 is for column index 0 of the base matrix, 186 is for column index 3, 217 is for column index 9, 47 is for column index 11, 160 is for column index 22, and 0 is for column index 42, 249, 121, 109, 131, 171 and 0 corresponding to row index 21, where 249 is for column index 1 of the base matrix, 121 is for column index 5, 109 is for column index 16, 131 is for column index 20, 171 is for column index 21, and 0 is for column index 43, 64, 142, 188, 158, and 0 corresponding to the row of row index 22, where 64 is for column index 0 of the base matrix, 142 is for column index 12, 188 is for column index 13, 158 is for column index 17, and 0 is for column index 44, 156, 147, 170, 152, and 0 corresponding to the row of row index 23, where 156 is for column index 1 of the base matrix, 147 is for column index 2, 170 is for column index 10, 152 is for column index 18, and 0 is for column index 45, 112, 86, 236, 116, 222, and 0 corresponding to the row of row index 24, where 112 is for column index 0 of the base matrix, 86 is for column index 3, 236 is for column index 4, 116 is for column index 11, 222 is for column index 22, and 0 is for column index 46, 23, 136, 116, 182, and 0 corresponding to the row of row index 25, where 23 is for column index 1 of the base matrix, 136 is for column index 6, 116 is for column index 7, 182 is for column index 14, and 0 is for column index 47, 195, 243, 215, 61, and 0 corresponding to the row of row index 26, where 195 is for column index 0 of the base matrix, 243 is for column index 2, 215 is for column index 4, 61 is for column index 15, and 0 is for column index 48, 25, 104, 194, and 0 corresponding to the row of row index 227, where 25 is for column index 1, 104 is for column index 6, 194 is for column index 8, and 0 is for column index 49 of the base matrix, 128, 165, 181, 63, and 0 corresponding to the row of row index 28, where 128 is for column index 0 of the base matrix, 165 is for column index 4, 181 is for column index 19, 63 is for column index 21, and 0 is for column index 50, 86, 236, 84, 6, and 0 corresponding to the row of row index 29, where 86 is for column index 1 of the base matrix, 236 is for column index 14, 84 is for column index 18, 6 is for column index 25, and 0 is for column index 51, 216, 73, 120, 9, and 0 corresponding to the row of row index 30, where 216 is for column index 0, 73 is for column index 10, 120 is for column index 13, 9 is for column index 24, and 0 is for column index 52 of the base matrix, 95, 177, 172, 61, and 0 corresponding to the row of row index 31, where 95 is for column index 1 of the base matrix, 177 is for column index 7, 172 is for column index 22, 61 is for column index 25, and 0 is for column index 53, 221, 112, 199, 121, and 0 corresponding to the row of row index 32, where 221 is for column index 0 of the base matrix, 112 is for column index 12, 199 is for column index 14, 121 is for column index 24, and 0 is for column index 54, 2, 187, 41, 211, and 0 corresponding to the row of row index 33, where 2 is for column index 1 of the base matrix, 187 is for column index 2, 41 is for column index 11, 211 is for column index 21, and 0 is for column index 55, 127, 167, 164, 159, and 0 corresponding to the row of row index 34, where 127 is for column index 0 of the base matrix, 167 is for column index 7, 164 is for column index 15, 159 is for column index 17, and 0 is for column index 56, 161, 197, 207, 103, and 0 corresponding to the row of row index 35, where 161 is for column index 1 of the base matrix, 197 is for column index 6, 207 is for column index 12, 103 is for column index 22, and 0 is for column index 57, 37, 105, 51, 120, and 0 corresponding to the row of row index 36, where 37 is for column index 0, 105 is for column index 14, 51 is for column index 15, 120 is for column index 18, and 0 is for column index 58, and 198, 220, 122 and 0 corresponding to the row of row index 37, where 198 is for column index 1 of the base matrix, 220 is for column index 13, 122 is for column index 23, and 0 is for column index 59.
24. The device according to claim 19, in, The received signal corresponds to bits in which the input bits are rate matched based on a redundancy version RV index, Among them, RV index 0 indicates the starting position corresponding to the 2Z+1th bit of the input bit, Wherein, hybrid automatic repeat request HARQ retransmission is performed based on an RV index in a plurality of RV indexes, wherein the plurality of RV indexes indicate starting positions in Z bit units respectively, wherein at least a portion of the encoded input bits are interleaved based on an interleaving pattern in Z bit units, and Therein, the interleaving pattern is identified based on the modulation order.
