System and method for quasi-cyclic low density parity check (QC-LDPC) codes with 1 / 2 code rates
By introducing quasi-cyclic low-density parity-check (QC-LDPC) codes and the Cattell-Lao boosting technique, the problem of computationally intensive encoding caused by the high density of the LDPC code generator matrix is solved, achieving a more efficient encoding and decoding process, which is suitable for wireless communication systems.
Patent Information
- Application Number
- CN202510907252.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2025-06-10
- Filing Date
- 2025-07-02
- Publication Date
- 2026-01-06
AI Technical Summary
In existing wireless communication systems, the generator matrix of low-density parity-check (LDPC) codes is high-density, resulting in a computationally intensive coding process that is difficult to perform efficiently in practical applications.
Quasi-cyclic low-density parity-check (QC-LDPC) codes are adopted. Technological improvements are achieved by using a parity-check matrix and a generator matrix with a quasi-cyclic structure. A new parity-check matrix is generated through Cattery-Lao lift and Cattery-Lao product operations, simplifying the encoding process.
It achieves efficient encoding and decoding in wireless communication, improves encoding efficiency, is applicable to IEEE 802.11n to 802.11be standards, and supports longer block lengths and lower error rates.
Smart Images

Figure CN121283429A_ABST
Abstract
Description
[0001] Cross-citation of related applications
[0002] This application claims the benefit of priority to U.S. Provisional Patent Application No. 63 / 667,253, filed July 3, 2024, the entire contents of which are incorporated herein by reference for all purposes. Technical Field
[0003] This disclosure generally relates to systems and methods for improving the encoding and / or decoding processes of communication systems using quasi-cyclic low-density parity-check (QC-LDPC) codes. Background Technology
[0004] Error correction codes enable the reliable exchange of information data between a transmitter communication system and a receiver communication system. The transmitter communication system encodes the information data to obtain codewords. A codeword is the encoded information data. The transmitter communication system transmits the codewords to the receiver communication system. Due to noise in the communication channel, the transmission received by the receiver communication system may differ from the transmitted codewords. Encoding the information data allows the receiver communication system, with an appropriate decoding process, to recover the information data from the received transmission despite such noise. For example, the transmitter communication system transmits parity bits to the receiver communication system. Parity bits allow the receiver communication system to verify whether the received transmission is a valid codeword, and if the received transmission is not a valid codeword, then correct the error in the transmission. In one approach, generating parity bits involves a complex process. Summary of the Invention
[0005] In one aspect, this disclosure relates to an apparatus comprising: a transmitter and one or more processors, wherein the one or more processors are configured to: identify a first binary parity check matrix for quasi-cyclic low-density parity check (QC-LDPC) codes based on a code rate of 1 / 2 and a code block size of 7776 bits, the first binary parity check matrix corresponding to a first exponential matrix; and encode data using the first binary parity check matrix; and the transmitter is configured to transmit the encoded data.
[0006] On the other hand, this disclosure relates to a method comprising: identifying a first binary parity check matrix for quasi-cyclic low-density parity check (QC-LDPC) codes by one or more processors of a first device according to a code rate of 1 / 2 and a code block size of 7776 bits, the first binary parity check matrix corresponding to a first exponential matrix; encoding data by the one or more processors of the first device using the first binary parity check matrix; and transmitting the encoded data by the one or more processors of the first device.
[0007] On the other hand, this disclosure relates to an apparatus comprising: a receiver configured to receive encoded data; and one or more processors configured to: identify a first binary parity check matrix for quasi-cyclic low-density parity check (QC-LDPC) codes based on a code rate of 1 / 2 and a code block size of 7776 bits, the first binary parity check matrix corresponding to a first exponential matrix; and decode the received encoded data using the first binary parity check matrix. Attached Figure Description
[0008] The various objectives, aspects, features, and advantages of this disclosure will become more apparent and better understood through a detailed description taken in conjunction with the accompanying drawings, in which similar reference numerals are used throughout to identify corresponding elements. In the drawings, similar reference numerals generally indicate identical, functionally similar, and / or structurally similar elements.
[0009] Figure 1 It is a diagram depicting an instance communication environment having a communication system according to one or more embodiments.
[0010] Figure 2 This is a schematic block diagram of a computing system according to an embodiment.
[0011] Figure 3 It is a graph depicting an instance index matrix according to one or more embodiments.
[0012] Figure 4 It is a diagram depicting an instance shifted identity matrix according to one or more embodiments for generating a parity check matrix.
[0013] Figure 5 It is a graph depicting an instance parity check matrix according to one or more embodiments.
[0014] Figure 6 It is a graph depicting an instance index matrix according to one or more embodiments.
[0015] Figure 7A and Figure 7B It is a diagram depicting an instance index matrix and an instance binary parity check matrix according to one or more embodiments.
[0016] Figures 8A to 8C It is a diagram depicting an instance exponent matrix, an instance binary matrix λ (also called a “compact matrix” or “λ matrix”) and an instance binary parity matrix according to one or more embodiments.
[0017] Figure 9 This is a flowchart illustrating the process of encoding and / or decoding data using LDPC codes according to an embodiment.
[0018] Details of various embodiments of the method and system are set forth in the accompanying drawings and the description below. Detailed Implementation
[0019] The following disclosure provides numerous different embodiments or instances for implementing various features of the provided subject matter. Specific examples of components and arrangements are described below to simplify this disclosure. Of course, these are merely examples and are not intended to be limiting. For example, in the following description, a first feature communicating or communicatively coupled to a second feature may include embodiments in which the first feature directly communicates with or is directly coupled to the second feature, and may also include embodiments in which an additional feature may be situated between the first and second features such that the first feature indirectly communicates with or is indirectly coupled to the second feature. Furthermore, reference numerals and / or letters may be repeated throughout the disclosure. Such repetition is for simplicity and clarity and does not in itself indicate a relationship between the various embodiments and / or configurations discussed.
[0020] In one aspect, a parity check matrix is defined as a set of equations satisfied by any valid codeword. Parity check matrices can be used to encode low-density parity check (“LDPC”) codes, described by Richardson and Urbanke in IEEE Transactions on Information Theory, Vol. 47, No. 2 (February 2001). Typically, many wireless and wired communication systems use LDPC as a forward error correction coding scheme. However, the longest block length (in bits) of coded data supported in the 802.11 standards (e.g., 802.11n to 802.11be) is 1944. Limited gain may exist in radio channels (e.g., 2x2 multiple-input multiple-output channels), which can be achieved using a block length of 1944.
[0021] To address this issue, according to certain aspects, embodiments of this disclosure relate to techniques for supporting or providing LDPC codes with a block length of 7776 and a code rate of 1 / 2. A block length of 7776 is four times the block length of the longest code supported in the 802.11n to 802.11be standards (e.g., a block length of 1944). In some embodiments, the LDPC code has a quasi-cyclic (QC) structure, which facilitates efficient encoding and decoding. In some embodiments, the QC-LDPC code may be a type of structured LDPC code that can be used in many practical applications, including the IEEE 802.11n, 802.11ac, 802.11ax, and 802.11be standards. In the QC-LDPC code, the parity check matrix has a cyclic structure that repeats itself in a quasi-cyclic manner, which simplifies the encoding and decoding process, thereby making the QC-LDPC code more efficient. The block size (represented by n) refers to the total number of encoded or transmitted bits as a result of encoding data using error correction codes (e.g., LDPC). The number of information bits (denoted by k) refers to the number of bits carrying the data to be encoded using error correction codes. The code rate (denoted by R) is the ratio of the number of information bits to the block size (R = k / n). In some embodiments, the LDPC encoder may take a block of k information bits (e.g., k = 3888) and produce n encoded bits, where the code rate is R = k / n (e.g., R = 1 / 2, n = 7776). The LDPC decoder may operate on the n received bits (noisy version) and (ideally) recover the k information bits. In some embodiments, the LDPC encoder may take a block of k information bits as input, encode the k-bit block to produce a block of n encoded bits (n = 7776), where the code rate is 1 / 2 (R = k / n).
[0022] Typically, the parity check matrix of a code represents an equation for determining whether an error occurred during transmission. More formally, for all valid codewords (i.e., the error-free bits generated by the encoder), the following equation holds:
[0023] Hc = 0……………(Equation 1)
[0024] In Equation 1, "H" is the parity check matrix, "c" is the codeword vector, and "0" is a vector of all zeros. The parity check matrix H is one way to describe a code.
[0025] The code generator matrix G satisfies the following equation:
[0026] sG=c……………(Equation 2)
[0027] In Equation 2, “s” is a vector of information bits, “G” is the generator matrix, and “c” is the codeword corresponding to “s”. In some embodiments, the system (e.g., Figure 1The communication system 108, which includes a decoder 160, can use Equation 2 to decode the codeword c to obtain the decoded data s.
[0028] According to the matrix equations above, the parity check matrix and the generator matrix of the code are related. Generally, if the parity check matrix is low-density, the corresponding generator matrix will be high-density, and vice versa. LDPC codes are thus characterized by a low-density parity check matrix and a high-density generator matrix. The density of the matrix is related to the number of operations that must be performed to implement one of the above equations. Although it was recognized by 1995 that LDPC codes could be used to transmit data with very few errors, i.e., with an error rate as good as or better than that of turbine codes, a drawback of LDPC codes is that their generator matrices are high-density, which makes the encoding computationally intensive, thus making the codes impractical for many applications.
[0029] In some implementations, the parity check matrix may have a quasi-cyclic structure, for example, the parity check matrix for QC-LDPC codes (n = 7776, k = 3888, R = 1 / 2). For example, given a lift size z, the parity check matrix may have multiple submatrices such that each submatrix is a cyclically shifted version of an identity matrix of size (z x z), where z = 162. The parity check matrix can be represented in two equivalent forms: (1) the parity check matrix H and (2) the block matrix or exponential matrix P = E(H).
[0030] In some implementations, the parity check matrix H can be a binary matrix of size m x n (where each of m and n is an integer). The elements of the parity check matrix are binary values. Given a block length n and a code rate R, the LDPC code (or QC-LDPC code) LDPC(n,R) satisfies the following equation:
[0031] k = nR……………(Equation 3)
[0032] m=n(1-R)……………(Equation 4)
[0033] In some embodiments, a block matrix or an exponent matrix (QC-LDPC exponent matrix) can be obtained. Given a lifting size z, the exponent matrix P = E(H) can have a size of m / z x n / z. If n = 24z (e.g., n = 7776, z = 324), then the size of P = E(H) is 24(1 - R) x 24 (= n(1 - R) / z x n / z). The elements of the exponent matrix can be integer values corresponding to cyclic shift values of the identity matrix of size z x z. The parity-check matrix H can be a sparse binary matrix that can be derived from the exponent matrix P = E(H). The generator matrix G can have a size of n x k in binary form (e.g., the elements of the generator matrix G are binary values). The exponent matrix P = E(H) can have a structure that includes multiple sub-matrices (e.g., A, B, C, D, E, T).
[0034] In some embodiments, the binary QC-LDPC code LDPC(n,R) can be characterized by the null space of an n(1 - R)×n parity-check matrix H. The parity-check matrix H can be a binary sparse matrix that includes a set of circulant matrices of size z x z. The parity-check matrix H of the QC-LDPC code can be equivalently represented by the exponent matrix P = E(H). This representation can help to illustrate the graphical structure of the underlying code as a base graph and shifted coefficients.
[0035] In some embodiments, the parity-check matrix H can be generated from the exponent matrix P = E(H). The exponent matrix P = E(H) can include (as elements) shift values d in the range 0 <= d < z and d = -1. For example, if z = 7, then the shift values d can include -1, 0, 1, 2, 3, 4, 5, 6. The shift value d = 0 can correspond to (or map to) the identity matrix of size z x z represented by I(z). The shift value d = -1 can correspond to (or map to) the zero matrix of size z x z represented by 0*I(z) (all elements are zero). Any other integer value d in [1, z - 1] can correspond to (or map to) a matrix that is cyclically right-shifted from I(z). The parity-check matrix H can be obtained from the exponent matrix P by expanding the exponent matrix P such that each element (as the shift value d) of the exponent matrix P is replaced by a matrix corresponding to the shift value.
[0036] In some embodiments, the exponent matrix P = E(H) can include multiple elements P1,1, P1,2, P1,3, …, P1,ń; P2,1, P2,2, P2,3, …, P2,ń; …, P1,1, P1,2, P1,3, …, which correspond to values, where and ń satisfy the following equations: <00(1-R) / z……………(Equation 5)
[0038] ń=n / z……………(Equation 6)
[0039] The exponential matrix (or permutation matrix) P = E(H) can be represented as follows:
[0040]
[0041] By replacing each element of the matrix with a matrix C(d) corresponding to the shift value (as the shift value d), the corresponding parity check matrix H can be obtained, as follows:
[0042]
[0043] For example, matrix C(1) can be represented as follows:
[0044]
[0045] In some implementations, the encoder may use a generator matrix (e.g., using Equation 2) to generate codewords. In some embodiments, the encoder may use a parity check matrix (instead of a generator matrix) to generate codewords from a vector of information bits. After obtaining the parity check matrix H, the parity check matrix H may have submatrices A, B, C, D, T, and E. The upper region O of submatrix T may correspond to a region in which the matrix contains all zeros, and the other regions may represent positions that may contain 1s.
[0046] In some implementations, the codeword c can be obtained through the following expression:
[0047] c = [sp1 p2].........(Equation 10),
[0048] Where “s” is the vector of information bits to be encoded, “p1” is the vector of the first g parity bits, and “p2” is the vector of the remaining mg parity bits.
[0049] Vectors p1 and p2 can be obtained through the following equation:
[0050] Φ=-ET -1 B+D........(Equation 11);
[0051] p1 T =-Φ -1 (-ET -1 A+C)s T ...(Equation 12); and
[0052] p2 T =-T -1 (As T +Bp1T (Equation 13).
[0053] Although the various embodiments disclosed herein are described as being used for encoding data for wireless communication (e.g., wireless local area networks (WLANs) conforming to any IEEE 802.11 standard), the principles disclosed herein are applicable to other types of communication (e.g., wired communication) or any process for performing the encoding of LDPC codes.
[0054] In some implementations, the system and / or method may use Khatri-Rao lifting (e.g., using the Khatri-Rao product) to generate LDPC codes with a code rate of 1 / 2. For example, the system may use a base LDPC code (as the mother code) to recursively construct LDPC codes with a block length twice that of the base LDPC code. Like QC-LDPC codes, the mother code may be defined by a parity check matrix H or an exponent matrix P = E(H). Each entry in P may be an integer value corresponding to a cyclic shift of an identity matrix of size z x z.
[0055] In some implementations, the system may determine (e.g., compute, operate on, obtain) a binary matrix Γ having the same size (or dimension) as P = E(H). The binary matrix Γ may contain submatrices, which are commutative matrices. The power of (e.g., a 2nd order commutative matrix). A matrix Γ, whose non-zero values (1) can be randomized such that the rank of the binary matrix remains full while the binary matrix conforms to good LDPC code performance (e.g., achieving a low block error rate). The system can perform a computer search (e.g., using one or more processors) to identify the optimal Γ that produces the minimum block error performance (e.g., block error rate (PER)). For example, for a Wi-Fi code with a code rate R, matrix Γ can maintain full rank, which is equal to 24(1-R). For example, for a code rate of R = 1 / 2, binary matrix Γ can have a dimension of 12x24 (12 rows, 24 columns) and a full rank of 12 (= 24(1-1 / 2)). The rank of a matrix refers to the maximum number of linearly independent columns of the matrix, or the dimension of the vector space generated by the columns of the matrix.
[0056] In some implementations, LDPC codes generated (e.g., constructed, created) using the Cattell-Lao boosting scheme can be used to design Wi-Fi LDPC codes with a block length of 7776 bits from existing LDPC codes with a block length of 3888 bits.
[0057] When the matrices involved are appropriately partitioned, the Catari-Lao product is an extension of the block-by-block Kronecker product operation. The Catari-Lao product can be defined as follows. Consider two matrices A and B of order (dimension or size) u×v and p×q, respectively. In partitioned form, A = (a i,j And B = (b) k,l Additionally, let A = (A i,j ) is divided, where the order u i ×v j A i,j Let B be the (i,j)th submatrix block, and B = (B i,j ) is divided, where order p k ×q l B i,j For the (k,l)th submatrix block, where ∑ i u i =u,∑ j v j =v,,∑ k p k =p, Σ l q l The Cattell-Lao product operation of two matrices A and B can be defined as follows:
[0058]
[0059] in It is the Cattell-Lao product operation. It is order u i p i ×v j q j The Kronecker product, and the overall output Having order ∑ i u i p i ×∑ j v j q j When the matrix involved can be well partitioned, the block-by-block Kronecker product is expanded. An example of calculating the Cattell-Lao product is shown below. Let...
[0060]
[0061] Then, when u i =1,v i =1, 1≤i≤2, 1≤j≤4 and p k =q l When =2,1≤k≤2,1≤l≤4, the Cattell-Lao product of A and B is given by the following formula.
[0062]
[0063] In some embodiments, the system may perform (e.g., calculate, operate on) the Cattell-Lao boost as follows. Let P≡E(H) be the exponent matrix of the parity check matrix H corresponding to the QC-LDPC code. The exponent matrix may contain integer values between -1, 0, ..., z-1, where z is the code design parameter. For a block length of 1944, the system may use z = 81 for the Wi-Fi error correction code. The identity matrix is made up by the constituent entries of P. Cyclic shifting allows the parity check matrix H to be obtained from the P matrix. The system can determine (e.g., calculate, operate, obtain) the new code matrix using the following equation 15.
[0064]
[0065] in It is the Cattell-Lao product operation, where Γ is a binary matrix. It is a matrix of all 1s with the same order (dimension or size) as the Γ matrix (e.g., u×v), and This is called a commutative matrix of order 2. The operation involving matrix exponentiation (⊙) is defined as follows:
[0066]
[0067] B has a dimension of (u×v).
[0068] In some implementations, the system can generate (e.g., compute, operate on, obtain) a (new) parity check code by calculating the Cattell-Lao product (using Equation 16) of the parity check matrix (of size m x n) of the basic code and the binary (random) matrix Γ. In some implementations, the system can determine the binary matrix Γ by iteratively changing the entries of the matrix and finding one or more optimal matrices based on the number of shortest loops and / or block error performance.
[0069] In some implementations, similar to QC-LDPC codes, the system may define (e.g., compute, operate, obtain, generate) the base code as a parity check matrix H or an exponential matrix E(H). The system may compute (e.g., generate, operate, obtain, determine) a binary matrix Γ having the same size as E(H). In some implementations, if H is chosen as the representation of the parity check matrix, then matrix Γ may have the same size as H. Matrix Γ may contain submatrices that are powers of the commutation matrix J(2). The non-zero values of the binary matrix Γ (e.g., the value "1") may be randomized such that the resulting matrix conforms to good LDPC code performance (e.g., block error performance). For example, the system may randomize the non-zero values of the binary matrix Γ (which has a dimension of (u×v)) such that for a Wi-Fi error correction code with a code rate of R, matrix Γ maintains full rank, which is equal to min(u,v) = 24(1-R). In some embodiments, the system may verify the binary matrix Γ from a given parity check matrix and base matrix. For example, the system can verify the performance of a binary Γ matrix based on a given parity check matrix and a fundamental matrix. In some embodiments, the binary Γ matrix can be any full-rank binary matrix Γ. A matrix (called matrix A) is full-rank if its rank is the highest rank available for matrices of the same size.
[0070] In some implementations, the system can define, generate, or create a new quasi-cyclic (QC)-LDPC codebook with a block length of n = 7776 bits, a rate of R = 1 / 2, and a message length of k = 1 / 2 * 7776 = 3888 bits. The system can define, generate, or create a parity check matrix H with a size of (1-R) * n x n = 1296 x 7776 (see [link to implementation details]). Figure 7B The system can define, generate, or create an exponential matrix E(H) equivalent to H (see [link to documentation]). Figure 7A E(H) has a size of 24*(1-R) x 24 and contains cyclic shift values such that each entry is mapped to a cyclic matrix of size Z = 324 (see [link to cyclic matrix]). Figure 3 The elements of E(H) are integers between -1 and Z-1 (Z = 324). The codebook can be defined based on E(H). E(H) can be used as follows: Figure 4 Equations 7 to 9 shown in the figure are mapped to H. The new QC-LDPC code with a block length of n = 7776 bits and a rate of R = 1 / 2 has the following code properties: (1) the code map corresponding to the code has been optimized to achieve the lowest encirclement length, thereby producing the lowest lower error limit; and (2) the decoding threshold is within 2 dB of the random linear code in the AWGN channel.
[0071] In some implementations, the system may use methods such as direct encoding, resource unit (RU) encoding, or variations thereof to employ the parity check matrix (see [link to implementation]). Figure 7BThe system performs data encoding. Here, "RU encoding" refers to a method in which different RUs within the channel can use different modulation and coding schemes (e.g., QAM level and LDPC code rate) to adapt to changing channel conditions. In some implementations, the system can encode the data using an equivalent generator matrix G according to Equation 2. The generator matrix G is equivalent to the parity check matrix H and can be located in the null space of H.
[0072] In some implementations, the system may use message-passing-based algorithms to perform data decoding. In some implementations, the system may use substructures for parallel and / or concurrent decoding.
[0073] In some implementations, the system can decompose a (n = 7776, k = 3888) QC-LDPC code (e.g., a parity check matrix or an exponent matrix) into a product-lifted (3888, 1944) code. Using a compact matrix λ, the system can view the parity check matrix as the product of two lifted codes (n = 3888, k = 1944). Let P be the exponent matrix corresponding to the (3888, 1944) code. The compact matrix λ and the exponent matrix P can have the same size 24*(1-R) x 24 (see [link to documentation]). Figure 3 ).
[0074] In some implementations, given a first QC-LDPC code (n = 7776, k = 3888), the system can identify, look up, obtain, or compute a second QC-LDPC code (n = 7776, k = 3888), which is the Cattell-Lao product of the parity check matrix of the (3888, 1944) fundamental code and the binary matrix Γ (see Equation 16). This process helps to decompose the parity check matrix of the first QC-LDPC code (referred to as the “first parity check matrix”) into two existing codes of block length = 3888, and thus provides a means to perform parallel encoding / decoding. The exponent matrix of the second QC-LDPC code (referred to as the “second exponent matrix”) may have a size of 48*(1-R) x 48 and contain cyclic shift values such that each of the entries is mapped to a cyclic matrix of size Z = 324 / 2 = 162 = 2*81 (see Equation 16). Figure 6 It should be noted that Z = 81 is the value specified in IEEE 802.11n. The parity check matrix of the second QC-LDPC code (called the "second parity check matrix") may differ from the parity check matrix of the first QC-LDPC code (the first parity check matrix), but their overall graph structure and performance may be similar.
[0075] Mathematically, for each element d∈E1(H) (which is the first exponent matrix of the first QC-LDPC code), the 2x2 submatrix can be replaced, with the following mapping:
[0076]
[0077] The corresponding λ(d) → mod(d, 2)…………(Equation 18).
[0078] In some implementations, given a first exponential matrix E(H) (referred to as "E1(H)"), the system can apply the above mappings (Equations 17 and 18) to E1(H) to obtain a second exponential matrix E(H) (referred to as "E2(H)") and a compact matrix λ. Examples of the first exponential matrix, the second exponential matrix, and the compact matrix λ are respectively... Figure 7A , Figure 8A and Figure 8B It is displayed in the middle.
[0079] In some implementations, given a first QC-LDPC code, the system can homomorphically rearrange the E(H) and H matrices of the first QC-LDPC code (referred to as "E1(H)" and "H1", respectively) to obtain the E(H) and H matrices of the second QC-LDPC code (referred to as "E2(H)" and "H2", respectively). The system can rearrange matrix E1(H) such that the positions of one, more, or all elements or submatrices are moved such that the rearranged matrix E2(H) contains the same elements as E1(H). In some implementations, given E1(H) of size m×n (m and n are positive integers), the system can rearrange matrix E1(H) using the following equation to obtain the rearranged matrix E2(H):
[0080] E2(H) = A*E(H)*B…………(Equation 19)
[0081] A*E(H)*B is also a valid matrix, where A and B are permutation matrices of size m×m and n×n, respectively. Permutation matrices A and B are binary matrices (i.e., containing only 0 and 1 entries), and their inverses are their transposes, as follows:
[0082] inv(A) = transpose(A); and inv(B) = transpose(B)…………(Equation 20).
[0083] Similarly, the parity check matrix H2 can be homomorphically rearranged while retaining the same decoding properties as the parity check matrix H1. The mappings shown in Equations 17 and 18 are a special case in which permutations are performed in the form of a single commutative matrix operation.
[0084] In some implementations, an apparatus may include a transmitter and one or more processors. The processors may be configured to identify a first binary parity matrix for quasi-cyclic low-density parity-check (QC-LDPC) codes, based on a 1 / 2 code rate and a 7776-bit code block size, the first binary parity matrix corresponding to a first exponential matrix. The processors may be configured to encode data using the first binary parity matrix. The transmitter may be configured to transmit the encoded data.
[0085] In some implementations, the first exponential matrix may have 1152 values. One or more processors may be further configured to generate the first exponential matrix based at least on a second exponential matrix having 288 values. In generating the first exponential matrix, one or more processors may be configured to replace each value of the second exponential matrix with a (2x2) matrix. In some implementations, the first exponential matrix may be generated based on a binary matrix, at least based on the second exponential matrix. A binary matrix can contain the following set of values: [1 1 1 1 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 11 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 01 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 1 11 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 11 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 0).
[0086] In some implementations, the first exponent matrix may contain the following set of values: [-1 115 -1 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 115 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 -1 -1 -1 57 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 110 -1 -1 15 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 57 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1110 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 49 74 -1 -1 -1 -1 -1 112 -1 -1 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 ... -1 -1 -1 -1 -1 49 -1 -1 74 -1 -1 -1 -1 -1 112 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 124 -1106 -1 -1 -1 -1 -1 -1 -1 107 -1 -1 -1 -1 6 -1 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 124 ‐1 106 ‐1‐1 ‐1 ‐1 107 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 6 ‐1 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐10 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 81 ‐1 ‐1 ‐1 ‐1 40 ‐1 ‐1132 ‐1 ‐1 ‐1 ‐1 ‐1 45 ‐1 57 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 81 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 40 132 ‐1 ‐1 ‐1 ‐1 ‐1 45 ‐1 57 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 84 ‐1 ‐1 ‐1 ‐1101 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 ‐1 ‐1 84 ‐1 ‐1 101 ‐1 ‐1 ‐1 ‐1‐1 16 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 138 158 ‐1 ‐1 158 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 113 ‐1 ‐1 ‐1 ‐1 104 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 138 ‐1‐1 158 158 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 113 ‐1 ‐1 104 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 130 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 76 114 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 144 ‐1 ‐1 ‐1 54 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 130 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐176 ‐1 ‐1 114 ‐1 ‐1 ‐1 ‐1 144 ‐1 ‐1 ‐1 54 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 129 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 28 ‐1 ‐1104 ‐1 ‐1 ‐1 ‐1 ‐1 61 ‐1 ‐1 ‐1 ‐1 ‐1 65 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 129 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 28 104 ‐1 ‐1 ‐1‐1 ‐1 61 ‐1 ‐1 ‐1 ‐1 ‐1 65 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 91 ‐1 ‐1 ‐1 ‐1 141 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 15418 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐10 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 91 ‐1 ‐1 141 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 154 ‐1 ‐1 18 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 4‐1 112 ‐1 ‐1 ‐1 ‐1 115 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 24 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 0 ‐1 0 ‐1 ‐1 4 ‐1 112 ‐1 ‐1 115 ‐1 ‐1 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 24 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 49 ‐1 ‐1 ‐1 123 ‐1 ‐1‐1 121 ‐1 ‐1 ‐1 ‐1 55 ‐1 102 ‐1 ‐1 ‐1 ‐1 ‐1 32 ‐1 2 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 49 ‐1 ‐1 ‐1 123 ‐1 ‐1 ‐1 121 ‐1 ‐1‐1 ‐1 ‐1 ‐1 55 ‐1 102 ‐1 ‐1 ‐1 ‐1 ‐1 32 ‐1 2 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0]。
[0087] In some implementations, the first exponent matrix may contain the following set of values: [231 -1 -1 -1 203 -1 45 -1 200 -1 318 -1 4 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 14 -1 115 -1 2 -1 -1 -1 220 31 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 120 -1 -1 -1 99 148 -1 -1 22459 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 248 212 -1 -1 215 -1 -1 12 140 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 163 -1 -1 80 265 -1 -1 91 115 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 33 -1 168 -1 203 -1 -1 33 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 277 316 317 -1 -1 -1 226 -1 209 -1 -1 -1 0 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 261 -1 -1 -1 153 228 -1 -1 289 -1 109 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 259 -1 1 -1 56 209 -1 -1 123 -1 -1 131 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 182 -1 283 1 -1 -1 -1 309 36 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 8 224 -1 231 140 -1 -1 -1 -1 -1 49 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 99 -1 247 -1 243 -1 -1 110 204 -1 -1 64 4 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0).
[0088] In some implementations, one or more processors may be further configured to generate the first exponential matrix by rearranging a third exponential matrix having the same dimensions as the first exponential matrix. The third exponential matrix may be rearranged such that the positions of one or more elements or one or more submatrices are changed, and the rearranged third exponential matrix contains the same elements as the first exponential matrix.
[0089] In some implementations, the first exponential matrix may have an m x n dimension, where each of m and n is a positive integer. One or more processors may be further configured to generate the first exponential matrix by performing the following matrix multiplication: A*E(H)*B, where A is a permutation matrix with an m x m dimension, B is a permutation matrix with an n x n dimension, and E(H) is a fourth exponential matrix with the same dimension as the first exponential matrix.
[0090] The embodiments in this disclosure have at least the following advantages and benefits.
[0091] First, the embodiments in this disclosure provide useful techniques for providing significant gains (e.g., exceeding existing LDPC codes specified in Wi-Fi standards by 0.0 to 0.5 dB) across all modulation schemes. For example, the block length of a QC-LDPC code according to some embodiments (e.g., 7776 bits) is at least four times the block length of the longest code supported in the 802.11n to 802.11be standards (e.g., 1944 bits). This QC-LDPC code can provide gains within 2 dB in a 2x2 MIMO (Multiple-Input Multiple-Output) channel, and said gain is consistent across all modulation schemes with or without beamforming.
[0092] Second, the code generated using the systems and / or methods according to embodiments of this disclosure can help with efficient encoding and decoding. For example, the system can use a message-passing-based algorithm to perform decoding of data, making substructures available for parallel and / or concurrent decoding.
[0093] The following IEEE standards (including any draft versions of these standards) are hereby incorporated herein by reference in their entirety and are part of this disclosure for all purposes: Wi-Fi Alliance standards and IEEE 802.11 standards, including but not limited to IEEE 802.11a. TM IEEE 802.11b TM IEEE 802.11g TM IEEE P802.11n TM IEEE P802.11ac TM ; and IEEE P802.11be TM To IEEE P802.11bnTM Standards. Although this disclosure may refer to aspects of these standards, it is in no way limited to them.
[0094] For the purpose of reading the descriptions of the various embodiments below, the following descriptions of the sections of the specification and their corresponding contents may be helpful:
[0095] Section A describes the network and computing environments that can be used to practice the embodiments described herein; and
[0096] Section B describes embodiments of systems and methods for QC-LDPC codes with a 1 / 2 code rate.
[0097] A. Computing and Network Environment
[0098] refer to Figure 1 The illustration depicts an example communication environment 100 including communication systems (or communication devices) 105, 108 according to one or more embodiments. In one embodiment, communication system 105 includes a baseband circuit system 110 and a transmitter circuit system 120, and communication system 108 includes a baseband circuit system 150 and a receiver circuit system 140. In one aspect, communication system 105 is considered a transmitter communication system, and communication system 108 is considered a receiver communication system. These components operate together to exchange data (e.g., messages or frames) over a wireless medium. In one or more embodiments, these components are embodied as application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or any combination thereof. In some embodiments, communication systems 105, 108 include... Figure 1 The components shown may be more, fewer, or different than those in the diagram. For example, each of communication systems 105, 108 includes a transceiver circuitry to allow bidirectional communication between communication systems 105, 108 or with other communication systems. In some embodiments, each of communication systems 105, 108 may have [the following components are described in detail:] Figure 2 The configuration of the computing system 2000 shown in the image is similar to that of the system.
[0099] The baseband circuitry 110 of the communication system 105 is a circuitry system that generates baseband data 115 for transmission. The baseband data 115 contains information data (e.g., signals) at a baseband frequency for transmission. In one method, the baseband circuitry 110 includes an encoder 130 that encodes the data and generates or outputs parity bits. In one aspect, the baseband circuitry 110 (or encoder 130) obtains a generator matrix or a parity matrix, or encodes the information data using a previously generated generator matrix or a previously generated parity matrix by applying the information data to the generator matrix or parity matrix to obtain codewords. In some embodiments, the baseband circuitry 110 stores one or more generator matrices or one or more parity matrices conforming to any IEEE 802.11 standard for WLAN communication. In response to detecting information data to be transmitted, or in response to receiving an instruction to encode the information data, the baseband circuitry 110 retrieves the stored generator matrix or the stored parity matrix. In one method, baseband circuitry 110 generates parity bits based on a portion of a generator matrix or using a parity matrix, and appends the parity bits to information bits to form a codeword. Baseband circuitry 110 generates baseband data 115 containing the codeword for communication system 108, and provides baseband data 115 to transmitter circuitry 120.
[0100] The transmitter circuitry 120 of the communication system 105 includes or corresponds to a circuitry that receives baseband data 115 from the baseband circuitry 110 and transmits a wireless signal 125 based on the baseband data 115. In one configuration, the transmitter circuitry 120 is coupled between the baseband circuitry 110 and an antenna (not shown). In this configuration, the transmitter circuitry 120 up-converts the baseband data 115 from the baseband circuitry 110 into a carrier signal to generate a wireless signal 125 at RF frequencies (e.g., 10 MHz to 60 GHz) and transmits the wireless signal 125 via the antenna.
[0101] The receiver circuitry 140 of communication system 108 is a circuitry that receives radio signals 125 from communication system 105 and obtains baseband data 145 from the received radio signals 125. In one configuration, receiver circuitry 140 is coupled between baseband circuitry 150 and an antenna (not shown). In this configuration, receiver circuitry 140 receives radio signals 125 through the antenna and down-converts the radio signals 125 at RF frequencies according to the carrier signal to obtain baseband data 145 from the radio signals 125. Receiver circuitry 140 then provides the baseband data 145 to baseband circuitry 150.
[0102] The baseband circuitry system 150 of the communication system 108 includes or corresponds to a circuitry system that receives baseband data 145 from the receiver circuitry system 140 and obtains information data from the received baseband data 145. In one embodiment, the baseband circuitry system 150 includes a decoder 160 that extracts information and parity bits from the baseband data 145. The decoder 160 decodes the baseband data 145 to obtain the information data generated by the baseband circuitry system 110 of the communication system 105.
[0103] In some embodiments, each of the baseband circuit system 110 (including encoder 130), transmitter circuit system 120, receiver circuit system 140, and baseband circuit system 150 (including decoder 160) may be one or more processors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or any combination thereof.
[0104] Figure 2 This is a schematic block diagram of a computing system according to an embodiment. The illustrated example computing system 2000 includes one or more processors 2010 that communicate directly or indirectly with memory 2060 via a communication system 2040 (e.g., a bus), at least one network interface controller 2030 having a network interface port for connecting to a network (not shown), and other components, such as input / output (“I / O”) components 2050. Typically, the processors 2010 execute instructions (or computer programs) received from memory. The illustrated processors 2010 are incorporated into or connected to cache memory 2020. In some examples, instructions are read from memory 2060 into cache memory 2020 and executed by processor 2010 from cache memory 2020. The computing system 2000 may not necessarily contain... Figure 2 All of these components shown in the document, and may contain Figure 2 Other components not shown.
[0105] More specifically, processor 2010 can be any logic circuit system that processes instructions, such as those fetched from memory 2060 or cache 2020. In many embodiments, processor 2010 is a microprocessor unit or a dedicated processor. The computing system 2000 can be based on any processor or set of processors capable of operating as described herein. Processor 2010 can be a single-core or multi-core processor. Processor 2010 can be multiple different processors.
[0106] Memory 2060 may be any means suitable for storing computer-readable data. Memory 2060 may be a means having fixed storage or a means for reading removable storage media. Examples include all forms of volatile memory (e.g., RAM), non-volatile memory, media and memory devices, semiconductor memory devices (e.g., EPROM, EEPROM, SDRAM, and flash memory devices), magnetic disks, magneto-optical disks, and optical disks (e.g., CD ROM, DVD-ROM, or...). Optical disc). The computing system 2000 may have any number of memory devices 2060.
[0107] Cache memory 2020 is typically a form of computer memory placed near processor 2010 to achieve fast read times. In some embodiments, cache memory 2020 is part of processor 2010 or on the same chip as processor 2010. In some embodiments, there are multiple levels of cache 2020, such as L2 and L3 cache layers.
[0108] Network interface controller 2030 manages data exchange via network interfaces (sometimes referred to as network interface ports). Network interface controller 2030 handles the physical and data link layers of the OSI model for network communication. In some embodiments, some of the tasks of the network interface controller are handled by one or more of the processors 2010. In some embodiments, network interface controller 2030 is part of processor 2010. In some embodiments, computing system 2000 has multiple network interfaces controlled by a single controller 2030. In some embodiments, computing system 2000 has multiple network interface controllers 2030. In some embodiments, each network interface is a connection point for a physical network link (e.g., a Category 5 Ethernet link). In some embodiments, network interface controller 2030 supports wireless network connectivity, and the interface port is a wireless (e.g., radio) receiver or transmitter (e.g., for IEEE 802.11, Near Field Communication "NFC", Bluetooth, ANT, or any other wireless protocol). In some embodiments, network interface controller 2030 implements one or more network protocols, such as Ethernet. Typically, the computing system 2000 exchanges data with other computing devices via a network interface through a physical or wireless link. The network interface may be directly linked to another device or linked to another device via an intermediate device that connects the computing system 2000 to a data network such as the Internet, such as a network device (e.g., a hub, bridge, switch, or router).
[0109] The computing system 2000 may include one or more input or output (“I / O”) devices, or provide interfaces thereto. Input devices include, but are not limited to, keyboards, microphones, touchscreens, foot pedals, sensors, MIDI devices, and pointing devices such as mice or trackballs. Output devices include, but are not limited to, video displays, speakers, refreshable Braille terminals, lights, MIDI devices, and 2-D or 3-D printers.
[0110] Other components may include I / O interfaces, external serial device ports, and any additional coprocessors. For example, the computing system 2000 may include interfaces (e.g., a Universal Serial Bus (USB) interface) for connecting input devices, output devices, or additional memory devices (e.g., portable flash drives or external media drives). In some embodiments, the computing system 2000 includes additional devices, such as coprocessors; for example, a math coprocessor may assist the processor 2010 in performing high-precision or complex calculations.
[0111] Component 2050 may be configured to connect to external media, display 2070, input device 2080, or any other component or combination thereof in computing system 2000. Display 2070 may be a liquid crystal display (LCD), organic light-emitting diode (OLED) display, flat panel display, solid-state display, cathode ray tube (CRT) display, projector, printer, or other display device now known or hereafter developed for outputting defined information. Display 2070 may serve as an interface for a user to view the operation of processor 2010, or more specifically, as an interface to software stored in memory 2060.
[0112] Input device 2080 can be configured to allow a user to interact with any of the components of computing system 2000. Input device 2080 can be a pad, keyboard, cursor control device (e.g., mouse), or joystick. Alternatively, input device 2080 can be a remote control, touchscreen display (which can be a combination of display 2070 and input device 2080), or any other device operable to interact with computing system 2000, such as any device operable to act as an interface between the user and computing system 2000.
[0113] B. Systems and methods for QC-LDPC codes with a 1 / 2 code rate
[0114] Figure 3FIG. 0 is a diagram depicting an example exponent matrix (QC-LDPC exponent matrix) 300 according to one or more embodiments. Given a lifting size z, the exponent matrix 300 can have a size of m / z x n / z. If n = 24z (e.g., n = 7776, z = 324), then the size of P = E(H) is 24(1 - R) x 24 ( = n(1 - R) / z x n / z). The elements of the exponent matrix can be integer values corresponding to cyclic shift values of an identity matrix of size z x z. The parity-check matrix H (see Figure 5 ) can be a sparse binary matrix that can be derived from the exponent matrix P = E(H). The generator matrix G can have a size of n x k in binary form (e.g., the elements of the generator matrix G are binary values). Referring to Figure 3 , the exponent matrix P = E(H) can have a structure that includes multiple sub-matrices (e.g., A310, B 312, C 316, D 318, E 320, T 314).
[0115] Figure 4 FIG. 8 is a diagram 400 depicting example shifted identity matrices 409, 410, 411, 412, 413, 414, 415, 416 for generating a parity-check matrix according to one or more embodiments. The parity-check matrix H can be generated from the exponent matrix P = E(H) (e.g., exponent matrix 300), or codebook identification can be used. As shown in Equation 7, the exponent matrix P = E(H) can include (as elements) shift values d in the range 0 <= d < z and d = -1. Referring to the equation, for example, if z = 7, then the shift values d can include -1, 0, 1, 2, 3, 4, 5, 6 (see Figure 4 ). The shift value d = 0 can correspond to (or map to) an identity matrix of size z x z represented by I(z) (e.g., matrix 410). The shift value d = -1 can correspond to (or map to) a zero matrix of size z x z represented by 0*I(z) (all elements are zero) (e.g., matrix 409). Any other integer value d in [1, z - 1] can correspond to (or map to) a matrix that is cyclically right-shifted from I(z) (e.g., matrices 411, 412, 413, 414, 415, 416). As shown in Equation 8, the parity-check matrix H can be obtained from the exponent matrix P by expanding the exponent matrix P = E(H) such that each element (as the shift value d) of the exponent matrix P is replaced by a matrix corresponding to the shift value.
[0116] Figure 5This is a diagram depicting an instance parity matrix 500 according to one or more embodiments. In some embodiments, the encoder (e.g., encoder 130) may use a generator matrix (e.g., using Equation 2) to generate codewords. In some embodiments, the encoder (e.g., encoder 130) may use a parity matrix (instead of a generator matrix) to generate codewords from a vector of information bits. After obtaining the parity matrix H (e.g., using a codebook), the parity matrix H (e.g., parity matrix 500) may have submatrices A510, B512, C516, D518, T514, E520. The upper region O515 of submatrix T514 (e.g., Figure 5 The white area in the matrix can correspond to the region where the matrix contains all zeros, and other regions (e.g., Figure 5 The gray area in the diagram can represent a position that may contain 1. The parity check matrix 500 can be of size m x n, where the submatrix D 518 is of size g x g, and the submatrix T is of size (mg) x (mg). In some implementations, given a vector s of information bits to be encoded, the encoder can obtain the codeword c using equations 10, 11, 12, and 13.
[0117] In some implementations, codebooks for R=1 / 2 LDPC codes with a block length of 7776 bits can provide high-performance error correction and / or provide a gain of up to 0.0 to 0.5 dB over existing LDPC codes specified in the Wi-Fi standard. In some implementations, a set of LDPC codes with a block length of 7776 bits (4x1944) supports all code rates in the Wi-Fi standard (e.g., 802.11be). Codes (e.g., R=1 / 2 LDPC codes with a block length of 7776 bits) can be used directly in existing 64-QAM modulation in IEEE 802.11be and may be used in combination with further combinations of QAM sizes in IEEE 802.bn.
[0118] In some implementations, a codebook of 7776-bit R=1 / 2 LDPC codes can be directly used for existing modulation schemes, such as Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (BPSK), 16-QAM, 64-QAM, 256-QAM, 1024-QAM, and 4096-QAM, as seen in standards such as IEEE 802.11be or IEEE 802.11bn. Furthermore, a codebook of 7776-bit R=1 / 2 LDPC codes may have the potential to combine one or more combinations of QAM sizes (whether similar or different) across OFDMA resource units (RUs), distributed RUs (DRUs), and truncated RUs (MRUs), within a single stream and / or across multiple spatial streams, as provided in MIMO configurations.
[0119] A collection of LDPC codes with a block length of 7776 bits (4x1944) offers significant performance improvements in ultra-high reliability (UHR) across a variety of communication scenarios while maintaining manageable complexity. Performance comparisons are made between these codes and the LDPC codes specified in the IEEE 802.11be standard, as well as recently proposed codes with a block length of 4x1944. The results of the performance comparisons demonstrate significant gains across the board (e.g., channel, PHY bandwidth, MIMO, modulation and coding scheme (MCS), transmit beamforming). For example, LDPC codes with a block length of 4x1944 = 7776 bits can provide an additional 0.0 to 0.5 dB gain depending on channel conditions.
[0120] The longest LDPC code specified in the 802.11be standard has a block length of 1944 bits. In terms of performance, the LDPC code specified in the 802.11be standard differs from the optimal random code by approximately 2.7 dB (e.g., Bit-Interleaved Coded Modulation (BICM)-Additive White Gaussian Noise (AWGN)-QAM (Quadrature Amplitude Modulation) with an R=1 / 2 limit). According to the finite-length scaling theorem, longer block-length random codes (e.g., the asymptotic case of the Shannon limit where the block length grows to infinity) can lead to enhanced coding gain. Suboptimal deterministic codes can exhibit significantly larger scaling gains than the optimal random code. For example, in AWGN, the doubling effect is known to be true.
[0121] In some implementations, LDPC codes have a block length of 4 x 1944 = 7776 bits (twice the size of the maximum block length supported in the current 802.11be standard). In some implementations, LDPC codes with a block length of 7776 bits support all existing code rates (e.g., R = 1 / 2, 2 / 3, 1 / 2, and 5 / 6). In some implementations, LDPC codes with a block length of 7776 bits maintain the structural integrity of 802.11be codes (specifically, QC-LDPC), except for matrix size expansion. This adaptation facilitates the reuse of existing implementations and provides concurrent encoding and decoding capabilities.
[0122] Figure 6 This is a diagram depicting an instance exponent matrix (QC-LDPC exponent matrix) 600 according to one or more embodiments. Given a lift size z, the exponent matrix 600 may have a size of m / z x n / z. If n = 48z (e.g., n = 7776, z = 324 / 2 = 162 = 2 * 81), then for n = 7776, The size of the matrix is 48(1-R) x 48 (=n(1-R) / z xn / z)=8x48. The elements of the exponent matrix can be integer values corresponding to the cyclic shift values of an identity matrix of size z x z. The parity check matrix H can be a sparse binary matrix, which can be derived from the exponent matrix. Derivation. The generator matrix G can have a size of n x k in binary form (e.g., the elements of the generator matrix G are binary values). Reference Figure 6 exponential matrix It can have multiple submatrices (e.g., The structure of ).
[0123] Figure 7A and Figure 7B This is a diagram depicting an instance exponent matrix 700 and an instance binary parity matrix 750 according to one or more embodiments. The exponent matrix 700 and the binary parity matrix 750 correspond to a QC-LDPC codebook with a block length n = 7776 bits, a rate R = 1 / 2, and a message length k = 1 / 2 * 7776 = 3888 bits. The parity matrix (H) 750 has a size = (1-R) * n x n = 1296 x 7776. The exponent matrix (E(H)) 700 is equivalent to the parity matrix (H) 750. The exponent matrix 700 has a size of 24 * (1-R) x 24 and contains cyclic shift values such that each entry is mapped to a cyclic matrix of size Z = 324 (see [link to relevant documentation]). Figure 3 The elements of the exponent matrix 700 are integers between -1 and Z-1 (Z=324).
[0124] Figures 8A to 8C This is a diagram depicting an instance exponent matrix 800, an instance binary matrix λ820 (also called a “compact matrix” or “λ matrix”), and an instance binary parity matrix 840 according to one or more embodiments. Given a first QC-LDPC code corresponding to the exponent matrix 700 and the parity matrix 750 (referred to as “E1(H)” and “H1” respectively) (n = 7776, k = 3888), the system can identify, find, obtain, or compute a second QC-LDPC code corresponding to the exponent matrix 800 and the parity matrix 840 (referred to as “E2(H)” and “H2” respectively) (n = 7776, k = 3888). The exponent matrix E2(H) 800 may have a size of 48*(1-R) x 48 and contain cyclic shift values such that each of the entries is mapped to a cyclic matrix of size Z = 324 / 2 = 162 = 2*81 (see...). Figure 6The parity check matrix H2 840 may differ from the parity check matrix H1 750, but their overall graph structure and performance can be similar. Given a first exponential matrix E1(H) 700, the system can apply a mapping to E1(H) using Equations 17 and 18 to obtain a second exponential matrix E2(H) 800 and a compact matrix λ820. The system can define, generate, or create a parity check matrix H2 840 with size = (1-R)*n x n = 1296 x 7776 based on E2(H) using Equations 7 to 9.
[0125] Figure 9 This is a flowchart illustrating a process 900 for encoding and / or decoding data using LDPC codes according to an embodiment. In some embodiments, process 900 is executed by one or more processors of a first device (e.g., encoder 130 or processor 2010 of communication system 105) or by one or more processors of a second device (e.g., decoder 160 or processor 2010 of communication system 108). In other embodiments, process 900 is executed by other entities (e.g., computing systems other than communication systems 105 or 108). In some embodiments, process 900 includes... Figure 9 The steps shown in the document may be more, fewer, or different than those in the document.
[0126] At step 902, the first device may identify a first binary parity check matrix (e.g., matrix 750 or matrix 840) for quasi-cyclic low-density parity-check (QC-LDPC) codes based on a code rate of 1 / 2 and a code block size of 7776 bits, the first binary parity check matrix corresponding to a first exponential matrix (e.g., matrix 700 or matrix 800). At step 904, the first device may encode data using the first binary parity check matrix. At step 906, the first device may transmit the encoded data via a transmitter (e.g., transmitter circuitry 120).
[0127] In some implementations, the first exponential matrix may have 1152 values (e.g., matrix 800). One or more processors may be further configured to generate the first exponential matrix based at least on a second exponential matrix having 288 values (e.g., matrix 700). In generating the first exponential matrix, one or more processors may be configured to replace each value of the second exponential matrix with a (2x2) matrix (e.g., using Equation 17). In some implementations, the first exponential matrix may be generated based on a binary matrix, at least based on the second exponential matrix (e.g., matrix 700). A binary matrix can contain the following set of values: [1 1 1 1 1 1 1 11 0 1 0 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 1 1 11 1 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 00 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 00 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 11 1 1 1 1 1 1 0).
[0128] In some implementations, the first exponent matrix (e.g., matrix 800) may contain the following set of values: [-1 115 -1 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 115 -1 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 -1 -1 57 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 110 -1 -1 15 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 57 -1 -1 -1 -1 1 -1 -1 -1 -1-1 -1 -1 110 15 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 49 74 -1 -1 -1 -1 -1 -1 112 -1 -1 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 -1 49 -1 -1 74 -1 -1 -1 -1 -1 112 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 ... -1 -1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 124 ‐1106 ‐1 ‐1 ‐1 ‐1 107 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 6 ‐1 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 81 ‐1 ‐1 ‐1 ‐1 40‐1 ‐1 132 ‐1 ‐1 ‐1 ‐1 ‐1 45 ‐1 57 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 81 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 40 132 ‐1 ‐1‐1 ‐1 ‐1 45 ‐1 57 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 84 ‐1 ‐1 ‐1 ‐1 101 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 16 ‐1 ‐1 ‐1 ‐1 84 ‐1 ‐1 101 ‐1 ‐1‐1 ‐1 ‐1 16 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 138 158 ‐1 ‐1 158 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 113 ‐1 ‐1 ‐1 ‐1 104 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1138 ‐1 ‐1 158 158 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 113 ‐1 ‐1 104 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐10 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 130 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 76 114 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 144 ‐1 ‐1 ‐1 54 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 130 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 76 ‐1 ‐1 114 ‐1 ‐1 ‐1 ‐1 144 ‐1 ‐1 ‐1 54 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 129 ‐1 ‐1 ‐1 ‐1 ‐1 ‐128 ‐1 ‐1 104 ‐1 ‐1 ‐1 ‐1 ‐1 61 ‐1 ‐1 ‐1 ‐1 ‐1 65 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 129 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 28 104‐1 ‐1 ‐1 ‐1 ‐1 61 ‐1 ‐1 ‐1 ‐1 ‐1 65 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 91 ‐1 ‐1 ‐1 ‐1 141 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 154 18 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 0 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 91 ‐1 ‐1 141 ‐1 0 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 154 ‐1 ‐118 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐10 ‐1 ‐1 4 ‐1 112 ‐1 ‐1 ‐1 ‐1 115 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 24 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 ‐1 4‐1 112 ‐1 ‐1 115 ‐1 ‐1 70 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 24 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 0 ‐1 49 ‐1 ‐1 ‐1123 ‐1 ‐1 ‐1 121 ‐1 ‐1 ‐1 ‐1 55 ‐1 102 ‐1 ‐1 ‐1 ‐1 ‐1 32 ‐1 2 ‐1 ‐1 ‐1 ‐1 ‐1‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0 ‐1 49 ‐1 ‐1 ‐1 123 ‐1 ‐1 ‐1121 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 55 ‐1 102 ‐1 ‐1 ‐1 ‐1 ‐1 32 ‐1 2 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 ‐1 0]。
[0129] In some implementations, the first exponent matrix (e.g., matrix 700) may contain the following set of values: [231 -1 -1 -1 203 -1 45 -1 200 -1 318 -1 4 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 14 -1 115 -1 2 -1 -1 -1 220 31 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 120 -1 -1 -1 99148 -1 -1 224 59 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 248 212 -1 -1 215 -1 -1 12 140 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 163 -1 -1 80 265 -1 -191 115 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 33 -1 168 -1 203 -1 -1 33 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 277 316 317 -1 -1 -1 226 -1 209 -1-1 -1 0 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 261 -1 -1 -1 153 228 -1 -1 289 -1 109-1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 259 -1 1 -1 56 209 -1 -1 123 -1 -1 131 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 182 -1 283 1 -1 -1 -1 309 36 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 8 224 -1 231 140 -1 -1 -1 -1 -1 49 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 99 -1 247 -1 243 -1 -1 110 204 -1 -1 64 4 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0).
[0130] In some implementations, one or more processors may be further configured to generate the first exponential matrix by rearranging a third exponential matrix having the same dimensions as the first exponential matrix (e.g., 12x24). The third exponential matrix may be rearranged such that the positions of one or more elements or one or more submatrices are changed, and the rearranged third exponential matrix contains the same elements as the first exponential matrix.
[0131] In some implementations, the first exponential matrix may have an m x n dimension, where each of m and n is a positive integer. One or more processors may be further configured to generate the first exponential matrix by performing the following matrix multiplication: A*E(H)*B (e.g., using Equation 19), where A is a permutation matrix with an m x m dimension, B is a permutation matrix with an n x n dimension, and E(H) is a fourth exponential matrix with the same dimension as the first exponential matrix.
[0132] At step 908, the second device (e.g., communication system 105) identifies a first binary parity check matrix (e.g., matrix 750, matrix 840) for quasi-cyclic low-density parity-check (QC-LDPC) codes based on a 1 / 2 code rate and a 7776-bit code block size. This first binary parity check matrix corresponds to a first exponential matrix (e.g., matrix 700, matrix 800). At step 910, the second device receives encoded data from the first device (e.g., communication system 108) via a receiver (e.g., receiver circuitry 140). At step 912, the second device decodes the received encoded data using the first binary parity check matrix.
[0133] A reference to "or" can be interpreted as inclusive, such that any item described using "or" can refer to a single, more than one, or any of the described items. A reference to at least one of a connected list of items can be interpreted as inclusive "or," indicating a single, more than one, or any of the described items. For example, a reference to "at least one of 'A' and 'B'" can include only 'A', only 'B', or both 'A' and 'B'. Such references, used in conjunction with "include" or other open terms, can include additional items.
[0134] It should be noted that, for the purpose of identifying or distinguishing one from another or others, certain paragraphs of this disclosure may refer to terms, such as “first” and “second,” that are combined with subsets of transmit spatial streams, probe frames, responses, and means. These terms are not intended to relate entities (e.g., first means and second means) solely in time or according to sequence, although in some cases these entities may include such relationships. These terms also do not limit the number of possible entities (e.g., STAs, APs, beamformers, and / or beamforming receivers) that may operate in the system or environment. It should be understood that the system described above may provide any or more of those components, and these components may be located on a standalone machine, or, in some embodiments, on multiple machines in a distributed system. Furthermore, bit field positions may be changed, and multiple bit words may be used. Additionally, the above-described systems and methods may be provided as one or more computer-readable programs or executable instructions embodied in or on one or more articles of manufacture (e.g., floppy disk, hard disk, CD-ROM, flash memory card, PROM, RAM, ROM, or magnetic tape). The program can be implemented in any programming language (e.g., LISP, PERL, C, C++, C#) or in any bytecode language (e.g., JAVA). The software program or executable instructions can be stored as object code on or in one or more artifacts.
[0135] While the foregoing written description of the methods and systems enables those skilled in the art to make and use embodiments thereof, it will be understood and appreciated by those skilled in the art that variations, combinations, and equivalents exist in the specific embodiments, methods, and examples herein. Therefore, the methods and systems of the present invention should not be limited to the embodiments, methods, and examples described above, but should be limited to all embodiments and methods within the scope and spirit of this disclosure.
Claims
1. An apparatus comprising: a transmitter and one or more processors, wherein the one or more processors are configured to: identify, according to a code rate of 1 / 2 and a code block size of 7776 bits, a first binary parity check matrix for a quasi-cyclic low-density parity-check (QC-LDPC) code, the first binary parity check matrix corresponding to a first exponent matrix; and encode data using the first binary parity check matrix; and the transmitter is configured to transmit the encoded data.
2. The apparatus of claim 1, wherein the first exponent matrix has 1152 values, and the one or more processors are further configured to: generate the first exponent matrix based at least on a second exponent matrix having 288 values.
3. The apparatus of claim 2, wherein in generating the first exponent matrix, the one or more processors are configured to: replace each value of the second exponent matrix with a (2x2) matrix.
4. The apparatus of claim 2, wherein the first exponent matrix is generated based at least on a second exponent matrix according to a binary matrix.
5. The apparatus of claim 4, wherein the binary matrix comprises the following set of values: [1 1 1 1 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 11 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 11 1 1 1 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 01 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 1 11 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 11 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 11 1 1 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0]。 6. The apparatus of claim 1, wherein the first exponent matrix comprises the following set of values: [-1 115 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 100 -1 -1 -1 159 -1 -1-1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 115-1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2-1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 -1 -1 57 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 110 -1 -1 15 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 57 -1 -1 -1 -11 -1 -1 -1 -1 -1 -1 -1 110 15 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 -1 -1 49 74 -1 -1-1 -1 -1 112 -1 -1 29 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 49 -1 -1 74 -1 -1 -1 -1 -1112 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 124 -1 106 -1 -1 -1 -1 -1 -1 107 -1 -1 -1 -1 6 -1 70 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 124 -1 106 -1 -1 -1 -1 107 -1 -1 -1 -1 -1 -1 6 -1 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 81-1 -1 -1 -1 40 -1 -1 132 -1 -1 -1 -1 -1 45 -1 57 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 81 -1 -1 -1 -1 -1-1 40 132 -1 -1 -1 -1 -1 45 -1 57 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 16-1 -1 84 -1 -1 -1 -1 101 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 84 -1 -1 101 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 138 158 -1 -1 158 -1 -1 -1 -1 -1 -1 113 -1 -1 -1 -1104 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 138 -1 -1 158 158 -1 -1 -1 -1 -1 -1 -1 -1 113 -1 -1 104 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1-1 -1 -1 130 -1 -1 -1 -1 -1 -1 -1 76 114 -1 -1 -1 -1 -1 -1 144 -1 -1 -1 54 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 130-1 -1 -1 -1 -1 -1 -1 76 -1 -1 114 -1 -1 -1 -1 144 -1 -1 -1 54 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 129 -1 -1-1 -1 -1 -1 28 -1 -1 104 -1 -1 -1 -1 -1 61 -1 -1 -1 -1 -1 65 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 129 -1 -1 -1 -1 -1 -1 -1 -1 28 104 -1 -1 -1 -1 -1 61 -1 -1 -1 -1 -1 65 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 91 -1 -1 -1 -1 141 -1 0 -1 -1 -1 -1 -1 -1 -1 154 18 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 91 -1 -1 141 -1 0 -1 -1 -1 -1 -1 -1 -1 154 -1 -1 18 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 0 -1 0 -1 -1 4 -1 112 -1 -1 -1 -1 115 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 24 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0-1 0 -1 -1 4 -1 112 -1 -1 115 -1 -1 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 24 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -149 -1 -1 -1 123 -1 -1 -1 121 -1 -1 -1 -1 55 -1 102 -1 -1 -1 -1 -1 32 -1 2 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 49 -1 -1 -1123 -1 -1 -1 121 -1 -1 -1 -1 -1 -1 55 -1 102 -1 -1 -1 -1 -1 32 -1 2 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0]。 7. The apparatus of claim 1, wherein the first exponent matrix comprises the following set of values: [231 -1 -1 -1 203 -1 45 -1 200 -1 318 -1 4 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 14 -1 115 -1 2 -1 -1 -1 220 31 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 120-1 -1 -1 99 148 -1 -1 224 59 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 248 212-1 -1 215 -1 -1 12 140 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 163 -1 -180 265 -1 -1 91 115 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 33-1 168 -1 203 -1 -1 33 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 277 316 317 -1 -1 -1226 -1 209 -1 -1 -1 0 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 261 -1 -1 -1 153 228 -1-1 289 -1 109 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 259 -1 1 -1 56 209 -1 -1123 -1 -1 131 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 182 -1 283 1 -1 -1 -1 30936 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 8 224 -1 231 140 -1 -1 -1 -1 -1 49-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 99 -1 247 -1 243 -1 -1 110 204 -1 -1 644 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0]。 8. The apparatus of claim 1, wherein the one or more processors are further configured to: generate the first exponent matrix by re-arranging a third exponent matrix having the same dimensions as the first exponent matrix, wherein the third exponent matrix is re-arranged such that the position of one or more elements or one or more sub-matrices is changed, and the re-arranged third exponent matrix contains the same elements as the first exponent matrix.
9. The apparatus of claim 1, wherein the first exponent matrix has dimensions of m x n, where each of m and n is a positive integer, and the one or more processors are further configured to: generate the first exponent matrix by performing the following matrix multiplication: A*E(H)*B, where A is a permutation matrix having dimensions of m x m, B is a permutation matrix having dimensions of n x n, and E(H) is a fourth exponent matrix having the same dimensions as the first exponent matrix.
10. A method comprising: identifying, by one or more processors of a first device, according to a code rate of 1 / 2 and a code block size of 7776 bits, a first binary parity check matrix for a quasi-cyclic low-density parity-check (QC-LDPC) code, the first binary parity check matrix corresponding to a first exponent matrix; encoding, by the one or more processors of the first device, data using the first binary parity check matrix; and transmitting, by the one or more processors of the first device, the encoded data.
11. The method of claim 10, wherein the first exponent matrix has 1152 values, and the method further comprises: generating the first index matrix based on at least a second index matrix having 288 values.
12. The method of claim 11, wherein generating the first index matrix comprises: replacing each value of the second index matrix with a (2x2) matrix.
13. The method of claim 11, wherein generating the first index matrix based on at least a second index matrix comprises generating the first index matrix based on a binary matrix.
14. The method of claim 13, wherein the binary matrix comprises the following set of values: [1 1 1 1 1 1 1 1 0 1 0 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 1 1 11 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 11 1 1 1 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 01 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 1 11 1 1 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 11 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 11 1 1 1 1 1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 11 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0]。 15. The method of claim 10, wherein the first index matrix comprises the following set of values: [-1 115 -1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 100 -1 -1 -1 159 -1 -1-1 2 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 115-1 -1 -1 -1 -1 -1 -1 101 -1 -1 -1 22 -1 -1 -1 -1 100 -1 -1 -1 159 -1 -1 -1 2-1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 -1 -1 57 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 110 -1 -1 15 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 7 -1 -1 57 -1 -1 -1 -11 -1 -1 -1 -1 -1 -1 -1 110 15 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 -1 -1 49 74 -1 -1-1 -1 -1 112 -1 -1 29 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 60 -1 -1 -1 -1 -1 -1 49 -1 -1 74 -1 -1 -1 -1 -1112 29 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 124 -1 106 -1 -1 -1 -1 -1 -1 107 -1 -1 -1 -1 6 -1 70 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 124 -1 106 -1 -1 -1 -1 107 -1 -1 -1 -1 -1 -1 6 -1 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 81-1 -1 -1 -1 40 -1 -1 132 -1 -1 -1 -1 -1 45 -1 57 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 81 -1 -1 -1 -1 -1-1 40 132 -1 -1 -1 -1 -1 45 -1 57 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 16-1 -1 84 -1 -1 -1 -1 101 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 84 -1 -1 101 -1 -1 -1 -1 -1 16 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 138 158 -1 -1 158 -1 -1 -1 -1 -1 -1 113 -1 -1 -1 -1104 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 138 -1 -1 158 158 -1 -1 -1 -1 -1 -1 -1 -1 113 -1 -1 104 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1-1 -1 -1 130 -1 -1 -1 -1 -1 -1 -1 76 114 -1 -1 -1 -1 -1 -1 144 -1 -1 -1 54 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 130-1 -1 -1 -1 -1 -1 -1 76 -1 -1 114 -1 -1 -1 -1 144 -1 -1 -1 54 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 -1 129 -1 -1-1 -1 -1 -1 28 -1 -1 104 -1 -1 -1 -1 -1 61 -1 -1 -1 -1 -1 65 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 129 -1 -1 -1 -1 -1 -1 -1 -1 28 104 -1 -1 -1 -1 -1 61 -1 -1 -1 -1 -1 65 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 91 -1 -1 -1 -1 141 -1 0 -1 -1 -1 -1 -1 -1 -1 154 18 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 -1 -1 -1 0 -1 0 -1 -1 -1 -1 -1 -1 91 -1 -1 141 -1 0 -1 -1 -1 -1 -1 -1 -1 154 -1 -1 18 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 0 -1 0 -1 -1 4 -1 112 -1 -1 -1 -1 115 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1-1 -1 24 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0-1 0 -1 -1 4 -1 112 -1 -1 115 -1 -1 70 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 24 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 0 -149 -1 -1 -1 123 -1 -1 -1 121 -1 -1 -1 -1 55 -1 102 -1 -1 -1 -1 -1 32 -1 2 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 -1 49 -1 -1 -1123 -1 -1 -1 121 -1 -1 -1 -1 -1 -1 55 -1 102 -1 -1 -1 -1 -1 32 -1 2 -1 -1 -1-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0]。 16. The method of claim 10, wherein the first index matrix comprises the following set of values: [231 -1 -1 -1 203 -1 45 -1 200 -1 318 -1 4 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 14 -1 115 -1 2 -1 -1 -1 220 31 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 120-1 -1 -1 99 148 -1 -1 224 59 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 248 212-1 -1 215 -1 -1 12 140 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 -1 163 -1 -180 265 -1 -1 91 115 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 -1 0 -1 -1 -1 33-1 168 -1 203 -1 -1 33 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 -1 277 316 317 -1 -1 -1226 -1 209 -1 -1 -1 0 -1 -1 -1 -1 -1 0 0 -1 -1 -1 -1 261 -1 -1 -1 153 228 -1-1 289 -1 109 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 259 -1 1 -1 56 209 -1 -1123 -1 -1 131 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 -1 -1 182 -1 283 1 -1 -1 -1 30936 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 -1 8 224 -1 231 140 -1 -1 -1 -1 -1 49-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 99 -1 247 -1 243 -1 -1 110 204 -1 -1 644 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0]。 17. The method of claim 10, further comprising: generating the first index matrix by rearranging a third index matrix having the same dimensions as the first index matrix, wherein the third index matrix is rearranged such that the position of one or more elements or one or more sub-matrices is changed, and the rearranged third index matrix contains the same elements as the first index matrix.
18. The method of claim 10, wherein the first index matrix has dimensions of m x n, where each of m and n is a positive integer, and the method further comprises: generating the first index matrix by performing the following matrix multiplication: A*E(H)*B, where A is a permutation matrix having dimensions of m x m, B is a permutation matrix having dimensions of n x n, and E(H) is a fourth index matrix having the same dimensions as the first index matrix.
19. An apparatus comprising: a receiver configured to receive encoded data; and one or more processors configured to: identify a first binary parity check matrix for a quasi-cyclic low-density parity-check (QC-LDPC) code according to a code rate of 1 / 2 and a code block size of 7776 bits, the first binary parity check matrix corresponding to a first index matrix; and decode the received encoded data using the first binary parity check matrix.
20. The apparatus of claim 19, wherein the first index matrix has 1152 values, and the one or more processors are further configured to: generate the first index matrix based on at least a second index matrix having 288 values.
