Abstract

In this paper, a weight method with using a reduced lookup table is developed to decode the three possible errors in (23, 12, 7) Golay code. The reduced lookup table consists of syndrome patterns and corresponding error patterns which only have one and two errors occurred in the message block of the received codeword. The useful proposed algorithm makes use of the properties of cyclic codes, weight of syndrome, and reduced lookup table. It often results in a significant reduction in the memory requirements comparing to the traditional lookup table. This weight algorithm together with a reduced table lookup makes a fast and low complexity of the table lookup decoding algorithm. Moreover, a computer simulation shows that such a novel method is a much faster algorithm in software than the traditional full lookup table searching algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.