Fast Inversion of Hankel Systems and E cient BCH 1 Decoding
نویسنده
چکیده
| BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capability of the BCH code.
منابع مشابه
Levinson-Durbin Algorithm Used for Fast BCH Decoding
BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm, which requires about O(t) computational steps, where t is the error-correction capability of the BCH code. The evaluation of the errorlocator polynomial may also be computed using fast inversion techniques for Hankel matrices. It will be shown that only O(lt)...
متن کاملCalculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms
The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...
متن کاملEecient Two-parameter Hankel Transforms in Adaptive Optics System Evaluations
We derive e cient approaches for two-parameter Hankel transforms. Such transforms arise, for example, in covariance matrix computations for performance modeling and evaluation of adaptive optics (AO) systems. Fast transforms are highly desirable since the parameter space for performance evaluation and optimization is large. They may be also applicable in real-time control algorithms for future ...
متن کاملNew Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel
Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which...
متن کاملBlock Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders
In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicte...
متن کامل