메뉴 건너뛰기




Volumn 95, Issue 11, 2007, Pages 2142-2156

The development of turbo and LDPC codes for deep-space applications

Author keywords

Bounds; Consultative Committee for Space Data Systems (CCSDS); Error correction coding; Low density parity check (LDPC) code; Protograph; Space vehicle communication; Spacecraft; Turbo code

Indexed keywords

ERROR CORRECTION; FORWARD ERROR CORRECTION; INTERPLANETARY FLIGHT; ITERATIVE DECODING; NASA; SPACE APPLICATIONS; SPACECRAFT; STANDARDIZATION;

EID: 64149107304     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2007.905132     Document Type: Article
Times cited : (131)

References (77)
  • 1
    • 84940644968 scopus 로고    scopus 로고
    • C. Shannon, A mathematical theory of communication, Bell Syst. Tech. J., 27, pp. 379-423, Jul./Oct. 1948, 623-656.
    • C. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Jul./Oct. 1948, 623-656.
  • 2
    • 84935113569 scopus 로고    scopus 로고
    • A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inf. Theory, IT-13, pp. 260-269, Apr. 1967.
    • A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inf. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
  • 3
    • 0001174154 scopus 로고
    • Polynomial codes over certain finite fields
    • Jun
    • I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Ind. Math., vol. 8, pp. 260-269, Jun. 1960.
    • (1960) J. Soc. Ind. Math , vol.8 , pp. 260-269
    • Reed, I.S.1    Solomon, G.2
  • 5
    • 64349116133 scopus 로고
    • In search of a 2-dB coding gain, JPL, TDA
    • Nov
    • J. H. Yuen and Q. D. Vo, "In search of a 2-dB coding gain," JPL, TDA Prog. Rep. 42-83, Nov. 1985.
    • (1985) Prog. Rep , pp. 42-83
    • Yuen, J.H.1    Vo, Q.D.2
  • 7
    • 0026930198 scopus 로고
    • A VLSI decomposition of the deBruijn graph
    • O. Collins, S. Dolinar, R. McEliece, and F. Pollara, "A VLSI decomposition of the deBruijn graph," J. ACM, vol. 39, no. 4, pp. 931-948, 1992.
    • (1992) J. ACM , vol.39 , Issue.4 , pp. 931-948
    • Collins, O.1    Dolinar, S.2    McEliece, R.3    Pollara, F.4
  • 8
    • 34548315602 scopus 로고
    • Coding beyond the computational cutoff rate,
    • Ph.D. dissertation, California Inst. of Technol, Pasadena
    • O. Collins, "Coding beyond the computational cutoff rate," Ph.D. dissertation, California Inst. of Technol., Pasadena, 1989.
    • (1989)
    • Collins, O.1
  • 9
    • 0025478148 scopus 로고
    • Improved decoding for a concatenated coding system recommended by CCSDS
    • Aug
    • E. Paaske, "Improved decoding for a concatenated coding system recommended by CCSDS," IEEE Trans. Commun., vol. COM-38, pp. 1138-1144, Aug. 1990.
    • (1990) IEEE Trans. Commun , vol.COM-38 , pp. 1138-1144
    • Paaske, E.1
  • 10
    • 0027840339 scopus 로고
    • Determinate state convolutional codes
    • Dec
    • O. Collins and M. Hizlan, "Determinate state convolutional codes," IEEE Trans. Commun., vol. 41, pp. 1785-1794, Dec. 1993.
    • (1993) IEEE Trans. Commun , vol.41 , pp. 1785-1794
    • Collins, O.1    Hizlan, M.2
  • 11
    • 0028481586 scopus 로고
    • Alternative to NASA's concatenated coding system for the Galileo mission
    • Aug
    • E. Paaske, "Alternative to NASA's concatenated coding system for the Galileo mission," Proc. Inst. Elect. Eng. Commun., vol. 141, pp. 229-232, Aug. 1994.
    • (1994) Proc. Inst. Elect. Eng. Commun , vol.141 , pp. 229-232
    • Paaske, E.1
  • 15
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding and decoding: Turbo-codes
    • Geneva, Switzerland, May
    • C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
    • (1993) Proc. IEEE Int. Conf. Commun , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 16
    • 0030257652 scopus 로고    scopus 로고
    • Near optimum error correcting coding and decoding: Turbo-codes
    • Oct
    • C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
    • (1996) IEEE Trans. Commun , vol.44 , pp. 1261-1271
    • Berrou, C.1    Glavieux, A.2
  • 17
    • 0030110651 scopus 로고    scopus 로고
    • Iterative decoding of binary block and convolutional codes
    • Mar
    • J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, pp. 429-445, Mar. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.42 , pp. 429-445
    • Hagenauer, J.1    Offer, E.2    Papke, L.3
  • 18
    • 0003189118 scopus 로고
    • Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes
    • P. Robertson, "Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes," in Proc. Globecom Conf., 1994, pp. 1298-1303.
    • (1994) Proc. Globecom Conf , pp. 1298-1303
    • Robertson, P.1
  • 19
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling turbo codes: Some results on parallel concatenated coding schemes
    • Mar
    • S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inf. Theory, vol. 42, pp. 409-428, Mar. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.42 , pp. 409-428
    • Benedetto, S.1    Montorsi, G.2
  • 21
    • 0029632376 scopus 로고
    • Average performance of parallel concatenated block codes
    • Feb. 2
    • S. Benedetto and G. Montorsi, "Average performance of parallel concatenated block codes," Electron. Lett., vol. 31, pp. 156-158, Feb. 2, 1995.
    • (1995) Electron. Lett , vol.31 , pp. 156-158
    • Benedetto, S.1    Montorsi, G.2
  • 22
    • 0029632434 scopus 로고
    • Performance evaluation of turbo codes
    • Feb. 2
    • S. Benedetto and G. Montorsi, "Performance evaluation of turbo codes," Electron. Lett., vol. 31, pp. 163-165, Feb. 2, 1995.
    • (1995) Electron. Lett , vol.31 , pp. 163-165
    • Benedetto, S.1    Montorsi, G.2
  • 24
    • 0030785977 scopus 로고    scopus 로고
    • A soft-input soft-output APP module for iterative decoding of concatenated codes
    • Jan
    • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes," IEEE Commun. Lett., vol. 1, pp. 22-24, Jan. 1997.
    • (1997) IEEE Commun. Lett , vol.1 , pp. 22-24
    • Benedetto, S.1    Divsalar, D.2    Montorsi, G.3    Pollara, F.4
  • 25
    • 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. Inf. Theory, vol. 44, pp. 909-926, May 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.44 , pp. 909-926
    • Benedetto, S.1    Divsalar, D.2    Montorsi, G.3    Pollara, F.4
  • 26
    • 0003595298 scopus 로고
    • Low-density parity-check codes,
    • Ph.D. dissertation, Massachusetts Inst. of Technol, Cambridge, Sep
    • R. Gallager, "Low-density parity-check codes," Ph.D. dissertation, Massachusetts Inst. of Technol., Cambridge, Sep. 1960.
    • (1960)
    • Gallager, R.1
  • 31
    • 0002203214 scopus 로고
    • Weight distributions for turbo codes using random and nonrandom permutations, JPL, TDA
    • Aug
    • S. Dolinar and D. Divsalar, "Weight distributions for turbo codes using random and nonrandom permutations," JPL, TDA Prog. Rep. 42-122, Aug. 1995.
    • (1995) Prog. Rep , pp. 42-122
    • Dolinar, S.1    Divsalar, D.2
  • 32
    • 12444310252 scopus 로고    scopus 로고
    • Interleavers for turbo codes using permutation polynomials over integer rings
    • Jan
    • J. Sun and O. Y. Takeshita, "Interleavers for turbo codes using permutation polynomials over integer rings," IEEE Trans. Inf. Theory, vol. 51, pp. 101-119, Jan. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , pp. 101-119
    • Sun, J.1    Takeshita, O.Y.2
  • 33
    • 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. Inf. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inf. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 38
    • 0033099611 scopus 로고    scopus 로고
    • Good error correcting codes based on very sparse matrices
    • Mar
    • D. Mackay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, pp. 399-431, Mar. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , pp. 399-431
    • Mackay, D.1
  • 39
    • 0033337059 scopus 로고    scopus 로고
    • Comparison of constructions of irregular Gallager codes
    • Oct
    • D. MacKay, S. Wilson, and M. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Commun., vol. 47, pp. 498-519, Oct. 1999.
    • (1999) IEEE Trans. Commun , vol.47 , pp. 498-519
    • MacKay, D.1    Wilson, S.2    Davey, M.3
  • 41
    • 5044252858 scopus 로고    scopus 로고
    • Methodologies for designing LDPC codes using protographs and circulants
    • Jun
    • J. Thorpe, K. Andrews, and S. Dolinar, "Methodologies for designing LDPC codes using protographs and circulants," in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2004, p. 238.
    • (2004) Proc. IEEE Int. Symp. Inf. Theory , pp. 238
    • Thorpe, J.1    Andrews, K.2    Dolinar, S.3
  • 48
    • 4444318644 scopus 로고    scopus 로고
    • Selective avoidance of cycles in irregular LDPC code construction
    • Aug
    • T. Tian, C. Jones, J. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, pp. 1242-1247, Aug. 2004.
    • (2004) IEEE Trans. Commun , vol.52 , pp. 1242-1247
    • Tian, T.1    Jones, C.2    Villasenor, J.3    Wesel, R.D.4
  • 49
    • 64349095684 scopus 로고    scopus 로고
    • H. Jin, A. Khandekar, and R. McEliece, Irregular repeat-accumulate codes, in Proc. Int. Symp. Turbo Codes Related Topics, rest, France, Sep. 2000, pp. 1-8.
    • H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. Int. Symp. Turbo Codes Related Topics, "rest, France, Sep. 2000, pp. 1-8.
  • 50
    • 0035246320 scopus 로고    scopus 로고
    • Efficient encoding of low-density parity-check codes
    • Feb
    • T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, pp. 638-656, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , pp. 638-656
    • Richardson, T.1    Urbanke, R.2
  • 51
    • 64349108415 scopus 로고    scopus 로고
    • CCSDS working group white paper, Oct
    • S. Lin, "Quasi-cyclic LDPC codes," CCSDS working group white paper, Oct. 2003.
    • (2003) Quasi-cyclic LDPC codes
    • Lin, S.1
  • 53
    • 64349092506 scopus 로고    scopus 로고
    • C. Jones, E. Valles, M. Smith, and J. Villasenor, Approximate-min constraint node updating for LDPC code decoding, in Proc. IEEE Military Commun. Conf. (MILCOM), oston, MA, Oct. 2004.
    • C. Jones, E. Valles, M. Smith, and J. Villasenor, "Approximate-min constraint node updating for LDPC code decoding," in Proc. IEEE Military Commun. Conf. (MILCOM)," "oston, MA, Oct. 2004.
  • 54
    • 0035246564 scopus 로고    scopus 로고
    • F. R. Kschischang, . J. Frey, and H.-A. Loeliger, Factor graphs and the sum-product algorithm, IEEE Trans. Inf. Theory, pp. 498-519, Feb. 2001.
    • F. R. Kschischang, ". J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, pp. 498-519, Feb. 2001.
  • 55
    • 57849101722 scopus 로고    scopus 로고
    • Node processors for use in parity check decoders,
    • U.S. Patent 6 938 196, Aug
    • T. Richardson and V. Novichkov, "Node processors for use in parity check decoders," U.S. Patent 6 938 196, Aug. 2005.
    • (2005)
    • Richardson, T.1    Novichkov, V.2
  • 59
    • 0032670935 scopus 로고    scopus 로고
    • Convergence of iterative decoding
    • May
    • S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, pp. 806-808, May 1999.
    • (1999) Electron. Lett , vol.35 , pp. 806-808
    • ten Brink, S.1
  • 60
    • 0003681138 scopus 로고    scopus 로고
    • On the theory and applications of space-time and graph-based codes,
    • Ph.D. dissertation, Univ. of Maryland
    • H. El Gamal, "On the theory and applications of space-time and graph-based codes," Ph.D. dissertation, Univ. of Maryland, 1999.
    • (1999)
    • El Gamal, H.1
  • 61
    • 0035332194 scopus 로고    scopus 로고
    • Iterative turbo decoder analysis based on density evolution
    • May
    • D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Sel. Areas Commun., vol. 19, pp. 891-907, May 2001.
    • (2001) IEEE J. Sel. Areas Commun , vol.19 , pp. 891-907
    • Divsalar, D.1    Dolinar, S.2    Pollara, F.3
  • 62
    • 0035246116 scopus 로고    scopus 로고
    • H. El Gamal and A. R. Hammons, Jr., Analyzing the turbo decoder using the Gaussian approximation, IEEE Trans. Inf. Theory, 47, pp. 671-686, Feb. 2001.
    • H. El Gamal and A. R. Hammons, Jr., "Analyzing the turbo decoder using the Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, pp. 671-686, Feb. 2001.
  • 63
    • 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. Inf. Theory, vol. 47, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , pp. 599-618
    • Richardson, T.1    Urbanke, R.2
  • 64
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • Feb
    • T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, pp. 69-637, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , pp. 69-637
    • Richardson, T.1    Shokrollahi, A.2    Urbanke, R.3
  • 66
    • 0003621377 scopus 로고    scopus 로고
    • On the construction of some capacity-approaching coding schemes,
    • Ph.D. dissertation, Massachusetts Inst. of Technology, Cambridge, Sep
    • S. Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, Massachusetts Inst. of Technology, Cambridge, Sep. 2000.
    • (2000)
    • Chung, S.Y.1
  • 70
    • 64349123964 scopus 로고    scopus 로고
    • Turbo codes and interleaver design,
    • Ph.D. dissertation, Cornell Univ, Ithaca, NY, Aug
    • K. Andrews, "Turbo codes and interleaver design," Ph.D. dissertation, Cornell Univ., Ithaca, NY, Aug. 1999.
    • (1999)
    • Andrews, K.1
  • 71
    • 57849102575 scopus 로고    scopus 로고
    • New requirements and trends for channel coding in future space missions
    • Nov
    • G. P. Calzolari, M. Chiani, F. Chiaraluce, R. Garello, and E. Paolini, "New requirements and trends for channel coding in future space missions," Proc. IEEE, vol. 95, no. 11, Nov. 2007.
    • (2007) Proc. IEEE , vol.95 , Issue.11
    • Calzolari, G.P.1    Chiani, M.2    Chiaraluce, F.3    Garello, R.4    Paolini, E.5
  • 72
    • 64349121630 scopus 로고    scopus 로고
    • Digital Video Broadcasting (DVB); Second Generation Framing Structure, Channel Coding and Modulation Systems for Broadcasting, Interactive Services, News Gathering and Other Broadband Satellite Applications, ETSI EN 302 307 V1.1.2, European Telecommunications Standards Institute, Jun. 2006.
    • Digital Video Broadcasting (DVB); Second Generation Framing Structure, Channel Coding and Modulation Systems for Broadcasting, Interactive Services, News Gathering and Other Broadband Satellite Applications, ETSI EN 302 307 V1.1.2, European Telecommunications Standards Institute, Jun. 2006.


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