메뉴 건너뛰기




Volumn , Issue , 2006, Pages

EXIT chart analysis for doubly generalized LDPC codes

Author keywords

[No Author keywords available]

Indexed keywords

AWGN CHANNEL; EXIT CHART ANALYSIS;

EID: 50949096568     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.76     Document Type: Conference Paper
Times cited : (8)

References (25)
  • 2
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • Aug
    • D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
    • (1996) Electron. Lett , vol.32 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 3
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sep
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 533-547
    • Tanner, R.M.1
  • 4
    • 0033358305 scopus 로고    scopus 로고
    • On generalized low-density parity-check codes based on Hamming component codes
    • Aug
    • M. Lentmaier and K. S. Zigangirov, "On generalized low-density parity-check codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, pp. 248-250, Aug. 1999.
    • (1999) IEEE Commun. Lett , vol.3 , pp. 248-250
    • Lentmaier, M.1    Zigangirov, K.S.2
  • 6
    • 33846632830 scopus 로고    scopus 로고
    • Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels
    • St. Louis, USA, Nov
    • N. Miladinovic and M. Fossorier, "Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels," Proc. of Global Telecommun. Conf., St. Louis, USA, Nov. 2005.
    • (2005) Proc. of Global Telecommun. Conf
    • Miladinovic, N.1    Fossorier, M.2
  • 7
    • 33749426392 scopus 로고    scopus 로고
    • Low-rate generalized low-density parity-check codes with Hadamard contraints
    • Adelaide, Australia, pp, Sep
    • G. Yue, L. Ping, and X. Wang, "Low-rate generalized low-density parity-check codes with Hadamard contraints," Proc. IEEE Int. Symp. Inform. Theory, Adelaide, Australia, pp. 1377-1381, Sep. 2005.
    • (2005) Proc. IEEE Int. Symp. Inform. Theory , pp. 1377-1381
    • Yue, G.1    Ping, L.2    Wang, X.3
  • 10
    • 0141974749 scopus 로고    scopus 로고
    • Design and iterative decoding of networks of many small codes
    • Yokohama, Japan, p, Jun
    • S. Dolinar, "Design and iterative decoding of networks of many small codes," Proc. IEEE Int. Symp. Inform. Theory, Yokohama, Japan, p. 381, Jun. 2003.
    • (2003) Proc. IEEE Int. Symp. Inform. Theory , pp. 381
    • Dolinar, S.1
  • 11
    • 0032674150 scopus 로고    scopus 로고
    • Convergence of iterative decoding
    • May
    • S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, no. 10, pp. 806-808, May 1999.
    • (1999) Electron. Lett , vol.35 , Issue.10 , pp. 806-808
    • ten Brink, S.1
  • 12
    • 0032626853 scopus 로고    scopus 로고
    • Iterative decoding for multicode CDMA
    • May
    • _, "Iterative decoding for multicode CDMA," Proc. IEEE VTC, pp. 1876-1880, May 1999.
    • (1999) Proc. IEEE VTC , pp. 1876-1880
    • ten Brink, S.1
  • 13
    • 0035481826 scopus 로고    scopus 로고
    • Convergence behavior of iteratively decoded parallel concatenated codes
    • Oct
    • _, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Inform. Theory, vol. 49, pp. 1727-1737, Oct. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.49 , pp. 1727-1737
    • ten Brink, S.1
  • 15
    • 34547255537 scopus 로고    scopus 로고
    • EXIT functions for continuous channels - Part I: Constituent codes
    • submitted for publication
    • _, "EXIT functions for continuous channels - Part I: Constituent codes," IEEE Trans. Commun., submitted for publication.
    • IEEE Trans. Commun
    • Sharon, E.1    Ashikhmin, A.2    Litsyn, S.3
  • 17
    • 2442425417 scopus 로고    scopus 로고
    • Extrinsic Information Transfer Functions: Model and Erasure Channel Properties
    • Nov
    • A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic Information Transfer Functions: Model and Erasure Channel Properties," IEEE Trans. Inform. Theory, vol. 50, pp. 2657-2673, Nov. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2657-2673
    • Ashikhmin, A.1    Kramer, G.2    ten Brink, S.3
  • 18
    • 2442530858 scopus 로고    scopus 로고
    • Design of low-density parity-check codes for modulation and detection
    • Apr
    • S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, pp. 670-678, Apr. 2004.
    • (2004) IEEE Trans. Commun , vol.52 , pp. 670-678
    • ten Brink, S.1    Kramer, G.2    Ashikhmin, A.3
  • 19
    • 2442556258 scopus 로고    scopus 로고
    • Bounds on information combining for parity-check equations
    • Zurich, Switzerland, pp, Feb
    • I. Land, P. A. Hoeher, and J. B. Huber, "Bounds on information combining for parity-check equations," International Zurich Seminar, Zurich, Switzerland, pp. 68-71, Feb. 2004.
    • (2004) International Zurich Seminar , pp. 68-71
    • Land, I.1    Hoeher, P.A.2    Huber, J.B.3
  • 20
    • 84979943870 scopus 로고    scopus 로고
    • Analytical derivation of EXIT charts for simple block codes and for LDPC codes using information combining
    • Vienna, Austria, pp, Sep
    • I. Land, P. A. Hoeher, and J. B. Huber, "Analytical derivation of EXIT charts for simple block codes and for LDPC codes using information combining," Proc. of the 12th European Signal Processing Conference (EUSIPCO04), Vienna, Austria, pp. 1561-1564, Sep. 2004.
    • (2004) Proc. of the 12th European Signal Processing Conference (EUSIPCO04) , pp. 1561-1564
    • Land, I.1    Hoeher, P.A.2    Huber, J.B.3
  • 22
    • 0033099611 scopus 로고    scopus 로고
    • Good error-correcting codes based on very sparse matrices
    • Mar
    • D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 399-431
    • MacKay, D.J.C.1
  • 23
    • 0030110651 scopus 로고    scopus 로고
    • Iterative decoding of block and convolutional codes
    • Mar
    • J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 429-445
    • Hagenauer, J.1    Offer, E.2    Papke, L.3


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