232 research outputs found
Limited Feedback Design for Interference Alignment on MIMO Interference Networks with Heterogeneous Path Loss and Spatial Correlations
Interference alignment is degree of freedom optimal in K -user MIMO
interference channels and many previous works have studied the transceiver
designs. However, these works predominantly focus on networks with perfect
channel state information at the transmitters and symmetrical interference
topology. In this paper, we consider a limited feedback system with
heterogeneous path loss and spatial correlations, and investigate how the
dynamics of the interference topology can be exploited to improve the feedback
efficiency. We propose a novel spatial codebook design, and perform dynamic
quantization via bit allocations to adapt to the asymmetry of the interference
topology. We bound the system throughput under the proposed dynamic scheme in
terms of the transmit SNR, feedback bits and the interference topology
parameters. It is shown that when the number of feedback bits scales with SNR
as C_{s}\cdot\log\textrm{SNR}, the sum degrees of freedom of the network are
preserved. Moreover, the value of scaling coefficient C_{s} can be
significantly reduced in networks with asymmetric interference topology.Comment: 30 pages, 6 figures, accepted by IEEE transactions on signal
processing in Feb. 201
Achieving "Massive MIMO" Spectral Efficiency with a Not-so-Large Number of Antennas
The main focus and contribution of this paper is a novel network-MIMO TDD
architecture that achieves spectral efficiencies comparable with "Massive
MIMO", with one order of magnitude fewer antennas per active user per cell. The
proposed architecture is based on a family of network-MIMO schemes defined by
small clusters of cooperating base stations, zero-forcing multiuser MIMO
precoding with suitable inter-cluster interference constraints, uplink pilot
signals reuse across cells, and frequency reuse. The key idea consists of
partitioning the users population into geographically determined "bins", such
that all users in the same bin are statistically equivalent, and use the
optimal network-MIMO architecture in the family for each bin. A scheduler takes
care of serving the different bins on the time-frequency slots, in order to
maximize a desired network utility function that captures some desired notion
of fairness. This results in a mixed-mode network-MIMO architecture, where
different schemes, each of which is optimized for the served user bin, are
multiplexed in time-frequency. In order to carry out the performance analysis
and the optimization of the proposed architecture in a clean and
computationally efficient way, we consider the large-system regime where the
number of users, the number of antennas, and the channel coherence block length
go to infinity with fixed ratios. The performance predicted by the large-system
asymptotic analysis matches very well the finite-dimensional simulations.
Overall, the system spectral efficiency obtained by the proposed architecture
is similar to that achieved by "Massive MIMO", with a 10-fold reduction in the
number of antennas at the base stations (roughly, from 500 to 50 antennas).Comment: Full version with appendice (proofs of theorems). A shortened version
without appendice was submitted to IEEE Trans. on Wireless Commun. Appendix B
was revised after submissio
Receive Combining vs. Multi-Stream Multiplexing in Downlink Systems with Multi-Antenna Users
In downlink multi-antenna systems with many users, the multiplexing gain is
strictly limited by the number of transmit antennas and the use of these
antennas. Assuming that the total number of receive antennas at the
multi-antenna users is much larger than , the maximal multiplexing gain can
be achieved with many different transmission/reception strategies. For example,
the excess number of receive antennas can be utilized to schedule users with
effective channels that are near-orthogonal, for multi-stream multiplexing to
users with well-conditioned channels, and/or to enable interference-aware
receive combining. In this paper, we try to answer the question if the data
streams should be divided among few users (many streams per user) or many users
(few streams per user, enabling receive combining). Analytic results are
derived to show how user selection, spatial correlation, heterogeneous user
conditions, and imperfect channel acquisition (quantization or estimation
errors) affect the performance when sending the maximal number of streams or
one stream per scheduled user---the two extremes in data stream allocation.
While contradicting observations on this topic have been reported in prior
works, we show that selecting many users and allocating one stream per user
(i.e., exploiting receive combining) is the best candidate under realistic
conditions. This is explained by the provably stronger resilience towards
spatial correlation and the larger benefit from multi-user diversity. This
fundamental result has positive implications for the design of downlink systems
as it reduces the hardware requirements at the user devices and simplifies the
throughput optimization.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 11
figures. The results can be reproduced using the following Matlab code:
https://github.com/emilbjornson/one-or-multiple-stream
Adaptive Bit Partitioning for Multicell Intercell Interference Nulling with Delayed Limited Feedback
Base station cooperation can exploit knowledge of the users' channel state
information (CSI) at the transmitters to manage co-channel interference. Users
have to feedback CSI of the desired and interfering channels using
finite-bandwidth backhaul links. Existing codebook designs for single-cell
limited feedback can be used for multicell cooperation by partitioning the
available feedback resources between the multiple channels. In this paper, a
new feedback-bit allocation strategy is proposed, as a function of the delays
in the communication links and received signal strengths in the downlink.
Channel temporal correlation is modeled as a function of delay using the
Gauss-Markov model. Closed-form expressions for bit partitions are derived to
allocate more bits to quantize the stronger channels with smaller delays and
fewer bits to weaker channels with larger delays, assuming random vector
quantization. Cellular network simulations are used to show that the proposed
algorithm yields higher sum-rates than an equal-bit allocation technique.Comment: Submitted to IEEE Transactions on Signal Processing, July 201
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Multiuser Millimeter Wave Beamforming Strategies with Quantized and Statistical CSIT
To alleviate the high cost of hardware in mmWave systems, hybrid
analog/digital precoding is typically employed. In the conventional two-stage
feedback scheme, the analog beamformer is determined by beam search and
feedback to maximize the desired signal power of each user. The digital
precoder is designed based on quantization and feedback of effective channel to
mitigate multiuser interference. Alternatively, we propose a one-stage feedback
scheme which effectively reduces the complexity of the signalling and feedback
procedure. Specifically, the second-order channel statistics are leveraged to
design digital precoder for interference mitigation while all feedback overhead
is reserved for precise analog beamforming. Under a fixed total feedback
constraint, we investigate the conditions under which the one-stage feedback
scheme outperforms the conventional two-stage counterpart. Moreover, a rate
splitting (RS) transmission strategy is introduced to further tackle the
multiuser interference and enhance the rate performance. Consider (1) RS
precoded by the one-stage feedback scheme and (2) conventional transmission
strategy precoded by the two-stage scheme with the same first-stage feedback as
(1) and also certain amount of extra second-stage feedback. We show that (1)
can achieve a sum rate comparable to that of (2). Hence, RS enables remarkable
saving in the second-stage training and feedback overhead.Comment: submitted to TW
- …