English
Related papers

Related papers: Reduced-complexity maximum-likelihood decoding for…

200 papers

We consider code optimization and angle-Doppler imaging for slow-time code division multiplexing (ST-CDM) linear frequency-modulated continuous-wave (LFMCW) multiple-input multiple-output (MIMO) radar systems. We optimize the slow-time code…

Signal Processing · Electrical Eng. & Systems 2023-06-16 Xiaolei Shang , Yuanbo Cheng

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

In this paper we consider maximum-likelihood (ML) MIMO detection under one-bit quantized observations and binary symbol constellations. This problem is motivated by the recent interest in adopting coarse quantization in massive MIMO…

Information Theory · Computer Science 2021-02-24 Mingjie Shao , Wing-Kin Ma

Massive multiple-input multiple-output (MIMO) is a key technology for fifth generation (5G) communication system. MIMO symbol detection is one of the most computationally intensive tasks for a massive MIMO baseband receiver. In this paper,…

In multi-user millimeter wave (mmWave) multiple-input-multiple-output (MIMO) systems, hybrid precoding is a crucial task to lower the complexity and cost while achieving a sufficient sum-rate. Previous works on hybrid precoding were usually…

Signal Processing · Electrical Eng. & Systems 2020-04-28 Ahmet M. Elbir , Anastasios Papazafeiropoulos

Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed…

Information Theory · Computer Science 2017-03-17 Ilya Dumer , Kirill Shabunov

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

In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user MIMO (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search…

Information Theory · Computer Science 2015-03-17 Manar Mohaisen , KyungHi Chang

The minimum weight matching (MWM) and maximum likelihood decoding (MLD) are two widely used and distinct decoding strategies for quantum error correction. For a given syndrome, the MWM decoder finds the most probable physical error…

Quantum Physics · Physics 2025-10-29 Mao Lin

In wireless communication systems, the use of multiple antennas at both the transmitter and receiver is a widely known method for improving both reliability and data rates, as it increases the former through transmit or receive diversity…

Information Theory · Computer Science 2014-12-31 Fathurrahman Hilman , Jong-Hyen Baek , Eun-Kyung Chae , KyungchunLee

This paper proposes a new large-scale mask-compliant spectral precoder (LS-MSP) for orthogonal frequency division multiplexing systems. In this paper, we first consider a previously proposed mask-compliant spectral precoding scheme that…

Signal Processing · Electrical Eng. & Systems 2019-05-17 Shashi Kant , Gabor Fodor , Mats Bengtsson , Bo Göransson , Carlo Fischione

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and in particular for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels…

Information Theory · Computer Science 2017-04-18 Yongpeng Wu , Chao-Kai Wen , Derrick Wing Kwan Ng , Robert Schober , Angel Lozano

This letter presents a low-complexity hybrid precoding framework for multiuser multiple-input multiple-output (MIMO) systems by leveraging a low-dimensional subspace property. Under the low-dimensional subspace perspective, we first…

Signal Processing · Electrical Eng. & Systems 2025-12-09 Mintaek Oh , Jinseok Choi

Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Camilla Hollanti , Frédérique Oggier

This paper studies the problem of linear precoding for multiple-input multiple-output (MIMO) communication channels employing finite-alphabet signaling. Existing solutions typically suffer from high computational complexity due to costly…

Information Theory · Computer Science 2021-11-08 Maksym A. Girnyk

Link adaptation is a crucial part of many modern communications systems, allowing the system to adapt the transmission and reception strategies to changes in channel conditions. One of the fundamental components of the link adaptation…

Information Theory · Computer Science 2009-09-08 Oded Redlich , Doron Ezri , Dov Wulich

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

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

Information Theory · Computer Science 2007-07-13 M. Twitto , I. Sason , S. Shamai

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
‹ Prev 1 3 4 5 6 7 10 Next ›