27 research outputs found
Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts
In this paper 3-D Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID), exchanging extrinsic information with the soft-decision demapper to approach the channel capacity. Recursive Systematic Convolutional (RSC) codes are selected as constituent codes, an interleaver is used for randomising the extrinsic information exchange of the constituent codes, while a puncturer helps to increase the achievable bandwidth efficiency. The convergence behaviour of the decoder is analysed with the aid of bit-based 3-D EXIT charts, for accurately calculating the operating EbN0 threshold, especially when SP based soft demapper is employed. Finally, we propose an attractive system configuration, which is capable of operating within about 1 dB from the channel capacity
Self-concatenated code design and its application in power-efficient cooperative communications
In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions
Self-concatenated coding for wireless communication systems
In this thesis, we have explored self-concatenated coding schemes that are designed for transmission over Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh fading channels. We designed both the symbol-based Self-ConcatenatedCodes considered using Trellis Coded Modulation (SECTCM) and bit-based Self- Concatenated Convolutional Codes (SECCC) using a Recursive Systematic Convolutional (RSC) encoder as constituent codes, respectively. The design of these codes was carried out with the aid of Extrinsic Information Transfer (EXIT) charts. The EXIT chart based design has been found an efficient tool in finding the decoding convergence threshold of the constituent codes. Additionally, in order to recover the information loss imposed by employing binary rather than non-binary schemes, a soft decision demapper was introduced in order to exchange extrinsic information withthe SECCC decoder. To analyse this information exchange 3D-EXIT chart analysis was invoked for visualizing the extrinsic information exchange between the proposed Iteratively Decoding aided SECCC and soft-decision demapper (SECCC-ID). Some of the proposed SECTCM, SECCC and SECCC-ID schemes perform within about 1 dB from the AWGN and Rayleigh fading channels’ capacity. A union bound analysis of SECCC codes was carried out to find the corresponding Bit Error Ratio (BER) floors. The union bound of SECCCs was derived for communications over both AWGN and uncorrelated Rayleigh fading channels, based on a novel interleaver concept.Application of SECCCs in both UltraWideBand (UWB) and state-of-the-art video-telephone schemes demonstrated its practical benefits.In order to further exploit the benefits of the low complexity design offered by SECCCs we explored their application in a distributed coding scheme designed for cooperative communications, where iterative detection is employed by exchanging extrinsic information between the decoders of SECCC and RSC at the destination. In the first transmission period of cooperation, the relay receives the potentially erroneous data and attempts to recover the information. The recovered information is then re-encoded at the relay using an RSC encoder. In the second transmission period this information is then retransmitted to the destination. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel-concatenated encoder. At the destination a Distributed Binary Self-Concatenated Coding scheme using Iterative Decoding (DSECCC-ID) was employed, where the two decoders (SECCC and RSC) exchange their extrinsic information. It was shown that the DSECCC-ID is a low-complexity scheme, yet capable of approaching the Discrete-input Continuous-output Memoryless Channels’s (DCMC) capacity.Finally, we considered coding schemes designed for two nodes communicating with each other with the aid of a relay node, where the relay receives information from the two nodes in the first transmission period. At the relay node we combine a powerful Superposition Coding (SPC) scheme with SECCC. It is assumed that decoding errors may be encountered at the relay node. The relay node then broadcasts this information in the second transmission period after re-encoding it, again, using a SECCC encoder. At the destination, the amalgamated block of Successive Interference Cancellation (SIC) scheme combined with SECCC then detects and decodes the signal either with or without the aid of a priori information. Our simulation results demonstrate that the proposed scheme is capable of reliably operating at a low BER for transmission over both AWGN and uncorrelated Rayleigh fading channels. We compare the proposed scheme’s performance to a direct transmission link between the two sources having the same throughput
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
Iterative decoding and detection for physical layer network coding
PhD ThesisWireless networks comprising multiple relays are very common and it is
important that all users are able to exchange messages via relays in the
shortest possible time. A promising technique to achieve this is physical
layer network coding (PNC), where the time taken to exchange messages
between users is achieved by exploiting the interference at the relay due
to the multiple incoming signals from the users. At the relay, the interference
is demapped to a binary sequence representing the exclusive-OR of
both users’ messages. The time to exchange messages is reduced because
the relay broadcasts the network coded message to both users, who can
then acquire the desired message by applying the exclusive-OR of their
original message with the network coded message. However, although
PNC can increase throughput it is at the expense of performance degradation
due to errors resulting from the demapping of the interference to
bits.
A number of papers in the literature have investigated PNC with an iterative
channel coding scheme in order to improve performance. However,
in this thesis the performance of PNC is investigated for end-to-end
(E2E) the three most common iterative coding schemes: turbo codes,
low-density parity-check (LDPC) codes and trellis bit-interleaved coded
modulation with iterative decoding (BICM-ID). It is well known that in
most scenarios turbo and LDPC codes perform similarly and can achieve
near-Shannon limit performance, whereas BICM-ID does not perform
quite as well but has a lower complexity. However, the results in this
thesis show that on a two-way relay channel (TWRC) employing PNC,
LDPC codes do not perform well and BICM-ID actually outperforms
them while also performing comparably with turbo codes. Also presented
in this thesis is an extrinsic information transfer (ExIT) chart
analysis of the iterative decoders for each coding scheme, which is used
to explain this surprising result. Another problem arising from the use
of PNC is the transfer of reliable information from the received signal at
the relay to the destination nodes. The demapping of the interference to
binary bits means that reliability information about the received signal
is lost and this results in a significant degradation in performance when
applying soft-decision decoding at the destination nodes. This thesis
proposes the use of traditional angle modulation (frequency modulation
(FM) and phase modulation (PM)) when broadcasting from the relay,
where the real and imaginary parts of the complex received symbols
at the relay modulate the frequency or phase of a carrier signal, while
maintaining a constant envelope. This is important since the complex
received values at the relay are more likely to be centred around zero and
it undesirable to transmit long sequences of low values due to potential
synchronisation problems at the destination nodes. Furthermore, the
complex received values, obtained after angle demodulation, are used to
derive more reliable log-likelihood ratios (LLRs) of the received symbols
at the destination nodes and consequently improve the performance of
the iterative decoders for each coding scheme compared with conventionally
coded PNC.
This thesis makes several important contributions: investigating the performance
of different iterative channel coding schemes combined with
PNC, presenting an analysis of the behaviour of different iterative decoding
algorithms when PNC is employed using ExIT charts, and proposing
the use of angle modulation at the relay to transfer reliable information
to the destination nodes to improve the performance of the iterative decoding
algorithms. The results from this thesis will also be useful for
future research projects in the areas of PNC that are currently being
addressed, such as synchronisation techniques and receiver design.Iraqi Ministry of Higher
Education and Scientific Research
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
Successive DF relaying: MS-DIS aided interference suppression and three-stage concatenated architecture design
Conventional single-relay aided two-phase cooperative networks employing coherent detection algorithms incur a significant 50% throughput loss. Furthermore, it is unrealistic to expect that in addition to the task of relaying, the relay-station would dedicate further precious resources to the estimation of the source-relay channel in support of coherent detection. In order to circumvent these problems, we propose decode and-forward (DF) based successive relaying employing noncoherent detection schemes. A crucial challenge in this context is that of suppressing the successive relaying induced interference, despite dispensing with any channel state information (CSI). We overcome this challenge by introducing a novel adaptive Newton algorithm based multiple-symbol differential interference suppression (MS-DIS) scheme. Correspondingly, a three-stage concatenated transceiver architecture is devised. We demonstrate that our proposed system is capable of near-error-free transmissions at low signal-to-noise ratios
Factor Graph Based Detection Schemes for Mobile Terrestrial DVB Systems with Long OFDM Blocks
This PhD dissertation analyzes the performance of second generation digital video broadcasting (DVB) systems in mobile terrestrial environments and proposes an iterative detection algorithm based on factor graphs (FG) to reduce the distortion caused by the time variation of the channel, providing error-free communication in very severe mobile conditions. The research work focuses on mobile scenarios where the intercarrier interference (ICI) is very high: high vehicular speeds when long orthogonal frequency-division multiplexing (OFDM) blocks are used.
As a starting point, we provide the theoretical background on the main topics behind the transmission and reception of terrestrial digital television signals in mobile environments, along with a general overview of the main signal processing techniques included in last generation terrestrial DVB systems. The proposed FG-based detector design is then assessed over a simpli ed bit-interleaved coded modulation (BICM)-OFDM communication scheme for a wide variety of mobile environments. Extensive simulation results show the e ectiveness of the proposed belief propagation (BP) algorithm over the channels of interest in this research work. Moreover, assuming that low density parity-check (LDPC) codes are decoded by means of FG-based algorithms, a high-order FG is de ned in order to accomplish joint signal detection and decoding into the same FG framework, o ering a fully parallel structure very suitable when long OFDM blocks are employed.
Finally, the proposed algorithms are analyzed over the physical layer of DVB-T2 speci cation. Two reception schemes are proposed which exploit the frequency and time-diversity inherent in time-varying channels with the aim of achieving a reasonable trade-o among performance, complexity and latency.Doktoretza tesi honek bigarren belaunaldiko telebista digitalaren eraginkortasuna aztertzen du eskenatoki mugikorrean, eta faktoreen grafoetan oinarritzen den hartzaile iteratibo bat proposatzen du denboran aldakorra den kanalak sortzen duen distortsioa leundu eta seinalea errorerik gabe hartzea ahalbidetzen duena. Proposatutako detektorea BICM-OFDM komunikazio eskema orokor baten gainean ebaluatu da lurreko broadcasting kanalaren baldintzak kontutan hartuz. Simulazio emaitzek algoritmo honen eraginkortasuna frogatzen dute Doppler frekuentzia handietan. Ikerketa lanaren bigarren zatian, faktoreen grafoetan oinarritutako detektorea eskema turbo zabalago baten baitan txertatu da LDPC dekodi katzaile batekin batera. Hartzaile diseinu honen abantaila nagusia da OFDM simbolo luzeetara ondo egokitzen dela. Azkenik, proposatutako algoritmoa DVB-T2 katearen baitan inplementatu da, bi hartzaile eskema proposatu direlarik seinaleak duen dibertsitate tenporal eta frekuentziala probesteko, beti ere eraginkortasunaren, konplexutasunaren eta latentziaren arteko konpromisoa mantenduz.Este trabajo de tesis analiza el rendimiento de la segunda generación de la televisión digital terreste en escenarios móviles y propone un algoritmo iterativo basado en grafos de factores para la detección de la señal y la reducción de la distorsión causada por la variación temporal del canal, permitiendo así recibir la señal libre de errores. El detector basado en grafos de factores propuesto es evaluado sobre un esquema de comunicaciones general BICM-OFDM en condiciones de transmisión propios de canales de difusión terrestres. Los resultados de simulación presentados muestran la e ciencia del algoritmo de detección propuesto en presencia de frecuencias Doppler muy altas. En una segunda parte del trabajo de investigación, el detector propuesto es incorporado a un esquema turbo junto con un decodi cador LDPC, dando lugar a un receptor iterativo que presenta características especialmente apropiadas para su implementación en sistemas OFDM con longitudes de símbolo elevadas. Por último, se analiza la implementación del algoritmo propuesto sobre la cadena de recepción de DVB-T2. Se presentan dos esquemas de recepción que explotan la diversidad temporal y frecuencial presentes en la señal afectada por canales variantes en el tiempo, consiguiendo un compromiso razonable entre rendimiento, complejidad y latencia