55 research outputs found
Performance Prediction of Nonbinary Forward Error Correction in Optical Transmission Experiments
In this paper, we compare different metrics to predict the error rate of
optical systems based on nonbinary forward error correction (FEC). It is shown
that the correct metric to predict the performance of coded modulation based on
nonbinary FEC is the mutual information. The accuracy of the prediction is
verified in a detailed example with multiple constellation formats, FEC
overheads in both simulations and optical transmission experiments over a
recirculating loop. It is shown that the employed FEC codes must be universal
if performance prediction based on thresholds is used. A tutorial introduction
into the computation of the threshold from optical transmission measurements is
also given.Comment: submitted to IEEE/OSA Journal of Lightwave Technolog
Low-Density Parity-Check Coded High-order Modulation Schemes
In this thesis, we investigate how to support reliable data transmissions at high speeds in future communication systems, such as 5G/6G, WiFi, satellite, and optical communications. One of the most fundamental problems in these communication systems is how to reliably transmit information with a limited number of resources, such as power and spectral.
To obtain high spectral efficiency, we use coded modulation (CM), such as bit-interleaved coded modulation (BICM) and delayed BICM (DBICM). To be specific, BICM is a pragmatic implementation of CM which has been largely adopted in both industry and academia. While BICM approaches CM capacity at high rates, the capacity gap between BICM and CM is still noticeable at lower code rates. To tackle this problem, DBICM, as a variation of BICM, introduces a delay module to create a dependency between multiple codewords, which enables us to exploit extrinsic information from the decoded delayed sub-blocks to improve the detection of the undelayed sub-blocks. Recent work shows that DBICM improves capacity over BICM. In addition, BICM and DBICM schemes protect each bit-channel differently, which is often referred to as the unequal error protection (UEP) property. Therefore, bit mapping designs are important for constructing pragmatic BICM and DBICM. To provide reliable communication, we have jointly designed bit mappings in DBICM and irregular low-density parity-check (LDPC) codes. For practical considerations, spatially coupled LDPC (SC-LDPC) codes have been considered as well. Specifically, we have investigated the joint design of the multi-chain SC-LDPC and the BICM bit mapper. In addition, the design of SC-LDPC codes with improved decoding threshold performance and reduced rate loss has been investigated in this thesis as well.
The main body of this thesis consists of three parts. In the first part, considering Gray-labeled square M-ary quadrature amplitude modulation (QAM) constellations, we investigate the optimal delay scheme with the largest spectrum efficiency of DBICM for a fixed maximum number of delayed time slots and a given signal-to-noise ratio. Furthermore, we jointly optimize degree distributions and channel assignments of LDPC codes using protograph-based extrinsic information transfer charts. In addition, we proposed a constrained progressive edge growth-like algorithm to jointly construct LDPC codes and bit mappings for DBICM, taking the capacity of each bit-channel into account. Simulation results demonstrate that the designed LDPC-coded DBICM systems significantly outperform LDPC-coded BICM systems. In the second part, we proposed a windowed decoding algorithm for DBICM, which uses the extrinsic information of both the decoded delayed and undelayed sub-blocks, to improve the detection for all sub-blocks. We show that the proposed windowed decoding significantly outperforms the original decoding, demonstrating the effectiveness of the proposed decoding algorithm. In the third part, we apply multi-chain SC-LDPC to BICM. We investigate various connections for multi-chain SC-LDPC codes and bit mapping designs and analyze the performance of the multi-chain SC-LDPC codes over the equivalent binary erasure channels via density evolution. Numerical results demonstrate the superiority of the proposed design over existing connected-chain ensembles and over single-chain ensembles with the existing bit mapping design
Low Complexity Decoding for Higher Order Punctured Trellis-Coded Modulation Over Intersymbol Interference Channels
Trellis-coded modulation (TCM) is a power and bandwidth efficient digital
transmission scheme which offers very low structural delay of the data stream.
Classical TCM uses a signal constellation of twice the cardinality compared to
an uncoded transmission with one bit of redundancy per PAM symbol, i.e.,
application of codes with rates when denotes the
cardinality of the signal constellation.
Recently published work allows rate adjustment for TCM by means of puncturing
the convolutional code (CC) on which a TCM scheme is based on.
In this paper it is shown how punctured TCM-signals transmitted over
intersymbol interference (ISI) channels can favorably be decoded. Significant
complexity reductions at only minor performance loss can be achieved by means
of reduced state sequence estimation.Comment: 4 pages, 5 figures, 3 algorithms, accepted and published at 6th
International Symposium on Communications, Control, and Signal Processing
(ISCCSP 2014
Advanced constellation and demapper schemes for next generation digital terrestrial television broadcasting systems
206 p.Esta tesis presenta un nuevo tipo de constelaciones llamadas no uniformes. Estos esquemas presentan una eficacia de hasta 1,8 dB superior a las utilizadas en los últimos sistemas de comunicaciones de televisión digital terrestre y son extrapolables a cualquier otro sistema de comunicaciones (satélite, móvil, cable¿). Además, este trabajo contribuye al diseño de constelaciones con una nueva metodologÃa que reduce el tiempo de optimización de dÃas/horas (metodologÃas actuales) a horas/minutos con la misma eficiencia. Todas las constelaciones diseñadas se testean bajo una plataforma creada en esta tesis que simula el estándar de radiodifusión terrestre más avanzado hasta la fecha (ATSC 3.0) bajo condiciones reales de funcionamiento.Por otro lado, para disminuir la latencia de decodificación de estas constelaciones esta tesis propone dos técnicas de detección/demapeo. Una es para constelaciones no uniformes de dos dimensiones la cual disminuye hasta en un 99,7% la complejidad del demapeo sin empeorar el funcionamiento del sistema. La segunda técnica de detección se centra en las constelaciones no uniformes de una dimensión y presenta hasta un 87,5% de reducción de la complejidad del receptor sin pérdidas en el rendimiento.Por último, este trabajo expone un completo estado del arte sobre tipos de constelaciones, modelos de sistema, y diseño/demapeo de constelaciones. Este estudio es el primero realizado en este campo
Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded Transmission Over ISI-Channels
In this paper we propose a matched encoding (ME) scheme for convolutionally
encoded transmission over intersymbol interference (usually called ISI)
channels. A novel trellis description enables to perform equalization and
decoding jointly, i.e., enables efficient super-trellis decoding. By means of
this matched non-linear trellis description we can significantly reduce the
number of states needed for the receiver-side Viterbi algorithm to perform
maximum-likelihood sequence estimation. Further complexity reduction is
achieved using the concept of reduced-state sequence estimation.Comment: 6 pages, 8 figures, accepted for ICNC'13. (see also: arXiv:1205.7031
Channel Estimation in Coded Modulation Systems
With the outstanding performance of coded modulation techniques in fading channels,
much research efforts have been carried out on the design of communication
systems able to operate at low signal-to-noise ratios (SNRs). From this perspective,
the so-called iterative decoding principle has been applied to many signal processing
tasks at the receiver: demodulation, detection, decoding, synchronization and
channel estimation. Nevertheless, at low SNRs, conventional channel estimators do
not perform satisfactorily. This thesis is mainly concerned with channel estimation
issues in coded modulation systems where different diversity techniques are exploited
to combat fading in single or multiple antenna systems.
First, for single antenna systems in fast time-varying fading channels, the thesis
focuses on designing a training sequence by exploiting signal space diversity (SSD).
Motivated by the power/bandwidth efficiency of the SSD technique, the proposed
training sequence inserts pilot bits into the coded bits prior to constellation mapping
and signal rotation. This scheme spreads the training sequence during a transmitted
codeword and helps the estimator to track fast variation of the channel gains. A comprehensive
comparison between the proposed training scheme and the conventional
training scheme is then carried out, which reveals several interesting conclusions with
respect to both error performance of the system and mean square error of the channel
estimator.
For multiple antenna systems, different schemes are examined in this thesis for
the estimation of block-fading channels. For typical coded modulation systems with
multiple antennas, the first scheme makes a distinction between the iteration in the
channel estimation and the iteration in the decoding. Then, the estimator begins
iteration when the soft output of the decoder at the decoding iteration meets some
specified reliability conditions. This scheme guarantees the convergence of the iterative
receiver with iterative channel estimator. To accelerate the convergence process
and decrease the complexity of successive iterations, in the second scheme, the channel estimator estimates channel state information (CSI) at each iteration with a combination
of the training sequence and soft information. For coded modulation systems
with precoding technique, in which a precoder is used after the modulator, the training
sequence and data symbols are combined using a linear precoder to decrease the
required training overhead. The power allocation and the placement of the training
sequence to be precoded are obtained based on a lower bound on the mean square
error of the channel estimation. It is demonstrated that considerable performance
improvement is possible when the training symbols are embedded within data symbols
with an equi-spaced pattern. In the last scheme, a joint precoder and training
sequence is developed to maximize the achievable coding gain and diversity order
under imperfect CSI. In particular, both the asymptotic performance behavior of the
system with the precoded training scheme under imperfect CSI and the mean square
error of the channel estimation are derived to obtain achievable diversity order and
coding gain. Simulation results demonstrate that the joint optimized scheme outperforms
the existing training schemes for systems with given precoders in terms of error
rate and the amount of training overhead
Advanced Modulation and Coding Technology Conference
The objectives, approach, and status of all current LeRC-sponsored industry contracts and university grants are presented. The following topics are covered: (1) the LeRC Space Communications Program, and Advanced Modulation and Coding Projects; (2) the status of four contracts for development of proof-of-concept modems; (3) modulation and coding work done under three university grants, two small business innovation research contracts, and two demonstration model hardware development contracts; and (4) technology needs and opportunities for future missions
- …