메뉴 건너뛰기




Volumn E88-A, Issue 12, 2005, Pages 3627-3634

Some classes of quasi-cyclic LDPC codes: Properties and efficient encoding method

Author keywords

Array codes; Division circuit; Encoder; Fossorier codes; LDPC codes; Quasi cyclic codes; SFT codes

Indexed keywords

CIRCUIT THEORY; CODES (SYMBOLS); COMPUTER HARDWARE; ERROR ANALYSIS;

EID: 29144467075     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e88-a.12.3627     Document Type: Article
Times cited : (23)

References (30)
  • 2
    • 0003324734 scopus 로고    scopus 로고
    • Array codes
    • Chapter 22, ed. V.S. Pless and W.C. Huffman, Elsevier Science
    • M. Blaum, P. Farrell, and H. van Tilborg, "Array codes," in Handbook of Coding Theory, Chapter 22, ed. V.S. Pless and W.C. Huffman, Elsevier Science, 1998.
    • (1998) Handbook of Coding Theory
    • Blaum, M.1    Farrell, P.2    Van Tilborg, H.3
  • 3
    • 0027307914 scopus 로고
    • New array codes for multiple phased burst correction
    • M. Blaum and R.M. Roth, "New array codes for multiple phased burst correction," IEEE Trans. Inf. Theory, vol.39, no.1, pp.66-77, 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.1 , pp. 66-77
    • Blaum, M.1    Roth, R.M.2
  • 5
    • 5044248633 scopus 로고    scopus 로고
    • G.gen: LDPC codes for G.dmt.bis and G.lite.bis
    • ITU - Telecommunication Standardization Sector, Study Group 15, Jan.
    • E. Eleftheriou and S. Ölçer, "G.gen: LDPC codes for G.dmt.bis and G.lite.bis.," ITU - Telecommunication Standardization Sector, Study Group 15, Temporary Document CF-060, Jan. 2001.
    • (2001) Temporary Document , vol.CF-060
    • Eleftheriou, E.1    Ölçer, S.2
  • 7
    • 85027131378 scopus 로고    scopus 로고
    • G.gen: G.dmt.bis: G.lite.bis: Efficient encoding of LDPC codes for ADSL
    • ITU - Telecommunication Standardization Sector, Study Group 15, Aug.
    • E. Eleftheriou, S. Ölçer, M. Sorbara, and Y. Goldstein, "G.gen: G.dmt.bis: G.lite.bis: Efficient encoding of LDPC codes for ADSL," ITU - Telecommunication Standardization Sector, Study Group 15, Temporary Document SC-064, Aug. 2001.
    • (2001) Temporary Document , vol.SC-064
    • Eleftheriou, E.1    Ölçer, S.2    Sorbara, M.3    Goldstein, Y.4
  • 11
    • 3943064364 scopus 로고    scopus 로고
    • Quasi-cyclic low-density parity-check codes from circulant permutation matrices
    • M. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol.50, no.8, pp.1788-1793, 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.8 , pp. 1788-1793
    • Fossorier, M.1
  • 12
    • 85027128500 scopus 로고    scopus 로고
    • An efficient encoding method for LDPC codes based on cyclic shift
    • Higashiura, Hyogo, Japan, Dec.
    • H. Fujita and K. Sakaniwa, "An efficient encoding method for LDPC codes based on cyclic shift," Proc. 2003 SITA, Higashiura, Hyogo, Japan, Dec. 2003
    • (2003) Proc. 2003 SITA
    • Fujita, H.1    Sakaniwa, K.2
  • 13
    • 85027162117 scopus 로고    scopus 로고
    • Chicago, IL USA, June-July
    • and see also Proc. 2004 IEEE ISIT, p.276, Chicago, IL USA, June-July 2004.
    • (2004) Proc. 2004 IEEE ISIT , pp. 276
  • 16
    • 0035504019 scopus 로고    scopus 로고
    • Low-density parity-check codes based on finite geometries: A rediscovery and new results
    • Y. Kou, S, Lin, and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol.47, no.7, pp.2711-2736, 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.7 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 17
    • 0036351583 scopus 로고    scopus 로고
    • Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes
    • Lausanne, Switzerland, June-July
    • T. Mittelhozer, "Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes," Proc. IEEE International Symposium on Information Theory, p.282, Lausanne, Switzerland, June-July 2002.
    • (2002) Proc. IEEE International Symposium on Information Theory , pp. 282
    • Mittelhozer, T.1
  • 19
    • 0842289304 scopus 로고    scopus 로고
    • Decoder architecture for array-code-based LDPC codes
    • S. Ölçer, "Decoder architecture for array-code-based LDPC codes," Proc. IEEE GLOBECOM, vol.4, pp.2046-2050, 2003.
    • (2003) Proc. IEEE GLOBECOM , vol.4 , pp. 2046-2050
    • Ölçer, S.1
  • 21
    • 0035246320 scopus 로고    scopus 로고
    • Efficient encoding of low-density parity-check codes
    • T.J. Richardson and R.L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol.47, no.2, pp.638-656, 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 638-656
    • Richardson, T.J.1    Urbanke, R.L.2
  • 22
    • 0142155100 scopus 로고    scopus 로고
    • Construction of cyclic codes suitable for iterative decoding via generating idempotents
    • April
    • T. Shibuya and K. Sakaniwa, "Construction of cyclic codes suitable for iterative decoding via generating idempotents," IEICE Trans. Fundamentals, vol.E86-A, no.4, pp.928-939, April 2003.
    • (2003) IEICE Trans. Fundamentals , vol.E86-A , Issue.4 , pp. 928-939
    • Shibuya, T.1    Sakaniwa, K.2
  • 23
    • 85032751571 scopus 로고    scopus 로고
    • Low-density parity-check codes for partial response channels
    • Jan.
    • H. Song and B.V.K. Vijaya Kumar, "Low-density parity-check codes for partial response channels," IEEE Signal Process. Mag., pp.56-66, Jan. 2004.
    • (2004) IEEE Signal Process. Mag. , pp. 56-66
    • Song, H.1    Kumar, B.V.K.V.2
  • 25
    • 0035246312 scopus 로고    scopus 로고
    • Minimum-distance bounds by graph analysis
    • R.M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. Inf. Theory, vol.47, no.2, pp.808-821, 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 808-821
    • Tanner, R.M.1
  • 28
    • 0346707318 scopus 로고    scopus 로고
    • On the minimum distance of array codes as LDPC codes
    • K. Yang and T. Helleseth, "On the minimum distance of array codes as LDPC codes," IEEE Trans. Inf. Theory, vol.49, no.12, pp.3268-3271, 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.12 , pp. 3268-3271
    • Yang, K.1    Helleseth, T.2
  • 29
    • 0035150335 scopus 로고    scopus 로고
    • VLSI implementation-oriented (3, k)regular low density parity check codes
    • Sept.
    • T. Zhang and K.K. Parhi, "VLSI implementation-oriented (3, k)regular low density parity check codes," Proc. IEEE Workshop on Signal Processing Systems, pp.25-36, Sept. 2001.
    • (2001) Proc. IEEE Workshop on Signal Processing Systems , pp. 25-36
    • Zhang, T.1    Parhi, K.K.2


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