32 research outputs found
Unitary Linear Dispersion Code Design and Optimisation for MIMO Communication Systems
Linear Dispersion Codes (LDCs) have recently attracted numerous research interests. Thanks to their efficient spreading of data across both the time and spatial domains, LDCs are capable of achieving a desired Diversity-Multiplexing Trade-off (DMT) in Multiple Input Multiple Output (MIMO) broadband wireless access systems. This paper proposes a novel LDC design method, which relies on the unitary matrix theory combined with a Genetic Algorithm (GA) aided optimisation procedure. The proposed design provides a flexible framework, where new LDCs attaining higher data rates and better error resilience than a number of classic MIMO schemes can be generated. Index Terms Diversity-multiplexing trade-off, genetic algorithm, multiple-input multiple-output, linear dispersion code
Full-Rate, Full-Diversity, Finite Feedback Space-Time Schemes with Minimum Feedback and Transmission Duration
In this paper a MIMO quasi static block fading channel with finite N-ary
delay-free, noise-free feedback is considered. The transmitter uses a set of N
Space-Time Block Codes (STBCs), one corresponding to each of the N possible
feedback values, to encode and transmit information. The feedback function used
at the receiver and the N component STBCs used at the transmitter together
constitute a Finite Feedback Scheme (FFS). Although a number of FFSs are
available in the literature that provably achieve full-diversity, there is no
known universal criterion to determine whether a given arbitrary FFS achieves
full-diversity or not. Further, all known full-diversity FFSs for T<N_t where
N_t is the number of transmit antennas, have rate at the most 1. In this paper
a universal necessary condition for any FFS to achieve full-diversity is given,
using which the notion of Feedback-Transmission duration optimal (FT-Optimal)
FFSs - schemes that use minimum amount of feedback N given the transmission
duration T, and minimum transmission duration given the amount of feedback to
achieve full-diversity - is introduced. When there is no feedback (N=1) an
FT-optimal scheme consists of a single STBC with T=N_t, and the universal
necessary condition reduces to the well known necessary and sufficient
condition for an STBC to achieve full-diversity: every non-zero codeword
difference matrix of the STBC must be of rank N_t. Also, a sufficient condition
for full-diversity is given for the FFSs in which the component STBC with the
largest minimum Euclidean distance is chosen. Using this sufficient condition
full-rate (rate N_t) full-diversity FT-Optimal schemes are constructed for all
(N_t,T,N) with NT=N_t. These are the first full-rate full-diversity FFSs
reported in the literature for T<N_t. Simulation results show that the new
schemes have the best error performance among all known FFSs.Comment: 12 pages, 5 figures, 1 tabl
Golden Space-Time Trellis Coded Modulation
In this paper, we present a concatenated coding scheme for a high rate
multiple-input multiple-output (MIMO) system over slow fading
channels. The inner code is the Golden code \cite{Golden05} and the outer code
is a trellis code. Set partitioning of the Golden code is designed specifically
to increase the minimum determinant. The branches of the outer trellis code are
labeled with these partitions. Viterbi algorithm is applied for trellis
decoding. In order to compute the branch metrics a lattice sphere decoder is
used. The general framework for code optimization is given. The performance of
the proposed concatenated scheme is evaluated by simulation. It is shown that
the proposed scheme achieves significant performance gains over uncoded Golden
code.Comment: 33 pages, 13 figure
Noncoherent Space-Time Coding: An Algebraic Perspective
Cataloged from PDF version of article.The design of space–time signals for noncoherent
block-fading channels where the channel state information is
not known a priori at the transmitter and the receiver is considered.
In particular, a new algebraic formulation for the diversity
advantage design criterion is developed. The new criterion encompasses,
as a special case, the well-known diversity advantage
for unitary space–time signals and, more importantly, applies to
arbitrary signaling schemes and arbitrary channel distributions.
This criterion is used to establish the optimal diversity-versus-rate
tradeoff for training based schemes in block-fading channels.
Our results are then specialized to the class of affine space–time
signals which allows for a low complexity decoder. Within this
class, space–time constellations based on the threaded algebraic
space–time (TAST) architecture are considered. These constellations
achieve the optimal diversity-versus-rate tradeoff over
noncoherent block-fading channels and outperform previously
proposed codes in the considered scenarios as demonstrated by
the numerical results. Using the analytical and numerical results
developed in this paper, nonunitary space–time codes are argued
to offer certain advantages in block-fading channels where the appropriate
use of coherent space–time codes is shown to offer a very
efficient solution to the noncoherent space–time communication
paradigm