메뉴 건너뛰기




Volumn 1, Issue , 2001, Pages

Improved upper bound on the bit error probability of turbo codes for ML decoding with imperfect CSI in a Rayleigh fading channel

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; MAXIMUM LIKELIHOOD ESTIMATION; RAYLEIGH FADING;

EID: 0035201153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (15)
  • 9
    • 0033899913 scopus 로고    scopus 로고
    • Improved upper bounds on the decoding error probability of parallel and serial concate-nated turbo codes via their ensemble distance spectrum
    • Shitz, Jan.
    • (2000) IEEE Trans. on Inform. Theory , vol.46 , Issue.1 , pp. 1-23
    • Sason, I.1    Shamai, S.2
  • 12
    • 0002323477 scopus 로고    scopus 로고
    • A simple tight bound on error probability of block codes with application to turbo codes
    • JPL, Nov.
    • (1999) TMO Progress Report , vol.42 , Issue.139 , pp. 1-35
    • Divsalar, D.1
  • 13
    • 0033684729 scopus 로고    scopus 로고
    • Improved upper bounds on the ML performance of turbo codes for interleaved Rician fading channels, with comparison to iterative decoding
    • Shitz, New Orleans, LA, June
    • (2000) Proc. of the IEEE ICC 2000 , pp. 591-596
    • Sason, I.1    Shamai, S.2


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