AI & ML
Sparse Array-Inspired Frame Structure Design for 5G NR ISAC
arXiv eess.SP0 views
arXiv:2611.09544v1 Announce Type: new Abstract: Integrated sensing and communication (ISAC) has emerged as a promising paradigm for future wireless networks. However, the extensive occupation of time-frequency resources for sensing limits the communication capacity. To address the resource conflict, this paper proposes a novel sparse sensing frame structure aligned with the 5G new radio (5G NR) resource grid at the slot and physical resource block (PRB) levels through a predefined sensing-pattern block. Specifically, inspired by the design of two-dimensional (2D) sparse antenna arrays, we map the sparse spatial geometries onto the time-frequency resource grid. By leveraging the hole-free property of the difference coarray, we eliminate the range-velocity ambiguity and cast the sensing signals into a reconstructed higher-order tensor representation. For efficient parameter estimation, we propose a novel binary-tree-based tensor train decomposition (BT-TTD) algorithm that extracts lower-dimensional tensor train cores (TT-cores) and executes a Vandermonde-prior-guided rectified alternating least squares (RecALS) algorithm. Simulation results validate that the proposed scheme achieves competitive estimation accuracy with reduced complexity. Furthermore, we investigate the topological properties of various sparse patterns, revealing the inherent trade-off among sensing accuracy, resource occupancy, and computational complexity.
Source:https://arxiv.org/abs/2611.09544PreviousA Hybrid Digital/Analog Polyphase Filtering Approach for High-Speed RF-DACsNextExpert Spindles in the Wild: Enriched Supervision for a Dense Detector
Related posts
DeepRitzSplit: A Variational Neural Operator Framework for Gradient Flows with Application to Dendritic Growth
0arXiv cs.NA
Quantitative Universal Approximation for Noisy Quantum Neural Networks
0arXiv cs.NA
Vertex interpolation by bivariate $C^1$ cubic splines: counterexamples, geometric stability, and indecomposable defects
0arXiv cs.NA
Adaptive refinement based on local approximation power of hierarchical spline spaces
0arXiv cs.NA
Discrete hypocoercive estimates for discontinuous Galerkin methods: application to the Vlasov-Poisson-Fokker-Planck system
0arXiv cs.NA
Novel technique based on L\'eja Points Approximation for Log-determinant Estimation of Large matrices
0arXiv cs.NA