Abstract:
Embodiments of the present invention provide a decoding method and a decoding device. The method includes: performing iterative decoding on a multidimensional code to obtain incorrigible code words; determining locations of error bits in the incorrigible code words that are obtained by performing the iterative decoding on the multidimensional code, where the locations of error bits in the incorrigible code words are multidimensional coordinate locations of the error bits in the multidimensional code; correcting error bits of a part of the incorrigible code words in the multidimensional code according to the determined locations of the error bits in the incorrigible code words; and after the error bits of a part of the incorrigible code words in the multidimensional code are corrected, performing iterative decoding on the multidimensional code The embodiments of the present invention are applicable to the field of decoding technologies.
Abstract:
The present invention relates to an interleaving and de-interleaving method, an interleaver and a de-interleaver. The interleaving method includes: receiving N×M frames of data, and sequentially storing, with each frame as a unit, the N×M frames of data in storage space indicated by N×M addresses of a first storage unit; transferring the data stored in the storage space indicated by an ((X−1)×M+Y+1)th address of the first storage unit to the storage space indicated by a (Y×N+X)th address of a second storage unit; and according to an address sequence, outputting the data stored in the space indicated by the N×M addresses of the second storage unit frame by frame. The interleaving and de-interleaving solutions of the present invention have low implementation complexity, and high capacity of correcting a burst bit error.
Abstract:
Embodiments of the present application relate to a method for implementing Turbo equalization compensation. The equalizer divides a first data block into n data segments, where D bits in two adjacent data segments in the n data segments overlap, performs recursive processing on each data segment in the n data segments, before the recursive processing, merges the n data segments to obtain a second data block; and performs iterative decoding on the second data block, to output a third data block, where data lengths of the first data block, the second data block, and the third data block are all 1/T of a code length of a LDPC convolutional code.