arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

支持感知的5G定位遥测压缩:基于条件冲突图

Support-Aware Telemetry Compression for 5G Positioning via Conditional Conflict Graphs

Mohammad Reza Deylam Salehi, Hakima Chaouchi

arXiv 2609.12933首次发表:更新:

发表机构

Télécom SudParis, Institut Polytechnique de Paris(巴黎理工学院电信南方学院)

机构由 AI 辅助整理,请以论文原文为准。

AI 中文总结

针对5G定位中TRP向LMF报告量化测量的冗余问题,提出条件冲突图与交替码本构建,实现零误差可解码的遥测压缩,显著降低理想速率并保持服务决策精度。

AI 中文摘要

地理上分离的发送/接收点(TRP)将量化测量结果报告给位置管理功能(LMF),即使应用仅需要粗略的位置区域。我们将此任务表述为分布式零误差函数计算问题,其中每个TRP传输一个索引,足以使LMF重现所需的服务决策。由于定位几何结构导致支持域稀疏且非矩形,独立构建的每终端特征图着色不一定可联合解码。我们引入了一个条件冲突图,精确刻画有效的单终端更新,并开发了一种交替码本构建方法,保持全局零误差可解码性。在一个可复现的三TRP研究中,使用距离等效定时测量和$120$个原生分箱,所有生成的码本均通过显式解码器冲突测试。对于服务小区尺寸最大为$100$米,实现的理想速率为每TRP每周期$5.38$--$5.44$比特,而原始报告为$6.91$比特,全局有效的基于区间的基线为$6.56$--$6.87$比特。一项补充的实测六基站TDoA研究表明,$83.77\%$的学习原生支持域在独立轨迹上重现。对于这些重现的元组,码本精确保留服务决策,并在$2$--$8$米服务网格上将理想速率降低$22.8$--$35.6\%$。可行的报告元组集还提供了在注入定时偏差下的单周期几何一致性检查。最后,我们确定了实验实施所需的NRPPa/OpenAirInterface集成点和保障措施。

英文摘要

Geographically separated transmission/reception points (TRPs) report quantized measurements to a Location Management Function (LMF), even when the application requires only a coarse location region. We formulate this task as a distributed zero-error function-computation problem, in which each TRP transmits an index sufficient for the LMF to reproduce the required service decision. Since positioning geometry induces a sparse and nonrectangular support, independently constructed per-terminal characteristic-graph colorings are not necessarily jointly decodable. We introduce a conditional conflict graph that exactly characterizes valid single-terminal updates and develop an alternating codebook construction that preserves global zero-error decodability. In a reproducible three-TRP study with range-equivalent timing measurements and $120$ native bins, all resulting codebooks satisfy an explicit decoder-conflict test. For service-cell sizes up to $100$ m, the achieved ideal rate is $5.38$--$5.44$ bits per epoch per TRP, compared with $6.91$ bits for raw reporting and $6.56$--$6.87$ bits for a globally valid interval-based baseline. A complementary measured six-base-station TDoA study shows that $83.77\%$ of the learned native support recurs on an independent trajectory. For these recurrent tuples, the codebooks preserve the service decision exactly and reduce the ideal rate by $22.8$--$35.6\%$ for $2$--$8$ m service grids. The feasible report-tuple set also provides a single-epoch geometric-consistency check under injected timing bias. Finally, we identify the NRPPa/OpenAirInterface integration points and safeguards required for experimental implementation.

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑