메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 658-662

Constructing LDPC codes from simple loop-free encoding modules

Author keywords

[No Author keywords available]

Indexed keywords

DECODING THRESHOLDS; ENCODING MODULES; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) CODES;

EID: 24344490829     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (28)

References (20)
  • 2
    • 0030257652 scopus 로고    scopus 로고
    • Near optimum error correcting coding and decoding: Turbo-codes
    • October
    • C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., Vol. 44, pp. 1261-1271, October 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 1261-1271
    • Berrou, C.1    Glavieux, A.2
  • 3
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • M. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.27 , pp. 533-547
    • Tanner, M.R.1
  • 4
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacityapproaching irregular low-density parity-check codes
    • T. Richardson, A. Shokrollahi, and R. Urbanke, " Design of capacityapproaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, 200L
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 619-637
    • Richardson, T.1    Shokrollahi, A.2    Urbanke, R.3
  • 5
    • 0035248618 scopus 로고    scopus 로고
    • On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
    • S.-Y. Chung, D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity- check codes within 0.0045 dB of the Shannon limit," IEEE Communication Letters, vol. 5, pp. 58-60, 2001.
    • (2001) IEEE Communication Letters , vol.5 , pp. 58-60
    • Chung, S.-Y.1    Forney, D.2    Richardson, T.3    Urbanke, R.4
  • 8
    • 5044246358 scopus 로고    scopus 로고
    • Low Density Parity Check (LDPC) codes constructed from protographs
    • August 15
    • Jeremy Thorpe, Low Density Parity Check (LDPC) Codes Constructed from Protographs, JPL INP Progress Report 42-154, August 15, 2003.
    • (2003) JPL INP Progress Report , vol.42 , Issue.154
    • Thorpe, J.1
  • 11
    • 24344446341 scopus 로고    scopus 로고
    • Multi-edge type LDPC codes
    • presented at the California Institute of Technology, Pasadena, California, May 24-25
    • T.Richardson, Multi-Edge Type LDPC Codes, presented at the Work-shop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, May 24-25, 2002.
    • (2002) Work-shop Honoring Prof. Bob McEliece on His 60th Birthday
    • Richardson, T.1
  • 12
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • 29 Aug.
    • D.J.C. MacKay, R.M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters ,Vol. 32, Issue 18, 29 Aug. 1996, Page(s) 1645.
    • (1996) Electronics Letters , vol.32 , Issue.18 , pp. 1645
    • MacKay, D.J.C.1    Neal, R.M.2
  • 13
    • 0041919281 scopus 로고    scopus 로고
    • The renaissance of gallagers lowdensity parity-check codes
    • August
    • T. Richardson and R. Urbanke,"The Renaissance of Gallagers LowDensity Parity-Check Codes," IEEE Communications Magazine, pages 126-131, August 2003
    • (2003) IEEE Communications Magazine , pp. 126-131
    • Richardson, T.1    Urbanke, R.2
  • 14
    • 0035246580 scopus 로고    scopus 로고
    • Analysis of low density codes and improved designs using irregular graphs
    • M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low density codes and improved designs using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 585-598
    • Luby, M.1    Mitzenmacher, M.2    Shokrollahi, A.3    Spielman, D.4
  • 15
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity check codes under message- Passing decoding
    • T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message- passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
    • Richardson, T.1    Urbanke, R.2
  • 16
    • 0035504019 scopus 로고    scopus 로고
    • Low-density parity-check codes based on finite geometries: A rediscovery and new results
    • Nov.
    • Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Transactions on Information Theory, Volume: 47 Issue: 7 , Nov. 2001, Page(s): 2711-2736.
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.7 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 17
    • 0042921166 scopus 로고    scopus 로고
    • Codes defined on graphs
    • Aug.
    • F.R. Kschischang, "Codes defined on graphs." IEEE Communications Magazine, Vol. 41, Issue 8 , Aug. 2003, Pages 118 -125.
    • (2003) IEEE Communications Magazine , vol.41 , Issue.8 , pp. 118-125
    • Kschischang, F.R.1
  • 18
    • 0032072269 scopus 로고    scopus 로고
    • Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding
    • May
    • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, " Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Info. Theory, vol. 44, pp. 909-926, May 1998.
    • (1998) IEEE Trans. Info. Theory , vol.44 , pp. 909-926
    • Benedetto, S.1    Divsalar, D.2    Montorsi, G.3    Pollara, F.4
  • 20
    • 0141939171 scopus 로고    scopus 로고
    • A combinatoric superposition method for constructing low density parity check codes
    • Yokohama, Japan, June 29 - July 4
    • J. Xu and S. Lin, "A Combinatoric Superposition Method for Constructing Low Density Parity Check Codes," Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29 - July 4, 2003, p. 30.
    • (2003) Proc. 2003 IEEE Int. Symp. Inform. Theory , pp. 30
    • Xu, J.1    Lin, S.2


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