Performance of low density parity check coded continuous phase frequency shift keying (LDPCC‐CPFSK) over fading channels
暂无分享,去创建一个
[1] Subbarayan Pasupathy,et al. Iterative decoding of serially concatenated convolutional codes and MSK , 1999, IEEE Communications Letters.
[2] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[3] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[4] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[5] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[6] David J. C. MacKay,et al. Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..
[7] Rüdiger L. Urbanke,et al. Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[8] Bixio Rimoldi,et al. A decomposition approach to CPM , 1988, IEEE Trans. Inf. Theory.
[9] Daniel A. Spielman,et al. Practical loss-resilient codes , 1997, STOC '97.
[10] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[11] G. A. Margulis,et al. Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..
[12] Richard D. Wesel,et al. Parallel concatenated turbo codes for continuous phase modulation , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).