The Experts below are selected from a list of 7014129 Experts worldwide ranked by ideXlab platform
Shlomo Shamai - One of the best experts on this subject based on the ideXlab platform.
-
multiple input multiple output gaussian broadcast channels with confidential messages
IEEE Transactions on Information Theory, 2010Co-Authors: Ruoheng Liu, Tie Liu, H V Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint, both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (an additive prefix channel) and random binning.
-
multiple input multiple output gaussian broadcast channels with confidential messages
arXiv: Information Theory, 2009Co-Authors: Ruoheng Liu, Tie Liu, Vincent H Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise and random binning.
-
The capacity region of the Gaussian Multiple-Input Multiple-Output broadcast channel
IEEE Transactions on Information Theory, 2006Co-Authors: H. Weingarten, Yossef Steinberg, Shlomo ShamaiAbstract:The Gaussian Multiple-Input Multiple-Output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the per-antenna power constraints
K Dangakis - One of the best experts on this subject based on the ideXlab platform.
-
simple accurate formula for the average bit error probability of multiple input multiple output free space optical links over negative exponential turbulence channels
Optics Letters, 2012Co-Authors: Kostas P Peppas, F Lazarakis, A A Alexandridis, K DangakisAbstract:In this Letter we investigate the error performance of Multiple-Input Multiple-Output free-space optical communication systems employing intensity modulation/direct detection and operating over strong atmospheric turbulence channels. Atmospheric-induced strong turbulence fading is modeled using the negative exponential distribution. For the considered system, an approximate yet accurate analytical expression for the average bit error probability is derived and an efficient method for its numerical evaluation is proposed. Numerically evaluated and computer simulation results are further provided to demonstrate the validity of the proposed mathematical analysis.
Ruoheng Liu - One of the best experts on this subject based on the ideXlab platform.
-
multiple input multiple output gaussian broadcast channels with confidential messages
IEEE Transactions on Information Theory, 2010Co-Authors: Ruoheng Liu, Tie Liu, H V Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint, both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (an additive prefix channel) and random binning.
-
multiple input multiple output gaussian broadcast channels with confidential messages
arXiv: Information Theory, 2009Co-Authors: Ruoheng Liu, Tie Liu, Vincent H Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise and random binning.
Tie Liu - One of the best experts on this subject based on the ideXlab platform.
-
multiple input multiple output gaussian broadcast channels with confidential messages
IEEE Transactions on Information Theory, 2010Co-Authors: Ruoheng Liu, Tie Liu, H V Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint, both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (an additive prefix channel) and random binning.
-
multiple input multiple output gaussian broadcast channels with common and confidential messages
arXiv: Information Theory, 2009Co-Authors: Tie Liu, Yingbin LiangAbstract:This paper considers the problem of the Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. A matrix characterization of the secrecy capacity region is established via a channel enhancement argument. The enhanced channel is constructed by first splitting receiver 1 into two virtual receivers and then enhancing only the virtual receiver that decodes the confidential message. The secrecy capacity region of the enhanced channel is characterized using an extremal entropy inequality previously established for characterizing the capacity region of a degraded compound MIMO Gaussian broadcast channel.
-
multiple input multiple output gaussian broadcast channels with confidential messages
arXiv: Information Theory, 2009Co-Authors: Ruoheng Liu, Tie Liu, Vincent H Poor, Shlomo ShamaiAbstract:This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise and random binning.
Miguel R D Rodrigues - One of the best experts on this subject based on the ideXlab platform.
-
filter design with secrecy constraints the degraded multiple input multiple output gaussian wiretap channel
Vehicular Technology Conference, 2011Co-Authors: Hugo Reboredo, Munnujahan Ara, Miguel R D Rodrigues, Joao XavierAbstract:This paper considers the problem of filter design with secrecy constraints, where two legitimate parties, Alice and Bob, communicate in the presence of an eavesdropper, Eve, over Multiple-Input Multiple-Output (MIMO) Gaussian channels. In particular, we consider the design of transmit and receive filters that minimize the mean-squared error (MSE) between the legitimate parties subject to a certain eavesdropper MSE level, in the situation where the eavesdropper MIMO channel is a degraded version of the main MIMO channel. We characterize the form of the optimal receive filters as well as the form of optimal transmit filter in different scenarios. We also put forth an iterative algorithm to obtain the optimal values of the transmit and receive filters. Finally, we present a set of numerical results that illustrate the conclusions.
-
on multiple input multiple output gaussian channels with arbitrary inputs subject to jamming
International Symposium on Information Theory, 2009Co-Authors: Miguel R D Rodrigues, Gil RamosAbstract:This paper considers communication over channels subject to jamming. By capitalizing on the relationship between the mutual information and the minimum mean-squared error (MMSE), we investigate the interference covariance that minimizes the mutual information of a deterministic Multiple-Input Multiple-Output (MIMO) channel subject to Gaussian noise and Gaussian interference with arbitrary (not necessarily Gaussian) input distributions. We show that the worst interference covariance satisfies a fixed-point equation involving key system quantities, including the MMSE matrix. We also specialize the form of the worst interference covariance to the asymptotic regimes of low and high snr. We demonstrate that in the low-snr regime the worst interference covariance injects an appropriate amount of power directly into the channel eigenmodes. In contrast, in the high-snr regime the worst interference covariance minimizes the minimum distance between a modified version of the constellation vectors. Numerical results illustrate that optimization of the interference covariance has the potential to substantially decrease the reliable information transmission rate between a transmitterreceiver pair. The results are also applicable to scenarios where a jammer aims to impair the secrecy rate of wiretap channels.
