arXiv - MATH - Information Theory最新文献_第5页

Compute-Forward Multiple Access for Gaussian MIMO Channels 高斯多输入多输出信道的计算前向多路访问

arXiv - MATH - Information Theory Pub Date : 2024-09-09 DOI: arxiv-2409.06110

Lanwei Zhang, Jamie Evans, Jingge Zhu

{"title":"Compute-Forward Multiple Access for Gaussian MIMO Channels","authors":"Lanwei Zhang, Jamie Evans, Jingge Zhu","doi":"arxiv-2409.06110","DOIUrl":"https://doi.org/arxiv-2409.06110","url":null,"abstract":"Compute-forward multiple access (CFMA) is a multiple access transmission\u0000scheme based on Compute-and-Forward (CF) which allows the receiver to first\u0000decode linear combinations of the transmitted signals and then solve for\u0000individual messages. This paper extends the CFMA scheme to a two-user Gaussian\u0000multiple-input multiple-output (MIMO) multiple access channel (MAC). We propose\u0000the CFMA serial coding scheme (SCS) and the CFMA parallel coding scheme (PCS)\u0000with nested lattice codes. We first derive the expression of the achievable\u0000rate pair for MIMO MAC with CFMA-SCS. We prove a general condition under which\u0000CFMA-SCS can achieve the sum capacity of the channel. Furthermore, this result\u0000is specialized to single-input multiple-output (SIMO) and $2$-by-$2$ diagonal\u0000MIMO multiple access channels, for which more explicit sum capacity-achieving\u0000conditions on power and channel matrices are derived. We construct an\u0000equivalent SIMO model for CFMA-PCS and also derive the achievable rates. Its\u0000sum capacity achieving conditions are then analysed. Numerical results are\u0000provided for the performance of CFMA-SCS and CFMA-PCS in different channel\u0000conditions. In general, CFMA-PCS has better sum capacity achievability with\u0000higher coding complexity.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator 基于形状算子局部估计的自适应 k$ 近邻分类器

arXiv - MATH - Information Theory Pub Date : 2024-09-08 DOI: arxiv-2409.05084

Alexandre Luís Magalhães Levada, Frank Nielsen, Michel Ferreira Cardia Haddad

{"title":"Adaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator","authors":"Alexandre Luís Magalhães Levada, Frank Nielsen, Michel Ferreira Cardia Haddad","doi":"arxiv-2409.05084","DOIUrl":"https://doi.org/arxiv-2409.05084","url":null,"abstract":"The $k$-nearest neighbor ($k$-NN) algorithm is one of the most popular\u0000methods for nonparametric classification. However, a relevant limitation\u0000concerns the definition of the number of neighbors $k$. This parameter exerts a\u0000direct impact on several properties of the classifier, such as the\u0000bias-variance tradeoff, smoothness of decision boundaries, robustness to noise,\u0000and class imbalance handling. In the present paper, we introduce a new adaptive\u0000$k$-nearest neighbours ($kK$-NN) algorithm that explores the local curvature at\u0000a sample to adaptively defining the neighborhood size. The rationale is that\u0000points with low curvature could have larger neighborhoods (locally, the tangent\u0000space approximates well the underlying data shape), whereas points with high\u0000curvature could have smaller neighborhoods (locally, the tangent space is a\u0000loose approximation). We estimate the local Gaussian curvature by computing an\u0000approximation to the local shape operator in terms of the local covariance\u0000matrix as well as the local Hessian matrix. Results on many real-world datasets\u0000indicate that the new $kK$-NN algorithm yields superior balanced accuracy\u0000compared to the established $k$-NN method and also another adaptive $k$-NN\u0000algorithm. This is particularly evident when the number of samples in the\u0000training data is limited, suggesting that the $kK$-NN is capable of learning\u0000more discriminant functions with less data considering many relevant cases.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A General Framework for Clustering and Distribution Matching with Bandit Feedback 带 Bandit 反馈的聚类和分布匹配通用框架

arXiv - MATH - Information Theory Pub Date : 2024-09-08 DOI: arxiv-2409.05072

Recep Can Yavas, Yuqi Huang, Vincent Y. F. Tan, Jonathan Scarlett

{"title":"A General Framework for Clustering and Distribution Matching with Bandit Feedback","authors":"Recep Can Yavas, Yuqi Huang, Vincent Y. F. Tan, Jonathan Scarlett","doi":"arxiv-2409.05072","DOIUrl":"https://doi.org/arxiv-2409.05072","url":null,"abstract":"We develop a general framework for clustering and distribution matching\u0000problems with bandit feedback. We consider a $K$-armed bandit model where some\u0000subset of $K$ arms is partitioned into $M$ groups. Within each group, the\u0000random variable associated to each arm follows the same distribution on a\u0000finite alphabet. At each time step, the decision maker pulls an arm and\u0000observes its outcome from the random variable associated to that arm.\u0000Subsequent arm pulls depend on the history of arm pulls and their outcomes. The\u0000decision maker has no knowledge of the distributions of the arms or the\u0000underlying partitions. The task is to devise an online algorithm to learn the\u0000underlying partition of arms with the least number of arm pulls on average and\u0000with an error probability not exceeding a pre-determined value $delta$.\u0000Several existing problems fall under our general framework, including finding\u0000$M$ pairs of arms, odd arm identification, and $M$-ary clustering of $K$ arms\u0000belong to our general framework. We derive a non-asymptotic lower bound on the\u0000average number of arm pulls for any online algorithm with an error probability\u0000not exceeding $delta$. Furthermore, we develop a computationally-efficient\u0000online algorithm based on the Track-and-Stop method and Frank--Wolfe algorithm,\u0000and show that the average number of arm pulls of our algorithm asymptotically\u0000matches that of the lower bound. Our refined analysis also uncovers a novel\u0000bound on the speed at which the average number of arm pulls of our algorithm\u0000converges to the fundamental limit as $delta$ vanishes.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

From Concept to Reality: 5G Positioning with Open-Source Implementation of UL-TDoA in OpenAirInterface 从概念到现实：利用 OpenAirInterface 中的 UL-TDoA 开源实现 5G 定位

arXiv - MATH - Information Theory Pub Date : 2024-09-08 DOI: arxiv-2409.05217

Adeel Malik, Mohsen Ahadi, Florian Kaltenberger, Klaus Warnke, Nguyen Tien Thinh, Nada Bouknana, Cedric Thienot, Godswill Onche, Sagar Arora

{"title":"From Concept to Reality: 5G Positioning with Open-Source Implementation of UL-TDoA in OpenAirInterface","authors":"Adeel Malik, Mohsen Ahadi, Florian Kaltenberger, Klaus Warnke, Nguyen Tien Thinh, Nada Bouknana, Cedric Thienot, Godswill Onche, Sagar Arora","doi":"arxiv-2409.05217","DOIUrl":"https://doi.org/arxiv-2409.05217","url":null,"abstract":"This paper presents, for the first time, an open-source implementation of the\u00003GPP Uplink Time Difference of Arrival (UL-TDoA) positioning method using the\u0000OpenAirInterface (OAI) framework. UL-TDoA is a critical positioning technique\u0000in 5G networks, leveraging the time differences of signal arrival at multiple\u0000base stations to determine the precise location of User Equipment (UE). This\u0000implementation aims to democratize access to advanced positioning technology by\u0000integrating UL-TDoA capabilities into both the Radio Access Network (RAN) and\u0000Core Network (CN) components of OAI, providing a comprehensive and\u00003GPP-compliant solution. The development includes the incorporation of essential protocol procedures,\u0000message flows, and interfaces as defined by 3GPP standards. Validation is\u0000conducted using two distinct methods: an OAI-RF simulator-based setup for\u0000controlled testing and an O-RAN-based Localization Testbed at EURECOM in\u0000real-world conditions. The results demonstrate the viability of this\u0000open-source UL-TDoA implementation, enabling precise positioning in various\u0000environments. By making this implementation publicly available, the study paves\u0000the way for widespread research, development, and innovation in the field of 5G\u0000positioning technologies, fostering collaboration and accelerating the\u0000advancement of cellular network positioning.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"37 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Double-Difference Doppler Shift-Based Positioning Framework with Ephemeris Error Correction of LEO Satellites 基于双差分多普勒频移的定位框架与低地轨道卫星星历误差校正

arXiv - MATH - Information Theory Pub Date : 2024-09-08 DOI: arxiv-2409.05026

Md. Ali Hasan, M. Humayun Kabir, Md. Shafiqul Islam, Sangmin Han, Wonjae Shin

{"title":"A Double-Difference Doppler Shift-Based Positioning Framework with Ephemeris Error Correction of LEO Satellites","authors":"Md. Ali Hasan, M. Humayun Kabir, Md. Shafiqul Islam, Sangmin Han, Wonjae Shin","doi":"arxiv-2409.05026","DOIUrl":"https://doi.org/arxiv-2409.05026","url":null,"abstract":"In signals of opportunity (SOPs)-based positioning utilizing low Earth orbit\u0000(LEO) satellites, ephemeris data derived from two-line element files can\u0000introduce increasing error over time. To handle the erroneous measurement, an\u0000additional base receiver with a known position is often used to compensate for\u0000the effect of ephemeris error when positioning the user terminal (UT). However,\u0000this approach is insufficient for the long baseline (the distance between the\u0000base receiver and UT) as it fails to adequately correct Doppler shift\u0000measurement errors caused by ephemeris inaccuracies, resulting in degraded\u0000positioning performance. Moreover, the lack of clock synchronization between\u0000the base receiver and UT exacerbates erroneous Doppler shift measurements. To\u0000address these challenges, we put forth a robust double-difference Doppler\u0000shift-based positioning framework, coined 3DPose, to handle the clock\u0000synchronization issue between the base receiver and UT, and positioning\u0000degradation due to the long baseline. The proposed 3DPose framework leverages\u0000double-difference Doppler shift measurements to eliminate the clock\u0000synchronization issue and incorporates a novel ephemeris error correction\u0000algorithm to enhance UT positioning accuracy in case of the long baseline. The\u0000algorithm specifically characterizes and corrects the Doppler shift measurement\u0000errors arising from erroneous ephemeris data, focusing on satellite position\u0000errors in the tangential direction. To validate the effectiveness of the\u0000proposed framework, we conduct comparative analyses across three different\u0000scenarios, contrasting its performance with the existing differential Doppler\u0000positioning method. The results demonstrate that the proposed 3DPose framework\u0000achieves an average reduction of 90% in 3-dimensional positioning errors\u0000compared to the existing differential Doppler approach.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Moment Constraints and Phase Recovery for Multireference Alignment 多参考对齐的力矩约束和相位恢复

arXiv - MATH - Information Theory Pub Date : 2024-09-07 DOI: arxiv-2409.04868

Vahid Shahverdi, Emanuel Ström, Joakim Andén

引用次数: 0

Hybrid Beamforming with Widely-spaced-array for Multi-user Cross-Near-and-Far-Field Communications 用于多用户跨近远场通信的宽间隔阵列混合波束成形技术

arXiv - MATH - Information Theory Pub Date : 2024-09-07 DOI: arxiv-2409.04682

Heyin Shen, Yuhang Chen, Chong Han, Jinhong Yuan

{"title":"Hybrid Beamforming with Widely-spaced-array for Multi-user Cross-Near-and-Far-Field Communications","authors":"Heyin Shen, Yuhang Chen, Chong Han, Jinhong Yuan","doi":"arxiv-2409.04682","DOIUrl":"https://doi.org/arxiv-2409.04682","url":null,"abstract":"With multi-GHz bandwidth, Terahertz (THz) beamforming has drawn increasing\u0000attention in the sixth generation (6G) and beyond communications. Existing\u0000beamforming designs mainly focus on a compact antenna array where typical\u0000communication occurs in the far-field. However, in dense multi-user scenarios,\u0000only relying on far-field angle domain fails to distinguish users at similar\u0000angles. Therefore, a multi-user widely-spaced array (MU-WSA) is exploited in\u0000this paper, which enlarges the near-field region to introduce the additional\u0000distance domain, leading to a new paradigm of cross-near-and-far-field (CNFF)\u0000communication. Under this paradigm, the CNFF channel model is investigated,\u0000based on which the subarray spacing $d_s$ and the number of subarrays $K$ in\u0000MU-WSA are optimized to maximize the channel capacity. Then, in sub-connected\u0000systems, an alternating optimization (AO) beamforming algorithm is proposed to\u0000deal with the special block-diagonal format of the analog precoder. For\u0000fully-connected systems, a low-complexity steering-vector reconstruction\u0000(SVR)-based algorithm is proposed by constructing specialized steering vectors\u0000of MU-WSA. Numerical evaluations show that due to distance domain resolutions,\u0000the MU-WSA can improve the SE by over $60$% at a power of $20$dBm compared to\u0000the compact array. Additionally, the proposed AO algorithm in the SC system can\u0000achieve over 80% of the sum (SE) of the FC system while reducing the number of\u0000phase shifters by $K^2$, thereby lowering power consumption. The SVR algorithm\u0000in the FC system can achieve over 95% of the upper bound of SE but takes only\u000010% of the running time of the singular vector decomposition (SVD)-based\u0000algorithms.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"120 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142217213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Algebraic Representations of Entropy and Fixed-Parity Information Quantities 熵和固定极性信息量的代数表示法

arXiv - MATH - Information Theory Pub Date : 2024-09-07 DOI: arxiv-2409.04845

Keenan J. A. Down, Pedro A. M. Mediano

引用次数: 0

3D-GP-LMVIC: Learning-based Multi-View Image Coding with 3D Gaussian Geometric Priors 3D-GP-LMVIC：基于学习的多视图图像编码与 3D 高斯几何先验

arXiv - MATH - Information Theory Pub Date : 2024-09-06 DOI: arxiv-2409.04013

Yujun Huang, Bin Chen, Niu Lian, Baoyi An, Shu-Tao Xia

引用次数: 0

3D Data Long-Term Preservation in Cultural Heritage 三维数据在文化遗产中的长期保存

arXiv - MATH - Information Theory Pub Date : 2024-09-06 DOI: arxiv-2409.04507

Nicola Amico, Achille Felicetti

引用次数: 0