37 research outputs found
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
Soft-Decision-Driven Channel Estimation for Pipelined Turbo Receivers
We consider channel estimation specific to turbo equalization for
multiple-input multiple-output (MIMO) wireless communication. We develop a
soft-decision-driven sequential algorithm geared to the pipelined turbo
equalizer architecture operating on orthogonal frequency division multiplexing
(OFDM) symbols. One interesting feature of the pipelined turbo equalizer is
that multiple soft-decisions become available at various processing stages. A
tricky issue is that these multiple decisions from different pipeline stages
have varying levels of reliability. This paper establishes an effective
strategy for the channel estimator to track the target channel, while dealing
with observation sets with different qualities. The resulting algorithm is
basically a linear sequential estimation algorithm and, as such, is
Kalman-based in nature. The main difference here, however, is that the proposed
algorithm employs puncturing on observation samples to effectively deal with
the inherent correlation among the multiple demapper/decoder module outputs
that cannot easily be removed by the traditional innovations approach. The
proposed algorithm continuously monitors the quality of the feedback decisions
and incorporates it in the channel estimation process. The proposed channel
estimation scheme shows clear performance advantages relative to existing
channel estimation techniques.Comment: 11 pages; IEEE Transactions on Communications 201
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
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
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
Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)
This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICM-ID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels.
For BICM-ID over a single-antenna frequency non-selective fading channel, the problem of mapping over multiple symbols, i.e., multi-dimensional (multi-D) mapping, with 8-PSK constellation is investigated. An explicit algorithm to construct a good multi-D mapping of 8-PSK to improve the asymptotic performance of BICM-ID systems is introduced. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (1-dimensional complex) mapping and the multi-D mapping found previously by computer search is thoroughly demonstrated.
In addition to the mapping issue in single-antenna BICM-ID systems, the use of signal space diversity (SSD), also known as linear constellation precoding (LCP), is considered in BICM-ID over frequency non-selective fading channels. The performance analysis of BICM-ID and complex N-dimensional signal space diversity is carried out to study its performance limitation, the choice of the rotation matrix and the design of a low-complexity receiver. Based on the design criterion obtained from a tight error bound, the optimality of the rotation matrix is established. It is shown that using the class of optimal rotation matrices, the performance of BICM-ID systems over a frequency non-selective Rayleigh fading channel approaches that of the BICM-ID systems over an additive white Gaussian noise (AWGN) channel when the dimension of the signal constellation increases. Furthermore, by exploiting the sigma mapping for any M-ary quadrature amplitude modulation (QAM) constellation, a very simple sub-optimal, yet effective iterative receiver structure suitable for signal constellations with large dimensions is proposed. Simulation results in various cases and conditions indicate that the proposed receiver can achieve the analytical performance bounds with low complexity.
The application of BICM-ID with SSD is then extended to the case of cascaded Rayleigh fading, which is more suitable to model mobile-to-mobile communication channels. By deriving the error bound on the asymptotic performance, it is first illustrated that for a small modulation constellation, a cascaded Rayleigh fading causes a much more severe performance degradation than a
conventional Rayleigh fading. However, BICM-ID employing SSD with a sufficiently large constellation can close the performance gap between the Rayleigh and cascaded Rayleigh fading channels, and their performance can closely approach that over an AWGN channel.
In the next step, the use of SSD in BICM-ID over frequency selective Rayleigh fading channels employing a multi-carrier modulation technique known as orthogonal frequency division multiplexing (OFDM) is studied. Under the assumption of correlated fading over subcarriers, a tight bound on the asymptotic error performance for the general case of applying SSD over all N subcarriers is derived and used to establish the best achievable asymptotic performance by SSD. It is then shown that precoding over subgroups of at least L subcarriers per group, where L is the number of channel taps, is sufficient to obtain this best asymptotic error performance, while significantly reducing the receiver complexity. The optimal joint subcarrier grouping and rotation matrix design is subsequently determined by solving the Vandermonde linear system. Illustrative examples show a good agreement between various analytical and simulation results.
Further, by combining the ideas of multi-D mapping and subcarrier grouping, a novel power and bandwidth-efficient bit-interleaved coded modulation with OFDM and iterative decoding (BI-COFDM-ID) in which multi-D mapping is performed over a group of subcarriers for broadband transmission in a frequency selective fading environment is proposed. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multi-D mapping for BICM-ID in frequency non-selective Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with SSD. Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using SSD and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth and receiver complexity.
Finally, the investigation is extended to the application of BICM-ID over a multiple-input multiple-output (MIMO) system equipped with multiple antennas at both the transmitter and the receiver to exploit both time and spatial diversities, where neither the transmitter nor the receiver knows the channel fading coefficients. The concentration is on the class of unitary constellation, due to its advantages in terms of both information-theoretic capacity and error probability. The tight error bound with respect to the asymptotic performance is also derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, by using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. Analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping
Transmission strategies for broadband wireless systems with MMSE turbo equalization
This monograph details efficient transmission strategies for single-carrier wireless broadband communication systems employing iterative (turbo) equalization. In particular, the first part focuses on the design and analysis of low complexity and robust MMSE-based turbo equalizers operating in the frequency domain. Accordingly, several novel receiver schemes are presented which improve the convergence properties and error performance over the existing turbo equalizers. The second part discusses concepts and algorithms that aim to increase the power and spectral efficiency of the communication system by efficiently exploiting the available resources at the transmitter side based upon the channel conditions. The challenging issue encountered in this context is how the transmission rate and power can be optimized, while a specific convergence constraint of the turbo equalizer is guaranteed.Die vorliegende Arbeit beschäftigt sich mit dem Entwurf und der Analyse von
effizienten Übertragungs-konzepten für drahtlose, breitbandige
Einträger-Kommunikationssysteme mit iterativer (Turbo-) Entzerrung und
Kanaldekodierung. Dies beinhaltet einerseits die Entwicklung von
empfängerseitigen Frequenzbereichs-entzerrern mit geringer Komplexität
basierend auf dem Prinzip der Soft Interference Cancellation Minimum-Mean
Squared-Error (SC-MMSE) Filterung und andererseits den Entwurf von
senderseitigen Algorithmen, die durch Ausnutzung von
Kanalzustandsinformationen die Bandbreiten- und Leistungseffizienz in Ein-
und Mehrnutzersystemen mit Mehrfachantennen (sog. Multiple-Input
Multiple-Output (MIMO)) verbessern.
Im ersten Teil dieser Arbeit wird ein allgemeiner Ansatz für Verfahren zur
Turbo-Entzerrung nach dem Prinzip der linearen MMSE-Schätzung, der
nichtlinearen MMSE-Schätzung sowie der kombinierten MMSE- und
Maximum-a-Posteriori (MAP)-Schätzung vorgestellt. In diesem Zusammenhang
werden zwei neue Empfängerkonzepte, die eine Steigerung der
Leistungsfähigkeit und Verbesserung der Konvergenz in Bezug auf
existierende SC-MMSE Turbo-Entzerrer in verschiedenen Kanalumgebungen
erzielen, eingeführt. Der erste Empfänger - PDA SC-MMSE - stellt eine
Kombination aus dem Probabilistic-Data-Association (PDA) Ansatz und dem
bekannten SC-MMSE Entzerrer dar. Im Gegensatz zum SC-MMSE nutzt der PDA
SC-MMSE eine interne Entscheidungsrückführung, so dass zur Unterdrückung
von Interferenzen neben den a priori Informationen der Kanaldekodierung
auch weiche Entscheidungen der vorherigen Detektions-schritte
berücksichtigt werden. Durch die zusätzlich interne
Entscheidungsrückführung erzielt der PDA SC-MMSE einen wesentlichen Gewinn
an Performance in räumlich unkorrelierten MIMO-Kanälen gegenüber dem
SC-MMSE, ohne dabei die Komplexität des Entzerrers wesentlich zu erhöhen.
Der zweite Empfänger - hybrid SC-MMSE - bildet eine Verknüpfung von
gruppenbasierter SC-MMSE Frequenzbereichsfilterung und MAP-Detektion.
Dieser Empfänger besitzt eine skalierbare Berechnungskomplexität und weist
eine hohe Robustheit gegenüber räumlichen Korrelationen in MIMO-Kanälen
auf. Die numerischen Ergebnisse von Simulationen basierend auf Messungen
mit einem Channel-Sounder in Mehrnutzerkanälen mit starken räumlichen
Korrelationen zeigen eindrucksvoll die Überlegenheit des hybriden
SC-MMSE-Ansatzes gegenüber dem konventionellen SC-MMSE-basiertem Empfänger.
Im zweiten Teil wird der Einfluss von System- und Kanalmodellparametern auf
die Konvergenzeigenschaften der vorgestellten iterativen Empfänger mit
Hilfe sogenannter Korrelationsdiagramme untersucht. Durch semi-analytische
Berechnungen der Entzerrer- und Kanaldecoder-Korrelationsfunktionen wird
eine einfache Berechnungsvorschrift zur Vorhersage der
Bitfehlerwahrscheinlichkeit von SC-MMSE und PDA SC-MMSE Turbo Entzerrern
für MIMO-Fadingkanäle entwickelt. Des Weiteren werden zwei Fehlerschranken
für die Ausfallwahrscheinlichkeit der Empfänger vorgestellt. Die
semi-analytische Methode und die abgeleiteten Fehlerschranken ermöglichen
eine aufwandsgeringe Abschätzung sowie Optimierung der Leistungsfähigkeit
des iterativen Systems.
Im dritten und abschließenden Teil werden Strategien zur Raten- und
Leistungszuweisung in Kommunikationssystemen mit konventionellen iterativen
SC-MMSE Empfängern untersucht. Zunächst wird das Problem der Maximierung
der instantanen Summendatenrate unter der Berücksichtigung der Konvergenz
des iterativen Empfängers für einen Zweinutzerkanal mit fester
Leistungsallokation betrachtet. Mit Hilfe des Flächentheorems von
Extrinsic-Information-Transfer (EXIT)-Funktionen wird eine obere Schranke
für die erreichbare Ratenregion hergeleitet. Auf Grundlage dieser Schranke
wird ein einfacher Algorithmus entwickelt, der für jeden Nutzer aus einer
Menge von vorgegebenen Kanalcodes mit verschiedenen Codierraten denjenigen
auswählt, der den instantanen Datendurchsatz des Mehrnutzersystems
verbessert. Neben der instantanen Ratenzuweisung wird auch ein
ausfallbasierter Ansatz zur Ratenzuweisung entwickelt. Hierbei erfolgt die
Auswahl der Kanalcodes für die Nutzer unter Berücksichtigung der Einhaltung
einer bestimmten Ausfallwahrscheinlichkeit (outage probability) des
iterativen Empfängers. Des Weiteren wird ein neues Entwurfskriterium für
irreguläre Faltungscodes hergeleitet, das die Ausfallwahrscheinlichkeit von
Turbo SC-MMSE Systemen verringert und somit die Zuverlässigkeit der
Datenübertragung erhöht. Eine Reihe von Simulationsergebnissen von
Kapazitäts- und Durchsatzberechnungen werden vorgestellt, die die
Wirksamkeit der vorgeschlagenen Algorithmen und Optimierungsverfahren in
Mehrnutzerkanälen belegen. Abschließend werden außerdem verschiedene
Maßnahmen zur Minimierung der Sendeleistung in Einnutzersystemen mit
senderseitiger Singular-Value-Decomposition (SVD)-basierter Vorcodierung
untersucht. Es wird gezeigt, dass eine Methode, welche die Leistungspegel
des Senders hinsichtlich der Bitfehlerrate des iterativen Empfängers
optimiert, den konventionellen Verfahren zur Leistungszuweisung überlegen
ist
Iterative decoding combined with physical-layer network coding on impulsive noise channels
PhD ThesisThis thesis investigates the performance of a two-way wireless relay channel (TWRC)
employing physical layer network coding (PNC) combined with binary and non-binary
error-correcting codes on additive impulsive noise channels. This is a research topic that
has received little attention in the research community, but promises to offer very
interesting results as well as improved performance over other schemes. The binary
channel coding schemes include convolutional codes, turbo codes and trellis bitinterleaved
coded modulation with iterative decoding (BICM-ID). Convolutional codes
and turbo codes defined in finite fields are also covered due to non-binary channel
coding schemes, which is a sparse research area. The impulsive noise channel is based on
the well-known Gaussian Mixture Model, which has a mixture constant denoted by α.
The performance of PNC combined with the different coding schemes are evaluated with
simulation results and verified through the derivation of union bounds for the theoretical
bit-error rate (BER). The analyses of the binary iterative codes are presented in the form
of extrinsic information transfer (ExIT) charts, which show the behaviour of the iterative
decoding algorithms at the relay of a TWRC employing PNC and also the signal-to-noise
ratios (SNRs) when the performance converges. It is observed that the non-binary coding
schemes outperform the binary coding schemes at low SNRs and then converge at higher
SNRs. The coding gain at low SNRs become more significant as the level of
impulsiveness increases. It is also observed that the error floor due to the impulsive noise
is consistently lower for non-binary codes. There is still great scope for further research
into non-binary codes and PNC on different channels, but the results in this thesis have
shown that these codes can achieve significant coding gains over binary codes for
wireless networks employing PNC, particularly when the channels are harsh
Self-interference cancellation for full-duplex MIMO transceivers
PhD ThesisIn recent years, there has been enormous interest in utilizing the full-duplex
(FD) technique with multiple-input multiple-output (MIMO) systems to complement
the evolution of fifth generation technologies. Transmission and reception
using FD-MIMO occur simultaneously over the same frequency band
and multiple antennas are employed in both sides. The motivation for employing
FD-MIMO is the rapidly increasing demand on frequency resources,
and also FD has the ability to improve spectral efficiency and channel capacity
by a factor of two compared to the conventional half-duplex technique.
Additionally, MIMO can enhance the diversity gain and enable FD to acquire
further degrees of freedom in mitigating the self-interference (SI). The
latter is one of the key challenges degrading the performance of systems operating
in FD mode due to local transmission which involves larger power
level than the signals of interest coming from distance sources that are significantly
more attenuated due to path loss propagation phenomena. Various
approaches can be used for self-interference cancellation (SIC) to tackle SI
by combining passive suppression with the analogue and digital cancellation
techniques. Moreover, active SIC techniques using special domain suppression
based on zero-forcing and null-space projection (NSP) can be exploited
for this purpose too. The main contributions of this thesis can be summarized
as follows. Maximum-ratio combining with NSP are jointly exploited in order
to increase the signal-to-noise ratio (SNR) of the desired path and mitigate
the undesired loop path, respectively, for an equalize-and-forward (EF) relay
using FD-MIMO. Additionally, an end-to-end performance analysis of the
proposed system is obtained in the presence of imperfect channel state information
by formulating mathematically the exact closed-form solutions for
the signal-to-interference-plus-noise ratio (SINR) distribution, outage probability,
and average symbol-error rate for uncoded M-ary phase-shift keying
over Rayleigh fading channels and in the presence of additive white Gaussian
noise (AWGN). The coefficients of the EF-relay are designed to attain
the minimum mean-square error (MMSE) between the transmission symbols.
Comparison of the results obtained with relevant state-of-the-art techniques
suggests significant improvements in the SINR figures and system capacity.
Furthermore, iterative detection and decoding (IDD) are proposed to mitigate
the residual self-interference (SI) remaining after applying passive suppression
along with two stages of SI cancellation (SIC) filters in the analogue
and digital domains for coded FD bi-directional transceiver based multiple
antennas. IDD comprises an adaptive MMSE filter with log-likelihood ratio
demapping, while the soft-in soft-out decoder utilizes the maximum a posteriori
(MAP) algorithm. The proposed system’s performance is evaluated in
the presence of AWGN over non-selective (flat) Rayleigh fading single-input
multiple-output (SIMO) and MIMO channels. However, the results of the
analyses can be applied to multi-path channels if orthogonal frequency division
multiplexing is utilised with a proper length of cyclic prefix in order to
tackle the channels’ frequency-selectivity and delay spread. Simulation results
are presented to demonstrate the bit-error rate (BER) performance as a
function of the SNR, revealing a close match to the SI-free case for the proposed
system. Furthermore, the results are validated by deriving a tight upper
bound on the performance of rate-1=2 convolutional codes for FD-SIMO and
FD-MIMO systems for different modulation schemes under the same conditions,
which asymptotically exhibits close agreement with the simulated BER
performance.Ministry of Higher Education and Scientific Research
(MoHESR), and the University of Mosul and to the Iraqi Cultural Attache in
London for providing financial support for my PhD scholarship