|
Gallager R G. Low-density parity-check codes[J].IRE Trans. on Info. Theory.1962, 8(1):21-28[2]Richardson T J, Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding [J].IEEE Trans. on Info. Theory.2001, 47(2):599-618[3]Mackay D J C. Good error-correcting codes based on very sparse matrices[J].IEEE Trans.on Info. Theory.1999, 45(3):399-431[4]Fossorier M, Mihaljevic M, Imai H. Reduced complexity iterative decoding of low density parity check codes based on belief propagation[J].IEEE Trans. on Communications.1999, 47(5):673-680[5]Wei X, Akansu A N. Density evolution for low density parity check coeds under Max-Log-MAP decoding[J].Electronics Letters.2001, 37(18):1125-1126[6]賀玉成, 楊莉, 王新梅, et al.. 置信傳播算法的性能測度[J].電子學(xué)報, 2002, 30(4): 577-580.[7]Chung S Y, Forney J G D, Richardson T J, et al.. On the design of low-density parity-check codes within 00045dB of the Shannon limit[J].. IEEE Communications. Letters.2001, 5(2):58-60[8]Chen J H, Fossorier M. Density evolution for two improved BP-based decoding algorithms of LDPC codes[J].IEEE Communications Letters.2002, 6(5):208-210[9]Chen J H, Fossorier M. Density evolution for BP-based decoding algorithm of LDPC codes and their quantized versions[C]. IEEE Global Telecommunications Conference, Taipei, Nov. 2002, 2: 1378-1382.[10]Hou J L, Siegel P H, Milstein B. Perforance analysis and optimaization of low density parity check codes on Rayleigh channels[J].IEEE J. on Selected Area in Communication.2001, 19(5):924-934[11]林家儒, 吳偉陵. LDPC碼在RICE信道中的性能分析[J]. 北京: 北京郵電大學(xué)學(xué)報, 2004, 27(2): 48-53.[12]Shokrollahi A, Storn R. Design of efficient erasure codes with differential evolution[C]. In Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000: 5.[13]Storn R, Price K. Differential evolutionA simple and efficient heuristic adaptive scheme for global optimization over continuous spaces[J].J. Global Optimization.1997, 11(2):341-359[14]Chung S Y, Richardson T J, Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a gaussaian approximation[J].IEEE Trans. on Info. Theory.2001, 47(2):657-670[15]Kavcic A, Ma X, Mitzenmacher M. Binary intersymbol Interference channels: Gallager codes, density evolution, and code perfornance bounds[J].IEEE Trans. on Info. Theory.2003, 49(7):1636-1652[16]Tan W J, Cruz J R. Performance evaluation of low-density parity-check codes on partial-response channels using density evolution[J].IEEE Trans. on Communications.2004, 52(8):1253-1256
|
下載:
