2021
DOI: 10.48550/arxiv.2105.00633
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Rate-Splitting Strategy to Enable Joint Radar Sensing and Communication with Partial CSIT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…RSMA not only better manages the interference among communication users, but also successfully handles the interference between communication and radar. The authors of [140] further show the tradeoff gain of RSMA-aided DFRC for imperfect CSIT. The authors of [139] further consider low resolution digital-to-analog converter (DAC) units for RSMAaided DFRC.…”
Section: ) Simultaneous Wireless Information and Power Transfer (Swipt)mentioning
confidence: 94%
See 4 more Smart Citations
“…RSMA not only better manages the interference among communication users, but also successfully handles the interference between communication and radar. The authors of [140] further show the tradeoff gain of RSMA-aided DFRC for imperfect CSIT. The authors of [139] further consider low resolution digital-to-analog converter (DAC) units for RSMAaided DFRC.…”
Section: ) Simultaneous Wireless Information and Power Transfer (Swipt)mentioning
confidence: 94%
“…In [84], a globally optimal algorithm, namely, the successive incumbent transcending (SIT) branch and bound (BB) algorithm was proposed to solve P 1 optimally, when the WSR, EE, and sum-power objective functions were considered. To reduce the computational complexity, a large number of works on RSMA have focused on developing suboptimal algorithms to solve P 1 , P 2 , and P 3 with affordable and tractable complexities, such as weighted minimum mean square error (WMMSE)-based algorithms [53], [58], [77], [83], [87], [90], [99], [106], [109], [119], [128], [137], successive convex approximation (SCA)based algorithms [74], [82], [89], [96], [100], [102], [104], [107], [108], [114]- [116], [122], [123], [126], [127], [135], alternating direction method of multipliers (ADMM)-based algorithms [117], [139], [140], and semidefinite relaxation (SDR)-based algorithms [73], [86], [105], [124], [125]. These algorithms are able to converge to the Karush-Kuhn-Tucker (KKT) points of the original problem.…”
Section: Eementioning
confidence: 99%
See 3 more Smart Citations