On Optimality of Gamma Approximation for Lognormal Shadowing Models

On Optimality of Gamma Approximation for Lognormal Shadowing Models
复制标题

对数正态阴影模型伽玛逼近的最优性

DOI:
10.1109/lawp.2022.3233522
复制
发表时间:
2023
影响因子:
4.2
通讯作者:
Dang S
Dang S
中科院分区:
计算机科学2区
文献类型:
--
作者:
Dang S

文献摘要

参考文献

相似文献

在这封信中,我们研究对数正态阴影模型伽马近似的信息论最优性,以便为这一有用的技术提供严格的数学基础。具体地说,我们采用Kullback-Leibler(KL)散度作为度量原始对数正态分布与近似伽马分布之间距离的度量。由矩匹配准则得到的KL发散、伽马近似的最小可达KL发散以及统计参数映射关系都是闭合形式的。通过这些封闭形式的解析表达式,我们能够用基准严格地检验伽马近似的实用性和最优性。比较矩匹配和最小可达基准的KL发散度的闭合表达式,发现矩匹配准则作为一种启发式方法,不能保证信息论的最优性。我们还给出并讨论了相关结果,以证实我们提出的统计参数映射关系和相应的分析见解所实现的信息论最优性。
In this letter, we study the information-theoretic optimality of the gamma approximation for lognormal shadowing models in order to provide a rigorous mathematical ground for this useful technique. Specifically, we adopt the Kullback–Leibler (KL) divergence as the metric quantifying the distance between the original lognormal and the approximate gamma distributions. The KL divergence resulted from the moment matching criterion, the minimum achievable KL divergence of the gamma approximation, and the statistical parameter mapping relations are all derived in closed form. By these closed-form analytical expressions, we are able to rigorously examine the utility and optimality of the gamma approximation with a benchmark. Comparing the closed-form expressions of the KL divergence by moment matching and the minimum achievable benchmark, we find that the moment matching criterion, as a heuristic method, cannot guarantee the information-theoretic optimality. We also present and discuss the relevant results to substantiate the information-theoretic optimality achieved by our proposed statistical parameter mapping relations and the corresponding analytical insights.
太赫兹无线通信系统的中断性能研究
DOI: --
发表时间: 2022
影响因子: 8.3
作者:
Jia Ye;Shuping Dang;Guoqing Ma;Osama Amin;B. Shihada;Mohamed
通讯作者: Mohamed
基于射线级演化的3D非平稳宽带大规模MIMO信道模型
DOI: --
发表时间: 2021
影响因子: 8.3
作者:
Carlos F. López;Chengxiang Wang;Y. Zheng
通讯作者: Y. Zheng
DOI: --
发表时间: 2003
期刊:
影响因子: --
作者:
O. Espinosa;V. Moll
通讯作者: V. Moll