Source channel joint decoding method and device, electronic equipment and storage medium

Abstract

The application relates to the technical field of decoding, and provides a source channel joint decoding method and device, electronic equipment and a storage medium, the method comprising the following steps: acquiring initialization information of a channel encoder and prior probability information of a variable node of a source decoder; determining check node information of the source decoder based on the initialization information and the prior probability information; and performing the following iterative steps, which comprise the following steps: updating soft information of the variable node of the source decoder based on the check node information and the initialization information; and performing decoding decision based on the updated soft information to determine a decoding result. The method determines the check node information of the source decoder based on the initialization information and the prior probability information, iteratively updates the soft information of the variable node of the source decoder based on the check node information and the initialization information, that is, uses the information of the source as the soft information available in the decoding process, improves the coding gain, and thus improves the accuracy of the source channel joint decoding.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of decoding, in particular to a joint source-channel decoding method and device, electronic equipment and storage medium. BACKGROUND

[0002] With the rapid development of satellite communication technology, the spectrum resource is increasingly strained, and the traditional fixed allocation mode of licensed spectrum has been difficult to meet the diversified communication needs. The sharing access technology of unlicensed spectrum has gradually become a research hotspot in the field of wireless communication due to its flexibility and low cost characteristics. However, in the satellite communication scenario, the utilization of unlicensed spectrum still faces significant challenges, and the communication channel is often interfered by various noises, which puts unprecedentedly stringent requirements on the reliability and efficiency of data transmission. Compared with the source-channel separation cascade coding system, joint source-channel coding (JSCC) can utilize the remaining redundancy after source compression to assist channel decoding, improve the overall system error correction performance, and require shorter code length, so it is more suitable for resource-limited and delay-sensitive scenarios. Low-density parity-check (LDPC) has long been in an important position in various communication standards due to its excellent error correction performance. Although the traditional decoding algorithm based on LDPC code, such as the classic minimum sum algorithm, has good performance, its decoding performance still has room for improvement when facing actual complex channels and different source characteristics, because the existing double LDPC decoding method based on JSCC does not pay attention to the characteristics of the source itself. SUMMARY

[0003] The present application provides a joint source-channel decoding method, device, electronic equipment and storage medium to solve the problem of low accuracy in the decoding process of double LDPC code based on JSCC due to random noise interference in complex communication environment.

[0004] The present application provides a joint source-channel decoding method, comprising the following steps:

[0005] Obtain the initialization information of the channel encoder and the prior probability information of the variable node of the source decoder;

[0006] Determine the check node information of the source decoder based on the initialization information and the prior probability information;

[0007] Perform the following iteration steps, which include:

[0008] Update the soft information of the variable node of the source decoder based on the check node information and the initialization information;

[0009] Based on the updated soft information, a decoding decision is made to determine the decoding result;

[0010] If the decoding result meets the verification condition, the decoding result is output; otherwise, the iteration continues until the preset maximum number of iterations is reached or the decoding result meets the verification condition.

[0011] According to the decoding method for joint source and channel provided by the present invention, determining the check node information of the source decoder based on the initialization information and the prior probability information includes:

[0012] The check node information of the source decoder is determined based on the following formula:

[0013] ;

[0014] in, This indicates the check node information of the source decoder. This represents the prior probability information of the variable nodes in the source decoder. This indicates initialization information. Indicates the verification node All neighbor variable nodes The current variable node is not included. Information Summation, Indicates the verification node The set of all neighboring variable nodes, excluding the current variable node. , Indicates the first In the next iteration, the verification node of the source decoder To variable node The message sent.

[0015] According to a source-channel joint decoding method provided by the present invention, updating the soft information of the variable nodes of the source decoder based on the check node information and the initialization information includes:

[0016] The soft information of the variable nodes of the source decoder is updated based on the following formula:

[0017] ;

[0018] in, This represents the soft information of the variable nodes in the source decoder. This indicates initialization information. Indicates the verification node All neighbor variable nodes Information Summation, all the neighboring variable nodes of the check node , denotes the information sent by the check node of the source decoder to the variable node in the i-th iteration,

[0019] According to the source channel joint decoding method provided by the application, the method further comprises:

[0020] In the iteration step, the check node of the channel decoder is checked by using the minimum sum algorithm, and the updated check node information is sent to the variable node of the channel decoder.

[0021] According to the source channel joint decoding method provided by the application, the check node of the channel decoder is checked by using the minimum sum algorithm, and the updated check node information is sent to the variable node of the channel decoder, comprising:

[0022] The updated check node information is sent to the variable node of the channel decoder based on the following formula:

[0023] ;

[0024] ;

[0025] wherein, denotes the information sent by the check node of the source decoder to the variable node in the i-th iteration in the joint source channel decoding process, i.e. the updated check node information, denotes the information sent by the variable node of the source decoder to its neighboring check node in the i-th iteration, denotes all the neighboring variable nodes of the check node , denotes the information sent by the variable node of the channel decoder to its neighboring check node in the i-th iteration, denotes all the neighboring variable nodes of the check node , denotes the information sent by the variable node of the channel decoder to its neighboring check node in the i-th iteration, denotes the message passing value from the variable node of the source decoder to the check node of the channel decoder in the i-th iteration, denotes the message passing value from the variable node of the channel decoder to the check node of the source decoder in the i-th iteration, denotes the message passing value from the variable node of the source decoder to the check node of the channel decoder in the i-th iteration, denotes the message passing value from the variable node of the channel decoder to the check node of the source decoder in the i-th iteration, denotes the message passing value from the variable node of the source decoder to the check node of the channel decoder in the i-th iteration, denotes the message passing value from the variable node of the channel decoder to the check node of the source decoder in the i-th iteration, denotes the message passing value from the variable node of the source decoder to the check node of the channel decoder in the i-th iteration, ​​Information passed to the source decoder.

[0026] According to the source channel joint decoding method provided by the application, the updated soft information is used to make a decoding decision to determine a decoding result, which comprises the following steps:

[0027] If the updated soft information is greater than a preset threshold, the decoding result is determined as 1.

[0028] If the updated soft information is less than the preset threshold, the decoding result is determined as 0.

[0029] The application further provides a source channel joint decoding device, which comprises the following units:

[0030] An acquisition unit is configured to acquire initialization information of a channel encoder and a prior probability of a variable node of a source decoder;

[0031] A determination unit is configured to determine check node information of the source decoder based on the initialization information and the prior probability;

[0032] An iteration unit is configured to perform the following iteration steps, which comprise the following steps:

[0033] The soft information of the variable node of the source decoder is updated based on the check node information and the initialization information;

[0034] The updated soft information is used to make a decoding decision to determine a decoding result;

[0035] If the decoding result satisfies a check condition, the decoding result is output; otherwise, the iteration is continued until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0036] The application further provides an electronic device, which comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the source channel joint decoding method according to any one of the above-mentioned methods when executing the program.

[0037] The application further provides a non-transitory computer readable storage medium, which stores a computer program, and the computer program is executable on a processor to implement the source channel joint decoding method according to any one of the above-mentioned methods.

[0038] The application further provides a computer program product, which comprises a computer program, and the computer program is executable on a processor to implement the source channel joint decoding method according to any one of the above-mentioned methods.

[0039] The application provides a source channel joint decoding method and device, electronic equipment and a storage medium. BRIEF DESCRIPTION OF DRAWINGS

[0040] In order to more clearly illustrate the technical solutions in the application or the prior art, the drawings needed in the embodiments or the prior art description will be briefly introduced as follows. Obviously, the drawings in the following description are some embodiments of the application, and other drawings can be obtained by those skilled in the art without creative effort on the basis of these drawings.

[0041] Figure 1 Fig. 1 is a flowchart of a source channel joint decoding method provided by the application.

[0042] Figure 2 Fig. 2 is a schematic diagram of a communication system modeling provided by the application.

[0043] Figure 3 Fig. 3 is another flowchart of a source channel joint decoding method provided by the application.

[0044] Figure 4 Fig. 4 is a third flowchart of a source channel joint decoding method provided by the application.

[0045] Figure 5 Fig. 5 is a structural schematic diagram of a source channel joint decoding device provided by the application.

[0046] Figure 6 Fig. 6 is a structural schematic diagram of an electronic equipment provided by the application. DETAILED DESCRIPTION

[0047] In order to make the objects, technical solutions and advantages of the present application clearer, the technical solutions will be described clearly and completely below in conjunction with the drawings in the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work fall within the protection scope of the present application.

[0048] Figure 1 is one of flowcharts of the source channel joint decoding method provided by the present application, Figure 2 is a schematic diagram of the communication system modeling provided by the present application, Figure 3 is another flowchart of the source channel joint decoding method provided by the present application, Figure 4 is a flowchart of the source channel joint decoding method provided by the present application, as shown in Figure 1 , Figure 2 , Figure 3 and Figure 4 , the method comprises steps 110, 120 and 130, Figure 3 and Figure 4 respectively show the source low density parity check code (Source LDPC) and the channel low density parity check code (Channel LDPC).

[0049] Step 110, obtaining initialization information of a channel encoder and prior probability information of variable nodes of a source decoder;

[0050] Step 120, determining check node information of the source decoder based on the initialization information and the prior probability information;

[0051] Step 130, performing the following iteration steps, the iteration steps comprising:

[0052] updating soft information of the variable nodes of the source decoder based on the check node information and the initialization information;

[0053] performing decoding decision based on the updated soft information to determine a decoding result;

[0054] if the decoding result satisfies a check condition, outputting the decoding result; otherwise, continuing iteration until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0055] Specifically, first, original information bits (original data to be encoded) are subjected to source channel joint encoding and sent to channel transmission, wherein the encoding formula is as follows:

[0056] (1)

[0057] wherein, is a generator matrix of an LDPC code of size denotes a code word length, denotes an information bit length, denotes a check matrix of a source LDPC (Low Density Parity Check) code, is a code word to be transmitted, denotes a source encoded code word, which is a result of processing by a source encoder. We call the source encoder a , and the channel encoder a .

[0058] Secondly, the receiving end receives soft information from the channel and inputs it into the channel decoder, and inputs the probability prediction of the source into the source decoder, to complete the initialization of the two decoders.

[0059] is the initialization information of the variable node of the channel decoder at the first iteration.

[0060] When the source is a first-order Markov source, the value of the th source bit can be inferred from the th and th bits, and the information at the initialization of the channel encoder is as follows:

[0061] (2)

[0062] wherein, is a state transition probability, representing the probability that the current state is , given that the previous state is ; and denote the soft information of the previous and next bits obtained from the channel decoder. The extrinsic information generated by the previous and next bits can replace the source probability statistical information in the classical algorithm to obtain more accurate source prediction, and further improve the performance of the decoder.

[0063] It can be understood that a first-order Markov source is a statistical model in which the current state only depends on the previous state. In this case, the value of the th source bit can be inferred from the previous bit and the next bit .

[0064] ​Next, the initialized channel decoder and source decoder exchange messages and execute the JSCC-based dual LDPC minimum sum decoding algorithm.

[0065] The variable node of the channel decoder sends the update information from the check node of the channel decoder to the check node of the source decoder to assist in source decoding; the same applies to the source decoder. In the following formulas, This represents the information transmitted between decoder nodes. Represents the source decoder. Represents a channel decoder. Represents variable nodes, Representing a verification node, the transmission direction is determined by the sequence. Represents the number of iterations. For example... Indicates the first During the next iteration, the variable node of the source decoder sends information to the check node.

[0066] The decoding process of the source decoder is as follows: the variable node of the source decoder sends the initialization information and the information from the previous iteration to the verification node of the source decoder:

[0067] (3)

[0068] in, Indicates the verification node information. This represents the prior probability information of the variable nodes in the source decoder. This indicates initialization information. Indicates the verification node All neighbor variable nodes The current variable node is not included. Information Summation, Indicates the verification node The set of all neighboring variable nodes, excluding the current variable node. , Indicates the first In the next iteration, the verification node To variable node The message sent.

[0069] Understandable These messages are calculated by the source decoder in the previous iteration during the Joint Source-Channel Decoding (JSCC) process. These messages reflect the constraints of the check nodes on the variable nodes and are a crucial part of information transmission in the iterative decoding algorithm. In each iteration, these messages are updated and used to calculate the soft information of the variable nodes, thereby making decoding decisions.

[0070] performing the following iterative steps, the iterative steps comprising:

[0071] updating soft information of a variable node of the source decoder based on the check node information and the initialization information;

[0072] performing a decoding decision based on the updated soft information to determine a decoding result;

[0073] if the decoding result satisfies a check condition, outputting the decoding result; otherwise, continuing the iteration until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0074] The method provided by the embodiment of the application acquires initialization information of a channel encoder and prior probability information of a variable node of a source decoder, determines check node information of the source decoder based on the initialization information and the prior probability information, performs the following iterative steps, the iterative steps comprising: updating soft information of a variable node of the source decoder based on the check node information and the initialization information; performing a decoding decision based on the updated soft information to determine a decoding result; if the decoding result satisfies a check condition, outputting the decoding result; otherwise, continuing the iteration until a preset maximum iteration number is reached or the decoding result satisfies the check condition. The method determines the check node information of the source decoder based on the initialization information and the prior probability information, and iteratively updates the soft information of the variable node of the source decoder based on the check node information and the initialization information, that is, uses the information of the source as the soft information available in the decoding process, improves the coding gain, and thus improves the accuracy of the joint source channel decoding.

[0075] Based on the above embodiment, the method further comprises:

[0076] In the iteration step, the check node of the channel decoder is checked by using a min-sum algorithm, and the updated check node information is sent to the variable node of the channel decoder.

[0077] Specifically, in the iteration step, the check node of the channel decoder is checked by using a min-sum algorithm, and the updated check node information is sent to the variable node of the channel decoder.

[0078] For example, the updated check node information is sent to the variable node of the channel decoder based on the following formula:

[0079]

[0080]

[0081] wherein, represents the check node information of the source decoder in the j-th iteration in the joint source channel decoding process. ​To variable node The information sent is the updated verification node information. Indicates the first During the next iteration, the variable node of the source decoder Verify the node with its neighbors The message sent Indicates the verification node The set of all neighbor variable nodes, Indicates the first During the next iteration, the variable node of the channel decoder Verify the node with its neighbors The message sent Indicates the first In the next iteration, from the variable node of the source decoder The message transmission value to the verification node of the channel decoder. Indicates the first In the next iteration, from the variable node of the channel decoder The information transmitted to the source decoder.

[0082] Based on the above embodiments, step 130, which involves updating the soft information of the variable nodes of the source decoder based on the verification node information and the initialization information, includes:

[0083] Update Markov source soft information:

[0084] (4)

[0085] in, This indicates the check node in the source decoder. The sum of soft information passed to the variable nodes it is used to update the posterior probability of the variable nodes in the future.

[0086] The soft information of the variable nodes of the source decoder is updated based on the following formula:

[0087] (5)

[0088] in, This represents the soft information of the variable nodes in the source decoder. This indicates initialization information. Indicates the verification node All neighbor variable nodes Information Summation, Indicates the verification node The set of all neighbor variable nodes, Indicates the first In the next iteration, the verification node of the source decoder To variable node The message sent.

[0089] Next, update the variable node information of the source decoder according to equation (2), and update the soft information of the codeword output by the source decoder according to equation (5). .

[0090] The decoding process of the channel decoder is as follows: the initialization information of the variable nodes of the channel decoder and the information from the previous iteration, as well as the update information of the variable nodes of the source decoder, are sent to the verification node of the channel decoder:

[0091]

[0092] in for:

[0093]

[0094] in, This indicates that in the joint source-channel decoding process, the first... During the next iteration, the variable node of the channel decoder To the verification node The message sent This is the initialization information for the variable nodes of the channel decoder during the first iteration. Indicates the first In the next iteration, the verification node of the channel decoder To variable node The message sent Indicates the first In the next iteration, from the variable node of the source decoder The message transmission value to the verification node of the channel decoder. Indicates the first In the next iteration, the verification node of the channel decoder To variable node The message sent Indicates the first In the next iteration, from the variable node of the channel decoder The message transmission value to the verification node of the source decoder. Indicates the verification node The set of all neighbor variable nodes.

[0095] The check node of the channel decoder uses a min-sum algorithm for verification and sends the updated check node information to the variable node of the channel decoder.

[0096]

[0097] in, represents the information sent by the check node of the channel decoder to the variable node at the i-th iteration, represents the information sent by the variable node of the channel decoder to its neighboring check node at the i-th iteration, represents the set of all neighboring variable nodes of the check node.

[0098] Based on the above embodiment, the step of making a decoding decision based on the updated soft information to determine the decoding result in step 130 comprises:

[0099] Step 131, if the updated soft information is greater than a preset threshold, determining the decoding result as 1.

[0100] Step 132, if the updated soft information is less than the preset threshold, determining the decoding result as 0.

[0101] Specifically, if the updated soft information is greater than the preset threshold, the decoding result is determined as 1, and the preset threshold is 0, that is, if the updated soft information is greater than 0, the decoding result is determined as 1; if the updated soft information is less than 0, the decoding result is determined as 0.

[0102] In a preferred embodiment, the encoding mode that can be used is an LDPC code with a source code length of 3200 and a code rate of 1 / 4 and a channel code rate of 1 / 2.

[0103] In summary, the novel low-complexity decoding method based on JSCC double LDPC code in the embodiment of the application can significantly improve the coding gain. By further analyzing the source, the statistical rules, correlations and other characteristics are extracted and converted into decoding auxiliary information to embed the iteration link of the classic LDPC sum algorithm. This makes the decoding process more accurately converge to the correct codeword, and compared with the traditional decoding method, the bit error rate can be effectively reduced and the coding gain can be improved under the same channel conditions. In the scene of limited spectrum resources and complex channel environment, the accurate transmission of data can be ensured with lower transmission power.

[0104] ​​​​​​​​The low-complexity decoding method based on JSCC and double LDPC codes provided in the embodiment of the present application can reduce decoding complexity. The double LDPC code decoding module is adopted, and two LDPC codes with different structures or parameters perform preliminary decoding attempts on the signal from different dimensions. This parallel processing mode shares the decoding task and avoids complex high-load operation in single LDPC code decoding. Meanwhile, the information extraction and utilization mechanism based on source modeling is targeted to provide assistance for decoding, rather than blindly increasing the amount of calculation, but guiding the algorithm to quickly find the correct direction and reducing unnecessary iteration times and redundant calculation. The combination of the two can improve the performance while maintaining a low complexity and reducing the dependence on hardware resources, which makes it possible to achieve efficient decoding on resource-limited devices.

[0105] The purpose of the embodiment of the present application is to provide a low-complexity decoding method based on JSCC and double LDPC codes. The traditional decoding scheme optimizes the source and channel coding respectively to achieve the optimal system performance, which is not applicable to limited code block length. The embodiment of the present application can utilize the remaining redundancy of the source compression to assist channel decoding to obtain better error correction performance. The embodiment of the present application uses specific source modeling to provide additional extrinsic information for source decoding, which improves the coding gain by about 1 dB.

[0106] The source-channel joint decoding device provided by the present application is described below. The source-channel joint decoding device described below can be correspondingly referred to the source-channel joint decoding method described above.

[0107] Based on any of the above embodiments, the present application provides a source-channel joint decoding device, Figure 5 is a structural schematic diagram of the source-channel joint decoding device provided by the present application, as Figure 5 shown, the device comprises:

[0108] The acquisition unit 510 is configured to acquire initialization information of the channel encoder and a prior probability of a variable node of the source decoder.

[0109] The determination unit 520 is configured to determine check node information of the source decoder based on the initialization information and the prior probability.

[0110] The iteration unit 530 is configured to perform the following iteration steps, which comprise:

[0111] updating soft information of the variable node of the source decoder based on the check node information and the initialization information;

[0112] performing decoding decision based on the updated soft information to determine a decoding result;

[0113] If the decoding result satisfies a check condition, the decoding result is output; otherwise, iteration is continued until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0114] The device provided by the embodiment of the application acquires initialization information of a channel encoder and a prior probability of a variable node of a source decoder, determines check node information of the source decoder based on the initialization information and the prior probability, and performs the following iteration step. The iteration step includes: updating soft information of the variable node of the source decoder based on the check node information and the initialization information; performing decoding decision based on the updated soft information to determine a decoding result; if the decoding result satisfies a check condition, the decoding result is output; otherwise, iteration is continued until a preset maximum iteration number is reached or the decoding result satisfies the check condition. The method determines the check node information of the source decoder based on the initialization information and the prior probability, iteratively updates the soft information of the variable node of the source decoder based on the check node information and the initialization information, that is, uses the information of the source as the soft information available in the decoding process, improves the coding gain, and thus improves the accuracy of the joint decoding of the source and the channel.

[0115] Based on any of the above embodiments, the determination unit 520 is specifically configured to:

[0116] The check node information of the source decoder is determined based on the following formula:

[0117]

[0118] wherein, represents the check node information of the source decoder, represents the prior probability of the variable node of the source decoder, represents the initialization information, represents summation of information of all neighbor variable nodes of the check node except the current variable node , represents a set of all neighbor variable nodes of the check node except the current variable node , represents information sent by the check node to the variable node in the i-th iteration. Based on any of the above embodiments, the iteration unit 530 is specifically configured to:

[0119] Based on any of the above embodiments, the iteration unit 530 is specifically configured to:

[0120] ​​The soft information of the variable nodes of the source decoder is updated based on the following formula:

[0121]

[0122] in, This represents the soft information of the variable nodes in the source decoder. This indicates initialization information. Indicates the verification node All neighbor variable nodes Information Summation, Indicates the verification node The set of all neighbor variable nodes, Indicates the first In the next iteration, the verification node of the source decoder To variable node The message sent.

[0123] Based on any of the above embodiments, an updating unit is further included, wherein the updating unit specifically includes:

[0124] The update subunit is used to perform a minimum-sum algorithm to verify the check node of the channel decoder in the iterative step, and send the updated check node information to the variable node of the channel decoder.

[0125] Based on any of the above embodiments, the updating subunit is specifically used for:

[0126] Based on the following formula, the updated check node information is sent to the variable node of the channel decoder:

[0127]

[0128]

[0129] in, This indicates that in the joint source-channel decoding process, the first... In the next iteration, the verification node of the source decoder To variable node The information sent is the updated verification node information. Indicates the first During the next iteration, the variable node of the source decoder Verify the node with its neighbors The message sent Indicates the verification node The set of all neighbor variable nodes, Indicates the first During the next iteration, the variable node of the channel decoder Verify the node with its neighbors The message sent Indicates the first In the next iteration, from the variable node of the source decoder The message transmission value to the verification node of the channel decoder. Indicates the first In the next iteration, from the variable node of the channel decoder The information transmitted to the source decoder.

[0130] Based on any of the above embodiments, the iteration unit 530 is specifically used for:

[0131] If the updated soft information is greater than a preset threshold, the decoding result is determined to be 1;

[0132] If the updated soft information is less than the preset threshold, the decoding result is determined to be 0.

[0133] Figure 6 This is a schematic diagram of the structure of the electronic device provided by the present invention, such as... Figure 6 As shown, the electronic device may include a processor 610, a communications interface 620, a memory 630, and a communication bus 640, wherein the processor 610, the communications interface 620, and the memory 630 communicate with each other via the communication bus 640. The processor 610 can call logical instructions in the memory 630 to execute a source-channel joint decoding method. This method includes: acquiring initialization information of the channel encoder and prior probability information of the variable nodes of the source decoder; determining the verification node information of the source decoder based on the initialization information and the prior probability information; and executing the following iterative steps, which include: updating the soft information of the variable nodes of the source decoder based on the verification node information and the initialization information; performing a decoding decision based on the updated soft information to determine the decoding result; if the decoding result satisfies the verification condition, outputting the decoding result; otherwise, continuing the iteration until a preset maximum number of iterations is reached or the decoding result satisfies the verification condition.

[0134] Further, the logic instructions in the memory 630 described above can be implemented in the form of software functional units and sold or used as independent products, which can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or the parts that make contributions to the prior art or parts of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, and various media that can store program codes.

[0135] In another aspect, the present application also provides a computer program product, which comprises a computer program, the computer program can be stored on a non-transitory computer readable storage medium, and the computer program can be executed by a processor to enable a computer to perform the source channel joint decoding method provided by the above-mentioned methods. The method comprises: obtaining initialization information of a channel encoder and prior probability information of variable nodes of a source decoder; determining check node information of the source decoder based on the initialization information and the prior probability information; performing the following iteration step, which comprises: updating soft information of the variable nodes of the source decoder based on the check node information and the initialization information; performing decoding decision based on the updated soft information to determine a decoding result; if the decoding result satisfies a check condition, outputting the decoding result; otherwise, continuing iteration until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0136] In another aspect, the present application also provides a non-transitory computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the source channel joint decoding method provided by the above-mentioned methods. The method comprises: obtaining initialization information of a channel encoder and prior probability information of variable nodes of a source decoder; determining check node information of the source decoder based on the initialization information and the prior probability information; performing the following iteration step, which comprises: updating soft information of the variable nodes of the source decoder based on the check node information and the initialization information; performing decoding decision based on the updated soft information to determine a decoding result; if the decoding result satisfies a check condition, outputting the decoding result; otherwise, continuing iteration until a preset maximum iteration number is reached or the decoding result satisfies the check condition.

[0137] The device embodiments described above are merely illustrative, wherein the units described as separate components can or can not be physically separate, and the components displayed as units can or can not be physical units, i.e., can be located in one place, or can be distributed to multiple network units. Part or all of the modules can be selected to achieve the purposes of the embodiments according to actual needs. Those skilled in the art can understand and implement without creative labor.

[0138] Through the description of the above embodiments, those skilled in the art can clearly understand that the embodiments can be realized by means of software and the necessary general hardware platform, and of course can also be realized by hardware. Based on such understanding, the above technical solutions can be embodied in the form of a software product, which can be stored in a computer readable storage medium, such as a ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute the methods described in each embodiment or some parts of the embodiments.

[0139] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that: it can still modify the technical solutions recorded in the foregoing embodiments, or make equivalent replacement for part of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A decoding method combining source and channel, characterized in that, include: Obtain the initialization information of the channel decoder and the prior probability information of the variable nodes of the source decoder; Based on the initialization information and the prior probability information, the verification node information of the source decoder is determined; Perform the following iterative steps, which include: Based on the verification node information and the initialization information, update the soft information of the variable nodes of the source decoder; Based on the updated soft information, a decoding decision is made to determine the decoding result; If the decoding result meets the verification condition, the decoding result is output; otherwise, the iteration continues until the preset maximum number of iterations is reached or the decoding result meets the verification condition. The step of determining the verification node information of the source decoder based on the initialization information and the prior probability information includes: The check node information of the source decoder is determined based on the following formula: ； in, This indicates the check node information of the source decoder. This represents the prior probability information of the variable nodes in the source decoder. This indicates the initialization information. This indicates the check node for the source decoder. All neighbor variable nodes The current variable node of the source decoder is not included. Information Summation, This represents the check node of the source decoder. The set of all neighbor variable nodes, excluding the current variable node of the source decoder. , Indicates the first In the next iteration, the verification node of the source decoder To the variable node of the source decoder The message sent; The step of updating the soft information of the variable nodes of the source decoder based on the verification node information and the initialization information includes: The soft information of the variable nodes of the source decoder is updated based on the following formula: ； in, This represents the soft information of the variable nodes in the source decoder. This indicates the initialization information. This indicates the check node for the source decoder. All neighbor variable nodes Information Summation, This represents the check node of the source decoder. The set of all neighbor variable nodes, Indicates the first In the next iteration, the verification node of the source decoder Variable nodes of the source decoder The message sent; The method further includes: In the iterative step, the verification node of the source decoder is verified using a minimum sum algorithm, and the updated verification node information is sent to the variable node of the source decoder. The verification node of the source decoder is verified using a minimum-sum algorithm, and the updated verification node information is sent to the variable node of the source decoder, including: Based on the following formula, the updated check node information is sent to the variable node of the source decoder: ； ； in, This indicates that in the joint source-channel decoding process, the first... In the next iteration, the verification node of the source decoder Variable nodes of the source decoder The information sent is the updated verification node information. Indicates the first During the next iteration, the variable node of the source decoder Verify the node with its neighbors The message sent Indicates the first During the next iteration, the variable node of the channel decoder Verify the node with its neighbors The message sent Indicates the first In the next iteration, from the variable node of the source decoder The message transmission value to the verification node of the channel decoder. Indicates the first In the next iteration, from the variable node of the channel decoder The information transmitted to the source decoder.

2. The decoding method for joint source and channel according to claim 1, characterized in that, The decoding decision based on the updated soft information to determine the decoding result includes: If the updated soft information is greater than a preset threshold, the decoding result is determined to be 1; If the updated soft information is less than the preset threshold, the decoding result is determined to be 0.

3. A decoding apparatus for a combined source and channel, characterized in that, include: The acquisition unit is used to acquire the initialization information of the channel decoder and the prior probability information of the variable nodes of the source decoder. The determining unit is used to determine the verification node information of the source decoder based on the initialization information and the prior probability information; An iterative unit is configured to perform the following iterative steps, which include: Based on the verification node information and the initialization information, update the soft information of the variable nodes of the source decoder; Based on the updated soft information, a decoding decision is made to determine the decoding result; If the decoding result meets the verification condition, the decoding result is output; otherwise, the iteration continues until the preset maximum number of iterations is reached or the decoding result meets the verification condition. The determining unit is specifically used for: The check node information of the source decoder is determined based on the following formula: ； in, This indicates the check node information of the source decoder. This represents the prior probability information of the variable nodes in the source decoder. This indicates the initialization information. This indicates the check node for the source decoder. All neighbor variable nodes The current variable node of the source decoder is not included. Information Summation, This represents the check node of the source decoder. The set of all neighbor variable nodes, excluding the current variable node of the source decoder. , Indicates the first In the next iteration, the verification node of the source decoder To the variable node of the source decoder The message sent; The step of updating the soft information of the variable nodes of the source decoder based on the verification node information and the initialization information includes: The soft information of the variable nodes of the source decoder is updated based on the following formula: ； in, This represents the soft information of the variable nodes in the source decoder. This indicates the initialization information. This indicates the check node for the source decoder. All neighbor variable nodes Information Summation, This represents the check node of the source decoder. The set of all neighbor variable nodes, Indicates the first In the next iteration, the verification node of the source decoder Variable nodes of the source decoder The message sent; It also includes a sending unit, which specifically includes: In the iterative step, the verification node of the source decoder is verified using a minimum sum algorithm, and the updated verification node information is sent to the variable node of the source decoder. The verification node of the source decoder is verified using a minimum-sum algorithm, and the updated verification node information is sent to the variable node of the source decoder, including: Based on the following formula, the updated check node information is sent to the variable node of the source decoder: ； ； in, This indicates that in the joint source-channel decoding process, the first... In the next iteration, the verification node of the source decoder Variable nodes of the source decoder The information sent is the updated verification node information. Indicates the first During the next iteration, the variable node of the source decoder Verify the node with its neighbors The message sent Indicates the first During the next iteration, the variable node of the channel decoder Verify the node with its neighbors The message sent Indicates the first In the next iteration, from the variable node of the source decoder The message transmission value to the verification node of the channel decoder. Indicates the first In the next iteration, from the variable node of the channel decoder The information transmitted to the source decoder.

4. An electronic device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the source-channel joint decoding method as described in any one of claims 1 to 2.

5. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the decoding method for the combined source and channel as described in any one of claims 1 to 2.

6. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the decoding method for the combined source and channel as described in any one of claims 1 to 2.

Images