English
Related papers

Related papers: Circular Sphere Decoding: A Low Complexity Detecti…

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

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…

Information Theory · Computer Science 2013-03-05 Gianmarco Romano , Domenico Ciuonzo , Pierluigi Salvo Rossi , Francesco Palmieri

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

In this paper, we propose a novel learning-aided sphere decoding (SD) scheme for large multiple-input--multiple-output systems, namely, deep path prediction-based sphere decoding (DPP-SD). In this scheme, we employ a neural network (NN) to…

Information Theory · Computer Science 2020-01-03 Doyeon Weon , Kyungchun Lee

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, 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

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, 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

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

To realize mmWave massive MIMO systems in practice, Beamspace MIMO with beam selection provides an attractive solution at a considerably reduced number of radio frequency (RF) chains. We propose low-complexity beam selection algorithms…

Information Theory · Computer Science 2022-07-12 Jinxing Yang , Jihong Yu , Shuai Wang , Hao Liu

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

Beamforming techniques that employ Singular Value Decomposition (SVD) are commonly used in Multi-Input Multi-Output (MIMO) wireless communication systems. In the absence of channel coding, when a single symbol is transmitted, these systems…

Information Theory · Computer Science 2009-11-05 Hong Ju Park , Boyu Li , Ender Ayanoglu

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

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

Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for practical receiver implementations, in particular in the context…

Information Theory · Computer Science 2009-06-05 Christoph Studer , Helmut Bölcskei

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

This paper presents a low-complexity near-maximum-likelihood-detection (near-MLD) algorithm called one-bit-sphere-decoding for an uplink massive multiple-input multiple-output (MIMO) system with one-bit analog-to-digital converters (ADCs).…

Information Theory · Computer Science 2017-12-20 Yo-Seb Jeon , Namyoon Lee , Song-Nam Hong , Robert W. Heath

We present novel soft-input soft-output (SISO) multiple-input multiple-output (MIMO) detectors based on the Chase detection principle [1] in the context of iterative and decoding (IDD). The proposed detector complexity is linear in the…

Information Theory · Computer Science 2015-06-22 Ahmad Gomaa , Louay Jalloul
‹ Prev 1 2 3 10 Next ›