메뉴 건너뛰기




Volumn , Issue , 2012, Pages 57-65

LDPC decoding on the Intel SCC

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION STANDARDS; DECODING ALGORITHM; DISTRIBUTED MEMORY; ERROR CORRECTING CODE; ERROR PROBABILITIES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MANY-CORE; NOISY CHANNEL; PARALLELIZATIONS; RESEARCH LABS; SHARED MEMORIES; SHARED MEMORY MODEL; SINGLE-CHIP; TRANSMIT DATA;

EID: 84862130077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2012.79     Document Type: Conference Paper
Times cited : (2)

References (15)
  • 3
    • 56549117046 scopus 로고    scopus 로고
    • High coded data rate and multicodeword wimax ldpc decoding on cell/be
    • November
    • G. Falcao, V. Silva, and L. Sousa. High coded data rate and multicodeword wimax ldpc decoding on cell/be. IET Electronics Letters, 44(24):1415-1417, November 2008.
    • (2008) IET Electronics Letters , vol.44 , Issue.24 , pp. 1415-1417
    • Falcao, G.1    Silva, V.2    Sousa, L.3
  • 7
    • 84862130127 scopus 로고    scopus 로고
    • Cuda homepage
    • http://developer.nvidia.com/object/cuda.html. Cuda homepage.
  • 8
    • 84879804402 scopus 로고    scopus 로고
    • http://www.intel.com/content/www/us/en/architecture-andtechnology/ many-integrated-core/intel-many-integratedcore.architecture.html. Intel many integrated core architecture.
    • Intel Many Integrated Core Architecture
  • 10
    • 0030219216 scopus 로고    scopus 로고
    • Near shannon limit performance of low density parity check codes
    • August
    • D. J. C. Mackay and R. M. Neal. Near shannon limit performance of low density parity check codes. IEE Electronics Letters, 32(18):1645-1646, August 1996.
    • (1996) IEE Electronics Letters , vol.32 , Issue.18 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 13
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • September
    • R. Tanner. A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5):533-547, September 1981.
    • (1981) IEEE Transactions on Information Theory , vol.27 , Issue.5 , pp. 533-547
    • Tanner, R.1


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