Bit interleaving chirp spread spectrum modulation method, device and equipment based on LDPC (Low Density Parity Check) code

Abstract

The invention provides a bit interleaving chirp spread spectrum modulation method, device and equipment based on an LDPC (Low Density Parity Check) code, and relates to the technical field of Internet communication, and the method comprises the steps: coding original information through the LDPC code, and obtaining an initial code word; the LDPC code comprises a generation matrix and a check matrix; performing diagonal matrix interleaving and CSS modulation on the initial code word in sequence to generate intermediate information; and inputting the intermediate information to a preset channel, sequentially performing demodulation and de-interleaving, and performing LDPC decoding to obtain target information. According to the invention, the LDPC code is utilized to increase the check bit for error correction, so that the limitation that the communication service quality of the LoRa physical layer is sharply reduced in a complex and dynamic channel environment is made up, the reliability of information transmission is enhanced, and high-throughput and high-reliability network transmission is formed.

Description

Technical Field

[0001] The present invention relates to the field of Internet communication technology, and in particular to a bit interleaved chirp spread spectrum modulation method, device and equipment based on LDPC code. Background Art

[0002] LoRa (Long Range) is a physical layer modulation and demodulation technology. LoRaWAN (LoRa Wide Area Network) is a low-power wide area network standard based on an open source MAC layer protocol proposed by the LoRa Alliance. The main goal is to build a large-capacity, long-distance and low-power star network to meet the application requirements of IoT (Internet of Things). Research on LoRa has made some progress, but it is still in its infancy. At present, the development direction of LoRa research mainly includes: improvement of the LoRa physical layer, optimization of communication rate and communication service quality, and combination of LoRa technology with other fields. Due to the characteristics of LoRa's own low power consumption, wide coverage, strong penetration, and a large number of connections, LoRa has good application prospects in agriculture, forestry, animal husbandry and other fields. LoRa sacrifices communication rate in exchange for low power consumption and transmission distance. Although some scholars have improved LoRa technology, the increase in communication rate is limited, and the cost is high complexity and increased power consumption. In addition, because the Hamming code encoding method used by LoRa can only correct up to 1 bit error per codeword, its communication service quality deteriorates sharply in complex and dynamic channel environments. Therefore, a coding with excellent short code performance and low complexity is needed to compensate for the loss of channel coding performance in the existing LoRa physical layer. Summary of the invention

[0003] The purpose of the present invention is to solve the problem of channel coding performance loss in the existing LoRa physical layer, and provide a bit-interleaved chirp spread spectrum modulation method, device and equipment based on LDPC code.

[0004] The technical solution of the embodiment of the present application is implemented as follows:

[0005] A first aspect of an embodiment of the present application provides a bit interleaved chirp spread spectrum modulation method based on LDPC code, comprising:

[0006] Encoding the original information using an LDPC code to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix;

[0007] Performing diagonal matrix interleaving and CSS modulation on the initial codeword in sequence to generate intermediate information;

[0008] The intermediate information is input into the preset channel and then demodulated and deinterleaved in sequence and then LDPC decoding is performed to obtain the target information.

[0009] Optionally, encoding the original information using an LDPC code to obtain an initial codeword includes:

[0010] The original information is combined with the generator matrix to generate an initial codeword; the initial codeword u 1×n satisfy:

[0011] u 1×n =s 1×k ·G k×n ;

[0012] Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n Optionally, the check matrix H and the sequence u of the initial codeword satisfy the following relationship:

[0013] H.u T =0

[0014] Wherein, u represents the sequence of initial codewords, 1 row and n columns.

[0015] Optionally, the check matrix H is constructed using a progressive edge growth algorithm or a Mackey construction method.

[0016] Optionally, the step of inputting the intermediate information into a preset channel and then performing LDPC decoding after demodulation and deinterleaving to obtain target information includes:

[0017] The information obtained by demodulation and deinterleaving is subjected to LDPC decoding by using a layered belief propagation algorithm to obtain the target information.

[0018] The second aspect of the embodiment of the present application provides a bit interleaved chirp spread spectrum modulation device based on LDPC code, including: an encoding module, a generation module and a decoding module, wherein:

[0019] The encoding module is configured to encode the original information using an LDPC code to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix;

[0020] The generating module is configured to sequentially perform diagonal matrix interleaving and CSS modulation on the initial codeword to generate intermediate information;

[0021] The decoding module is configured to input the intermediate information into a preset channel, and then perform LDPC decoding after demodulation and deinterleaving in sequence to obtain target information.

[0022] Optionally, the encoding module is specifically configured as follows:

[0023] The original information is combined with the generator matrix to generate an initial codeword; the initial codeword u 1×n satisfy:

[0024] u 1×n =s 1×k ·G k×n ;

[0025] Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n Optionally, the check matrix H and the sequence u of the initial codeword satisfy the following relationship:

[0026] H.u T =0

[0027] Wherein, u represents the sequence of initial codewords, 1 row and n columns.

[0028] A third aspect of an embodiment of the present application provides an electronic device, comprising a processor and a memory; the memory stores a computer program, wherein the computer program, when executed by the processor, implements the bit-interleaved chirp spread spectrum modulation method based on LDPC code described in the first aspect.

[0029] A fourth aspect of an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method described in the first aspect.

[0030] Compared with the prior art, the technical solution provided by this application has the following beneficial effects:

[0031] The present invention provides a bit interleaved chirp spread spectrum modulation method based on LDPC code, which uses LDPC code to encode original information to obtain initial codewords, performs diagonal matrix interleaving and CSS modulation on the initial codewords in sequence, generates intermediate information, inputs the intermediate information into a preset channel, and then performs LDPC decoding after demodulation and deinterleaving in sequence to obtain target information. By using LDPC code to increase the check bit for error correction, the limitation of the LoRa physical layer that the communication service quality drops sharply in a complex and dynamic channel environment is compensated, the reliability of information transmission is enhanced, and a high-throughput and high-reliability network transmission is formed. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 A schematic diagram of a flow chart of a bit-interleaved chirp spread spectrum modulation method based on LDPC code provided in an embodiment of the present application;

[0033] Figure 2 A schematic diagram of the structure of a bit-interleaved chirp spread spectrum modulation device based on LDPC code provided in an embodiment of the present application;

[0034] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0035] Below, embodiments of the present application will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present application. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present application. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present application.

[0036] The terms used herein are only for describing specific embodiments and are not intended to limit the present application. The terms "include", "comprising", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0037] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0038] Some block diagrams and / or flow charts are shown in the accompanying drawings. It should be understood that some blocks or combinations thereof in the block diagrams and / or flow charts may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that these instructions, when executed by the processor, may create a device for implementing the functions / operations described in these block diagrams and / or flow charts.

[0039] In some embodiments, see Figure 1 , Figure 1 A schematic flow chart of a bit-interleaved chirp spread spectrum modulation method based on LDPC code provided in an embodiment of the present application; a bit-interleaved chirp spread spectrum modulation method based on LDPC code provided in an embodiment of the present application includes:

[0040] S110, using LDPC code to encode the original information to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix.

[0041] In this embodiment, at the input end, the original information is encoded using an LDPC code to obtain an initial codeword, the initial codeword is interleaved diagonally to obtain a matrix symbol, the matrix symbol is CSS modulated to obtain a radio frequency signal, and the radio frequency signal is input into the channel. At the receiving end, the radio frequency signal is CSS demodulated to obtain a matrix symbol, which is then deinterleaved to obtain a codeword sequence, and the codeword sequence is LDPC decoded to obtain the target information.

[0042] In some embodiments, S110, encoding the original information using an LDPC code to obtain an initial codeword includes:

[0043] The original information is combined with the generator matrix to generate an initial codeword; the initial codeword u 1×n satisfy:

[0044] u 1×n =s 1×k ·G k×n ;

[0045] Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n Contains n bits.

[0046] Here, in the process of channel coding, it can be assumed that the original information s 1×k , i.e. k bits. The original information is encoded to obtain the initial codeword u 1×n , that is, n bits, nk is the number of check bits. The direct mapping relationship between the initial codeword and the original information is the generator matrix G k×n .

[0047] In some embodiments, the check matrix H and the sequence u of the initial codeword satisfy the following relationship:

[0048] H.u T =0

[0049] Wherein, u represents the sequence of initial codewords, 1 row and n columns.

[0050] The check matrix H is sparse, with 1 occupying only a small part and most elements being 0. Each row of the check matrix H multiplied by the transpose of u is 0. Because the check matrix H is a binary matrix, the bits in u corresponding to the 1 position in each row of the check matrix H can form a check equation, that is, there is a certain relationship between these initial codeword bits. Assuming that each row of the check matrix H has ρ elements 1, ρ is the row weight, and each column has λ elements 1, λ is the column weight, then there are a total of ρ corresponding bits in the check equation for this row, and a total of λ bits corresponding to the column in the check equation. As shown in the following table, the check matrix H is on the left and the corresponding check equation is on the right. The check matrix H has four rows, so there are 4 check equations. Assume x i (i=1,2,L,8) is the bit of code word u, then the check equation on the right can be obtained.

[0051]

[0052] In some embodiments, the check matrix H is constructed using a progressive edge growth algorithm or a Mackey construction method.

[0053] The Progressive Edge Growth (PEG) algorithm constructs the desired Tanner graph by adding edges to each variable node in turn to connect the check nodes. Each time an edge is added, the girth of the current variable node is made as large as possible. The main process of the PEG algorithm includes: initializing the number of check nodes and variable nodes, the degree of each node (the number of connected edges); for each variable node, connecting the corresponding number of check nodes according to the degree of the current variable node. When connecting the first check node, directly select the check node with the smallest degree to connect; when connecting the remaining nodes, expand the tree graph with the current node as the root and connect to the check node with the lowest degree in the current layer. One principle when connecting is to make the girth of the constructed Tanner graph the largest.

[0054] The Mackey construction method is a random construction method. Its principle is: construct a matrix with M rows and N columns, and the column weight of each column is t, that is, each column has t 1s. The 1s in each row should be as uniform as possible, and the number of 1s in the same position in any two columns should not exceed 1, which eliminates short cycles with a girth of 4.

[0055] S120, performing diagonal matrix interleaving and CSS modulation on the initial codeword in sequence to generate intermediate information.

[0056] In this embodiment, data writing, rearrangement and data reading are involved, which may specifically include writing the initial codeword into the interleaver in a certain order (such as rows). The data is rearranged by an algorithm (simulating the effect of a diagonal matrix). The data is read out from the interleaver in a new order (such as columns) to generate interleaved codewords. The interleaved codewords are mapped to CSS modulated symbols. Each symbol represents a certain number of bits. According to the mapped symbols, the frequency characteristics of the signal are adjusted to generate intermediate information. Diagonal matrix interleaving disperses errors by rearranging data, thereby improving the reliability of communication. CSS modulation transmits information by changing the frequency characteristics of the signal, expanding the spectrum of the signal, and improving the anti-interference ability and transmission distance of the communication. Combining these two technologies can generate intermediate information with better performance and reliability to provide support for subsequent communication processes.

[0057] S130, input the intermediate information into the preset channel, demodulate and deinterleave it in sequence, and then perform LDPC decoding to obtain the target information.

[0058] In this embodiment, the demodulator detects the rising or falling pattern of the signal frequency according to the rules of CSS modulation and maps it back to the original symbol or bit. The demodulated data is input into the deinterleaver, which rearranges the data back to its original order according to the algorithm corresponding to the transmitter interleaver. In this way, consecutive errors are dispersed, allowing the LDPC decoder to correct errors more effectively.

[0059] In some embodiments, S130, the intermediate information is input into the preset channel and then demodulated and deinterleaved in sequence and then LDPC decoding is performed to obtain the target information, including:

[0060] The information obtained by demodulation and deinterleaving is decoded by LDPC using a layered belief propagation algorithm to obtain the target information.

[0061] Layered Belief Propagation Algorithm (LPPA), also known as LayeredBP or Horizontal BP, is an efficient iterative decoding method that sequentially updates the information of variable nodes and check nodes on each layer (i.e., each row or each column), thereby reducing the amount of information that needs to be updated in each iteration and improving the decoding speed.

[0062] In one example, LDPC decoding includes the following steps:

[0063] Step 1. Initialization, calculate the initial acceptance information L(P j ). In the Gaussian channel, the noise n is an independent and identically distributed Gaussian random variable, and its probability density function is N0 is equal to the ratio of noise power to bandwidth. because:

[0064]

[0065] Where i represents the check node, j represents the variable node, y represents the codeword sequence received by the receiver, with a mean of 1 and a variance of σ 2 . c represents the decoded sequence obtained by decoding, When representing the lth layer, after node j obtains the information of other check nodes except i and the external information of the channel, the codeword corresponding to bit c at the sending end j =b, b = 0, 1. Then in the logarithmic domain, the initial reception of the logarithmic domain message is:

[0066]

[0067] Initialize the logarithmic domain information L of the check node ( 0) (r ji )=0, initialize the logarithmic domain information L( 0) (q ij )=L (0) (P j ), initialize the number of iterations n = 0, and set the maximum number of iterations MaxIter.

[0068] Step 2. Determine whether n is less than MaxIter. If so, jump to step 5. If not, enter the iteration loop, and update the logarithmic domain information transmitted from the variable node to the check node:

[0069] L (l) (q ij )=L (l-1) (q i )-L (l-1) (r ij );

[0070] Step 3. Calculate the logarithmic domain information that all check nodes pass to the connected variable nodes. Since:

[0071]

[0072] in When representing the lth layer, given the information bit c j = The probability that the check equation i satisfies the condition that b and other information bits have independent probability distributions. V(i)\j represents the set of variable nodes connected to i except j. Then the logarithmic domain information transmitted by the check node to the variable node is updated as:

[0073]

[0074] The minimum sum algorithm improves this formula. The derivation process is shown below. The improved formula is as follows:

[0075]

[0076] Step 4. Update all hard decision logarithmic domain information:

[0077] L (l) (q i )=L (l) (q ij )+L (l) (r ji );

[0078] If L (l) (q i )>0, then c j If yes, it is translated to 0, otherwise it is translated to 1, and one iteration ends.

[0079] Step 5. After one iteration, determine whether H·u is satisfied T =0, if the condition is met, go to step 6; if not met and the maximum number of iterations, n+1, has not been reached, go to 2.

[0080] Step 6. Interception The first k elements (the number of information bits before k encoding) are decoded.

[0081] The minimum sum algorithm optimizes the formula in step 3, reducing the more complex hyperbolic sine operation and multiplication operation to a simpler minimum value and sign operation, thereby further reducing the computational complexity of decoding. The brief process is as follows:

[0082] Since tanh(x) is an odd function, we can write tanh(x)=sgn(x)·tanh(|x|). Then we have:

[0083]

[0084] And because:

[0085]

[0086] Therefore, the original formula can be simplified to:

[0087]

[0088] This embodiment uses LDPC code to encode the original information to obtain the initial codeword, and performs diagonal matrix interleaving and CSS modulation on the initial codeword in sequence to generate intermediate information, and then inputs the intermediate information into the preset channel and performs LDPC decoding after demodulation and deinterleaving in sequence to obtain the target information. By using LDPC code to increase the check bit for error correction, the limitation of the LoRa physical layer that the communication service quality drops sharply in a complex and dynamic channel environment is compensated, the reliability of information transmission is enhanced, and a high-throughput and high-reliability network transmission is formed.

[0089] In some embodiments, see Figure 2 , Figure 2 A schematic diagram of the structure of a bit-interleaved chirp spread spectrum modulation device based on LDPC code provided in an embodiment of the present application; a bit-interleaved chirp spread spectrum modulation device 200 based on LDPC code provided in an embodiment of the present application comprises: a coding module 210, a generating module 220 and a decoding module 230, wherein:

[0090] The encoding module 210 is configured to encode the original information using an LDPC code to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix;

[0091] A generating module 220 is configured to sequentially perform diagonal matrix interleaving and CSS modulation on the initial codeword to generate intermediate information;

[0092] The decoding module 230 is configured to input the intermediate information into a preset channel, and then perform LDPC decoding after demodulation and deinterleaving in sequence to obtain target information.

[0093] In some embodiments, the encoding module 210 is specifically configured as follows:

[0094] Combine the original information with the generator matrix to generate the initial codeword; the initial codeword u 1×n satisfy:

[0095] u 1×n =s 1×k ·G k×n ;

[0096] Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n In some embodiments, the check matrix H and the sequence u of the initial codeword satisfy the following relationship:

[0097] H.u T =0

[0098] Wherein, u represents the sequence of initial codewords, 1 row and n columns.

[0099] In some embodiments, the encoding module 210 is further configured to construct the check matrix H using a progressive edge growth algorithm or a Mackey construction method.

[0100] In some embodiments, the decoding module 230 is specifically configured as follows:

[0101] The information obtained by demodulation and deinterleaving is decoded by LDPC using a layered belief propagation algorithm to obtain the target information.

[0102] The LDPC code-based bit-interleaved chirp spread spectrum modulation device provided in the embodiment of the present application is based on the above-mentioned LDPC code-based bit-interleaved chirp spread spectrum modulation method, and will not be described again here to avoid repetition.

[0103] It should be noted that the bit-interleaved chirp spread spectrum modulation device based on LDPC code provided in the embodiment of the present application and the bit-interleaved chirp spread spectrum modulation method based on LDPC code provided in the embodiment of the present application are based on the same application concept. Therefore, the specific implementation of this embodiment can refer to the implementation of the aforementioned bit-interleaved chirp spread spectrum modulation method based on LDPC code, and the repeated parts will not be repeated.

[0104] In some embodiments, see Figure 3 , Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. An electronic device 300 provided in an embodiment of the present application includes a processor 310 and a memory 320; the memory 320 stores a computer program, wherein the computer program implements the above-mentioned bit-interleaved chirp spread spectrum modulation method based on LDPC code when executed by the processor.

[0105] Specifically, the processor 310 may include, for example, a general-purpose microprocessor, an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 310 may also include an onboard memory for cache purposes. The processor 310 may be a single processing unit or multiple processing units for executing different actions of the method flow according to the embodiment of the present application.

[0106] The memory 320 may be any medium capable of containing, storing, conveying, propagating or transmitting instructions. For example, the memory 320 may include, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared or semiconductor system, device, component or propagation medium. Specific examples of the memory 320 include: a magnetic storage device, such as a magnetic tape or a hard disk (HDD); an optical storage device, such as a compact disk (CD-ROM); a random access memory (RAM) or flash memory; and / or a wired / wireless communication link.

[0107] The present application also provides a computer-readable medium on which a computer program is stored, and when the program is executed by a processor, the above-mentioned bit-interleaved chirp spread spectrum modulation method based on LDPC code is implemented. The computer-readable medium may be included in the device / system described in the above embodiment; or it may exist independently without being assembled into the device / system. The above-mentioned computer-readable medium carries one or more programs, and when the above-mentioned one or more programs are executed, the method according to the embodiment of the present application is implemented.

[0108] According to an embodiment of the present application, a computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. A computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a computer-readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, optical cable, radio frequency signal, etc., or any suitable combination of the above.

[0109] Those skilled in the art will appreciate that the features described in the various embodiments and / or claims of the present application may be combined in a variety of ways and / or combinations, even if such combinations or combinations are not explicitly described in the present application. In particular, without departing from the spirit and teachings of the present application, the features described in the various embodiments and / or claims of the present application may be combined in a variety of ways and / or combinations. All of these combinations and / or combinations fall within the scope of the present application. Therefore, the scope of the present application should not be limited to the above-described embodiments, but should be determined not only by the appended claims, but also by the equivalents of the appended claims.

Claims

1. A bit interleaved chirp spread spectrum modulation method based on LDPC code, characterized in that: include: Encoding the original information using an LDPC code to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix; Performing diagonal matrix interleaving and CSS modulation on the initial codeword in sequence to generate intermediate information; The intermediate information is input into the preset channel and then demodulated and deinterleaved in sequence and then LDPC decoding is performed to obtain the target information.

2. The bit-interleaved chirp spread spectrum modulation method based on LDPC code according to claim 1, characterized in that: The method of encoding the original information by using the LDPC code to obtain the initial codeword includes: The original information is combined with the generator matrix to generate an initial codeword; the initial codeword u 1×n satisfy: u 1×n =s 1×k ·G k×n ; Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n Contains n bits.

3. The bit-interleaved chirp spread spectrum modulation method based on LDPC code according to claim 2, characterized in that: The check matrix H and the sequence u of the initial codeword satisfy the following relationship: H·u T =0 Wherein, u represents the sequence of initial codewords, 1 row and n columns.

4. The bit-interleaved chirp spread spectrum modulation method based on LDPC code according to claim 3, characterized in that: include: The check matrix H is constructed using a progressive edge growth algorithm or a Mackey construction method.

5. The bit-interleaved chirp spread spectrum modulation method based on LDPC code according to claim 1, characterized in that: The step of inputting the intermediate information into a preset channel, demodulating and deinterleaving the intermediate information, and then performing LDPC decoding to obtain target information includes: The information obtained by demodulation and deinterleaving is subjected to LDPC decoding by using a layered belief propagation algorithm to obtain the target information.

6. A bit-interleaved chirp spread spectrum modulation device based on LDPC code, characterized in that: include: Encoding module, generating module and decoding module, wherein, The encoding module is configured to encode the original information using an LDPC code to obtain an initial codeword; the LDPC code includes a generator matrix and a check matrix; The generating module is configured to sequentially perform diagonal matrix interleaving and CSS modulation on the initial codeword to generate intermediate information; The decoding module is configured to input the intermediate information into a preset channel, and then perform LDPC decoding after demodulation and deinterleaving in sequence to obtain target information.

7. The bit-interleaved chirp spread spectrum modulation device based on LDPC code according to claim 6, characterized in that: The encoding module is specifically configured as follows: The original information is combined with the generator matrix to generate an initial codeword; the initial codeword u 1×n satisfy: u 1×n =s 1×k ·G k×n ; Among them, s 1×k is the original information, containing k bits, G k×n is the generator matrix, the initial codeword u 1×n Contains n bits.

8. The bit-interleaved chirp spread spectrum modulation device based on LDPC code according to claim 7, characterized in that: The check matrix H and the sequence u of the initial codeword satisfy the following relationship: H·u T =0 Wherein, u represents the sequence of initial codewords, 1 row and n columns.

9. An electronic device comprising a processor and a memory; the memory stores a computer program, wherein: When the computer program is executed by the processor, the computer program implements the bit-interleaved chirp spread spectrum modulation method based on LDPC code according to any one of claims 1 to 5.

10. A computer-readable storage medium having a computer program stored thereon, wherein when the program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.

Images