A coding method and device based on LDPC cascade

By cascading encoding of LDPC code and RM code, the existing LDPC code error platform has been solved, and the existing LDPC code error platform and inflexible code rate support is achieved, which reduces the hardware complexity.

CN113037296BActive Publication Date: 2024-11-19NUFRONT MOBILE COMM TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201911346095.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-12-24
Publication Date
2024-11-19
Estimated Expiration
2039-12-24

AI Technical Summary

Technical Problem

The existing LDPC code has a high error platform in high-reliable services, the encoding rate is inflexible, and the hardware complexity is high, making it difficult to meet the needs of low packet error rate.

Method used

The cascading encoding method of LDPC code and RM code is adopted, with LDPC code as the inner code and RM code as the outer code. Through information data blocking, RM encoding and LDPC encoding, a lower error platform and flexible multi-code rate support are achieved.

Benefits of technology

It realizes a lower code error platform, supports multiple code rates, reduces hardware complexity, and focuses on LDPC codes. The RM code is relatively simple to encode and decode, achieving the effect of lower code error platforms and multiple code rates.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113037296B_ABST
    Figure CN113037296B_ABST
Patent Text Reader

Abstract

The present invention provides a coding method and device based on LDPC cascade, which cascades a long code (LDPC code) with a short code (RM code), and the error bits that are not completely corrected by the inner code LDPC code can be corrected by the outer code RM code; and the cascaded joint iterative decoding can correct more error bits. Therefore, the cascade code can achieve a lower error platform; support multiple code rates, and when the code length and code rate of the long code (LDPC code) are fixed, flexible multiple code rates can be supported by using RM codes with different code rates; the implementation complexity is low, and the hardware complexity is mainly concentrated in the LDPC code, and the coding and decoding of the RM code is relatively simple. Therefore, with a small increase in complexity, the above-mentioned effects of reducing the error platform and supporting multiple code rates can be achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of wireless communication, and in particular relates to a coding method and device based on LDPC cascade. Background Art

[0002] Channel coding is used to detect and correct signal errors in the transmission channel and is a key technology to ensure reliable signal transmission. As one of the core technologies, channel coding technology is widely used in wireless / wired communication systems and digital storage systems.

[0003] With the diversification of data service types, the LDPC (Low Density Parity Check) codes in some current standards or systems cannot meet the needs of some services, mainly manifested in the high error platform and inflexible coding rate. High-reliability services have more stringent requirements on the packet error rate (BLER), which is generally on the order of 10e-8 or even lower. The LDPC codes in the existing standards generally correspond to one LDPC code for each code rate, represented by the check matrix H or the generator matrix G. The H or G matrices for different code rates are different, and more storage units and computing units are required to support multiple code rates during encoding and decoding. The hardware complexity is relatively high. Summary of the invention

[0004] In view of this, the technical problem to be solved by the present invention is to provide a coding method and device based on LDPC cascade, which can achieve a lower error platform, support flexible multi-code rates, and be easy to implement.

[0005] The present invention provides a coding method based on LDPC cascade, which sets LDPC code as inner code and RM code (Reed-Muller code) as outer code, performs cascade coding on LDPC code and RM code, and sets LDPC code to (N L , K L ), where N L is the length of the LDPC code output codeword, K L is the input information bit length; set the RM code to (N R , K R ), where N R is the length of the RM encoding output codeword, K R is the input information bit length; the encoding method includes:

[0006] The information data is divided into blocks, and the data to be encoded is divided into blocks according to the length K of the RM code. R Perform block processing, each data block is a one-dimensional row vector with a length of i;

[0007] RM encoding: encode each data block after block division through RM encoder to generate a length of NR RM codeword; where the row vector of each data block (dimension is 1×K R ) and the generator matrix G of RM RM (The dimension is K R ×N R ) to obtain an RM codeword (N R , K R );

[0008] LDPC coding, the RM codeword is composed of K L bits, pass through the LDPC encoder, and generate N L LDPC codeword, the row vector of the data block (dimension is 1×K L ) and the LDPC generator matrix G LDPC (Its dimension is K L ×N L ) to obtain an LDPC codeword (N L , K L ).

[0009] The present invention provides a decoding method for LDPC concatenated codes, using LDPC codes as inner codes and RM codes as outer codes, the method comprising the following steps:

[0010] a) Inner code decoding: the input soft bits are decoded using a predetermined decoding algorithm to obtain the check result, intermediate soft bits, and decision information bits;

[0011] b) when the check result is correct or the joint iteration reaches the maximum number of times, the decision information bit is sent to the first outer code decoder, and the first outer code decoder performs outer code decoding on the decision information bit; otherwise, the intermediate soft bit is sent to the second outer code decoder, and the second outer code decoder performs outer code decoding on the RM code in the intermediate soft bit and updates the intermediate soft bit;

[0012] c) weighted soft bit combination, weighted combination of the updated intermediate soft bits and the intermediate soft bits obtained by inner code decoding, and inner code decoding is performed again;

[0013] d) Information data merging: merging the output bits of the first outer code decoder in order to complete decoding and obtain output bits.

[0014] The present invention provides an encoder based on LDPC cascade, which sets the LDPC code as the inner code and the RM code as the outer code, performs concatenated coding on the LDPC code and the RM code, and sets the LDPC code to (N L , K L ), where N L is the length of the LDPC code output codeword, K Lis the input information bit length; set the RM code to (N R , K R ), where N R is the length of the RM encoding output codeword, K R is the input information bit length; the encoder comprises:

[0015] The information data block unit divides the data to be encoded into blocks according to the length K of the RM code. R Perform block processing, each data block is a one-dimensional row vector with a length of i;

[0016] The RM encoding unit encodes each data block after the block is divided into blocks, and generates a length of N R RM codeword; where the row vector of each data block (dimension is 1×K R ) and RM's generator matrix GRM (dimension K R ×N R ) to obtain an RM codeword (N R , K R );

[0017] LDPC encoding unit, the RM codeword is composed of K L bits, pass through the LDPC encoder, and generate N L LDPC codeword, the row vector of the data block (dimension is 1×K L ) and the LDPC generator matrix GLDPC (whose dimension is K L ×N L ) to obtain an LDPC codeword (N L , K L ).

[0018] The present invention provides a decoder for LDPC cascade codes, using LDPC codes as inner codes and RM codes as outer codes. The decoder includes an inner code decoding unit, a check and judgment unit, a first outer code decoding unit, a second outer code decoding unit, a soft bit weighted merging unit, and an information data merging unit:

[0019] The inner code decoding unit decodes the input soft bits using a predetermined decoding algorithm to obtain a check result, an intermediate soft bit, and a decision information bit;

[0020] The verification judgment unit is used to detect whether the verification result is correct or whether the joint iteration reaches the maximum number of times; when the verification result is correct or the joint iteration reaches the maximum number of times, the decision information bit is sent to the first outer code decoding unit, and the first outer code decoding unit performs outer code decoding on the decision information bit; otherwise, the intermediate soft bit is sent to the second outer code decoding unit, and the second outer code decoding unit performs outer code decoding on the RM code in the intermediate soft bit and updates the intermediate soft bit;

[0021] The soft bit weighted combining unit weights and combines the intermediate soft bits updated by the first outer code decoding unit with the intermediate soft bits output by the inner code decoding unit, and performs inner code decoding again;

[0022] The information data combining unit combines and outputs the output bits of the first outer code decoding unit in sequence, completes decoding and obtains the original data bits.

[0023] In summary, in the technical solution provided by the present invention, the long code (LDPC code) and the short code (RM code) are cascaded, and the error bits that are not completely corrected by the inner code LDPC code can be corrected by the outer code RM code; and the cascaded joint iterative decoding can correct more error bits. Therefore, this cascaded code can achieve a lower error platform; support multiple code rates, and when the code length and code rate of the long code (LDPC code) are fixed, flexible multiple code rates can be supported by using RM codes with different code rates; the implementation complexity is low, and the hardware complexity is mainly concentrated in the LDPC code, and the encoding and decoding of the RM code is relatively simple. Therefore, with a small increase in complexity, the above-mentioned effects of reducing the error platform and supporting multiple code rates can be achieved.

[0024] For the above and related purposes, one or more embodiments include features that will be described in detail below and particularly pointed out in the claims. The following description and the accompanying drawings describe certain exemplary aspects in detail, and are indicative of only some of the various ways in which the principles of the various embodiments may be employed. Other benefits and novel features will become apparent as the following detailed description is considered in conjunction with the accompanying drawings, and the disclosed embodiments are intended to include all such aspects and their equivalents. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 The present invention provides a flow chart of an encoding method based on LDPC cascade;

[0026] Figure 2 The present invention provides a flowchart of a decoding method based on LDPC cascade;

[0027] Figure 3 A schematic diagram of an encoder structure based on LDPC cascade is provided in an embodiment of the present invention;

[0028] Figure 4 A schematic diagram of a decoder based on LDPC cascade is provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0029] The following description and the accompanying drawings fully illustrate specific embodiments of the present invention so that those skilled in the art can practice them. Other embodiments may include structural, logical, electrical, process and other changes. The examples represent possible changes only. Unless explicitly required, separate components and functions are optional, and the order of operation may vary. Parts and features of some embodiments may be included in or replace parts and features of other embodiments. The scope of the embodiments of the present invention includes the entire scope of the claims, and all available equivalents of the claims. In this article, these embodiments of the present invention may be represented individually or collectively by the term "invention", which is only for convenience, and if more than one invention is actually disclosed, it is not intended to automatically limit the scope of the application to any single invention or inventive concept.

[0030] like Figure 2 As shown, an LDPC cascade-based coding method provided by an embodiment of the present invention sets an LDPC code as an inner code and an RM code as an outer code, and concatenates the LDPC code and the RM code, and pre-sets the LDPC code to (N L , K L ), where N L is the length of the LDPC code output codeword, K L is the input information bit length; set the RM code to (N R , K R ), where N R is the length of the RM encoding output codeword, K R is the input information bit length; the encoding method includes:

[0031] S101, information data is divided into blocks, and the data to be encoded is divided into blocks according to the length K of the RM code. R Perform block processing, each data block is a one-dimensional row vector with a length of i;

[0032] S102, RM encoding, each of the divided data blocks is encoded by the RM encoder to generate a length of N R RM codeword; where the row vector of each data block (dimension is 1×K R ) and RM's generator matrix GRM (dimension K R ×N R ) to obtain an RM codeword (N R , K R );

[0033] S103, LDPC encoding, the RM codeword is composed into K L bits, pass through the LDPC encoder, and generate N L LDPC codeword, the row vector of the data block (dimension is 1×K L ) and the LDPC generator matrix GLDPC (whose dimension is K L ×N L ) to obtain an LDPC codeword (N L , K L ).

[0034] In this encoding method, the inner code LDPC (2 m , 2 n ) and external code RM(2 j , the cascade coding process of i) is as follows:

[0035] 1) Information data block: The information data is divided into blocks according to the information bit length i of the RM code, and each outer code information block is a one-dimensional row vector with a length of i;

[0036] 2) External code encoding: The row vector of each external code information block (whose dimension is 1×i) and the generator matrix GRM of RM (whose dimension is i×2 j ) and we get RM(2 j , i) codeword, corresponding to a one-dimensional row vector, dimension is 1×2 j ;

[0037] 3) Internal code encoding: 2 n / 2 j =2 n-j RM codes form an inner code information block, whose length is 2 j ×2 n-j =2 n , corresponding to a one-dimensional row vector with a dimension of 1×2 n ; The row vector of the inner code information block (dimension is 1×2 n ) and the LDPC generator matrix GLDPC (dimension is 2 n ×2 m ) and get an LDPC(2 m , 2 n ) codeword, where m, n, i, j are positive integers and n>j.

[0038] Specifically, the encoding scheme of the present invention is described below by taking the inner code LDPC (512, 256) and the outer code RM (16, i) as an example.

[0039] The coding input bit of the inner code LDPC (512, 256) is 256, the coding output bit is 512, and the coding rate is R1 = 256 / 512 = 0.5. The coding input bit of the outer code RM (16, i) is i, the coding output bit is 16, and the coding rate is R2 = i / 16.

[0040] RM code is based on code length 2 4 There can be 4 code words: RM(16,1), RM(16,5), RM(16,11), RM(16,15).

[0041] RM code is based on code length 2 3 There can be three code words: RM(8,1), RM(8,4), RM(8,7), which can be expanded by 2 times to obtain RM(16,2), RM(16,8), RM(16,14) respectively.

[0042] RM code is based on code length 2 2 There can be two code words: RM(4,1) and RM(4,3), which can be expanded by 4 times to obtain RM(16,4) and RM(16,12) respectively.

[0043] In addition, a code length of 2 3 The RM code and two codes of length 2 2 The RM code combination can get a new code length of 2 4 RM code. For example, one RM(8,1) combined with two RM(4,1) can get one RM(16,3). This combination can get RM(16,3), RM(16,6), RM(16,7), RM(16,9), RM(16,10), RM(16,13).

[0044] Therefore, the value range of i in RM(16, i) is [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]

[0045] The code length after cascading is 512 bits, and the encoding rate is: R = R1*R2 = i / 32, i = 1, 2, ..., 15. There are a total of 15 different code rates, which can meet the needs of flexible multi-rate.

[0046] In a specific embodiment, the concatenated coding process of the inner code LDPC (512, 256) and the outer code RM (16, i) is as follows:

[0047] 1) Information Blocking: Information data is divided into blocks according to the information bit length of the RM code (i.e., i), and each outer code information block is a one-dimensional row vector of length i.

[0048] 2) External code encoding (RM encoder): The row vector of each external code information block (whose dimension is 1×i) is multiplied by the RM generator matrix GRM (whose dimension is i×16) to obtain an RM(16,i) codeword, corresponding to a one-dimensional row vector with a dimension of 1×16.

[0049] 3) Inner code encoding (LDPC encoder): 256 / 16 = 16 RM codes are combined into an inner code information block, whose length is 16 × 16 = 256, corresponding to a one-dimensional row vector, whose dimension is 1 × 256. The row vector of the inner code information block (whose dimension is 1 × 256) is multiplied by the LDPC generator matrix GLDPC (whose dimension is 256 × 512) to obtain an LDPC (512, 256) codeword.

[0050] Reference Figure 2 The embodiment of the present invention provides a decoding method for LDPC concatenated codes, using LDPC codes as inner codes and RM codes as outer codes, the method comprising the following steps:

[0051] S201, inner code decoding, decoding the input soft bits using a predetermined decoding algorithm to obtain a check result, an intermediate soft bit, and a decision information bit;

[0052] S202, detecting and determining whether the verification result is correct or whether the joint iteration has reached the maximum number of times;

[0053] When the check result is correct or the joint iteration reaches the maximum number of times, the decision information bit is sent to the first outer code decoder, and step S203 is performed; otherwise, the intermediate soft bit is sent to the second outer code decoder, and step S204 is performed;

[0054] S203, a first outer code decoder performs outer code decoding on the decision information bits;

[0055] S204, a second outer code decoder performs outer code decoding on the RM code in the intermediate soft bits, and updates the intermediate soft bits;

[0056] S205, weighted soft bit combination, weighted combination of the updated intermediate soft bits and the intermediate soft bits obtained by inner code decoding, and inner code decoding is performed again;

[0057] S206, information data merging, merging the output bits of the first outer code decoder in sequence to complete decoding.

[0058] In a specific embodiment, the first outer code decoder adopts a simple and fast decoding algorithm, including a large number logic decoding algorithm.

[0059] In a specific embodiment, the second outer code decoder adopts a simple fast decoding algorithm, including a large number logic decoding algorithm; or, the second outer code decoder adopts a complex decoding algorithm, including a Viterbi algorithm.

[0060] In a specific embodiment, taking the joint decoding of the inner code LDPC (512, 256) and the outer code RM (16, i) as an example, the specific decoding process is as follows:

[0061] 1) Inner code decoding (LDPC decoder): The input soft bit is the likelihood probability value corresponding to an LDPC (512, 256) codeword, corresponding to a row vector with a dimension of 1×512. The LDPC decoder can use decoding algorithms such as SPA (Sum Product Algorithm) and minimum sum. The output information of the decoder includes the check result, intermediate soft bits, and decision information bits. The check result is a Boolean variable used to indicate whether the LDPC decoding is correct, that is, whether the LDPC codeword satisfies the LDPC check matrix. The intermediate soft bit is a row vector with a dimension of 1×512, which is the updated result after the input soft bit passes through the LDPC decoding algorithm. The decision information bit is a row vector with a dimension of 1×256, corresponding to 256 information bits.

[0062] 2) Determine whether the joint iteration is finished. The finishing condition is that the verification result of LDPC decoding is correct or the joint iteration reaches the maximum number.

[0063] When the end condition of the joint iteration is met, the joint iteration will be stopped, and the decision information bits of the LDPC decoding will be transmitted to the outer code decoder RM Decoder1;

[0064] When the end condition of the joint iteration is not met, the joint iteration will continue, and the intermediate soft information of the LDPC decoding will be transmitted to the outer code decoder RM Decoder2.

[0065] 3) The outer code decoder RM Decoder1 performs RM decoding on the decision information bits, and separates the decision information bits (with a dimension of 1×256) into 16 outer code information blocks, each with a dimension of 1×16. The outer code decoder RM Decoder1 decodes each outer code information block to obtain output information bits with a dimension of 1×i. The outer code decoder RM Decoder1 can use a simple and fast decoding algorithm, such as a large number logic decoding algorithm.

[0066] 4) The outer code decoder 2 performs RM decoding on the intermediate soft bits, the dimension of the intermediate soft bits is 1×512, and the part corresponding to the RM code is extracted to form the outer code soft bits, whose dimension is 1×256. The outer code soft bits are separated into 16 outer code information blocks, and the dimension of each outer code information block is 1×16. The outer code decoder RM Decoder2 decodes each outer code information block to obtain an updated outer code information block. The 16 updated outer code information blocks are combined into an updated outer code soft bit. The updated outer code soft bit updates the corresponding information in the intermediate soft bit to obtain an updated intermediate soft bit. The outer code decoder RM Decoder2 can use a simple and fast decoding algorithm (such as a large number logic decoding algorithm) or a complex decoding algorithm (such as a Viterbi algorithm).

[0067] 5) Soft bit weighted combination: the updated intermediate soft bits of the outer code decoder 2 are weighted combined with the intermediate soft bits of the inner code decoder LDPC decoder, and then transmitted as input to the inner code decoder LDPC decoder. The weighted combination method can be maximum combination, equal gain combination, maximum ratio combination, etc.

[0068] 6) Information data merging: the output bits (dimension 1×i) of the outer code decoder RM Decoder1 are sequentially combined into a bit sequence of dimension 1×(i*16) as the final output bits of the joint decoder.

[0069] Reference Figure 3 The embodiment of the present invention further provides an encoder 300 based on LDPC cascade, setting the LDPC code as the inner code and the RM code as the outer code, performing concatenated coding on the LDPC code and the RM code, and setting the LDPC code to (N L , K L ), where N L is the length of the LDPC code output codeword, K L is the input information bit length; set the RM code to (N R , K R ), where N R is the length of the RM encoding output codeword, K R is the input information bit length; the encoder 300 comprises:

[0070] The information data block unit 31 divides the data to be encoded into blocks according to the length K of the RM code. R Perform block processing, each data block is a one-dimensional row vector with a length of i;

[0071] The RM encoding unit 32 encodes each of the divided data blocks through an RM encoder to generate a data block of length N. R RM codeword; where the row vector of each data block (dimension is 1×KR ) and RM's generator matrix GRM (dimension K R ×N R ) to obtain an RM codeword (N R , K R );

[0072] LDPC encoding unit 33, the RM code word is composed of K L bits, pass through the LDPC encoder, and generate N L LDPC codeword, the row vector of the data block (dimension is 1×K L ) and the LDPC generator matrix GLDPC (whose dimension is K L ×N L ) to obtain an LDPC codeword (N L , K L ).

[0073] In this encoder, the inner code LDPC (2 m , 2 n ) and external code RM(2 j , i) Cascade coding:

[0074] Information data block division: the information data is divided into blocks according to the information bit length i of the RM code, and each outer code information block is a one-dimensional row vector with a length i;

[0075] The outer code encoding combines the row vector of each outer code information block (whose dimension is 1×i) with the generator matrix GRM of RM (whose dimension is i×2 j ) and we get RM(2 j , i) codeword, corresponding to a one-dimensional row vector, dimension is 1×2 j ;

[0076] The internal code will be 2 n / 2 j =2 n-j RM codes form an inner code information block, whose length is 2 j ×2 n-j =2 n , corresponding to a one-dimensional row vector with a dimension of 1×2 n ; The row vector of the inner code information block (dimension is 1×2 n ) and the LDPC generator matrix GLDPC (dimension is 2 n ×2 m ) and get an LDPC(2 m , 2 n ) codeword, where m, n, i, j are positive integers and n>j.

[0077] Reference Figure 4The embodiment of the present invention provides a decoder 400 of LDPC concatenated code, using LDPC code as inner code and RM code as outer code. The decoder includes an inner code decoding unit 41, a check judgment unit 42, a first outer code decoding unit 43, a second outer code decoding unit 44, a soft bit weighted merging unit 45 and an information data merging unit 46:

[0078] The inner code decoding unit 41 decodes the input soft bits using a predetermined decoding algorithm to obtain a check result, an intermediate soft bit, and a decision information bit;

[0079] The verification judgment unit 42 is used to detect whether the verification result is correct or whether the joint iteration reaches the maximum number of times; when the verification result is correct or the joint iteration reaches the maximum number of times, the decision information bit is sent to the first outer code decoding unit 43, and the first outer code decoding unit 43 performs outer code decoding on the decision information bit; otherwise, the intermediate soft bit is sent to the second outer code decoding unit 44, and the second outer code decoding unit 44 performs outer code decoding on the RM code in the intermediate soft bit and updates the intermediate soft bit;

[0080] The soft bit weighted combining unit 45 weights and combines the intermediate soft bits updated by the second outer code decoding unit 44 with the intermediate soft bits output by the inner code decoding unit 41, and performs inner code decoding again;

[0081] The information data combining unit 46 combines the output bits of the first outer code decoding unit 43 in sequence and outputs original data bits.

[0082] Compared with the solutions in the prior art, the present invention has the following advantages:

[0083] To reduce the error platform, the long code (LDPC code) and the short code (RM code) are cascaded. The error bits that are not completely corrected by the inner code LDPC code may be corrected by the outer code RM code; and the cascaded joint iterative decoding can correct more error bits. Therefore, this cascade code can achieve a lower error platform;

[0084] Supports multiple code rates. When the code length and code rate of the long code (LDPC code) are fixed, flexible multiple code rates can be supported by using RM codes with different code rates.

[0085] The implementation complexity is low, and the hardware complexity is mainly concentrated in the LDPC code. The encoding and decoding of the RM code is relatively simple. Therefore, with a small increase in complexity, the above-mentioned effects of reducing the error platform and supporting multiple code rates can be achieved.

[0086] It will be appreciated by those skilled in the art that the various exemplary method steps and device units described herein in conjunction with the disclosed embodiments can all be implemented in electronic hardware, software, or a combination of the two. In order to clearly illustrate the interchangeability between hardware and software, the various exemplary steps and units are generally described in the form of their functionality. Whether this functionality is implemented in hardware or software depends on the design constraints implemented by the specific application and the entire system. Those skilled in the art can implement the described functionality in a variety of ways for each specific application, but the results of this implementation should not be interpreted as departing from the scope of the present invention.

[0087] The steps of the method described in conjunction with the above disclosed embodiments may be directly embodied as hardware, a software module executed by a processor, or a combination of the two. The software module may exist in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A typical storage medium is coupled to a processor so that the processor can read information from the storage medium and write information to the storage medium. In an alternative embodiment, the storage medium is an integral part of the processor. The processor and the storage medium may exist in an ASIC. The ASIC may exist in a user station. In an alternative embodiment, the processor and the storage medium may exist as discrete components in a user station.

[0088] According to the disclosed embodiments, it is possible for those skilled in the art to implement or use the present invention. It is obvious to those skilled in the art that various modifications of these embodiments are possible, and the general principles defined herein can also be applied to other embodiments without departing from the scope and gist of the present invention. The embodiments described above are only preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A coding method based on LDPC concatenation, setting LDPC code as inner code, RM code as outer code, concatenating LDPC code and RM code, and setting LDPC code to (N L , K L ), where N L is the length of the LDPC code output codeword, K L is the input information bit length; set the RM code to (N R , K R ), where N R is the length of the RM encoding output codeword, K R is the input information bit length; the encoding method includes: The information data is divided into blocks, and the data to be encoded is divided into blocks according to the length K of the RM code. R Block processing is performed, and each data block is a one-dimensional row vector of length i; RM encoding, each block after block processing is encoded by the RM encoder to generate a length N R RM codeword; where the row vector dimension of each data block is 1×K R and the generator matrix G of RM RM The dimension is K R ×N R Multiply them together to get an RM codeword (N R , K R );LDPC encoding, the RM codeword is composed of K L bits, pass through the LDPC encoder, and generate N L LDPC codeword, the row vector dimension of the data block is 1×K L And the LDPC generator matrix G LDPC Its dimension is K L ×N L Multiply them together to get an LDPC codeword (N L , K L ), where N L =2 m , K L =2 n , N R =2 j , K R =i, then the inner code LDPC(2 m , 2 n ) and external code RM(2 j , the cascade coding process of i) is as follows: 1) Information data block: The information data is divided into blocks according to the information bit length i of the RM code, and each outer code information block is a one-dimensional row vector with a length of i; 2) External code encoding: The row vector of each external code information block has a dimension of 1×i and the generator matrix G of RM RM The dimension is i×2 j Multiply them together and get a RM(2 j , i) codeword, corresponding to a one-dimensional row vector, dimension is 1×2 j ; 3) Internal code encoding: 2 n / 2 j =2 n-j RM codes form an inner code information block, whose length is 2 j ×2 n-j =2 n , corresponding to a one-dimensional row vector with a dimension of 1×2 n ; Set the row vector dimension of the inner code information block to 1×2 n And the LDPC generator matrix G LDPC Dimension is 2 n ×2 m Multiply them together to get an LDPC(2 m , 2 n ) codeword, where m, n, i, j are positive integers, n>j, K R Belongs to an array set {k R }, selected according to the importance of the information bit.

2. A decoding method for LDPC concatenated codes, using LDPC codes as inner codes and RM codes as outer codes, the method comprising: Inner code decoding: The input soft bit is the likelihood probability value corresponding to an LDPC (512, 256) codeword, corresponding to a row vector with a dimension of 1×512; The LDPC decoder uses a sum-product algorithm or a minimum sum algorithm; the output information of the decoder includes the check result, the intermediate soft bit and the decision information bit; the check result is a Boolean variable used to indicate whether the LDPC decoding is correct, that is, whether the LDPC codeword satisfies the LDPC check matrix; the intermediate soft bit is a row vector with a dimension of 1×512, which is the updated result after the input soft bit passes through the LDPC decoding algorithm; the decision information bit is a row vector with a dimension of 1×256, corresponding to 256 information bits; The method is characterized in that it is judged whether the joint iteration is ended, and the end condition is that the verification result of the LDPC decoding is correct or the joint iteration reaches the maximum number of times; when the end condition of the joint iteration is met, the joint iteration is stopped, and the decision information bit of the LDPC decoding is transmitted to the outer code decoder RM Decoder1; when the end condition of the joint iteration is not met, the joint iteration is continued, and the intermediate soft information of the LDPC decoding is transmitted to the outer code decoder RM Decoder2; the outer code decoder RMDecoder1 performs RM decoding on the decision information bit, and separates the decision information bit, with a dimension of 1×256, into 16 outer code information blocks, and each outer code information block has a dimension of 1×16; the outer code decoder RM Decoder1 decodes each outer code information block to obtain an output information bit, with a dimension of 1×i; the outer code decoder RM Decoder1 adopts a simple fast decoding algorithm; outer code decoder 2 performs RM decoding on the intermediate soft bits, the dimension of the intermediate soft bits is 1×512, and the part corresponding to the RM code is extracted to form the outer code soft bits, whose dimension is 1×256; the outer code soft bits are divided into 16 outer code information blocks, and the dimension of each outer code information block is 1×16; the outer code decoder RM Decoder2 decodes each outer code information block to obtain an updated outer code information block; the 16 updated outer code information blocks are combined into an updated outer code soft bit; the updated outer code soft bit updates the corresponding information in the intermediate soft bit to obtain an updated intermediate soft bit; the outer code decoder RM Decoder2 adopts a fast decoding algorithm; the soft bits are weighted and combined, and the updated intermediate soft bits of the outer code decoder 2 are weighted and combined with the intermediate soft bits of the inner code decoder LDPC decoder, and then transmitted as input to the inner code decoder LDPC decoder; The weighted combining method is one of maximum combining, equal gain combining, and maximum ratio combining; the information data is combined, and the output bits of the outer code decoder RM Decoder1, with a dimension of 1×i, are sequentially combined into a bit sequence with a dimension of 1×(i*16) as the final output bits of the joint decoder.