2 research outputs found
On the Design of Universal LDPC Codes
Low-density parity-check (LDPC) coding for a multitude of equal-capacity
channels is studied. First, based on numerous observations, a conjecture is
stated that when the belief propagation decoder converges on a set of
equal-capacity channels, it would also converge on any convex combination of
those channels. Then, it is proved that when the stability condition is
satisfied for a number of channels, it is also satisfied for any channel in
their convex hull. For the purpose of code design, a method is proposed which
can decompose every symmetric channel with capacity C into a set of
identical-capacity basis channels. We expect codes that work on the basis
channels to be suitable for any channel with capacity C. Such codes are found
and in comparison with existing LDPC codes that are designed for specific
channels, our codes obtain considerable coding gains when used across a
multitude of channels.Comment: 5 pages, 2 figures, To appear in Proc. IEEE International Symposium
on Information Theory (ISIT 2008), Toronto, Canada, July 200
Bounds on the capacity of OFDM underspread frequency selective fading channels
The analysis of the channel capacity in the absence of prior channel
knowledge (noncoherent channel) has gained increasing interest in recent years,
but it is still unknown for the general case. In this paper we derive bounds on
the capacity of the noncoherent, underspread complex Gaussian, orthogonal
frequency division multiplexing (OFDM), wide sense stationary channel with
uncorrelated scattering (WSSUS), under a peak power constraint or a constraint
on the second and fourth moments of the transmitted signal. These bounds are
characterized only by the system signal-to-noise ratio (SNR) and by a newly
defined quantity termed effective coherence time. Analysis of the effective
coherence time reveals that it can be interpreted as the length of a block in
the block fading model in which a system with the same SNR will achieve the
same capacity as in the analyzed channel. Unlike commonly used coherence time
definitions, it is shown that the effective coherence time depends on the SNR,
and is a nonincreasing function of it. We show that for low SNR the capacity is
proportional to the effective coherence time, while for higher SNR the coherent
channel capacity can be achieved provided that the effective coherence time is
large enough.Comment: 55 pages, 3 figure