200 research outputs found
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
Simulations of Implementation of Advanced Communication Technologies
Wireless communication systems have seen significant advancements with the introduction of 3G, 4G, and 5G mobile standards. Since the simulation of entire systems is complex and may not allow evaluation of the impact of individual techniques, this thesis presents techniques and results for simulating the performance of advanced signaling techniques used in 3G, 4G, and 5G systems, including Code division multiple access (CDMA), Multiple Input Multiple Output (MIMO) systems, and Low-Density Parity Check (LDPC) codes. One implementation issue that is explored is the use of quantized Analog to Digital Converter (ADC) outputs and their impact on system performance.
Code division multiple access (CDMA) is a popular wireless technique, but its effectiveness is limited by factors such as multiple access interference (MAI) and the near far effect (NFE). The joint effect of sampling and quantization on the analog-digital converter (ADC) at the receiver\u27s front end has also been evaluated for different quantization bits. It has been demonstrated that 4 bits is the minimum ADC resolution sensitivity required for a reliable connection for a quantized signal with 3- and 6-dB power levels in noisy and interference-prone environments.
The demand for high data rate, reliable transmission, low bit error rate, and maximum transmission with low power has increased in wireless systems. Multiple Input Multiple Output (MIMO) systems with multiple antennas at both the transmitter and receiver side can meet these requirements by exploiting diversity and multipath propagation. The focus of MIMO systems is on improving reliability and maximizing throughput. Performance analysis of single input single output (SISO), single input multiple output (SIMO), multiple input single output (MISO), and MIMO systems is conducted using Alamouti space time block code (STBC) and Maximum Ratio Combining (MRC) technique used for transmit and receive diversity for Rayleigh fading channel under AWGN environment for BPSK and QPSK modulation schemes. Spatial Multiplexing (SM) is used to enhance spectral efficiency without additional bandwidth and power requirements. Minimum mean square error (MMSE) method is used for signal detection at the receiver end due to its low complexity and better performance. The performance of MIMO SM technique is compared for different antenna configurations and modulation schemes, and the MMSE detector is employed at the receiving end.
Advanced error correction techniques for channel coding are necessary to meet the demand for Mobile Internet in 5G wireless communications, particularly for the Internet of Things. Low Density Parity Check (LDPC) codes are used for error correction in 5G, offering high coding gain, high throughput, low latency, low power dissipation, low complexity, and rate compatibility. LDPC codes use base matrices of 5G New Radio (NR) for LDPC encoding, and a soft decision decoding algorithm is used for efficient Frame Error Rate (FER) performance. The performance of LDPC codes is assessed using a soft decision decoding layered message passing algorithm, with BPSK modulation and AWGN channel. Furthermore, the effects of quantization on LDPC codes are analyzed for both small and large numbers of quantization bits
Approximate inference in massive MIMO scenarios with moment matching techniques
Mención Internacional en el título de doctorThis Thesis explores low-complexity inference probabilistic algorithms in
high-dimensional Multiple-Input Multiple-Output (MIMO) systems and high order
M-Quadrature Amplitude Modulation (QAM) constellations. Several
modern communications systems are using more and more antennas to maximize
spectral efficiency, in a new phenomena call Massive MIMO. However,
as the number of antennas and/or the order of the constellation grow several
technical issues have to be tackled, one of them is that the symbol
detection complexity grows fast exponentially with the system dimension.
Nowadays the design of massive MIMO low-complexity receivers is one important
research line in MIMO because symbol detection can no longer rely
on conventional approaches such as Maximum a Posteriori (MAP) due to
its exponential computation complexity. This Thesis proposes two main results.
On one hand a hard decision low-complexity MIMO detector based on
Expectation Propagation (EP) algorithm which allows to iteratively approximate
within polynomial cost the posterior distribution of the transmitted
symbols. The receiver is named Expectation Propagation Detector (EPD)
and its solution evolves from Minimum Mean Square Error (MMSE) solution
and keeps per iteration the MMSE complexity which is dominated by
a matrix inversion. Hard decision Symbol Error Rate (SER) performance is
shown to remarkably improve state-of-the-art solutions of similar complexity.
On the other hand, a soft-inference algorithm, more suitable to modern
communication systems with channel codification techniques such as Low-
Density Parity-Check (LDPC) codes, is also presented. Modern channel
decoding techniques need as input Log-Likehood Ratio (LLR) information
for each coded bit. In order to obtain that information, firstly a soft bit
inference procedure must be performed. In low-dimensional scenarios, this
can be done by marginalization over the symbol posterior distribution. However,
this is not feasible at high-dimension. While EPD could provide this
probabilistic information, it is shown that its probabilistic estimates are in
general poor in the low Signal-to-Noise Ratio (SNR) regime. In order to
solve this inconvenience a new algorithm based on the Expectation Consistency
(EC) algorithm, which generalizes several algorithms such as Belief.
Propagation (BP) and EP itself, was proposed. The proposed algorithm
called Expectation Consistency Detector (ECD) maps the inference problem
as an optimization over a non convex function. This new approach
allows to find stationary points and tradeoffs between accuracy and convergence,
which leads to robust update rules. At the same complexity cost than
EPD, the new proposal achieves a performance closer to channel capacity at
moderate SNR. The result reveals that the probabilistic detection accuracy
has a relevant impact in the achievable rate of the overall system. Finally,
a modified ECD algorithm is presented, with a Turbo receiver structure
where the output of the decoder is fed back to ECD, achieving performance
gains in all block lengths simulated.
The document is structured as follows. In Chapter I an introduction
to the MIMO scenario is presented, the advantages and challenges are exposed
and the two main scenarios of this Thesis are set forth. Finally, the
motivation behind this work, and the contributions are revealed. In Chapters
II and III the state of the art and our proposal are presented for Hard
Detection, whereas in Chapters IV and V are exposed for Soft Inference Detection.
Eventually, a conclusion and future lines can be found in Chapter
VI.Esta Tesis aborda algoritmos de baja complejidad para la estimación probabilística en sistemas de Multiple-Input Multiple-Output (MIMO) de grandes
dimensiones con constelaciones M-Quadrature Amplitude Modulation (QAM)
de alta dimensionalidad. Son diversos los sistemas de comunicaciones que en
la actualidad están utilizando más y más antenas para maximizar la eficiencia
espectral, en un nuevo fenómeno denominado Massive MIMO. Sin embargo
los incrementos en el número de antenas y/o orden de la constelación
presentan ciertos desafíos tecnológicos que deben ser considerados. Uno de
ellos es la detección de los símbolos transmitidos en el sistema debido a que
la complejidad aumenta más rápido que las dimensiones del sistema. Por
tanto el diseño receptores para sistemas Massive MIMO de baja complejidad
es una de las importantes líneas de investigación en la actualidad en
MIMO, debido principalmente a que los métodos tradicionales no se pueden
implementar en sistemas con decenas de antenas, cuando lo deseable serían
centenas, debido a que su coste es exponencial.
Los principales resultados en esta Tesis pueden clasificarse en dos. En
primer lugar un receptor MIMO para decisión dura de baja complejidad
basado en el algoritmo Expectation Propagation (EP) que permite de manera
iterativa, con un coste computacional polinómico por iteración, aproximar
la distribución a posteriori de los símbolos transmitidos. El algoritmo,
denominado Expectation Propagation Detector (EPD), es inicializado con
la solución del algoritmo Minimum Mean Square Error (MMSE) y mantiene
el coste de este para todas las iteraciones, dominado por una inversión de
matriz. El rendimiento del decisor en probabilidad de error de símbolo muestra
ganancias remarcables con respecto a otros métodos en la literatura con
una complejidad similar. En segundo lugar, un algoritmo que provee una
estimación blanda, información que es más apropiada para los actuales sistemas
de comunicaciones que utilizan codificación de canal, como pueden
ser códigos Low-Density Parity-Check (LDPC). La información necesaria
para estos decodificadores de canal es Log-Likehood Ratio (LLR) para cada
uno de los bits codificados.
En escenarios de bajas dimensiones se pueden calcular las marginales de la distribución a posteriori, pero en escenarios de grandes dimensiones
no es viable, aunque EPD puede proporcionar este tipo de información a la
entrada del decodificador, dicha información no es la mejor al estar el algoritmo
pensado para detección dura, sobre todo se observa este fenómeno en
el rango de baja Signal-to-Noise Ratio (SNR). Para solucionar este problema
se propone un nuevo algoritmo basado en Expectation Consistency
(EC) que engloba diversos algoritmos como pueden ser Belief Propagation
(BP) y el algoritmo EP propuesto con anterioridad. El nuevo algoritmo
llamado Expectation Consistency Detector (ECD), trata el problema como
una optimización de una función no convexa. Esta aproximación permite
encontrar los puntos estacionarios y la relación entre precisión y convergencia,
que permitirán reglas de actualización más robustas y eficaces. Con
la misma compleja que el algoritmo propuesto inicialmente, ECD permite
rendimientos más próximos a la capacidad del canal en regímenes moderados
de SNR. Los resultados muestran que la precisión tiene un gran efecto
en la tasa que alcanza el sistema. Finalmente una versión modificada de
ECD es propuesta en una arquitectura típica de los Turbo receptores, en
la que la salida del decodificador es la entrada del receptor, y que permite
ganancias en el rendimiento en todas las longitudes de código simuladas.
El presente documento está estructurado de la siguiente manera. En el
primer Capítulo I, se realiza una introducción a los sistemas MIMO, presentando
sus ventajas, desventajas, problemas abiertos. Los modelos que se
utilizaran en la tesis y la motivación con la que se inició esta tesis son expuestos
en este primer capítulo. En los Capítulos II y III el estado del arte y
nuestra propuesta para detección dura son presentados, mientras que en los
Capítulos IV y V se presentan para detección suave. Finalmente las conclusiones
que pueden obtenerse de esta Tesis y futuras líneas de investigación
son expuestas en el Capítulo VI.Programa Oficial de Doctorado en Multimedia y ComunicacionesPresidente: Juan José Murillo Fuentes.- Secretario: Gonzalo Vázquez Vilar.- Vocal: María Isabel Valera Martíne
Advanced Wireless Digital Baseband Signal Processing Beyond 100 Gbit/s
International audienceThe continuing trend towards higher data rates in wireless communication systems will, in addition to a higher spectral efficiency and lowest signal processing latencies, lead to throughput requirements for the digital baseband signal processing beyond 100 Gbit/s, which is at least one order of magnitude higher than the tens of Gbit/s targeted in the 5G standardization. At the same time, advances in silicon technology due to shrinking feature sizes and increased performance parameters alone won't provide the necessary gain, especially in energy efficiency for wireless transceivers, which have tightly constrained power and energy budgets. In this paper, we highlight the challenges for wireless digital baseband signal processing beyond 100 Gbit/s and the limitations of today's architectures. Our focus lies on the channel decoding and MIMO detection, which are major sources of complexity in digital baseband signal processing. We discuss techniques on algorithmic and architectural level, which aim to close this gap. For the first time we show Turbo-Code decoding techniques towards 100 Gbit/s and a complete MIMO receiver beyond 100 Gbit/s in 28 nm technology
Non-binary LDPC coded STF-MIMO-OFDM with an iterative joint receiver structure
The aim of the dissertation was to design a realistic, low-complexity non-binary (NB) low density parity check (LDPC) coded space-time-frequency (STF) coded multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system with an iterative joint decoder and detector structure at the receiver. The goal of the first part of the dissertation was to compare the performance of different design procedures for NB-LDPC codes on an additive white Gaussian noise (AWGN) channel, taking into account the constraint on the code length. The effect of quantisation on the performance of the code was also analysed. Different methods for choosing the NB elements in the parity check matrix were compared. For the STF coding, a class of universal STF codes was used. These codes use linear pre-coding and a layering approach based on Diophantine numbers to achieve full diversity and a transmission rate (in symbols per channel use per frequency) equal to the number of transmitter antennas. The study of the system considers a comparative performance analysis of di erent ST, SF and STF codes. The simulations of the system were performed on a triply selective block fading channel. Thus, there was selectivity in the fading over time, space and frequency. The effect of quantisation at the receiver on the achievable diversity of linearly pre-coded systems (such as the STF codes used) was mathematically derived and verified with simulations. A sphere decoder (SD) was used as a MIMO detector. The standard method used to create a soft-input soft output (SISO) SD uses a hard-to-soft process and the max-log-map approximation. A new approach was developed which combines a Hopfield network with the SD. This SD-Hopfield detector was connected with the fast Fourier transform belief propagation (FFT-BP) algorithm in an iterative structure. This iterative system was able to achieve the same bit error rate (BER) performance as the original SISO-SD at a reduced complexity. The use of the iterative Hopfield-SD and FFT-BP decoder system also allows performance to be traded off for complexity by varying the number of decoding iterations. The complete system employs a NB-LDPC code concatenated with an STF code at the transmitter with a SISO-SD and FFT-BP decoder connected in an iterative structure at the receiver. The system was analysed in varying channel conditions taking into account the effect of correlation and quantisation. The performance of different SF and STF codes were compared and analysed in the system. An analysis comparing different numbers of FFT-BP and outer iterations was also done. AFRIKAANS : Die doel van die verhandeling was om ’n realistiese, lae-kompleksiteit nie-binˆere (NB) LDPC gekodeerde ruimte-tyd-frekwensie-gekodeerde MIMO-OFDM-sisteem met iteratiewe gesamentlike dekodeerder- en detektorstrukture by die ontvanger te ontwerp. Die eerstem deel van die verhandeling was om die werkverrigting van verskillende ontwerpprosedures vir NB-LDPC kodes op ’n gesommeerde wit Gausruiskanaal te vergelyk met inagneming van die beperking op die lengte van die kode. Verskillende metodes om die nie-bineêre elemente in die pariteitstoetsmatriks te kies, is gebruik. Vir die ruimte-tyd-frekwensiekodering is ’n klas universele ruimte-tyd-frekwensiekodes gebruik. Hierdie kodes gebruik lineêre pre-kodering en ’n laagbenadering gebaseer op Diofantiese syfers om volle diversiteit te bereik en ’n oordragtempo (in simbole per kanaalgebruik per frekwensie) gelyk aan die aantal senderantennes. Die studie van die sisteem oorweeg ’n vergelykende werkverrigtinganalisie van verskillende ruimte-tyd-, ruimte-freksensie- en ruimte-tyd-frekwensiekodes. Die simulasies van die sisteem is gedoen op ’n drievoudig selektiewe blokwegsterwingskanaal. Daar was dus selektiwiteit in die wegsterwing oor tyd, ruimte en frekwensie. Die effek van kwantisering by die ontvanger op die bereikbare diversiteit van lineêr pre-gekodeerde sisteme (soos die ruimte-tyd-frekwensiekodes wat gebruik is) is matematies afgelei en bevestig deur simulasies. ’n Sfeerdekodeerder (SD) is gebruik as ’n MIMO-detektor. Die standaardmetode wat gebuik is om ’n sagte-inset-sagte-uitset (SISO) SD te skep, gebruik ’n harde-na-sagte proses en die maksimum logaritmiese afbeelding-benadering. ’n Nuwe benadering wat ’n Hopfield-netwerk met die SD kombineer, is ontwikkel. Hierdie SD-Hopfield-detektor is verbind met die FFT-BP-algoritme in iteratiewe strukture. Hierdie iteratiewe sisteem was in staat om dieselfde bisfouttempo te bereik as die oorspronklike SISO-SD, met laer kompleksiteit. Die gebruik van die iteratiewe Hopfield-SD en FFT-BP-dekodeerdersisteem maak ook daarvoor voorsiening dat werkverrigting opgeweeg kan word teen kompleksiteit deur die aantal dekodering-iterasies te varieer. Die volledige sisteem maak gebruik van ’n QC-NB-LDPC-kode wat met ’n ruimte-tyd-frekwensiekode by die sender aaneengeskakel is met ’n SISO-SD en FFT-BP-dekodeerder wat in ’n iteratiewe struktuur by die ontvanger gekoppel is. Die sisteem is onder ’n verskeidenheid kanaalkondisies ge-analiseer met inagneming van die effek van korrelasie en kwantisering. Die werkverrigting van verskillende ruimte-frekwensie- en ruimte-tyd-frekwensiekodes is vergelyk en in die sisteem ge-analiseer. ’n Analise om ’n wisselende aantal FFT-BP en buite-iterasies te vergelyk, is ook gedoen. CopyrightDissertation (MEng)--University of Pretoria, 2010.Electrical, Electronic and Computer Engineeringunrestricte
- …