PROJECT TITLE :
An Efficient Single and Double-Adjacent Error Correcting Parallel Decoder for the (24,12) Extended Golay Code - 2016
Memories that operate in harsh environments, like for instance space, suffer a important variety of errors. The error correction codes (ECCs) are routinely used to make sure that those errors do not cause information corruption. However, ECCs introduce overheads each in terms of memory bits and decoding time that limit speed. In particular, this is a problem for applications that require sturdy error correction capabilities. A number of recent works have proposed advanced ECCs, like orthogonal Latin squares or distinction set codes that may be decoded with comparatively low delay. The price acquired the low decoding time is that in most cases, the codes aren't optimal in terms of memory overhead and need a lot of parity check bits. On the other hand, codes like the (twenty four,12) Golay code that minimize the number of parity check bits have a more complex decoding. A compromise resolution has been recently explored for Bose-Chaudhuri-Hocquenghem codes. The plan is to implement a quick parallel decoder to correct the foremost common error patterns (single and double adjacent) and use a slower serial decoder for the rest of the patterns. In this transient, it is shown that the identical theme can be efficiently implemented for the (twenty four,12) Golay code. In this case, the properties of the Golay code will be exploited to implement a parallel decoder that corrects single- and double-adjacent errors that is faster and simpler than one-error correction decoder. The evaluation results using a sixty five-nm library show significant reductions in space, power, and delay compared with the traditional decoder that may correct single and double-adjacent errors. Moreover, the proposed decoder is additionally able to correct some triple-adjacent errors, so covering the foremost common error patterns.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here