منابع مشابه
A Simple Step-by-Step Decoding of Binary BCH Codes
In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-ChaudhuriHocquenghem (BCH) codes based on logical analysis. Compared to the conventional stepby-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication. key words: BCH code,...
متن کاملNew Techniques for Decoding the BCH Error
The coeecients of a polynomial of a degree n can be expressed via the power sums of its zeros by means of a polynomial equation known as the key equation for decoding the BCH error-correcting codes. Berlekamp's algorithm of 1968 solves this equation by using order of n 2 operations in a xed eld. Several algorithms of 1975-1980 rely on the extended Euclidean algorithm and computing Pad e approxi...
متن کاملConstruction and decoding of BCH Codes
BCfi wdes over arbitrary finite ~~~nirnut:!tiv~ rings with identity arc drip& in LCF~S of their locator vector, The derivation is hased on the factorization of .I-’ -I over the unit ring of an ~tppropr~lt~ extension of the finite rin g. We prcscnt an ~~~ci~nt,d~~iu~ procedure, based on the modified Berlekamp Massey ;li~~~rithrn. for that codes. The code construction and the decoding proccdurcs ...
متن کاملShift - Register Synthesis and BCH Decoding l
It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shit-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insig...
متن کاملErrors-and-erasures Decoding of Bch Codes
We give a Grr obner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modiied syndrome polynomial. The decoding problem is viewed as an instance of a more general interpolation problem. Our algorithm has the same computational complexity as the Berlekamp{Massey algorithm but is more eecient in hardware.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1995
ISSN: 0090-6778
DOI: 10.1109/26.403765