This work analyzes a particular achievable region for Gaussian interference channels (IFC) derived from the general Han-Kobayashi region. By reformulating the Han-Kobayashi achievable region as the sum of two sets, we characterize the maximum achievable sum-rate with Gaussian inputs and without timesharing in closed from for any Gaussian IFC. We then show that the computed sum-rate meets the up...

Abstract In this paper, the security performance of artificial noise (AN)‐aided space time block coding (STBC) systems in wiretap channel is evaluated. The estimated terms secrecy rate, which defined as difference mutual information legitimate receiver and illegal eavesdropper. We derive a generalized rate formula for system utilizing AN‐aided STBC, also provide an expression approximated value...

Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob), while keeping a third agent (Eve) in the dark, by using physical layer techniques. For a transmission over frequency non selective block fading channels, we assume that Alice perfectly knows the channel with respect to Bob, but she has only a statistical knowledge of the channel with respect to E...

A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive eavesdropper. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the r...

We study the asymptotically-achievable rate region of subspace codes for wireless network coding, where receivers have different link capacities due to the access ways or the faults of the intermediate links in the network. Firstly, an outer bound of the achievable rate region in a two-receiver network is derived from a combinatorial method. Subsequently, the achievability of the outer bound is...

Intelligent reflecting surface (IRS) has emerged as an appealing solution to enhance wireless communication performance by reconfiguring the propagation environment. In this paper, we propose apply IRS physical-layer service integration (PHY-SI) system, where a single-antenna access point (AP) integrates two sorts of messages, i.e., multicast message and confidential message, via superposition ...

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2 secure degrees of freedom (s.d.o.f.) for the G-MAC-WT and the G-WT-H, respectively. While the s.d.o.f. were obtained by real interference alignment, our approac...

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixedlength subset of the channel uses on which she obtains noise-free observations of one of the ...