메뉴 건너뛰기




Volumn 56, Issue 9, 2010, Pages 4286-4300

Low-density parity-check codes for nonergodic block-fading channels

Author keywords

Block fading (BF) channel; iterative decoding; low density parity check (LDPC) codes; maximum distance separable (MDS) codes; maximum likelihood (ML) decoding; outage probability

Indexed keywords

FADING CHANNELS; FORWARD ERROR CORRECTION; MAXIMUM LIKELIHOOD; OPTICAL COMMUNICATION; SATELLITE COMMUNICATION SYSTEMS; SIGNAL ENCODING; TRELLIS CODES; TURBO CODES;

EID: 77955748100     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2053890     Document Type: Article
Times cited : (88)

References (27)
  • 2
    • 0032183888 scopus 로고    scopus 로고
    • Fading channels: Information-theoretical and communications aspects
    • Oct.
    • E. Biglieri, J. Proakis, and S. Shamai (Shitz), "Fading channels: Information-theoretical and communications aspects," IEEE Trans. Inf. Theory, vol.44, no.6, pp. 2619-2692, Oct. 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.44 , Issue.6 , pp. 2619-2692
    • Biglieri, E.1    Proakis, J.2    Shamai, S.3
  • 5
    • 77955756425 scopus 로고    scopus 로고
    • Near outage limit spacetime coding for MIMO channels
    • San Diego, CA, Feb. [Online]. Available
    • J. J. Boutros, G. M. Kraidy, and N. Gresset, "Near outage limit spacetime coding for MIMO channels," in Inaugural ITA Workshop, San Diego, CA, Feb. 2006 [Online]. Available: http://.josephboutros.org, UCSD
    • (2006) Inaugural ITA Workshop
    • Boutros, J.J.1    Kraidy, G.M.2    Gresset, N.3
  • 6
    • 70349266569 scopus 로고    scopus 로고
    • Diversity and coding gain evolution in graph codes
    • San Diego, CA, Feb. [Online]. Available
    • J. J. Boutros, "Diversity and coding gain evolution in graph codes," in ITA Workshop, San Diego, CA, Feb. 2009 [Online]. Available: http://. josephboutros.org, UCSD
    • (2009) ITA Workshop
    • Boutros, J.J.1
  • 7
    • 0036612281 scopus 로고    scopus 로고
    • Finite-length analysis of low-density parity-check codes on the binary erasure channel
    • Jun.
    • C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol.48, no.6, pp. 1570-1579, Jun. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.6 , pp. 1570-1579
    • Di, C.1    Proietti, D.2    Telatar, I.E.3    Richardson, T.J.4    Urbanke, R.L.5
  • 8
    • 33144469537 scopus 로고    scopus 로고
    • Coded modulation in the blockfading channel: Coding theorems and code construction
    • Jan.
    • A. Guilléni Fàbregas and G. Caire, "Coded modulation in the blockfading channel: Coding theorems and code construction," IEEE Trans. Inf. Theory, vol.52, no.1, pp. 91-114, Jan. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.1 , pp. 91-114
    • Guilléni Fàbregas, A.1    Caire, G.2
  • 9
    • 33750595625 scopus 로고    scopus 로고
    • Coding in the block-erasure channel
    • DOI 10.1109/TIT.2006.883556
    • A. Guilléni Fàbregas, "Coding in the block-erasure channel," IEEE Trans. Inf. Theory, vol.52, no.11, pp. 5116-5121, Nov. 2006. (Pubitemid 44680598)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.11 , pp. 5116-5121
    • Guillen i Fabregas, A.1
  • 10
    • 48049103002 scopus 로고    scopus 로고
    • Design of low density parity check codes for space-time coding
    • Brest, France, Sep. 1-5
    • S. Hirst and A. Burr, "Design of low density parity check codes for space-time coding," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 1-5, 2003, pp. 315-318.
    • (2003) Proc. 3rd Int. Symp. Turbo Codes and Related Topics , pp. 315-318
    • Hirst, S.1    Burr, A.2
  • 11
    • 0035332521 scopus 로고    scopus 로고
    • Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels
    • May
    • J. Hou, P. H. Siegel, and L. B. Milstein, "Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels," IEEE J. Sel. Areas Commun., vol.19, no.5, pp. 924-934, May 2001.
    • (2001) IEEE J. Sel. Areas Commun. , vol.19 , Issue.5 , pp. 924-934
    • Hou, J.1    Siegel, P.H.2    Milstein, L.B.3
  • 12
    • 5044250707 scopus 로고    scopus 로고
    • Analysis of LDPC decoding for correlated and uncorrelated block fading channels
    • Chicago, IL
    • X. Jin, A. W. Eckford, and T. E. Fuja, "Analysis of LDPC decoding for correlated and uncorrelated block fading channels," in Proc. 2004 IEEE Int. Symp. Inf. Theory, Chicago, IL, 2004.
    • (2004) Proc. 2004 IEEE Int. Symp. Inf. Theory
    • Jin, X.1    Eckford, A.W.2    Fuja, T.E.3
  • 13
    • 33749424801 scopus 로고    scopus 로고
    • Block error iterative decoding capacity for LDPC codes
    • Adelaide, Australia, Sep.
    • H. Jin and T. Richardson, "Block error iterative decoding capacity for LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005.
    • (2005) Proc. IEEE Int. Symp. Inf. Theory
    • Jin, H.1    Richardson, T.2
  • 14
    • 0033905132 scopus 로고    scopus 로고
    • On coding for block fading channels
    • Jan.
    • R. Knopp and P. A. Humblet, "On coding for block fading channels," IEEE Trans. Inf. Theory, vol.46, no.1, pp. 189-205, Jan. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.1 , pp. 189-205
    • Knopp, R.1    Humblet, P.A.2
  • 15
    • 5044250397 scopus 로고    scopus 로고
    • Graph covers and iterative decoding of finite-length codes
    • Brest, France, Sep. 1-5
    • R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. Turbo Codes and Rel. Topics, Brest, France, Sep. 1-5, 2003, pp. 75-82.
    • (2003) Proc. 3rd Int. Symp. Turbo Codes and Rel. Topics , pp. 75-82
    • Koetter, R.1    Vontobel, P.O.2
  • 16
    • 0028515621 scopus 로고
    • The performance of convolutional codes on the block erasure channel using various finite interleaving techniques
    • Sep.
    • A. Lapidoth, "The performance of convolutional codes on the block erasure channel using various finite interleaving techniques," IEEE Trans. Inf. Theory, vol.40, no.5, pp. 1459-1473, Sep. 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.5 , pp. 1459-1473
    • Lapidoth, A.1
  • 17
    • 0032636506 scopus 로고    scopus 로고
    • Evaluating the performance of convolutional codes over block fading channels
    • Jul.
    • E. Malkamäki and H. Leib, "Evaluating the performance of convolutional codes over block fading channels," IEEE Trans. Inf. Theory, vol.45, no.5, pp. 1643-1646, Jul. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.5 , pp. 1643-1646
    • Malkamäki, E.1    Leib, H.2
  • 18
    • 0033100161 scopus 로고    scopus 로고
    • Coded diversity on block-fading channels
    • Mar.
    • E. Malkamäki and H. Leib, "Coded diversity on block-fading channels," IEEE Trans. Inf. Theory, vol.45, no.2, pp. 771-781, Mar. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.2 , pp. 771-781
    • Malkamäki, E.1    Leib, H.2
  • 19
    • 36448932788 scopus 로고    scopus 로고
    • A tight lower bound to the outage probability of discrete-input block-fading channels
    • Nov. [Online]. Available:
    • K. D. Nguyen, A. Guilléni Fàbregas, and L. K. Rasmussen, "A tight lower bound to the outage probability of discrete-input block-fading channels," IEEE Trans. Inf. Theory vol. 53, no.11, Nov. 2007 [Online]. Available: http://arxiv.org/abs/0707.1588
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.11
    • Nguyen, K.D.1    Guilléni Fàbregas, A.2    Rasmussen, L.K.3
  • 20
    • 0028427058 scopus 로고
    • Information theoretic considerations for cellular mobile radio
    • May
    • L. H. Ozarow, S. Shamai (Shitz), and A. D. Wyner, "Information theoretic considerations for cellular mobile radio," IEEE Trans. Veh. Technol., vol.43, no.2, pp. 359-378, May 1994.
    • (1994) IEEE Trans. Veh. Technol. , vol.43 , Issue.2 , pp. 359-378
    • Ozarow, L.H.1    Shamai, S.2    Wyner, A.D.3
  • 22
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb.
    • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2
  • 23
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • Feb.
    • T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.J.1    Shokrollahi, M.A.2    Urbanke, R.L.3
  • 26
    • 0028461972 scopus 로고
    • A general formula for channel capacity
    • Jul.
    • S.Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inf. Theory, vol.40, no.4, pp. 1147-1157, Jul. 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.4 , pp. 1147-1157
    • Verdú, S.1    Han, T.S.2
  • 27
    • 0041817786 scopus 로고    scopus 로고
    • A simple and general parameterization quantifying performance in fading channels
    • Aug.
    • Z.Wang and G. B. Giannakis, "A simple and general parameterization quantifying performance in fading channels," IEEE Trans. Commun., vol.51, no.8, pp. 1389-1398, Aug. 2003.
    • (2003) IEEE Trans. Commun. , vol.51 , Issue.8 , pp. 1389-1398
    • Wang, Z.1    Giannakis, G.B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.