Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2203.06409 (cs)
[Submitted on 12 Mar 2022]

Title:Optimal Precoding Design for Monostatic ISAC Systems: MSE Lower Bound and DoF Completion

Authors:Yuanhao Cui, Fan Liu, Weijie Yuan, Junsheng Mu, Xiaojun Jing, Derrick Wing Kwan Ng
View PDF
Abstract:In this letter, we study the parameter estimation performance for monostatic downlink integrated sensing and communications (ISAC) systems. In particular, we analyze the mean squared error (MSE) lower bound for target sensing in the downlink ISAC system that reveals the suboptimality in re-using the conventional communication waveform for sensing. To realize a practical dual-functional waveform, we propose a waveform augmentation strategy that imposes an extra signal structure, namely the degrees-of-freedom (DoF) completion method. The proposed approach is capable of improving the parameter estimation performance of the ISAC system and achieving the derived MSE lower bound. To improve the performance of the proposed strategy, we formulate an MSE minimization problem to design the ISAC precoder, subject to the communication users' signal-interference-plus-noise-ratio (SINR) constraints. Despite the non-convexity of the waveform design problem, we obtain its globally optimal solution via semi-definite relaxation (SDR) and the proposed constructive method. Simulation results validate the proposed DoF completion technology could achieve the derived MSE lower bound and the effectiveness of the MSE-based ISAC waveform design.
Comments: Submit to IEEE for possible publication
Subjects: Information Theory (cs.IT); Signal Processing (eess.SP)
Cite as: arXiv:2203.06409 [cs.IT]
  (or arXiv:2203.06409v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2203.06409

Submission history

From: Yuanhao Cui [view email]
[v1] Sat, 12 Mar 2022 11:00:52 UTC (379 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-03
Change to browse by:
cs
eess
eess.SP
math
math.IT

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)