Pith. sign in

REVIEW

On Artificial-Noise Aided Transmit Design for Multi-User MISO Systems with Integrated Services

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1607.00942 v3 pith:T76E7SCY submitted 2016-07-04 cs.IT math.IT

On Artificial-Noise Aided Transmit Design for Multi-User MISO Systems with Integrated Services

classification cs.IT math.IT
keywords problemmessageconfidentialratesecrecysrrmtransmitequivalent
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper considers artificial noise (AN)-aided transmit designs for multi-user MISO systems in the eyes of service integration. Specifically, we combine two sorts of services, and serve them simultaneously: one multicast message intended for all receivers and one confidential message intended for only one receiver. The confidential message is kept perfectly secure from all the unauthorized receivers. Our goal is to jointly design the optimal input covariances for the multicast message, confidential message and AN, such that the achievable secrecy rate region is maximized subject to the sum power constraint. This secrecy rate region maximization (SRRM) problem is a nonconvex vector maximization problem. To handle it, we reformulate the SRRM problem into a provably equivalent scalar optimization problem and propose a searching method to find all of its Pareto optimal points. The equivalent scalar optimization problem is identified as a secrecy rate maximization (SRM) problem with the quality of multicast service (QoMS) constraints. Further, we show that this equivalent QoMS-constrained SRM problem, albeit nonconvex, can be efficiently handled based on a two-stage optimization approach, including solving a sequence of semidefinite programs. Moreover, we also extend the SRRM problem to an imperfect channel state information (CSI) case where a worst-case robust formulation is considered. In particular, while transmit beamforming is generally a suboptimal technique to the SRRM problem, we prove that it is optimal for the confidential message transmission whether in the perfect CSI scenario or in the imperfect CSI scenario. Finally, numerical results demonstrate that the AN-aided transmit designs are effective in expanding the achievable secrecy rate regions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.