4,441 research outputs found
The Practical Challenges of Interference Alignment
Interference alignment (IA) is a revolutionary wireless transmission strategy
that reduces the impact of interference. The idea of interference alignment is
to coordinate multiple transmitters so that their mutual interference aligns at
the receivers, facilitating simple interference cancellation techniques. Since
IA's inception, researchers have investigated its performance and proposed
improvements, verifying IA's ability to achieve the maximum degrees of freedom
(an approximation of sum capacity) in a variety of settings, developing
algorithms for determining alignment solutions, and generalizing transmission
strategies that relax the need for perfect alignment but yield better
performance. This article provides an overview of the concept of interference
alignment as well as an assessment of practical issues including performance in
realistic propagation environments, the role of channel state information at
the transmitter, and the practicality of interference alignment in large
networks.Comment: submitted to IEEE Wireless Communications Magazin
Diversity-Multiplexing Tradeoffs in MIMO Relay Channels
A multi-hop relay channel with multiple antenna terminals in a quasi-static
slow fading environment is considered. For both full-duplex and half-duplex
relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is
shown that, while decode-and-forward (DF) relaying achieves the optimal DMT in
the full-duplex relay scenario, the dynamic decode-and-forward (DDF) protocol
is needed to achieve the optimal DMT if the relay is constrained to half-duplex
operation. For the latter case, static protocols are considered as well, and
the corresponding achievable DMT performance is characterized.Comment: To appear at IEEE Global Communications Conf. (Globecom), New
Orleans, LA, Nov. 200
Optimal space-time codes for the MIMO amplify-and-forward cooperative channel
In this work, we extend the non-orthogonal amplify-and-forward (NAF)
cooperative diversity scheme to the MIMO channel. A family of space-time block
codes for a half-duplex MIMO NAF fading cooperative channel with N relays is
constructed. The code construction is based on the non-vanishing determinant
criterion (NVD) and is shown to achieve the optimal diversity-multiplexing
tradeoff (DMT) of the channel. We provide a general explicit algebraic
construction, followed by some examples. In particular, in the single relay
case, it is proved that the Golden code and the 4x4 Perfect code are optimal
for the single-antenna and two-antenna case, respectively. Simulation results
reveal that a significant gain (up to 10dB) can be obtained with the proposed
codes, especially in the single-antenna case.Comment: submitted to IEEE Transactions on Information Theory, revised versio
Indoor wireless communications and applications
Chapter 3 addresses challenges in radio link and system design in indoor scenarios. Given the fact that most human activities take place in indoor environments, the need for supporting ubiquitous indoor data connectivity and location/tracking service becomes even more important than in the previous decades. Specific technical challenges addressed in this section are(i), modelling complex indoor radio channels for effective antenna deployment, (ii), potential of millimeter-wave (mm-wave) radios for supporting higher data rates, and (iii), feasible indoor localisation and tracking techniques, which are summarised in three dedicated sections of this chapter
A Dynamic Clustering and Resource Allocation Algorithm for Downlink CoMP Systems with Multiple Antenna UEs
Coordinated multi-point (CoMP) schemes have been widely studied in the recent
years to tackle the inter-cell interference. In practice, latency and
throughput constraints on the backhaul allow the organization of only small
clusters of base stations (BSs) where joint processing (JP) can be implemented.
In this work we focus on downlink CoMP-JP with multiple antenna user equipments
(UEs) and propose a novel dynamic clustering algorithm. The additional degrees
of freedom at the UE can be used to suppress the residual interference by using
an interference rejection combiner (IRC) and allow a multistream transmission.
In our proposal we first define a set of candidate clusters depending on
long-term channel conditions. Then, in each time block, we develop a resource
allocation scheme by jointly optimizing transmitter and receiver where: a)
within each candidate cluster a weighted sum rate is estimated and then b) a
set of clusters is scheduled in order to maximize the system weighted sum rate.
Numerical results show that much higher rates are achieved when UEs are
equipped with multiple antennas. Moreover, as this performance improvement is
mainly due to the IRC, the gain achieved by the proposed approach with respect
to the non-cooperative scheme decreases by increasing the number of UE
antennas.Comment: 27 pages, 8 figure
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
Cooperative Symbol-Based Signaling for Networks with Multiple Relays
Wireless channels suffer from severe inherent impairments and hence
reliable and high data rate wireless transmission is particularly challenging to
achieve. Fortunately, using multiple antennae improves performance in wireless
transmission by providing space diversity, spatial multiplexing, and power gains.
However, in wireless ad-hoc networks multiple antennae may not be acceptable
due to limitations in size, cost, and hardware complexity. As a result, cooperative
relaying strategies have attracted considerable attention because of their abilities
to take advantage of multi-antenna by using multiple single-antenna relays.
This study is to explore cooperative signaling for different relay networks,
such as multi-hop relay networks formed by multiple single-antenna relays and
multi-stage relay networks formed by multiple relaying stages with each stage
holding several single-antenna relays. The main contribution of this study is the
development of a new relaying scheme for networks using symbol-level
modulation, such as binary phase shift keying (BPSK) and quadrature phase shift
keying (QPSK). We also analyze effects of this newly developed scheme when it
is used with space-time coding in a multi-stage relay network. Simulation results
demonstrate that the new scheme outperforms previously proposed schemes:
amplify-and-forward (AF) scheme and decode-and-forward (DF) scheme
- …