Handbook of Antennas in Wireless Communications
By L. Godara. 2001
713 citations recorded by the source corpus.
Subfields: Aerospace Engineering
View Paper: https://www.semanticscholar.org/paper/a4ffc1ee83eaa55042a28230ecb2d0ce3efd7c12
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Aerospace Engineering
- Wei Yu
- Zhi-Quan Tom Luo
- Björn E. Ottersten
- Wei-Cheng Liao
- Gan Zheng
- Alex B. Gershman
- Wing-Kin Ma
- John M. Cioffi
Citations in the corpus
- An introduction to convex optimization for communications and signal processing (2006, methodology): “One approach to solving the beamforming problem is based on a reformulation of (31) in terms of new matrix variables [ 10 ].”
- Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming (2010, methodology): “RANSMIT beamforming design has been an intensive research topic in the past decade because the multiple antennas create a dimension for multiple access, i.e., spatial-division multiple access (see [ 1 ] and [2]).”
- QoS-Based Transmit Beamforming in the Presence of Eavesdroppers: An Optimized Artificial-Noise-Aided Approach (2011, methodology): “Suppose that the Alice-to-Bob channel is random with mean and covariance . From Bob’s model (1) and the AN-aided transmit structure (3), the SINR of Bob with respect to can be defined as (see, e.g., [ 3 ])”
- A robust maximin approach for MIMO communications with imperfect channel state information based on convex optimization (2006, background): “At the transmitter, the CSI can be obtained through a feedback channel or from previous received signals, exploiting the channel reciprocity in time division duplexing (TDD) (see [ 15 ] for an overview of different channel estimation strategies).”
- Optimal Cooperative Jamming to Enhance Physical Layer Security Using Relays (2011, methodology): “where we have used the fact that can be made positive (see [ 10 ] for a similar example) without loss of optimality and the advantage is that (19) becomes convex and can be optimally solved.”