A Zipper code soft decoding method based on Chase-Pyndiah algorithm

By adopting the Zipper code soft decoding method based on Chase-Pyndiah algorithm in the OTN network, the problem of poor decoding performance is solved, and the decoding results with low signal-to-noise ratio and low bit error rate are achieved, and about 1dB is provided Signal-to-noise ratio gain.

CN114337691BActive Publication Date: 2024-11-05XIDIAN UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111372187.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-18
Publication Date
2024-11-05
Estimated Expiration
2041-11-18

AI Technical Summary

Technical Problem

In the prior art, when the complexity requirements are not high, the decoding algorithms in the OTN network have poor decoding performance, making it difficult to meet the demand for high bit error rates.

Method used

Using the Zipper code soft decoding method based on the Chase-Pyndiah algorithm, the real and imaginary blocks of the Zipper code are initialized, and the Chase-Pyndiah algorithm is used to decode it line by line, update the external information value, and perform information according to the mapping relationship. Exchange, realize iterative decoding, and finally output the decoding result.

Benefits of technology

Effectively improve the decoding performance of Zipper code, reduce the signal-to-noise ratio, or reduce the signal-to-noise ratio requirement under the same bit error rate, and realize the decoding results of low signal-to-noise ratio and low bit error rate, with about 1dB signal-to-noise ratio gain.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114337691B_ABST
    Figure CN114337691B_ABST
Patent Text Reader

Abstract

The present invention discloses a Zipper code soft decoding method based on Chase-Pyndiah algorithm, including: initializing the decoding information of the real block and the imaginary block of the Zipper code in the current decoding window; using Chase-Pyndiah algorithm to decode the component code in the current decoding window line by line, updating the external information value of each bit and exchanging the information of the real block and the imaginary block according to the mapping relationship to complete one iteration; obtaining the prior value of the next iteration of the current decoding window according to the external information value of each bit after the update, and performing the next iteration; when the preset maximum number of iterations is reached, the decoder outputs the decoding result of the target codeword block; sliding the decoding window to include the next codeword block to decode the next codeword block. The method of the present invention can effectively improve the decoding performance of the Zipper code and obtain a decoding result with low signal-to-noise ratio and low bit error rate.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of communications, and in particular relates to a Zipper code soft decoding method based on a Chase-Pyndiah algorithm. Background Art

[0002] In 2000, forward error correction (FEC) in optical transport networks (OTN) was first standardized in ITU-T Recommendation G.975, which specifies (255,239) Reed-Solomon codes operating at 2.5Gb / s throughput. Since then, more complex FEC schemes for OTN have been studied and implemented to accommodate higher data rates. Since OTN handles very high data throughput, the FEC used must have low complexity.

[0003] Spatial coupling codes are a type of FEC suitable for OTN networks, including spatial coupling LDPC, Braided Block codes, and Staircase codes. Zipper codes are a new spatial coupling code framework proposed by AYSukmadji et al. in 2019. Due to complexity considerations, FEC in OTN generally uses hard decision decoding, but when the complexity requirement is not too high and the bit error rate requirement is high, hard decision decoding cannot meet the requirements. Summary of the invention

[0004] In order to solve the above problems existing in the prior art, the present invention provides a Zipper code soft decoding method based on the Chase-Pyndiah algorithm, which mainly solves the problem that the decoding performance of the existing decoding algorithm is not very good when the complexity requirement is not high. The technical problem to be solved by the present invention is achieved by the following technical solutions:

[0005] One aspect of the present invention provides a Zipper code soft decoding method based on the Chase-Pyndiah algorithm, comprising:

[0006] S1: Initialize the decoding information of the real block and imaginary block of the Zipper code in the current decoding window;

[0007] S2: Decode the component codes in the current decoding window row by row using the Chase-Pyndiah algorithm, update the external information value of each bit, and exchange information between the real block and the imaginary block according to the mapping relationship to complete one iteration;

[0008] S3: Obtain the prior value of the next iteration of the current decoding window according to the updated external information value of each bit, and perform the next iteration;

[0009] S4: When the preset maximum number of iterations is reached, the decoder outputs the decoding result of the target codeword block;

[0010] S5: Slide the decoding window to include the next codeword block to decode the next codeword block.

[0011] In one embodiment of the present invention, the S1 includes:

[0012] If the current decoding window is the first decoding window to start decoding, the prior values ​​of the real part blocks of the Zipper code in the first decoding window are initialized to 0, and the channel information of the real part blocks is initialized to its received value; the prior value of the first imaginary part block of the Zipper code in the first decoding window is initialized to 0, and the channel information of the first imaginary part block is initialized to -1.

[0013] In one embodiment of the present invention, the S1 further includes:

[0014] If the current decoding window is a decoding window after the first decoding window, the a priori value of the most recently received real part block in the current decoding window is initialized to 0, the a priori value of the most recently received previous real part block is initialized to the external information of the real part bit corresponding to the previous real part block at the last iteration of the previous decoding window, the a priori values ​​of the remaining real part blocks in the current decoding window are initialized to the external information of the corresponding imaginary part bits obtained according to the mapping relationship at the last iteration of the previous decoding window, and the channel information of all real part blocks is initialized to the received value;

[0015] The a priori value of the first imaginary part block in the current decoding window is initialized to the external information of the imaginary part bit corresponding to the first imaginary part block in the last iteration of the previous decoding window, and the channel information of all imaginary part blocks in the current decoding window are the corresponding real part bit reception values ​​obtained according to the mapping relationship.

[0016] In one embodiment of the present invention, the S2 includes:

[0017] S21: Obtain soft input information of the i-th row of codewords in the current decoding window:

[0018]

[0019] in, α is the scaling factor, represents the channel information of the bit in the i-th row and j-th column, represents the prior value of the bit in the i-th row and j-th column at the I-th iteration, where I represents the number of iterations;

[0020] S22: Decode row by row using the Chase decoder. After decoding, update the external information value of each bit:

[0021]

[0022] Where j = 0, 1...n-1, is the modulation form of the final output codeword of the decoder, is the modulation form of other codewords in the candidate codeword list, β is a reliability factor, is the final output codeword of the decoder The jth bit of

[0023] S23: After decoding of each row of component codes, the updated external information value of the real part is returned to the imaginary part according to the mapping relationship in the current decoding window as a priori value of the imaginary part;

[0024] S24: Repeat S21-S23 to decode each row of component codes in the current decoding window in turn, thereby completing one iteration of the current decoding window.

[0025] In one embodiment of the present invention, S3 includes:

[0026] S31: After one iteration is completed, the updated external information of all imaginary part blocks except the first imaginary part in the current decoding window is returned to the corresponding real part according to the mapping relationship as the prior value of the real part in the next iteration; the external information of the first imaginary part block and the last real part block are used as the respective prior values ​​in the next iteration;

[0027] S32: Iteration number I=I+1, repeat S2, and decode from the first row to the last row in the current decoding window.

[0028] Another aspect of the present invention provides a storage medium storing a computer program for executing the steps of the Zipper code soft decoding method based on the Chase-Pyndiah algorithm described in any one of the above embodiments.

[0029] Yet another aspect of the present invention provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor calls the computer program in the memory, the processor implements the steps of the Zipper code soft decoding method based on the Chase-Pyndiah algorithm as described in any one of the above embodiments.

[0030] Compared with the prior art, the present invention has the following beneficial effects:

[0031] 1. The Zipper code soft decoding method based on the Chase-Pyndiah algorithm of the present invention can effectively improve the decoding performance of the Zipper code and obtain a decoding result with a low signal-to-noise ratio and a low bit error rate, that is, under the condition of the same signal-to-noise ratio, the decoding method of the present application can reduce the bit error rate, or under the condition of the same bit error rate, the signal-to-noise ratio required by the present application is lower.

[0032] 2. The Zipper code soft decoding method based on the Chase-Pyndiah algorithm of the present invention has the following advantages: when the bit error rate is 10 -5 , there is about 1dB of gain.

[0033] The present invention will be further described in detail below with reference to the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 It is a structural block diagram of a Zipper encoding and decoding simulation system;

[0035] Figure 2 It is a schematic diagram of the structure of a Zipper code;

[0036] Figure 3 It is a flowchart of a Zipper code soft decoding method based on the Chase-Pyndiah algorithm provided by an embodiment of the present invention;

[0037] Figure 4 It is a flow chart of a Zipper code soft decoding method based on the Chase-Pyndiah algorithm provided by an embodiment of the present invention;

[0038] Figure 5 Schematic diagram of a Zipper code sliding window decoding provided by an embodiment of the present invention;

[0039] Figure 6 It is a principle block diagram of a Chase_Pyndiah algorithm provided by an embodiment of the present invention;

[0040] Figure 7 is a schematic diagram of a mapping relationship provided by an embodiment of the present invention;

[0041] Figure 8 It is a comparison diagram of decoding results using the decoding method of the embodiment of the present invention and the BM algorithm and Chase algorithm of the prior art respectively. DETAILED DESCRIPTION

[0042] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, a Zipper code soft decoding method based on the Chase-Pyndiah algorithm proposed in the present invention is described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0043] The above and other technical contents, features and effects of the present invention are clearly presented in the following detailed description of the specific implementation modes in conjunction with the accompanying drawings. Through the description of the specific implementation modes, the technical means and effects adopted by the present invention to achieve the predetermined purpose can be more deeply and specifically understood. However, the attached drawings are only for reference and explanation purposes and are not used to limit the technical solutions of the present invention.

[0044] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants are intended to cover non-exclusive inclusion, so that an article or device including a series of elements includes not only those elements, but also other elements that are not explicitly listed. In the absence of more restrictions, the elements defined by the statement "including one..." do not exclude the existence of other identical elements in the article or device including the elements.

[0045] Embodiment 1

[0046] Before describing the Zipper code soft decoding method of this embodiment, the related concepts and encoding and decoding process of Zipper code are first introduced. Figure 1 , Figure 1The invention discloses a structural block diagram of a Zipper coding simulation system, which comprises a pseudo-random sequence generation module, a Zipper code encoding module, a BPSK modulation module, an AWGN channel module, a BPSK demodulation module, a Zipper code decoding module and a statistical error module, wherein the pseudo-random sequence generation module is used to generate source bits through a random function, and send the generated source bits to the Zipper code encoding module; the Zipper code encoding module is used to perform Zipper code encoding on the input source bits, and send the bit sequence obtained after encoding to the BPSK modulation module; the BPSK modulation module is used to perform binary phase shift keying modulation on the bit sequence sent by the Zipper code encoding module, so that "0" becomes "-1" after modulation, and "1" becomes "+1" after modulation, and the modulated bit sequence is sent to the BPSK modulation module. The sequence is sent to the AWGN channel module; the AWGN channel module is used to add additive white Gaussian noise to the modulated sequence, and then send it to the BPSK demodulation module; the BPSK demodulation module is used to demap the bit sequence from the AWGN channel module, obtain the log-likelihood ratio information and the bit sequence after hard decision, and then send the obtained log-likelihood ratio information, the bit sequence after hard decision and the received sequence to the Zipper code decoding module; the Zipper code decoding module is used to perform soft decoding based on the log-likelihood ratio information sent by the BPSK demodulation module, the bit sequence after hard decision and the received sequence, obtain the final decision sequence and send the final decision sequence to the statistical error module; the statistical error module is used to compare the final decision sequence obtained by decoding with the generated pseudo-random sequence, count the number of error bits, and obtain the bit error rate.

[0047] For further information, see Figure 2 , Figure 2 This is a schematic diagram of the structure of a Zipper code. The left half of the figure is C A is the imaginary part, the right half C B is the real part, which includes information bits and check bits. Only the real part can be transmitted in the channel, and the imaginary part is not sent in the channel. Each time a codeword block is sent, the size of the codeword block is recorded as L, that is, a codeword block includes L row component codes of the Zipper code. Figure 2 Each row in is a legal codeword of the component code. For the i-th row, the imaginary part of the row is m i , the total code length is recorded as n i , the real part is n i -m i . If there exists a positive integer v such that m i+v =m i , then v is the period of the Zipper code.

[0048] The encoding process of the Zipper code is as follows: After the encoding is initialized, the information sequence is placed in the corresponding position of the real part, and is sent to the component encoder row by row for encoding to obtain the check bit. The check bit is placed in the corresponding position of the real part, and then the real part of the row is returned to the imaginary part according to the mapping relationship. At this point, the encoding of the row is completed, and the above process is continued for the next row until the encoding is completed.

[0049] After encoding of each L rows of component codes, the real part bits are BPSK modulated row by row and sent into the AWGN channel. The receiving end puts the received bits into the real part position row by row. Each L rows is a codeword block and is labeled. For example, the first L rows are marked as B0, the second L rows are marked as B1, and so on. The imaginary part is then obtained through the mapping relationship (the channel reception value of the first imaginary block A0 is initialized to -1). The mapping relationship from the imaginary part to the real part is φ, that is, the real part bit corresponding to the imaginary part bit in the i-th row and j-th column is φ(i,j); the mapping relationship from the real part to the imaginary part is φ -1 , that is, the imaginary bit corresponding to the real bit of the i-th row and j-th column is φ -1 (i,j).

[0050] r i =(r i,0 ,r i,1 ,...r i,j ,...,r i,n ) represents the received value of the component code channel in the i-th row, represents the channel information of the i-th row component code. Similarly, and They respectively represent the prior value and extrinsic information value of the i-th row component code at the I-th iteration. For vector The jth corresponding value of represents the channel information of the i-th row and j-th column bit. Similarly, Respectively, vector The j-th corresponding value of , which respectively represents the prior value and extrinsic information value of the i-th row and j-th column bit at the I-th iteration.

[0051] The Zipper code decoding process is performed in the Zipper code decoding module. This embodiment provides a Zipper code soft decoding method based on the Chase-Pyndiah algorithm. Figure 3 and Figure 4 The Zipper code soft decoding method comprises the following steps:

[0052] Step 1: Initialize the decoding information of the real block and imaginary block of the Zipper code in the current decoding window.

[0053] If the current decoding window is the first decoding window to start decoding, the prior values ​​of the real part blocks of the Zipper code in the first decoding window are initialized to 0, and the channel information of the real part blocks is initialized to its received value; the prior value of the first imaginary part block of the Zipper code in the first decoding window is initialized to 0, and the channel information of the first imaginary part block is initialized to -1.

[0054] If the current decoding window is a decoding window after the first decoding window, the a priori value of the most recently received real part block in the current decoding window is initialized to 0, the a priori value of the previous real part block is initialized to the external information of the real part bit corresponding to the previous real part block at the last iteration of the previous decoding window, the a priori values ​​of the remaining real part blocks in the current decoding window are initialized to the external information of the corresponding imaginary part bits obtained according to the mapping relationship at the last iteration of the previous decoding window, and the channel information of all real part blocks is initialized to the received value;

[0055] The a priori value of the first imaginary part block in the current decoding window is initialized to the external information of the imaginary part bit corresponding to the first imaginary part block in the last iteration of the previous window, and the channel information of all imaginary part blocks in the current decoding window are the received values ​​of the corresponding real part bits obtained according to the mapping relationship.

[0056] Specifically, assuming that the code length of the Zipper code is n, the size of the imaginary part is m, the size of the codeword block is L, and the decoding window size is w, decoding begins after receiving w codeword blocks. As mentioned above, the Zipper code includes a real part and an imaginary part, so the codeword block also includes a real part block and an imaginary part block. Before decoding begins, the decoding information of the real part block and the imaginary part block is first initialized.

[0057] Specifically, if the current decoding window is the first decoding window to start decoding, the w real part blocks B0, B1, ..., B w-1 The prior values ​​of are initialized to 0, w real part blocks B0, B1, ...., B w-1 The channel information of the first imaginary block A0 of the Zipper code in the first decoding window is initialized to 0, and the channel information of the first imaginary block A0 is initialized to -1. The above initialization process is expressed by the following formula:

[0058] (a) For the real part j∈[m,n-1]

[0059]

[0060] Where L represents the codeword block size, w represents the decoding window size, represents the channel information of the bit in the i-th row and j-th column, represents the initial prior value of the bit in the i-th row and j-th column, r i,j Represents the channel received value of the bit in the i-th row and j-th column.

[0061] (b) For the imaginary part j∈[0,m-1]

[0062]

[0063] See also Figure 5 , Figure 5 1 is a schematic diagram of a Zipper code sliding window decoding provided by an embodiment of the present invention, wherein a large dashed line frame represents a current window, a small dashed line frame represents a target block at a current moment in the current window, and decoding begins after receiving w codeword blocks. Figure 5 The window size is 3, that is, decoding starts after receiving w=3 codeword blocks. In this embodiment, before decoding starts, the first decoding window is initialized. For the real part, the prior values ​​of the three real blocks B0, B1, and B2 in the current window are initialized to 0, and the channel information of the three real blocks B0, B1, and B2 are initialized to their received values; for the imaginary part, the prior value of the first imaginary block A0 is initialized to 0, and the channel information of the first imaginary block A0 is initialized to -1. The window size of this embodiment is w=3, and the initialization process is expressed by the following formula:

[0064] (a) For the real part j∈[m,n-1]

[0065]

[0066] (b) For the imaginary part j∈[0,m-1]

[0067]

[0068] Furthermore, if the current decoding window is a decoding window after the first decoding window, that is, the current decoding window is not the first decoding window, if the target block of the current decoding window is B h , then for the real part, the most recently received real part block B in the current decoding window h+w-1 The prior value of is initialized to 0, the real part of block B h+w-1 The previous real part block B h+w-2 The a priori value of is initialized to the external information of the real part bit corresponding to the block at the last iteration of the previous decoding window, and the a priori values ​​of the remaining real part blocks in the current decoding window are initialized to the external information of the corresponding imaginary part bits obtained according to the mapping relationship at the last iteration of the previous decoding window. The channel information of all real part blocks is initialized to the received value; for the imaginary part, the first codeword block A of the current decoding window is initialized to h The prior value of the codeword block A is hThe external information corresponding to the imaginary bit at the last iteration of the previous window, and the imaginary channel information of all codeword blocks in the current decoding window are the received values ​​of the corresponding real bits obtained according to the mapping relationship. It can be expressed as follows:

[0069] (a) For the real part j∈[m,n-1]:

[0070]

[0071] (b) For the imaginary part j∈[0,m-1]:

[0072]

[0073] Specifically, Figure 5 As shown, for the case where the window size is w=3, if the target codeword block of the current decoding window is B h , then for the real part, the most recently received real part block B h+2 The real part of the prior value is initialized to 0, and the previous real part block B h+1 The real part prior value of the real part block B h+1 In the previous window (i.e. Figure 5 The h-1 window in the last iteration corresponds to the external information of the real part bit, the target codeword block B h The prior value of is the previous window (i.e. Figure 5 h-1 window in the last iteration) According to the external information of the corresponding imaginary bit obtained by the mapping relationship, all real block B h ,B h+1 ,B h+2 The channel information is the received value; for the imaginary part, the first imaginary block A in the current decoding window h The imaginary part of the prior value is the previous window A h External information at the last iteration, all A in the window h ,A h+1 ,A h+2 The channel information of the imaginary block is the corresponding real bit received value obtained according to the mapping relationship. At this time, it is expressed as follows:

[0074] (a) For the real part:

[0075]

[0076] (b) For the imaginary part:

[0077]

[0078] S2: Use the Chase-Pyndiah algorithm to decode the component codes in the current decoding window row by row, update the external information value of each bit, and exchange information between the real block and the imaginary block according to the mapping relationship to complete one iteration.

[0079] Specifically, after the decoding window is initialized, decoding begins from the first row of the current window. This embodiment uses the Chase-Pyndiah algorithm to decode the component codes in the decoding window. The Chase-Pyndiah algorithm is an improved algorithm based on the Chase algorithm. The Chase algorithm generates different error patterns according to the reliability of each bit. Each error pattern corresponds to a test sequence. These test sequences are then decoded using a hard decision decoder. After decoding, the codewords that meet the verification are output to form a list of candidate codewords. The codewords in the list are then compared with the received sequence, and a candidate codeword with the smallest Euclidean distance to the received sequence is selected as the final output. The Chase-Pyndiah algorithm adds the calculation of output external information on the basis of the Chase algorithm. Its basic principle is as follows: Figure 6 shown.

[0080] Specifically, step S2 includes:

[0081] S21: Obtain soft input information of the i-th row of codewords in the current decoding window.

[0082] At the Ith iteration, is the soft input information of the i-th row codeword, Here, α is a proportional factor, which can be optimized according to the number of iterations and channel conditions. For simplicity, α=0.75 is selected in this embodiment.

[0083] S22: Decode row by row using the Chase decoder. After decoding, update the extrinsic information value of each bit. For each row, after decoding, each bit will update its extrinsic information value. The formula is as follows:

[0084]

[0085] Where j = 0, 1...n-1, is the modulation form of the final output codeword of the decoder, is the modulation form of other codewords in the candidate codeword list, which may not exist; β is a reliability factor, which can be optimized according to the number of iterations and channel conditions. In this embodiment, β=1 is selected; The final output codeword for the decoder The jth bit of .

[0086] S23: After decoding of each row of component codes, the updated external information value of the real part is returned to the imaginary part according to the mapping relationship in the current decoding window as the prior value of the imaginary part. The information exchange process is as follows:

[0087]

[0088] S24: Repeat steps S21 to S23 to decode each row of component codes in the current decoding window in turn, thereby completing one iteration of the current decoding window, that is, decoding from the first row in the current decoding window to the last row is one iteration.

[0089] S3: Obtain the priori value of the next iteration of the current decoding window according to the updated external information value of each bit, and perform the next iteration according to the process of S2.

[0090] The S3 specifically includes:

[0091] S31: After one iteration is completed, the updated external information of all imaginary part blocks except the first imaginary part in the current decoding window is returned to the corresponding real part according to the mapping relationship as the prior value of the real part in the next iteration; the external information of the first imaginary part block and the last real part block are used as the respective prior values ​​in the next iteration;

[0092] S32: Iteration number I=I+1, repeat S2, and decode from the first row to the last row in the current decoding window.

[0093] Specifically, after one iteration, the last w-1 imaginary blocks A in the current decoding window are h+1 ,A h+2 ,...A h+w-1 The updated external information returns the real part according to the mapping relationship as the prior value of the real part in the next iteration; the first imaginary block A h and the last real block B h+w-1 The external information is used as the prior value of each in the next iteration, and the specific update is as follows:

[0094] (a) For the real part j∈[m,n-1]:

[0095]

[0096] (b) For the imaginary part j∈[0,m-1]:

[0097]

[0098] exist Figure 5 That is: for the two imaginary blocks A in the current decoding window h+1 ,A h+2The updated external information returns the real part according to the mapping relationship as the prior value of the corresponding real part in the next iteration; the first imaginary block A h and the last real block B h+2 The external information is used as the next iteration A h and B h+2 The prior value of

[0099] Then, the number of iterations I=I+1, and then step 2 is repeated, starting from the first row of the current decoding window to the last row.

[0100] S4: When the preset maximum number of iterations I is reached max Finally, the decoder outputs the decoding result of the target codeword block.

[0101] Specifically, repeat S2 and S3 until the preset maximum number of iterations I is reached. max After that, the decoder outputs the target codeword block B h The decoding result of .

[0102] S5: Slide the decoding window to include the next codeword block to decode the next codeword block.

[0103] Specifically, the target codeword block B in the current decoding window h After decoding is completed, at the next moment, a new information block B is received h+w (like Figure 5 B h+3 As shown), the decoding window slides "down" by one block, with B h+1 The previous process is repeated as the target codeword block to start decoding the new codeword block until all codeword blocks are decoded.

[0104] The effect of the Zipper code soft decoding method according to the embodiment of the present invention is further described below in combination with simulation experiments.

[0105] (1) Simulation conditions

[0106] The simulation experiment of the embodiment of the present invention is carried out under Visual Studio 2019 software, and the Zipper code length n=124, the real part and the imaginary part size are both m=62, the period v=1, the block size is 62, the window size w=10, and the maximum number of decoding iterations I max =20, the number of unreliable positions for Chase and Chase_Pyndiah algorithms is p=3, and the mapping relationship is as follows Figure 7 As shown (it should be noted that m=62 in this embodiment, while 5 is shown in the figure, and the rest remain unchanged), the component code uses a (127,106) BCH code that corrects 3 errors.

[0107] (2) Simulation content and result analysis

[0108] Under the above conditions, the decoding method ( Figure 8 The BM algorithm and the Chase algorithm of the prior art are decoded respectively, and the results are as follows: Figure 8 As shown, the horizontal axis represents the signal-to-noise ratio E b / N0, the unit is decibel dB, and the vertical axis represents the bit error rate BER. Figure 8 It can be seen that the bit error rate curve of the decoding method according to the embodiment of the present invention is 10 -5 When compared with the BM algorithm and the Chase algorithm, there is an improvement of about 1.3dB.

[0109] In summary, the Zipper code soft decoding method of this embodiment can effectively improve the decoding performance of the Zipper code and obtain a decoding result with a low signal-to-noise ratio and a low bit error rate. That is, under the condition of the same signal-to-noise ratio, the decoding method of the present application can reduce the bit error rate, or under the condition of the same bit error rate, the signal-to-noise ratio required by the present application is lower.

[0110] Another aspect of the present invention provides a storage medium, in which a computer program is stored, and the computer program is used to execute the steps of the Zipper code soft decoding method described in the above embodiment. Another aspect of the present invention provides an electronic device, including a memory and a processor, in which a computer program is stored, and when the processor calls the computer program in the memory, the steps of the Zipper code soft decoding method described in the above embodiment are implemented. Specifically, the above-mentioned integrated module implemented in the form of a software function module can be stored in a computer-readable storage medium. The above-mentioned software function module is stored in a storage medium, including several instructions for an electronic device (which can be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform some steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-OnlyMemory, ROM), random access memory (Random Access Memory, RAM), disk or optical disk and other media that can store program codes.

[0111] The above contents are further detailed descriptions of the present invention in combination with specific preferred embodiments, and it cannot be determined that the specific implementation of the present invention is limited to these descriptions. For ordinary technicians in the technical field to which the present invention belongs, several simple deductions or substitutions can be made without departing from the concept of the present invention, which should be regarded as falling within the protection scope of the present invention.

Claims

1. A Zipper code soft decoding method based on Chase-Pyndiah algorithm, It is characterized in that include: S1: Initialize the decoding information of the real block and imaginary block of the Zipper code in the current decoding window; S2: Decode the component codes in the current decoding window row by row using the Chase-Pyndiah algorithm, update the external information value of each bit, and exchange information between the real block and the imaginary block according to the mapping relationship to complete one iteration; S3: Obtain the prior value of the next iteration of the current decoding window according to the updated external information value of each bit, and perform the next iteration; S4: When the preset maximum number of iterations is reached, the decoder outputs the decoding result of the target codeword block; S5: sliding the decoding window to include the next codeword block to decode the next codeword block, The S2 includes: S21: Obtain soft input information of the i-th row of codewords in the current decoding window: in, α is the scaling factor, represents the channel information of the bit in the i-th row and j-th column, represents the prior value of the bit in the i-th row and j-th column at the I-th iteration, where I represents the number of iterations; S22: Decode row by row using the Chase decoder. After decoding, update the external information value of each bit: Where j = 0, 1...n-1, is the modulation form of the final output codeword of the decoder, is the modulation form of other codewords in the candidate codeword list, β is a reliability factor, is the final output codeword of the decoder The jth bit of S23: After decoding of each row of component codes, the updated external information value of the real part is returned to the imaginary part according to the mapping relationship in the current decoding window as a priori value of the imaginary part; S24: Repeat S21-S23 to decode each row of component codes in the current decoding window in turn, thereby completing one iteration of the current decoding window.

2. The Zipper code soft decoding method based on the Chase-Pyndiah algorithm according to claim 1, It is characterized in that The S1 includes: If the current decoding window is the first decoding window to start decoding, the prior values ​​of the real part blocks of the Zipper code in the first decoding window are initialized to 0, and the channel information of the real part blocks is initialized to its received value; the prior value of the first imaginary part block of the Zipper code in the first decoding window is initialized to 0, and the channel information of the first imaginary part block is initialized to -1.

3. The Zipper code soft decoding method based on the Chase-Pyndiah algorithm according to claim 2, It is characterized in that The S1 further comprises: If the current decoding window is a decoding window after the first decoding window, the a priori value of the most recently received real part block in the current decoding window is initialized to 0, the a priori value of the most recently received previous real part block is initialized to the external information of the real part bit corresponding to the previous real part block at the last iteration of the previous decoding window, the a priori values ​​of the remaining real part blocks in the current decoding window are initialized to the external information of the corresponding imaginary part bits obtained according to the mapping relationship at the last iteration of the previous decoding window, and the channel information of all real part blocks is initialized to the received value; The a priori value of the first imaginary part block in the current decoding window is initialized to the external information of the imaginary part bit corresponding to the first imaginary part block in the last iteration of the previous decoding window, and the channel information of all imaginary part blocks in the current decoding window are the corresponding real part bit reception values ​​obtained according to the mapping relationship.

4. The Zipper code soft decoding method based on the Chase-Pyndiah algorithm according to claim 1, It is characterized in that The S3 includes: S31: After one iteration is completed, the updated external information of all imaginary part blocks except the first imaginary part in the current decoding window is returned to the corresponding real part according to the mapping relationship as the prior value of the real part in the next iteration; the external information of the first imaginary part block and the last real part block are used as the respective prior values ​​in the next iteration; S32: Iteration number I=I+1, repeat S2, and decode from the first row to the last row in the current decoding window.

5. A storage medium, It is characterized in that The storage medium stores a computer program, and the computer program is used to execute the steps of the Zipper code soft decoding method based on the Chase-Pyndiah algorithm as described in any one of claims 1 to 4.

6. An electronic device, It is characterized in that The invention comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the steps of the Zipper code soft decoding method based on the Chase-Pyndiah algorithm as claimed in any one of claims 1 to 4 are implemented.