A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
Published in IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences • Jan 1, 2005
NobleIDNI5P72W86R16S19
Authors:
C.-L. CHR
Abstract
A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decode...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!