WO2019075988A1 - 译码方法和装置 - Google Patents

译码方法和装置 Download PDF

Info

Publication number
WO2019075988A1
WO2019075988A1 PCT/CN2018/079726 CN2018079726W WO2019075988A1 WO 2019075988 A1 WO2019075988 A1 WO 2019075988A1 CN 2018079726 W CN2018079726 W CN 2018079726W WO 2019075988 A1 WO2019075988 A1 WO 2019075988A1
Authority
WO
WIPO (PCT)
Prior art keywords
decoding
information
mutual information
branch
mutual
Prior art date
Application number
PCT/CN2018/079726
Other languages
English (en)
French (fr)
Inventor
刘若鹏
季春霖
郑昊
Original Assignee
深圳超级数据链技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳超级数据链技术有限公司 filed Critical 深圳超级数据链技术有限公司
Publication of WO2019075988A1 publication Critical patent/WO2019075988A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H04L1/0063—Single parity check
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2948—Iterative decoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes

Definitions

  • the present invention relates to the field of data processing, and in particular to a decoding method and apparatus.
  • the Zigzag code is a parity code constructed using a "shape" structure.
  • the Zigzag code of the cascade structure can be constructed by a multi-dimensional parallel cascading manner, and the coding structure thereof can be as shown in FIG.
  • a Zigzag code of a K-dimensional cascade structure can be described by parameters (I, J, K).
  • the information sequence can be first arranged into an I ⁇ J information matrix D, and then the information matrix is subjected to Zigzag encoding after different K interleavers, and the parity bits generated after encoding are extracted to form a check vector P 1 . P 2 , . . . , P K , and then, the information matrix and the check vector after the cascading coding can be completed to form a new code word matrix, and the structure thereof can be as shown in FIG. 2 .
  • Zigzag codes are often used in conjunction with cascade structures, and Zigzag codes have very good performance in cascade structures.
  • the cascading structure provides great flexibility in the construction of channel coding and is now widely used in the field of communications.
  • the cascaded Zigzag coding usually adopts an iterative decoding method.
  • the core idea of iterative decoding is to improve the posterior probability of the decoded codeword by low correlation mutual information exchange.
  • the Max-Log-APP algorithm is a widely used sub-optimal algorithm for cascading Zigzag coding. Due to its low complexity, it has a good engineering prospect.
  • the embodiments of the present invention provide a decoding method and apparatus to solve at least the technical problem that the performance loss of the decoder in the prior art is large in the process of decoding by using the suboptimal method.
  • a decoding method including: determining mutual information adjustment parameters of a decoder in an iterative decoding process; adjusting first mutual information by mutual information adjustment parameters to obtain a second mutual Information, wherein the first mutual information is determined according to the a posteriori information obtained by the current branch after decoding and the prior information of the current branch; the second mutual information is used to determine the a priori information of the next-level branch, and according to the next The a priori information of the primary branch is iteratively decoded.
  • the preset mutual information adjustment parameter is obtained; or the adaptive mutual information adjustment parameter is determined according to the prior information of the current branch and the first mutual information.
  • an intermediate value corresponding to each element in the matrix to be decoded is obtained, wherein the intermediate value is determined according to the prior information of the current branch and the first mutual information; and the first product of each element and the corresponding intermediate value is obtained, And a second product of rows and columns of the matrix to be decoded; determining a ratio of the first product to the second product is an adaptive mutual information adjustment parameter.
  • the intermediate value of the determined element is 1, otherwise, the intermediate value is determined to be 0.
  • the product of the mutual information adjustment parameter and the first mutual information is determined as the second mutual information.
  • a priori information of the current branch is added to the second mutual information of the other branches to obtain a priori information when the current branch is in the next-level branch.
  • the a priori information at the time of the interleaving and the check information corresponding to the current branch are decoded to obtain a decoding result of the current iterative decoding, wherein the check information is divided from the matrix to be decoded.
  • the decoding result obtained by iteratively decoding the target number of times is determined as the decoding result of the matrix to be decoded; If the verification succeeds before the target number of iterations is reached, the decoding result when the verification is successful is confirmed as the decoding result of the matrix to be decoded.
  • the decoding result of the last iteration decoding is the decoding result of the matrix to be decoded.
  • a decoding apparatus including: a first determining module, configured to determine a mutual information adjustment parameter of a decoder in an iterative decoding process; and an adjustment module, configured to pass The mutual information adjustment parameter adjusts the first mutual information to obtain the second mutual information, wherein the first mutual information is determined according to the a posteriori information obtained by the current branch after decoding and the prior information of the current branch; the decoding module uses The second mutual information is used to determine a priori information of the next-level branch, and iterative decoding is performed according to the prior information of the next-level branch.
  • a storage medium comprising a stored program, wherein a device in which the storage medium is located is controlled to execute the above-described decoding method while the program is running.
  • a processor configured to execute a program, wherein the decoding method is performed when the program is running.
  • the mutual information adjustment parameter of the decoder in the iterative decoding process is determined, the first mutual information is adjusted by the mutual information adjustment parameter, the second mutual information is obtained, and the second mutual information is used to determine the next primary branch.
  • the a priori information of the road is iteratively decoded according to the prior information of the next-level branch.
  • the above solution adjusts the mutual information for the next-level branch by determining the mutual information adjustment parameter, thereby continuously improving the reliability of the output information in the process of continuous iteration and mutual information exchange, thereby solving the prior art.
  • the number of decoding iterations required to reach a certain bit error rate index will be reduced, and the overall decoding delay and resource consumption in the project are improved, and the same decoding iteration number is achieved.
  • the signal-to-noise ratio requirement for a certain bit error rate indicator is low, which improves the overall performance and enhances the error correction capability of the corresponding cascade decoding.
  • FIG. 1 is a schematic diagram of a cascading Zigzag code coding structure according to the prior art
  • FIG. 2 is a schematic diagram of a codeword matrix after cascading Zigzag coding according to the prior art
  • FIG. 3 is a flow chart of a decoding method in accordance with an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of an iterative decoder for mutual information adaptive adjustment according to an embodiment of the present invention
  • Figure 5 is a schematic illustration of a decoding device in accordance with an embodiment of the present invention.
  • an embodiment of a decoding method is provided, it being noted that the steps illustrated in the flowchart of the figures may be performed in a computer system such as a set of computer executable instructions, and, although The logical order is shown in the flowcharts, but in some cases the steps shown or described may be performed in a different order than the ones described herein.
  • the present application proposes a decoding method that can guarantee the decoding performance while using the lower complexity Max-Log-APP algorithm.
  • FIG. 3 is a flowchart of a decoding method according to an embodiment of the present invention. As shown in FIG. 3, the method includes the following steps:
  • Step S31 determining mutual information adjustment parameters of the decoder in the iterative decoding process.
  • mutual information is an information metric that can be used to characterize the amount of information contained in one random variable with respect to another random variable, that is, the uncertainty of a random variable reduced by knowing another random variable.
  • the mutual information is superimposed with the input information when performing the decoding of the next stage branch, thereby performing decoding of the next stage branch.
  • the mutual information adjustment parameter is used to adjust the mutual information used in the next and iterations after the end of each level of iteration, before the next level of iteration, to obtain new mutual information for the next level branch.
  • the value of the mutual information adjusted to the parameter may be 0 ⁇ ⁇ ⁇ 1.
  • Step S33 Adjust the first mutual information by using the mutual information adjustment parameter to obtain the second mutual information, wherein the first mutual information is determined according to the a posteriori information obtained by the current branch after decoding and the prior information of the current branch.
  • the first mutual information may be the difference between the a posteriori information obtained by the current branch after decoding and the prior information of the current branch. It should be noted that the mutual information used in the initial iteration may be Is 0.
  • the first mutual information can be determined by the following formula:
  • k the kth branch and it is the number of iterations.
  • Step S35 using the second mutual information to determine a priori information of the next-level branch, and performing iterative decoding according to the prior information of the next-level branch.
  • the channel condition transition probability after channel transmission is calculated according to the channel condition, and then the log likelihood ratio (LLR) of the channel condition transition probability is calculated, and the information bit and check are performed.
  • Bit division because the mutual information in the first iterative decoding is 0, and in the case where the information bits of the encoding end are independent and identically distributed, for the first iterative decoding, the logarithm of the channel conditional transition probability can be obtained after channel transmission.
  • the ratio (LLR) information is the a priori information for the first iteration decoding.
  • the foregoing embodiment of the present application determines the mutual information adjustment parameter of the decoder in the iterative decoding process, adjusts the first mutual information through the mutual information adjustment parameter, obtains the second mutual information, and determines the next information by using the second mutual information.
  • the a priori information of the tributary is iteratively decoded according to the prior information of the next tributary.
  • the above solution adjusts the mutual information for the next-level branch by determining the mutual information adjustment parameter, thereby continuously improving the reliability of the output information in the process of continuous iteration and mutual information exchange, thereby solving the prior art.
  • the signal-to-noise ratio required to reach a certain bit error rate index is lower, the overall performance is improved, and the corresponding cascade decoding is enhanced.
  • the error correction capability improves the performance of the decoding algorithm without increasing the complexity of the overall structure and algorithm.
  • determining mutual information adjustment parameters of the decoder in the iterative decoding process including:
  • Step S311 Acquire a preset mutual information adjustment parameter; or determine an adaptive mutual information adjustment parameter according to the prior information of the current branch and the first mutual information.
  • the first way is to obtain preset mutual information adjustment parameters.
  • the value of the mutual information adjustment parameter can be adjusted according to actual engineering experience and simulation, that is, the same mutual information adjustment is selected every iteration.
  • the second way determining the adaptive mutual information adjustment parameter according to the prior information of the current branch and the first mutual information, in the exchange process of mutual information in each iteration, the value of ⁇ changes from small to large, and finally reaches 1 and keep.
  • the second mode is actually an adaptive mutual information adjustment mode.
  • the mutual information adjustment parameter is determined according to the prior information of the current branch and the first mutual information, and can be determined according to the reliability of the iteration result.
  • the tributary is used, the mutual information adjustment parameters of the mutual information are adjusted.
  • the adaptive mutual information adjustment parameter is determined according to the a priori information of the current branch and the first mutual information, including:
  • Step S3111 Acquire an intermediate value corresponding to each element in the matrix to be decoded, where the intermediate value is determined according to the prior information of the current branch and the first mutual information.
  • Step S3113 obtaining a first product of each element and a corresponding intermediate value, and a second product of rows and columns of the matrix to be decoded.
  • step S3115 it is determined that the ratio of the first product to the second product is an adaptive mutual information adjustment parameter.
  • the Zigzag code is still taken as an example, and the adaptive mutual information adjustment parameter can be determined by the following formula:
  • ⁇ k,it is an adaptive mutual information adjustment parameter
  • ⁇ k,it (d i,j ) is the intermediate value corresponding to each element
  • I and J are two parameters of the cascaded Zigzag code, That is, the first product, IJ is the second product.
  • obtaining an intermediate value corresponding to each element in the matrix to be decoded includes:
  • the intermediate value of the determined element is 1, otherwise, the intermediate value is determined to be 0.
  • the intermediate value corresponding to each element can be determined by the following formula:
  • ⁇ k,it (d i,j ) represents the intermediate value
  • a prior information indicating the current branch corresponding to the information bit (d i,j ) sign is a symbol function, used to take the symbol of the function, when the a priori information and the first mutual information of the element are both greater than zero or less than zero
  • the intermediate value ⁇ k,it (d i,j ) is 1, and in other cases the intermediate value ⁇ k,it (d i,j ) is 0.
  • the method for determining the adaptive mutual information adjustment parameter is actually a method for determining the mutual information reliability, and the adaptive mutual information adjustment parameter is used for evaluating the reliability of the mutual information.
  • determining the second mutual information according to the mutual information adjustment parameter and the first mutual information including:
  • Step S331 determining a product of the mutual information adjustment parameter and the first mutual information as the second mutual information.
  • the second mutual information can be determined by the following formula:
  • ⁇ k,it is a mutual information adjustment parameter
  • k represents the kth branch, and it is the number of iterations.
  • determining, by using the second mutual information, the a priori information of the next-level branch includes: adding the a priori information of the current branch to the second mutual information of the other branch, to obtain A priori information when the current branch is at the next branch.
  • the initial mutual information is 0.
  • the a priori information of the interleaving is the log likelihood ratio of the path condition transition probability.
  • the a priori information of the next level of branch decoding can be determined by the following formula:
  • L CH (d) is the likelihood ratio of the channel condition transition probability.
  • L Ch represents a channel condition transition probability obtained by different check bits and information bits passing through a channel. Log likelihood ratio.
  • the a priori information of the corresponding information bits Sequence matching by the interleaver corresponding to the cascade branch is obtained. Then with the check bit letter The information is input to the decoder in common. Check the bit information here It will not be updated during the iterative decoding process, and is determined by the check bit portion corresponding to L Ch .
  • the Zigzag code corresponding to the branch is decoded by the Zigzag decoder based on the Max-Log-APP algorithm, and deinterleaved. Then, the mutual information is adjusted according to the mutual information adjustment parameter, and the adjusted mutual information is processed as the a priori information of the next-stage branch decoder by the above method.
  • iterative decoding is performed according to a priori information of the next-level branch, including:
  • Step S351 decoding the prior information of the next-stage branch after the interleaving and the verification information corresponding to the next-level branch, and obtaining the decoding result of the next-level branch, wherein the verification information is to be translated.
  • the code matrix is divided.
  • the a priori information is interleaved from the interleaver corresponding to the first-stage cascade, and similarly, the k-th cascade branch decoding is performed after the subsequent iteration. At this time, the a priori information is interleaved in accordance with the interleaver corresponding to the kth cascade.
  • step S353 the decoding result is deinterleaved.
  • Step S355 the decoding result of the deinterleaving is determined, wherein the determining is used to determine whether the decoding result of the current iterative decoding is the decoding result of the matrix to be decoded.
  • the determining step may be used to determine whether the de-interleaved decoding result is used as a decoding result of the matrix to be decoded, or whether iterative decoding of the next-stage branch is continued.
  • the decoding may be performed according to the decoding result after deinterleaving, and as an optional embodiment, the decoding of the decoded next interleaved branch is performed.
  • the code results are judged, including:
  • Step S3571 When no verification is performed, when the number of iterations of decoding reaches the target number of iterations, the decoding result obtained by iteratively decoding the target number of times is determined as the decoding result of the matrix to be decoded.
  • the number of times of the target iteration may be a preset number of iterations.
  • the number of iterations is compared with the decoding method in the prior art. When the number of target iterations is achieved, a better bit error rate can be achieved, and at the same time, the signal to noise ratio condition required to reach a certain bit error rate index is low.
  • step S3573 in the case of performing verification, if the verification is successful before the target number of iterations is reached, the decoding result when the verification is successful is confirmed as the decoding result of the matrix to be decoded.
  • the decoding method of the present application improves the decoding performance, the number of decoding iterations required to reach a certain bit error rate index is reduced under the same SNR condition as compared with the prior art decoding method. .
  • the iteration may be stopped, and the deinterleaved decoding result is taken as the decoding result of the matrix to be decoded.
  • the decoding result of the last iteration decoding is determined. Is the decoding result of the matrix to be decoded.
  • the decoding flow is illustrated by taking the decoder shown in FIG. 4 as an example.
  • the matrix to be decoded of the decoder is Y
  • k is the kth branch
  • it is the iteration. frequency:
  • the decoding is cut off, and the result is output after the hard decision; if the maximum number of decoding iterations is reached, the check still fails, and the decoding step 10 is entered.
  • the decoding is cut off, and the result is output after the hard decision; when the maximum number of decoding iterations is not reached, the decoding step 10 is entered.
  • FIG. 5 is a schematic diagram of a decoding apparatus according to an embodiment of the present invention. As shown in FIG. 5, the apparatus includes:
  • the determining module 50 is configured to determine a mutual information adjustment parameter of the decoder in the iterative decoding process.
  • the adjusting module 52 is configured to adjust the first mutual information by using the mutual information adjustment parameter to obtain the second mutual information, wherein the first mutual information is obtained according to the posterior information obtained by decoding the current branch and the prior information of the current branch. determine.
  • the decoding module 54 is configured to determine a priori information of the next-level branch by using the second mutual information, and perform iterative decoding according to the a priori information of the next-level branch.
  • the foregoing embodiment of the present application determines the mutual information adjustment parameter of the decoder in the iterative decoding process by using the determining module, and uses the adjustment module to adjust the first mutual information through the mutual information adjustment parameter to obtain the second mutual information.
  • the code module uses the second mutual information to determine the a priori information of the next-level branch, and performs iterative decoding according to the prior information of the next-level branch.
  • the above solution adjusts the mutual information for the next-level branch by determining the mutual information adjustment parameter, thereby continuously improving the reliability of the output information in the process of continuous iteration and mutual information exchange, thereby solving the prior art.
  • the number of decoding iterations required to reach a certain bit error rate index will be reduced, and the overall decoding delay and resource consumption in the project are improved, and the same decoding iteration number is achieved.
  • the signal-to-noise ratio requirement for a certain bit error rate indicator is low, which improves the overall performance and enhances the error correction capability of the corresponding cascade decoding.
  • a storage medium including a stored program, wherein a decoding method described in Embodiment 1 of the device in which the storage medium is located is controlled when the program is running.
  • a processor for executing a program wherein the decoding method described in Embodiment 1 is executed while the program is running.
  • the disclosed technical contents may be implemented in other manners.
  • the device embodiments described above are only schematic.
  • the division of the unit may be a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or may be Integrate into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, unit or module, and may be electrical or otherwise.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium.
  • the technical solution of the present invention which is essential or contributes to the prior art, or all or part of the technical solution, may be embodied in the form of a software product stored in a storage medium.
  • a number of instructions are included to cause a computer device (which may be a personal computer, server or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and the like. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Error Detection And Correction (AREA)

Abstract

本发明公开了一种译码方法和装置。其中，该方法包括：确定译码器在迭代译码过程中的互信息调整参数；通过互信息调整参数调整第一互信息，得到第二互信息，其中，第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定；使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。本发明解决了现有技术中译码器在使用次优方法译码的过程中性能损失较大的技术问题。

Description

译码方法和装置 技术领域
本发明涉及数据处理领域，具体而言，涉及一种译码方法和装置。
背景技术
Zigzag码是一种采用“之”形结构构造的奇偶校验码。级联结构的Zigzag码可通过多维度的并行级联方式进行构造，其编码结构可如图1所示。在此结构中，一个K维级联结构的Zigzag码可以有参数(I，J，K)进行描述。信息序列首先可排列为一个I×J的信息矩阵D，而后此信息矩阵经过不同的K个交织器后再进行Zigzag编码，将编码后产生的校验比特提取出来，组成校验向量P 1，P 2，…，P K，而后，完成级联编码后的信息矩阵与校验向量可组成一个新的码字矩阵，其结构可如图2所示。
然而单一的Zigzag码的最小距离为2，因此，其纠错能力较弱。通常Zigzag码往往配合级联结构进行使用，而在级联结构中，Zigzag码有着非常优异的性能。级联结构对信道编码的构造提供了极大的灵活性，现在通信领域中有着广泛的应用。
而在译码端，级联的Zigzag编码通常采用迭代译码的方式，迭代译码的核心思想即为通过低相关度的互信息交换来提升译码码字的后验概率。通常，Max-Log-APP算法所谓一种次优算法较为广泛的应用于级联的Zigzag编码中，由于其复杂度较低，具有较好的工程实现前景。
然而在另一方面，在迭代译码的级联Zigzag码中，其相对于最优的后验信息的译码算法如MAP算法等，仍然具有一定的性能损失，此部分性能损失主要表现在：
1、在同一信噪比条件下，达到某一误码率指标所需的译码迭代次数较高；
2、在相同的译码迭代次数下，达到某一误码率指标所需的信噪比条件较高。
针对现有技术中译码器在使用次优方法译码的过程中性能损失较大的问题，目前尚未提出有效的解决方案。
发明内容
本发明实施例提供了一种译码方法和装置，以至少解决现有技术中译码器在使用次优方法译码的过程中性能损失较大的技术问题。
根据本发明实施例的一个方面，提供了一种译码方法，包括：确定译码器在迭代译码过程中的互信息调整参数；通过互信息调整参数调整第一互信息，得到第二互信息，其中，第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定；使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
进一步地，获取预设的互信息调整参数；或根据当前支路的先验信息和第一互信息确定自适应互信息调整参数。
进一步地，获取待译码矩阵中每个元素对应的中间值，其中，中间值根据当前支路的先验信息和第一互信息确定；获取每个元素与对应的中间值的第一乘积，以及待译码矩阵的行和列的第二乘积；确定第一乘积与第二乘积之比为自适应互信息调整参数。
进一步地，在当前支路的先验信息和第一互信息均大于零或均小于零的情况下，确定元素的中间值为1，否则，确定中间值为0。
进一步地，确定互信息调整参数与第一互信息的乘积作为第二互信息。
进一步地，将当前支路的先验信息与其他支路的第二互信息相加，得到当前支路在下一级支路时的先验信息。
进一步地，将交织后的此次迭代时的先验信息和当前支路对应的校验信息进行译码，得到当前迭代译码的译码结果，其中，校验信息从待译码矩阵中划分得到；将译码结果进行解交织；对解交织后的译码结果进行判决，其中，判决用于确定当前迭代译码的译码结果是否为待译码矩阵的译码结果。
进一步地，在不进行校验的情况下，当迭代译码次数达到目标迭代次数时，确定目标次数迭代译码得到的译码结果为待译码矩阵的译码结果；在进行校验的情况下，如果在达到目标迭代次数之前校验成功，则确认校验成功时的译码结果为待译码矩阵的译码结果。
进一步地，在进行校验的情况下，如果当达到目标迭代次数时未校验成功的情况下，则确定最后一次迭代译码的译码结果为待译码矩阵的译码结果。
根据本发明实施例的另一方面，还提供了一种译码装置，包括：第一确定模块，用于确定译码器在迭代译码过程中的互信息调整参数；调整模块，用于通过互信息调整参数调整第一互信息，得到第二互信息，其中，第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定；译码模块，用于使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
根据本发明实施例的另一方面，还提供了一种存储介质，存储介质包括存储的程序，其中，在程序运行时控制存储介质所在设备执行上述的译码方法。
根据本发明实施例的另一方面，还提供了一种处理器，其特征在于，处理器用于运行程序，其中，程序运行时执行上述的译码方法。
在本发明实施例中，确定译码器在迭代译码过程中的互信息调整参数，通过互信息调整参数调整第一互信息，得到第二互信息，使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。上述方案通过确定互信息调整参数来调整用于下一级支路的互信息，从而在不断的迭代与互信息交换的过程中，不断提升其输出信息的可靠度，进而解决了现有技术中译码器在使用次优方法译码的过程中性能损失较大的技术问题。使得在同一信噪比条件下，达到某一误码率指标所需的译码迭代次数将减少，提高了工程中的整体译码延时与资源消耗，在相同的译码迭代次数下，达到某一误码率指标所需的信噪比条件较低，提高了整体性能，加强了相应的级联译码的纠错能力。
附图说明
此处所说明的附图用来提供对本发明的进一步理解，构成本申请的一部分，本发明的示意性实施例及其说明用于解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据现有技术的一种级联Zigzag码编码结构示意图；
图2是根据现有技术的一种完成级联Zigzag编码后的码字矩阵示意图；
图3是根据本发明实施例的译码方法的流程图；
图4是根据本发明实施例的一种互信息自适应调整的迭代译码器的结构示意图；以及
图5是根据本发明实施例的译码装置的示意图。
具体实施方式
为了使本技术领域的人员更好地理解本发明方案，下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分的实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都应当属于本发明保护的范围。
需要说明的是，本发明的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换，以便这里描述的本发明的实施例能够以除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
实施例1
根据本发明实施例，提供了一种译码方法的实施例，需要说明的是，在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行，并且，虽然在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
基于级联Zigzag编码的特点，其具有较强的纠错性能，然而，部分最优算法的复杂程度较高，在这样的情况下，可以使用具有较低复杂度的Max-Log-APP算法，使得实现时的资源消耗较低，但其性能相较于使用最优算法译码的级联Zigzag编码来说较差。因此本申请提出一种译码方法，能在使用较低复杂度的Max-Log-APP算法的同时，保证其译码性能。
图3是根据本发明实施例的译码方法的流程图，如图3所示，该方法包括如下步骤：
步骤S31，确定译码器在迭代译码过程中的互信息调整参数。
具体的，互信息是一种信息度量，可以用于表征一个随机变量中包含的关于另一个随机变量的信息量，也即一个随机变量由于已知另一个随机变量而减少的不肯定性。在译码的过程中，互信息会在进行下一级支路译码时与输入信息叠加，从而进行下一级支路的译码。
上述互信息调整参数用于在每一级迭代结束之后，进行下一级迭代之前，对下一及迭代所用的互信息进行调整，得到用于下一级支路的新的互信息。互信息调整成参数的取值范围可以是是0≤α≤1。
步骤S33，通过互信息调整参数调整第一互信息，得到第二互信息，其中，第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定。
在上述步骤中，第一互信息可以为当前支路在译码后所得的后验信息与当前支路的先验信息之差，需要说明的是，在初次迭代过程中所使用的互信息可以为0。
在一种可选的实施例中，可以通过如下公式确定第一互信息：
Figure PCTCN2018079726-appb-000001
其中，
Figure PCTCN2018079726-appb-000002
为第一互信息，
Figure PCTCN2018079726-appb-000003
为当前支路在译码后所得的后验信息，
Figure PCTCN2018079726-appb-000004
为当前支路的先验信息，k表示第k条支路，it为表示迭代次数。
步骤S35，使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
此处需要说明的是，对待译码矩阵，根据信道条件计算经信道传输后的信道条件转移概率，而后计算该信道条件转移概率的对数似然比(LLR)，并进行信息比特和校验比特的划分，由于首次迭代译码时的互信息为0，在编码端信息比特为独立同分布的情况下，对于首次迭代译码，经信道传输后即可得到信道条件转移概率的对数似然比(LLR)信息即为首次迭代译码的先验信息。
在进行非首次迭代译码时，则需要使用第二互信息确定当前支路的先验信息，并根据当前支路的先验信息进行迭代译码。
由上可知，本申请上述实施例确定译码器在迭代译码过程中的互信息调整参数，通过互信息调整参数调整第一互信息，得到第二互信息，使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。上述方案通过确定互信息调整参数来调整用于下一级支路的互信息，从而在不断的迭代与互信息交换的过程中，不断提升其输出信息的可靠度，进而解决了现有技术中译码器在使用次优方法译码的过程中性能损失较大的技术问题，使得在同一信噪比条件下，达到某一误码率指标所需的译码迭代次数将减少，提高了工程中的整体译码延时与资源消耗，在相同的译码迭代次数下，达到某一误码率指标所需的信噪比条件较低，提高了整体性能，加强了相应的级联译码的纠错能力，在不增加整体结构及算法的复杂程度的基础上提高译码算法的性能。
可选的，根据本申请上述实施例，确定译码器在迭代译码过程中的互信息调整参数，包括：
步骤S311，获取预设的互信息调整参数；或根据当前支路的先验信息和第一互信息确定自适应互信息调整参数。
具体的，上述方案提出了两种获取互信息调整参数的方式，下面依次进行描述：
第一种方式：获取预设的互信息调整参数，在这种方式中，互信息调整参数的取值可根据实际工程经验与仿真进行调整，也即每次迭代时均选取相同的互信息调整参 数α，α＜1。
第二种方式：根据当前支路的先验信息和第一互信息确定自适应互信息调整参数，每次迭代中在互信息的交换过程中，α的取值由小变大，并最终达到1并保持。
第二种方式实际为一种自适应的互信息调整方式，根据当前支路的先验信息与第一互信息来确定互信息调整参数，能够根据此次迭代结果的可靠性来确定进行下一级支路时，调整互信息的互信息调整参数。
可选的，根据本申请上述实施例，根据当前支路的先验信息和第一互信息确定自适应互信息调整参数，包括：
步骤S3111，获取待译码矩阵中每个元素对应的中间值，其中，中间值根据当前支路的先验信息和第一互信息确定。
步骤S3113，获取每个元素与对应的中间值的第一乘积，以及待译码矩阵的行和列的第二乘积。
步骤S3115，确定第一乘积与第二乘积之比为自适应互信息调整参数。
在一种可选的实施例中，仍以Zigzag码为例，可以通过如下公式确定自适应互信息调整参数：
Figure PCTCN2018079726-appb-000005
其中，α k，it为自适应互信息调整参数，β k，it(d i，j)为每个元素对应的中间值，I和J为级联Zigzag码的两个参数，
Figure PCTCN2018079726-appb-000006
即为第一乘积，IJ即为第二乘积。
可选的，根据本申请上述实施例，获取待译码矩阵中每个元素对应的中间值，包括：
在当前支路的先验信息和第一互信息均大于零或均小于零的情况下，确定元素的中间值为1，否则，确定中间值为0。
在一种可选的实施例中，可以通过如下公式确定每个元素对应的中间值：
Figure PCTCN2018079726-appb-000007
其中，β k，it(d i，j)表示中间值，
Figure PCTCN2018079726-appb-000008
表示信息比特(d i，j)对应的当前支路的先验信息，sign为符号函数，用于取函数的符号，当元素的先验信息与第一互信息均大于零或均小于零时，即符号相同时，中间值β k，it(d i，j)为1，在其他情况下中间值β k，it(d i，j)为0。
结合上述步骤可以知晓，上述确定自适应互信息调整参数的方式实际是一种确定互信息可靠性的方式，自适应互信息调整参数用于评估互信息的可靠性。当前支路的先验信息和第一互信息的符号相同的元素越多，得到的自适应互信息调整参越大，也即互信息的可靠性越高。
可选的，根据本申请上述实施例，根据互信息调整参数和第一互信息确定第二互信息，包括：
步骤S331，确定互信息调整参数与第一互信息的乘积作为第二互信息。
在一种可选的实施例中，可以通过如下公式确定第二互信息：
Figure PCTCN2018079726-appb-000009
其中，
Figure PCTCN2018079726-appb-000010
为第二互信息，α k，it为互信息调整参数，
Figure PCTCN2018079726-appb-000011
为第一互信息，k表示第k条支路，it为表示迭代次数。
可选的，根据本申请上述实施例，使用第二互信息确定下一级支路的先验信息，包括：将当前支路的先验信息与其他支路的第二互信息相加，得到当前支路在下一级支路时的先验信息。
需要说明的是，初始互信息为0，对于首次迭代译码，进行交织的先验信息即为道条件转移概率的对数似然比。对于非首次迭代译码，在一种可选的实施例中，可以通过如下公式确定下一级支路译码时的先验信息：
Figure PCTCN2018079726-appb-000012
其中，
Figure PCTCN2018079726-appb-000013
为当前支路所需获取的先验信息，L CH(d)为信道条件转移概率的似然比，
Figure PCTCN2018079726-appb-000014
为其他支路的第二互信息。
在一种可选的实施例中，以基于Max-Log-APP算法的迭代译码作为示例进行说明。图4是根据本发明实施例的一种互信息自适应调整的迭代译码器的结构示意图，结合图4所示，L Ch表示不同校验比特和信息比特经过信道后所得的信道条件转移概率的 对数似然比。
首先，所对应信息比特的先验信息
Figure PCTCN2018079726-appb-000015
将按级联支路所对应的交织器进行顺序匹配得到
Figure PCTCN2018079726-appb-000016
然后将与校验比特信
Figure PCTCN2018079726-appb-000017
信息共同输入至译码器。此处校验比特的信息
Figure PCTCN2018079726-appb-000018
在迭代译码的过程中均不会被更新，由L Ch中所对应的校验比特部分决定。经过基于Max-Log-APP算法的Zigzag译码器进行支路所对应的Zigzag码译码，并进行解交织得到
Figure PCTCN2018079726-appb-000019
再根据互信息调整参数进行互信息的调整，而调整后的互信息将通过如上方法处理后作为下一级支路译码器的先验信息。
可选的，根据本申请上述实施例，根据下一级支路的先验信息进行迭代译码，包括：
步骤S351，将交织后的下一级支路的先验信息和下一级支路对应的校验信息进行译码，得到下一级支路的译码结果，其中，校验信息从待译码矩阵中划分得到。
在上述步骤中，在进行首次迭代时，从第1级级联所对应的交织器对先验信息进行交织，同理，在进行之后的第it次迭代，第k级级联支路译码时，依次按照第k级级联所对应的交织器对先验信息进行交织。
步骤S353，将译码结果进行解交织。
步骤S355，对解交织后的译码结果进行判决，其中，判决用于确定当前迭代译码的译码结果是否为待译码矩阵的译码结果。
具体的，上述判决步骤可以用于确定将此次解交织后的译码结果作为待译码矩阵的译码结果，还是继续进行下一级支路的迭代译码。作为一种可选的实施例，可以根据对解交织后的译码结果进行校验，来进行判决，作为一种可选的实施例，对解交织后的下一级支路译码的译码结果进行判决，包括：
步骤S3571，在不进行校验的情况下，当迭代译码次数达到目标迭代次数时，确定目标次数迭代译码得到的译码结果为待译码矩阵的译码结果。
具体的，上述目标迭代次数可以是预先设定的迭代次数，采用本申请的译码方法，在设定目标迭代次数的情况下，与现有技术中的译码方法相比，当迭代次数达到目标迭代次数时，能够达到较好的误码率，同时，达到某一误码率指标所需的信噪比条件较低。
步骤S3573，在进行校验的情况下，如果在达到目标迭代次数之前校验成功，则确认校验成功时的译码结果为待译码矩阵的译码结果。
由于本申请上述译码方法提高了译码性能，因此与现有技术中的译码方法相比，在同一信噪比条件下，达到某一误码率指标所需的译码迭代次数将减少。当在达到目标迭代次数之前就校验成功时，可以停止迭代，将解交织后的译码结果作为待译码矩阵的译码结果。
可选的，根据本申请上述实施例，在进行校验的情况下，在进行校验的情况下，如果当达到目标迭代次数时未校验成功，则确定最后一次迭代译码的译码结果为待译码矩阵的译码结果。
下面以图4中示出的译码器为示例，对其译码流程进行说明，在该示例中，译码器的待译码矩阵为Y，k表示第k条支路，it为表示迭代次数：
1)根据待译码矩阵Y，进行相应的对数似然比(LLR)计算，并划分得到信息比特和校验比特，可得根据信道传输后所得的[L Ch(d)，L Ch(P 1)，…，L Ch(P K)]。此处可以设置最大译码迭代次数。
2)获得初次译码时的信息比特先验信息，若假设原始信息比特为独立同分布的，则首次译码先验信息的LLR为
Figure PCTCN2018079726-appb-000020
初始化译码级联计数器与迭代计数器，均为k＝1，it＝1。
3)
Figure PCTCN2018079726-appb-000021
经过第1级级联所对应的交织器得到交织后的结果
Figure PCTCN2018079726-appb-000022
4)利用交织后的结果
Figure PCTCN2018079726-appb-000023
联合第k级级联所对应的校验比特信息
Figure PCTCN2018079726-appb-000024
进行Max-Log-APP译码，其中，
Figure PCTCN2018079726-appb-000025
从L Ch(P k)中分离得到。
5)译码后的输出
Figure PCTCN2018079726-appb-000026
经过相应的解交织器得到
Figure PCTCN2018079726-appb-000027
6)进行译码所得的互信息计算，互信息
Figure PCTCN2018079726-appb-000028
7)根据互信息调整参数进行互信息的调整，得到调整后的互信息
Figure PCTCN2018079726-appb-000029
也即用于进行下一级支路的互信息。
8)译码级联计数器与迭代计数器进行更新，k＝k+1，当k＝K(大写K表示总的支路数量)时，则k＝1，it＝it+1。此时，针对第1路级联第1次译码，更新为k＝2，it＝1(设K＞1)。
9)对译码结果进行判决，此处可有进行校验或不进行校验两种选择。
若进行检验，则校验通过且未达到最大译码迭代次数时，译码截止，硬判决后输出结果；若达到最大译码迭代次数时校验仍不通过，进入译码步骤10。
若不进行校验，则达到最大译码迭代次数，译码截止，硬判决后输出结果；在未达到最大译码迭代次数时，进入译码步骤10。
10)通过
Figure PCTCN2018079726-appb-000030
公式，计算用于下一级支路的先验信息，而后返回步骤3，进行迭代译码。
实施例2
根据本发明实施例，提供了一种译码装置的实施例，图5是根据本发明实施例的译码装置的示意图，如图5所示，该装置包括：
确定模块50，用于确定译码器在迭代译码过程中的互信息调整参数。
调整模块52，用于通过互信息调整参数调整第一互信息，得到第二互信息，其中，第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定。
译码模块54，用于使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
由上可知，本申请上述实施例通过确定模块确定译码器在迭代译码过程中的互信息调整参数，采用调整模块通过互信息调整参数调整第一互信息，得到第二互信息，通过译码模块使用第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。上述方案通过确定互信息调整参数来调整用于下一级支路的互信息，从而在不断的迭代与互信息交换的过程中，不断提升其输出信息的可靠度，进而解决了现有技术中译码器在使用次优方法译码的过程中性能损失较大的技术问题。使得在同一信噪比条件下，达到某一误码率指标所需的译码迭代次数将减少，提高了工程中的整体译码延时与资源消耗，在相同的译码迭代次数下，达到某一误码率指标所需的信噪比条件较低，提高了整体性能，加强了相应的级联译码的纠错能力。
实施例3
根据本发明实施例，提供了一种存储介质，存储介质包括存储的程序，其中，在所述程序运行时控制所述存储介质所在设备实施例1中所述的译码方法。
实施例4
根据本发明实施例，提供了一种处理器，处理器用于运行程序，其中，所述程序运行时执行实施例1中所述的译码方法。
上述本发明实施例序号仅仅为了描述，不代表实施例的优劣。
在本发明的上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述的部分，可以参见其他实施例的相关描述。
在本申请所提供的几个实施例中，应该理解到，所揭露的技术内容，可通过其它的方式实现。其中，以上所描述的装置实施例仅仅是示意性的，例如所述单元的划分，可以为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，单元或模块的间接耦合或通信连接，可以是电性或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可为个人计算机、服务器或者网络设备等)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述仅是本发明的优选实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也应视为本发明的保护范围。

Claims (12)

  1. 一种译码方法，其特征在于，包括：
    确定译码器在迭代译码过程中的互信息调整参数；
    通过所述互信息调整参数调整第一互信息，得到第二互信息，其中，所述第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定；
    使用所述第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
  2. 根据权利要求1所述的方法，其特征在于，确定译码器在迭代译码过程中的互信息调整参数，包括：
    获取预设的互信息调整参数；或
    根据所述当前支路的先验信息和所述第一互信息确定自适应互信息调整参数。
  3. 根据权利要求2所述的方法，其特征在于，根据所述当前支路的先验信息和所述第一互信息确定自适应互信息调整参数，包括：
    获取待译码矩阵中每个元素对应的中间值，其中，所述中间值根据所述当前支路的先验信息和所述第一互信息确定；
    获取所述每个元素与对应的中间值的第一乘积，以及所述待译码矩阵的行和列的第二乘积；
    确定所述第一乘积与所述第二乘积之比为所述自适应互信息调整参数。
  4. 根据权利要求3所述的方法，其特征在于，获取待译码矩阵中每个元素对应的中间值，包括：
    在所述当前支路的先验信息和所述第一互信息均大于零或均小于零的情况下，确定所述元素的中间值为1，否则，确定所述中间值为0。
  5. 根据权利要求1至4中任意一项所述的方法，其特征在于，根据所述互信息调整参数和第一互信息确定第二互信息，包括：
    确定所述互信息调整参数与所述第一互信息的乘积作为所述第二互信息。
  6. 根据权利要求5所述的方法，其特征在于，使用所述第二互信息确定下一级支路的先验信息，包括：
    将当前支路的先验信息与其他支路的第二互信息相加，得到当前支路在下一级支路时的先验信息。
  7. 根据权利要求1所述的方法，其特征在于，根据下一级支路的先验信息进行迭代译码，包括：
    将交织后的所述下一级支路的先验信息和下一级支路对应的校验信息进行译码，得到下一级支路的译码结果，其中，所述校验信息从待译码矩阵中划分得到；
    将所述译码结果进行解交织；
    对解交织后的所述译码结果进行判决，其中，所述判决用于确定当前迭代译码的译码结果是否为所述待译码矩阵的译码结果。
  8. 根据权利要求7所述的方法，其特征在于，对解交织后的所述下一级支路译码的译码结果进行判决，包括：
    在不进行校验的情况下，当迭代译码次数达到目标迭代次数时，确定目标次数迭代译码得到的译码结果为所述待译码矩阵的译码结果；
    在进行校验的情况下，如果在达到所述目标迭代次数之前校验成功，则确认校验成功时的译码结果为所述待译码矩阵的译码结果。
  9. 根据权利要求8所述的方法，其特征在于，在进行校验的情况下，如果当达到所述目标迭代次数时未校验成功，则确定最后一次迭代译码的译码结果为所述待译码矩阵的译码结果。
  10. 一种译码装置，其特征在于，包括：
    第一确定模块，用于确定译码器在迭代译码过程中的互信息调整参数；
    调整模块，用于通过所述互信息调整参数调整第一互信息，得到第二互信息，其中，所述第一互信息根据当前支路在译码后所得的后验信息和当前支路的先验信息确定；
    译码模块，用于使用所述第二互信息确定下一级支路的先验信息，并根据下一级支路的先验信息进行迭代译码。
  11. 一种存储介质，其特征在于，所述存储介质包括存储的程序，其中，在所述程序运行时控制所述存储介质所在设备执行权利要求1至9中任意一项所述的译码方法。
  12. 一种处理器，其特征在于，所述处理器用于运行程序，其中，所述程序运行时执行权利要求1至9中任意一项所述的译码方法。
PCT/CN2018/079726 2017-10-17 2018-03-21 译码方法和装置 WO2019075988A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710980926.5 2017-10-17
CN201710980926.5A CN109672498B (zh) 2017-10-17 2017-10-17 译码方法和装置

Publications (1)

Publication Number Publication Date
WO2019075988A1 true WO2019075988A1 (zh) 2019-04-25

Family

ID=66142582

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/079726 WO2019075988A1 (zh) 2017-10-17 2018-03-21 译码方法和装置

Country Status (2)

Country Link
CN (1) CN109672498B (zh)
WO (1) WO2019075988A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110752852A (zh) * 2019-09-26 2020-02-04 中科睿微(宁波)电子技术有限公司 极化码的bp译码方法、装置、系统、设备及存储介质
CN112332870A (zh) * 2020-11-12 2021-02-05 Oppo广东移动通信有限公司 译码方法、装置、通信芯片及网络设备
CN114553370A (zh) * 2022-01-19 2022-05-27 北京理工大学 译码方法、译码器、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060015789A1 (en) * 2004-06-16 2006-01-19 Samsung Electronics Co., Ltd Apparatus and method for encoding/decoding using Concatenated Zigzag code in mobile communication system
CN101299613A (zh) * 2007-04-30 2008-11-05 华为技术有限公司 ZigZag码译码方法及其装置
CN101345607A (zh) * 2008-08-14 2009-01-14 西安电子科技大学 多维交叉并行级联单奇偶校验码的编、译码方法
CN102957438A (zh) * 2011-08-25 2013-03-06 富士通株式会社 一种Turbo译码器和译码方法
CN103746772A (zh) * 2013-12-27 2014-04-23 河海大学 Ldpc编码调制系统的解调器输出软信息的优化方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8132065B2 (en) * 2006-12-21 2012-03-06 Industrial Technology Research Institute Hybrid sphere decoding method and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060015789A1 (en) * 2004-06-16 2006-01-19 Samsung Electronics Co., Ltd Apparatus and method for encoding/decoding using Concatenated Zigzag code in mobile communication system
CN101299613A (zh) * 2007-04-30 2008-11-05 华为技术有限公司 ZigZag码译码方法及其装置
CN101345607A (zh) * 2008-08-14 2009-01-14 西安电子科技大学 多维交叉并行级联单奇偶校验码的编、译码方法
CN102957438A (zh) * 2011-08-25 2013-03-06 富士通株式会社 一种Turbo译码器和译码方法
CN103746772A (zh) * 2013-12-27 2014-04-23 河海大学 Ldpc编码调制系统的解调器输出软信息的优化方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110752852A (zh) * 2019-09-26 2020-02-04 中科睿微(宁波)电子技术有限公司 极化码的bp译码方法、装置、系统、设备及存储介质
CN110752852B (zh) * 2019-09-26 2023-10-03 浙江科睿微电子技术有限公司 极化码的bp译码方法、装置、系统、设备及存储介质
CN112332870A (zh) * 2020-11-12 2021-02-05 Oppo广东移动通信有限公司 译码方法、装置、通信芯片及网络设备
CN114553370A (zh) * 2022-01-19 2022-05-27 北京理工大学 译码方法、译码器、电子设备及存储介质
CN114553370B (zh) * 2022-01-19 2024-03-15 北京理工大学 译码方法、译码器、电子设备及存储介质

Also Published As

Publication number Publication date
CN109672498A (zh) 2019-04-23
CN109672498B (zh) 2021-09-10

Similar Documents

Publication Publication Date Title
USRE47936E1 (en) Decoding method and decoding device for polar code cascaded with cyclic redundancy check
RU2677589C2 (ru) Способ и устройство генерирования гибридного полярного кода
TWI594583B (zh) 硬決定輸入之一般化低密度同位檢查軟解碼
EP3562071A1 (en) Polar code encoding and decoding method and device
US10797728B1 (en) Systems and methods for diversity bit-flipping decoding of low-density parity-check codes
CN110492974B (zh) 一种并行的极化码译码方法及装置
WO2019075988A1 (zh) 译码方法和装置
CN110661533B (zh) 优化译码器存储极化码译码性能的方法
CN110233628B (zh) 极化码的自适应置信传播列表译码方法
CN111277277B (zh) 一种减少极化码连续对消表译码算法译码延迟的方法及装置
CN110022159A (zh) 一种快速收敛的ldpc码译码算法
Ercan et al. Simplified dynamic SC-flip polar decoding
Arli et al. A survey on belief propagation decoding of polar codes
CN112332864A (zh) 一种自适应有序移动剪枝列表的极化码译码方法及系统
CN110730007B (zh) 极化码sscl译码路径分裂方法、存储介质和处理器
CN112491422A (zh) 基于高斯优化的比特翻转串行消除列表译码方法和系统
CN112929035B (zh) 一种非二进制极化码的编码与译码方法
CN109831216A (zh) 基于G-Matrix校验的极化码SBP译码器
CN110190857B (zh) 一种crc辅助校验极化码译码方法和智能终端
CN116614142A (zh) 一种基于bpl译码和osd译码的联合译码方法
CN110808740B (zh) 删节信道下基于极化码的低复杂度译码方法
Jin et al. Towards maximum likelihood soft decision decoding of the (255,239) Reed Solomon code
US20210288674A1 (en) Soft-input soft-output decoding of block codes
WO2020213152A1 (ja) 整列処理装置、選別システム、整列処理方法、及び非一時的なコンピュータ可読媒体
CN108173550A (zh) 一种适用于几乎所有nb－ldpc译码方法的通用简化方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18869282

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 24.09.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18869282

Country of ref document: EP

Kind code of ref document: A1