Low-Complexity Multi-Target Detection in ELAA ISAC
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913669948899328 |
|---|---|
| author | Galappaththige, Diluka Zargari, Shayan Tellambura, Chintha Li, Geoffrey Ye |
| author_facet | Galappaththige, Diluka Zargari, Shayan Tellambura, Chintha Li, Geoffrey Ye |
| contents | Multi-target detection and communication with extremely large-scale antenna arrays (ELAAs) operating at high frequencies necessitate generating multiple beams. However, conventional algorithms are slow and computationally intensive. For instance, they can simulate a \num{200}-antenna system over two weeks, and the time complexity grows exponentially with the number of antennas. Thus, this letter explores an ultra-low-complex solution for a multi-user, multi-target integrated sensing and communication (ISAC) system equipped with an ELAA base station (BS). It maximizes the communication sum rate while meeting sensing beampattern gain targets and transmit power constraints. As this problem is non-convex, a Riemannian stochastic gradient descent-based augmented Lagrangian manifold optimization (SGALM) algorithm is developed, which searches on a manifold to ensure constraint compliance. The algorithm achieves ultra-low complexity and superior runtime performance compared to conventional algorithms. For example, it is \num{56} times faster than the standard benchmark for \num{257} BS antennas. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17776 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Low-Complexity Multi-Target Detection in ELAA ISAC Galappaththige, Diluka Zargari, Shayan Tellambura, Chintha Li, Geoffrey Ye Signal Processing Multi-target detection and communication with extremely large-scale antenna arrays (ELAAs) operating at high frequencies necessitate generating multiple beams. However, conventional algorithms are slow and computationally intensive. For instance, they can simulate a \num{200}-antenna system over two weeks, and the time complexity grows exponentially with the number of antennas. Thus, this letter explores an ultra-low-complex solution for a multi-user, multi-target integrated sensing and communication (ISAC) system equipped with an ELAA base station (BS). It maximizes the communication sum rate while meeting sensing beampattern gain targets and transmit power constraints. As this problem is non-convex, a Riemannian stochastic gradient descent-based augmented Lagrangian manifold optimization (SGALM) algorithm is developed, which searches on a manifold to ensure constraint compliance. The algorithm achieves ultra-low complexity and superior runtime performance compared to conventional algorithms. For example, it is \num{56} times faster than the standard benchmark for \num{257} BS antennas. |
| title | Low-Complexity Multi-Target Detection in ELAA ISAC |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2501.17776 |