메뉴 건너뛰기




Volumn , Issue , 2011, Pages 128-133

The power cost of over-designing codes

Author keywords

Interconnects; Large Girth Codes; LDPC Decoding; Low Power Digital Circuits; Tradeoffs

Indexed keywords

CODE DESIGNS; CODING THEORY; DECODING ALGORITHM; LARGE GIRTH CODES; LDPC CODES; LOW-POWER DIGITAL CIRCUITS; POWER COSTS; TRADEOFFS;

EID: 84055183556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SiPS.2011.6088962     Document Type: Conference Paper
Times cited : (25)

References (18)
  • 7
    • 80052073744 scopus 로고    scopus 로고
    • Towards a communication-theoretic understanding of system-level power consumption
    • Arxiv preprint arXiv:1010.4855, to appear
    • P. Grover, K. Woyach, and A. Sahai, "Towards a communication- theoretic understanding of system-level power consumption," Arxiv preprint arXiv:1010.4855, IEEE Journal on Selected Areas in Communication, to appear, 2011.
    • (2011) IEEE Journal on Selected Areas in Communication
    • Grover, P.1    Woyach, K.2    Sahai, A.3
  • 13
    • 31344476518 scopus 로고    scopus 로고
    • Structured LDPC codes for high-density recording: Large girth and low error floor
    • DOI 10.1109/TMAG.2005.861748
    • J. Lu and J. M. F. Moura, "Structured LDPC codes for High-Density Recording: Large Girth and Low Error Floor," IEEE Transactions on Magnetics, vol. 42, no. 2, pp. 208-213, 2006. (Pubitemid 43146021)
    • (2006) IEEE Transactions on Magnetics , vol.42 , Issue.2 , pp. 208-213
    • Lu, J.1    Moura, J.M.F.2
  • 14
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533-547, 1981.
    • (1981) IEEE Transactions on Information Theory , vol.27 , Issue.5 , pp. 533-547
    • Tanner, R.M.1
  • 15
    • 3943064364 scopus 로고    scopus 로고
    • Quasi-cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices
    • M. P. Fossorier, "Quasi-cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices," IEEE Transactions on InformationTheory, vol. 50, no. 8, pp. 599-618, 2004.
    • (2004) IEEE Transactions on InformationTheory , vol.50 , Issue.8 , pp. 599-618
    • Fossorier, M.P.1
  • 18
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb.
    • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2


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