English
Related papers

Related papers: Low-complexity dominance-based Sphere Decoder for …

200 papers

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the…

Information Theory · Computer Science 2015-03-13 Boyu Li , Ender Ayanoglu

Although the sphere decoder (SD) is a powerful detector for multiple-input multiple-output (MIMO) systems, it has become computationally prohibitive in massive MIMO systems, where a large number of antennas are employed. To overcome this…

Information Theory · Computer Science 2021-07-22 Nhan Thanh Nguyen , Kyungchun Lee , Huaiyu Dai

Spatial Modulation (SM) is a recently developed low-complexity Multiple-Input Multiple-Output scheme that uses antenna indices and a conventional signal set to convey information. It has been shown that the Maximum-Likelihood (ML) detection…

Information Theory · Computer Science 2013-01-17 Rakshith Rajashekar , K. V. S. Hari

Massive MIMO systems are seen by many researchers as a paramount technology toward next generation networks. This technology consists of hundreds of antennas that are capable of sending and receiving simultaneously a huge amount of data.…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-25 A. Dabah , H. Ltaief , Z. Rezki , M. -A. Arfaoui , M. -S. Alouini , D. Keyes

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim

In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of…

Information Theory · Computer Science 2013-05-31 Abdelhamid Younis , Sinan Sinanović , Marco Di Renzo , Raed Mesleh , Harald Haas

Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere…

Information Theory · Computer Science 2013-08-14 Kai Niu , Kai Chen , Jiaru Lin

We propose a low complexity complex valued Sphere Decoding (CV-SD) algorithm, referred to as Circular Sphere Decoding (CSD) which is applicable to multiple-input multiple-output (MIMO) systems with arbitrary two dimensional (2D)…

Information Theory · Computer Science 2016-11-17 Hwanchol Jang , Saeid Nooshabadi , Kiseon Kim , Heung-No Lee

In this paper, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for SCMA. As SCMA systems are characterized by a number of resource elements (REs) that are less than the number of the supported users,…

Information Theory · Computer Science 2017-08-30 Monirosharieh Vameghestahbanati , Ebrahim Bedeer , Ian Marsland , Ramy H. Gohary , Halim Yanikomeroglu

Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The complexity of the SD has been shown to be exponential in some cases,…

Information Theory · Computer Science 2007-07-13 Luay Azzam , Ender Ayanoglu

In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full rate…

Information Theory · Computer Science 2011-02-08 Joakim Jalden , Petros Elia

Spatial modulation (SM) is a promising multiple-input multiple-output system used to increase spectral efficiency. The maximum likelihood (ML) decoder jointly detects the transmitted SM symbol, which is of high complexity. In this paper, a…

Information Theory · Computer Science 2020-06-11 Ibrahim Al-Nahhal , Octavia A. Dobre , Salama Ikki

In this paper, the paradigm of sphere decoding (SD) for solving the integer least square problem (ILS) is revisited, where extra degrees of freedom are introduced to exploit the decoding potential. Firstly, the equivalent sphere decoding…

Information Theory · Computer Science 2025-12-23 Zheng Wang , Cong Ling , Shi Jin , Yongming Huang , Feifei Gao

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we…

Information Theory · Computer Science 2014-01-08 Ming Liu , Jean-François Hélard , Matthieu Crussière , Maryline Hélard

This work considers multiple-input multiple-output (MIMO) communication systems using hierarchical modulation. A disadvantage of the maximum-likelihood (ML) MIMO detector is that computational complexity increases exponentially with the…

Information Theory · Computer Science 2016-02-24 Yigit Ugur , Ali Ozgur Yilmaz

In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method…

Information Theory · Computer Science 2019-07-22 Ibrahim Al-Nahhal , Ertugrul Basar , Octavia A. Dobre , Salama Ikki

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO…

Information Theory · Computer Science 2014-01-16 Ming Liu , Matthieu Crussière , Maryline Hélard , Jean-François Hélard

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a…

Information Theory · Computer Science 2008-11-07 Rym Ouertani , Ghaya Rekaya Ben-Othman , Abdellatif Salah

The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multiple-input multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational…

Information Theory · Computer Science 2012-06-07 Walid Abediseid

A single input multiple output (SIMO) multiple access channel, with a large number of transmitters sending symbols from a constellation to the receiver of a multi-antenna base station, is considered. The fundamental limits of joint decoding…

Information Theory · Computer Science 2014-04-10 Mainak Chowdhury , Andrea Goldsmith
‹ Prev 1 2 3 10 Next ›