The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 편지에서 우리는 지수적으로 상관된 Nakagami에 대한 헌법 코드의 비트 오류율(BER)에 대한 엄격한 분석 및 점근적 상한을 조사합니다.m 페이딩 채널. 구체적으로, 쌍별 오류 이벤트 확률(PEEP)에 대한 정확한 폐쇄형 공식에 따라 BER 표현식을 유도합니다. 또한, 높은 신호 대 잡음비(SNR) 체계에서 해당 점근 분석도 조사되었으며 이는 수치 결과를 통해 검증됩니다. 이를 통해 달성 가능한 코딩 이득 및 다양성 순서에 대한 명시적인 통찰력을 얻을 수 있습니다.
Seongah JEONG
Kyungpook National University
Jinkyu KANG
Myongji University
Hoojin LEE
Hansung University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Seongah JEONG, Jinkyu KANG, Hoojin LEE, "Tight Upper Bound on the Bit Error Rate of Convolutional Codes over Correlated Nakagami-m Fading Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 8, pp. 1080-1083, August 2021, doi: 10.1587/transfun.2020EAL2106.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2106/_p
부
@ARTICLE{e104-a_8_1080,
author={Seongah JEONG, Jinkyu KANG, Hoojin LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Tight Upper Bound on the Bit Error Rate of Convolutional Codes over Correlated Nakagami-m Fading Channels},
year={2021},
volume={E104-A},
number={8},
pages={1080-1083},
abstract={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.},
keywords={},
doi={10.1587/transfun.2020EAL2106},
ISSN={1745-1337},
month={August},}
부
TY - JOUR
TI - Tight Upper Bound on the Bit Error Rate of Convolutional Codes over Correlated Nakagami-m Fading Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1080
EP - 1083
AU - Seongah JEONG
AU - Jinkyu KANG
AU - Hoojin LEE
PY - 2021
DO - 10.1587/transfun.2020EAL2106
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2021
AB - 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.
ER -