1,982 research outputs found
MIMO-aided near-capacity turbo transceivers: taxonomy and performance versus complexity
In this treatise, we firstly review the associated Multiple-Input Multiple-Output (MIMO) system theory and review the family of hard-decision and soft-decision based detection algorithms in the context of Spatial Division Multiplexing (SDM) systems. Our discussions culminate in the introduction of a range of powerful novel MIMO detectors, such as for example Markov Chain assisted Minimum Bit-Error Rate (MC-MBER) detectors, which are capable of reliably operating in the challenging high-importance rank-deficient scenarios, where there are more transmitters than receivers and hence the resultant channel-matrix becomes non-invertible. As a result, conventional detectors would exhibit a high residual error floor. We then invoke the Soft-Input Soft-Output (SISO) MIMO detectors for creating turbo-detected two- or three-stage concatenated SDM schemes and investigate their attainable performance in the light of their computational complexity. Finally, we introduce the powerful design tools of EXtrinsic Information Transfer (EXIT)-charts and characterize the achievable performance of the diverse near- capacity SISO detectors with the aid of EXIT charts
Design guidelines for spatial modulation
A new class of low-complexity, yet energyefficient Multiple-Input Multiple-Output (MIMO) transmission techniques, namely the family of Spatial Modulation (SM) aided MIMOs (SM-MIMO) has emerged. These systems are capable of exploiting the spatial dimensions (i.e. the antenna indices) as an additional dimension invoked for transmitting information, apart from the traditional Amplitude and Phase Modulation (APM). SM is capable of efficiently operating in diverse MIMO configurations in the context of future communication systems. It constitutes a promising transmission candidate for large-scale MIMO design and for the indoor optical wireless communication whilst relying on a single-Radio Frequency (RF) chain. Moreover, SM may also be viewed as an entirely new hybrid modulation scheme, which is still in its infancy. This paper aims for providing a general survey of the SM design framework as well as of its intrinsic limits. In particular, we focus our attention on the associated transceiver design, on spatial constellation optimization, on link adaptation techniques, on distributed/ cooperative protocol design issues, and on their meritorious variants
Optimized Iterative (Turbo) Reception for QAM OFDM with CFO over Unknown Double-Selective Channels
A novel iterative (turbo) receiver is introduced, suitable for orthogonal frequency division multiplexing (OFDM) employing quadrature amplitude modulation (QAM) and receiver diversity. The system operates over a double-selective channel and includes a carrier frequency offset (CFO). We propose a maximum a posteriori probability expectation-maximization (MAP-EM) receiver with a different EM parameter division than standard methods. In such standard MAP-EM receivers, the E-step parameters correspond to the channel, while the M-step parameters correspond to the CFO and data symbols. This standard receiver parameter division results into a highly complex receiver for QAM, due to the large modulated symbol alphabet size, and the non-constant constellation symbol amplitude. In this paper, a new receiver framework introduces a different parameter division that leads to reduced complexity turbo receivers for QAM signaling, while still achieving close to optimal system performance. The new approach adapts the sum-product algorithm (SPA) parameter framework to the MAP-EM receiver. Thus, in the new receiver framework, the E-step parameters are data symbols, while the M-step parameters are the channel and the CFO. We evaluate the performance of the proposed receiver with and without automatic repeat request (ARQ), where in the former case packet combining applies to further improve performance
Multi-Antenna Assisted Virtual Full-Duplex Relaying with Reliability-Aware Iterative Decoding
In this paper, a multi-antenna assisted virtual full-duplex (FD) relaying
with reliability-aware iterative decoding at destination node is proposed to
improve system spectral efficiency and reliability. This scheme enables two
half-duplex relay nodes, mimicked as FD relaying, to alternatively serve as
transmitter and receiver to relay their decoded data signals regardless the
decoding errors, meanwhile, cancel the inter-relay interference with
QR-decomposition. Then, by deploying the reliability-aware iterative
detection/decoding process, destination node can efficiently mitigate
inter-frame interference and error propagation effect at the same time.
Simulation results show that, without extra cost of time delay and signalling
overhead, our proposed scheme outperforms the conventional selective
decode-and-forward (S-DF) relaying schemes, such as cyclic redundancy check
based S-DF relaying and threshold based S-DF relaying, by up to 8 dB in terms
of bit-error-rate.Comment: 6 pages, 4 figures, conference paper has been submitte
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
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
Application of integer quadratic programming in detection of high-dimensional wireless systems
High-dimensional wireless systems have recently generated a great deal of interest due to their ability to accommodate increasing demands for high transmission data rates with high communication reliability. Examples of such large-scale systems include single-input, single-output symbol spread OFDM system, large-scale single-user multi-input multi-output (MIMO) OFDM systems, and large-scale multiuser MIMO systems. In these systems, the number of symbols required to be jointly detected at the receiver is relatively large. The challenge with the practical realization of these systems is to design a detection scheme that provides high communication reliability with reasonable computational complexity, even as the number of simultaneously transmitted independent communication signals becomes very large.^ Most of the optimal or near-optimal detection techniques that have been proposed in the literature of relatively low-dimensional wireless systems, such as MIMO systems in which number of antennas is less than 10, become problematic for high-dimensional detection problems. That is, their performance degrades or the computational complexity becomes prohibitive, especially when higher-order QAM constellations are employed.^ In the first part of this thesis, we propose a near-optimal detection technique which offers a flexible trade-off between complexity and performance. The proposed technique formulates the detection problem in terms of Integer Quadratic Programming (IQP), which is then solved through a controlled Branch and Bound (BB) search tree algorithm. In addition to providing good performance, an important feature of this approach is that its computational complexity remains roughly the same even as we increase the constellation order from 4-QAM to 256-QAM. The performance of the proposed algorithm is investigated for both symbol spread OFDM systems and large-scale MIMO systems with both frequency selective and at fading channels.^ The second part of this work focuses on a reduced complexity version of IQP referred to as relaxed quadratic programming (QP). In particular, QP is used to reformulate two widely used detection schemes for MIMO OFDM: (1) Successive Interference Cancellation (SIC) and (2) Iterative Detecting and Decoding (IDD). First, SIC-based algorithms are derived via a QP formulation in contrast to using a linear MMSE detector at each stage. The resulting QP-SIC algorithms offer lower computational complexity than the SIC schemes that employ linear MMSE at each stage, especially when the dimension of the received signal vector is high. Three versions of QP-SIC are proposed based on various trade-offs between complexity and receiver performance; each of the three QP-SIC algorithms outperforms existing SIC techniques. Second, IDD-based algorithms are developed using a QP detector. We show how the soft information, in terms of the Log Likelihood Ratio (LLR), can be extracted from the QP detector. Further, the procedure for incorporating the a-priori information that is passed from the channel decoder to the QP detector is developed. Simulation results are presented demonstrating that the use of QP in IDD offers improved performance at the cost of a reasonable increase in complexity compared to linear detectors
- âŠ