Results 1 
8 of
8
Scaling up MIMO: Opportunities and challenges with very large arrays
, 2011
"... ..."
(Show Context)
Secrecy rates in the broadcast channel with confidential messages and external eavesdroppers,” submitted to
 IEEE Trans. Wireless Commun
"... ar ..."
(Show Context)
Lineartime nearest point algorithms for Coxeter lattices
, 2009
"... The Coxeter lattices, which we denote An/m, are a family of lattices containing many of the important lattices in low dimensions. This includes An, E7, E8 and their duals A ∗ n, E ∗ 7 and E ∗ 8. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The Coxeter lattices, which we denote An/m, are a family of lattices containing many of the important lattices in low dimensions. This includes An, E7, E8 and their duals A ∗ n, E ∗ 7 and E ∗ 8. We consider the problem of finding a nearest point in a Coxeter lattice. We describe two new algorithms, one with worst case arithmetic complexity O(n log n) and the other with worst case complexity O(n) where n is the dimension of the lattice. We show that for the particular lattices An and A ∗ n the algorithms reduce to simple nearest point algorithms that already exist in the literature.
Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential Messages
"... In this paper, we study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achievable secrecy sumrate which is almost surely exact as the number of transmit antennas M a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achievable secrecy sumrate which is almost surely exact as the number of transmit antennas M and the number of users K grow to infinity in a fixed ratio β = K/M. We derive the optimal regularization parameter ξ and the optimal network load β that maximize the perantenna secrecy sumrate. We then propose a linear precoder based on RCI and power reduction (RCIPR) that significantly increases the highSNR secrecy sumrate for 1 < β < 2. Our proposed precoder achieves a peruser secrecy rate which has the same highSNR scaling factor as both the following upper bounds: (i) the rate of the optimum RCI precoder without secrecy requirements, and (ii) the secrecy capacity of a singleuser system without interference. Furthermore, we obtain a deterministic approximation for the secrecy sumrate achievable by RCI precoding in the presence of channel state information (CSI) error. We also analyze the performance of our proposed RCIPR precoder with CSI error, and we determine how the error must scale with the SNR in order to maintain a given rate gap to the case with perfect CSI. Index Terms Physical layer security, broadcast channel, random matrix theory, linear precoding, multiuser systems. ar X iv
Sum Rates, Rate Allocation, and User Scheduling for MultiUser MIMO Vector Perturbation Precoding
"... ar ..."
(Show Context)
Physical layer security in downlink multiantenna cellular networks,” submitted to
 IEEE Trans. Commun
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Index Terms
"... In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both (i) the other users in the same cell and (ii) the users in the other cells. The locations of base stations and mobile use ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we study physical layer security for the downlink of cellular networks, where the confidential messages transmitted to each mobile user can be eavesdropped by both (i) the other users in the same cell and (ii) the users in the other cells. The locations of base stations and mobile users are modeled as two independent twodimensional Poisson point processes. Using the proposed model, we analyze the secrecy rates achievable by regularized channel inversion (RCI) precoding by performing a largesystem analysis that combines tools from stochastic geometry and random matrix theory. We obtain approximations for the probability of secrecy outage and the mean secrecy rate, and characterize regimes where RCI precoding achieves a nonzero secrecy rate. We find that unlike isolated cells, the secrecy rate in a cellular network does not grow monotonically with the transmit power, and the network tends to be in secrecy outage if the transmit power grows unbounded. Furthermore, we show that there is an optimal value for the base station deployment density that maximizes the secrecy rate, and this value is a decreasing function of the signaltonoise ratio.