110 research outputs found
Performance Improvement in Muli-user MIMO Networks via Interference Alignment
Almost all wireless networks are interference limited. Interference management has been always a primary concern for large section of current wireless networks with exponentially growing devices, lack of centralized medium access, power management. Because of broadcast nature of the wireless channel, all signals from simultaneous transmissions from devices apart in the same space, are added to the desired signal at the receiver end. Therefore optimal spectrum efficiency in such systems mandates distributed, low complexity interference management strategies with very less overhead which should be far more superior than existing successive interference cancellation, highly complex multiuser detection techniques. In this thesis, a novel interference management scheme- “Interference alignment” scheme for multi user scenario is investigated and analysed supporting the arguments with numerical results for most scenarios. Firstly, the concept of interference channel, Degrees of Freedom were well established which are prerequisite in understanding the predicament of multi user wireless channels. Later on, interference alignment concept has been put forward stating its origin back from linear algebra. IA for K-user MIMO is studied. In a fully connected K-user network with perfect channel state information, IA minimizes the interference space dimension at intended receivers thus maximizing the achievable capacity of the entire channel and increasing the Multiplexing gain. Later on the idea of IA is extended to multi-hop networks. A practical cellular multi-hop wireless network is considered and distributed interference alignment technique is implemented which shows superior performance even in high interference case. All IA schemes assume that the channels are full rank richly scattered environments which in practise is not always possible. The idea of using relays to act as external scatters which increase the rank of effective channel observed is considered. So two novel distributed relaying schemes have been proposed modifying the existing IA scheme to fit the case for rank deficient channels and still achieve multiplexing gain on par with full rank channels. The proposed algorithms doesn’t require global channel state information at all nodes except at relay nodes, doesn’t need large symbol extensions, and still are able to enhance the sum capacity of the networ
Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding
In this paper, a transmission protocol is studied for a two relay wireless
network in which simple repetition coding is applied at the relays.
Information-theoretic achievable rates for this transmission scheme are given,
and a space-time V-BLAST signalling and detection method that can approach them
is developed. It is shown through the diversity multiplexing tradeoff analysis
that this transmission scheme can recover the multiplexing loss of the
half-duplex relay network, while retaining some diversity gain. This scheme is
also compared with conventional transmission protocols that exploit only the
diversity of the network at the cost of a multiplexing loss. It is shown that
the new transmission protocol offers significant performance advantages over
conventional protocols, especially when the interference between the two relays
is sufficiently strong.Comment: To appear in the IEEE Transactions on Wireless Communication
Cooperative Transmission for a Vector Gaussian Parallel Relay Network
In this paper, we consider a parallel relay network where two relays
cooperatively help a source transmit to a destination. We assume the source and
the destination nodes are equipped with multiple antennas. Three basic schemes
and their achievable rates are studied: Decode-and-Forward (DF),
Amplify-and-Forward (AF), and Compress-and-Forward (CF). For the DF scheme, the
source transmits two private signals, one for each relay, where dirty paper
coding (DPC) is used between the two private streams, and a common signal for
both relays. The relays make efficient use of the common information to
introduce a proper amount of correlation in the transmission to the
destination. We show that the DF scheme achieves the capacity under certain
conditions. We also show that the CF scheme is asymptotically optimal in the
high relay power limit, regardless of channel ranks. It turns out that the AF
scheme also achieves the asymptotic optimality but only when the
relays-to-destination channel is full rank. The relative advantages of the
three schemes are discussed with numerical results.Comment: 35 pages, 10 figures, submitted to IEEE Transactions on Information
Theor
On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels
Fading MIMO relay channels are studied analytically, when the source and
destination are equipped with multiple antennas and the relays have a single
one. Compact closed-form expressions are obtained for the outage probability
under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations
are derived, which reveal a number of insights, including the impact of
correlation, of the number of antennas, of relay noise and of relaying
protocol. The effect of correlation is shown to be negligible, unless the
channel becomes almost fully correlated. The SNR loss of relay fading channels
compared to the AWGN channel is quantified. The SNR-asymptotic
diversity-multiplexing tradeoff (DMT) is obtained for a broad class of fading
distributions, including, as special cases, Rayleigh, Rice, Nakagami, Weibull,
which may be non-identical, spatially correlated and/or non-zero mean. The DMT
is shown to depend not on a particular fading distribution, but rather on its
polynomial behavior near zero, and is the same for the simple
"amplify-and-forward" protocol and more complicated "decode-and-forward" one
with capacity achieving codes, i.e. the full processing capability at the relay
does not help to improve the DMT. There is however a significant difference
between the SNR-asymptotic DMT and the finite-SNR outage performance: while the
former is not improved by using an extra antenna on either side, the latter can
be significantly improved and, in particular, an extra antenna can be
traded-off for a full processing capability at the relay. The results are
extended to the multi-relay channels with selection relaying and typical outage
events are identified.Comment: accepted by IEEE Trans. on Comm., 201
A virtual MIMO dual-hop architecture based on hybrid spatial modulation
International audienceIn this paper, we propose a novel Virtual Multiple-Input-Multiple-Output (VMIMO) architecture based on the concept of Spatial Modulation (SM). Using a dual-hop and Decode-and-Forward protocol, we form a distributed system, called Dual-Hop Hybrid SM (DH-HSM). DH-HSM conveys information from a Source Node (SN) to a Destination Node (DN) via multiple Relay Nodes (RNs). The spatial position of the RNs is exploited for transferring information in addition to, or even without, a conventional symbol. In order to increase the performance of our architecture, while keeping the complexity of the RNs and DN low, we employ linear precoding using Channel State Information (CSI) at the SN. In this way, we form a Receive-Spatial Modulation (R-SM) pattern from the SN to the RNs, which is able to employ a centralized coordinated or a distributed uncoordinated detection algorithm at the RNs. In addition, we focus on the SN and propose two regularized linear precoding methods that employ realistic Imperfect Channel State Information at the Transmitter. The power of each precoder is analyzed theoretically. Using the Bit Error Rate (BER) metric, we evaluate our architecture against the following benchmark systems: 1) single relay; 2) best relay selection; 3) distributed Space Time Block Coding (STBC) VMIMO scheme; and 4) the direct communication link. We show that DH-HSM is able to achieve significant Signal-to-Noise Ratio (SNR) gains, which can be as high as 10.5 dB for a very large scale system setup. In order to verify our simulation results, we provide an analytical framework for the evaluation of the Average Bit Error Probability (ABEP)
- …