Tight Upper Bound on the Bit Error Rate of Convolutional Codes over Correlated Nakagami-m Fading Channels

Seongah JEONG
Jinkyu KANG
Hoojin LEE

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E104-A    No.8    pp.1080-1083
Publication Date: 2021/08/01
Publicized: 2021/02/08
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2020EAL2106
Type of Manuscript: LETTER
Category: Communication Theory and Signals
Keyword: 
asymptotic analysis,  convolutional codes,  linear block codes,  bit error rate (BER),  pairwise error event probabilities (PEEP),  Nakagami-m fading channels,  performance analysis,  

Full Text: PDF(322.1KB)>>
Buy this Article



Summary: 
In this letter, we investigate tight analytical and asymptotic upper bounds for bit error rate (BER) of constitutional codes over exponentially correlated Nakagami-m fading channels. Specifically, we derive the BER expression depending on an exact closed-form formula for pairwise error event probabilities (PEEP). Moreover, the corresponding asymptotic analysis in high signal-to-noise ratio (SNR) regime is also explored, which is verified via numerical results. This allows us to have explicit insights on the achievable coding gain and diversity order.


open access publishing via