[1] MacKay D J C, Neal R M. Near Shannon Limit Performance of Low Density Parity Check Codes [J]. IEE Electron Lett, 1996, 32(18): 1645-1646.
[2] 童胜, 王鹏, 王单, 等. LDPC 码量化和积译码的高效实现 [J]. 西安电子科技大学学报, 2004, 31(5): 709-713.
Tong Sheng, Wang Peng, Wang Dan, et al. Efficient Implementation of the Sum-product Algorithm for Quantized Decoding of LDPC Codes [J]. Journal of Xidian University, 2004, 31(5): 709-713.
[3] Chung S Y, Forney G D Jr, Richardson T J, et al. On the Design of Low-density Parity Check Codes Within 0.0045dB of the Shannon Limit [J]. IEEE Communications Letters, 2001, 5(2): 58-60.
[4] 刘原华, 王新梅, 胡树楷, 等. 一种改进的卷积LDPC 码置信传播译码算法 [J]. 西安电子科技大学学报, 2009, 36(3): 424-427.
Liu Yuanhua, Wang Xinmei, Hu Shukai et al. An Improved Belief Propagation Algorithm for Decoding of Convolutional LDPC Codes [J]. Journal of Xidian University, 2009, 36(3): 424-427.
[5] Liu Y, Wang X, Chen R, et al. Generalized Combing Method for Design of Quasi-cyclic LDPC Codes [J]. IEEE Commun Lett, 2008, 12(5): 1-3.
[6] LAN/MAN Standards Committee of the IEEE Computer Society. IEEE Std 802.16eTM-2005 and IEEE Std 802.16TM-2004/Cor1-2005 Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems [S]. USA: Institute of Electrical and Electronics Engineers, Inc, 2006.
[7] European Telecommunications Standards Institute (ETSI). Draft ETSI EN 302 307 V 1.1.1. Digital Video Broadcasting (DVB) [S]. 650 Route Des Lucioles F-06921 Sophia Antipolis Cedex-France: ETIS, 2004.
[8] Bangerter B, Jacobsen E, Ho M, et al. High-throughput Wireless LAN Air Interface [J]. Intel Technol, 2003(7): 47-57.
[9] Kou Y, Lin S, Fossorier M. Low-density Parity-check Codes Based on Finite Geometries: a Rediscovery and New Results [J]. IEEE Trans on Info Th, 2001, 47(7): 2711-2736.
[10] Yang L, Liu H, Shi C J. Code Construction and FPGA Implementation of a Low-density Parity-check Code Decoder [J]. IEEE Trans on Circuits and Systems, 2006, 53(4): 892-904.
[11] Zhang H, Zhang T. Design of VLSI Implementation-oriented LDPC Codes [C/OL]. [2009-01-12]. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1285102&isnumber=28568.
[12] Myung S, Yang K. A Combining Method of Quasi-cyclic LDPC Codes By the Chinese Remainder Theorem [J]. IEEE Commun Lett, 2005, 9(9): 823-825.
[13] Hu X Y, Eleftheriou E, Arnold D M. Regular and Irregular Progressive Edge-growth Tanner Graphs [J]. IEEE Trans on Inform Theory, 2005, 51(1): 386-398.
[14] Campello J, Modha D S. Extended Bit-filling and LDPC Code Design [C/OL]. [2009-01-12]. http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=00965565. |