Pith. sign in

REVIEW

Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel with Full-Duplex Jamming

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 1802.05209 v2 pith:UPBUFKRN submitted 2018-02-14 cs.IT math.IT

Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel with Full-Duplex Jamming

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

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent method, by re-structuring our problem as a separately convex program. Moreover, for the special case that the transmitter is equipped with a single antenna, an optimal transmit power allocation strategy is obtained analytically, assuming a known jamming strategy. We also study a FD bidirectional secure communication system, where the jamming power can be reused to enhance the sum secrecy rate. The performance of the proposed design is then numerically evaluated compared to the other design strategies, and under different system assumptions.

discussion (0)

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