WO2018059588A1 - 准循环ldpc编译码方法、装置及ldpc编译码器 - Google Patents

准循环ldpc编译码方法、装置及ldpc编译码器 Download PDF

Info

Publication number
WO2018059588A1
WO2018059588A1 PCT/CN2017/104913 CN2017104913W WO2018059588A1 WO 2018059588 A1 WO2018059588 A1 WO 2018059588A1 CN 2017104913 W CN2017104913 W CN 2017104913W WO 2018059588 A1 WO2018059588 A1 WO 2018059588A1
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
base
basic
base matrix
subset
Prior art date
Application number
PCT/CN2017/104913
Other languages
English (en)
French (fr)
Inventor
李立广
徐俊
许进
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to US16/338,333 priority Critical patent/US11133826B2/en
Priority to EP17855038.0A priority patent/EP3522379A4/en
Publication of WO2018059588A1 publication Critical patent/WO2018059588A1/zh
Priority to US17/486,652 priority patent/US11637568B2/en
Priority to US18/138,702 priority patent/US20230344450A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H03M13/1148—Structural properties of the code parity-check or generator matrix
    • H03M13/116—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices
    • H03M13/1168—Quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed of permutation or circulant sub-matrices wherein the sub-matrices have column and row weights greater than one, e.g. multi-diagonal sub-matrices
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/033—Theoretical methods to calculate these checking codes
    • H03M13/036—Heuristic code construction methods, i.e. code construction or code search based on using trial-and-error
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/618—Shortening and extension of codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • H03M13/6381—Rate compatible punctured turbo [RCPT] codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6516—Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
    • H04L1/0003—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate by switching between different modulation schemes
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present disclosure relates to the field of communications, and in particular, to a quasi-cyclic LDPC codec method, apparatus, and LDPC codec.
  • a digital communication system generally includes three parts: a transmitting end, a channel, and a receiving end.
  • the transmitting end may perform channel coding on the information sequence to obtain an encoded codeword, interleave the encoded codeword, and map the interleaved bits into modulation symbols, and then process and transmit the modulation symbols according to the communication channel information.
  • the specific channel response will be distorted, and the data transmission will be further deteriorated due to noise and interference.
  • the receiving end receives the modulation symbol data after passing through the channel, and the modulation symbol data at this time is already distorted, and specific processing is required to restore the original information sequence.
  • the receiving end can perform corresponding processing on the received data to reliably restore the original information sequence.
  • the encoding method must be visible at both ends of the transceiver.
  • the encoding processing method is based on Forward Error Correction (FEC) encoding, wherein forward error correction encoding adds some redundant information to the information sequence.
  • FEC Forward Error Correction
  • the transport block to be transmitted is subjected to code block partitioning to obtain a plurality of small transport blocks, and then the FEC encoding is performed on the plurality of small transport blocks, and the length of the transport block to be transmitted is TBS (Transport Block Size).
  • the FEC code rate is generally defined as the ratio of the number of bits entering the encoder to the actual transmitted bits.
  • a very flexible transport block size can support various packet size requirements of the LTE system, and a Modulation and Coding Scheme (MCS) index is used to indicate different modulation orders and code rates R and Determining a TBS index, and determining a different transport block size according to a Resource Block number NRB and a Transport Block Size (TBS) index, the resource block size being continuous
  • MCS Modulation and Coding Scheme
  • the channel type may include a data channel and a control channel.
  • the data channel generally carries User Equipment data, control channel bearer control information, and control information such as MCS index number and channel information.
  • the bandwidth size generally refers to the bandwidth allocated by the system to the data transmission.
  • the LTE system is divided into 20M, 10M, 5M and other bandwidths.
  • the data transmission direction includes uplink data and downlink data.
  • the uplink data generally refers to a user transmitting data to a base station, and the downlink data refers to a base station transmitting data to a user.
  • FEC codes include: convolutional codes, Turbo codes, and Low Density Parity Check (LDPC) codes.
  • the information sequence of the bit number k is FEC-encoded to obtain an n-bit FEC encoded codeword (redundant bits are n-k), and the FEC encoding code rate is k/n.
  • LDPC code is a linear block code that can be defined by a very sparse parity check matrix or bipartite graph. It is the sparseness of its check matrix that can realize low complexity codec, which makes LDPC practical. .
  • the LDPC code is the most excellent channel coding under the Additive White Gaussian Noise (AWGN) channel, and the performance is very close to the Shannon limit.
  • AWGN Additive White Gaussian Noise
  • LDPC codes are widely used.
  • each row is a parity code, and if the value of an element of an index position is equal to 1 in each row, the bit participates in the parity code, and if it is equal to 0, the The location bit does not participate in the parity code.
  • the parity check matrix H of the structured LDPC code is a matrix of M ⁇ Z rows and N ⁇ Z columns, which is composed of M ⁇ N sub-matrices, each of which is a difference of a basic permutation matrix of size Z ⁇ Z.
  • a power sub-matrix can also be considered as a sub-matrix obtained by cyclically shifting a number of values of a Z ⁇ Z unit array.
  • a structured LDPC code can be determined as long as the cyclic shift value and the sub-matrix size are known.
  • the structured LDPC code can also be referred to as a quasi-cyclic LDPC code, and the quasi-cyclic LDPC code and structure described herein.
  • the LDPC codes are the same. All of the shift values constitute an M ⁇ N matrix, which may be referred to as a basic check matrix or a base matrix or a base protograph, and the sub-matrix size may be an expansion factor or a lift size. Mainly described in this patent as expansion The factors are the same.
  • the parity check matrix of the structured LDPC code has the following form:
  • each block matrix can be uniquely identified. If a block matrix is an all-zero matrix, the matrix is generally represented by -1 or a null value; and if it is a cyclic shift of the unit array Obtained, it is equal to s, so all hb ij can form a basic check matrix Hb, and then the basic matrix (or basic check matrix) Hb of the LDPC code can be expressed as follows:
  • the structured LDPC code can be uniquely determined by the base matrix Hb and the spreading factor Z.
  • the base check matrix Hb (2 rows and 4 columns) is as follows and the expansion factor z is equal to 4:
  • the elements in the parity check matrix have only 0 and 1, two element values, so they can be described as a binary matrix; and the transformation from the basic matrix to the parity check matrix (binary matrix) can be described as: basic matrix change Expanded into a parity check matrix or a base matrix is promoted into a parity check matrix.
  • the element index of the first row of the parity check matrix equal to 1 is [1 6 9], indicating that in the structured LDPC code, the first bit, The 6th bit and the 9th bit constitute a parity code; similarly, the index equal to 1 in the 2nd line is [2 7 10], and the 2nd bit, the 7th bit, and the 10th bit constitute a parity code And so on, it can be known that the LDPC code is actually a code word piled up by many song parity codes.
  • the advantage of the structured LDPC code is that as long as the basic parity check matrix Hb and the spreading factor Z are stored, the storage is very simple, and the coding/decoding algorithm can utilize its blocking characteristics, which can simplify the algorithm, such as hierarchical decoding. However, the bit node positions in each row do not conflict, and pipeline operations can be used, which can reduce decoding delay and decoding complexity, and is very simple to implement.
  • LDPC decoding methods such as probability domain BP decoding algorithm, log domain BP decoding algorithm and hierarchical minimum and decoding algorithm.
  • Probability domain BP decoding algorithm has the best performance, but the disadvantage is that because it involves a large number of multiplication operations, the computational complexity is very large, so the required hardware cost is very high, and the dynamic range of the numerical value is not stable, so it is generally in practice. Not used in the app.
  • the log-domain BP decoding algorithm reduces many computational units, but still requires a lot of multiplication operations, and the hardware costs required are also quite large.
  • the layered minimum and decoding algorithm converts the key computation (log operation and multiplication) units of the log-domain BP decoding algorithm into minimum and minimum values, and the required hardware resources are greatly reduced, and the performance will have a small loss. But you can reduce a lot of hardware resources. Therefore, the more practical applications are the layered minimum and decoding algorithms. No matter which decoding method is used, iterative decoding is needed.
  • the decoding module is mainly divided into two parts: check node update module and variable node update module.
  • the designed LDPC code parity check matrix is closely related. Conversely, if the design of the LDPC parity check matrix is not good, it will degrade its performance, and it may also affect the complexity and flexibility. Therefore, the concept of short-circle girth is introduced in the LDPC code design process. In order to better understand the concept of girth, we introduce the case where the basic matrix of the LDPC code has a short 4 ring and a short 6 ring to form a girth. In general, the basic matrix needs to be expanded into a parity check matrix or a binary matrix.
  • parity check matrix on any two different row indices i and l, and any two different column indexes on j and k, if the row index is i and l and the column index is j and k Among the four elements that are commonly indicated, the four elements are all equal to 1, then we think that there is a short circle of length 4 in the parity check matrix; similarly, in the parity check matrix, in any 3
  • the different row indices are on i, l, and a, and any three different column indexes are j, k, and b. If the row index is i, l, and a, the column index is j, k, and b.
  • an LDPC coding method can be uniquely determined by the basic matrix and the spreading factor, and can be extended by combining the basic matrix and the spreading factor ( Or promoted to a parity check matrix (or binary matrix). In order to better describe the girth characteristics.
  • An M*N parity check matrix H defines a constraint that each codeword having N bits satisfies M parity sets.
  • the origin of the bipartite graph name is because it includes two types of nodes, variable nodes and check nodes. There is no connection between any nodes of the same class. And the total number of sides in the bipartite graph is equal to the number of non-zero elements in the check matrix.
  • the solid line of black emphasis tells us that the information bits x 1 , x 2 and the check bits c 1 , c 2 constitute a circle of length 4.
  • the check constraints c 1 and c 2 are indistinguishable from (0 1 , x 2 ) being (0, 0) or (1, 1).
  • the solid line of black emphasis tells us that the information bits x 1 , x 2 , x 3 and the check bits c 1 , c 2 , and c 4 constitute a length of 6. ring.
  • Figure 7 illustrates that x 1 and x 2 are interconnected by a circle of length 4
  • Figure 8 illustrates that x 1 , x 2 , and x 3 are interconnected by a loop of length 6, and the message passing of the LDPC code is translated.
  • the code algorithm assumes that the variable nodes are independent of each other, and the existence of short circles necessarily destroys the assumption of independence, so that the decoding performance is significantly degraded. In fact, the existence of short circles such as circle 4 and circle 6 makes the variable nodes frequently transmit positive feedback information to themselves during the iterative decoding process.
  • the turbo code is also iteratively decoded, using an interleaver to reduce this positive feedback effect.
  • the information transfer algorithm leads to optimal decoding, and the existence of the circle makes the Message Passing algorithm a sub-optimal iterative decoding algorithm.
  • Figure 9 shows the general form of the short circle with a circle length of 4 appearing in the LDPC code check matrix.
  • Figure 9 shows the general form of a short circle with a loop length of 6 appearing in the LDPC code check matrix.
  • the non-zero element represents the connected node of the check node corresponding to the line number and the column number corresponding to the variable node.
  • the edges connecting two non-zero elements in the check matrix diagram represent only one type of connection, and the connection can only be horizontal or vertical, where the horizontal side represents two variable nodes passing a check.
  • the nodes are connected, as shown in Figure 9, the variable nodes x i and x j are connected by the check node c p .
  • the analysis shows that if there is a distance between two variable nodes, the two variable nodes will form a horizontal edge in the check matrix. Similarly, the vertical direction indicates that two check nodes are connected by a variable node.
  • a short circle can be formed in the check matrix, and the length of the formed short circle is determined by the number of non-zero elements contained in the circle, because we know that the non-zero element corresponds to the true edge in the bipartite graph,
  • the number of non-zero elements is exactly equal to the number of sides in the short circle, so the short circle length is exactly equal to the total number of edges included in the short circle of the matrix picture.
  • the circle in Figure 9 has four non-zero elements, so the circle has a length of 4 and has 4 sides; in Figure 10, the circle has six non-zero elements, the circle has a length of 6, and contains 6 sides.
  • the circle in the bipartite graph and the circle of the check matrix can be completely matched one by one, so that the circle occurrence condition in the bipartite graph can be determined by judging the occurrence of the circle in the check matrix.
  • the overlap (1) overlap between the two columns in the check matrix due to the variable node x i , x j is at least 2.
  • the overlap of two columns in the check matrix is 0, then the two columns are orthogonal to each other with minimal correlation. If the overlap is larger, the correlation between the two columns is greater. Therefore, if the overlap between the two columns of the check matrix is 2, the correlation of the columns of the check matrix is inevitably enhanced, which reduces the rank of the check matrix, so that the block code determined by the check matrix is determined.
  • the free distance is reduced.
  • a short circle of length 6 enhances the correlation between the three columns. If the short circle occurs more frequently, it also affects the rank of the check matrix, thereby reducing the free distance, resulting in a decrease in code performance.
  • the existence of the short circle in the check matrix is compared with the case without the short circle, which leads to an increase in the correlation of the columns of the check matrix, thereby reducing the rank of the check matrix and reducing the free distance of the code.
  • Reduce code performance In fact, the check matrix of the high girth code is more likely to be full rank, and the high girth code refers to the LDPC code corresponding to the shortest circle length of the bipartite graph.
  • the girth of the bipartite graph, the girth of the node, and the girth of the edge are explained below.
  • the girth of the bipartite graph refers to the circle length of the shortest circle in a figure. For example, if a bipartite graph has a length of 6, 8, 10, 12 and a longer length, the girth of the bipartite graph is 6.
  • the girth (the girth at node u) of a node u) of a node u refers to the circle length of the shortest circle passing through the node u.
  • the girth of this node u is 8.
  • the girth (the girth at node u) of an edge e refers to the circle length of the shortest circle passing through the edge e.
  • the circle e has a length of 8, 10, 12 and a longer length. Then the girth of the node u is 8.
  • the girth of a variable node is the length of the shortest path, which is equivalent to the minimum number of iterations of information coming out of this node back to the node itself.
  • the information associated with this node can be optimally passed to the remainder of the bipartite graph before the actual number of iterations reaches this minimum number of iterations. If the girth of a variable node is larger, the smaller the positive feedback information that the information sent by the variable node is passed to itself, the better the decoding performance. Therefore, it is advantageous to make the girth of the variable node as large as possible to improve the performance of the code.
  • the principle of constructing a high LDPC code is as follows: First, the length of the shortest circle (girth) of the selected code should be as large as possible; secondly, for a code having the same size girth, the number of the shortest circle of the selected code should be Try to be as small as possible.
  • the base matrix is extended to a parity check matrix, which may also be referred to as an extended matrix or a binary matrix.
  • a parity check matrix which may also be referred to as an extended matrix or a binary matrix.
  • the topology of the check matrix and the bipartite graph is analyzed.
  • a short circle of length 4 appears in the base matrix H b
  • a short circle of length 4 or more may appear in the extended matrix H of H b .
  • a short circle of length 6 appears in the basic matrix Hb
  • a short circle of length 6 or more may appear in the extended matrix H of H b , as follows :
  • mod(i-j+k-l+mn,z) 0
  • P i , P j , P k , P l , P m , P n form a length in H a short circle of 6
  • mod(i-j+k-l+mn,z) z/2, then P i , P j , P k , P l , P m , P
  • the topology of the check matrix and the bipartite graph is analyzed.
  • a short circle of length 8 appears in the basic matrix H b
  • a short circle of length 8 or more may appear in the extended matrix H of H b .
  • the embodiments of the present disclosure provide a quasi-cyclic LDPC encoding and decoding method, apparatus, and LDPC codec to solve at least the problem of lack of flexibility in the LDPC encoding and decoding process in the related art.
  • an LDPC coding and decoding method comprising: determining a basis matrix used for low density parity check LDPC coding from a set of a mother base matrix, wherein a base matrix used by the LDPC coding
  • the method includes: a first type element and a second type element, wherein the first type element corresponds to an all-zero square matrix, and the second type element corresponds to a unit matrix obtained by cyclically shifting according to a value of the second type element a matrix in which the dimensions of the all-zero square matrix and the unit matrix are equal; LDPC encoding the sequence of information to be encoded according to the base matrix used in the LDPC encoding, and/or based on the basis used in the LDPC encoding The matrix performs LDPC decoding on the decoded data sequence.
  • determining the basic matrix used by the LDPC encoding from the set of the parent base matrix includes: determining a basic matrix used by the LDPC encoding according to a preset parameter, where The preset parameter includes at least one of the following: a transport block size TBS, an application scenario, a user UE type, a frequency band, a code rate R, a combination of a transport block size TBS and a code rate R, a channel type, a data transmission direction, and a TBS index number.
  • the application scenario includes: a mobile broadband enhanced eMBB, an ultra-high reliability low latency communication URLLC, and a large-scale Internet of Things mMTC;
  • the frequency band includes: a frequency range configured by the system; and the code rate R is a real number greater than 0 and less than 1.
  • the channel type includes: a control channel and a data channel; the data transmission direction includes: uplink data and downlink data; the TBS index number is used to indicate a corresponding transport block size TBS, the TBS index number, in combination with the number of resource units. Is an integer greater than or equal to 0; the MCS index number is used to indicate an MCS scheme or a combination of a modulation order and a TBS index, the MCS index number is greater than or An integer equal to 0; NRB is the number of the resource unit number of resource blocks of the system configuration; the size of the bandwidth is a real number greater than 0.
  • the transport block size TBS is an element in a TBS set TBSSet, where the TBS set includes A1 TBS sub-sets TBSsubset i , and the parent base matrix set includes A1 basic matrix sub-sets.
  • Hb i each TBS sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between two pairs of A1 TBS subsets, and all A1 TBS sub-sets form a complete TBS a set, i is an integer between 0 and A1-1; determining the base matrix used by the LDPC encoding from the set of the parent base matrix, comprising: determining the location to which the transport block size TBS belongs TBS subset TBSsubset i, and then determining the TBS subset TBSsubset i corresponding subset of the base matrix Hb i.
  • the corresponding basic matrix is selected from the basic matrix subset Hb i corresponding to the TBS sub-set TBSsubset i according to the actual coding rate or the combination of the transmission block size TBS and the LDPC codeword size.
  • the code rate R is an element in a code rate set of all code rate sets, where the code rate set includes an A2 code rate Coderate i , where i is an integer between 0 and A2-1, and
  • the set of mother base matrix includes A2 basic matrix subsets Hb i , each code rate corresponding to a basic matrix subset; wherein all A2 code rates constitute a complete code rate set of all the code rate sets, A2 is greater than An integer of 1; determining the base matrix used by the LDPC encoding from the set of the parent base matrix, comprising: determining the code rate Coderate i equal to the code rate R, and then determining the code rate coderate i corresponding subset of the base matrix Hb i.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the mother basic matrix set includes A3 basic matrix subsets Hb i , each The frequency band corresponds to a basic matrix subset; wherein there is no intersection between two of the A3 frequency bands, all A3 frequency bands form a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is 0 to A3-1 An integer between the determining and determining the base matrix used by the LDPC encoding from the set of the parent base matrix, comprising: determining an index that belongs to the frequency band set FBSet with the frequency band, and then determining a basic matrix corresponding to the frequency band Subset Hb i .
  • the set of the parent base matrix includes: a base matrix subset set used for data encoding and a base matrix subset set used by signaling, and determining a basis used by the LDPC encoding from the set of the parent base matrix
  • the matrix includes determining the channel type and then determining a basic matrix subset corresponding to the channel type.
  • the set of the parent base matrix includes: a basic matrix subset used for uplink transmission data and a basic matrix subset used by downlink transmission data, where the determining the LDPC encoding is used from the parent basic matrix set
  • the base matrix includes: determining the data transmission direction, and then determining a basic matrix subset corresponding to the data transmission direction.
  • the sub-sets are: Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1;
  • the determining the basic matrix used for LDPC encoding including : selecting a base matrix subset corresponding to a code rate greater than or equal to R′ and having the smallest difference from R′ from [R0, . . . , R(A2-1)], the R′ being the actual code rate , R' is a real number greater than 0 and less than 1, and A2 is greater than An integer of 1.
  • the A2 code rates supported by the set of the parent base matrix, each code rate corresponding to a basic matrix subset, the code rate includes: R0, R1, ..., R (A2-1), corresponding to the basic matrix
  • the sub-sets are: Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1; wherein the determining the basic matrix used for LDPC encoding, including : a basic matrix subset corresponding to a code rate less than or equal to R' and having the smallest difference from R' in [R0, ..., R(A2-1)], the R' being the actual code rate, R' is a real number greater than 0 and less than 1, and the A2 is an integer greater than one.
  • the number of matrix columns NBi of the A4 basic matrix subsets is equal; and/or, the matrix row numbers MBi of the A4 basic matrix subsets are equal; and/or, the A4 basic matrix subsets
  • a column index set Colset composed of all column indexes in all the basic matrix sub-sets, a first column index set ColsetX and a second column index set ColsetY, the first column index set and the second column index set have no intersection, And the two subsets are not empty, the first column index set and the second column index set are both subsets of Colset, when the column index j belongs to the first column index set, and the jth column of each base matrix sub-collection
  • the second type of elements all belong to the same set EleSetj, wherein the number of elements of the second type of EleSetj is less than or equal to the maximum value of the column weight of the jth column of all the basic matrix sub-sets; when the column index j belongs to the second column index set, any two The number of second type elements of the intersection of the jth column of the first basic matrix subset and the jth column of the second basic matrix subset in the basic matrix subset is less than or equal to 2, and the first basic matrix subset, The number of elements of
  • A4 1 a row index set Rowset composed of all row indexes of the basic matrix subset, a first row index set RowsetX and a second row index set RowsetY, j and k are the first one Any two elements in the row index set, the jth row and the kth row in the base matrix subset are orthogonal; the first row index set RowsetX and the second row index set RowsetY have no intersection, and neither subset Empty, the first row index set RowsetX and the second row index set RowsetY are both subsets of Rowset; the jth row and the kth row are orthogonal to any column index in the jth row and the kth row There is at most one of the two elements of the second element.
  • the number of elements supported by at least two extension factor sets in the A4 spreading factor set is not equal.
  • the number of matrix columns whose columns are greater than 1 is a positive integer greater than 2 5 -10 and less than 2 5 .
  • all second class element values in any of the check columns in any one of the base matrix subsets are equal to zero.
  • any one of the basic matrix subsets in the set of the parent base matrix is orthogonal to any consecutive L1 row from the L0 row to the last row, and the L1 row is orthogonal to the L1 of any column index in the L1 row.
  • the L0 is an integer greater than or equal to 0 and less than 5
  • L1 is an integer greater than 0 and less than 5.
  • the bipartite graph corresponding to the parity check matrix of any one of the basic matrix sub-sets has at least one short circle with a girth of 4; the i-th basic matrix of the basic matrix sub-set
  • the column weight of the basic matrix subset corresponding to the variable node with the girth of 6 is less than or equal to the variable node corresponding to the girth of 4.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, the basic matrix subset
  • the code length corresponding to the i-th base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6,
  • the number of variable nodes corresponding to the code length Ni girth 8
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the variable nodes corresponding to the girth of 6.
  • the second type of elements of all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix are the same.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support the same code rate.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support different code lengths, and the second type of elements in the base matrix supporting different code lengths are determined according to the spreading factor and a certain The expansion factor is calculated.
  • the determined spreading factor is an expansion factor corresponding to a maximum code length supported by all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix.
  • any one of the basic matrix sub-sets of the set of the parent base matrix supports multiple code rates, where each code rate corresponds to one basic matrix, where there are x in the two basic matrices corresponding to any two code rates.
  • the first type of element positions are different; or any one of the basic matrix sub-sets of the parent base matrix set supports multiple code lengths, wherein each code length corresponds to one basic matrix, where any two code lengths correspond to 2
  • the set of the parent base matrix includes a plurality of basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute a column index set ColSet,
  • the column index set may be divided into two sub-collections Colsubset1 and Colsubset2, wherein the Colsubset1 and the Colsubset2 are complementary to each other, the Colsubset1 has Ci elements, and Colsubset2 has Di elements, and i is used to indicate a specific code length.
  • the sub-base matrix indicated by all the row indexes of any one of the base matrices Hbi and the column index of all Colsubset1 is Hbi(:, Colsubset1), and the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi are combined.
  • the column index set ColSet may further be divided into a third sub-collection Colsubset3 and a fourth sub-collection Colsubset4, where the Colsubset3 and the Colsubset4 are complementary to each other, the Colsubset1 includes the Colsubset3, and the Colsubset4 includes The Colsubset2, the Colsubset3 has Ei elements, the Colsubset4 has Fi elements, and Ei and Fi are integers greater than or equal to 1, wherein any element k and Colsubset3 in the Colsubset2 constitute a set Colsubset5, wherein The sub-base matrix of all the row indexes and the column index joint indications of all Colsubset 5 is Hbi (:, Colsubset 5), and the matrix is expanded by matrix expansion to obtain a parity check matrix HL3i in combination with Hbi (:, Colsubset 5) and the spreading factor Zi.
  • a quasi-cyclic LDPC codec apparatus comprising: a determining module configured to determine a basis matrix used for low-density parity check LDPC coding from a set of mother base matrices, wherein The basic matrix used in the LDPC encoding includes: a first class element corresponding to an all-zero square matrix, and a second class element corresponding to the unit matrix according to the second class a matrix obtained by cyclically shifting values of elements, the all-zero square matrix and the dimension of the unit matrix being equal; a codec module configured to perform LDPC encoding on a sequence of information to be encoded according to a base matrix used by the LDPC encoding And/or LDPC decoding the data sequence to be decoded according to the base matrix used by the LDPC encoding.
  • the determining module is configured to: determine a basic matrix used by the LDPC encoding according to the preset parameter, where the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, and a user UE type.
  • the frequency band includes: a frequency range configured by the system; the code rate R is a real number greater than 0 and less than 1; the channel type includes: a control channel and a data channel; and the data transmission direction includes: uplink data and downlink data;
  • the TBS index number is used to indicate a corresponding transport block size TBS according to the number of resource units, where the TBS index number is an integer greater than or equal to 0; the MCS index number is used to indicate an MCS scheme or a modulation order and TBS a
  • the transport block size TBS is an element in a TBS set TBSSet, where the TBS set includes A1 TBS sub-sets TBSsubset i , and the parent base matrix set includes A1 basic matrix sub-sets.
  • Hb i each TBS sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between two pairs of A1 TBS subsets, and all A1 TBS sub-sets form a complete TBS a set, i is an integer between 0 and A1-1;
  • the determining module is configured to: determine the TBS sub-set TBSsubset i to which the transport block size TBS belongs , and then determine that the TBS sub-set TBSsubset i corresponds to The basic matrix sub-set Hb i .
  • the corresponding basic matrix is selected from the basic matrix subset Hb i corresponding to the TBS sub-set TBSsubset i according to the actual coding rate or the combination of the transmission block size TBS and the LDPC codeword size.
  • the code rate R is an element in a code rate set of all code rate sets, where the code rate set includes an A2 code rate Coderate i , where i is an integer between 0 and A2-1, and
  • the set of mother base matrix includes A2 basic matrix subsets Hb i , each code rate corresponding to a basic matrix subset; wherein all A2 code rates constitute a complete code rate set of all the code rate sets, A2 is greater than integer 1;
  • the determination module is configured to: determine the rate equal to the rate R coderate i, and then determining the rate of the base matrix corresponding subset coderate i Hb i.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the mother basic matrix set includes A3 basic matrix subsets Hb i , each The frequency band corresponds to a basic matrix subset; wherein there is no intersection between two of the A3 frequency bands, all A3 frequency bands form a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is 0 to A3-1 An integer between the two; the determining module is configured to: determine an index that belongs to the frequency band set FBSet with the frequency band, and then determine a basic matrix subset Hb i corresponding to the frequency band.
  • the set of the parent base matrix includes: a base matrix subset set used for data encoding and a base matrix subset set used by signaling, and determining a basis used by the LDPC encoding from the set of the parent base matrix
  • the matrix includes determining the channel type and then determining a basic matrix subset corresponding to the channel type.
  • the set of the parent base matrix includes: a basic matrix subset used for uplink transmission data and a basic matrix subset used by downlink transmission data, where the determining the LDPC encoding is used from the parent basic matrix set
  • the base matrix includes: determining the data transmission direction, and then determining a basic matrix subset corresponding to the data transmission direction.
  • the sub-sets are: Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1;
  • the determining the basic matrix used for LDPC encoding including : selecting a base matrix subset corresponding to a code rate greater than or equal to R′ and having the smallest difference from R′ from [R0, . . . , R(A2-1)], the R′ being the actual code rate , R' is a real number greater than 0 and less than 1, and A2 is an integer greater than 1.
  • the A2 code rates supported by the set of the parent base matrix each code rate corresponding to a basic matrix subset, the code rate includes: R0, R1, ..., R (A2-1), corresponding to the basic matrix
  • the sub-sets are: Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1; wherein the determining the basic matrix used for LDPC encoding, including : a basic matrix subset corresponding to a code rate less than or equal to R' and having the smallest difference from R' in [R0, ..., R(A2-1)]
  • the cooperation is the code rate value R, the R' is the actual code rate, R' is a real number greater than 0 and less than 1, and the A2 is an integer greater than one.
  • the number of matrix columns NBi of the A4 basic matrix subsets is equal; and/or, the matrix row numbers MBi of the A4 basic matrix subsets are equal; and/or, the A4 basic matrix subsets
  • a column index set Colset composed of all column indexes of all the basic matrix sub-sets, a first column index set ColsetX and a second column index set ColsetY, the first column index set and the second column index set have no intersection, And the two subsets are not empty, the first column index set and the second column index set are both subsets of Colset, when the column index j belongs to the first column index set, and the jth column of each base matrix sub-collection
  • the second type of elements all belong to the same set EleSetj, wherein the number of elements of the second type of EleSetj is less than or equal to the maximum value of the column weight of the jth column of all the basic matrix sub-sets; when the column index j belongs to the second column index set, any two The number of second type elements of the intersection of the jth column of the first basic matrix subset and the jth column of the second basic matrix subset in the basic matrix subset is less than or equal to 2, and the first basic matrix subset, The number of elements of
  • A4 1 a row index set Rowset composed of all row indexes of the basic matrix subset, a first row index set RowsetX and a second row index set RowsetY, j and k are the first one Any two elements in the row index set, the jth row and the kth row in the base matrix subset are orthogonal; the first row index set RowsetX and the second row index set RowsetY have no intersection, and neither subset Empty, the first row index set RowsetX and the second row index set RowsetY are both subsets of Rowset; the jth row and the kth row are orthogonal There is at most one of the 2 elements on any of the column indices in the jth and kth rows.
  • the number of elements supported by at least two extension factor sets in the A4 spreading factor set is not equal.
  • the number of matrix columns whose columns are greater than 1 is a positive integer greater than 2 5 -10 and less than 2 5 .
  • all second class element values in any of the check columns in any one of the base matrix subsets are equal to zero.
  • any one of the basic matrix subsets in the set of the parent base matrix is orthogonal to any consecutive L1 row from the L0 row to the last row, and the L1 row is orthogonal to the L1 of any column index in the L1 row.
  • the L0 is an integer greater than or equal to 0 and less than 5
  • L1 is an integer greater than 0 and less than 5.
  • the bipartite graph corresponding to the parity check matrix of any one of the basic matrix sub-sets has at least one short circle with a girth of 4; the i-th basic matrix of the basic matrix sub-set
  • the column weight of the basic matrix subset corresponding to the variable node with the girth of 6 is less than or equal to the variable node corresponding to the girth of 4.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, the basic matrix subset
  • the code length corresponding to the i-th base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6,
  • the number of variable nodes corresponding to the code length Ni girth 8
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the variable nodes corresponding to the girth of 6.
  • the second type of elements of all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix are the same.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support the same code rate.
  • all the basic matrices in any one of the basic matrix sub-sets of the set of the parent base matrix support different code lengths
  • the second type element in the basic matrix supporting different code lengths is Calculated based on the expansion factor and a determined expansion factor.
  • the determined spreading factor is an expansion factor corresponding to a maximum code length supported by all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix.
  • any one of the basic matrix sub-sets of the set of the parent base matrix supports multiple code rates, where each code rate corresponds to one basic matrix, where there are x in the two basic matrices corresponding to any two code rates.
  • the first type of element positions are different; or any one of the basic matrix sub-sets of the parent base matrix set supports multiple code lengths, wherein each code length corresponds to one basic matrix, where any two code lengths correspond to 2
  • the set of the parent base matrix includes a plurality of basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute a column index set ColSet,
  • the column index set may be divided into two sub-collections Colsubset1 and Colsubset2, wherein the Colsubset1 and the Colsubset2 are complementary to each other, the Colsubset1 has Ci elements, and Colsubset2 has Di elements, and i is used to indicate a specific code length.
  • the sub-base matrix indicated by all the row indexes of any one of the base matrices Hbi and the column index of all Colsubset1 is Hbi(:, Colsubset1), and the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi are combined.
  • a parity check matrix HL1i is obtained, and the girth of the parity check matrix HL1i is g; the sub-base matrix of all the row indexes in the base matrix Hbi and the column indexes of all Colsubset2 joints is Hbi(:, Colsubset2 And combining Hbi(:, Colsubset2) and the boost value Zi to obtain a parity check matrix HL2i, wherein the girth of the parity check matrix HL2i is g-2, and all the spreading factors supported by the basic matrix subset
  • the column index set ColSet may also be divided into a third subset Colsubset3 and a fourth subset Colsubset4, wherein the Colsubset3 and the Colsubset4 are complementary to each other.
  • a quasi-cyclic LDPC codec comprising: a processing chip for determining a base matrix used for low density parity check LDPC coding from a set of mother base matrices, wherein The basic matrix used in the LDPC encoding includes: a first class element corresponding to an all-zero square matrix, and a second class element corresponding to the unit matrix according to the second class a matrix obtained by cyclically shifting values of elements, the all-zero square matrix and the dimension of the unit matrix are equal, the parent base matrix set includes at least one base matrix; an encoder for performing according to the LDPC encoding The base matrix used performs LDPC encoding on the encoded information sequence; and/or a decoder for performing LDPC decoding on the data sequence to be decoded according to the base matrix used by the LDPC encoding.
  • the processing chip is configured to: determine a basic matrix used by the LDPC encoding according to a preset parameter, where the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, and a user UE type.
  • the transport block size TBS is an integer greater than 0;
  • the application scenarios include: mobile broadband enhanced eMBB, ultra-high reliability low latency communication URLLC, and large scale The Internet of Things mMTC;
  • the frequency band includes: a frequency range configured by the system;
  • the code rate R is a real number greater than 0 and less than 1;
  • the channel type includes: a control channel and a data channel;
  • the data transmission direction includes: uplink data and downlink data;
  • the TBS index number is used to indicate a corresponding transport block size TBS according to the number of resource units, and the TBS index number is an integer greater than or equal to 0;
  • the MCS index number For indicating an MCS scheme or a combination of a modulation order and an T
  • a storage medium storing an execution instruction for performing the quasi-cyclic LDPC coding and decoding method in the above embodiment.
  • the basic matrix used for LDPC encoding is determined from the set of the parent base matrix, wherein the basic matrix used in the LDPC encoding includes: a first class element and a second class element, the first class element corresponding to the all zero square Array, the second type of element corresponds to a matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, and the dimensions of the all-zero square matrix and the unit array are equal; according to the basic matrix used in the LDPC encoding, the sequence of the information to be encoded is performed.
  • the basic matrix used for LDPC coding is determined from the set of the mother base matrix by using the above scheme, and the LDPC coding station is used.
  • the elements in the basic matrix used are divided into a first type element and a second type element.
  • the first type element and the second type element respectively have corresponding matrices, and then the code is compiled according to the basic matrix used in LDPC coding, so that the LDPC is compiled.
  • the code supports flexible code length and code rate, thus improving the flexibility of the LDPC encoding and decoding process, thereby solving the lack of the LDPC encoding and decoding process in the related art. Less flexibility.
  • FIG. 1 is a block diagram showing the structure of a digital communication system according to the related art
  • FIG. 2 is a flowchart of an LDPC codec method according to an embodiment of the present disclosure
  • FIG. 3 is a structural block diagram 1 of an LDPC codec device according to an embodiment of the present disclosure
  • FIG. 4 is a structural block diagram 2 of an LDPC codec device according to an embodiment of the present disclosure
  • FIG. 5 is a flowchart of a method of encoding an LDPC code of a transmitting end according to an alternative embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of a girth of 4 in a parity check matrix corresponding to a basic matrix according to the related art
  • FIG. 7 is a first schematic diagram of a binary picture break of a check matrix according to an alternative embodiment of the present disclosure.
  • FIG. 8 is a second schematic diagram of a binary picture break of a check matrix according to an alternative embodiment of the present disclosure.
  • FIG. 9 is a third schematic diagram of a binary picture break of a check matrix according to an alternative embodiment of the present disclosure.
  • FIG. 10 is a schematic diagram 4 of a binary picture break of a check matrix according to an alternative embodiment of the present disclosure
  • FIG. 11 is a schematic diagram of a cyclic shift matrix of four unit matrices constituting a short circle of length 4 in accordance with an alternative embodiment of the present disclosure
  • FIG. 12 is a schematic diagram of a cyclic shift matrix of six unit matrices constituting a short circle of length 6 in accordance with an alternative embodiment of the present disclosure
  • FIG. 13 is a schematic diagram of a cyclic shift matrix of eight unit matrices forming a short circle of length 8 at H in accordance with an alternative embodiment of the present disclosure
  • 15 is a schematic diagram of a girth of a set of spreading factors versus respective variables, in accordance with an alternative embodiment of the present disclosure.
  • FIG. 2 is a flowchart of an LDPC encoding and decoding method according to an embodiment of the present disclosure. As shown in FIG. 2, the process includes the following steps:
  • Step S202 determining a basic matrix used in Low Density Parity Check (LDPC) encoding from the set of the parent base matrix, where the basic matrix used in the LDPC encoding includes: the first type element and the first The second type of element, the first type of element corresponds to the all-zero square matrix, and the second type of element corresponds to the matrix obtained by cyclically shifting the unit array according to the value of the second type of element, and the dimensions of the all-zero square matrix and the unit array are equal;
  • LDPC Low Density Parity Check
  • Step S204 performing LDPC encoding on the coded information sequence to be used according to the basic matrix used in the LDPC encoding, and/or performing LDPC decoding on the data sequence to be decoded according to the basic matrix used in the LDPC encoding.
  • the basic matrix used in the LDPC encoding is determined from the set of the parent base matrix, wherein the basic matrix used in the LDPC encoding includes: a first class element and a second class element, and the first class element corresponds to the all zero square Array, the second type of element corresponds to a matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, and the dimensions of the all-zero square matrix and the unit array are equal; according to the basic matrix used in the LDPC encoding, the sequence of the information to be encoded is performed.
  • the basic matrix used for LDPC coding is determined from the set of the mother base matrix by using the above scheme, and the LDPC coding station is used.
  • the elements in the basic matrix used are divided into a first type element and a second type element.
  • the first type element and the second type element respectively have corresponding matrices, and then the code is compiled according to the basic matrix used in LDPC coding, so that the LDPC is compiled.
  • the code supports flexible code length and code rate, thus improving the flexibility of the LDPC encoding and decoding process, thereby solving the LDPC encoding and decoding process in the related art. Lack of flexibility.
  • the basic matrix used by the LDPC encoding may be determined according to a preset parameter, where the preset parameter includes at least one of the following: a transport block size. TBS, application scenario, user UE type, frequency band, code rate R, combination of transport block size TBS and code rate R, channel type, data transmission direction, TBS index number and resource unit number NRB combination, MCS index number and resource unit The combination of the number of NRBs, the combination of the code rate R and the number of resource units NRB, and the bandwidth size.
  • the transport block size TBS is an integer greater than 0;
  • the application scenarios include: mobile broadband enhanced eMBB, ultra-high reliability low latency communication URLLC, and large-scale Internet of Things mMTC;
  • the frequency band includes: a frequency range of the system configuration;
  • the rate R is a real number greater than 0 and less than 1.
  • the channel type includes: a control channel and a data channel; the data transmission direction includes: uplink data and downlink data; and the TBS index number is used to indicate a corresponding transport block size TBS, TBS in combination with the number of resource units.
  • the index number is an integer greater than or equal to 0; the MCS index number is used to indicate an MCS scheme or a combination of a modulation order and a TBS index, and the MCS index number is an integer greater than or equal to 0; the resource unit number NRB is a resource configured by the system.
  • the number of blocks; the bandwidth size is a real number greater than zero.
  • the transport block size TBS is an element in the TBS set TBSSet, where the TBS set includes A1 TBS sub-sets TBSsubset i , and the simultaneous parent base matrix set includes A1 basic matrix sub-sets Hb i , each TBS The sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between two pairs of A1 TBS subsets, all A1 TBS sub-sets form a complete TBS set, and i is 0 to A1-1 an integer between; in the step S202: determining the transport block size TBS TBS belongs to the subset TBSsubset i, and then determining the TBS based matrix subset TBSsubset i corresponding subset Hb i.
  • the corresponding basic matrix is selected from the basic matrix subset Hb i corresponding to the TBS subset TBSsubset i according to the actual coding rate or the combination of the transport block size TBS and the LDPC codeword size.
  • the code rate R is an element in the code rate set of all code rate sets, wherein the code rate set includes a2 code rate Coderate i , i is an integer between 0 and A2-1, and the parent base matrix
  • the set includes A2 basic matrix subsets Hb i , each code rate corresponding to a basic matrix subset; wherein all A2 code rates constitute a complete code rate set of all code rate sets, A2 is an integer greater than 1; in step S202 above in: determining a rate equal to the rate R coderate i, and then determining the rate based matrix corresponding subset coderate i Hb i.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the common mother base matrix set includes A3 parent base matrix subsets Hb i , and each frequency band corresponds to one basic matrix Subset; wherein there is no intersection between two of the A3 frequency bands, all A3 frequency bands constitute a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is an integer between 0 and A3-1;
  • step S202 an index that belongs to the frequency band set FBSet is determined, and then the basic matrix subset Hb i corresponding to the frequency band is determined.
  • the set of the parent base matrix includes: a base matrix used for data encoding and a basic matrix subset used by the signaling code, and determining a basic matrix subset used by the LDPC encoding from the set of the parent base matrix, including: determining a channel type, A base matrix subset corresponding to the channel type is then determined.
  • the set of the parent base matrix includes: a basic matrix subset used by the uplink transmission data and a basic matrix subset used by the downlink transmission data, and in the foregoing step S202, determining a data transmission direction, and then determining a basic matrix corresponding to the data transmission direction. Subcollection.
  • the A2 code rates supported by the parent base matrix set each code rate corresponding to a basic matrix subset, the code rate includes: R0, R1, ..., R (A2-1), and the corresponding basic matrix is: Hb0 , Hb1, . . . , Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1; wherein the basic matrix used for LDPC encoding is determined, including: from [R0, . . . , R (A2-1)] select a base matrix subset corresponding to a code rate greater than or equal to R' and having the smallest difference from R', R' is the actual code rate, and R' is a real number greater than 0 and less than 1.
  • A2 is an integer greater than one.
  • the base matrix subset is used to perform shortening coding, that is, a part of dummy bits are added to the information sequence to be encoded before encoding, and the dummy codeword bits are not transmitted, so as to ensure that the coding rate is constant (that is, equal to the actual coding). Rate).
  • the puncturing coding is performed, that is, some codeword bits are not transmitted after the LDPC is encoded, so as to ensure that the coding rate is constant (that is, equal to the actual coding rate).
  • the parent base matrix set includes A4 basic matrix subsets, and the dimension of the ith base matrix subset of the A4 base matrix subsets is: the number of matrix columns is NBi, and the number of matrix rows is MBi, respectively.
  • a column index set Colset composed of all column indexes in all the basic matrix sub-sets, a first column index set ColsetX and a second column index set ColsetY, the first column index set and the second column index set have no intersection, And the two subsets are not empty, the first column index set and the second column index set are both subsets of Colset, when the column index j belongs to the first column index set, and the jth column of each base matrix sub-collection
  • the second type of elements all belong to the same set EleSetj, wherein the number of elements of the second type of EleSetj is less than or equal to the maximum value of the column weight of the jth column of all the basic matrix sub-sets; when the column index j belongs to the second column index set, any two The number of second type elements of the intersection of the jth column of the first basic matrix subset and the jth column of the second basic matrix in the basic matrix subset is less than or equal to 2, and the first basic matrix subset and the second basic matrix The number of
  • A4 1 a row index set Rowset composed of all row indexes of the basic matrix subset, a first row index set RowsetX and a second row index set RowsetY, j and k are the first row index set Any two elements, the jth row and the kth row in the base matrix subset are orthogonal; the first row index set RowsetX and the second row index set RowsetY have no intersection, and the two subsets are not empty, the first The row index set RowsetX and the second row index set RowsetY are both subsets of Rowset; the jth row and the kth row are orthogonal to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the second type of element is used to be used to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the number of matrix columns whose columns are greater than 1 is a positive integer greater than 2 5 -10 and less than 2 5 .
  • all second class element values in any of the check columns in any one of the base matrix subsets are equal to zero.
  • any consecutive L1 row from the L0 row to the last row in the base matrix of the parent base matrix is orthogonal, and the L1 row orthogonal is at most one of the L1 element values of any column index in the L1 row.
  • the second type of element value, L0 is an integer greater than or equal to 0 and less than 5
  • L1 is an integer greater than 0 and less than 5.
  • the column weights of the basic matrix subsets corresponding to the variable nodes with girth of 6 are less than or equal to the basic matrix subsets corresponding to the variable nodes with girth of 4. Column weight.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, and the i-th of the basic matrix subset
  • the code length corresponding to the base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the basic matrix subsets corresponding to the variable nodes with the girth of 6. Column weight.
  • the second type of elements of all the base matrices in any one of the base matrix sub-sets of the parent base matrix set are the same.
  • all of the base matrices in any one of the base matrix subsets of the parent base matrix set support the same code rate.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support different code lengths
  • the second type of elements in the base matrix supporting different code lengths are calculated according to the spreading factor and a certain expansion factor. obtain.
  • the determined spreading factor is a spreading factor corresponding to a maximum code length supported by all the basic matrices in any one of the basic matrix sub-sets of the set of the parent base matrix.
  • any one of the basic matrix sub-sets of the set of the parent base matrix supports multiple code rates, where each code rate corresponds to one basic matrix, where there are x of the two basic matrices corresponding to any two code rates.
  • One type of element has different positions; or any one of the basic matrix sub-sets of the parent base matrix set supports multiple code lengths, wherein each code length corresponds to one basic matrix, and two bases corresponding to any two code lengths
  • x first class elements in the matrix with different positions and x is an integer greater than 0 and less than 10.
  • the parent base matrix set includes multiple basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute a column of the column index set ColSet.
  • the index set can be divided into two sub-collections Colsubset1 and Colsubset2, wherein Colsubset1 and Colsubset2 are complementary to each other, Colsubset1 has Ci elements, Colsubset2 has Di elements, and i is used to indicate a basic matrix Hbi corresponding to a specific code length, Hbi
  • the sub-base matrix of all the row indexes in all the base matrix Hbi and the column index joints of all Colsubset1 is Hbi(:, Colsubset1)
  • the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi pass through the matrix.
  • a quasi-cyclic LDPC codec device is also provided, which is used to implement the foregoing embodiments and optional implementations, and has not been described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 3 is a structural block diagram 1 of an LDPC codec device according to an embodiment of the present disclosure. As shown in FIG. 3, the device includes:
  • the determining module 32 is configured to determine, from the set of the parent base matrix, a base matrix used by the LDPC encoding, where the basic matrix used in the LDPC encoding includes: a first class element and a second class element, the first class An element corresponding to an all-zero square matrix, the second type element corresponding to a matrix obtained by cyclically shifting a unit matrix according to a value of the second type element, the all-zero square matrix and the unit matrix having the same number of dimensions ;
  • a codec module 34 coupled to the determining module 32, configured to be in accordance with the LDPC encoding
  • the base matrix used is LDPC-encoded with the coded information sequence, and/or LDPC-decoded according to the base matrix used for the LDPC coding.
  • the determining module determines the basic matrix used by the LDPC encoding from the set of the parent base matrix, wherein the basic matrix used in the LDPC encoding includes: a first class element and a second class element, and the first class element corresponds to the whole a zero square matrix, the second type of element corresponding to the matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, the dimension of the all zero square matrix and the unit matrix being equal; the compiled code module is based on the basic matrix used for LDPC encoding Performing LDPC encoding on the encoded information sequence, and/or performing LDPC decoding on the data sequence to be decoded according to the basic matrix used in the LDPC encoding, so that the basis used for determining the LDPC encoding from the parent base matrix set by using the above scheme can be seen.
  • Matrix the elements in the basic matrix used in LDPC encoding are divided into a first type element and a second type element, the first type element and the second type element respectively have corresponding matrices, and then are compiled according to the basic matrix used in LDPC encoding.
  • the code enables the LDPC encoding code to support flexible code length and code rate, thus improving the flexibility of the LDPC encoding and decoding process, thereby solving the correlation. Intraoperative LDPC encoding and decoding process lacks flexibility issues.
  • the determining module 32 is configured to: determine a basic matrix used by the LDPC encoding according to the preset parameter, where the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, a user UE type, a frequency band, and a code rate.
  • the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, a user UE type, a frequency band, and a code rate.
  • R combination of transport block size TBS and code rate R, channel type, data transmission direction, combination of TBS index number and resource unit number NRB, combination of MCS index number and resource unit number NRB, code rate R and number of resource units NRB Combination, bandwidth size.
  • the transport block size TBS is an integer greater than 0;
  • the application scenario includes: eMBB, URLLC, and mMTC;
  • the frequency band includes: a frequency range configured by the system;
  • the code rate R is a real number greater than 0 and less than 1;
  • the channel type includes The control channel and the data channel;
  • the data transmission direction includes: uplink data and downlink data;
  • the TBS index number is used to indicate the corresponding transport block size TBS in combination with the number of resource units, and the TBS index number is an integer greater than or equal to 0;
  • the MCS index number is an integer greater than or equal to 0;
  • the resource unit number NRB is the number of resource blocks configured by the system;
  • the bandwidth size is a real number greater than zero.
  • the transport block size TBS is an element in the TBS set TBSSet, wherein the TBS set includes A1 TBS sub-sets TBSsubset i , and the parent base matrix set includes A1 parent base matrix sub-sets Hb i , each The TBS sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between two A2 TBS subsets, and all A1 TBS sub-sets form a complete TBS set, i is 0 to A1-1 integer; determining module 32 is used for: determining a transport block size TBS TBS belongs to the subset TBSsubset i, and then determining the TBS based matrix corresponding subset TBSsubset i subset Hb i.
  • the code rate R is an element in the code rate set of all code rate sets, wherein the code rate set includes a2 code rate Coderate i , i is an integer between 0 and A2-1, and the parent base matrix
  • the set includes A2 basic matrix subsets Hb i , each code rate corresponding to a basic matrix subset; wherein all A2 code rates constitute a complete code rate set of all code rate sets, A2 is an integer greater than 1;
  • determining module 32 is set to: determine a rate equal to the rate R coderate i, and then determining the rate based matrix corresponding subset coderate i Hb i.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the common mother base matrix set includes A3 parent base matrix subsets Hb i , and each frequency band corresponds to one basic matrix Subset; wherein there is no intersection between two of the A3 frequency bands, all A3 frequency bands form a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is an integer between 0 and A3-1; 32 is set to: determine an index that belongs to the frequency band set FBSet with the frequency band, and then determine a basic matrix subset Hb i corresponding to the frequency band.
  • the corresponding basic matrix is selected from the basic matrix subset Hb i corresponding to the TBS subset TBSsubset i according to the actual coding rate or the combination of the transport block size TBS and the LDPC codeword size.
  • the set of the parent base matrix comprises: a base matrix subset used for data encoding and a base matrix subset used for signaling encoding, and the determining module 32 is configured to: determine a channel type, and then determine a basic matrix subset corresponding to the channel type.
  • the set of the parent base matrix includes: a basic matrix subset used by the uplink transmission data and a basic matrix subset used by the downlink transmission data, and the determining module 32 is configured to: determine a data transmission direction, and then determine a basic matrix corresponding to the data transmission direction. Subcollection.
  • the parent base matrix set includes A4 basic matrix subsets, and the dimension of the ith base matrix subset of the A4 base matrix subsets is: the number of matrix columns is NBi, and the number of matrix rows is MBi, respectively.
  • a column index set Colset composed of all column indexes of all the basic matrix sub-sets, a first column index set ColsetX and a second column index set ColsetY, the first column index set and the second column index set have no intersection, And the two subsets are not empty, the first column index set and the second column index set are both subsets of Colset, when the column index j belongs to the first column index set,
  • the second class element of the jth column of each basic matrix subset belongs to the same set EleSetj, wherein the number of elements of the second type of EleSetj is less than or equal to the maximum value of the column weight of the jth column of all basic matrix subsets;
  • the column index j belongs to the second column index set, and the number of the second class elements of the intersection of the jth column of the first basic matrix sub-set and the j-th column of the second basic matrix sub-set in any two basic matrix sub-sets is less than or equal to 2
  • A4 1 a row index set Rowset composed of all row indexes of the basic matrix subset, a first row index set RowsetX and a second row index set RowsetY, j and k are the first row index set Any two elements, the jth row and the kth row in the base matrix subset are orthogonal; the first row index set RowsetX and the second row index set RowsetY have no intersection, and the two subsets are not empty, the first The row index set RowsetX and the second row index set RowsetY are both subsets of Rowset; the jth row and the kth row are orthogonal to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the second type of element is used to be used to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the number of matrix columns whose columns are greater than 1 is a positive integer greater than 2 5 -10 and less than 2 5 .
  • all second class element values in any of the check columns of any one of the base matrix subsets in the parent base matrix set are equal to zero.
  • any one of the basic matrix subsets in the parent base matrix set is orthogonal to any consecutive L1 row from the L0 row to the last row, and the L1 row orthogonal is at most L1 element values of any column index in the L1 row.
  • a second type of element value, L0 is an integer greater than or equal to 0 and less than 5.
  • L1 is an integer greater than 0 and less than 5.
  • the column weights of the basic matrix subsets corresponding to the variable nodes with girth of 6 are less than or equal to the basic matrix subsets corresponding to the variable nodes with girth of 4. Column weight.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, and the i-th of the basic matrix subset
  • the code length corresponding to the base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the basic matrix subsets corresponding to the variable nodes with the girth of 6. Column weight.
  • the second type of elements of all the base matrices in any one of the base matrix sub-sets of the parent base matrix set are the same.
  • all of the base matrices in any one of the base matrix subsets of the parent base matrix set support the same code rate.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support different code lengths
  • the second type of elements in the base matrix supporting different code lengths are calculated according to the spreading factor and a certain expansion factor. obtain.
  • the determined spreading factor is a spreading factor corresponding to a maximum code length supported by all the basic matrices in any one of the basic matrix sub-sets of the set of the parent base matrix.
  • any one of the basic matrix sub-sets of the set of the parent base matrix supports multiple code rates, where each code rate corresponds to one basic matrix, where there are x of the two basic matrices corresponding to any two code rates.
  • One type of element has different positions; or any one of the basic matrix sub-sets of the parent base matrix set supports multiple code lengths, wherein each code length corresponds to one basic matrix, and two bases corresponding to any two code lengths
  • x first class elements in the matrix with different positions and x is an integer greater than 0 and less than 10.
  • the parent base matrix set includes multiple basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute a column of the column index set ColSet.
  • the index set can be divided into two sub-collections Colsubset1 and Colsubset2, wherein Colsubset1 and Colsubset2 are complementary to each other, Colsubset1 has Ci elements, Colsubset2 has Di elements, and i is used to indicate a basic matrix Hbi corresponding to a specific code length, Hbi
  • the sub-base matrix of all the row indexes in all the base matrix Hbi and the column index joints of all Colsubset1 is Hbi(:, Colsubset1)
  • the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi pass through the matrix.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the modules are located in multiple In the processor.
  • FIG. 4 is a structural block diagram of an LDPC codec according to an embodiment of the present disclosure. As shown in FIG. 4, the LDPC codec includes:
  • the processing chip 42 is configured to determine, from the set of the parent base matrix, the basic matrix used in the LDPC encoding, where the basic matrix used in the LDPC encoding includes: a first class element and a second class element, where the first class element corresponds to the whole a zero square matrix, the second type of element corresponding to the matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, the dimension of the all zero square matrix and the unit matrix is equal, and the set of the mother base matrix includes at least one basic matrix;
  • An encoder 44 coupled to the processing chip 42, for LDPC encoding the sequence of information to be encoded according to the base matrix used by the LDPC encoding; and/or a decoder 46 coupled to the processing chip 42 for use in accordance with LDPC encoding
  • the basic matrix performs LDPC decoding on the decoded data sequence.
  • the processing chip 42 is configured to: determine a basic matrix used by the LDPC encoding according to the preset parameter, where the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, a user UE type, a frequency band, and a code rate.
  • the preset parameter includes at least one of the following: a transport block size TBS, an application scenario, a user UE type, a frequency band, and a code rate.
  • R combination of transport block size TBS and code rate R, channel type, data transmission direction, combination of TBS index number and resource unit number NRB, combination of MCS index number and resource unit number NRB, code rate R and number of resource units NRB Combination, bandwidth size.
  • the transport block size TBS is an integer greater than 0;
  • the application scenario includes: eMBB, URLLC, and mMTC;
  • the frequency band includes: a frequency range configured by the system;
  • the code rate R is a real number greater than 0 and less than 1;
  • the channel type includes The control channel and the data channel;
  • the data transmission direction includes: uplink data and downlink data;
  • the TBS index number is used to indicate the corresponding transport block size TBS in combination with the number of resource units, and the TBS index number is an integer greater than or equal to 0;
  • the MCS index number is an integer greater than or equal to 0;
  • the resource unit number NRB is the number of resource blocks configured by the system;
  • the bandwidth size is a real number greater than zero.
  • the transport block size TBS is an element in the TBS set TBSSet, where the TBS set includes A1 TBS sub-sets TBSsubset i , and the simultaneous parent base matrix set includes A1 basic matrix sub-sets Hb i , each TBS The sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between two pairs of A1 TBS subsets, all A1 TBS sub-sets form a complete TBS set, and i is 0 to A1-1 an integer between; processing chip for: determining a transport block size TBS TBS belongs to the subset TBSsubset i, and then determining the TBS based matrix subset TBSsubset i corresponding subset Hb i.
  • the corresponding basic matrix is selected from the basic matrix subset Hb i corresponding to the TBS subset TBSsubset i according to the actual coding rate or the combination of the transport block size TBS and the LDPC codeword size.
  • the code rate R is an element in the code rate set of all code rate sets, wherein the code rate set includes a2 code rate Coderate i , i is an integer between 0 and A2-1, and the parent base matrix
  • the set includes A2 basic matrix subsets Hb i , each code rate corresponding to a basic matrix subset; wherein, all A2 code rates constitute a complete code rate set of all code rate sets, A2 is an integer greater than 1; processing chip is used for : determining a rate equal to the rate R coderate i, and then determining the rate based matrix corresponding subset coderate i Hb i.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the primary mother base matrix set includes A3 basic matrix subsets Hb i , and each frequency band corresponds to one basic matrix Set; among them, there is no intersection between two of the A3 frequency bands, all A3 frequency bands constitute a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is an integer between 0 and A3-1; And: determining an index that belongs to the frequency band set FBSet, and then determining a basic matrix subset Hb i corresponding to the frequency band.
  • the set of the parent base matrix includes: a basic matrix subset set used for data encoding and a basic matrix subset set used for signaling encoding, and determining a basic matrix used for LDPC encoding from the set of the parent base matrix, including: determining a channel type, A base matrix subset corresponding to the channel type is then determined.
  • the set of the parent base matrix includes: a basic matrix subset used by the uplink transmission data and a basic matrix subset used by the downlink transmission data, and determining a basic matrix used by the LDPC encoding from the parent base matrix set, including: determining data transmission Direction, and then determine the basic matrix subset corresponding to the data transmission direction.
  • the A2 code rates supported by the parent base matrix set each code rate corresponding to a base
  • the matrix subset, the code rate includes: R0, R1, ..., R (A2-1), and the corresponding basic matrix subsets are: Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ...
  • R(A2-1) ⁇ 1 the basic matrix used for LDPC encoding is determined, including: selecting a difference greater than or equal to R' from [R0, ..., R(A2-1)] and having a difference from R'
  • the minimum basic rate sub-set corresponding to a code rate R' is the actual code rate, R' is a real number greater than 0 and less than 1, and A2 is an integer greater than one.
  • the A2 code rates supported by the parent base matrix set each code rate corresponding to a basic matrix subset, the code rate includes: R0, R1, ..., R (A2-1), and the corresponding basic matrix subsets are respectively :Hb0, Hb1, ..., Hb(A2-1), where 0 ⁇ R0 ⁇ R1 ⁇ ... ⁇ R(A2-1) ⁇ 1; wherein the basic matrix used for LDPC encoding is determined, including: from [R0,... R(A2-1)] is a basic matrix subset corresponding to a code rate less than or equal to R' and having the smallest difference from R', R' is the actual code rate, and R' is greater than 0 and less than 1.
  • Real number, A2 is an integer greater than one.
  • the parent base matrix set includes A4 basic matrix subsets, and the dimension of the ith base matrix subset of the A4 base matrix subsets is: the number of matrix columns is NBi, and the number of matrix rows is MBi, respectively.
  • a column index set Colset composed of all column indexes of all the basic matrix sub-sets, a first column index set ColsetX and a second column index set ColsetY, the first column index set and the second column index set have no intersection, And the two subsets are not empty, the first column index set and the second column index set are both subsets of Colset, when the column index j belongs to the first column index set, and the jth column of each base matrix sub-collection
  • the second type of elements all belong to the same set EleSetj, wherein the number of elements of the second type of EleSetj is less than or equal to the maximum value of the column weight of the jth column of all the basic matrix sub-sets; when the column index j belongs to the second column index set, any two The intersection of the jth column of the first base matrix subset and the jth column of the second base matrix subset of the basic matrix subset.
  • the number of the second type of elements is less than or equal to 2, and the number of elements of the second type
  • A4 1 a row index set Rowset composed of all row indexes of the basic matrix subset, a first row index set RowsetX and a second row index set RowsetY, j and k are the first row index set Any two elements, the jth row and the kth row in the base matrix subset are orthogonal; the first row index set RowsetX and the second row index set RowsetY have no intersection, and the two subsets are not empty, the first The row index set RowsetX and the second row index set RowsetY are both subsets of Rowset; the jth row and the kth row are orthogonal to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the second type of element is used to be used to at most 1 of the 2 elements on any column index in the jth row and the kth row.
  • the number of matrix columns whose columns are greater than 1 is a positive integer greater than 2 5 -10 and less than 2 5 .
  • all second class element values in any of the check columns of any one of the base matrix subsets in the parent base matrix set are equal to zero.
  • any one of the basic matrix subsets in the parent base matrix set is orthogonal to any consecutive L1 row from the L0 row to the last row, and the L1 row orthogonal is at most L1 element values of any column index in the L1 row.
  • a second type of element value, L0 is an integer greater than or equal to 0 and less than 5
  • L1 is an integer greater than 0 and less than 5.
  • the column weights of the basic matrix subsets corresponding to the variable nodes with girth of 6 are less than or equal to the basic matrix subsets corresponding to the variable nodes with girth of 4. Column weight.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, and the i-th of the basic matrix subset
  • the code length corresponding to the base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the basic matrix subsets corresponding to the variable nodes with the girth of 6. Column weight.
  • the second type of elements of all the base matrices in any one of the base matrix sub-sets of the parent base matrix set are the same.
  • all of the base matrices in any one of the base matrix subsets of the parent base matrix set support the same code rate.
  • all the basic matrices in any one of the basic matrix subsets of the set of the parent base matrix support different code lengths
  • the second type of elements in the base matrix supporting different code lengths are calculated according to the spreading factor and a certain expansion factor. obtain.
  • the determined spreading factor is a spreading factor corresponding to a maximum code length supported by all the basic matrices in any one of the basic matrix sub-sets of the set of the parent base matrix.
  • any one of the basic matrix sub-sets of the set of the parent base matrix supports multiple code rates, where each code rate corresponds to one basic matrix, where there are x of the two basic matrices corresponding to any two code rates.
  • One type of element has different positions; or any one of the basic matrix sub-sets of the parent base matrix set supports multiple code lengths, wherein each code length corresponds to one basic matrix, and two bases corresponding to any two code lengths
  • x first class elements in the matrix with different positions and x is an integer greater than 0 and less than 10.
  • the parent base matrix set includes multiple basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute a column of the column index set ColSet.
  • the index set can be divided into two sub-collections Colsubset1 and Colsubset2, wherein Colsubset1 and Colsubset2 are complementary to each other, Colsubset1 has Ci elements, Colsubset2 has Di elements, and i is used to indicate a basic matrix Hbi corresponding to a specific code length, Hbi
  • the sub-base matrix of all the row indexes in all the base matrix Hbi and the column index joints of all Colsubset1 is Hbi(:, Colsubset1)
  • the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi pass through the matrix.
  • the extension obtains a parity check matrix HL1i, the girth of the parity check matrix HL1i is g; all the row indexes and all of the base matrix Hbi
  • the sub-base matrix indicated by the column index joint of Colsubset2 is Hbi(:, Colsubset2), and the parity matrix HL2i is obtained by matrix expansion in combination with Hbi(:, Colsubset2) and the boost value Zi, and the girth of the parity check matrix HL2i is g- 2.
  • the method proposed in this alternative embodiment may be used in an LTE mobile communication system or a future fifth generation mobile communication system or other wireless wired communication system, and the data transmission direction is that the base station transmits data (downlink transmission service data) to the mobile user, or The data transmission direction is that the mobile user transmits data to the base station (uplink transmission service data).
  • Mobile users include: mobile devices, as access terminals, user terminals, subscriber stations, subscriber units, mobile stations, remote stations, remote terminals, user agents, user devices, user equipment, or some other terminology.
  • the base station includes an access point (AP), or may be referred to as a Node B, a Radio Network Controller (RNC), an Evolved Node B (eNB), a Base Station Controller (BSC), and a base transceiver station.
  • AP access point
  • RNC Radio Network Controller
  • eNB Evolved Node B
  • BSC Base Station Controller
  • BTS base transceiver station
  • BS base station
  • TF transceiver function
  • radio router radio transceiver
  • BSS Basic service Service Unit
  • ESS Extended Service Unit
  • RBS Radio Base Station
  • the optional embodiment provides a structured LDPC code construction method, which is applied to enhanced mobile broadband in New Radio Access Technology (New Radio Access Technology, referred to as new RAT) (enhanced Mobile Broadband (referred to as eMBB) scenario, Ultra-Reliable and Low Latency Communications (URLLC) scenario or Massive Machine Type Communications (MMTC) scenario.
  • New Radio Access Technology referred to as new RAT
  • eMBB enhanced Mobile Broadband
  • URLLC Ultra-Reliable and Low Latency Communications
  • MMTC Massive Machine Type Communications
  • the maximum downlink throughput in the eMBB scenario can reach 20 Gbps, and the maximum throughput of the uplink data can reach 10 Gbps.
  • the BLER Block Error Rate
  • mMTC enables the device battery to be used for years without power.
  • the transmitting end needs to send the data sequence whose transmission length is 8192 bits to be transmitted to the receiving end.
  • the transmitting end and the receiving end are not limited to the above types, the channel coding rate is 2/3, and the channel coding adopts the structured LDPC code.
  • 8 basic matrices constitute 4 basic matrix sub-sets, such as HB0 and HB1 as a basic matrix sub-set 0, HB2 and HB3 as a basic matrix sub-set 1, HB4 and HB5 as a basic matrix sub-set 2, HB6 and HB7 is used as a basic matrix sub-set 3.
  • the expansion factors corresponding to the four basic matrix sub-sets are: [512 256 128 64].
  • D 8
  • the element values in the matrix are all smaller than the spreading factor, wherein the matrix column number NBi, the matrix row number MBi, the matrix system column number KBi, the code rate Ri, and the spreading factor Zi are as shown in Table 1.
  • the above basic matrix includes a first type element and a second type element, wherein the first type element value is represented by '-1', and the second type element value is represented by an integer value of 0 to Z-1, One type of element corresponds to an all-zero square matrix, and the second type of element corresponds to a matrix obtained by cyclically shifting the unit matrix corresponding to the value of the second type of element, and the dimensions of the all-zero square matrix and the unit array are equal.
  • the parity check matrix of the LDPC code can be obtained by replacing the first type element and the second type element with a corresponding all-zero square matrix or a unit matrix shift matrix.
  • FIG. 5 is a flowchart of a method for encoding an LDPC code of a transmitting end according to an alternative embodiment of the present disclosure. As shown in FIG. 5, the process includes the following steps:
  • Step S502 code block segmentation, performing code block segmentation on the data sequence to be transmitted having a length of 8192 bits, and obtaining 2 pieces of information sequence to be encoded having a length of 4096 bits respectively.
  • the combination determines the underlying matrix used for decoding.
  • Step S508 modulation transmission, LDPC-encoded 12288 codeword bits are constellation modulated, for example, modulated by QPSK (Quadrature Phase Shift Keying) into constellation symbols, and mapped to corresponding resource blocks allocated by the system, and transmitted.
  • QPSK Quadrature Phase Shift Keying
  • the receiving and decoding process of the flexible structured LDPC code at the receiving end includes the following steps: S0, receiving and receiving the received data, receiving the data sent to the receiving end from the resource block configured by the system, and then performing demodulation into LLR ( Log Likelihood Ratio (Log Likelihood Ratio) information, a total of 12288 LLR information; S1, LDPC encoding, 12288 LLR information decoding block segmentation to obtain 2 LDPC code blocks LLR information length of 6144 to be decoded data sequence And performing LDPC decoding on two data sequences to be decoded to obtain two decoding sequences of length 4096 bits, wherein the basic matrix method used for selecting decoding from the mother code basic matrix set is the same as the above method, according to the transport block
  • the combination of the size TBS (or described as the coding block size) and the coding rate R determines the basis matrix used for decoding; S2, decodes the block partition, and combines the decoded sequences of 4096 bits of the de
  • the transport block with a transport block size of 8192 bits, it can also be used.
  • the base matrix of the third basic matrix set is used for encoding.
  • the so-called shortening is to fill some dummy bits in the data to be encoded, and the dummy bits can be any known bits such as 0 or 1.
  • the parent base matrix set can support the coding block length of any bit length, that is, the flexibility problem can be effectively solved.
  • the code rate is not equal to 1/2 and 2/3 of Table 1 above, if the code rate is higher than 2/3, the base matrix with the reference code rate of 2/3 is used for encoding, and some bits are punched out. Puncting off some bits means removing some bits (which may be system bits or parity bits) in the LDPC code block, so that codewords with an arbitrary code rate greater than 2/3 can be supported, and the code rate is 1/2. Between 2/3, the base matrix with a reference code rate of 1/2 can be used for coding, and some bits are obtained by puncturing.
  • the flexible structured LDPC coding method can support flexible code length and code rate design, and is very suitable for channel coding schemes for communication systems.
  • the base matrix larger than the reference code rate of the actual coding rate R may be selected for encoding.
  • the coding method uses shortened coding, and an encoded codeword lower than the reference code rate can also be obtained, as above.
  • a base matrix of a reference code rate of 1/2 may be used, a partial padding bit is added to the sequence to be encoded, and then coded, and then the padding bit is removed. It can be seen that the actual code rate will be lower than the reference code rate by 1/2.
  • the implementation method for realizing different code rates is not limited to the above.
  • the basic matrix used in the LDPC encoding is determined from the set of the parent base matrix, and the basic matrix used in the LDPC encoding is determined according to at least one of the following parameters: a transport block size TBS, an application scenario, a user UE type, a frequency band, and a transport block size TBS.
  • TBS is an integer greater than 0;
  • the application scenario includes eMBB, URLLC, and mMTC;
  • the user UE type includes at least the following two types: a high-speed UE, a low-speed UE, an IR-HARQ-capable UE, an IR-HARQ-free UE, a low-latency UE, and a large-throughput UE;
  • the frequency band includes a frequency range configured by the system;
  • the code rate R is a real number greater than 0 and less than 1;
  • the channel type includes a control channel and a data channel;
  • the data transmission direction includes uplink data and downlink data;
  • the TBS index number is a transport block size TBS for indexing each resource number, and a TBS index number.
  • the MCS index number is used to index the MCS scheme, the MCS index number is an integer greater than or equal to 0;
  • the resource number NRB is the number of resource blocks configured by the system;
  • the bandwidth size is a real number greater than 0.
  • the transport block size TBS is an integer value in the TBS set, where the TBS set includes A sub-sets, and the sub-set index number is obtained in the TBS set according to the transport block size TBS, and is determined according to the obtained sub-set index number.
  • a basic matrix sub-set used by LDPC coding wherein A is an integer greater than 0, and the base matrix subset includes at least one base matrix, and the transport block size TBS is pre-configured by the system and is an integer greater than zero.
  • One basic matrix used for LDPC coding is selected from the basic matrix subset according to the code rate R.
  • the frequency band is divided into at least B frequency bands: 0 to C1 GHz frequency band, C1 GHz to C2 GHz frequency band, ..., C (B-2) GHz to C (B-1) GHz frequency band, and greater than C (B-1) GHz frequency band
  • B is an integer greater than 0, C1, C2, ..., C(B-1) are real numbers greater than 0, and C1 ⁇ C2 ⁇ C3 ⁇ ... ⁇ C(B-1).
  • the method proposed in this alternative embodiment may be used in an LTE mobile communication system or a future fifth generation mobile communication system or other wireless wired communication system, and the data transmission direction is that the base station transmits data (downlink transmission service data) to the mobile user, or The data transmission direction is that the mobile user transmits data to the base station (uplink transmission service data).
  • the above communication system may also be a new radio access technology (NR) system.
  • the NR system includes the following application scenarios: enhanced mobile broadband (eMBB) scenario, ultra-reliable low latency. Communication (Ultra-Reliable and Low Latency Communications, referred to as URLLC) scenarios and massive machine type communications (MMTC) scenarios.
  • the system is configured to configure three basic matrix sub-sets in the scenario of the above three, that is, the parent base matrix set includes the above three basic matrix sub-sets, for example, the base matrix sub-set 0 for the eMBB scenario, and the URL LC scenario for the URLLC scenario.
  • the base matrix sub-set 1 is used as the base matrix sub-set 2 for the mMTC scene.
  • the data volume of the eMBB scenario is very large and needs to support large-throughput data transmission.
  • the data in the URLLC scenario needs to support ultra-high reliability and ultra-low latency communication.
  • the data volume is small and can communicate in the first time.
  • the real-time requirement is very high; mMTC needs Large coverage, small amount of data, no real-time communication.
  • the system is configured to provide the basic matrix set in the three application scenarios as follows. A total of three basic matrix sub-sets are included, and each sub-set includes one basic matrix, which is described as follows:
  • the base matrix HB1 of the URLLC scenario has a maximum expansion factor of 128:
  • the above basic matrix is not limited to the above-described basic matrix, and can also be described as a basic matrix of other arbitrary dimensions and data sizes.
  • the sender needs to support one of the above scenarios, and the receiver also needs to support one of the above scenarios.
  • the above-mentioned transmitting end is the base station side, and supports the above three kinds of scenarios.
  • the receiving end (terminal) supports only one of the application scenarios, if the transmitting end is to communicate with the receiving end (terminal), then the above needs to be adopted.
  • the same communication mode of the receiving end (terminal) that is, structured LDPC encoding using the basic matrix in the same application scenario.
  • the terminal A For example, if the terminal A only supports the eMBB application scenario, the terminal sends a corresponding command to the base station, where the command includes at least 2 bits for indicating at least the application scenario of the terminal, for example, the '00' indication.
  • the terminal sends the command '00' to the base station, and then communicates with the base station, using the basic matrix HB0 (the 0th base matrix) as described above. Subcollection).
  • the data is subjected to code block partitioning, a structured LDPC encoding base matrix, LDPC encoding, modulation, and transmission.
  • the explanation of the above signaling on the base station side is consistent with the terminal side. The above signaling is not limited to the above form.
  • the application scenario can be arbitrarily changed as needed. At that time, the application scenario changed, and the base station side needs to be notified, that is, the command is sent, and then the communication is performed. It can be seen from the basic matrices in the above three application scenarios that the positions of the non-1 elements (the second type of elements) in the three basic matrices are the same, and the maximum expansion factor is a positive integer multiple relationship, which is beneficial.
  • the structured LDPC code can be a unified decoder, and can be mutually compatible, so that the devices of the above three application scenarios can share the same device and simplify hardware resources.
  • the base station side determines the basic LDPC coding basic matrix sub-set according to the application scenario data type that the terminal user (UE) needs to transmit (there is only one basic matrix in the sub-set in this embodiment), and then selects according to the transport block size to be transmitted.
  • the modified basic matrix refers to modifying the second type element in the basic matrix to fit the current LDPC coding and the corresponding expansion factor.
  • the application scenario in this embodiment is not limited to the above three types, and may also include other high-speed mobile scenarios, real-time communication application scenarios, large-throughput data transmission scenarios, and the like, and is not limited to these scenarios, and may be corresponding to each scenario.
  • the method proposed in this alternative embodiment may be used in an LTE mobile communication system or a future fifth generation mobile communication system or other wireless wired communication system, and the data transmission direction is that the base station transmits data (downlink transmission service data) to the mobile user, or Data transmission direction for mobile users Send data to the base station (uplink transmission service data).
  • the LDPC code encoding basic matrix subset is determined according to the user UE type.
  • the user UE types include: a high speed UE, a low speed UE, a UE supporting incremental redundancy hybrid automatic retransmission (IR-HARQ), a UE not supporting IR-HARQ, a low latency UE, and a large throughput UE.
  • the user UE type may be at least 2 of the all types, and is not limited to the user UE type described above.
  • the system is configured to provide one basic matrix subset for each user UE type, for example, the following two types: a UE supporting IR-HARQ and a UE not supporting IR-HARQ.
  • the basic matrix sub-set adopted by the UE supporting IR-HARQ is HB0, which includes 4 basic matrices; the basic matrix sub-set adopted by the UE not supporting IR-HARQ is HB1, which includes 4 basic matrices.
  • the receiving end sends an instruction to notify the transmitting end that the data supporting the IR-HARQ can be sent, and the data sent by the transmitting end to the receiving end supports IR-HARQ, that is, the data is encoded by using the basic matrix supporting IR-HARQ. That is, when determining the basic matrix used by the LDPC encoding, the transmitting end selects an appropriate basic matrix from the basic matrix subsets supporting IR-HARQ for encoding; and if the receiving end indicates that IR-HARQ is not supported, the transmitting end determines the LDPC encoding. When the basic matrix is used, an appropriate basic matrix is selected from the basic matrix subsets that do not support IR-HARQ for encoding.
  • the beneficial effect of such operation is that the communication system can support different UE types, some UEs do not need to improve the performance of retransmitted data or are relatively low-end, then they may not support IR-HARQ data, and if some UEs may be relatively high-end or technology More advanced, support IR-HARQ data, making the system more flexible and diverse.
  • the UE supporting the IR-HARQ and the UE not supporting the IR-HARQ can still share a set of devices, that is, the first transmission data is identical, but the transmission data is different, and the retransmission data supporting the IR-HARQ is relatively different. Multi-check bit data, and retransmission data that does not support IR-HARQ is the same as the first pass data.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • the parent base matrix set includes multiple basic matrix subsets, wherein any one of the basic matrix subsets ⁇ Hbi ⁇ includes s basic matrices, and all column indexes of any one of the basic matrices Hbi constitute
  • the column index set ColSet the column index set may be divided into two sub-collections Colsubset1 and Colsubset2, wherein the Colsubset1 and Colsubset2 are complementary to each other, the Colsubset1 has Ci elements, and Colsubset2 has Di elements, i
  • the sub-base matrix of all the row indexes in all the basic matrices Hbi and the column index joints of all Colsubset1 are Hbi(:, Colsubset1), and the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi pass through the matrix.
  • the column index set ColSet may further be divided into a third sub-collection Colsubset3 and a fourth sub-collection Colsubset4, where the Colsubset3 and the Colsubset4 are complementary to each other, the Colsubset1 includes the Colsubset3, and the Colsubset4 includes The Colsubset2, the Colsubset3 has Ei elements, the Colsubset4 has Fi elements, and Ei and Fi are integers greater than or equal to 1, wherein any element k and Colsubset3 in the Colsubset2 constitute a set Colsubset5, wherein The sub-base matrix of all the row indexes and the column index joint indications of all Colsubset 5 is Hbi (:, Colsubset 5), and the matrix is expanded by matrix expansion to obtain a parity check matrix HL3i in combination with Hbi (:, Colsubset 5) and the spreading factor Zi.
  • Each expansion factor is taken from the extension factor set Zset.
  • the method for obtaining each basic matrix adopts the following formula:
  • the sub-base matrix of all the row indexes in all the basic matrices Hbi and the column index joints of all Colsubset1 are Hbi(:, Colsubset1), and the sub-base matrix Hbi(:, Colsubset1) and the spreading factor Zi pass through the matrix.
  • the extension obtains a parity check matrix HL1i, the girth of the parity check matrix HL1i is g; the sub-base matrix of all the row indexes in the base matrix Hbi and the column index joints of all Colsubset2 are Hbi(:, Colsubset2), Combining Hbi(:, Colsubset2) and the boost value Zi to obtain a parity check matrix HL2i through matrix expansion, the girth of the parity check matrix HL2i is g-2, and all the expansion factors supported by the basic matrix subset are related.
  • the column index set ColSet may further be divided into a third sub-collection Colsubset3 and a fourth sub-collection Colsubset4, where the Colsubset3 and the Colsubset4 are complementary to each other, the Colsubset1 includes the Colsubset3, and the Colsubset4 includes The Colsubset2, the Colsubset3 has Ei elements, the Colsubset4 has Fi elements, and Ei and Fi are integers greater than or equal to 1, wherein any element k and Colsubset3 in the Colsubset2 constitute a set Colsubset5, wherein The sub-base matrix of all the row indexes and the column index joint indications of all Colsubset 5 is Hbi (:, Colsubset 5), and the matrix is expanded by matrix expansion to obtain a parity check matrix HL3i in combination with Hbi (:, Colsubset 5) and the spreading factor Zi.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • the bipartite graph corresponding to the parity check matrix of any one of the basic matrix sub-sets has at least one short circle with a girth of 4; the basic matrix sub-collection
  • the code length corresponding to the i-th base matrix is Ni
  • the column weight of the basic matrix subset corresponding to the variable node with the girth of 6 is less than or equal to the variable node corresponding to the girth of 4.
  • the spreading factor of the LDPC code of (s-1), K0, K1, ..., and K(s-1) are positive integers of 1 or more.
  • the bipartite graph of the parity check matrix of any one of the basic matrix sub-sets of the parent base matrix set has at least one short circle with a girth of 6 and a short circle with no girth of 4, the basic matrix subset
  • the code length corresponding to the i-th base matrix is Ni
  • the number of variable nodes corresponding to the code length Ni girth is 6,
  • the number of variable nodes corresponding to the code length Ni girth 8
  • the column weights of the basic matrix subsets corresponding to the variable nodes with the girth of 8 are less than or equal to the variable nodes corresponding to the girth of 6.
  • a parent base matrix set includes one basic matrix subset
  • the one basic matrix subset includes the basic matrix of 26 different spreading factors.
  • the basic matrix corresponding to the maximum spreading factor of 1280 is as follows:
  • Each expansion factor is taken from the extension factor set Zset.
  • the method for obtaining each basic matrix adopts the following formula:
  • the different column indices in the matrix are 0 to 25. For example, if the last row corresponds to a spreading factor of 8, the number of columns corresponding to the base matrix with the expansion factor of 8 is 4, and the number of columns with a girth of 6 is 5, and the rest is girth of 22; The corresponding code length increases), the number of columns with girth of 4 is gradually reduced, and the number of columns with girth of 6 is gradually increased.
  • the number of girths can also be described as a spreading factor, and it can be found that the girth of each column in the basic matrix satisfies the relationship described above.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding Determining, from the set of the parent base matrix, a base matrix used for low-density parity check LDPC coding, where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, and the second class element corresponds to a single a matrix obtained by cyclically shifting a matrix according to values of the second type of elements, the dimensions of the all-zero square matrix and the unit matrix being equal;
  • determining the basic matrix used by the LDPC encoding from the set of the parent base matrix comprises: determining a basic matrix used by the LDPC encoding according to a transport block size TBS.
  • the transport block size TBS is an element in a TBS set TBSSet, wherein the TBS set includes A1 TBS sub-sets TBSsubset i , and the parent base matrix set includes A1 basic matrix sub-sets Hb i ,
  • the TBS sub-sets correspond to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between the two ATS TBS subsets, and all A1 TBS sub-sets form a complete set of the TBS, i is An integer between 0 and A1-1; determining the base matrix used by the LDPC encoding from the set of the parent base matrix, comprising: determining the TBS subset TBSsubset to which the transport block size TBS belongs i, and then determining the TBS subset TBSsubset
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • determining, from the set of the parent base matrix, the basic matrix used by the LDPC encoding comprises: determining a basic matrix used by the LDPC encoding according to a code rate R.
  • the code rate R is an element in the code rate set of all code rate sets, wherein the code rate set includes a2 code rate Coderate i , i is an integer between 0 and A2-1, and the mother
  • the basic matrix set includes A2 basic matrix subsets Hb i , each code rate corresponding to one basic matrix subset; wherein, all A2 code rates constitute a complete code rate set of all the code rate sets, and A2 is an integer greater than 1;
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • determining, from the set of the parent base matrix, the basic matrix used by the LDPC encoding comprises: determining a basic matrix used by the LDPC encoding according to a frequency band.
  • the frequency band is an element in all frequency band sets FBSet, wherein the frequency band set FBSet includes A3 frequency bands, and the mother basic matrix set includes A3 basic matrix subsets Hb i , and each frequency band corresponds to a basic a matrix subset; wherein there is no intersection between two of the A3 frequency bands, all A3 frequency bands constitute a complete set of all frequency bands FBSet, A3 is an integer greater than 1, and i is an integer between 0 and A3-1 In the frequency band, if the carrier frequency of the signal is within the corresponding frequency range, the basic matrix subset of the corresponding frequency band is considered to be used.
  • Determining the basic matrix used by the LDPC encoding from the set of the parent base matrix includes: determining an index that belongs to the frequency band set FBSet with the frequency band, and then determining a basic matrix subset Hbi corresponding to the frequency band.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • determining the basic matrix used by the LDPC encoding from the set of the parent base matrix comprises: determining a base matrix used by the LDPC encoding according to a channel type.
  • the channel types include: a data channel and a signaling channel.
  • the set of the parent base matrix includes: a base matrix subset set used for data encoding and a base matrix subset set used for signaling encoding, and determining the base matrix used by the LDPC encoding from the set of the parent base matrix includes: Determining the channel type and then determining a base matrix subset corresponding to the channel type.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix equal;
  • Determining, from the set of the parent base matrix, the basic matrix used by the LDPC encoding comprising: determining a base matrix used by the LDPC encoding according to a data transmission direction.
  • the parent base matrix set includes: a base matrix subset used for uplink transmission data and a basic matrix subset used for downlink transmission data, where the base matrix used by the LDPC encoding is determined from the parent base matrix set,
  • the method includes: determining the data transmission direction, and then determining a basic matrix subset corresponding to the data transmission direction.
  • This embodiment provides an LDPC coding and decoding method, which can be used in an NR (New Radio Access Technology) communication system, and includes the following steps:
  • a base matrix used for low-density parity check LDPC coding where the basic matrix used in the LDPC coding includes: a first class element and a second class element, the first The class element corresponds to an all-zero square matrix, the second class element corresponding to a matrix obtained by cyclically shifting the unit matrix according to the value of the second class element, the all-zero square matrix and the dimension of the unit matrix Equal
  • the transport block size TBS is an element in a TBS set TBSSet, where the TBS set includes A1 TBS sub-sets TBSsubset i , and the parent base matrix set includes A1 basic matrix sub-sets Hb i Each TBS sub-set corresponds to a basic matrix sub-set; wherein A1 is an integer greater than 1, and there is no intersection between the two ATS TBS subsets, and all A1 TBS sub-sets constitute a complete TBS set.
  • i is an integer between 0 and A1-1;
  • Determining the basic matrix used by the LDPC encoding from the set of the parent base matrix includes: determining the TBS subset TBSsubset i to which the transport block size TBS belongs, and then determining the TBS sub-set TBSsubset i corresponds to a subset of the base matrix Hb i.
  • the actual code rate is indicated by the MCS index of the system or indicated by the CQI or is indicated by the system signaling;
  • the block size TBS is a value jointly indicated by the TBS index and the number of resource units NRB, and the LDPC codeword size is based on Calculated by resource particles and modulation orders in the number of resource units NRB, which may be subcarriers or other data carrying 1 constellation symbol, the modulation order being an integer, such as QPSK (Quadrature Phase Shift Coding) , Quadrature Phase Shift Keying) modulation is 2, 16QAM (Quadrature Amplitude Modulation) modulation is 4, 32QAM modulation is 5, 64QAM modulation is 6, 128QAM modulation is 7, 256QAM modulation is 8, 512QAM modulation is
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present disclosure which is essential or contributes to the related art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, CD-ROM).
  • the instructions include a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present disclosure.
  • Embodiments of the present disclosure also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • S1 determining a basic matrix used by the LDPC encoding from the set of the parent base matrix, where the basic matrix used in the LDPC encoding includes: a first type element and a second type element, where the first type element corresponds to an all zero square matrix, The second type of element corresponds to a matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, and the dimensions of the all zero square matrix and the unit array are equal;
  • S2 Perform LDPC encoding on the coded information sequence according to the basic matrix used in the LDPC encoding, and/or perform LDPC decoding on the data sequence to be decoded according to the basic matrix used in the LDPC encoding.
  • the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • a mobile hard disk e.g., a hard disk
  • magnetic memory e.g., a hard disk
  • the processor executes the method steps described in the foregoing embodiments according to the stored program code in the storage medium.
  • modules or steps of the present disclosure described above can be implemented by a general-purpose computing device, which can be centralized on a single computing device, or Distributed over a network of computing devices, optionally, they may be implemented in program code executable by the computing device, such that they may be stored in the storage device for execution by the computing device, and in some cases
  • the steps shown or described may be performed in a different order than that herein, or they may be separately fabricated into individual integrated circuit modules, or a plurality of the modules or steps may be implemented as a single integrated circuit module.
  • the disclosure is not limited to any specific combination of hardware and software.
  • the basic matrix used for LDPC encoding is determined from the set of the parent base matrix, wherein the basic matrix used in the LDPC encoding includes: a first class element and a second class element, the first class element corresponding to the all zero square Array, the second type of element corresponds to a matrix obtained by cyclically shifting the unit matrix according to the value of the second type of element, and the dimensions of the all-zero square matrix and the unit array are equal; according to the basic matrix used in the LDPC encoding, the sequence of the information to be encoded is performed.
  • LDPC coding and/or LDPC decoding of the data sequence to be decoded according to the basic matrix used in LDPC coding, so that the LDPC coding code supports flexible code length and code rate, improves the flexibility of the LDPC coding and decoding process, and solves the problem.
  • the LDPC encoding and decoding process lacks flexibility in the related art.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种准循环LDPC编译码方法、装置及LDPC编译码器，其中，该方法包括：从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵（S202），其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码（S204），解决了相关技术中LDPC编译码过程缺少灵活性的问题，提高了LDPC编译码过程的灵活性。

Description

准循环LDPC编译码方法、装置及LDPC编译码器 技术领域
本公开涉及通信领域，具体而言，涉及一种准循环LDPC编译码方法、装置及LDPC编译码器。
背景技术
图1是根据相关技术的数字通信系统的结构框图，如图1所示，数字通信系统中，一般包括三个部分：发送端、信道和接收端。发送端可对信息序列进行信道编码从而获取编码码字，对编码码字进行交织，并将交织后的比特映射成调制符号，然后可以根据通信信道信息来处理和发送调制符号。在信道中，由于多径、移动等因素导致特定的信道响应，这些都会使数据传输失真，同时由于噪声和干扰也会进一步恶化数据传输。接收端接收通过信道后的调制符号数据，此时的调制符号数据已经失真，需要进行特定处理才能恢复原始信息序列。
根据发送端对信息序列的编码方法，接收端可以对接收数据进行相应处理从而可靠地恢复原始信息序列。所述的编码方法必须是收发两端都是可见的。一般地，所述编码处理方法是基于前向纠错(Forward Error Correction，简称为FEC)编码，其中，前向纠错编码在信息序列中添加一些冗余信息。接收端可以利用该冗余信息来可靠地恢复原始信息序列。
在发送端，需要对待传输的传输块进行码块分割获得多份小传输块，然后对多份小传输块分别进行FEC编码，所述待传输的传输块的长度为TBS(Transport Block Size)，FEC编码码率一般定义为进入编码器的比特数目比上实际传输比特的比值。在LTE系统中，非常灵活的传输块大小可以支持LTE系统的各种包大小需求，以及采用调制编码方案(Modulation and Coding Scheme，简称为MCS)索引来指示不同调制阶数和编码码率R以及确定TBS索引，以及根据资源块(Resource Block)数目NRB和传输块大小(TBS)索引来确定在不同的传输块大小，所述资源块大小是连续 大小为12子载波在1个时隙上的资源，其中去除一些控制信号和参考信号所剩下的资源。信道类型中可以包括数据信道和控制信道，数据信道一般承载的是用户(User Equipment)数据，控制信道承载控制信息，包括MCS索引号、信道信息等控制类信息。带宽大小一般是指系统分配给数据传输所占用的带宽大小，LTE系统中分为20M、10M、5M等带宽。数据传输方向包括上行数据和下行数据，所述上行数据一般是指用户向基站传输数据，下行数据是指基站向用户传输数据。
一些常见的FEC编码包括：卷积码、Turbo码和低密度奇偶校验(Low Density Parity Check，简称为LDPC)码。FEC编码过程中，对比特数目为k的信息序列进行FEC编码获得n比特的FEC编码码字(冗余比特为n-k)，FEC编码码率为k/n。LDPC码是一种可以用非常稀疏的奇偶校验矩阵或者二分图定义的线性分组码，正是利用它的校验矩阵的稀疏性，才能实现低复杂度的编译码，从而使得LDPC走向实用化。经过各种实践和理论证明，LDPC码是在加性高斯白噪声(Additive White Gaussian Noise，简称为AWGN)信道下性能最为优良的信道编码，性能非常靠近香农极限。
在IEEE802.11ac、IEEE802.11ad、IEEE802.11aj、IEEE802.16e、IEEE802.11n、微波通信以及光纤通信等中，LDPC码都获得大量应用。LDPC码的奇偶校验矩阵中，每一行都是一个奇偶校验码，每一行中如果某一索引位置元素值等于1则说明该比特参与到该奇偶校验码，如果等于0，则说明该位置比特不参与该奇偶校验码。而结构化LDPC码的奇偶校验矩阵H为M×Z行和N×Z列的矩阵，它是由M×N个子矩阵构成，每个子矩阵都是大小为Z×Z的基本置换矩阵的不同幂次，也可以认为是大小为Z×Z单位阵的循环移位若干值所获得的子矩阵。此时，只要知道循环移位值以及子矩阵大小就可以确定一个结构化LDPC码，所述结构化LDPC码也可称为准循环LDPC码，在本文中所述的准循环LDPC码和结构化LDPC码是同一种。所述的所有移位值构成一个M×N矩阵，可以称为基础校验矩阵或者基础矩阵或者原模图(base protograph)，所述子矩阵大小可以成为扩展因子或者提升值(lift size)，在本专利内容中主要描述为扩 展因子，所述意思都一致。结构化LDPC码的奇偶校验矩阵有如下的形式：
Figure PCTCN2017104913-appb-000001
如果hbij＝＝-1，则有
Figure PCTCN2017104913-appb-000002
是大小为Z×Z的全零矩阵；为了从数学上更容易描述单位阵的循环移位，以上所述的结构化LDPC码基础校验矩阵中，在这里定义一个大小Z×Z的基本置换矩阵P，对单位阵的循环移位即对基本置换矩阵P进行相应大小的幂次，所述的基本置换矩阵P如下所示：
Figure PCTCN2017104913-appb-000003
通过这样的幂次hbij就可以唯一标识每一个分块矩阵，如果某一分块矩阵为全0矩阵，矩阵一般用-1来表示或者空值表示；而如果是单位阵的循环移位s获得，则等于s，所以所有hbij可以构成一个基础校验矩阵Hb，进而LDPC码的基础矩阵(或者基础校验矩阵)Hb可以表示如下：
Figure PCTCN2017104913-appb-000004
所以，结构化LDPC码完全可以由基础矩阵Hb和扩展因子Z唯一确定。基础校验矩阵包括多个参数：MB、NB和KB，其中，MB是基础矩阵行数(可以说是基础矩阵的校验列数)，NB基础矩阵总列数，而KB＝NB-MB是基础矩阵的系统列数。
例如，基础校验矩阵Hb(2行4列)如下而且扩展因子z等于4：
Figure PCTCN2017104913-appb-000005
则奇偶校验矩阵为：
Figure PCTCN2017104913-appb-000006
所述的奇偶校验矩阵中的元素只有0和1,两种元素值，所以可以将其描述为二进制矩阵；以及从基础矩阵变换成奇偶校验矩阵(二进制矩阵)可以描述为：基础矩阵变扩展成奇偶校验矩阵或者基础矩阵变提升成奇偶校验矩阵。从以上所述的LDPC码奇偶校验矩阵来看，可以知道，奇偶校验矩阵的第1行等于1的元素索引为[1 6 9]，说明在该结构化LDPC码中，第1比特、第6比特和第9比特构成一个奇偶校验码；同理，第2行中等于1的索引为[2 7 10]，则第2比特、第7比特和第10比特构成一个奇偶校验码；依此类推，可以知道LDPC码其实就是很多歌奇偶校验码堆积起来的码字。而结构化LDPC码，好处在于只要存储基础校验矩阵Hb和扩展因子Z即可，存储非常简单，以及编码/译码算法中可以利用其分块特性，可以简化算法，如采用分层译码，而每行内比特节点位置都不冲突，可以采用流水线操作，可以减少译码时延和译码复杂度，实现非常简单。
在LDPC译码方法有多种，如概率域BP译码算法，对数域BP译码算法和分层最小和译码算法等。概率域BP译码算法性能最好，但是缺点在于由于其涉及到大量乘法运算，运算量非常大，从而所需的硬件成本非常高，并且数值的动态范围大稳定性不好，所以一般在实际应用中不会使用。相对于概率域BP译码算法，对数域BP译码算法减少了很多计算单元，但还是需要很多乘法运算，所需的硬件成本也不少。分层最小和译码算法将对数域BP译码算法的关键计算(log运算和乘法运算)单元转化成求最小值和次最小值，需要的硬件资源大量减少，性能会有一小点损失， 但可以减少很多硬件资源。所以，在实际应用比较多的是分层最小和译码算法。不管是哪种译码方法，都是需要进行迭代译码，译码模块主要分为两个部分：校验节点更新模块和变量节点更新模块。
在LDPC编码和译码中，为了保证得到性能优异、吞吐量高、灵活性高和复杂度低等特性，与设计的LDPC码奇偶校验矩阵是息息相关的。反之，如果设计LDPC奇偶校验矩阵不好，将使得其性能下降，同时也可能会使得复杂度和灵活性受到影响。因此，在LDPC码设计过程中引入短圈girth的概念。为了更好理解girth的概念，在此介绍一下LDPC码基础矩阵出现短4环和短6环形成girth的情况。一般来说需要将基础矩阵扩展成奇偶校验矩阵或者二进制矩阵。在奇偶校验矩阵中，在任意2个不同的行索引为i和l上，以及任意2个不同的列索引为j和k上，如果由行索引为i和l与列索引为j和k共同指示的4个元素中，所述这4个元素都等于1，则我们认为所述奇偶校验矩阵中存在一个长度为4的短圈；同理，在奇偶校验矩阵中，在任意3个不同的行索引为i、l和a上，以及任意3个不同的列索引为j、k和b上，如果由行索引为i、l和a与列索引为j、k和b共同指示的6个元素中，如果这6个元素都等于1，则我们认为所述奇偶校验矩阵中存在一个长度为6的短圈；同理，在奇偶校验矩阵中，在任意3个不同的行索引为i、l、a和c上，以及任意4个不同的列索引为i、l、a和c上，如果由行索引为i、l、a和c与列索引为i、l、a和c共同指示的8个元素中，如果这8个元素都等于1，则我们认为所述奇偶校验矩阵中存在一个长度为8的短圈。如上所述举例中也存在一个girth为4的短圈，如图6所示的601和602。在基础矩阵中，可以认为其所对应的奇偶校验矩阵中，短4环出现girth＝4的充分必要条件是：在基础矩阵中，任意能构成4环的4个元素[hai,hbi,hbj,haj]满足
(hai-hbi+hbj-haj)％zf＝＝0
zf为扩展因子，则该4个位置的元素之间会导致girth＝4的出现。这样由于信息只在这4个节点(2个变量节点+2个校验节点)之间交换传递，在进行多次迭代后由于不断地交换的信息大部分来自自身反馈的信息，外部信息较少，则最终码字性能就会变差。
其所对应的奇偶校验矩阵中，短6环出现girth＝6的充分必要条件是： 在基础矩阵中，任意能构成6环的6个元素[hai,hbi,hbj,hcj,hck,hak]满足
(hab-hcd+hef-hgj+hnm-hqw)％zf＝0
zf为扩展因子，则该6个位置的元素之间会导致girth＝6的出现。这样由于信息大部分在这6个节点(3个变量节点+3个校验节点)之间交换传递，由于与girth＝4同样原因交换的外来信息较少，其最终码字性能也可能会稍差。为了更为深入理解LDPC码的基础矩阵对应的奇偶校验矩阵(也称为二进制矩阵)，由基础矩阵和扩展因子可以唯一确定一种LDPC编码方法，通过结合基础矩阵和扩展因子可以扩展成(或者提升成)奇偶校验矩阵(或二进制矩阵)。为了更好描述girth特性。LDPC码中，二分图和校验矩阵之间具有一一对应的关系。一个M*N的奇偶校验矩阵H定义了每个具有N比特的码字满足M个奇偶校验集的约束。一个二分图包括N个变量节点(variable node)，每个节点对应奇偶校验矩阵H中一个比特位；还包括M个奇偶校验节点(check node)，每个节点对应一个H中的奇偶校验。校验节点将连到将要得到校验的变量节点上；具体的说，当第m个校验涉及到第n个比特位，即Hm,n＝1的时候，将有一根线连接校验节点m和比特节点n。二分图名称的由来就是因为它包括两类节点，即变量节点和校验节点。其中，任何同一类的节点之间都不会有连接。并且二分图中的总边数和校验矩阵中非零元素的个数相等。
根据图7所示某校验矩阵的二分图片断，黑色加重的实线告诉我们信息比特x1、x2和校验比特c1、c2构成了一个长度为4的圈。分析图7，校验约束c1和c2对于(x1，x2)是(0，0)或者(1，1)是无法区分的。根据图8所示某校验矩阵的二分图片断，黑色加重的实线告诉我们信息比特x1、x2、x3和校验比特c1、c2、c4构成了一个长度为6的圈。分析图8，校验约束c1、c2和c4对于(x1，x2，x3)是(0，0，0)或者(1，1，1)也是无法区分的，所以短圈存在降低了校验约束正常的检错和纠错能力。
图7说明了x1、x2通过长度为4的圈相互联系，图8说明了x1、x2、x3 通过长度为6的圈相互联系，而LDPC码的信息传递(Message Passing)译码算法是假定变量节点是相互独立，短圈的存在必然破坏了独立性的假设，使得译码性能明显下降。事实上，圈4、圈6等短圈的存在使得变量节点在迭代译码的过程中频繁给自己传递正反馈信息。turbo码也是迭代译码的，使用交织器来减少这种正反馈效应。对于没有圈(Cycle free)的Tanner图，信息传递算法会导致最优解码，而圈的存在使得信息传递(Message Passing)算法是一种次优(sub-optimality)的迭代译码算法，事实上最短圈长度越长，信息传递算法越接近最优算法。
以下通过校验矩阵来分析短圈：图9给出了圈长为4的短圈在LDPC码校验矩阵中出现的一般形式，由带箭头的实线清楚可以看到变量节点xi、xj和校验节点cp、cq构成了长度为4的短圈，对于图9和图6而言如果xi＝x1，xj＝x2，cp＝c1和cq＝c2，二分图图7中的短圈就可以和校验矩阵中的短圈一一对应起来。图9给出了圈长为6的短圈在LDPC码校验矩阵中出现的一般形式，由带箭头的实线清楚可以看到变量节点xi、xj、xk和校验节点cp、cq、cr构成了长度为6的短圈，对于图9和图8而言，如果xi＝x1，xj＝x2，xk＝x3，cp＝c1，cq＝c2和cr＝c4，二分图图8中的短圈就可以和校验矩阵中的短圈一一对应起来。
在校验矩阵中，非零元素代表了行号对应的校验节点和列号对应变量节点的相连接的一条边。而在校验矩阵图中连接两个非零元素的边只代表了一种连接，并且这种连接只能水平方向的和或者垂直方向，其中水平方向的边表示两个变量节点通过一个校验节点连接起来，如图9，变量节点xi和xj通过校验节点cp连接起来。分析可知，如果存在两个变量节点之间的距离为2，这两个变量节点在校验矩阵图中就会形成一条水平方向的边。 同理，垂直方向的边表示两个校验节点通过一个变量节点连接起来，可知如果存在两个校验节点的距离为2，那么在校验矩阵图中相应位置就存在一条垂直方向的边。校验矩阵图中某些边按照一条水平边连一条垂直边，再连一条水平边，再连一条垂直边，如此下去若能够构成一个闭合路径，并且所有的水平边不同行，所有垂直边不同列，则在校验矩阵中就可形成一个短圈，并且所构成的短圈的长度则由该圈包含的非零元素个数确定，因为我们知道非零元素对应二分图中真实的边，根据校验矩阵图的特点发现，非零元素的个数正好又与短圈中边的个数相等，所以短圈长度恰好又等于矩阵图种短圈包含的边的总数。图9中圈有四个非零元素，所以该圈的长度为4，并有4条边；图10中圈有六个非零元素，该圈的长度为6，并包含6条边。根据以上描述，可完全将二分图中的圈和校验矩阵的圈一一对应起来了，这样就可通过判断校验矩阵中出现圈情况来确定二分图中出现圈情况。
对于图9，由于变量节点xi，xj对应校验矩阵中的的两列之间重叠的1(overlap)至少为2。校验矩阵中两列的overlap为0意味着，那么这两列是相互正交的，相关性最小。如果overlap越大，则两列的相关性就越大。所以，如果校验矩阵两列之间overlap为2的情况出现比较频繁，必然增强了校验矩阵的列的相关性，这样会减少校验矩阵的秩，从而使得该校验矩阵确定的分组码的自由距离减少。对于图10，长度为6的短圈增强了三列之间的相关性，如果短圈出现的比较频繁，也会影响校验矩阵的秩，从而减小自由距离，导致码性能的下降。综上所述，校验矩阵中的短圈的存在，与无短圈情况比较，会导致校验矩阵的列的相关性增强，从而减小校验矩阵的秩，减小码的自由距离，降低码性能。事实上高girth码的校验矩阵更可能是满秩的，其中高girth码是指对应二分图最短圈圈长 比较大的LDPC码。
以下解释二分图的girth、节点的girth、边的girth。为了定量描述二分图中的短圈，引入了girth的相关概念。二分图的girth是指一个图中最短圈的圈长，例如：某个二分图有长度为6、8、10、12和长度更长的圈，则该二分图的girth为6。二分图中，某个节点u的girth(the girth at node u)是指经过节点u的最短圈的圈长，例如：经过节点u有长度为8、10、12和长度更长的圈，则该节点u的girth为8。二分图中，某条边e的girth(the girth at node u)是指经过此边e的最短圈的圈长，例如：经过节点e有长度为8、10、12和长度更长的圈，则该节点u的girth为8。
一个变量节点的girth是指最短路径的长度，它等同于从这个节点出来的信息传递回该节点本身的最小迭代次数。在实际迭代次数达到这个最小迭代次数之前，与这个节点联系的信息可以最优地传递给二分图的剩余部分。如果某个变量节点的girth如果越大，那么该变量节点发出的信息被传递给自身的正反馈信息将越小，则译码性能也越好。所以，使变量节点的girth尽量大对码性能的提高是有利的。综上所述，构造高LDPC码原则如下：首先，被选择的码的最短圈的长度(girth)应该尽量大；其次，对于具有同样大小girth的码，被选择的码的最短圈的数目应该尽量少。
在实际应用中，由基础矩阵扩展为奇偶校验矩阵，所述奇偶校验矩阵也可以称为扩展矩阵或者二进制矩阵。分析校验矩阵的拓扑可知，扩展矩阵中z×z的分块矩阵和基础矩阵的元素是唯一对应的，如果基础矩阵中某些元素不构成短圈，那么这些元素对应的分块矩阵在扩展矩阵中也将不构成短圈。所以，为了研究扩展矩阵的短圈，仅仅需要研究当基础矩阵中 出现短圈时的扩展矩阵。
如图11，分析校验矩阵和二分图的拓扑结构，当基础矩阵Hb中出现长度为4的短圈的时候，Hb的扩展矩阵H才可能出现长度为4或者更大的短圈，如下：有四个z×z的分块矩阵Pi,Pj,Pk,Pl对应的幂次元素i,j,k,l在Hb中构成了长度为4的短圈，若mod(i-j+k-l,z)＝0，则Pi,Pj,Pk,Pl在H中构成了长度为4的短圈；若mod(i-j+k-l,z)＝z/2，则Pi,Pj,Pk,Pl在H中构成了长度为8的短圈。其它情况下，Pi,Pj,Pk,Pl在H中构成了长度为12的短圈或者不构成短圈。
如图12，分析校验矩阵和二分图的拓扑结构，当基础矩阵Hb中出现长度为6的短圈的时候，Hb的扩展矩阵H才可能出现长度为6或者更大的短圈，如下：有六个z×z的分块矩阵Pi,Pj,Pk,Pl,Pm,Pn对应的幂次元素i,j,k,l,m,n在Hb中构成了长度为6的短圈，若mod(i-j+k-l+m-n,z)＝0，则Pi,Pj,Pk,Pl,Pm,Pn在H中构成了长度为6的短圈；若mod(i-j+k-l+m-n,z)＝z/2，则Pi,Pj,Pk,Pl,Pm,Pn在H中构成了长度为10的短圈。其它情况下，Pi,Pj,Pk,Pl,Pm,Pn在H中构成了长度大于等于12的短圈或者不构成短圈。
如图13，分析校验矩阵和二分图的拓扑结构，当基础矩阵Hb中出现长度为8的短圈的时候，Hb的扩展矩阵H才可能出现长度为8或者更大的短圈，如下：有八个z×z的分块矩阵Pi,Pj,Pk,Pl,Pm,Pn,,Ps,Pt对应的幂次元素i,j,k,l,m,n,s,t在Hb中构成了长度为8的短圈；若mod(i-j+k-l+m-n+s-t,z)＝0，则Pi,Pj,Pk,Pl,Pm,Pn,Ps,Pt在H中构成了长度为8的短圈；其它情况下，Pi,Pj,Pk,Pl,Pm,Pn,Ps,Pt在H中构成了长度为12的短圈或者不构成短圈。
如图14，为Z＝4，2×2基础矩阵的扩展矩阵有长度为4短圈和长度为8短圈。
虽然结构化LDPC码已经在多种通信标准中获得应用，但是经过分析可以发现，各种标准的码率和码长都是比较有限的，即灵活性比较差。例如，在IEEE802.11ad标准中，只有1种码长(672)和4种码率(1/2、5/8、3/4、13/16)；在IEEE802.11n标准中，只有3种码长(648、1296、1944)和4种码率(1/2、2/3、3/4、5/6)。可以发现，由于结构化LDPC是由部分基础矩阵来定义的，所以，这些使用中的结构化LDPC码的缺点都是灵活性不足，所述的灵活性是指编码码率和编码码长灵活变化，以及还有支持传输块也要灵活变化。在new RAT(new Radio Access Technology)系统中，需要信道编码方案支持灵活码率码长，即码长的变化间隔至少为8比特，码率可以灵活变化。
针对相关技术中LDPC编译码过程缺少灵活性的问题，目前还没有有效的解决方案。
发明内容
本公开实施例提供了一种准循环LDPC编译码方法、装置及LDPC编译码器，以至少解决相关技术中LDPC编译码过程缺少灵活性的问题。
根据本公开的一个实施例，提供了一种LDPC编译码方法，包括：从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵包括：根据预设参数确定所述LDPC编码所使用的基础矩阵，其中， 所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小；其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道；所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是大于0的实数。
可选地，所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
可选地，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
可选地，所述码率R是所有码率集合CoderateSet中的一个元素，其中，所述码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时所述的母基础矩阵集合包括A2个基础矩阵子集合Hbi， 每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所述所有码率集合CoderateSet，A2是大于1的整数；所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述码率R相等的所述码率Coderatei,然后确定所述的码率Coderatei对应的基础矩阵子集合Hbi。
可选地，所述频段是所有频段集合FBSet中的一个元素，其中，所述频段集合FBSet中包括A3个频段，同时所述的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，所述A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述频段归属于频段集合FBSet的索引，然后确定所述频段对应的基础矩阵子集合Hbi。
可选地，所述母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述信道类型，然后确定所述信道类型对应的基础矩阵子集合。
可选地，所述母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述数据传输方向，然后确定所述数据传输方向对应的基础矩阵子集合。
可选地，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，A2是大于 1的整数。
可选地，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，所述A2是大于1的整数。
可选地，所述母基础矩阵集合中包括A4个基础矩阵子集合，所述A4个基础矩阵的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，所述A4是大于1的整数。
可选地，所述A4个基础矩阵子集合的矩阵列数NBi相等；和/或，所述A4个基础矩阵子集合的矩阵行数MBi相等；和/或，所述A4个基础矩阵子集合的矩阵系统列数KBi相等；其中，i＝0、1、…、(A4-1)。
可选地，所有基础矩阵子集合中所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列索引集合都是Colset的子集，当列索引j属于第一列索引集合，每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵子集合的第j列的交集的第二类元素数目小于等于2个，并且所述第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，所述列重量是所述列中的第二类元素数目。
可选地，A4＝1，所述基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是所述第一个行索引集合中的任意2个元素，所述基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；所述第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
可选地，所述母基础矩阵集合中包括所述A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，所述A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
可选地，所述扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
可选地，所述A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
可选地，所述母基础矩阵集合中任意一个基础矩阵子集合中的任意校验列中的所有第二类元素值等于0。
可选地，所述母基础矩阵集合中任意一个基础矩阵子集合中从第L0行至尾行中的任意连续L1行正交，所述L1行正交是所述L1行中任意列索引的L1个元素值中至多有一个第二类元素值，所述L0是大于等于0小于5的一个整数，L1是大于0小于5的一个整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为4的变量节点个数为Bi，对应所述码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，可选地：码长存在关系N0<＝N1<＝...<＝N(s-1)，则 B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为6的变量节点个数为Ci，对应所述码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，所述支持不同码长的基础矩阵中的第二类元素是根据扩展因子和一个确定的扩展因子计算获得。
可选地，所述确定的扩展因子是对应于所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
可选地，所述母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
可选地，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为 Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集，所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
根据本公开的另一个方面，还提供了一种准循环LDPC编译码装置，包括：确定模块，设置为从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；编译码模块，设置为根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，所述确定模块设置为：根据预设参数确定所述LDPC编码所使用的基础矩阵，其中，所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和 资源单元数NRB的组合、带宽大小；其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道；所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是大于0的实数。
可选地，所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；所述确定模块设置为：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
可选地，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
可选地，所述码率R是所有码率集合CoderateSet中的一个元素，其中，所述码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时所述的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所述所有码率集合CoderateSet，A2是大于1的整数；所述确定模块设置为：确定与所述码率R相等的所述码率Coderatei,然后确定所述的码率Coderatei对应的基础矩阵子集合Hbi。
可选地，所述频段是所有频段集合FBSet中的一个元素，其中，所述频段集合FBSet中包括A3个频段，同时所述的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，所述A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；所述确定模块设置为：确定与所述频段归属于频段集合FBSet的索引，然后确定所述频段对应的基础矩阵子集合Hbi。
可选地，所述母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述信道类型，然后确定所述信道类型对应的基础矩阵子集合。
可选地，所述母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述数据传输方向，然后确定所述数据传输方向对应的基础矩阵子集合。
可选地，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。
可选地，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集 合作为所述码率值R，所述R’是实际编码码率，R’是大于0小于1的实数，所述A2是大于1的整数。
可选地，所述母基础矩阵集合中包括A4个基础矩阵子集合，所述A4个基础矩阵的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，所述A4是大于1的整数。
可选地，所述A4个基础矩阵子集合的矩阵列数NBi相等；和/或，所述A4个基础矩阵子集合的矩阵行数MBi相等；和/或，所述A4个基础矩阵子集合的矩阵系统列数KBi相等；其中，i＝0、1、…、(A4-1)。
可选地，所有基础矩阵子集合的所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列索引集合都是Colset的子集，当列索引j属于第一列索引集合，每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵子集合的第j列的交集的第二类元素数目小于等于2个，并且所述第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，所述列重量是所述列中的第二类元素数目。
可选地，A4＝1，所述基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是所述第一个行索引集合中的任意2个元素，所述基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；所述第j行和第k行正交 是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
可选地，所述母基础矩阵集合中包括所述A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，所述A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
可选地，所述扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
可选地，所述A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
可选地，所述母基础矩阵集合中任意一个基础矩阵子集合中的任意校验列中的所有第二类元素值等于0。
可选地，所述母基础矩阵集合中任意一个基础矩阵子集合中从第L0行至尾行中的任意连续L1行正交，所述L1行正交是所述L1行中任意列索引的L1个元素值中至多有一个第二类元素值，所述L0是大于等于0小于5的一个整数，L1是大于0小于5的一个整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为4的变量节点个数为Bi，对应所述码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为6的变量节点个数为Ci，对应所述码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，所述支持不同码长的基础矩阵中的第二类元素是 根据扩展因子和一个确定的扩展因子计算获得。
可选地，所述确定的扩展因子是对应于所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
可选地，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
可选地，所述母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
可选地，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集， 所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
根据本公开的另一个方面，还提供了一种准循环LDPC编译码器，包括：处理芯片，用于从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等，所述母基础矩阵集合至少包括一个基础矩阵；编码器，用于根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码；和/或，译码器，用于根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，所述处理芯片用于：根据预设参数确定所述LDPC编码所使用的基础矩阵，其中，所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小；其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道； 所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是大于0的实数。
根据本公开的又一方面，还提供了一种存储介质，该存储介质可以存储有执行指令，该执行指令用于执行上述实施例中的准循环LDPC编译码方法。
通过本公开，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码，由此可见，采用上述方案从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，LDPC编码所使用的基础矩阵中的元素分为第一类元素和第二类元素，第一类元素和第二类元素分别具有对应的矩阵，再根据LDPC编码所使用的基础矩阵进行编译码，使得LDPC编译码支持灵活的码长和码率，因此，提高了LDPC编译码过程的灵活性，从而解决了相关技术中LDPC编译码过程缺少灵活性的问题。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本申请的一部分，本公开的示意性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1是根据相关技术的数字通信系统的结构框图；
图2是根据本公开实施例的一种LDPC编译码方法的流程图；
图3是根据本公开实施例的一种LDPC编译码装置的结构框图一；
图4是根据本公开实施例的一种LDPC编译码装置的结构框图二；
图5是根据本公开可选实施例的发送端的LDPC码的编码方法的流程图；
图6是根据相关技术的基础矩阵所对应奇偶校验矩阵中girth为4的示意图；
图7是根据本公开可选实施例的校验矩阵的二分图片断的示意图一；
图8是根据本公开可选实施例的校验矩阵的二分图片断的示意图二；
图9是根据本公开可选实施例的校验矩阵的二分图片断的示意图三；
图10是根据本公开可选实施例的校验矩阵的二分图片断的示意图四；
图11是根据本公开可选实施例的四个单位矩阵的循环移位矩阵在H构成长度为4的短圈的示意图；
图12是根据本公开可选实施例的六个单位矩阵的循环移位矩阵在H构成长度为6的短圈的示意图；
图13是根据本公开可选实施例的八个单位矩阵的循环移位矩阵在H构成长度为8的短圈的示意图；
图14是根据本公开可选实施例的z＝4，2×2基础矩阵的扩展矩阵有长度为4短圈和长度为8短圈的示意图；
图15是根据本公开可选实施例的扩展因子集合对各个变量的girth的示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或 先后次序。
实施例1
在本实施例中提供了一种准循环LDPC编译码方法，图2是根据本公开实施例的一种LDPC编译码方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，从母基础矩阵集合中确定低密度奇偶校验(Low Density Parity Check，简称为LDPC)编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；
步骤S204，根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
通过上述步骤，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码，由此可见，采用上述方案从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，LDPC编码所使用的基础矩阵中的元素分为第一类元素和第二类元素，第一类元素和第二类元素分别具有对应的矩阵，再根据LDPC编码所使用的基础矩阵进行编译码，使得LDPC编译码支持灵活的码长和码率，因此，提高了LDPC编译码过程的灵活性，从而解决了相关技术中LDPC编译码过程缺少灵活性的问题。
可选地，在上述步骤S202中，可以但不限于根据预设参数确定LDPC编码所使用的基础矩阵，其中，预设参数包括以下至少之一：传输块大小 TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小。
在本实施例中，传输块大小TBS是大于0的整数；应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；频段包括：系统配置的频率范围；码率R是大于0且小于1的实数；信道类型包括：控制信道和数据信道；数据传输方向包括：上行数据和下行数据；TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，TBS索引号是大于或者等于0的整数；MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，MCS索引号是大于或者等于0的整数；资源单元数NRB是系统配置的资源块数目；带宽大小是大于0的实数。
可选地，传输块大小TBS是TBS集合TBSSet中的一个元素，其中，TBS集合中包括A1个TBS子集合TBSsubseti，同时的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的TBS集合，i是0到A1-1之间的整数；在上述步骤S202中：确定传输块大小TBS所归属的的TBS子集合TBSsubseti，然后确定TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
可选地，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
可选地，码率R是所有码率集合CoderateSet中的一个元素，其中，码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所有码率集 合CoderateSet，A2是大于1的整数；在上述步骤S202中：确定与码率R相等的码率Coderatei,然后确定的码率Coderatei对应的基础矩阵子集合Hbi。
可选地，频段是所有频段集合FBSet中的一个元素，其中，频段集合FBSet中包括A3个频段，同时的母基础矩阵集合包括A3个母基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；在上述步骤S202中，确定与频段归属于频段集合FBSet的索引，然后确定频段对应的基础矩阵子集合Hbi。
可选地，母基础矩阵集合包括：数据编码使用的基础矩阵和信令编码使用的基础矩阵子集合，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵子集合，包括：确定信道类型，然后确定信道类型对应的基础矩阵子集合。
可选地，母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，在上述步骤S202中，确定数据传输方向，然后确定数据传输方向对应的基础矩阵子集合。
可选地，母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，码率包括：R0、R1、…、R(A2-1)，对应基础矩阵分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。采用所述的基础矩阵子集合进行缩短编码，即编码之前在待待编码信息序列中添加部分哑元比特，所述哑元码字比特不传输，以保证编码码率不变(即等于实际编码码率)。
或者，可选地，所述母基础矩阵集合支持的A2个码率，每个码率对 应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，所述A2是大于1的整数。采用所述的基础矩阵子集合进行编码后，进行打孔编码，即LDPC编码完后有部分码字比特不传输，以保证编码码率不变(即等于实际编码码率)。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，A4个基础矩阵子集合的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，A4是大于1的整数。
可选地，A4个基础矩阵子集合的矩阵列数NBi相等；和/或，A4个基础矩阵子集合的矩阵行数MBi相等；和/或，A4个基础矩阵子集合的矩阵系统列数KBi相等；其中，i＝0、1、…、(A4-1)。
可选地，所有基础矩阵子集合中所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列索引集合都是Colset的子集，当列索引j属于第一列索引集合，每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵的第j列的交集的第二类元素数目小于等于2个，并且第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，列重量是列中的第二类元素数目。
可选地，A4＝1，基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是第一个行索引集合中的任意2个元素，基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
可选地，扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
可选地，A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
可选地，母基础矩阵集合中任意一个基础矩阵子集合中的任意校验列中的所有第二类元素值等于0。
可选地，母基础矩阵集合中任意一个基础矩阵中从第L0行至尾行中的任意连续L1行正交，L1行正交是L1行中任意列索引的L1个元素值中至多有一个第二类元素值，L0是大于等于0小于5的一个整数，L1是大于0小于5的一个整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为4的变量节点个数为Bi，对应码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1) 和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为6的变量节点个数为Ci，对应码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，支持不同码长的基础矩阵中的第二类元素是根据扩展因子和一个确定的扩展因子计算获得。
可选地，确定的扩展因子是对应于母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
可选地，母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
可选地，母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，Colsubset1和Colsubset2互为补集，Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
可选地，的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,奇偶校验矩阵HL1i的girth为g；基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,奇偶校验矩阵HL2i的girth为g-2，基础矩阵子集合所支持的所有扩展因 子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，Colsubset3和Colsubset4互为补集，Colsubset1包含Colsubset3，Colsubset4包含Colsubset2，Colsubset3有Ei个元素，Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
实施例2
在本实施例中还提供了一种准循环LDPC编译码装置，该装置用于实现上述实施例及可选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图3是根据本公开实施例的一种LDPC编译码装置的结构框图一，如图3所示，该装置包括：
确定模块32，设置为从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
编译码模块34，耦合至确定模块32，设置为根据所述LDPC编码所 使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
通过上述步骤，确定模块从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；编译码模块根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码，由此可见，采用上述方案从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，LDPC编码所使用的基础矩阵中的元素分为第一类元素和第二类元素，第一类元素和第二类元素分别具有对应的矩阵，再根据LDPC编码所使用的基础矩阵进行编译码，使得LDPC编译码支持灵活的码长和码率，因此，提高了LDPC编译码过程的灵活性，从而解决了相关技术中LDPC编译码过程缺少灵活性的问题。
可选地，确定模块32设置为：根据预设参数确定LDPC编码所使用的基础矩阵，其中，预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小。
在本实施例中，传输块大小TBS是大于0的整数；应用场景包括：eMBB、URLLC和mMTC；频段包括：系统配置的频率范围；码率R是大于0且小于1的实数；信道类型包括：控制信道和数据信道；数据传输方向包括：上行数据和下行数据；TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，TBS索引号是大于或者等于0的整数；MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，MCS索引号是大于或者等于0的整数；资源单元数NRB是系统配置的资源块数目；带宽大小是大于0的实数。
可选地，传输块大小TBS是TBS集合TBSSet中的一个元素，其中，TBS集合中包括A1个TBS子集合TBSsubseti，同时的母基础矩阵集合包括A1个母基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的TBS集合，i是0到A1-1之间的整数；确定模块32用于：确定传输块大小TBS所归属的的TBS子集合TBSsubseti，然后确定TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
可选地，码率R是所有码率集合CoderateSet中的一个元素，其中，码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所有码率集合CoderateSet，A2是大于1的整数；确定模块32设置为：确定与码率R相等的码率Coderatei,然后确定的码率Coderatei对应的基础矩阵子集合Hbi。
可选地，频段是所有频段集合FBSet中的一个元素，其中，频段集合FBSet中包括A3个频段，同时的母基础矩阵集合包括A3个母基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；确定模块32设置为：确定与频段归属于频段集合FBSet的索引，然后确定频段对应的基础矩阵子集合Hbi。
可选地，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
可选地，母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，确定模块32设置为：确定信道类型，然后确定信道类型对应的基础矩阵子集合。
可选地，母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，确定模块32设置为：确定数据传输方向，然后确定数据传输方向对应的基础矩阵子集合。
可选地，母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，码率包括：R0、R1、…、R(A2-1)，对应基础矩阵分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中，确定模块32设置为：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。
可选地，母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，码率包括：R0、R1、…、R(A2-1)，对应基础矩阵分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中，确定模块32用于：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，A4个基础矩阵子集合的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，A4是大于1的整数。
可选地，A4个基础矩阵子集合的矩阵列数NBi相等；和/或，A4个基础矩阵子集合的矩阵行数MBi相等；和/或，A4个基础矩阵子集合的矩阵系统列数KBi相等；其中，i＝0、1、…、(A4-1)。
可选地，所有基础矩阵子集合的所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列索引集合都是Colset的子集，当列索引j属于第一列索引集合， 每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵子集合的第j列的交集的第二类元素数目小于等于2个，并且第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，列重量是列中的第二类元素数目。
可选地，A4＝1，基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是第一个行索引集合中的任意2个元素，基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
可选地，扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
可选地，A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
可选地，母基础矩阵集合中任意一个基础矩阵子集合中任意校验列中的所有第二类元素值等于0。
可选地，母基础矩阵集合中任意一个基础矩阵子集合中从第L0行至尾行中的任意连续L1行正交，L1行正交是L1行中任意列索引的L1个元素值中至多有一个第二类元素值，L0是大于等于0小于5的一个整数， L1是大于0小于5的一个整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为4的变量节点个数为Bi，对应码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为6的变量节点个数为Ci，对应码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，支持不同码长的基础矩阵中的第二类元素是根据扩展因子和一个确定的扩展因子计算获得。
可选地，确定的扩展因子是对应于母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
可选地，母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
可选地，母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，Colsubset1和Colsubset2互为补集，Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
可选地，的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,奇偶校验矩阵HL1i的girth为g；基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,奇偶校验矩阵HL2i的girth为g-2，基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，Colsubset3和Colsubset4互为补集，Colsubset1包含Colsubset3，Colsubset4包含Colsubset2，Colsubset3有Ei个元素，Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述模块分别位于多个处理器中。
实施例3
在本实施例中还提供了一种准循环LDPC编译码器，图4是根据本公开实施例的一种LDPC编译码器的结构框图，如图4所示，该LDPC编译码器包括：
处理芯片42，用于从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等，母基础矩阵集合至少包括一个基础矩阵；
编码器44，耦合至处理芯片42，用于根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码；和/或，译码器46，耦合至处理芯片42，用于根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，处理芯片42用于：根据预设参数确定LDPC编码所使用的基础矩阵，其中，预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小。
在本实施例中，传输块大小TBS是大于0的整数；应用场景包括：eMBB、URLLC和mMTC；频段包括：系统配置的频率范围；码率R是大于0且小于1的实数；信道类型包括：控制信道和数据信道；数据传输方向包括：上行数据和下行数据；TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，TBS索引号是大于或者等于0的整数；MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，MCS索引号是大于或者等于0的整数；资源单元数NRB是系统配置的资源块数目；带宽大小是大于0的实数。
可选地，传输块大小TBS是TBS集合TBSSet中的一个元素，其中，TBS集合中包括A1个TBS子集合TBSsubseti，同时的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，A1个TBS子集中两两之间没有交集，所有 A1个TBS子集合构成完整的TBS集合，i是0到A1-1之间的整数；处理芯片用于：确定传输块大小TBS所归属的的TBS子集合TBSsubseti，然后确定TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
可选地，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
可选地，码率R是所有码率集合CoderateSet中的一个元素，其中，码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所有码率集合CoderateSet，A2是大于1的整数；处理芯片用于：确定与码率R相等的码率Coderatei,然后确定的码率Coderatei对应的基础矩阵子集合Hbi。
可选地，频段是所有频段集合FBSet中的一个元素，其中，频段集合FBSet中包括A3个频段，同时的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；处理芯片用于：确定与频段归属于频段集合FBSet的索引，然后确定频段对应的基础矩阵子集合Hbi。
可选地，母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，包括：确定信道类型，然后确定信道类型对应的基础矩阵子集合。
可选地，母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，包括：确定数据传输方向，然后确定数据传输方向对应的基础矩阵子集合。
可选地，母基础矩阵集合支持的A2个码率，每个码率对应一个基础 矩阵子集合，码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。
可选地，母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，R’是实际编码码率，R’是大于0小于1的实数，A2是大于1的整数。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，A4个基础矩阵子集合的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，A4是大于1的整数。
可选地，A4个基础矩阵子集合的矩阵列数NBi相等；和/或，A4个基础矩阵子集合的矩阵行数MBi相等；和/或，A4个基础矩阵子集合的矩阵系统列数KBi相等；其中，i＝0、1、…、(A4-1)。
可选地，所有基础矩阵子集合的所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列索引集合都是Colset的子集，当列索引j属于第一列索引集合，每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵子集合的第j列的交集 的第二类元素数目小于等于2个，并且第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，列重量是列中的第二类元素数目。
可选地，A4＝1，基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是第一个行索引集合中的任意2个元素，基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
可选地，母基础矩阵集合中包括A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
可选地，扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
可选地，A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
可选地，母基础矩阵集合中任意一个基础矩阵子集合中任意校验列中的所有第二类元素值等于0。
可选地，母基础矩阵集合中任意一个基础矩阵子集合中从第L0行至尾行中的任意连续L1行正交，L1行正交是L1行中任意列索引的L1个元素值中至多有一个第二类元素值，L0是大于等于0小于5的一个整数，L1是大于0小于5的一个整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为4的变量节点个数为 Bi，对应码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应码长Ni的girth为6的变量节点个数为Ci，对应码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，母基础矩阵集合中的任意一个基础矩阵子集合中，girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于 1的正整数。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
可选地，母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，支持不同码长的基础矩阵中的第二类元素是根据扩展因子和一个确定的扩展因子计算获得。
可选地，确定的扩展因子是对应于母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
可选地，母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
可选地，母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，Colsubset1和Colsubset2互为补集，Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
可选地，的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,奇偶校验矩阵HL1i的girth为g；基础矩阵Hbi中所有行索引和所有 Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,奇偶校验矩阵HL2i的girth为g-2，基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，Colsubset3和Colsubset4互为补集，Colsubset1包含Colsubset3，Colsubset4包含Colsubset2，Colsubset3有Ei个元素，Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
下面结合本公开可选实施例进行详细说明。
可选实施例一
在本可选实施例中提出的方法可以用于LTE移动通信系统或者未来第五代移动通信系统或者其他无线有线通信系统，数据传输方向为基站向移动用户发送数据(下行传输业务数据)，或者数据传输方向为移动用户向基站发送数据(上行传输业务数据)。移动用户包括：移动设备、为接入终端、用户终端、用户站、用户单元、移动站、远程站、远程终端、用户代理、用户装置、用户设备、或一些其它术语。基站包括接入点(AP)、或可以称为节点B(node B)、无线电网络控制器(RNC)、演进型Node B(Evolved Node B，eNB)、基站控制器(BSC)、基站收发台(BTS)、基站(BS)、收发机功能体(TF)、无线电路由器、无线电收发机、基本服 务单元(BSS)、扩展服务单元(ESS)、无线电基站(RBS)，或一些其它术语。
根据本可选实施例的一个方面，本可选实施例提供一种结构化LDPC码构造方法，应用于新无线接入技术(New Radio Access Technology，简称为new RAT)中的增强移动宽带(enhanced Mobile Broadband，简称为eMBB)场景、超可靠低时延通信(Ultra-Reliable and Low Latency Communications，简称为URLLC)场景或者大规模物联网(massive Machine Type Communications，简称为mMTC)场景中。其中eMBB场景中下行最大吞吐量可以达到20Gbps，上行数据最大吞吐量可以达到10Gbps；以及在URLLC中，可以支持可靠性最低达到10e-5的BLER(Block Error Rate)以及上下行达到最短时延达到0.5毫秒；以及mMTC能使设备电池可以使用多年不断电。
发送端需要将待传输的传输长度为8192比特的数据序列发送到接收端，发送端和接收端是不限于以上的类型，信道编码码率为2/3，信道编码采用结构化LDPC码。系统提供的结构化LDPC码的基础矩阵集合包括D＝8个基础矩阵，基础矩阵的系统列数分别为
Figure PCTCN2017104913-appb-000007
Figure PCTCN2017104913-appb-000008
Figure PCTCN2017104913-appb-000009
Figure PCTCN2017104913-appb-000010
Figure PCTCN2017104913-appb-000011
Figure PCTCN2017104913-appb-000012
Figure PCTCN2017104913-appb-000013
Figure PCTCN2017104913-appb-000014
其中，8个基础矩阵构成4个基础矩阵子集合，如HB0和HB1作为一个基础矩阵子集合0，HB2和HB3作为一个基础矩阵子集合1，HB4和HB5作为一个基础矩阵子集合2，HB6和HB7作为一个基础矩阵子集合3。4个基础矩阵子集合所对应的扩展因子分别为：[512 256 128 64]。D＝8 个基础矩阵的第i个基础矩阵的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(D-1)，矩阵中的元素值都是小于扩展因子，其中，矩阵列数NBi、矩阵行数MBi、矩阵系统列数KBi、码率Ri和扩展因子Zi如表1所示。
表1基础矩阵参数
数 B0 B1 B2 B3 B4 B5 B6 B7
Bi 2 6 2 6 2 6 2 6
Bi                
Bi                
i /3 /2 /3 /2 /3 /2 /3 /2
i 12 12 56 56 28 28 4 4
从以上所提供的LDPC码参数可见，支持的最大码长为KB*Zmax＝8*512＝4096。以上的基础矩阵中，包括第一类元素和第二类元素，其中，第一类元素值采用‘-1’表示，第二类元素值采用0到Z-1中的一个整数值表示，第一类元素对应于全零方阵，第二类元素对应于单位阵循环移位对应第二类元素值所获得的矩阵，全零方阵和单位阵的维数相等。将第一类元素和第二类元素替换成相应的全零方阵或者单位阵移位矩阵可以获得LDPC码的奇偶校验矩阵。
图5是根据本公开可选实施例的发送端的LDPC码的编码方法的流程图，如图5所示，该流程包括以下步骤：
步骤S502、码块分割，对长度为8192比特的待传输的数据序列进行码块分割，获得2份长度分别为4096比特的待编码信息序列。
步骤S504、确定编码使用的基础矩阵，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵；依据待编码序列长度为4096可以可以确定采用第0个基础矩阵子集合内的基础矩阵进行编码，以及依据码率R＝2/3，确认采用采用第0个基础矩阵子集合的第0个基础矩阵HB0进行编码，即依据传输块大小TBS(或者描述为编码块大小)和编码码率R的组合确定译码使用的基础矩阵。
步骤S506、LDPC编码，根据编码使用的基础矩阵对待编码信息序列进行LDPC编码，可以获得码率为R＝2/3的LDPC码字，其长度为4096/(2/3)＝6144比特；有2份待编码的待编码信息，所以总共编码获得2份编码码字，总长度为6144*2＝12288比特。
步骤S508、调制发送，将LDPC编码后的12288码字比特进行星座调制，例如采用QPSK(Quadrature Phase Shift Keying)调制成星座符号，并映射到系统分配的相应资源块中，并发送出去。
而在接收端的灵活结构化LDPC码的接收译码过程包括以下步骤：S0、接收解调收到的数据，从系统配置的资源块上接收发送给本接收端的数据，然后进行解调成LLR(Log Likelihood Ratio，对数似然比)信息，共有12288个LLR信息；S1、LDPC编码，将12288个LLR信息解码块分割获得2份LDPC码块的LLR信息长度分别为6144的待译码数据序列，并对2份待译码数据序列进行LDPC解码获得2份长度为4096比特的译码序列，其中从母码基础矩阵集合中选择译码使用的基础矩阵方法与以上的方法相同，依据传输块大小TBS(或者描述为编码块大小)和编码码率R的组合确定译码使用的基础矩阵；S2、解码块分割，将步骤S1中解码输出的2份长度为4096比特的译码序列合并成1个译码数据块即可获得收到的数据。
除了以上采用的传输块大小为8192比特长度的传输块外，还可以采 用其他任意长度的传输块，例如长度为400比特长度，那么就采用第3个基础矩阵集合的基础矩阵进行编码，此时由于系统比特数目等于KB*Z＝64*8＝512比特，所以需要进行缩短编码，所谓缩短即在待编码数据中填充一些哑元比特，哑元比特可以是0或者1等任意已知比特(填充比特和填充位置收发两端都是透明的，即都是已知)，此时需要填充512-400＝112比特，然后再进行编码，编码完后填充比特不传输，所以采用母基础矩阵集合可以支持任意比特长度的编码块长度，即可以有效解决灵活性问题。同时，当码率不等于以上表一的1/2和2/3时，如果码率高于2/3，则采用基准码率为2/3的基础矩阵进行编码，并打孔掉一些比特，打孔掉一些比特是指在LDPC码块中去除一些比特(可以是系统比特也可以是校验比特)，从而可以支持任意码率大于2/3的码字，码率在1/2到2/3之间，可以采用基准码率为1/2的基础矩阵进行编码，并打孔掉一些比特获得；至于码率低于1/2，则可以采用基准码率为1/2的基础矩阵进行编码，并打进行重复多传输一些比特获得相应码率低于1/2的码率的编码。所以灵活结构化LDPC编码方法可以支持灵活码长和码率的设计，非常适合于为了通信系统的信道编码方案。
在进行基准码率选择方式，也可以选择大于实际编码码率R的基准码率的基础矩阵进行编码，此时编码方法采用缩短编码，也可以获得低于基准码率的编码码字，如上的实现低于基准码率1/2的编码码字，则可以采用基准码率1/2的基础矩阵，在待编码序列中添加部分填充比特，然后再进行编码，然后再去除填充比特，此时看出实际编码码率就会低于基准码率1/2了。实现不同码率的实现方法不限于以上。
其中，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，依据以下至少之一参数确定LDPC编码所使用的基础矩阵：传输块大小TBS、应用场景、用户UE类型、频段、传输块大小TBS和码率R组合、信道类型、数据传输方向、TBS索引号和资源数NRB的组合、MCS索引号和资源数NRB的组合、码率R和资源数NRB的组合、带宽大小；其中，传输块大小TBS是大于0的整数；应用场景包括eMBB、URLLC和mMTC； 用户UE类型至少包括以下的2种类型：高速UE、低速UE、支持IR-HARQ的UE、不支持IR-HARQ的UE、低时延UE和大吞吐量UE；频段包括系统配置的频率范围；码率R是大于0且小于1的实数；信道类型包括控制信道、数据信道；数据传输方向包括上行数据、下行数据；TBS索引号是用于索引各个资源数的传输块大小TBS，TBS索引号是大于或者等于0的整数；MCS索引号是用于索引MCS方案，MCS索引号是大于或者等于0的整数；资源数NRB是系统配置的资源块数目；带宽大小是大于0的实数。
可选地，传输块大小TBS是TBS集合中的一个整数值，其中，TBS集合中包括A个子集合，依据传输块大小TBS在TBS集合中获取子集合索引号，依据获取的子集合索引号确定LDPC编码所使用的基础矩阵子集合；其中，A是大于0的整数，基础矩阵子集合中至少包括1个基础矩阵，传输块大小TBS由系统预先配置且是大于0的整数。依据码率R从基础矩阵子集合中选择LDPC编码所用的1个基础矩阵。
可选地，频段至少分为B个频段：0到C1GHz频段、C1GHz到C2GHz频段、…、C(B-2)GHz到C(B-1)GHz频段、大于C(B-1)GHz频段，其中，B是大于0的整数，C1、C2、…、C(B-1)是大于0的实数，而且C1≤C2≤C3≤…≤C(B-1)。
可选实施例二
在本可选实施例中提出的方法可以用于LTE移动通信系统或者未来第五代移动通信系统或者其他无线有线通信系统，数据传输方向为基站向移动用户发送数据(下行传输业务数据)，或者数据传输方向为移动用户向基站发送数据(上行传输业务数据)。上述通信系统也可以是新无线接入技术(new Radio Access Technology，简称为NR)系统，上述NR系统包括以下应用场景：增强移动宽带(enhanced Mobile Broadband，简称为eMBB)场景、超可靠低时延通信(Ultra-Reliable and Low Latency  Communications，简称为URLLC)场景和大规模物联网(massive Machine Type Communications，简称为mMTC)场景。
系统配置为上述3中场景中配置3个基础矩阵子集合，即母基础矩阵集合包括上述3个基础矩阵子集合，例如，用于eMBB场景的为基础矩阵子集合0，用于URLLC场景的为基础矩阵子集合1，用于mMTC场景的为基础矩阵子集合2。eMBB场景的数据量非常大，需要支持大吞吐量数据传输；URLLC场景的数据需要支持超高可靠和超低时延通信，数据量小和第一时间能通信，实时性要求非常高；mMTC需要大覆盖，数据量小，无需实时通信。系统配置给这3种应用场景中的基础矩阵集合如下，总共包括3个基础矩阵子集合，每个子集合包括1个基础矩阵，描述如下：
eMBB场景的基础矩阵HB0，最大扩展因子为1280：
Figure PCTCN2017104913-appb-000015
URLLC场景的基础矩阵HB1，最大扩展因子为128：
Figure PCTCN2017104913-appb-000016
mMTC场景的基础矩阵HB1，最大扩展因子为128：
Figure PCTCN2017104913-appb-000017
以上的基础矩阵不限于上述的基础矩阵，也可以描述为其他任意维数和数据大小的基础矩阵。发送端需要支持以上场景的一种，以及接收端也需要支持以上场景的一种。假设，上述发送端为基站侧，支持以上的3种应该场景，当接收端(终端)只支持其中应用场景之一，如果上述发送端要和上述接收端(终端)通信，那么需要采用与上述接收端(终端)的一样的通信方式，即采用相同应用场景下基础矩阵进行结构化LDPC编码。如，终端A只支持eMBB应用场景，则其向基站发送相应指令，上述指令至少包括2比特用于至少指示上述终端的应用场景，例如，‘00’指示 eMBB应用场景，‘01’指示URLLC应用场景，‘10’指示mMTC应用场景，此时终端向基站发送指令‘00’，然后与基站进行通信，采用如上上述的基础矩阵HB0(第0个基础矩阵子集合)。如果需要传输数据，则对数据进行码块分割、确定结构化LDPC编码基础矩阵、进行LDPC编码、调制并发送。基站侧对于上述信令的解释和终端侧是一致的。上述信令不限于以上形式。
如果终端支持以上的3种场景，如果在通信过程中，根据需要可以任意变换应用场景。当时应用场景发生改变，需要通知基站侧，即发送指令，然后进行通信。从以上的3种应用场景中的基础矩阵中可以看出，3个基础矩阵中的非-1元素(第二类元素)位置都是相同的，以及最大扩展因子之间是正整数倍关系，有益于：结构化LDPC码可以采用统一译码器，进而可以相互兼容，使得上述3种应用场景的设备可以共用同一套设备，简化硬件资源。
基站侧根据终端用户(UE)需要传输的应用场景数据类型，确定结构化LDPC编码基础矩阵子集合(本实施例中子集合中只有1个基础矩阵)，然后根据待传输的传输块大小对选择相应的基础矩阵或者修正基础矩阵，上述修正基础矩阵是指对基础矩阵中的第二类元素进行修改，以适合当前LDPC编码和对应的扩展因子。
本实施例中的应用场景中不限于以上的3种，还可以包括其他如高速移动场景、实时通信应用场景、大吞吐量数据传输场景等，以及不限于这些场景，对于每个场景都可以对应不同的结构化LDPC码基础矩阵参数和扩展因子。
可选实施例三
在本可选实施例中提出的方法可以用于LTE移动通信系统或者未来第五代移动通信系统或者其他无线有线通信系统，数据传输方向为基站向移动用户发送数据(下行传输业务数据)，或者数据传输方向为移动用户 向基站发送数据(上行传输业务数据)。根据用户UE类型来确定需要采用何种LDPC码编码基础矩阵子集合。所述用户UE类型包括：高速UE、低速UE、支持增量冗余混合自动重传(IR-HARQ)的UE、不支持IR-HARQ的UE、低时延UE和大吞吐量UE。其中，用户UE类型可以是所述所有类型中的至少2种，以及不限于以上所述的用户UE类型。
系统配置为每个用户UE类型提供1种基础矩阵子集合，例如以下2种：支持IR-HARQ的UE和不支持IR-HARQ的UE。支持IR-HARQ的UE所采用的基础矩阵子集合为HB0，其中包括4个基础矩阵；不支持IR-HARQ的UE所采用的基础矩阵子集合为HB1，其中包括4个基础矩阵。
接收端发送指令通知发送端可以发送支持IR-HARQ的数据，那么发送端向接收端发送的数据是支持IR-HARQ，即采用支持IR-HARQ的基础矩阵对数据进行编码。即发送端在确定LDPC编码使用的基础矩阵时，从支持IR-HARQ的基础矩阵子集合中选择合适的基础矩阵进行编码；而如果接收端指示不支持IR-HARQ，那么发送端在确定LDPC编码使用的基础矩阵时，从不支持IR-HARQ的基础矩阵子集合中选择合适的基础矩阵进行编码。如此操作有益效果在于：通信系统可以支持不同UE类型，有些UE不需要提高重传数据的性能或者比较低端，那么其可以不支持IR-HARQ的数据，而如果有些UE可能是比较高端或者技术比较先进，支持IR-HARQ的数据，从而使得系统更为灵活多样。
其中，以上所述的支持IR-HARQ的UE的基础矩阵子集合HB0和不支持IR-HARQ的UE的基础矩阵子集合HB1中，其中不支持IR-HARQ的UE的基础矩阵子集合HB1存在于所述支持IR-HARQ的UE的基础矩阵子集合HB0中，例如，HB1中第i个基础矩阵是HB1中第i个基础矩阵部分行构成，i＝0、1、2、3。可以描述为。从而使得，支持IR-HARQ的UE和不支持IR-HARQ的UE依然可以共用一套设备，即首传数据是完全相同的，只是传输数据有所不同，支持IR-HARQ的重传数据含有较多校验比特数据，而不支持IR-HARQ的重传数据和首传数据相同。
实施例4
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，所述步骤1中，所述母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
同时，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所 有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集，所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
根据以上所述的一种LDPC编译码方法，提供一个基础矩阵示例，扩展因子集合为Zset＝[2 4 6 8 10 12 16 20 24 32 40 48 64 80 96 128 160 192 256 320 384 512 640 768 1024 1280]。
Figure PCTCN2017104913-appb-000018
扩展因子集合为Zset＝[2 4 6 8 10 12 16 20 24 32 40 48 64 80 96 128 160 192 256 320 384 512 640 768 1024 1280]。各个扩展因子取自扩展因子集合Zset，获取各个基础矩阵的方法采用如下公式：
Figure PCTCN2017104913-appb-000019
所述母基础矩阵集合包括1份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s＝26个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
同时，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
可选地，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集，所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
以上所示的基础矩阵中有以下关系：Z＝[z1,z2,z3,z4,z5]＝[4,6,8,12,16,20]，F＝[F1,F2,F3,F4,F5]＝[12*z1,10*z2,8*z3,8*z4,4*z5]。
实施例5
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，所述步骤1中，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为4的变量节点个数为Bi，对应所述码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为4的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)， 则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为6的变量节点个数为Ci，对应所述码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
可选地，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为6的变量节点对应的基础矩阵子集合的列重量。
可选地，所述不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
按以上所述提供一种母基础矩阵集合，所述母基础矩阵集合包括1个基础矩阵子集合，参数为矩阵列数nb＝26，矩阵行数为mb＝18，系统列数kb＝nb-mb＝8。其中所述1个基础矩阵子集合包括26个不同扩展因子的基础矩阵。对应最大扩展因子的为1280的基础矩阵如下：
Figure PCTCN2017104913-appb-000020
扩展因子集合为Zset＝[2 4 6 8 10 12 16 20 24 32 40 48 64 80 96 128 160 192 256 320 384 512 640 768 1024 1280]。各个扩展因子取自扩展因子集合Zset，获取各个基础矩阵的方法采用如下公式：
Figure PCTCN2017104913-appb-000021
如图15所示，其中左边的一列1501所示的不同扩展因子，对应的码长为所述扩展因子与系统列数kb＝8的乘积；图15中从第2列开始的部分1502对应基础矩阵中不同的列索引，为0到25。如最后一行对应扩展因子为8，对应所述扩展因子为8的基础矩阵的girth为4的列数为8，而girth为6的为5，其余为girth为22；随着扩展因子增加(或者对应码长的增加)，girth为4的列数逐步减少，而girth为6的列数逐步增加。所述girth的数目也可以描述为扩展因子个，可以发现基础矩阵中每列的girth满足以上所述的关系。
实施例6
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单 位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：依据传输块大小TBS确定所述LDPC编码所使用的基础矩阵。所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
实施例7
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：依据码率R确定所述LDPC编码所使用的基础矩阵。所述码率R是所有码率集合CoderateSet中的一个元素，其中，所述码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时所述的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所述所有码率集合CoderateSet，A2是大于1的整数；
所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述码率R相等的所述码率Coderatei,然后确定所述的码率Coderatei对应的基础矩阵子集合Hbi。
实施例8
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：依据频段确定所述LDPC编码所使用的基础矩阵。所述频段是所有频段集合FBSet中的一个元素，其中，所述频段集合FBSet中包括A3个频段，同时所述的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，所述A3个频段中两两之间没 有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；所述频段中，如果信号的载波频率为相应的频段范围内，则认为采用所述对应频段的基础矩阵子集合。例如，有A3＝2个频段，4.8GHz～5.0GHz为频段1对应的基础矩阵为Hb1，42GHz～46GHz为频段2对应的基础矩阵为Hb2，如果发送信号的载波频率为4.9GHz，那么说明用的频段1，则使用基础矩阵Hb1。
所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述频段归属于频段集合FBSet的索引，然后确定所述频段对应的基础矩阵子集合Hbi。
实施例9
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：依据信道类型确定所述LDPC编码所使用的基础矩阵。所述信道类型包括：数据信道和信令信道。所述母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述信道类型，然后确定所述信道类型对应的基础矩阵子集合。
实施例10
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：依据数据传输方向确定所述LDPC编码所使用的基础矩阵。，所述母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述数据传输方向，然后确定所述数据传输方向对应的基础矩阵子集合。
实施例11
本实施例提供一种LDPC编译码方法，可以用于NR(新无线接入技术)通信系统，包括以下步骤：
1、从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
2、根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
其中，所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；
所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
以及，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。所述实际编码码率由系统的MCS索引指示出或者CQI指示或者是系统信令指示；所述输块大小TBS是由TBS索引和资源单元数目NRB共同指示的一个数值，LDPC码字大小是根据资源单元数目NRB中的资源粒子和调制阶数来计算得到，所述资源粒子可以是子载波或者其他承载1个星座符号的数据，所述调制阶数是整数，例如QPSK(正交相移编码，Quadrature Phase Shift Keying)调制为2、16QAM(Quadrature Amplitude Modulation，正交调幅)调制为4、32QAM调制为5、64QAM调制为6、128QAM调制为7、256QAM调制为8、512QAM调制为9、1024QAM调制为10。
以上实施例仅用以说明本公开的技术方案而非对其进行限制，本领域的普通技术人员可以对本公开的技术方案进行修改或者等同替换，而不脱离本公开的精神和范围，本公开的保护范围应以权利要求所述为准。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对相关技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
本公开的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；
S2，根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
可选地，在本实施例中，处理器根据存储介质中已存储的程序代码执行上述实施例记载的方法步骤。
可选地，本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者 分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的可选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。
工业实用性
通过本公开，从母基础矩阵集合中确定LDPC编码所使用的基础矩阵，其中，LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，第一类元素对应于全零方阵，第二类元素对应于单位阵根据第二类元素的值循环移位所获得的矩阵，全零方阵和单位阵的维数相等；根据LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码，使得LDPC编译码支持灵活的码长和码率，提高了LDPC编译码过程的灵活性，解决了相关技术中LDPC编译码过程缺少灵活性的问题。

Claims (56)

  1. 一种准循环LDPC编译码方法，包括：
    从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
    根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
  2. 根据权利要求1所述的方法，其中，从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵包括：
    根据预设参数确定所述LDPC编码所使用的基础矩阵，其中，所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小；
    其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道；所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是 大于0的实数。
  3. 根据权利要求2所述的方法，其中，
    所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；
    所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi。
  4. 根据权利要求3所述的方法，其中，依据实际编码码率或者输块大小TBS和LDPC码字大小的组合，从所述TBS子集合TBSsubseti对应的基础矩阵子集合Hbi中选择对应的基础矩阵。
  5. 根据权利要求2或3所述的方法，其中，
    所述码率R是所有码率集合CoderateSet中的一个元素，其中，所述码率集合CoderateSet中包括A2个码率Coderatei，i是0到A2-1之间的整数，同时所述的母基础矩阵集合包括A2个基础矩阵子集合Hbi，每个码率对应一个基础矩阵子集合；其中，所有A2个码率构成了完整的所述所有码率集合CoderateSet，A2是大于1的整数；
    所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述码率R相等的所述码率Coderatei,然后确定所述的码率Coderatei对应的基础矩阵子集合Hbi。
  6. 根据权利要求2所述的方法，其中，所述频段是所有频段集合FBSet中的一个元素，其中，所述频段集合FBSet中包括A3个频段，同时所述的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，所述A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；
    所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定与所述频段归属于频段集合FBSet的索引，然后确定所述频段对应的基础矩阵子集合Hbi。
  7. 根据权利要求2所述的方法，其中，所述母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述信道类型，然后确定所述信道类型对应的基础矩阵子集合。
  8. 根据权利要求2所述的方法，其中，所述母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述数据传输方向，然后确定所述数据传输方向对应的基础矩阵子集合。
  9. 根据权利要求1或5所述的方法，其中，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中选择大于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，A2是大 于1的整数。
  10. 根据权利要求1或5所述的方法，其中，所述母基础矩阵集合支持的A2个码率，每个码率对应一个基础矩阵子集合，所述码率包括：R0、R1、…、R(A2-1)，对应基础矩阵子集合分别为：Hb0、Hb1、…、Hb(A2-1)，其中，0<R0<R1<…<R(A2-1)<1；其中所述确定LDPC编码所使用的基础矩阵，包括：从[R0、…、R(A2-1)]中小于或等于R’并且与R’的差值最小的一个码率所对应的基础矩阵子集合，所述R’是实际编码码率，R’是大于0小于1的实数，所述A2是大于1的整数。
  11. 根据权利要求1所述的方法，其中，所述母基础矩阵集合中包括A4个基础矩阵子集合，所述A4个基础矩阵子集合的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，所述A4是大于1的整数。
  12. 根据权利要求11所述的方法，其中，
    所述A4个基础矩阵子集合的矩阵列数NBi相等；和/或，
    所述A4个基础矩阵子集合的矩阵行数MBi相等；和/或，
    所述A4个基础矩阵子集合的矩阵系统列数KBi相等；
    其中，i＝0、1、…、(A4-1)。
  13. 根据权利要求2至11中任一所述的方法，其中，所有基础矩阵子集合中所有列索引构成的列索引集合Colset，存在第一个列索引集合ColsetX和第二列索引集合ColsetY，第一列索引集合和第二列索引集合没有交集，且两个子集都不为空，第一列索引集合和第二列 索引集合都是Colset的子集，当列索引j属于第一列索引集合，每个基础矩阵子集合的第j列的第二类元素都属于同一集合EleSetj，其中EleSetj的第二类元素数目是小于或等于所有基础矩阵子集合的第j列的列重量的最大值；当列索引j属于第二列索引集合，任何两个基础矩阵子集合中第一基础矩阵子集合的第j列和第二基础矩阵子集合的第j列的交集的第二类元素数目小于等于2个，并且所述第一基础矩阵子集合、第二基础矩阵子集合的第j列的第二类元素数目都是大于等于3，其中，所述列重量是所述列中的第二类元素数目。
  14. 根据权利要求11所述的方法，其中，A4＝1，所述基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是所述第一个行索引集合中的任意2个元素，所述基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；所述第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
  15. 根据权利要求11所述的方法，其中，所述母基础矩阵集合中包括所述A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，所述A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
  16. 根据权利要求15所述的方法，其中，所述扩展因子集合Zseti中，包括：Zseti是Zset(i+1)的子集，其中i＝0、1、…、(A4-2)。
  17. 根据权利要求11所述的方法，其中，所述A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
  18. 根据权利要求2至17中任一项所述的方法，其中，所述母 基础矩阵集合中任意一个基础矩阵子集合中的任意校验列中的所有第二类元素值等于0。
  19. 根据权利要求2至18中任一项所述的方法，其中，所述母基础矩阵集合中任意一个基础矩阵子集合中从第L0行至尾行中的任意连续L1行正交，所述L1行正交是所述L1行中任意列索引的L1个元素值中至多有一个第二类元素值，所述L0是大于等于0小于5的一个整数，L1是大于0小于5的一个整数。
  20. 根据权利要求1所述的方法，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为4的变量节点个数为Bi，对应所述码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
  21. 根据权利要求20所述的方法，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为4的变量节点对应的基础矩阵子集合的列重量。
  22. 根据权利要求20所述的方法，其中，所述不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
  23. 根据权利要求1所述的方法，其中，所述母基础矩阵集合中 的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为6的变量节点个数为Ci，对应所述码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
  24. 根据权利要求23所述的方法，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为6的变量节点对应的基础矩阵子集合的列重量。
  25. 根据权利要求24所述的方法，其中，所述不同码长的girth为8的变量节点个数分别为D1＝K0*Z0，D1＝K1*Z1，...，D(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K1<＝K2<＝...<＝Ks；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...、N(s-1)的LDPC码的扩展因子，K0、K1...K(s-1)是大于或者等于1的正整数。
  26. 根据权利要求20至25中任一项所述的方法，其中，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵的第二类元素位置相同。
  27. 根据权利要求20至25中任一项所述的方法，其中，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持的码率相同。
  28. 根据权利要求26所述的方法，其中，所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵支持不同的码长，所述 支持不同码长的基础矩阵中的第二类元素是根据扩展因子和一个确定的扩展因子计算获得。
  29. 根据权利要求28所述的方法，其中，所述确定的扩展因子是对应于所述母基础矩阵集合的任意一个基础矩阵子集合中的所有基础矩阵所支持最大码长的扩展因子。
  30. 根据权利要求1所述的方法，其中，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
  31. 根据权利要求1所述的方法，其中，所述母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
  32. 根据权利要求31所述的方法，其中，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2 的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
  33. 根据权利要求31所述的方法，其中，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集，所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
  34. 一种准循环LDPC编译码装置，包括：
    确定模块，设置为从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等；
    编译码模块，设置为根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码，和/或，根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
  35. 根据权利要求34所述的装置，其中，所述确定模块设置为：
    根据预设参数确定所述LDPC编码所使用的基础矩阵，其中，所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小；
    其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：超高可靠低时延通信eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道；所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是大于0的实数。
  36. 根据权利要求35所述的装置，其中，
    所述传输块大小TBS是TBS集合TBSSet中的一个元素，其中，所述TBS集合中包括A1个TBS子集合TBSsubseti，同时所述的母基础矩阵集合包括A1个基础矩阵子集合Hbi，每个TBS子集合对应一个基础矩阵子集合；其中，A1是大于1的整数，所述A1个TBS子集中两两之间没有交集，所有A1个TBS子集合构成完整的所述TBS集合，i是0到A1-1之间的整数；
    所述确定模块设置为：确定所述传输块大小TBS所归属的所述的TBS子集合TBSsubseti，然后确定所述TBS子集合TBSsubseti对应 的基础矩阵子集合Hbi。
  37. 根据权利要求35所述的装置，其中，所述频段是所有频段集合FBSet中的一个元素，其中，所述频段集合FBSet中包括A3个频段，同时所述的母基础矩阵集合包括A3个基础矩阵子集合Hbi，每个频段对应一个基础矩阵子集合；其中，所述A3个频段中两两之间没有交集，所有A3个频段构成了完整的所有频段集合FBSet，A3是大于1的整数，i是0到A3-1之间的整数；
    所述确定模块设置为：确定与所述频段归属于频段集合FBSet的索引，然后确定所述频段对应的基础矩阵子集合Hbi。
  38. 根据权利要求35所述的装置，其中，所述母基础矩阵集合包括：数据编码使用的基础矩阵子集合和信令编码使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述信道类型，然后确定所述信道类型对应的基础矩阵子集合。
  39. 根据权利要求35所述的装置，其中，所述母基础矩阵集合包括：上行传输数据使用的基础矩阵子集合和下行传输数据使用的基础矩阵子集合，所述从所述母基础矩阵集合中确定所述LDPC编码所使用的基础矩阵，包括：确定所述数据传输方向，然后确定所述数据传输方向对应的基础矩阵子集合。
  40. 根据权利要求34所述的装置，其中，所述母基础矩阵集合中包括A4个基础矩阵子集合，所述A4个基础矩阵子集合的第i个基础矩阵子集合的维数为：矩阵列数分别为NBi，矩阵行数分别为MBi，矩阵系统列数分别为KBi，i＝0、1、…、(A4-1)，其中，MBi是大于0的整数，NBi是大于MBi的整数，KBi＝NBi-MBi，所述A4是大于1的整数。
  41. 根据权利要求40所述的装置，其中，
    所述A4个基础矩阵子集合的矩阵列数NBi相等；和/或，
    所述A4个基础矩阵子集合的矩阵行数MBi相等；和/或，
    所述A4个基础矩阵子集合的矩阵系统列数KBi相等；
    其中，i＝0、1、…、(A4-1)。
  42. 根据权利要求40所述的装置，其中，A4＝1，所述基础矩阵子集合的所有行索引构成的行索引集合Rowset，存在第一个行索引集合RowsetX和第二行索引集合RowsetY，j和k是所述第一个行索引集合中的任意2个元素，所述基础矩阵子集合中第j行和第k行正交；第一个行索引集合RowsetX和第二行索引集合RowsetY没有交集，且两个子集都不为空，第一个行索引集合RowsetX和第二行索引集合RowsetY都是Rowset的子集；所述第j行和第k行正交是在第j行和第k行中的任意列索引上的2个元素中最多有1个第二类元素。
  43. 根据权利要求40所述的装置，其中，所述母基础矩阵集合中包括所述A4个基础矩阵子集合，每个基础矩阵子集合所支持的扩展因子集合分别为Zseti，其中，i＝0、1、…、(A4-1)，所述A4个扩展因子集合中至少存在2个扩展因子集合所支持的元素数目不相等。
  44. 根据权利要求40所述的装置，其中，所述A4个基础矩阵的任意一个基础矩阵子集合中，列重大于1的矩阵列数目是大于25-10且小于25的正整数。
  45. 根据权利要求34所述的装置，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵所对应的二分图至少存在一个girth为4的短圈；所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为4的变量节点个数为Bi， 对应所述码长Ni的girth为6的变量节点个数为Ci，其中，i＝0,1,...,(s-1)，其中，码长存在关系N0<＝N1<＝...<＝N(s-1)，则B0>＝B1>＝...>＝B(s-1)，C0<＝C1<＝...<＝C(s-1)；其中，B0，B1，...，B(s-1)、C0，C1，...，C(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的整数。
  46. 根据权利要求45所述的装置，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为6的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为4的变量节点对应的基础矩阵子集合的列重量。
  47. 根据权利要求45所述的装置，其中，所述不同码长的girth为6的变量节点个数分别为C0＝K0*Z0，C1＝K1*Z1，...，C(s-1)＝K(s-1)*Z(s-1)，其中，存在关系Z0<＝Z1<＝...<＝Z(s-1)，则K0<＝K1<＝...<＝K(s-1)；其中，Z0、Z1、...和Z(s-1)是分别对应码长为N0、N1、...和N(s-1)的LDPC码的扩展因子，K0、K1...和K(s-1)是大于等于1的正整数。
  48. 根据权利要求34所述的装置，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合的奇偶校验矩阵的二分图至少存在一个girth为6的短圈和没有girth为4的短圈，所述基础矩阵子集合中第i个基础矩阵对应的码长是Ni，对应所述码长Ni的girth为6的变量节点个数为Ci，对应所述码长Ni的girth为8的变量节点个数为Di，其中，i＝0,1,...,(s-1)，其中，存在关系N0<＝N1<＝...<＝N(s-1),则C0>＝C1>＝...>＝C(s-1)，D0<＝D1<＝...<＝D(s-1)，其中，C0，C1，...，C(s-1)、D0，D1，...，D(s-1)和N0，N1，...，N(s-1)是大于1的整数，s是大于或者等于3的正整数。
  49. 根据权利要求48所述的装置，其中，所述母基础矩阵集合中的任意一个基础矩阵子集合中，所述girth为8的变量节点对应的基础矩阵子集合的列重量都小于或者等于所述girth为6的变量节点 对应的基础矩阵子集合的列重量。
  50. 根据权利要求34所述的装置，其中，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码率，其中每一种码率对应一个基础矩阵，其中任何2种码率所对应的2个基础矩阵中有x个第一类元素位置不同；或者，所述母基础矩阵集合的任意一个基础矩阵子集合支持多种码长，其中每一种码长对应一个基础矩阵，其中任何2种码长所对应的2个基础矩阵中有x个第一类元素位置不同，x是大于0小于10的整数。
  51. 根据权利要求34所述的装置，其中，所述母基础矩阵集合包括多份基础矩阵子集合，其中任意一个基础矩阵子集合{Hbi}包括s个基础矩阵，任意一个基础矩阵Hbi的所有列索引构成了列索引集合ColSet，所述的列索引集合可以划分为两个子集合Colsubset1和Colsubset2，其中，所述Colsubset1和Colsubset2互为补集，所述Colsubset1有Ci个元素，Colsubset2有Di个元素，i用于指示一个特定码长对应的一个基础矩阵Hbi，Hbi对应的扩展因子为Zi，其中i＝0,1，…,(s-1)，s是大于等于2的整数，Ci和Di是大于等于1的整数。
  52. 根据权利要求51所述的装置，其中，所述的任意一个基础矩阵Hbi中所有行索引和所有Colsubset1的列索引联合指示的子基础矩阵为Hbi(:,Colsubset1)，结合子基础矩阵Hbi(:,Colsubset1)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL1i,所述奇偶校验矩阵HL1i的girth为g；所述基础矩阵Hbi中所有行索引和所有Colsubset2的列索引联合指示的子基础矩阵为Hbi(:,Colsubset2)，结合Hbi(:,Colsubset2)和提升值Zi经过矩阵扩展得到一个奇偶校验矩阵HL2i,所述奇偶校验矩阵HL2i的girth为g-2，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs,则D1>＝D2>＝...>＝Ds，以及C1<＝C2<＝...<＝Cs；其中，g等于6或者8。
  53. 根据权利要求51所述的装置，其中，所述列索引集合ColSet还可以划分为第三子集合Colsubset3和第四子集合Colsubset4,其中，所述Colsubset3和Colsubset4互为补集，所述Colsubset1包含所述Colsubset3，所述Colsubset4包含所述Colsubset2，所述Colsubset3有Ei个元素，所述Colsubset4有Fi个元素，Ei和Fi是大于等于1的整数，其中特征在于，所述Colsubset2中的任一元素k和Colsubset3构成集合Colsubset5,其中，所有行索引和所有Colsubset5的列索引联合指示的子基础矩阵为Hbi(:,Colsubset5)，结合Hbi(:,Colsubset5)和扩展因子Zi经过矩阵扩展得到一个奇偶校验矩阵HL3i,所述奇偶校验矩阵HL3i的girth为6，其中i＝0,1，…,(s-1)，所述基础矩阵子集合所支持的所有扩展因子存在关系Z1<＝Z2<＝...<＝Zs，则F1>＝F2>＝...>＝Fs，E1<＝E2<＝...<＝Es。
  54. 一种LDPC编译码器，包括：
    处理芯片，用于从母基础矩阵集合中确定低密度奇偶校验LDPC编码所使用的基础矩阵，其中，所述LDPC编码所使用的基础矩阵中包括：第一类元素和第二类元素，所述第一类元素对应于全零方阵，所述第二类元素对应于单位阵根据所述第二类元素的值循环移位所获得的矩阵，所述全零方阵和所述单位阵的维数相等，所述母基础矩阵集合至少包括一个基础矩阵；
    编码器，用于根据所述LDPC编码所使用的基础矩阵对待编码信息序列进行LDPC编码；和/或，译码器，用于根据所述LDPC编码所使用的基础矩阵对待译码数据序列进行LDPC译码。
  55. 根据权利要求54所述的LDPC编译码器，其中，所述处理芯片用于：
    根据预设参数确定所述LDPC编码所使用的基础矩阵，其中，所述预设参数包括以下至少之一：传输块大小TBS、应用场景、用户 UE类型、频段、码率R，传输块大小TBS和码率R的组合、信道类型、数据传输方向、TBS索引号和资源单元数NRB的组合、调制编码方案MCS索引号和资源单元数NRB的组合、码率R和资源单元数NRB的组合、带宽大小；
    其中，所述传输块大小TBS是大于0的整数；所述应用场景包括：移动宽带增强eMBB、超高可靠低时延通信URLLC和大规模物联网mMTC；所述频段包括：系统配置的频率范围；所述码率R是大于0且小于1的实数；所述信道类型包括：控制信道和数据信道；所述数据传输方向包括：上行数据和下行数据；所述TBS索引号用于结合资源单元数目指示对应的传输块大小TBS，所述TBS索引号是大于或者等于0的整数；所述MCS索引号用于指示一个MCS方案或者一个调制阶数和TBS索引的组合，所述MCS索引号是大于或者等于0的整数；所述资源单元数NRB是系统配置的资源块数目；所述带宽大小是大于0的实数。
  56. 一种存储介质，所述存储介质包括存储的程序，其中，所述程序运行时执行上述权利要求1至33任一项中所述的方法。
PCT/CN2017/104913 2016-09-30 2017-09-30 准循环ldpc编译码方法、装置及ldpc编译码器 WO2018059588A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US16/338,333 US11133826B2 (en) 2016-09-30 2017-09-30 Quasi-cyclic LDPC coding and decoding method and apparatus, and LDPC coder and decoder
EP17855038.0A EP3522379A4 (en) 2016-09-30 2017-09-30 QUASI-CYCLIC LDPC ENCODING AND DECODING METHOD AND APPARATUS, AND LDPC ENCODER AND ENCODER
US17/486,652 US11637568B2 (en) 2016-09-30 2021-09-27 Quasi-cyclic LDPC coding and decoding method and apparatus, and LDPC coder and decoder
US18/138,702 US20230344450A1 (en) 2016-09-30 2023-04-24 Quasi-cyclic ldpc coding and decoding method and apparatus, and ldpc coder and decoder

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610877960.5A CN107888198B (zh) 2016-09-30 2016-09-30 准循环ldpc编译码方法、装置及ldpc编译码器
CN201610877960.5 2016-09-30

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US16/338,333 A-371-Of-International US11133826B2 (en) 2016-09-30 2017-09-30 Quasi-cyclic LDPC coding and decoding method and apparatus, and LDPC coder and decoder
US17/486,652 Continuation US11637568B2 (en) 2016-09-30 2021-09-27 Quasi-cyclic LDPC coding and decoding method and apparatus, and LDPC coder and decoder

Publications (1)

Publication Number Publication Date
WO2018059588A1 true WO2018059588A1 (zh) 2018-04-05

Family

ID=61762494

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/104913 WO2018059588A1 (zh) 2016-09-30 2017-09-30 准循环ldpc编译码方法、装置及ldpc编译码器

Country Status (4)

Country Link
US (3) US11133826B2 (zh)
EP (1) EP3522379A4 (zh)
CN (2) CN107888198B (zh)
WO (1) WO2018059588A1 (zh)

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10784901B2 (en) 2015-11-12 2020-09-22 Qualcomm Incorporated Puncturing for structured low density parity check (LDPC) codes
US10469104B2 (en) 2016-06-14 2019-11-05 Qualcomm Incorporated Methods and apparatus for compactly describing lifted low-density parity-check (LDPC) codes
CN107888198B (zh) * 2016-09-30 2023-05-26 中兴通讯股份有限公司 准循环ldpc编译码方法、装置及ldpc编译码器
US10756761B2 (en) * 2016-10-24 2020-08-25 Lg Electronics Inc. Method for dividing carrying block of LDPC code and apparatus therefor
WO2018084617A1 (ko) * 2016-11-04 2018-05-11 엘지전자 주식회사 Ldpc 코드의 운송블록 분할 방법 및 이를 위한 장치
CN115720128A (zh) * 2017-01-09 2023-02-28 中兴通讯股份有限公司 一种数据处理方法和装置
US10340949B2 (en) 2017-02-06 2019-07-02 Qualcomm Incorporated Multiple low density parity check (LDPC) base graph design
US10312939B2 (en) 2017-06-10 2019-06-04 Qualcomm Incorporated Communication techniques involving pairwise orthogonality of adjacent rows in LPDC code
CN109391367B (zh) * 2017-08-11 2022-12-30 华为技术有限公司 通信方法和装置
US11564128B2 (en) * 2018-08-06 2023-01-24 Ntt Docomo, Inc. Splitting an information block into sub-blocks
CN109412606B (zh) * 2018-09-30 2021-05-14 华南理工大学 基于生成矩阵的qc_ldpc码编码方法及编码器
CN111064475A (zh) * 2018-10-16 2020-04-24 华为技术有限公司 基于低密度奇偶校验码的译码方法及装置
US11336401B2 (en) * 2019-03-21 2022-05-17 Electronics And Telecommunications Research Institute Method of retransmission for downlink transmission in wireless communication system and apparatus for the same
CN110535558A (zh) * 2019-07-24 2019-12-03 中兴通讯股份有限公司 一种数据传输方法、装置和存储介质
CN113612486B (zh) * 2021-08-16 2024-02-20 重庆大学 一种构建pbrl ldpc码的基矩阵方法、系统、装置及存储介质
CN116436471A (zh) * 2021-12-30 2023-07-14 中兴通讯股份有限公司 编码和解码方法、通信设备和存储介质
CN117081605A (zh) * 2022-05-10 2023-11-17 华为技术有限公司 Ldpc的编译码方法和相关装置
CN115037412B (zh) * 2022-05-23 2023-11-17 山东大学 高动态通信系统中联合载波同步的自适应迭代译码方法
US20240056133A1 (en) * 2022-08-12 2024-02-15 Qualcomm Incorporated Ldpc base graph selection systems and methods
US20240097819A1 (en) * 2022-09-21 2024-03-21 Qualcomm Incorporated Signaling and reports for low density parity check graph adaptation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100318872A1 (en) * 2006-12-29 2010-12-16 Zte Corporation Decoding Method for LDPC Code Based on BP Arithmetic
CN102064835A (zh) * 2009-11-11 2011-05-18 中国科学院微电子研究所 适用于准循环ldpc译码的译码器
CN102386932A (zh) * 2011-11-02 2012-03-21 广州海格通信集团股份有限公司 Ldpc码的构造方法
CN102412842A (zh) * 2010-09-25 2012-04-11 中兴通讯股份有限公司 一种低密度奇偶校验码的编码方法及装置

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7581157B2 (en) 2004-06-24 2009-08-25 Lg Electronics Inc. Method and apparatus of encoding and decoding data using low density parity check code in a wireless communication system
WO2006039801A1 (en) 2004-10-12 2006-04-20 Nortel Networks Limited System and method for low density parity check encoding of data
CN100550655C (zh) * 2004-11-04 2009-10-14 中兴通讯股份有限公司 一种低密度奇偶校验码的编码器/译码器及其生成方法
CN100486150C (zh) 2005-01-23 2009-05-06 中兴通讯股份有限公司 基于非正则低密度奇偶校验码的编译码器及其生成方法
US7707479B2 (en) * 2005-12-13 2010-04-27 Samsung Electronics Co., Ltd. Method of generating structured irregular low density parity checkcodes for wireless systems
WO2008069460A1 (en) 2006-12-05 2008-06-12 Electronics And Telecommunications Research Institute Method of generating parity-check matrix, encoding/decoding method for low density parity-check code with variable information length and variable code rate and apparatus using the same
CN101431337A (zh) * 2007-11-09 2009-05-13 松下电器产业株式会社 提高编码并行度实现降低编码时延的方法
CN101686061A (zh) * 2008-09-27 2010-03-31 松下电器产业株式会社 构造低密度奇偶校验码的方法及发送/接收装置和系统
US20100153819A1 (en) * 2008-12-12 2010-06-17 Yeong-Luh Ueng Decoding Method and System for Low-Density Parity Check Code
US8433972B2 (en) * 2009-04-06 2013-04-30 Nec Laboratories America, Inc. Systems and methods for constructing the base matrix of quasi-cyclic low-density parity-check codes
CN102025441B (zh) 2009-09-11 2013-07-31 北京泰美世纪科技有限公司 Ldpc码校验矩阵的构造方法、ldpc码的编码方法和编码装置
US8595589B2 (en) 2011-09-30 2013-11-26 Mitsubishi Electric Research Laboratories, Inc. Quasi-cyclic low-density parity-check codes
CN102687445B (zh) 2011-12-30 2015-01-21 华为技术有限公司 前向纠错编、解码方法、装置及系统
CN104868925B (zh) 2014-02-21 2019-01-22 中兴通讯股份有限公司 结构化ldpc码的编码方法、译码方法、编码装置和译码装置
US10313054B2 (en) * 2015-01-07 2019-06-04 Avago Technologies International Sales Pte. Limited Low density parity check (LDPC) codes for communication devices and systems
WO2017084024A1 (zh) * 2015-11-17 2017-05-26 华为技术有限公司 低密度奇偶校验码的译码方法和译码器
WO2017131813A1 (en) 2016-01-29 2017-08-03 Intel IP Corporation Rate matching using low-density parity-check codes
US20190181882A1 (en) * 2016-08-12 2019-06-13 Telefonaktiebolaget Lm Ericsson (Publ) Determining elements of base matrices for quasi-cyclic ldpc codes having variable code lengths
CN107888198B (zh) * 2016-09-30 2023-05-26 中兴通讯股份有限公司 准循环ldpc编译码方法、装置及ldpc编译码器

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100318872A1 (en) * 2006-12-29 2010-12-16 Zte Corporation Decoding Method for LDPC Code Based on BP Arithmetic
CN102064835A (zh) * 2009-11-11 2011-05-18 中国科学院微电子研究所 适用于准循环ldpc译码的译码器
CN102412842A (zh) * 2010-09-25 2012-04-11 中兴通讯股份有限公司 一种低密度奇偶校验码的编码方法及装置
CN102386932A (zh) * 2011-11-02 2012-03-21 广州海格通信集团股份有限公司 Ldpc码的构造方法

Also Published As

Publication number Publication date
US20230344450A1 (en) 2023-10-26
CN107888198A (zh) 2018-04-06
CN116683917A (zh) 2023-09-01
US20220085830A1 (en) 2022-03-17
CN107888198B (zh) 2023-05-26
EP3522379A4 (en) 2019-09-11
US11133826B2 (en) 2021-09-28
EP3522379A1 (en) 2019-08-07
US11637568B2 (en) 2023-04-25
US20200028523A1 (en) 2020-01-23

Similar Documents

Publication Publication Date Title
WO2018059588A1 (zh) 准循环ldpc编译码方法、装置及ldpc编译码器
US10868567B2 (en) Methods and systems for encoding and decoding for LDPC codes
US10742350B2 (en) Method and apparatus of rate-matching for communication and broadcasting systems
US11637653B2 (en) Method and apparatus of rate-matching for communication and broadcasting systems
US20180278370A1 (en) Apparatus and method of transmission using harq in communication or broadcasting system
EP3954072B1 (en) Method and apparatus for data transmission in wireless communication system
CN111565052B (zh) 结构化ldpc码的数据处理方法及装置
US11671115B2 (en) High-rate long LDPC codes
US20230275696A1 (en) Method and apparatus for encoding/decoding channel in communication or broadcasting system
US20180331783A1 (en) Method and apparatus for coding/decoding in a comminication or broadcasting system using high-order modulation
CN109314524A (zh) 使用通用极化码时通过异构内核进行速率匹配的系统和方法
CN115065368A (zh) 一种准循环低密度奇偶校验编码处理方法及装置
CN111357218B (zh) 用于在通信或广播系统中对信道进行编码和解码的方法和设备
KR102509968B1 (ko) 통신 또는 방송 시스템에서 harq 적용시 전송 방법 및 장치
US20230253984A1 (en) Method and apparatus for data decoding in communication or broadcasting system
AU2018288953A1 (en) Method and apparatus for channel encoding and decoding in communication or broadcasting system
EP4383604A1 (en) Method and device for transmitting or receiving signal in communication system
US20240214322A1 (en) Method and device for transmitting or receiving signal in communication system
KR20180107701A (ko) 통신 또는 방송 시스템에서 harq 적용시 전송 방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17855038

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2017855038

Country of ref document: EP

Effective date: 20190430