Improved Method for LDPC Decoding Algorithm Aided by Segmented Cyclic Redundancy Checks

Gallager R G. Low-density parity-check codes[J].IRE Trans.Inform.Theory.1962, 8(1):21-28[2]Mackay D J C and Neal R M. Near Shannon limitperformance of low density parity check codes[J].IEE Electron.Lett.1996, 32(18):1645-1646[3]Wolf J K and Blakeney R. A exact evaluation of tileprobability of undetected error for certain for certainshortened binary CRC codes. IEEE MILCOM, San Diego,CA, 1988: 287-292.[4]Kwon Y H, Oh M K, and Park D J. Efficient transmissionscheme using minipackets in wireless networks. In Proc. IEEEVTC, Los Angeles, California, USA, 2004: 1158-1162.[5]Kwon Y H, Oh M K, and Park D J. A new LDPC decodingalgorithm aided by segmented cyclic redundancy checks formagnetic recording channels[J].IEEE Trans. on Magn.2005,41(7):2318-2320[6]Zhai F and Fair I J. Techniques for early stopping and errordetection in Turbo decoding[J].IEEE Trans. on Commun.2003,51(10):1617-1623[7]IEEE standards. C802.16e-04/283. Algebraic low-densityparity-check codes for OFDMA PHY layer. USA, IEEE,2004.[8]Xia H and Cruz J R. On the performance of softReed-Solomon decoding for magnetic recording channels witherasures[J].IEEE Trans. on Magn.2003, 39(5):2576-2578