Author : Remalli Dinesh 1
Date of Publication :7th March 2015
Abstract: In contrast to all existing ASD soft-decision decoding concepts for RS codes, only low-complexity chase algorithm can attain improved tradeoff in performance-complexity with significant coding gain on HDD with polynomial complexity. LCC decoding scheme utilized 2 ? test vectors having less computational complexity in addition to enhanced coding gain. Instead of short RS codes, LCC decoding is required to interpolate bulk of test vectors which results in long latency. Therefore, interpolations as well as polynomial selection are hefty part of LCC decoder with long RS code and significant value of ?. Besides, innovative designs being developed to alter the interpolation and polynomial complexity for the efficient recovery of the codeword for the given test vectors in LCC decoding. So, toward the codeword recovery for an RS (n, k) code erasure decoding, Neilson algorithm, coordinate transformation etc. being applied on the RS code segment. Also Chine search method can be applied over the interpolation output and it can be realized through constant multipliers which save the cost factor. For the selected 8 test vectors applied on RS (255, k) efficiency can be lead up to very high with power reduction for GF (210).
Reference :
-
[1] Xinmiao Zhang, Yingquan Wu, Jiangli Zhu, and Yu Zheng. “Novel Interpolation and Polynomial Selection for LowComplexity Chase SoftDecision Reed-Solomon Decoding”.IEEE TRANSACTIONS on Very Large Scale Integration (VLSI) Systems; Vol. 20, No.7, pp:1318- 1322, July 2012.
[2] Hao Wang, Wei Zhang, Jing Wang, and Zhe Jiang. “Hardware Complexities of Low-Complexity Chase Reed Solomon Decoders and Comparisons”. IEEE; pp:216-219, 2012.
[3] W. Zhang, J. Wang, H. Wang, Y.Y.Liu, Z. Jiang, and S.Q. Wu. “Low-power high-efficiency architecture for low-complexity chase soft-decision Reed-solomon decoding”. IET Communication; Vol. 6, No. 17, pp:3046-3052, August 2012.
[4] Solomon Decoder Using Step-by-Step Algorithm”. IEEE; pp:3326-3329, 2011. encoded Algebraic Soft-Decision Reed-Solomon Decoder”. IEEE TRANSACTIONS on Circuits and Systems; Vol. 59, No.6, pp:376-380,June 2012. selection scheme for low-complexity Chase algebraic soft-decision Reed-Solomon decoding”.ISCAS; Rio de Janeiro, 2011.
[5] Xinmiao Zhang, and Jiangli Zhu. “Algebraic SoftDecision Decoder Architectures for Long ReedSolomon Codes”. IEEE TRANSACTIONS on Circuits and Systems; Vol. 57, No.10,pp:787-792, Oct 2010.
[6] Xinmiao Zhang, and Yu Zheng. “Efficient Codeword Recovery Architecture for Low-Complexity Chase Reed-Solomon Decoding”. National Science Foundation, IEEE.
[7] Dong-Sun Kim, and Jong-Chan Choi, and Duck-Jin Chung. “Implementation of High-Speed Reed-Solomon Decoder”. IEEE; pp:808-812, 1999.
[8] Remalli Dinesh, and Sandeep Bansal. “ Design and Formulative Analysis of VLSI Syndrome Generator for RS(128,Kx) and RS(64,Ky) ”. International Journal of Computer Applications, IJCA; Vol. 92, No.8, pp:17-21, April 2014.
[9] Xinmiao Zhang, and Jiangli Zhu. “Interpolation based Hard-Decision Reed-Solomon Decoders”. ISIC; pp: 175-178, 2009.