1,039 research outputs found
Dispensing with channel estimation: differentially modulated cooperative wireless communications
As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective
Joint Subcarrier Pairing and Power Allocation for OFDM Transmission with Decode-and-Forward Relaying
In this paper, a point-to-point Orthogonal Frequency Division Multiplexing
(OFDM) system with a decode-and-forward (DF) relay is considered. The
transmission consists of two hops. The source transmits in the first hop, and
the relay transmits in the second hop. Each hop occupies one time slot. The
relay is half-duplex, and capable of decoding the message on a particular
subcarrier in one time slot, and re-encoding and forwarding it on a different
subcarrier in the next time slot. Thus each message is transmitted on a pair of
subcarriers in two hops. It is assumed that the destination is capable of
combining the signals from the source and the relay pertaining to the same
message. The goal is to maximize the weighted sum rate of the system by jointly
optimizing subcarrier pairing and power allocation on each subcarrier in each
hop. The weighting of the rates is to take into account the fact that different
subcarriers may carry signals for different services. Both total and individual
power constraints for the source and the relay are investigated. For the
situations where the relay does not transmit on some subcarriers because doing
so does not improve the weighted sum rate, we further allow the source to
transmit new messages on these idle subcarriers. To the best of our knowledge,
such a joint optimization inclusive of the destination combining has not been
discussed in the literature. The problem is first formulated as a mixed integer
programming problem. It is then transformed to a convex optimization problem by
continuous relaxation, and solved in the dual domain. Based on the optimization
results, algorithms to achieve feasible solutions are also proposed. Simulation
results show that the proposed algorithms almost achieve the optimal weighted
sum rate, and outperform the existing methods in various channel conditions.Comment: 33 pages, 11 figure
How to Understand LMMSE Transceiver Design for MIMO Systems From Quadratic Matrix Programming
In this paper, a unified linear minimum mean-square-error (LMMSE) transceiver
design framework is investigated, which is suitable for a wide range of
wireless systems. The unified design is based on an elegant and powerful
mathematical programming technology termed as quadratic matrix programming
(QMP). Based on QMP it can be observed that for different wireless systems,
there are certain common characteristics which can be exploited to design LMMSE
transceivers e.g., the quadratic forms. It is also discovered that evolving
from a point-to-point MIMO system to various advanced wireless systems such as
multi-cell coordinated systems, multi-user MIMO systems, MIMO cognitive radio
systems, amplify-and-forward MIMO relaying systems and so on, the quadratic
nature is always kept and the LMMSE transceiver designs can always be carried
out via iteratively solving a number of QMP problems. A comprehensive framework
on how to solve QMP problems is also given. The work presented in this paper is
likely to be the first shoot for the transceiver design for the future
ever-changing wireless systems.Comment: 31 pages, 4 figures, Accepted by IET Communication
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where
the base station (BS) communicates with each mobile station (MS) using OFDMA
for both uplink and downlink. The goal is to improve the overall system
performance by exploring the full potential of the network in various
dimensions including user, subcarrier, relay, and bidirectional traffic. In
this work, we first introduce a novel three-time-slot time-division duplexing
(TDD) transmission protocol. This protocol unifies direct transmission, one-way
relaying and network-coded two-way relaying between the BS and each MS. Using
the proposed three-time-slot TDD protocol, we then propose an optimization
framework for resource allocation to achieve the following gains: cooperative
diversity (via relay selection), network coding gain (via bidirectional
transmission mode selection), and multiuser diversity (via subcarrier
assignment). We formulate the problem as a combinatorial optimization problem,
which is NP-complete. To make it more tractable, we adopt a graph-based
approach. We first establish the equivalence between the original problem and a
maximum weighted clique problem in graph theory. A metaheuristic algorithm
based on any colony optimization (ACO) is then employed to find the solution in
polynomial time. Simulation results demonstrate that the proposed protocol
together with the ACO algorithm significantly enhances the system total
throughput.Comment: 27 pages, 8 figures, 2 table
Grassmannian Beamforming for MIMO Amplify-and-Forward Relaying
In this paper, we derive the optimal transmitter/ receiver beamforming
vectors and relay weighting matrix for the multiple-input multiple-output
amplify-and-forward relay channel. The analysis is accomplished in two steps.
In the first step, the direct link between the transmitter (Tx) and receiver
(Rx) is ignored and we show that the transmitter and the relay should map their
signals to the strongest right singular vectors of the Tx-relay and relay-Rx
channels. Based on the distributions of these vectors for independent
identically distributed (i.i.d.) Rayleigh channels, the Grassmannian codebooks
are used for quantizing and sending back the channel information to the
transmitter and the relay. The simulation results show that even a few number
of bits can considerably increase the link reliability in terms of bit error
rate. For the second step, the direct link is considered in the problem model
and we derive the optimization problem that identifies the optimal Tx
beamforming vector. For the i.i.d Rayleigh channels, we show that the solution
to this problem is uniformly distributed on the unit sphere and we justify the
appropriateness of the Grassmannian codebook (for determining the optimal
beamforming vector), both analytically and by simulation. Finally, a modified
quantizing scheme is presented which introduces a negligible degradation in the
system performance but significantly reduces the required number of feedback
bits.Comment: Submitted to IEEE Journal of Selected Areas in Communications,
Special Issue on Exploiting Limited Feedback in Tomorrows Wireless
Communication Network
Near-Capacity Irregular Convolutional Coded Cooperative Differential Linear Dispersion Codes Using Multiple-Symbol Differential Detection
We propose a novel near-capacity Multiple-Symbol Differential Decoding (MSDD) aided cooperative Differential Linear Dispersion Code (DLDC) scheme, which exhibits a high grade of system design flexibility in terms of the choice of activated relays and the DLDC's rate allocation. More specifically, the system has the freedom to activate a range of DLDCs depending on both the number of relays available in the network, as well as on their position, throughput and complexity considerations
- …