192 research outputs found
Labeling Diversity for 2x2 WLAN Coded-Cooperative Networks
Labelling diversity is an efficient technique recently proposed in the literature and aims to improve the bit error rate(BER) performance of wireless local area network (WLAN) systems with two transmit and two receive antennas without increasing the transmit power and bandwidth requirements. In this paper, we employ labelling diversity with different space-time channel codes such as convolutional, turbo and low density parity check (LDPC) for both point-to-point and coded-cooperative communication scenarios. Joint iterative decoding schemes for distributed turbo and LDPC codes are also presented. BER performance bounds at an error floor (EF) region are derived and verified with the help of numerical simulations for both cooperative and non-cooperative schemes. Numerical simulations show that the coded-cooperative schemes with labelling diversity achieve better BER performances and use of labelling diversity at the source node significantly lowers relay outage probability and hence the overall BER performance of the coded-cooperative scheme is improved manifolds
Optimized Bit Mappings for Spatially Coupled LDPC Codes over Parallel Binary Erasure Channels
In many practical communication systems, one binary encoder/decoder pair is
used to communicate over a set of parallel channels. Examples of this setup
include multi-carrier transmission, rate-compatible puncturing of turbo-like
codes, and bit-interleaved coded modulation (BICM). A bit mapper is commonly
employed to determine how the coded bits are allocated to the channels. In this
paper, we study spatially coupled low-density parity check codes over parallel
channels and optimize the bit mapper using BICM as the driving example. For
simplicity, the parallel bit channels that arise in BICM are replaced by
independent binary erasure channels (BECs). For two parallel BECs modeled
according to a 4-PAM constellation labeled by the binary reflected Gray code,
the optimization results show that the decoding threshold can be improved over
a uniform random bit mapper, or, alternatively, the spatial chain length of the
code can be reduced for a given gap to capacity. It is also shown that for
rate-loss free, circular (tail-biting) ensembles, a decoding wave effect can be
initiated using only an optimized bit mapper
Polarization-ring-switching for nonlinearity-tolerant geometrically-shaped four-dimensional formats maximizing generalized mutual information
In this paper, a new four-dimensional 64-ary polarization ring switching
(4D-64PRS) modulation format with a spectral efficiency of 6 bit/4D-sym is
introduced. The format is designed by maximizing the generalized mutual
information (GMI) and by imposing a constant-modulus on the 4D structure. The
proposed format yields an improved performance with respect to state-of-the-art
geometrically shaped modulation formats for bit-interleaved coded modulation
systems at the same spectral efficiency. Unlike previously published results,
the coordinates of the constellation points and the binary labeling of the
constellation are jointly optimized. When compared with
polarization-multiplexed 8-ary quadrature-amplitude modulation (PM-8QAM), gains
of up to 0.7 dB in signal-to-noise ratio are observed in the additive white
Gaussian noise (AWGN) channel. For a long-haul nonlinear optical fiber system
of 8,000 km, gains of up to 0.27 bit/4D-sym (5.5% data capacity increase) are
observed. These gains translate into a reach increase of approximately 16%
(1,100 km). The proposed modulation format is also shown to be more tolerant to
nonlinearities than PM-8QAM. Results with LDPC codes are also presented, which
confirm the gains predicted by the GMI.Comment: 12 pages, 12 figure
Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping
For finite coupling lengths, terminated spatially coupled low-density
parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we
investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in
conjunction with iterative demapping of higher order modulation formats.
Therefore, we examine the BP threshold of different coupled and uncoupled
ensembles. A comparison between the decoding thresholds approximated by EXIT
charts and the density evolution results of the coupled and uncoupled ensemble
is given. We investigate the effect and potential of different labelings for
such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM
system, e.g., using set partitioning labelings. A hybrid mapping is proposed,
where different sub-blocks use different labelings in order to further optimize
the decoding thresholds of tail-biting codes, while the computational
complexity overhead through iterative demapping remains small.Comment: presentat at the International Symposium on Turbo Codes & Iterative
Information Processing (ISTC), Brest, Sept. 201
Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels
The space-time bit-interleaved coded modulation (ST-BICM) is an efficient
technique to obtain high diversity and coding gain on a block-fading MIMO
channel. Its maximum-likelihood (ML) performance is computed under ideal
interleaving conditions, which enables a global optimization taking into
account channel coding. Thanks to a diversity upperbound derived from the
Singleton bound, an appropriate choice of the time dimension of the space-time
coding is possible, which maximizes diversity while minimizing complexity.
Based on the analysis, an optimized interleaver and a set of linear precoders,
called dispersive nucleo algebraic (DNA) precoders are proposed. The proposed
precoders have good performance with respect to the state of the art and exist
for any number of transmit antennas and any time dimension. With turbo codes,
they exhibit a frame error rate which does not increase with frame length.Comment: Submitted to IEEE Trans. on Information Theory, Submission: January
2006 - First review: June 200
Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping
For finite coupling lengths, terminated spatially coupled low-density
parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we
investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in
conjunction with iterative demapping of higher order modulation formats.
Therefore, we examine the BP threshold of different coupled and uncoupled
ensembles. A comparison between the decoding thresholds approximated by EXIT
charts and the density evolution results of the coupled and uncoupled ensemble
is given. We investigate the effect and potential of different labelings for
such a set-up using per-bit EXIT curves, and exemplify the method for a 16-QAM
system, e.g., using set partitioning labelings. A hybrid mapping is proposed,
where different sub-blocks use different labelings in order to further optimize
the decoding thresholds of tail-biting codes, while the computational
complexity overhead through iterative demapping remains small.Comment: presentat at the International Symposium on Turbo Codes & Iterative
Information Processing (ISTC), Brest, Sept. 201
Capacity-based Spatial Modulation Constellation and Pre-scaling Design
Spatial Modulation (SM) can utilize the index of the transmit antenna (TA) to
transmit additional information. In this paper, to improve the performance of
SM, a non-uniform constellation (NUC) and pre-scaling coefficients optimization
design scheme is proposed. The bit-interleaved coded modulation (BICM) capacity
calculation formula of SM system is firstly derived. The constellation and
pre-scaling coefficients are optimized by maximizing the BICM capacity without
channel state information (CSI) feedback. Optimization results are given for
the multiple-input-single-output (MISO) system with Rayleigh channel.
Simulation result shows the proposed scheme provides a meaningful performance
gain compared to conventional SM system without CSI feedback. The proposed
optimization design scheme can be a promising technology for future 6G to
achieve high-efficiency.Comment: 6 pages,conferenc
- …