메뉴 건너뛰기




Volumn 55, Issue 1, 2008, Pages 74-78

Block-interlaced LDPC decoders with reduced interconnect complexity

Author keywords

10 GB Ethernet; Channel coding; Decoder architectures; Iterative message passing; Low density parity check (LDPC) codes; Very large scale integration (VLSI)

Indexed keywords

DECODING; FORWARD ERROR CORRECTION; ITERATIVE METHODS; MESSAGE PASSING; VLSI CIRCUITS;

EID: 48749115194     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2007.905328     Document Type: Article
Times cited : (57)

References (18)
  • 2
    • 64749110303 scopus 로고    scopus 로고
    • World Wide Web, Jun. 8, 2004 [Online, Available
    • World Wide Web, IEEE 802.3an Task Force, Jun. 8, 2004 [Online]. Available: http://www.ieee802.org/3/an/index.html
    • IEEE 802.3an Task Force
  • 3
    • 64749092428 scopus 로고    scopus 로고
    • Draft European Telecommunication Standards Institue, EN 302 307 V1.1.1, Jun. 2004.
    • Draft European Telecommunication Standards Institue, EN 302 307 V1.1.1, Jun. 2004.
  • 4
    • 0003544551 scopus 로고    scopus 로고
    • IEEE 802.16e Standard, Feb. 28, Online, Available
    • IEEE Standard for Local and Metropolitan Area Networks, IEEE 802.16e Standard, Feb. 28, 2006 [Online]. Available: http:// standards.ieee.org/getieee802/download/802.16e-2005.pdf
    • (2006) IEEE Standard for Local and Metropolitan Area Networks
  • 5
    • 0036504121 scopus 로고    scopus 로고
    • A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check decoder
    • Mar
    • A. J. Blanksby and C. J. Howland, "A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check decoder," IEEE J.Solid-State Circuits, vol. 37, no. 3, pp. 404-412, Mar. 2002.
    • (2002) IEEE J.Solid-State Circuits , vol.37 , Issue.3 , pp. 404-412
    • Blanksby, A.J.1    Howland, C.J.2
  • 7
    • 0035246564 scopus 로고    scopus 로고
    • Factor graphs and the sum-product algorithm
    • Feb
    • F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 498-519
    • Kschischang, F.R.1    Frey, B.J.2    Loeliger, H.A.3
  • 8
    • 0035573160 scopus 로고    scopus 로고
    • Joint code and decoder design for implementation-oriented (3, k)-regular LDPC codes
    • Nov
    • T. Zhang and K. K. Parhi, "Joint code and decoder design for implementation-oriented (3, k)-regular LDPC codes," in Proc. IEEE Asilomar Conf., Nov. 2001, pp. 1232-1236.
    • (2001) Proc. IEEE Asilomar Conf , pp. 1232-1236
    • Zhang, T.1    Parhi, K.K.2
  • 9
    • 67649112194 scopus 로고    scopus 로고
    • Multi-Gbit/sec low density parity check decoders with reduced interconnect complexity
    • Kobe, Japan, May
    • A. Darabiha, A. Chan Carusone, and F. R. Kschischang, "Multi-Gbit/sec low density parity check decoders with reduced interconnect complexity," in Proc. ISCAS, Kobe, Japan, May 2005, vol. 5, pp. 5194-5197.
    • (2005) Proc. ISCAS , vol.5 , pp. 5194-5197
    • Darabiha, A.1    Chan Carusone, A.2    Kschischang, F.R.3
  • 10
    • 0035685606 scopus 로고    scopus 로고
    • High throughput low-density parity-check decoder architectures
    • E. Yeo, P. Pakzad, B. Nikolic, and V. Anantharam, "High throughput low-density parity-check decoder architectures," in Proc. IEEE GLOBECOM, 2001, pp. 3019-3024.
    • (2001) Proc. IEEE GLOBECOM , pp. 3019-3024
    • Yeo, E.1    Pakzad, P.2    Nikolic, B.3    Anantharam, V.4
  • 12
    • 0002136225 scopus 로고
    • Steiner minimal trees
    • Jan
    • E. N. Gilbert and H. O. Pollak, "Steiner minimal trees," SIAM J. Appl. Math., vol. 16, no. 1, pp. 1-29, Jan. 1968.
    • (1968) SIAM J. Appl. Math , vol.16 , Issue.1 , pp. 1-29
    • Gilbert, E.N.1    Pollak, H.O.2
  • 13
    • 33646533730 scopus 로고    scopus 로고
    • Loosely coupled memory-based decoding architecture for low density parity check codes
    • May
    • S.-H. Kang and I.-C. Park, "Loosely coupled memory-based decoding architecture for low density parity check codes," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 5, pp. 1045-1056, May 2006.
    • (2006) IEEE Trans. Circuits Syst. I, Reg. Papers , vol.53 , Issue.5 , pp. 1045-1056
    • Kang, S.-H.1    Park, I.-C.2
  • 15
    • 0036967287 scopus 로고    scopus 로고
    • On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes
    • F. Zarkeshvari and A. Banihashemi, "On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes," in Proc. IEEE GLOBECOM, 2002, pp. 1349-1353.
    • (2002) Proc. IEEE GLOBECOM , pp. 1349-1353
    • Zarkeshvari, F.1    Banihashemi, A.2
  • 16
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb
    • T. R. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.R.1    Urbanke, R.L.2
  • 17
    • 3042549356 scopus 로고    scopus 로고
    • Overlapped message passing for quasi-cyclic low-density parity check codes
    • Jun
    • Y. Chen and K. K. Parhi, "Overlapped message passing for quasi-cyclic low-density parity check codes," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 51, no. 6, pp. 1106-1113, Jun. 2004.
    • (2004) IEEE Trans. Circuits Syst. I, Reg. Papers , vol.51 , Issue.6 , pp. 1106-1113
    • Chen, Y.1    Parhi, K.K.2


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