109 research outputs found
Three-Dimensional EXIT Chart Analysis of Iterative Detection Aided Coded Modulation Schemes
The iterative convergence of iteratively detected coded modulation schemes having different block lengths, decoding complexity and an unequal error protection capability is studied, when communicating over AWGNchannels using 8PSK modulation. More specifically, the coded modulation schemes investigated include Multilevel Coding (MLC), Trellis Coded Modulation (TCM), Turbo Trellis Coded Modulation (TTCM), Bit-Interleaved Coded Modulation (BICM) as well as Bit-Interleaved Coded Modulation employing Iterative Decoding (BICM-ID). A novel three dimensional EXIT chart was introduced for studying the iterative convergence behaviour of the Multistage Decoding (MSD) scheme used in MLC
Analysis and design of three-stage concatenated color-shift keying
Visible Light Communication (VLC) relies on abundant unlicensed bandwidth resources. As an attractive high-data-rate modulation scheme designed for VLC, Color Shift Keying (CSK) assisted modulation is analysed. We commence our study from an uncoded M-CSK scheme relying on the joint Maximum Likelihood (ML) Hard-Detection (HD) of three colors, when communicating over an AWGN channel, where both empirical and analytical results are provided. We invoke EXtrinsic Information Transfer (EXIT) charts for designing a Maximum A-posteriori Probability (MAP) based Soft-Detection (SD) aided iterative receiver jointly detecting the three colors. Based on the EXIT characteristics of M-CSK, we design different signal labeling strategies for diverse color constellations and detection schemes, which are capable of achieving a substantially improved Bit Error Ratio (BER) performance. Thus, given a fixed transmission power, a CSK system using our proposed signal labeling is capable of increasing the reliable data transmission distance by about 30%
EXIT charts for system design and analysis
Near-capacity performance may be achieved with the aid of iterative decoding, where extrinsic soft information is exchanged between the constituent decoders in order to improve the attainable system performance. Extrinsic information Transfer (EXIT) charts constitute a powerful semi-analytical tool used for analysing and designing iteratively decoded systems. In this tutorial, we commence by providing a rudimentary overview of the iterative decoding principle and the concept of soft information exchange. We then elaborate on the concept of EXIT charts using three iteratively decoded prototype systems as design examples. We conclude by illustrating further applications of EXIT charts, including near-capacity designs, the concept of irregular codes and the design of modulation schemes
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
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
Optimization of a Coded-Modulation System with Shaped Constellation
Conventional communication systems transmit signals that are selected from a signal constellation with uniform probability. However, information-theoretic results suggest that performance may be improved by shaping the constellation such that lower-energy signals are selected more frequently than higher-energy signals. This dissertation presents an energy efficient approach for shaping the constellations used by coded-modulation systems. The focus is on designing shaping techniques for systems that use a combination of amplitude phase shift keying (APSK) and low-density parity check (LDPC) coding. Such a combination is typical of modern satellite communications, such as the system used by the DVB-S2 standard.;The system implementation requires that a subset of the bits at the output of the LDPC encoder are passed through a nonlinear shaping encoder whose output bits are more likely to be a zero than a one. The constellation is partitioned into a plurality of sub-constellations, each with a different average signal energy, and the shaping bits are used to select the sub-constellation. An iterative receiver exchanges soft information among the demodulator, LDPC decoder, and shaping decoder. Parameters associated with the modulation and shaping code are optimized with respect to information rate, while the design of the LDPC code is optimized for the shaped modulation with the assistance of extrinsic-information transfer (EXIT) charts. The rule for labeling the constellation with bits is optimized using a novel hybrid cost function and a binary switching algorithm.;Simulation results show that the combination of constellation shaping, LDPC code optimization, and optimized bit labeling can achieve a gain in excess of 1 dB in an additive white Gaussian noise (AWGN) channel at a rate of 3 bits/symbol compared with a system that adheres directly to the DVB-S2 standard
Irregular repetition code hybrid ARQ in wireless system
Error control consists of error detection and error correction in the communication system. The purpose of this research work is to reduce error in the wireless communication system by using the advantages of both error correction techniques which are forward error correction (FEC) and automatic repeat request (ARQ). Thus, error can be corrected without retransmission and also via retransmission(s) when needed. Combination of FEC and ARQ is known as Hybrid ARQ. In this paper, Hybrid ARQ system is designed using three components which are the irregular repetition code (IRC) as a simple code, bit-interleaved coded modulation with iterative decoding (BICM-ID) as a simple Turbo processing and ARQ. The HARQ system is enhanced by the extended mapping (EM) adopted in the mapping system. The performance of the systems is evaluated in the additive white Gaussian noise (AWGN). The results show the Hybrid ARQ with extended mapping (Hybrid ARQ-EM) outperforms Hybrid ARQ with standard mapping (Hybrid ARQ-SM). Hybrid ARQ-EM achieves low bit error rate BER (10-5) at low signal-to-noise ratio SNR which only 3.03dB close to the theoretical limit. The proposed system Hybrid ARQ-EM achieves 52 percent gain enhancement of SNR gap from the theoretical limit compared to Hybrid ARQ-SM. Hybrid ARQ-EM gives better performance although in worse channel condition
Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective
We revisit the information-theoretic analysis of bit-interleaved coded
modulation (BICM) by modeling the BICM decoder as a mismatched decoder. The
mismatched decoding model is well-defined for finite, yet arbitrary, block
lengths, and naturally captures the channel memory among the bits belonging to
the same symbol. We give two independent proofs of the achievability of the
BICM capacity calculated by Caire et al. where BICM was modeled as a set of
independent parallel binary-input channels whose output is the bitwise
log-likelihood ratio. Our first achievability proof uses typical sequences, and
shows that due to the random coding construction, the interleaver is not
required. The second proof is based on the random coding error exponents with
mismatched decoding, where the largest achievable rate is the generalized
mutual information. We show that the generalized mutual information of the
mismatched decoder coincides with the infinite-interleaver BICM capacity. We
also show that the error exponent -and hence the cutoff rate- of the BICM
mismatched decoder is upper bounded by that of coded modulation and may thus be
lower than in the infinite-interleaved model. We also consider the mutual
information appearing in the analysis of iterative decoding of BICM with EXIT
charts. We show that the corresponding symbol metric has knowledge of the
transmitted symbol and the EXIT mutual information admits a representation as a
pseudo-generalized mutual information, which is in general not achievable. A
different symbol decoding metric, for which the extrinsic side information
refers to the hypothesized symbol, induces a generalized mutual information
lower than the coded modulation capacity.Comment: submitted to the IEEE Transactions on Information Theory. Conference
version in 2008 IEEE International Symposium on Information Theory, Toronto,
Canada, July 200
Constellation Shaping for WDM systems using 256QAM/1024QAM with Probabilistic Optimization
In this paper, probabilistic shaping is numerically and experimentally
investigated for increasing the transmission reach of wavelength division
multiplexed (WDM) optical communication system employing quadrature amplitude
modulation (QAM). An optimized probability mass function (PMF) of the QAM
symbols is first found from a modified Blahut-Arimoto algorithm for the optical
channel. A turbo coded bit interleaved coded modulation system is then applied,
which relies on many-to-one labeling to achieve the desired PMF, thereby
achieving shaping gain. Pilot symbols at rate at most 2% are used for
synchronization and equalization, making it possible to receive input
constellations as large as 1024QAM. The system is evaluated experimentally on a
10 GBaud, 5 channels WDM setup. The maximum system reach is increased w.r.t.
standard 1024QAM by 20% at input data rate of 4.65 bits/symbol and up to 75% at
5.46 bits/symbol. It is shown that rate adaptation does not require changing of
the modulation format. The performance of the proposed 1024QAM shaped system is
validated on all 5 channels of the WDM signal for selected distances and rates.
Finally, it was shown via EXIT charts and BER analysis that iterative
demapping, while generally beneficial to the system, is not a requirement for
achieving the shaping gain.Comment: 10 pages, 12 figures, Journal of Lightwave Technology, 201
- …