175 research outputs found
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
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
Extrinsic information transfer charts for characterizing the iterative decoding convergence of fully parallel turbo decoders
Fully parallel turbo decoders (FPTDs) have been shown to offer a more-than-sixfold processing throughput and latency improvement over the conventional logarithmic BahlâCockeâJelinekâRaviv (Log-BCJR) turbo decoders. Rather than requiring hundreds or even thousands of time periods to decode each frame, such as the conventional Log-BCJR turbo decoders, the FPTD completes each decoding iteration using only one or two time periods, although up to six times as many decoding iterations are required to achieve the same error correction performance. Until now, it has not been possible to explain this increased iteration requirement using an extrinsic information transfer (EXIT) chart analysis, since the two component decoders are not alternately operated in the FPTD. Hence, in this paper, we propose a novel EXIT chart technique for characterizing the iterative exchange of not only extrinsic logarithmic likelihood ratios in the FPTD, but also the iterative exchange of extrinsic state metrics. In this way, the proposed technique can accurately predict the number of decoding iterations required for achieving iterative decoding convergence, as confirmed by the Monte Carlo simulation. The proposed technique offers new insights into the operation of FPTDs, which will facilitate improved designs in the future, in the same way as the conventional EXIT charts have enhanced the design and understanding of the conventional Log-BCJR turbo decoder
Gaussian Message Passing for Overloaded Massive MIMO-NOMA
This paper considers a low-complexity Gaussian Message Passing (GMP) scheme
for a coded massive Multiple-Input Multiple-Output (MIMO) systems with
Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station
with antennas serves sources simultaneously in the same frequency.
Both and are large numbers, and we consider the overloaded cases
with . The GMP for MIMO-NOMA is a message passing algorithm operating
on a fully-connected loopy factor graph, which is well understood to fail to
converge due to the correlation problem. In this paper, we utilize the
large-scale property of the system to simplify the convergence analysis of the
GMP under the overloaded condition. First, we prove that the \emph{variances}
of the GMP definitely converge to the mean square error (MSE) of Linear Minimum
Mean Square Error (LMMSE) multi-user detection. Secondly, the \emph{means} of
the traditional GMP will fail to converge when . Therefore, we propose and derive a new
convergent GMP called scale-and-add GMP (SA-GMP), which always converges to the
LMMSE multi-user detection performance for any , and show that it
has a faster convergence speed than the traditional GMP with the same
complexity. Finally, numerical results are provided to verify the validity and
accuracy of the theoretical results presented.Comment: Accepted by IEEE TWC, 16 pages, 11 figure
EXIT chart analysis for turbo LDS-OFDM receivers
In this paper, the mutual information transfer characteristics of turbo Multiuser Detector (MUD) for a novel air interface scheme, called Low Density Signature Orthogonal Frequency Division Multiplexing (LDS-OFDM) are investigated using Extrinsic Information Transfer (EXIT) charts. LDS-OFDM uses Low Density Signature structure for spreading the data symbols in frequency domain. This technique benefits from frequency diversity besides its ability of supporting parallel data streams more than the number of subcarriers (overloaded condition). The turbo MUD couples the data symbols' detector of LDS scheme with users' FEC (Forward Error Correction) decoders through the message passing principle. The effect of overloading on LDS scheme's performance is evaluated using EXIT chart. The results show that at Eb/N0 as low as 0.3, LDS-OFDM can support loads up to 300%
Energy-efficient design and implementation of turbo codes for wireless sensor network
The objective of this thesis is to apply near Shannon limit Error-Correcting Codes (ECCs), particularly the turbo-like codes, to energy-constrained wireless devices, for the purpose of extending their lifetime. Conventionally, sophisticated ECCs are applied to applications, such as mobile telephone networks or satellite television networks, to facilitate long range and high throughput wireless communication. For low power applications, such as Wireless Sensor Networks (WSNs), these ECCs were considered due to their high decoder complexities. In particular, the energy efficiency of the sensor nodes in WSNs is one of the most important factors in their design. The processing energy consumption required by high complexity ECCs decoders is a significant drawback, which impacts upon the overall energy consumption of the system. However, as Integrated Circuit (IC) processing technology is scaled down, the processing energy consumed by hardware resources reduces exponentially. As a result, near Shannon limit ECCs have recently begun to be considered for use in WSNs to reduce the transmission energy consumption [1,2]. However, to ensure that the transmission energy consumption reduction granted by the employed ECC makes a positive improvement on the overall energy efficiency of the system, the processing energy consumption must still be carefully considered.The main subject of this thesis is to optimise the design of turbo codes at both an algorithmic and a hardware implementation level for WSN scenarios. The communication requirements of the target WSN applications, such as communication distance, channel throughput, network scale, transmission frequency, network topology, etc, are investigated. Those requirements are important factors for designing a channel coding system. Especially when energy resources are limited, the trade-off between the requirements placed on different parameters must be carefully considered, in order to minimise the overall energy consumption. Moreover, based on this investigation, the advantages of employing near Shannon limit ECCs in WSNs are discussed. Low complexity and energy-efficient hardware implementations of the ECC decoders are essential for the target applications
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
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
Near-capacity MIMOs using iterative detection
In this thesis, Multiple-Input Multiple-Output (MIMO) techniques designed for transmission over narrowband Rayleigh fading channels are investigated. Specifically, in order to providea diversity gain while eliminating the complexity of MIMO channel estimation, a Differential Space-Time Spreading (DSTS) scheme is designed that employs non-coherent detection. Additionally, in order to maximise the coding advantage of DSTS, it is combined with Sphere Packing (SP) modulation. The related capacity analysis shows that the DSTS-SP scheme exhibits a higher capacity than its counterpart dispensing with SP. Furthermore, in order to attain additional performance gains, the DSTS system invokes iterative detection, where the outer code is constituted by a Recursive Systematic Convolutional (RSC) code, while the inner code is a SP demapper in one of the prototype systems investigated, while the other scheme employs a Unity Rate Code (URC) as its inner code in order to eliminate the error floor exhibited by the system dispensing with URC. EXIT charts are used to analyse the convergence behaviour of the iteratively detected schemes and a novel technique is proposed for computing the maximum achievable rate of the system based on EXIT charts. Explicitly, the four-antenna-aided DSTSSP system employing no URC precoding attains a coding gain of 12 dB at a BER of 10-5 and performs within 1.82 dB from the maximum achievable rate limit. By contrast, the URC aidedprecoded system operates within 0.92 dB from the same limit.On the other hand, in order to maximise the DSTS systemâs throughput, an adaptive DSTSSP scheme is proposed that exploits the advantages of differential encoding, iterative decoding as well as SP modulation. The achievable integrity and bit rate enhancements of the system are determined by the following factors: the specific MIMO configuration used for transmitting data from the four antennas, the spreading factor used and the RSC encoderâs code rate.Additionally, multi-functional MIMO techniques are designed to provide diversity gains, multiplexing gains and beamforming gains by combining the benefits of space-time codes, VBLASTand beamforming. First, a system employing Nt=4 transmit Antenna Arrays (AA) with LAA number of elements per AA and Nr=4 receive antennas is proposed, which is referred to as a Layered Steered Space-Time Code (LSSTC). Three iteratively detected near-capacity LSSTC-SP receiver structures are proposed, which differ in the number of inner iterations employed between the inner decoder and the SP demapper as well as in the choice of the outer code, which is either an RSC code or an Irregular Convolutional Code (IrCC). The three systems are capable of operating within 0.9, 0.4 and 0.6 dB from the maximum achievable rate limit of the system. A comparison between the three iteratively-detected schemes reveals that a carefully designed two-stage iterative detection scheme is capable of operating sufficiently close to capacity at a lower complexity, when compared to a three-stage system employing a RSC or a two-stage system using an IrCC as an outer code. On the other hand, in order to allow the LSSTC scheme to employ less receive antennas than transmit antennas, while still accommodating multiple users, a Layered Steered Space-Time Spreading (LSSTS) scheme is proposed that combines the benefits of space-time spreading, V-BLAST, beamforming and generalised MC DS-CDMA. Furthermore, iteratively detected LSSTS schemes are presented and an LLR post-processing technique is proposed in order to improve the attainable performance of the iteratively detected LSSTS system.Finally, a distributed turbo coding scheme is proposed that combines the benefits of turbo coding and cooperative communication, where iterative detection is employed by exchanging extrinsic information between the decoders of different single-antenna-aided users. Specifically, the effect of the errors induced in the first phase of cooperation, where the two users exchange their data, on the performance of the uplink in studied, while considering different fading channel characteristics
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
- âŠ