.png){kind=icon}
Return
A Low-Complexity Soft Localization Algorithm Based on Expectation Propagation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3323768.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Location awareness enables applications that rely on positional information contained in wireless signals. However, fully extracting this information and utilizing it with low complexity remains challenging. In this letter, we introduce a low-complexity soft localization algorithm based on expectation propagation (EP). Firstly, we construct a factor graph for soft localization, which involves complex local functions. Next, a latent variable is introduced to simplify these functions, resulting in a new factor graph. Leveraging this graph, we develop an efficient soft localization algorithm based on EP. Finally, simulation results demonstrate that the proposed algorithm can achieve precise localization with low computational complexity.
Keywords:
Soft localization
factor graphs
expectation propagation
low complexity
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
ShareSave
A Flavo-Diiron Protein from Desulfovibrio vulgaris with Oxidase and Nitric Oxide Reductase Activities. Evidence for an in Vivo Nitric Oxide Scavenging Function.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more