메뉴 건너뛰기




Volumn 2, Issue , 2002, Pages 1378-1382

Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DECODING; PERFORMANCE;

EID: 0036967273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (36)

References (11)
  • 2
    • 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
  • 3
    • 0032647173 scopus 로고    scopus 로고
    • Reduced complexity iterative decoding of low density parity check codes based on belief propagation
    • May
    • M. Fossorier, M. Mihaljević and H. Imai, "Reduced complexity iterative decoding of low density parity check codes based on belief propagation," IEEE Trans. on Commun., vol. 47, pp. 673-680, May 1999.
    • (1999) IEEE Trans. on Commun. , vol.47 , pp. 673-680
    • Fossorier, M.1    Mihaljević, M.2    Imai, H.3
  • 4
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity check codes under message-passing decoding
    • Feb.
    • 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, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
    • Richardson, T.1    Urbanke, R.2
  • 6
    • 0035974730 scopus 로고    scopus 로고
    • Density evolution for low-density parity-check codes under Max-Log-MAP decoding
    • Aug.
    • X. Wei and A. N. Akansu, "Density evolution for low-density parity-check codes under Max-Log-MAP decoding," IEE Electron. Letters, vol. 37, pp. 1225-1226, Aug. 2001.
    • (2001) IEE Electron. Letters , vol.37 , pp. 1225-1226
    • Wei, X.1    Akansu, A.N.2
  • 7
    • 0003278855 scopus 로고    scopus 로고
    • A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution
    • San Antonio, USA, Nov.
    • A. Anastasopoulos, "A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution," Proc. Globecom2001, San Antonio, USA, Nov. 2001.
    • (2001) Proc. Globecom2001
    • Anastasopoulos, A.1
  • 8
    • 0035138658 scopus 로고    scopus 로고
    • A reduced-complexity decoding algorithm for low-density parity-check codes
    • Jan.
    • E. Eleftheriou, T. Mittelholzer and A. Dholakia, "A reduced-complexity decoding algorithm for low-density parity-check codes," IEE Electronics Letters, vol. 37, pp. 102-104, Jan. 2001.
    • (2001) IEE Electronics Letters , vol.37 , pp. 102-104
    • Eleftheriou, E.1    Mittelholzer, T.2    Dholakia, A.3
  • 9
    • 0036493854 scopus 로고    scopus 로고
    • Near optimum universal belief propagation based decoding of LDPC codes
    • March
    • I. Chen and M. Fossorier, "Near optimum universal belief propagation based decoding of LDPC codes," IEEE Trans. Commun., vol. 50, No. 3, March 2002.
    • (2002) IEEE Trans. Commun. , vol.50 , Issue.3
    • Chen, I.1    Fossorier, M.2
  • 10
    • 0035248618 scopus 로고    scopus 로고
    • On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
    • Feb.
    • S. Chung, G. D. Forney, T. I. Richardson and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Comm. Letters, vol. 5, pp. 58-60, Feb. 2001.
    • (2001) IEEE Comm. Letters , vol.5 , pp. 58-60
    • Chung, S.1    Forney, G.D.2    Richardson, T.I.3    Urbanke, R.4


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