메뉴 건너뛰기




Volumn 57, Issue 6, 2009, Pages 1683-1692

LDPC codes and convolutional codes with equal structural delay: A comparison

Author keywords

Belief propagation; Convolutional codes; Low delay data transmission; Low density parity check codes; Progressive edge growth

Indexed keywords

BELIEF PROPAGATION; BLOCK STRUCTURES; CHANNEL CODE; CODING SCHEME; DATA DELAYS; DECODING PERFORMANCE; FRAME ERROR RATE; LDPC CODES; LOW LATENCY; LOW SIGNAL-TO-NOISE RATIO; LOW-DELAY DATA TRANSMISSION; LOW-DENSITY PARITY-CHECK CODES; PERFORMANCE CRITERION; PROGRESSIVE EDGE GROWTH; RANDOM CODING; SPHERE PACKING BOUND; THEORETICAL LIMITS;

EID: 67650676770     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.06.080014     Document Type: Article
Times cited : (47)

References (33)
  • 3
    • 67650653059 scopus 로고    scopus 로고
    • JTC Joint Technical Committee, Digital video broadcasting (DVB); second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications, European Telecommunications Standards Institute, Tech. Rep., Mar. 2005.
    • JTC Joint Technical Committee, "Digital video broadcasting (DVB); second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications," European Telecommunications Standards Institute, Tech. Rep., Mar. 2005.
  • 4
    • 67650653057 scopus 로고    scopus 로고
    • IEEE Std. 802.3an, IEEE Standard for information technology, Part 3: Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications, Institute of Electrical and Electronics Engineers, Tech. Rep., June 2006.
    • IEEE Std. 802.3an, "IEEE Standard for information technology, Part 3: Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications," Institute of Electrical and Electronics Engineers, Tech. Rep., June 2006.
  • 5
    • 67650694822 scopus 로고    scopus 로고
    • IEEE Std. 802.16e, IEEE standard for local and metropolitan area networks, Part 16: Air interface for fixed and mobile broadband wireless access systems. Amendment 2: Physical and medium access control layers for combined fixed and mobile operation in licensed bands, Institute of Electrical and Electronics Engineers (IEEE), Tech. Rep., Dec. 2005.
    • IEEE Std. 802.16e, "IEEE standard for local and metropolitan area networks, Part 16: Air interface for fixed and mobile broadband wireless access systems. Amendment 2: Physical and medium access control layers for combined fixed and mobile operation in licensed bands," Institute of Electrical and Electronics Engineers (IEEE), Tech. Rep., Dec. 2005.
  • 6
    • 67650705296 scopus 로고    scopus 로고
    • E. 3rd Generation Partnership Project (3GPP, Universal mobile telecommunications system (UMTS, multiplexing and channel coding (FDD) 3GPP TS 25.212, version 6.10.0, release 6, European Telecommunications Standards Institute ETSI, Tech. Rep, 2006
    • E. 3rd Generation Partnership Project (3GPP)., "Universal mobile telecommunications system (UMTS); multiplexing and channel coding (FDD) 3GPP TS 25.212, version 6.10.0, release 6," European Telecommunications Standards Institute (ETSI), Tech. Rep., 2006.
  • 8
    • 12544253129 scopus 로고    scopus 로고
    • Regular and irregular progressive edge-growth Tanner graphs
    • Jan
    • X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, pp. 386-398, Jan. 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , pp. 386-398
    • Hu, X.-Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 11
    • 0001807543 scopus 로고
    • Coding for noisy channels
    • IRE National Convention Record, part
    • P. Elias, "Coding for noisy channels," in IRE National Convention Record, ser. part 4, 1955, pp. 37-47.
    • (1955) ser , vol.4 , pp. 37-47
    • Elias, P.1
  • 14
    • 80052153401 scopus 로고    scopus 로고
    • Communications Systems and Research Section, JPL, Website, Online, Available
    • Communications Systems and Research Section, JPL. Code imperfectness. Website. [Online]. Available: http://www331.jpl.nasa.gov/public/ imperfectness.html
    • Code imperfectness
  • 16
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar
    • L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. 20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.20 , pp. 284-287
    • Bahl, L.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 17
    • 0003795734 scopus 로고
    • Trelliscodierung (in German)
    • Erlangen, Germany: Springer-Verlag Berlin Heidelberg
    • J. Huber, Trelliscodierung (in German), ser. Nachrichtentechnik. Erlangen, Germany: Springer-Verlag Berlin Heidelberg, 1992.
    • (1992) ser. Nachrichtentechnik
    • Huber, J.1
  • 18
    • 0015142169 scopus 로고
    • Viterbi decoding for satellite and space communication
    • Oct
    • J. Heller and I. Jacobs, "Viterbi decoding for satellite and space communication," IEEE Trans. Commun. Technol., vol. 19, no. 5, pp. 835-848, Oct. 1971.
    • (1971) IEEE Trans. Commun. Technol , vol.19 , Issue.5 , pp. 835-848
    • Heller, J.1    Jacobs, I.2
  • 19
    • 84935113569 scopus 로고    scopus 로고
    • A. Viterbi, Error-bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory, 13, no. 2, pp. 260-269, Apr. 1967.
    • A. Viterbi, "Error-bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. 13, no. 2, pp. 260-269, Apr. 1967.
  • 20
    • 13444296608 scopus 로고    scopus 로고
    • Analysis and design of power-efficient coding schemes,
    • Ph.D. dissertation, University of Erlangen-Nuremberg, Erlangen, Germany
    • S. Huettinger, "Analysis and design of power-efficient coding schemes," Ph.D. dissertation, University of Erlangen-Nuremberg, Erlangen, Germany, 2004.
    • (2004)
    • Huettinger, S.1
  • 21
    • 0004082156 scopus 로고    scopus 로고
    • S. W. Director, ed. McGraw-Hill Higher Education
    • J. G. Proakis, Digital Communications, S. W. Director, ed. McGraw-Hill Higher Education, 2001.
    • (2001) Digital Communications
    • Proakis, J.G.1
  • 23
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sept
    • M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.27 , Issue.5 , pp. 533-547
    • Tanner, M.1
  • 26
    • 84907062399 scopus 로고
    • Probability of error for optimal codes in a Gaussian channel
    • May
    • C. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell System Technical J., vol. 38, pp. 611-656, May 1959.
    • (1959) Bell System Technical J , vol.38 , pp. 611-656
    • Shannon, C.1
  • 27
    • 67650668580 scopus 로고    scopus 로고
    • Studienarbeit in German, University of Erlangen-Nuremberg, Erlangen, Germany, Aug
    • S. Peeters, "Vergleich von Kanalcodierverfahren," Studienarbeit (in German), University of Erlangen-Nuremberg, Erlangen, Germany, Aug. 1998.
    • (1998) Vergleich von Kanalcodierverfahren
    • Peeters, S.1
  • 28
    • 52949127580 scopus 로고    scopus 로고
    • An improved sphere-packing bound for finite-length codes on symmetric memoryless channels
    • Mar
    • G. Wiechman and I. Sason, "An improved sphere-packing bound for finite-length codes on symmetric memoryless channels," Submitted to IEEE Trans. Inform. Theory, Mar. 2007.
    • (2007) Submitted to IEEE Trans. Inform. Theory
    • Wiechman, G.1    Sason, I.2
  • 29
    • 67650671745 scopus 로고    scopus 로고
    • Private communication, Apr, by e-mail
    • G. Wiechman, "Private communication," Apr. 2007, by e-mail.
    • (2007)
    • Wiechman, G.1
  • 30
    • 0015975387 scopus 로고
    • Error intervals and cluster density in channel modeling (corresp.)
    • Jan
    • J.-P. Adoul, "Error intervals and cluster density in channel modeling (corresp.)," IEEE Trans. Inform. Theory, vol. 20, no. 1, pp. 125-129, Jan. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.20 , Issue.1 , pp. 125-129
    • Adoul, J.-P.1
  • 31
    • 67650705184 scopus 로고
    • Codierung fuer gedaechtnisbehaftete kanaele (in German),
    • Ph.D. dissertation, Hochschule der Bundeswehr Muenchen, Munich, Germany, Apr
    • J. B. Huber, "Codierung fuer gedaechtnisbehaftete kanaele (in German)," Ph.D. dissertation, Hochschule der Bundeswehr Muenchen, Munich, Germany, Apr. 1982.
    • (1982)
    • Huber, J.B.1
  • 33
    • 67650683551 scopus 로고    scopus 로고
    • T. Hehn, J. Huber, O. Milenkovic, and S. Laendner, Multiple-bases belief-propagation decoding of high-density cyclic codes, submitted to IEEE Trans. Commun., 2007.
    • T. Hehn, J. Huber, O. Milenkovic, and S. Laendner, "Multiple-bases belief-propagation decoding of high-density cyclic codes," submitted to IEEE Trans. Commun., 2007.


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