17 research outputs found

    Unified bit-based probabilistic data association aided MIMO detection for high-order QAM constellations

    No full text
    A unified Bit-based Probabilistic Data Association (B-PDA) detection approach is proposed for Multiple-Input Multiple-Output (MIMO) systems employing high-order rectangular Quadrature Amplitude Modulation (QAM). The new approach transforms the symbol detection process of QAM to a bit-based process by introducing a Unified Matrix Representation (UMR) of QAM. Both linear natural and nonlinear binary reflected Gray bit-to-symbol mappings are considered. With the aid of simulation results, we demonstrate that the linear natural mapping based B-PDA approach typically attained an improved detection performance (measured in terms of both Bit Error Ratio (BER) and Symbol Error Ratio (SER)) in comparison to the conventional symbol-based PDA aided MIMO detector, despite its dramatically reduced computational complexity. The only exception is that at low SNRs, the linear natural mapping based B-PDA is slightly inferior in terms of its BER to the conventional symbol-based PDA using binary reflected Gray mapping. Furthermore, the simulation results show that the linear natural mapping based B-PDA MIMO detector may approach the best-case performance provided by the nonlinear binary reflected Gray mapping based B-PDA MIMO detector under ideal conditions. Additionally, the implementation of the B-PDA MIMO detector is shown to be much simpler in the case of the linear natural mapping. Based on these two points, we conclude that in the context of the uncoded B-PDA MIMO detector it is preferable to use the linear natural bit-to-symbol mapping, rather than the nonlinear Gray mapping

    MIMOシステムにおける格子基底縮小を用いた信号検出法及びその応用に関する研究

    Get PDF
    Multiple-input multiple-output (MIMO) technology has attracted attention in wireless communications, since it provides signi cant increases in data throughput and the high spectral efficiency. MIMO systems employ multiple antennas at both ends of the wireless link, and hence can increase the data rate by transmitting multiple data streams. To exploit the potential gains o ered by MIMO, signal processing involved in a MIMO receiver requires a large computational complexity in order to achieve the optimal performance. In MIMO systems, it is usually required to detect signals jointly as multiple signals are transmitted through multiple signal paths between the transmitter and the receiver. This joint detection becomes the MIMO detection. The maximum likelihood (ML) detection (MLD) is known as the optimal detector in terms of minimizing bit error rate (BER). However, the complexity of MLD obstructs its practical implementation. The common linear detection such as zero-forcing (ZF) or minimum mean squared error (MMSE) o ers a remarkable complexity reduction with performance loss. The non-linear detection, e.g. the successive interference cancellation (SIC), detects each symbol sequentially withthe aid of cancellation operations which remove the interferences from the received signal. The BER performance is improved by using the SIC, but is still inferior to that of the ML detector with low complexity. Numerous suboptimal detection techniques have been proposed to approximately approach the ML performance with relatively lower complexity, such as sphere detection (SD) and QRM-MLD. To look for suboptimal detection algorithm with near optimal performance and a ordable complexity costs for MIMO gains faces a major challenge. Lattice-reduction (LR) is a promising technique to improve the performance of MIMO detection. The LR makes the column vectors of the channel state information (CSI) matrix close to mutually orthogonal. The following signal estimation of the transmitted signal applies the reduced lattice basis instead of the original lattice basis. The most popular LR algorithm is the well-known LLL algorithm, introduced by Lenstra, Lenstra, and Lov asz. Using this algorithm, the LR aided (LRA) detector achieves more reliable signal estimation and hence good BER performance. Combining the LLL algorithm with the conventional linear detection of ZF or MMSE can further improve the BER performance in MIMO systems, especially the LR-MMSE detection. The non-linear detection i.e. SIC based on LR (LR-SIC) is selected from many detection methods since it features the good BER performance. And ordering SIC based on LR (LR-OSIC) can further improve the BER performance with the costs of the implementation of the ordering but requires high computational complexity. In addition, list detection can also obtain much better performance but with a little high computational cost in terms of the list of candidates. However, the expected performance of the several detections isnot satis ed directly like the ML detector, in particular for the high modulation order or the large size MIMO system. This thesis presents our studies about lattice reduction aided detection and its application in MIMO system. Our studies focus on the evaluation of BER performance and the computational complexity. On the hand, we improve the detection algorithms to achieve the near-ML BER performance. On the other hand, we reduce the complexity of the useless computation, such as the exhaustive tree search. We mainly solve three problems existed in the conventional detection methods as - The MLD based on QR decomposition and M-algorithm (QRMMLD) is one solution to relatively reduce the complexity while retaining the ML performance. The number of M in the conventional QRM-MLD is de ned as the number of the survived branches in each detection layer of the tree search, which is a tradeo between complexity and performance. Furthermore, the value of M should be large enough to ensure that the correct symbols exist in the survived branches under the ill-conditioned channel, in particular for the large size MIMO system and the high modulation order. Hence the conventional QRM-MLD still has the problem of high complexity in the better-conditioned channel. - For the LRA MIMO detection, the detection errors are mainly generated from the channel noise and the quantization errors in the signal estimation stage. The quantization step applies the simple rounding operation, which often leads to the quantization error. If this error occurs in a row of the transmit signal, it has to propagate to many symbols in the subsequent signal estimation and result in degrading the BER performance. The conventional LRA MIMO detection has the quantization problem, which obtains less reliable signal estimation and leads to the BER performance loss. - Ordering the column vectors of the LR-reduced channel matrix brings large improvement on the BER performance of the LRSIC due to decreasing the error propagation. However, the improvement of the LR-OSIC is not su cient to approach the ML performance in the large size MIMO system, such as 8 8 MIMO system. Hence, the LR-OSIC detection cannot achieve the near-ML BER performance in the large size of MIMO system. The aim of our researches focuses on the detection algorithm, which provides near-ML BER performance with very low additional complexity. Therefore, we have produced various new results on low complexity MIMO detection with the ideas of lattice reduction aided detection and its application even for large size MIMO system and high modulation order. Our works are to solve the problems in the conventional MIMO detections and to improve the detection algorithms in the signal estimation. As for the future research, these detection schemes combined with the encoding technique lead to interesting and useful applications in the practical MIMO system or massive MIMO.電気通信大学201

    Application of integer quadratic programming in detection of high-dimensional wireless systems

    Get PDF
    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

    A Primer on MIMO Detection Algorithms for 5G Communication Network

    Get PDF
    In the recent past, demand for large use of mobile data has increased tremendously due to the proliferation of hand held devices which allows millions of people access to video streaming, VOIP and other internet related usage including machine to machine (M2M) communication. One of the anticipated attribute of the fifth generation (5G) network is its ability to meet this humongous data rate requirement in the order of 10s Gbps. A particular promising technology that can provide this desired performance if used in the 5G network is the massive multiple-input, multiple-output otherwise called the Massive MIMO. The use of massive MIMO in 5G cellular network where data rate of the order of 100x that of the current state of the art LTE-A is expected and high spectral efficiency with very low latency and low energy consumption, present a challenge in symbol/signal detection and parameter estimation as a result of the high dimension of the antenna elements required. One of the major bottlenecks in achieving the benefits of such massive MIMO systems is the problem of achieving detectors with realistic low complexity for such huge systems. We therefore review various MIMO detection algorithms aiming for low computational complexity with high performance and that scales well with increase in transmit antennas suitable for massive MIMO systems. We evaluate detection algorithms for small and medium dimension MIMO as well as a combination of some of them in order to achieve our above objectives. The review shows no single one detector can be said to be ideal for massive MIMO and that the low complexity with optimal performance detector suitable for 5G massive MIMO system is still an open research issue. A comprehensive review of such detection algorithms for massive MIMO was not presented in the literature which was achieved in this work

    Design and Implementation of Efficient Algorithms for Wireless MIMO Communication Systems

    Full text link
    En la última década, uno de los avances tecnológicos más importantes que han hecho culminar la nueva generación de banda ancha inalámbrica es la comunicación mediante sistemas de múltiples entradas y múltiples salidas (MIMO). Las tecnologías MIMO han sido adoptadas por muchos estándares inalámbricos tales como LTE, WiMAS y WLAN. Esto se debe principalmente a su capacidad de aumentar la máxima velocidad de transmisión , junto con la fiabilidad alcanzada y la cobertura de las comunicaciones inalámbricas actuales sin la necesidad de ancho de banda extra ni de potencia de transmisión adicional. Sin embargo, las ventajas proporcionadas por los sistemas MIMO se producen a expensas de un aumento sustancial del coste de implementación de múltiples antenas y de la complejidad del receptor, la cual tiene un gran impacto sobre el consumo de energía. Por esta razón, el diseño de receptores de baja complejidad es un tema importante que se abordará a lo largo de esta tesis. En primer lugar, se investiga el uso de técnicas de preprocesado de la matriz de canal MIMO bien para disminuir el coste computacional de decodificadores óptimos o bien para mejorar las prestaciones de detectores subóptimos lineales, SIC o de búsqueda en árbol. Se presenta una descripción detallada de dos técnicas de preprocesado ampliamente utilizadas: el método de Lenstra, Lenstra, Lovasz (LLL) para lattice reduction (LR) y el algorimo VBLAST ZF-DFE. Tanto la complejidad como las prestaciones de ambos métodos se han evaluado y comparado entre sí. Además, se propone una implementación de bajo coste del algoritmo VBLAST ZF-DFE, la cual se incluye en la evaluación. En segundo lugar, se ha desarrollado un detector MIMO basado en búsqueda en árbol de baja complejidad, denominado detector K-Best de amplitud variable (VB K-Best). La idea principal de este método es aprovechar el impacto del número de condición de la matriz de canal sobre la detección de datos con el fin de disminuir la complejidad de los sistemasRoger Varea, S. (2012). Design and Implementation of Efficient Algorithms for Wireless MIMO Communication Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/16562Palanci

    Récepteur itératif pour les systèmes MIMO-OFDM basé sur le décodage sphérique : convergence, performance et complexité

    Get PDF
    Recently, iterative processing has been widely considered to achieve near-capacity performance and reliable high data rate transmission, for future wireless communication systems. However, such an iterative processing poses significant challenges for efficient receiver design. In this thesis, iterative receiver combining multiple-input multiple-output (MIMO) detection with channel decoding is investigated for high data rate transmission. The convergence, the performance and the computational complexity of the iterative receiver for MIMO-OFDM system are considered. First, we review the most relevant hard-output and soft-output MIMO detection algorithms based on sphere decoding, K-Best decoding, and interference cancellation. Consequently, a low-complexity K-best (LCK- Best) based decoder is proposed in order to substantially reduce the computational complexity without significant performance degradation. We then analyze the convergence behaviors of combining these detection algorithms with various forward error correction codes, namely LTE turbo decoder and LDPC decoder with the help of Extrinsic Information Transfer (EXIT) charts. Based on this analysis, a new scheduling order of the required inner and outer iterations is suggested. The performance of the proposed receiver is evaluated in various LTE channel environments, and compared with other MIMO detection schemes. Secondly, the computational complexity of the iterative receiver with different channel coding techniques is evaluated and compared for different modulation orders and coding rates. Simulation results show that our proposed approaches achieve near optimal performance but more importantly it can substantially reduce the computational complexity of the system. From a practical point of view, fixed-point representation is usually used in order to reduce the hardware costs in terms of area, power consumption and execution time. Therefore, we present efficient fixed point arithmetic of the proposed iterative receiver based on LC-KBest decoder. Additionally, the impact of the channel estimation on the system performance is studied. The proposed iterative receiver is tested in a real-time environment using the MIMO WARP platform.Pour permettre l’accroissement de débit et de robustesse dans les futurs systèmes de communication sans fil, les processus itératifs sont de plus considérés dans les récepteurs. Cependant, l’adoption d’un traitement itératif pose des défis importants dans la conception du récepteur. Dans cette thèse, un récepteur itératif combinant les techniques de détection multi-antennes avec le décodage de canal est étudié. Trois aspects sont considérés dans un contexte MIMOOFDM: la convergence, la performance et la complexité du récepteur. Dans un premier temps, nous étudions les différents algorithmes de détection MIMO à décision dure et souple basés sur l’égalisation, le décodage sphérique, le décodage K-Best et l’annulation d’interférence. Un décodeur K-best de faible complexité (LC-K-Best) est proposé pour réduire la complexité sans dégradation significative des performances. Nous analysons ensuite la convergence de la combinaison de ces algorithmes de détection avec différentes techniques de codage de canal, notamment le décodeur turbo et le décodeur LDPC en utilisant le diagramme EXIT. En se basant sur cette analyse, un nouvel ordonnancement des itérations internes et externes nécessaires est proposé. Les performances du récepteur ainsi proposé sont évaluées dans différents modèles de canal LTE, et comparées avec différentes techniques de détection MIMO. Ensuite, la complexité des récepteurs itératifs avec différentes techniques de codage de canal est étudiée et comparée pour différents modulations et rendement de code. Les résultats de simulation montrent que les approches proposées offrent un bon compromis entre performance et complexité. D’un point de vue implémentation, la représentation en virgule fixe est généralement utilisée afin de réduire les coûts en termes de surface, de consommation d’énergie et de temps d’exécution. Nous présentons ainsi une représentation en virgule fixe du récepteur itératif proposé basé sur le décodeur LC K-Best. En outre, nous étudions l’impact de l’estimation de canal sur la performance du système. Finalement, le récepteur MIMOOFDM itératif est testé sur la plateforme matérielle WARP, validant le schéma proposé

    Performance evaluation of detection algorithms for MOMI OFDM systems

    Get PDF
    Includes abstract.Includes bibliographical references (leaves 79-86).Introduction of Multi Input Multi Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) as the base air interface method for Next Generation Network (NGN) will face a number of challenges from hostile channel conditions to interference from other users. This would result in an increase of detection complexity required for mobile systems. Complex detection will reduce the battery life of mobile devices because of the many calculations that have to be done to decode the signal. Very powerful detection algorithms exist but they introduce high detection complexity. NGN will employ different MIMO systems, but this research will consider spatially multiplexed MIMO which is used to improve the data rate and network capacity. In NGN different multi access modulation schemes will be used for uplink and downlink but they both have OFDM as the basic building block. In this work performance of MIMO OFDM is investigated in different channels models and detection algorithms. A low complexity detection scheme is proposed in this research to improve performance of MIMO OFDM. The proposed detection scheme is investigated for different channel characteristics. Realistic channels conditions are introduced to evaluate the performance of the proposed detection scheme. We analyze weaknesses of existing linear detectors and the enhancements that can be done to improve their performance in different channel conditions. Performance of the detectors is evaluated by comparison of Bit Error Rate (BER) and Symbol Error Rate (SER) against signal to noise ratio (SNR). This thesis proposes a detector which shows a higher complexity than linear detectors but less than Maximum Likelihood Detector (MLD). The proposed detector shows significant BER improvement in all channel conditions. For better performance evaluation this work also investigates performance of MIMO OFDM detectors in realistic channels like Kronecker and Weichselberger channel models

    Novel Efficient Precoding Techniques for Multiuser MIMO Systems

    Get PDF
    In Multiuser MIMO (MU-MIMO) systems, precoding is essential to eliminate or minimize the multiuser interference (MUI). However, the design of a suitable precoding algorithm with good overall performance and low computational complexity at the same time is quite challenging, especially with the increase of system dimensions. In this thesis, we explore the art of novel low-complexity high-performance precoding algorithms with both linear and non-linear processing strategies. Block diagonalization (BD)-type based precoding techniques are well-known linear precoding strategies for MU-MIMO systems. By employing BD-type precoding algorithms at the transmit side, the MU-MIMO broadcast channel is decomposed into multiple independent parallel SU-MIMO channels and achieves the maximum diversity order at high data rates. The main computational complexity of BD-type precoding algorithms comes from two singular value decomposition (SVD) operations, which depend on the number of users and the dimensions of each user's channel matrix. In this thesis, two categories of low-complexity precoding algorithms are proposed to reduce the computational complexity and improve the performance of BD-type precoding algorithms. One is based on multiple LQ decompositions and lattice reductions. The other one is based on a channel inversion technique, QR decompositions, and lattice reductions to decouple the MU-MIMO channel into equivalent SU-MIMO channels. Both of the two proposed precoding algorithms can achieve a comparable sum-rate performance as BD-type precoding algorithms, substantial bit error rate (BER) performance gains, and a simplified receiver structure, while requiring a much lower complexity. Tomlinson-Harashima precoding (THP) is a prominent nonlinear processing technique employed at the transmit side and is a dual to the successive interference cancelation (SIC) detection at the receive side. Like SIC detection, the performance of THP strongly depends on the ordering of the precoded symbols. The optimal ordering algorithm, however, is impractical for MU-MIMO systems with multiple receive antennas. We propose a multi-branch THP (MB-THP) scheme and algorithms that employ multiple transmit processing and ordering strategies along with a selection scheme to mitigate interference in MU-MIMO systems. Two types of multi-branch THP (MB-THP) structures are proposed. The first one employs a decentralized strategy with diagonal weighted filters at the receivers of the users and the second uses a diagonal weighted filter at the transmitter. The MB-MMSE-THP algorithms are also derived based on an extended system model with the aid of an LQ decomposition, which is much simpler compared to the conventional MMSE-THP algorithms. Simulation results show that a better BER performance can be achieved by the proposed MB-MMSE-THP precoder with a small computational complexity increase

    Detection and Resource Allocation Algorithms for Cooperative MIMO Relay Systems

    Get PDF
    Cooperative communications and multiple-input multiple-output (MIMO) communication systems are important topics in current research that will play key roles in the future of wireless networks and standards. In this thesis, the various challenges in accurately detecting and estimating data signals and allocating resources in the cooperative systems are investigated. Firstly, we propose a cross-layer design strategy that consists of a cooperative maximum likelihood (ML) detector operating in conjunction with link selection for a cooperative MIMO network. Two new link selection schemes are proposed, along with an iterative detection and decoding (IDD) scheme that utilises channel coding techniques. Simulation results show the performance and potential gains of the proposed schemes. Secondly, a successive interference cancellation (SIC) detector is proposed for a MIMO system that has dynamic ordering based on a reliability ordering (RO), and an alternative multiple feedback (MF) candidate cancellation method. The complexity of these schemes is analysed and a hard decision feedback IDD system is also proposed. Results show that the proposed detector can give gains over existing schemes for a minimal amount of extra complexity. Lastly, a detector is proposed that is based upon the method of widely linear (WL) filtering and a multiple branch (MB) SIC, for an overloaded, multi-user cooperative MIMO system. The use of WL methods is explained, and a new method of choosing cancellation branches for an MB detector is proposed with an analysis of the complexity required. A list-based IDD system is developed, and simulation results show that the proposed detector can operate in an overloaded system and provide improved performance gains
    corecore