Reed-Solomon (rs) code is one of the most widely used error control codes. The decodingalgorithms of rs code can be briefly divided into hard-decision decoding (HDD) and algebraic soft-decision decoding (ASD). Howeve...
详细信息
Reed-Solomon (rs) code is one of the most widely used error control codes. The decodingalgorithms of rs code can be briefly divided into hard-decision decoding (HDD) and algebraic soft-decision decoding (ASD). However, traditional rs decoding algorithms perform unsatisfactorily over bursty channel. Therefore, many modified rs decoding algorithms utilised in bursty channel decoding were proposed. However all of them are HDD and the computation is costly. In this study, the authors propose an ASD algorithm which can be utilised both in additive white Gaussian noise channel and bursty channel. In order to be utilised in multiple channel, the proposed algorithm combines original HDD-based low-complexity chase (HDD-LCC) and burst-error correcting (BC) together. What's more, BC is also modified by adding in the mechanism of pre-judgement to reduce the iterations of BC. The modified algorithm can give a coding gain reaching up to 0.1268 and 1.33dB compared with BC and HDD-LCC, respectively when symbol error rate (SER) is 10(-4) in bursty channel. The proposed rs decoder is implemented and synthesised with Semiconductor Manufacturing International Corporation 0.13-m CMOS technology library. The results show the proposed decoder can operate at 200MHz to achieve the throughput of 1.673Gbps.
暂无评论