100 research outputs found

    Low-complexity dominance-based Sphere Decoder for MIMO Systems

    Full text link
    The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cost function derived from conditions on worst case interference, that we call dominance conditions. The proposed detector, the king sphere decoder (KSD), has a computational complexity that results to be not larger than the complexity of the sphere decoder and numerical simulations show that the complexity reduction is usually quite significant

    Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems

    Full text link
    In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the HHH{\bf H}^H{\bf H} matrix become increasingly weaker compared to the diagonal terms as the size of the channel gain matrix H{\bf H} increases. Specifically, we propose a message passing detection (MPD) algorithm which works with the real-valued matched filtered received vector (whose signal term becomes HTHx{\bf H}^T{\bf H}{\bf x}, where x{\bf x} is the transmitted vector), and uses a Gaussian approximation on the off-diagonal terms of the HTH{\bf H}^T{\bf H} matrix. We also propose a simple estimation scheme which directly obtains an estimate of HTH{\bf H}^T{\bf H} (instead of an estimate of H{\bf H}), which is used as an effective channel estimate in the MPD algorithm. We refer to this receiver as the {\em channel hardening-exploiting message passing (CHEMP)} receiver. The proposed CHEMP receiver achieves very good performance in large-scale MIMO systems (e.g., in systems with 16 to 128 uplink users and 128 base station antennas). For the considered large MIMO settings, the complexity of the proposed MPD algorithm is almost the same as or less than that of the minimum mean square error (MMSE) detection. This is because the MPD algorithm does not need a matrix inversion. It also achieves a significantly better performance compared to MMSE and other message passing detection algorithms using MMSE estimate of H{\bf H}. We also present a convergence analysis of the proposed MPD algorithm. Further, we design optimized irregular low density parity check (LDPC) codes specific to the considered large MIMO channel and the CHEMP receiver through EXIT chart matching. The LDPC codes thus obtained achieve improved coded bit error rate performance compared to off-the-shelf irregular LDPC codes

    Low-Complexity Lattice Reduction Aided Schnorr Euchner Sphere Decoder Detection Schemes with MMSE and SIC Pre-processing for MIMO Wireless Communication Systems

    Get PDF
    © 2021, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This is the accepted manuscript version of a conference paper which has been published in final form at https://doi.org/10.1109/IUCC-CIT-DSCI-SmartCNS55181.2021.00045The LRAD-MMSE-SIC-SE-SD (Lattice Reduction Aided Detection - Minimum Mean Squared Error-Successive Interference Cancellation - Schnorr Euchner - Sphere Decoder) detection scheme that introduces a trade-off between performance and computational complexity is proposed for Multiple-Input Multiple-Output (MIMO) in this paper. The Lenstra-Lenstra-Lovász (LLL) algorithm is employed to orthogonalise the channel matrix by transforming the signal space of the received signal into an equivalent reduced signal space. A novel Lattice Reduction aided SE-SD probing for the Closest Lattice Point in the transformed reduced signal space is hereby proposed. Correspondingly, the computational complexity of the proposed LRAD-MMSE-SIC-SE-SD detection scheme is independent of the constellation size while it is polynomial with reference to the number of antennas, and signal-to-noise-ratio (SNR). Performance results of the detection scheme indicate that SD complexity is significantly reduced at only marginal performance penalty

    Adaptive Dijkstra’s Search Algorithm for MIMO detection

    Get PDF
    Employing Maximum Likelihood (ML) algorithm for signal detection in a large-scale Multiple-Input- Multiple-Output (MIMO) system with high modulation order is a computationally expensive approach. In this paper an adaptive best first search detection algorithm is proposed. The proposed Adaptive Dijkstra’s Search (ADS) algorithm exploits the resources available in the search procedure to reduce the required number of nodes to be visited in the tree. A tunable parameter is used to control the number of the best possible candidate nodes required. Unlike the conventional DS, the ADS algorithm results in signal detection with low computation complexity and quasi-optimal performance for systems under low and medium SNR regimes. Simulation results demonstrate a 25% computational complexity reduction, compared to the conventional DS

    Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding

    Get PDF
    The nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multiple-input multiple-output (MIMO) downlink channels. The performance benefit with respect to its linear counterparts stems from the incorporation of a perturbation signal that reduces the power of the precoded signal. The computation of this perturbation element, which is known to belong in the class of NP-hard problems, is the main aspect that hinders the hardware implementation of VP systems. To this respect, several tree-search algorithms have been proposed for the closest-point lattice search problem in VP systems hitherto. Nevertheless, the optimality of these algorithms has been assessed mainly in terms of error-rate performance and computational complexity, leaving the hardware cost of their implementation an open issue. The parallel data-processing capabilities of field-programmable gate arrays (FPGA) and the loopless nature of the proposed tree-search algorithms have enabled an efficient hardware implementation of a VP system that provides a very high data-processing throughput
    corecore