TY - GEN
T1 - A 30K 2.5Gb/s decision-eased soft RS (224, 216) decoder for wireless systems
AU - Lin, Yi Min
AU - Huang, Yu Chun
AU - Yang, Chi Heng
AU - Chang, Hsie-Chia
PY - 2011/12/1
Y1 - 2011/12/1
N2 - In this paper 1, an area efficient (224, 216; 4) soft Reed-Solomon (RS) decoder is provided for wireless systems. According to the Chase-II algorithm, 3 least reliable positions (LRPs) are chosen, and the decoded codeword is determined from 8 (=2 3) candidate codewords, leading to 0.5 dB coding gain at 10 -5 BER over the hard RS decoder. Instead of using 8 hard decoders to generate all candidate codewords, our design utilizes only one by reschedule the decoding scheme among all candidate codewords. Therefore, the hardware complexity is significantly reduced. Moreover, the complex decision making unit is eased by using Hamming distance calculation to replace Euclidean distance calculation among all candidate codewords with negligible performance degradation. As compared to low complexity Chase (LCC) soft decoder, our proposed decoder can save around 59.8% complexity. According to the post-layout simulations, the proposed design can achieve 2.5 Gb/s throughput with gate count of 30 K, which is less than one half the normalized area of the hard RS decoder.
AB - In this paper 1, an area efficient (224, 216; 4) soft Reed-Solomon (RS) decoder is provided for wireless systems. According to the Chase-II algorithm, 3 least reliable positions (LRPs) are chosen, and the decoded codeword is determined from 8 (=2 3) candidate codewords, leading to 0.5 dB coding gain at 10 -5 BER over the hard RS decoder. Instead of using 8 hard decoders to generate all candidate codewords, our design utilizes only one by reschedule the decoding scheme among all candidate codewords. Therefore, the hardware complexity is significantly reduced. Moreover, the complex decision making unit is eased by using Hamming distance calculation to replace Euclidean distance calculation among all candidate codewords with negligible performance degradation. As compared to low complexity Chase (LCC) soft decoder, our proposed decoder can save around 59.8% complexity. According to the post-layout simulations, the proposed design can achieve 2.5 Gb/s throughput with gate count of 30 K, which is less than one half the normalized area of the hard RS decoder.
KW - Error correction coding
KW - Reed-Solomon (RS) codes
KW - Soft-decidsion
KW - Wireless system
UR - http://www.scopus.com/inward/record.url?scp=84863064966&partnerID=8YFLogxK
U2 - 10.1109/ISICir.2011.6131903
DO - 10.1109/ISICir.2011.6131903
M3 - Conference contribution
AN - SCOPUS:84863064966
SN - 9781612848648
T3 - 2011 International Symposium on Integrated Circuits, ISIC 2011
SP - 164
EP - 167
BT - 2011 International Symposium on Integrated Circuits, ISIC 2011
T2 - 2011 International Symposium on Integrated Circuits, ISIC 2011
Y2 - 12 December 2011 through 14 December 2011
ER -