LDPC code encoding method, encoder and satellite navigation system for satellite navigation

By using a two-level encoding method, the problem of high encoding complexity of three sets of 64-ary LDPC codes in the BeiDou satellite navigation system was solved, achieving low-complexity encoding effect and reducing storage space usage.

CN112838871BActive Publication Date: 2024-11-08INST OF MICROELECTRONICS CHINESE ACAD OF SCI LTD
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN201911166133.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-11-25
Publication Date
2024-11-08
Estimated Expiration
2039-11-25

AI Technical Summary

Technical Problem

Existing technologies suffer from high complexity and large storage space requirements when encoding three sets of 64-ary LDPC codes in the BeiDou satellite navigation system.

Method used

A two-level encoding method is adopted. First, the information sequence is converted into a data symbol vector. Then, the first-level and second-level encoding arrays are used for encoding to generate a check symbol vector. Finally, the data symbol vector and the check symbol vector are combined to form a codeword vector and converted into an encoded bit sequence.

Benefits of technology

Encoding of subframe 2, subframe 3 and B2a signals in the B1C signal of the BeiDou Navigation Satellite System was achieved, reducing encoding complexity and storage space requirements.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112838871B_ABST
    Figure CN112838871B_ABST
Patent Text Reader

Abstract

The present invention provides an LDPC code encoding method, an encoder and a satellite navigation system for satellite navigation. The above method includes: converting an information sequence to be LDPC encoded into a data symbol vector d of length L; using the data symbol vector and the first-level encoding array to perform first-level encoding processing to obtain a first-level encoding vector of length L; using the first-level encoding vector and the second-level encoding array to perform second-level encoding processing to obtain a check symbol vector p; the data symbol vector d and the check symbol vector p form a code word vector c; each data symbol in the code word vector c is converted into corresponding 6 binary bits to obtain a coding bit sequence. In an embodiment of the present invention, a two-level encoding method is used to calculate the check symbol vector p, and then the data symbol vector d and the check symbol vector p form a code word vector c, and are converted into a coding bit sequence, thereby achieving encoding.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of information security, and in particular to an LDPC code encoding method for satellite navigation, an encoder and a satellite navigation system. Background Art

[0002] Low-density parity-check (LDPC) codes are a type of linear block codes defined by a sparse check matrix and are widely used in digital communication and storage systems. Multi-ary LDPC codes are a type of LDPC codes and are constructed based on the multivariate field GF(q) (q>2, called q-ary codes).

[0003] In the next generation BeiDou satellite navigation system, three groups of 64-base LDPC codes are applied to B1C and B2a signals respectively to improve the accuracy of telegram data bits. Among them, subframe 2 of B1C signal adopts 64-base LDPC (200,100) coding scheme, subframe 3 adopts 64-base LDPC (88,44) coding scheme, and B2a signal adopts 64-base LDPC (96,48) coding scheme.

[0004] How to realize the encoding of these three sets of 64-base LDPC codes is a very critical technical issue. Summary of the invention

[0005] In view of this, the present invention provides an LDPC code encoding method, an encoder and a satellite navigation system for satellite navigation to achieve the encoding of subframe 2 and subframe 3 in the B1C signal of the Beidou satellite navigation system, as well as the encoding of the B2a signal.

[0006] In order to achieve the above-mentioned object of the invention, the present invention provides the following technical solutions:

[0007] A satellite navigation LDPC code encoding method, comprising:

[0008] Receiving an information sequence to be LDPC encoded;

[0009] Convert the information sequence into a data symbol vector d of length L; wherein each data symbol in the data symbol vector d is an element in a finite field GF(64); L is a positive integer, and the length of the information sequence is 6L;

[0010] Performing first-level encoding processing using the data symbol vector and the first-level encoding array to obtain a first-level encoding vector of length L; the dimension of the first-level encoding array is L×a, where a is a positive integer not greater than 2;

[0011] Performing second-level encoding processing using the first-level encoding vector and the second-level encoding array to obtain a check symbol vector p; the dimension of the second-level encoding array is b×1, and b is a positive integer not greater than L; each data symbol in the check symbol vector p is an element in the finite field GF(64);

[0012] Combining the data symbol vector d and the check symbol vector p into a codeword vector c;

[0013] Each data symbol in the codeword vector c is converted into corresponding 6 binary bits to obtain a coded bit sequence.

[0014] Optionally, the first-level encoding array includes: a position index array I with a dimension of L×2, a first sorting table array P1 with a dimension of L×1, and a first finite field array E with a dimension of L×2; each element in the position index array I and the first sorting table array P1 has a value range of 1 to L; the elements in the first finite field array are elements in the finite field GF(64).

[0015] Optionally, the first-level encoding processing includes: using the formula y(n)=d(I(i,1))·E(i,1)+d(I(i,2))·E(i,2) to calculate the first-level encoding vector y; wherein i is greater than or equal to 1 and less than or equal to L; I(i,1) and I(i,2) are the elements of the i-th row and 1st column and the i-th row and 2nd column of the position index array I, respectively; E(i,1) and E(i,2) are the elements of the i-th row and 1st column and the i-th row and 2nd column of the first finite field array E, respectively; y(n) represents the nth element in the first-level encoding vector; n=P1(i); P1(i) is the i-th element in the first sorting table array P1; n is greater than or equal to 1 and less than or equal to L; the “·” and “+” respectively represent multiplication and addition operations of elements in the finite field GF(64).

[0016] Optionally, the second-level coding array includes: a counting array g with a dimension of M×1; the second-level coding processing includes: calculating M times to obtain an initial check symbol vector r with a length of L; wherein the m-th calculation obtains k initial check symbols in the initial check symbol vector r; wherein, k=g(m); g(m) represents the m-th element in the counting array g, and the sum of all elements in the counting array g is equal to L; m is greater than or equal to 1 and less than or equal to M; and the check symbol vector p is calculated using the initial check symbol vector r.

[0017] Optionally, the second-level encoding array also includes: a second finite field array A with a dimension of L×1, a third finite field array B with a dimension of L×1, and a second sorting table array P2 with a dimension of L×1; wherein the elements in the second finite field array and the third finite field array are elements in the finite field GF(64).

[0018] Optionally, calculating the check symbol in the check symbol vector p for the mth time includes: reading k consecutive elements from the second finite field array A, the third finite field array B and the first-level coding vector y respectively; wherein, the vector composed of the k consecutive elements read from the second finite field array A is recorded as vector a; the vector composed of the k consecutive elements read from the third finite field array B is recorded as vector b; the vector composed of the k consecutive elements read from the first-level coding vector y is recorded as vector w; using the vector a and the vector b to calculate a first intermediate check symbol vector s with a length of k; using the vector w and the first intermediate check symbol vector s, calculating a second intermediate check symbol vector z with a length of k; using the first intermediate check symbol vector s and the second intermediate check symbol vector z, calculating k initial check symbols in the initial check symbol vector r.

[0019] Optionally, the j-th element in the vector b is recorded as b(j), j is greater than or equal to 1 and less than or equal to k; and the calculating of a first intermediate check symbol vector s having a length of k using the vector a and the vector b includes:

[0020] Use the formula s(j) = [a(j)] -1 b(j), calculate the first intermediate check symbol vector s; wherein s(j) represents the jth element in the first intermediate check symbol vector s; [a(j)] -1 represents the inverse element of the j-th element in the vector a;

[0021] The j'th element in the vector w is recorded as w(j'); 2≤j'≤k;

[0022] The calculation of the second intermediate check symbol vector z with a length of k comprises:

[0023] z(1)=w(1);

[0024] z(j')=s(j'-1)·z(j'-1)+w(j');

[0025] The j'th element in the k initial check symbols is denoted as x(j"); 2≤j"≤k-1;

[0026] The calculation formula of the k initial check symbols includes:

[0027]

[0028] x(1)=z(1)+s(k)·x(k);

[0029]

[0030] Wherein, the “·” and “+” represent the multiplication operation and the addition operation of the elements in the finite field GF(64), respectively.

[0031] Optionally, the calculating the check symbol vector p using the initial check symbol vector r comprises: using the formula p(t)=[a(i)] -1 r(i), calculate the check symbol vector p; where [a(i)] -1 represents the inverse element of the i-th element in the vector a; p(t) represents the t-th element in the check symbol vector p, t=P2(i); P2(i) is the i-th element in the second sorting table array P2; i is greater than or equal to 1 and less than or equal to L, t is greater than or equal to 1 and less than or equal to L.

[0032] An encoder, characterized in that a receiving module, a first-level encoding calculation module, a second-level encoding calculation module, and a codeword output module include:

[0033] The receiving module is used to: receive an information sequence to be LDPC encoded;

[0034] Convert the information sequence into a data symbol vector of length L; wherein each data symbol in the data symbol vector is an element in a finite field GF(64); L is a positive integer, and the length of the information sequence is 6L;

[0035] The first-level encoding module is used to: use the data symbol vector and the first-level encoding array to perform first-level encoding processing to obtain a first-level encoding vector with a length of L; the dimension of the first-level encoding array is L×a, and a is a positive integer not greater than 2;

[0036] The second-level encoding module is used to: perform secondary encoding processing using the first-level encoding vector and the second-level encoding array to obtain a check symbol vector p; the dimension of the second-level encoding array is b×1, and b is a positive integer not greater than L; each data symbol in the check symbol vector p is an element in the finite field GF(64);

[0037] The codeword output module is used for:

[0038] Combining the data symbol vector d and the check symbol vector p into a codeword vector c;

[0039] Each data symbol in the codeword vector c is converted into corresponding 6 binary bits to obtain a coded bit sequence.

[0040] A satellite navigation system comprises the above encoder.

[0041] It can be seen that in an embodiment of the present invention, after the information sequence to be encoded (corresponding to subframe 2, subframe 3, and B2a signal in the Beidou satellite navigation system B1C signal) is converted into a data symbol vector d, a two-stage encoding method is used to calculate the check symbol vector p, and then the data symbol vector d and the check symbol vector p are combined into a codeword vector c, and finally the codeword vector c is converted into a coding bit sequence, thereby realizing the encoding of subframe 2 and subframe 3 in the Beidou satellite navigation system B1C signal, and the encoding of the B2a signal. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 A schematic diagram of a message framing process provided by an embodiment of the present invention;

[0043] Figure 2 A schematic diagram of the structure of an encoder provided in an embodiment of the present invention;

[0044] Figure 3 An exemplary process of the encoding method provided by the embodiment of the present invention;

[0045] Figure 4 An exemplary process for calculating the first-level encoding vector y provided by an embodiment of the present invention;

[0046] Figure 5a , Figure 5b , Figure 5c An exemplary process for calculating a check symbol vector p provided by an embodiment of the present invention;

[0047] Figure 6 An exemplary process for obtaining a coded bit sequence provided by an embodiment of the present invention;

[0048] Figure 7a , Figure 8a , Figure 9a The P1 arrays corresponding to the three groups of 64-ary LDPC codes provided in the embodiment of the present invention;

[0049] Figure 7b , Figure 8b , Figure 9b The A arrays corresponding to the three groups of 64-ary LDPC codes provided in the embodiment of the present invention;

[0050] Figure 7c , Figure 8c , Fig.9c B arrays corresponding to three groups of 64-ary LDPC codes provided in an embodiment of the present invention;

[0051] Figure 7d , Figure 8d , Figure 9d The P2 arrays corresponding to the three groups of 64-ary LDPC codes provided in the embodiment of the present invention. DETAILED DESCRIPTION

[0052] The present invention provides an LDPC code encoding method and an encoder for satellite navigation, and a (Beidou) satellite navigation system using the encoder to implement LDPC encoding of subframes 2 and 3 in a B1C signal of the Beidou satellite navigation system, and LDPC encoding of a B2a signal.

[0053] Figure 1 A schematic diagram of the message framing process in the Beidou satellite navigation system provided by an embodiment of the present invention. Figure 1 It can be seen from the figure that the original message information sequence is passed through the CRC check unit 101 to obtain the sequence to be LDPC encoded (referred to as the encoding sequence).

[0054] In the BeiDou Navigation System, subframe 2 and subframe 3 of the B1C signal and the B2a signal all use 64-bit LDPC coding. Among them, the coding sequence length of subframe 2 of the B1C signal is 600 bits, the coding sequence length of subframe 3 of the B1C signal is 264 bits, and the coding sequence length of the B2a signal is 288 bits.

[0055] The 64-ary LDPC encoding unit 102 (i.e., the encoder) encodes the above sequence to be LDPC encoded, and the encoding method is 64-ary LDPC encoding with a code rate of 1 / 2. After the encoding is completed, the length of subframe 2 of the B1C signal is 1200 bits, the length of subframe 3 of the B1C signal is 528 bits, and the length of the B2a signal is 576 bits.

[0056] The message framing unit 103 frames the encoded bit sequence to form a transmission message. Among the above steps, the most complex one is the 64-ary LDPC encoding.

[0057] In order to realize the encoding of three groups of 64-base LDPC codes, the Beidou navigation system signal interface control file recommends the following method: Gaussian elimination is performed on the check matrix that defines each group of 64-base LDPC codes to obtain the generator matrix of its system form, and the information sequence is multiplied by the generator matrix for encoding. Although the check matrices of these LDPC codes are sparse check matrices, in which the number of zero elements is much greater than the number of non-zero elements, the generator matrix obtained by Gaussian elimination is a high-density matrix (i.e., a dense matrix) of L×L dimensions, which will occupy a large amount of storage space and has high complexity.

[0058] The encoding method, encoder, and (Beidou) satellite navigation system using the encoder provided in the embodiments of the present invention can support the encoding of the above three groups of 64-ary LDPC codes with low complexity.

[0059] Figure 2 An exemplary structure of the encoder is shown, including: a receiving module 201, a first-level coding calculation module 202, a second-level coding calculation module 203, and a codeword output module 204.

[0060] Figure 3 Shown by Figure 1 , Figure 2 An exemplary process of the above encoding method performed by the encoder shown may include at least the following steps:

[0061] S1: Receive an information sequence to be LDPC encoded.

[0062] The above information sequence may be output to the encoder by the CRC check unit 101 in the satellite navigation system.

[0063] More specifically, Figure 2 The receiving unit 201 receives the information sequence output by the CRC check unit 101.

[0064] The above information sequence (ie, the coding sequence) is a binary bit sequence, and 24 bits of CRC check information are added.

[0065] Specifically, for the three groups of 64-bit LDPC codes: the coding sequence length of subframe 2 of the B1C signal is 600 bits; the coding sequence length of subframe 3 of the B1C signal is 264 bits; and the coding sequence length of the B2a signal is 288 bits.

[0066] S2: Convert the information sequence into a data symbol vector d of length L.

[0067] can be Figure 2 The receiving unit 201 in the step S2 executes. The receiving unit 201 may sequentially convert the 6 bits as a group into a data symbol to be encoded until the receiving process is completed, thereby forming a data symbol vector d with a length of L.

[0068] How to convert 6 binary bits into corresponding data symbols is an existing method and will not be described in detail here.

[0069] Wherein, L is a positive integer. Since every 6 bits are converted into a data symbol, the length of the aforementioned information sequence is 6L.

[0070] As mentioned above, the coding sequence length of subframe 2 of the B1C signal is 600 bits; the coding sequence length of subframe 3 of the B1C signal is 264 bits; and the coding sequence length of the B2a signal is 288 bits.

[0071] After conversion, for subframe 2 of the B1C signal, the value of L is 100, for subframe 3 of the B1C signal, the value of L is 44, and for the B2a signal, the value of L is 48.

[0072] It should be noted that each data symbol in the data symbol vector d is an element in the finite field GF(64).

[0073] GF(64) is an extension of the binary field GF(2), from the primitive polynomial p(x)=1+x+x 6 Generate. The elements in GF(64) can be represented by 0, 1, 2, …, 63, and these elements have a one-to-one correspondence with 6-bit binary vectors (high order first, low order last). For example, element 2 corresponds to the 6-bit binary vector [0 0 0 0 1 0].

[0074] S3: Use the data symbol vector d and the first-level coding array to perform first-level coding processing to obtain a first-level coding vector y with a length of L.

[0075] The dimension of the first-level encoding array is L×a (a is a positive integer not greater than 2).

[0076] In one example, the first level encoding array may include:

[0077] A position index array I (referred to as array I or I array for short) of dimension L×2;

[0078] A first sorting table array P1 (referred to as array P1 or P1 array) having a dimension of L×1;

[0079] A first finite field array E of dimension L×2 (referred to as array E or E array for short).

[0080] Among them, each element in the position index array I and the first sorting table array P1 has a value range of 1 to L; the elements in the first finite field array are elements in the finite field GF(64).

[0081] Step S3 can be performed by Figure 2 The first level encoding module 202 is shown to execute.

[0082] This article will also detail how to use the I array, P1 array, and E array to perform first-level encoding processing to obtain a first-level encoding vector of length L.

[0083] S4: Use the first-level coding vector and the second-level coding array to perform second-level coding processing to obtain a check symbol vector p.

[0084] The dimension of the second-level encoding array is b×1 (b is a positive integer not greater than L).

[0085] Each data symbol in the check symbol vector p is also an element in the finite field GF(64).

[0086] In one example, the second level encoding array may include:

[0087] A counting array g with dimension M×1 (M is a positive integer not greater than 5);

[0088] A second finite field array A of dimension L×1 (referred to as array A or A array for short);

[0089] A third finite field array B of dimension L×1 (referred to as array B or B array for short);

[0090] A second sorting table array P2 (referred to as array P2 or P2 array) having a dimension of L×1;

[0091] The elements in array A and array B are elements in the finite field GF(64).

[0092] Step S4 can be performed by Figure 2 The second level encoding module 203 shown is executed.

[0093] This article will also detail how to use the above arrays to perform multiplication and addition operations to obtain the check symbol vector p.

[0094] S5: Combine the data symbol vector d and the check symbol vector p into a codeword vector c.

[0095] Step S5 can be performed by Figure 2 The codeword output module 204 is shown to execute.

[0096] The codeword output module 204 may combine the data symbol vector d and the check symbol vector p to form a codeword vector c=[d,p], such that c·H T =0 holds true.

[0097] Where H is the check matrix of the 64-base LDPC code, and T represents the matrix transpose. The three groups of check matrices of the 64-base LDPC code are given in the Beidou navigation system signal interface control file.

[0098] S6: Convert each data symbol in the codeword vector c into corresponding 6 binary bits to obtain a coded bit sequence.

[0099] Step S6 can be performed by Figure 2The codeword output module 204 shown is shown to execute. How to convert the data symbol into the corresponding 6 binary bits is an existing method and will not be described in detail here.

[0100] It can be seen that in the present invention, after converting the information sequence (corresponding to subframe 2, subframe 3, and B2a signal in the Beidou satellite navigation system B1C signal) into a data symbol vector d, a two-stage encoding method is used to calculate the check symbol vector p, and then the data symbol vector d and the check symbol vector p are combined into a codeword vector c, and then the codeword vector c is converted into a coded bit sequence, thereby realizing the encoding of subframe 2 and subframe 3 in the Beidou satellite navigation system B1C signal, and the encoding of the B2a signal.

[0101] Furthermore, it can be seen from the dimensions of the first-level coding array and the second-level coding array that the computational order involved in the embodiment of the present invention is linearly related to L, and the complexity is much lower than the existing coding method.

[0102] The following describes how the first-level encoding module 202 performs the first-level encoding process:

[0103] In one example, the following formula 1 may be used to perform the first-level encoding process and calculate the first-level encoding vector y:

[0104] y(n)=d(I(i,1))·E(i,1)+d(I(i,2))·E(i,2) (Formula 1)

[0105] in;

[0106] The operator symbols “·” and “+” represent the multiplication and addition operations of elements in the finite field GF(64) respectively;

[0107] i is greater than or equal to 1 and less than or equal to L;

[0108] I(i,1) and I(i,2) are the elements in the i-th row and the i-th column of the array I respectively;

[0109] E(i,1) and E(i,2) are the elements in the i-th row and the i-th column of the E array respectively;

[0110] y(n) represents the nth element in the first-level coding vector y, where n is greater than or equal to 1 and less than or equal to L; n=P1(i); P1(i) is the i-th element in the first sorting table array P1.

[0111] The P1 arrays corresponding to the three 64-bit LDPC codes can be found in Figure 7a , Figure 8a , Figure 9a .

[0112] by Figure 8aTaking the P1 array shown as an example, if i = 1, then P1(i) = 29; y(29) = d(I(1,1))·E(1,1)+d(I(1,2))·E(1,2); if i = 2, then P1(i) = 7; y(7) = d(I(2,1))·E(2,1)+d(I(2,2))·E(2,2).

[0113] And so on, I won’t go into details.

[0114] See also Figure 4 , the process of calculating the first-level encoding vector y may include:

[0115] Step A: Read the I array, E array and P1 array;

[0116] The first-stage encoding module 202 first reads the I array, E array and P1 array pre-stored in the ROM according to different LDPC codes.

[0117] Among them, the P1 arrays corresponding to the three groups of 64-bit LDPC codes can be found in Figure 7a , Figure 8a , Figure 9a ;

[0118] The I array and E array corresponding to the LDPC code in subframe 2 of the B1C signal are respectively determined by the array H of the Beidou navigation system signal interface control file 100,200,index and H 100,200,element Given.

[0119] The I array and E array corresponding to the LDPC code in subframe 3 of the B1C signal are respectively determined by the array H of the Beidou navigation system signal interface control file. 44,88,index and H 44,88,element Given.

[0120] The I array and E array corresponding to the LDPC code in the B2a signal are respectively controlled by the array H of the Beidou navigation system signal interface control file. 48,96,index and H 48,96,element Given.

[0121] The P1 array is read from top to bottom by column, and after a column is read, it continues to read from left to right.

[0122] After the reading is completed, the calculation of the vector y begins.

[0123] Step B: Initialize vector y and set i=1.

[0124] The first-stage encoding module 202 may initialize all elements in y to zero.

[0125] Step C: Calculate the value of y(P1(i)) according to Formula 1.

[0126] For how to calculate, please refer to the introduction of the above formula 1, which will not be elaborated here.

[0127] Step D: Determine whether i is equal to L, if so, go to step F, if not, go to step E;

[0128] Step E: Set i←i+1 and return to step C;

[0129] That is, the above calculation process is repeated until i=L, and the first level coding calculation is completed. The result of the first level coding calculation is a vector y, whose length is L, and each element is an element in GF(64).

[0130] Step F: Output vector y.

[0131] Next, it is introduced how to use the first-level coding vector and the second-level coding array to perform second-level coding processing to obtain the check symbol vector p.

[0132] In an example, see Figure 5a , the check symbol vector p can be calculated in the following steps:

[0133] S51: Calculate M times to obtain an initial check symbol vector r with a length of L;

[0134] Among them, the mth calculation obtains k initial check symbols in the initial check symbol vector r, k=g(m); g(m) represents the mth element in the aforementioned counting array g (m is greater than or equal to 1 and less than or equal to M).

[0135] Specifically, for subframe 2 of the B1C signal, the g array is [68 12 12 8] (M=4); for subframe 3 of the B1C signal, the g array is [10 18 6 6 4] (M=5); for the B2a signal, the g array is [24 24] (M=2). It can be seen that the sum of all elements in the array g is equal to L.

[0136] S52: Calculate the check symbol vector p using the initial check symbol vector r.

[0137] The following describes the process of calculating the check symbol in the check symbol vector p for the mth time, see Figure 5b , which may include the following steps:

[0138] S511: Read k consecutive elements from the second finite field array A, the third finite field array B and the first-level encoding vector y respectively.

[0139] Taking the g array corresponding to subframe 2 of the B1C signal as an example, when m=1, k=68; when m=2, k=12; when m=3, k=12; when m=4, k=8.

[0140] The vector composed of k consecutive elements read from array A can be recorded as vector a;

[0141] The vector consisting of k consecutive elements read from array B is recorded as vector b. The j-th element of vector b is recorded as b(j) (j is greater than or equal to 1 and less than or equal to k);

[0142] The vector consisting of k consecutive elements read from the first-level encoding vector y is recorded as vector w.

[0143] S512: Calculate a first intermediate check symbol vector s with a length of k using vector a and vector b.

[0144] In one example, the formula s(j)=[a(j)] may be used. -1 b(j), calculate the first intermediate check symbol vector s;

[0145] Where s(j) represents the jth element in the first intermediate check symbol vector s; [a(j)] -1 Represents the inverse of the j-th element in vector a.

[0146] S513: Calculate a second intermediate check symbol vector z with a length of k using the vector w and the first intermediate check symbol vector s;

[0147] In one example, the j'th element in the vector z can be recorded as z(j'), 2≤j'≤k, and the vector z can be calculated by the following formula:

[0148] z(1)=w(1);

[0149] z(j')=s(j'-1)·z(j'-1)+w(j').

[0150] S514: Use the first intermediate check symbol vector s and the second intermediate check symbol vector z to calculate k initial check symbols in the initial check symbol vector r.

[0151] The j"th element among the k initial check symbols may be denoted as x(j"), 2≤j"≤k-1.

[0152] In one example, the k initial check symbols may be calculated using the following calculation formula:

[0153]

[0154] x(1)=z(1)+s(k)·x(k);

[0155]

[0156] Here, “·” and “+” represent the multiplication and addition operations of elements in the finite field GF(64), respectively.

[0157] The A arrays corresponding to the three groups of LDPC codes can be found in Figure 7b , Figure 8b , Figure 9b , B array can be found in Figure 7c , Figure 8c , Fig.9c , P2 array can be found in Figure 7d , Figure 8d , Figure 9d .

[0158] Next, a more detailed example is used to describe how the second-stage encoding module 203 calculates the check symbol vector p. Figure 5c , which may include the following steps:

[0159] Step a: Read the A array, B array, and P2 array, and input the first-level encoding vector y.

[0160] The A array, the B array, and the P2 array are all read from top to bottom by column, and after a column is read, the reading continues from left to right.

[0161] Step b: Set m=1 and initialize vector p and vector r.

[0162] The second-stage encoding module 203 may initialize all elements of the vector p and the vector r to zero.

[0163] Step c: Let k = g(m).

[0164] g(m) represents the m-th element in the aforementioned counting array g (m is greater than or equal to 1 and less than or equal to M).

[0165] Step d: Read k consecutive elements from array A, array B, and array y in turn and record them as a(j), b(j), and w(j) respectively.

[0166] Where j = 1, 2,…, k.

[0167] Step e: Calculate the vector s of length k.

[0168] in:

[0169] s(j)=[a(j)] -1 b(j) (Formula 2)

[0170] Step f: Calculate the vector z of length k.

[0171] Let the j'th element in vector w be w(j'), 2≤j'≤k; then:

[0172] z(1)=w(1);

[0173] z(j')=s(j'-1)·z(j'-1)+w(j') (Formula 3)

[0174] Step g: Calculate the vector x of length k.

[0175] Let the j'th element in the k initial check symbols be x(j"); 2≤j"≤k-1, then:

[0176]

[0177] x(1)=z(1)+s(k)·x(k);

[0178]

[0179] Here, Π represents the element-wise multiplication over GF(64).

[0180] Step h: Place the calculated k initial check symbols at the corresponding positions of vector r.

[0181] Where r = [r, x] (Formula 5)

[0182] For example, in subframe 2 of the B1C signal, when m=1, 68 initial check symbols are calculated as the 1st to 68th elements of vector r; when m=2, 12 initial check symbols are calculated as the 69th to 80th elements of vector r, and so on.

[0183] Step i: Determine whether m is equal to M. If so, proceed to step k; if not, proceed to step j;

[0184] Step j: Set m←m+1 and return to step c;

[0185] The above calculation process is repeated until m = M. At this point, a vector r of length L is obtained, each element of which is an element in GF(64).

[0186] Step k: Form a check symbol vector p.

[0187] In one example, the check symbol vector p can be calculated using the following formula:

[0188] p(t)=[a(i)] -1 ·r(i) (Formula 6)

[0189] Among them, p(t) represents the tth element in the check symbol vector p, t=P2(i); P2(i) is the i-th element in the second sorting table array P2; i is greater than or equal to 1 and less than or equal to L, and t is greater than or equal to 1 and less than or equal to L.

[0190] Still taking subframe 2 of the B1C signal as an example, if i=1, P2(1)=1, then t=1, p(1)=[a(1)] -1 r(1); if i=2, P2(2)=53, then t=53, p(53)=[a(2)] -1 r(2); if i=3, P2(3)=19, then t=19, p(19)=[a(3)] -1 ·r(3).

[0191] After completing the second-level coding calculation, the codeword output module 204 will execute the aforementioned steps S5 and S6 to obtain a coded bit sequence (see Figure 6 ).

[0192] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the differences can be referred to the method part.

[0193] The professionals may further appreciate that the units and model steps of each example described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0194] The steps of the method or model described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, software units executed by a processor, or a combination of the two. The software units may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a WD-ROM, or any other form of storage medium known in the art.

[0195] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A satellite navigation LDPC code encoding method, characterized in that: include: Receiving an information sequence to be LDPC encoded; Convert the information sequence into a data symbol vector d of length L; wherein each data symbol in the data symbol vector d is an element in a finite field GF(64); L is a positive integer, and the length of the information sequence is 6L; Performing first-level encoding processing using the data symbol vector and the first-level encoding array to obtain a first-level encoding vector of length L; the dimension of the first-level encoding array is L×a, where a is a positive integer not greater than 2; Performing second-level encoding processing using the first-level encoding vector and the second-level encoding array to obtain a check symbol vector p; the dimension of the second-level encoding array is b×1, and b is a positive integer not greater than L; each data symbol in the check symbol vector p is an element in the finite field GF(64); Combining the data symbol vector d and the check symbol vector p into a codeword vector c; Each data symbol in the codeword vector c is converted into corresponding 6 binary bits to obtain a coded bit sequence.

2. The method according to claim 1, characterized in that The first-level encoding array includes: a position index array I with a dimension of L×2, a first sorting table array P1 with a dimension of L×1, and a first finite field array E with a dimension of L×2; each element in the position index array I and the first sorting table array P1 has a value range of 1 to L; the elements in the first finite field array E are elements in the finite field GF(64).

3. The method according to claim 2, characterized in that The first level encoding process includes: The first-level encoding vector y is calculated using the formula y(n)=d(I(i,1))·E(i,1)+d(I(i,2))·E(i,2), where d(I(i,1)) is the data symbol corresponding to the element in the i-th row and the first column of the I array, and d(I(i,2)) is the data symbol corresponding to the element in the i-th row and the second column of the I array; Wherein, i is greater than or equal to 1 and less than or equal to L; I(i,1) and I(i,2) are the elements of the i-th row and the first column and the i-th row and the second column of the position index array I respectively; E(i,1) and E(i,2) are the elements of the i-th row and the first column and the i-th row and the second column of the first finite field array E respectively; y(n) represents the n-th element in the first-level encoding vector; n=P1(i); P1(i) is the i-th element in the first sorting table array P1; n is greater than or equal to 1 and less than or equal to L; the "·" and "+" respectively represent multiplication and addition operations of elements in the finite field GF(64).

4. The method according to claim 1, characterized in that The second-level encoding array includes: a counting array g with a dimension of M×1; The second level encoding process includes: The initial check symbol vector r of length L is obtained by calculating M times; wherein the initial check symbol vector r is obtained by the m-th calculation; wherein k initial check symbols in the initial check symbol vector r; wherein k=g(m); g(m) represents the m-th element in the counting array g, and the sum of all elements in the counting array g is equal to L; m is greater than or equal to 1 and less than or equal to M; The check symbol vector p is calculated using the initial check symbol vector r.

5. The method according to claim 4, characterized in that The second-level encoding array also includes: a second finite field array A with a dimension of L×1, a third finite field array B with a dimension of L×1, and a second sorting table array P2 with a dimension of L×1; The elements in the second finite field array and the third finite field array are elements in the finite field GF(64).

6. The method according to claim 5, characterized in that The check symbols in the m-th calculation check symbol vector p include: k consecutive elements are read from the second finite field array A, the third finite field array B and the first-level encoding vector y respectively; wherein the vector composed of the k consecutive elements read from the second finite field array A is recorded as vector a; the vector composed of the k consecutive elements read from the third finite field array B is recorded as vector b; the vector composed of the k consecutive elements read from the first-level encoding vector y is recorded as vector w; Calculate a first intermediate check symbol vector s with a length of k using the vector a and the vector b; Using the vector w and the first intermediate check symbol vector s, calculate a second intermediate check symbol vector z with a length k; The k initial check symbols in the initial check symbol vector r are calculated using the first intermediate check symbol vector s and the second intermediate check symbol vector z.

7. The method according to claim 6, characterized in that The j-th element in the vector b is denoted as b(j), where j is greater than or equal to 1 and less than or equal to k; The calculating of a first intermediate check symbol vector s having a length k using the vector a and the vector b comprises: Use the formula s(j) = [a(j)] -1 b(j), calculate the first intermediate check symbol vector s; wherein s(j) represents the jth element in the first intermediate check symbol vector s; [a(j)] -1 represents the inverse element of the j-th element in the vector a; The j'th element in the vector w is recorded as w(j'); 2≤j'≤k; The calculation of the second intermediate check symbol vector z with a length of k comprises: z(1)=w(1), where z(1) is the first element in the vector z, and w(1) is the first element in the vector w; z(j')=s(j'-1)·z(j'-1)+w(j'), wherein z(j') is the j'th element in the vector z, s(j'-1) is the j'-1th element in the first intermediate check symbol vector s, z(j'-1) is the j'-1th element in the vector z, and w(j') is the j'th element in the vector w; The j'th element in the k initial check symbols is denoted as x(j"); 2≤j"≤k-1; The calculation formula of the k initial check symbols includes: The x(k) is the kth element in the initial check symbol, s(i) is the i-th element in the first intermediate check symbol vector s, and z(k) is the k-th element in the vector z; x(1)=z(1)+s(k)·x(k), wherein x(1) is the first element in the initial check symbol, and s(k) is the kth element in the first intermediate check symbol vector s; The z(j") is the j"th element in the vector z; wherein the "·" and "+" respectively represent the multiplication and addition operations of the elements in the finite field GF(64).

8. The method according to claim 6, characterized in that The calculating the check symbol vector p by using the initial check symbol vector r comprises: Using the formula p(t) = [a(i)] -1 r(i), calculate and obtain the check symbol vector p; Among them, [a(i)] -1 represents the inverse element of the i-th element in the vector a; p(t) represents the t-th element in the check symbol vector p, t=P2(i); the P2(i) is the i-th element in the second sorting table array P2; i is greater than or equal to 1 and less than or equal to L, t is greater than or equal to 1 and less than or equal to L, and r(i) represents the i-th element in the initial check symbol vector r.

9. An encoder, characterized in that: The receiving module, the first-level coding calculation module, the second-level coding calculation module, and the codeword output module include: The receiving module is used to: receive an information sequence to be LDPC encoded; Convert the information sequence into a data symbol vector of length L; wherein each data symbol in the data symbol vector is an element in a finite field GF(64); L is a positive integer, and the length of the information sequence is 6L; The first-level encoding module is used to: use the data symbol vector and the first-level encoding array to perform first-level encoding processing to obtain a first-level encoding vector with a length of L; the dimension of the first-level encoding array is L×a, and a is a positive integer not greater than 2; The second-level encoding module is used to: perform secondary encoding processing using the first-level encoding vector and the second-level encoding array to obtain a check symbol vector p; the dimension of the second-level encoding array is b×1, and b is a positive integer not greater than L; each data symbol in the check symbol vector p is an element in the finite field GF(64); The codeword output module is used for: Combining the data symbol vector d and the check symbol vector p into a codeword vector c; Each data symbol in the codeword vector c is converted into corresponding 6 binary bits to obtain a coded bit sequence.

10. A satellite navigation system, characterized in that: Comprising an encoder as claimed in claim 9.

Citation Information

Patent Citations

  • Method, device and system for encoding and decoding

    CN103780329A

  • Channel coding method and apparatus

    CN105474548A

  • Fischer-tropsch derived gas oil fraction

    CN105594171A

  • Cascaded random encoder / decoder and encoding / decoding method based on LT code and LDPC (Low Density Parity Check) code

    CN107888334A

  • Encoding method and device

    CN108809506A