1,999 research outputs found

    Performance evaluation of mobile WiMAX with MIMO and relay extensions

    Get PDF

    A comparison of the HIPERLAN/2 and IEEE 802.11a wireless LAN standards

    Get PDF

    Cyclic Prefix-Free MC-CDMA Arrayed MIMO Communication Systems

    No full text
    The objective of this thesis is to investigate MC-CDMA MIMO systems where the antenna array geometry is taken into consideration. In most MC-CDMA systems, cyclic pre xes, which reduce the spectral e¢ ciency, are used. In order to improve the spectral efficiency, this research study is focused on cyclic pre x- free MC-CDMA MIMO architectures. Initially, space-time wireless channel models are developed by considering the spatio-temporal mechanisms of the radio channel, such as multipath propaga- tion. The spatio-temporal channel models are based on the concept of the array manifold vector, which enables the parametric modelling of the channel. The array manifold vector is extended to the multi-carrier space-time array (MC-STAR) manifold matrix which enables the use of spatio-temporal signal processing techniques. Based on the modelling, a new cyclic pre x-free MC- CDMA arrayed MIMO communication system is proposed and its performance is compared with a representative existing system. Furthermore, a MUSIC-type algorithm is then developed for the estimation of the channel parameters of the received signal. This proposed cyclic pre x-free MC-CDMA arrayed MIMO system is then extended to consider the effects of spatial diffusion in the wireless channel. Spatial diffusion is an important channel impairment which is often ignored and the failure to consider such effects leads to less than satisfactory performance. A subspace-based approach is proposed for the estimation of the channel parameters and spatial spread and reception of the desired signal. Finally, the problem of joint optimization of the transmit and receive beam- forming weights in the downlink of a cyclic pre x-free MC-CDMA arrayed MIMO communication system is investigated. A subcarrier-cooperative approach is used for the transmit beamforming so that there is greater flexibility in the allocation of channel symbols. The resulting optimization problem, with a per-antenna transmit power constraint, is solved by the Lagrange multiplier method and an iterative algorithm is proposed

    Classical and Bayesian Linear Data Estimators for Unique Word OFDM

    Full text link
    Unique word - orthogonal frequency division multiplexing (UW-OFDM) is a novel OFDM signaling concept, where the guard interval is built of a deterministic sequence - the so-called unique word - instead of the conventional random cyclic prefix. In contrast to previous attempts with deterministic sequences in the guard interval the addressed UW-OFDM signaling approach introduces correlations between the subcarrier symbols, which can be exploited by the receiver in order to improve the bit error ratio performance. In this paper we develop several linear data estimators specifically designed for UW-OFDM, some based on classical and some based on Bayesian estimation theory. Furthermore, we derive complexity optimized versions of these estimators, and we study their individual complex multiplication count in detail. Finally, we evaluate the estimators' performance for the additive white Gaussian noise channel as well as for selected indoor multipath channel scenarios.Comment: Preprint, 13 page

    Detection and decoding algorithms of multi-antenna diversity techniques for terrestrial DVB systems

    Get PDF
    This PhD dissertation analyzes the behavior of multi-antenna diversity techniques in broadcasting scenarios of TDT (terrestrial digital television) systems and proposes a low-complexity detection and decoding design for their practical implementation. For that purpose, the transmission-reception chains of the European DVB-T (Digital Video Broadcasting - Terrestrial) and DVB-T2 standards have been implemented over which diversity and MIMO (multiple-input multiple-output) techniques have been assessed through Monte Carlo simulations. On one hand, the most important multi-antenna diversity techniques such as CDD (cyclic delay diversity), Alamouti code-based SFBC (space-frequency block coding) and MRC (maximum ratio combining), have been evaluated in a DVB-T system over both fixed and mobile Rayleigh and Ricean channels. With the DVB-T2 standard release, multi-antenna processing has actually been introduced in digital television systems. The distributed SFBC configuration proposed in DVB-T2 is analyzed from a performance point of view considering different propagation conditions in an SFN (single frequency network). On the other hand, error-performance and detection complexity analyses of 2x2 FRFD (full-rate full-diversity) SFBCs are carried out for last-generation DTV (digital television) systems. The use of channel coding based on LDPC (low-density parity check) codes in new standards such as DVB-T2, involves a soft-output MAP (maximum a posteriori ) detection which results in an increase of the detection complexity. In order to study the FRFD codes behavior in such a BICM (bit-interleaved coded modulation) scheme, the Golden code, which achieves the maximum coding gain, and the Sezginer-Sari code, which has a lower inherent detection complexity as an expense of sacrificing performance gain, have been chosen. Using LSD (list sphere decoder) detection, BER (bit error rate) performance and computational cost results are provided for TDT scenarios. In order to overcome the variable complexity of the LSD, LFSD (list fixed-complexity sphere decoder) detection is proposed for practical implementations. A redesign of the previously proposed LFSD algorithm for spatial multiplexing MIMO systems has been performed for FRFD SFBCs with close-to-LSD performance. Furthermore, an analysis of the number of candidates is carried out in order to maximize the eficiency of the algorithm. Due to its fixed complexity, the novel algorithm can be fully pipelined making feasible a realistic implementation in chip.Esta tesis analiza el comportamiento de las técnicas de diversidad multiantena en escenarios de radiodifusión TDT (televisión digital terrestre) y propone un diseño de baja complejidad para la detección de códigos SFBC (space-frequency block coding ) que facilita una posible implementación práctica. Para ello, se ha implementado la cadena de transmisión-recepción de los estándares europeos DVB-T (Digital Video Broadcasting - Terrestrial ) y DVB-T2 como entorno de trabajo donde se han incluido y simulado diferentes técnicas de diversidad MIMO (multiple-input multiple-output ). Por un lado, se evalúan las técnicas de diversidad multiantena CDD ( cyclic delay diversity), SFBC con codi cación Alamouti y MRC (maximum ratio combining ) en escenarios fijos y móviles de canales tanto Rayleigh como Ricean para el sistema DVB-T. En DVB-T2, se analiza la tecnología multiantena propuesta por el estándar para diferentes escenarios de propagación dentro de redes SFN (single frequency network ). Por otro lado, se realiza un estudio sobre códigos FRFD (full-rate full-diversity ) SFBC para su posible inclusión en futuros estándares de televisión digital. El uso de codificaciones de canal más potentes, como los códigos LDPC (low-density parity check ), implica la utilización de una detección MAP (maximum a posteriori ) con salida soft, incrementando considerablemente la complejidad de la detección. Para realizar el correspondiente análisis de complejidad y rendimiento, se han escogidos dos códigos FRFD. Por un lado, el código Golden, que ofrece la máxima ganancia de código y, por otro, el código propuesto por Sezginer y Sari, que consigue reducir la complejidad de detección a costa de perder cierta ganancia de código. Se presentan resultados basados en curvas de BER (bit error rate) y número de operaciones sobre un sistema BICM (bit-interleaved coded modulation ) equivalente a DVB-T2 en escenarios TDT utilizando una detección LSD (list sphere decoder ). Para resolver el problema de la complejidad variable del algoritmo LSD, se realiza un rediseño del ya propuesto LFSD (list fixed-complexity sphere decoder ) para técnicas de multiplexación espacial considerando la estructura de los códigos FRFD SFBC. Asimismo, se evalúa el número de candidatos que ofrece un funcionamiento más eficiente con menor coste computacional. Los resultados de simulación basados en curvas de BER muestran rendimientos cercanos al detector LSD manteniendo el número de operaciones constante. Por lo tanto, este nuevo diseño permite su eficiente y práctica implementación en dispositivos reales.Doktoretza-tesi honen gai nagusia Lurreko Telebista Digitalerako antena anitzeko dibertsitate tekniken portaera ikertzea da, hartzailerako konplexutasun baxuko algoritmoen diseinua oinarri hartuta. Horretarako, Europako DVB-T eta DVB-T2 telebista digitaleko estandarren igorle-hartzaile kateen simulagailua inplementatzeaz gain, dibertsitate eta MIMO ( multipleinput multiple-output ) algoritmoak garatu eta aztertu dira. Lehenengo helburu gisa, CDD (cyclic delay diversity ), Alamouti kodean oinarritutako SFBC (space-frequency block coding ) eta MRC (maximum ratio combining ) teknikak ebaluatu dira Rayleigh eta Ricean ingurunetan, bai komunikazio nko zein mugikorretarako. Argitaratu berri den DVB-T2 estandarrak antena anitzeko prozesaketa telebista sistema digitalean sartu duenez, teknologia honen analisia egin da maiztasun bakarreko telebista sareetarako SFN (single frequency network ). Tesiaren helburu nagusia FRFD (full-rate full-diversity ) SFBC kodigoen ikerketa eta hauek telebista digitalaren estandar berrietan sartzea ahalbidetuko dituzten detekzio sistemen diseinua izan da. Kanalen kodi kazio indartsuagoak erabiltzeak, LDPC ( low-density parity check ) kodeak esaterako, MAP (maximum a posteriori ) algoritmoan oinarritutako soft irteeradun detektoreen erabilera dakar berekin, detekzioaren konplexutasuna areagotuz. Bi FRFD kode aukeratu dira errendimendu eta konplexutasun analisiak DVB-T2 bezalako BICM (bit-interleaved coded modulation ) sistemetan egiteko. Alde batetik, irabazi maximoa lortzen duen Golden kodea eta, bestetik, konplexutasun txikiagoa duen Sezginer eta Sarik proposatutako kodea erabili dira. Bit errore edo BER (bit error rate) tasan eta konputazio kostuan oinarrituta, emaitzak aurkeztu dira zerrenda dekodeatzaile esferikoa ( list sphere decoder, LSD) erabiliz. LSD-aren konplexutasun aldakorraren arazoa konpontzeko, ezpazio-multiplexazioko teknikarako LFSD (list xed-complexity sphere decoder ) algoritmoaren berdiseinua garatu da, FRFD SFBC kodeen egitura berezia kontuan hartuta. Algoritmoaren eraginkortasuna maximizatzeko kandidatuen zenbakia ebaluatzen da baita ere. LSD-en antzeko errendimendua duten BER gra ketan oinarritutako simulazio emaitzak aurkezten dira, eragiketa kopurua konstante eta LSD-arenaren baino murritzagoa mantenduz. Beraz, proposatutako diseinu eraginkorrak, FRFD SFBC antena anitzeko dibertsitatean oinarritutako eskemen inplementazioa ahalbidetu dezakete telebista digitalaren estandar berrietarako
    corecore