8 research outputs found
Space Frequency Codes from Spherical Codes
A new design method for high rate, fully diverse ('spherical') space
frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary
numbers of antennas and subcarriers. The construction exploits a differential
geometric connection between spherical codes and space time codes. The former
are well studied e.g. in the context of optimal sequence design in CDMA
systems, while the latter serve as basic building blocks for space frequency
codes. In addition a decoding algorithm with moderate complexity is presented.
This is achieved by a lattice based construction of spherical codes, which
permits lattice decoding algorithms and thus offers a substantial reduction of
complexity.Comment: 5 pages. Final version for the 2005 IEEE International Symposium on
Information Theor
Sphere packing bounds in the Grassmann and Stiefel manifolds
Applying the Riemann geometric machinery of volume estimates in terms of
curvature, bounds for the minimal distance of packings/codes in the Grassmann
and Stiefel manifolds will be derived and analyzed. In the context of
space-time block codes this leads to a monotonically increasing minimal
distance lower bound as a function of the block length. This advocates large
block lengths for the code design.Comment: Replaced with final version, 11 page
Geometrical relations between space time block code designs and complexity reduction
In this work, the geometric relation between space time block code design for
the coherent channel and its non-coherent counterpart is exploited to get an
analogue of the information theoretic inequality in
terms of diversity. It provides a lower bound on the performance of
non-coherent codes when used in coherent scenarios. This leads in turn to a
code design decomposition result splitting coherent code design into two
complexity reduced sub tasks. Moreover a geometrical criterion for high
performance space time code design is derived.Comment: final version, 11 pages, two-colum
LDPC code-based bandwidth efficient coding schemes for wireless communications
This dissertation deals with the design of bandwidth-efficient coding schemes
with Low-Density Parity-Check (LDPC) for reliable wireless communications. Code
design for wireless channels roughly falls into three categories: (1) when channel state
information (CSI) is known only to the receiver (2) more practical case of partial CSI
at the receiver when the channel has to be estimated (3) when CSI is known to the
receiver as well as the transmitter. We consider coding schemes for all the above
categories.
For the first scenario, we describe a bandwidth efficient scheme which uses highorder
constellations such as QAM over both AWGN as well as fading channels. We
propose a simple design with LDPC codes which combines the good properties of
Multi-level Coding (MLC) and bit-interleaved coded-modulation (BICM) schemes.
Through simulations, we show that the proposed scheme performs better than MLC
for short-medium lengths on AWGN and block-fading channels. For the first case,
we also characterize the rate-diversity tradeoff of MIMO-OFDM and SISO-OFDM
systems. We design optimal coding schemes which achieve this tradeoff when transmission
is from a constrained constellation. Through simulations, we show that with
a sub-optimal iterative decoder, the performance of this coding scheme is very close
to the optimal limit for MIMO (flat quasi-static fading), MIMO-OFDM and SISO OFDM systems.
For the second case, we design non-systematic Irregular Repeat Accumulate
(IRA) codes, which are a special class of LDPC codes, for Inter-Symbol Interference
(ISI) fading channels when CSI is estimated at the receiver. We use Orthogonal Frequency
Division Multiplexing (OFDM) to convert the ISI fading channel into parallel
flat fading subchannels. We use a simple receiver structure that performs iterative
channel estimation and decoding and use non-systematic IRA codes that are optimized
for this receiver. This combination is shown to perform very close to a receiver
with perfect CSI and is also shown to be robust to change in the number of channel
taps and Doppler.
For the third case, we look at bandwidth efficient schemes for fading channels
that perform close to capacity when the channel state information is known at the
transmitter as well as the receiver. Schemes that achieve capacity with a Gaussian
codebook for the above system are already known but not for constrained constellations.
We derive the near-optimum scheme to achieve capacity with constrained constellations
and then propose coding schemes which perform close to capacity. Through
linear transformations, a MIMO system can be converted into non-interfering parallel
subchannels and we further extend the proposed coding schemes to the MIMO case
too