English
Related papers

Related papers: On the Sphere Decoding Complexity of STBCs for Asy…

200 papers

In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between multi-antenna source and destination nodes. The principal difficulty in implementing such a system is that, due to the limited…

Information Theory · Computer Science 2015-06-03 Brian P. Day , Adam R. Margetts , Daniel W. Bliss , Philip Schniter

Millimeter-wave links are of a line-of-sight nature. Hence, multiple-input multiple-output (MIMO) systems operating in the millimeter-wave band may not achieve full spatial diversity or multiplexing. In this paper, we utilize reconfigurable…

Information Theory · Computer Science 2015-05-26 Vida Vakilian , Hani Mehrpouyan , Yingbo Hua , Hamid Jafarkhani

We characterise the optimal broadcast rate for a few classes of pliable-index-coding problems. This is achieved by devising new lower bounds that utilise the set of absent receivers to construct decoding chains with skipped messages. This…

Information Theory · Computer Science 2019-10-02 Lawrence Ong , Badri N. Vellambi , Jörg Kliewer

Interference widely exists in communication systems and is often not optimally treated at the receivers due to limited knowledge and/or computational burden. Evolutions of receivers have been proposed to balance complexity and spectral…

Information Theory · Computer Science 2025-11-14 Sibo Zhang , Bruno Clerckx

This paper focuses on controlling the absorbing set spectrum for a class of regular LDPC codes known as separable, circulant-based (SCB) codes. For a specified circulant matrix, SCB codes all share a common mother matrix, examples of which…

Information Theory · Computer Science 2011-06-02 Jiadong Wang , Lara Dolecek , Zhengya Zhang , Richard Wesel

In this letter the performance of multiple relay channels is analyzed for the situation in which multiple antennas are deployed only at the relays. The simple repetition-coded decodeand- forward protocol with two different antenna…

Information Theory · Computer Science 2008-02-20 Yijia Fan , Abdulkareem Adinoyi , John S Thompson , Halim Yanikomeroglu , H. Vincent Poor

In this letter, we develop a low-complexity transceiver design, referred to as semi-random beam pairing (SRBP), for sparse multipath massive MIMO channels. By exploring a sparse representation of the MIMO channel in the virtual angular…

Information Theory · Computer Science 2016-08-24 Yuehua Yu , Peng Wang , He Chen , Yonghui Li , Branka Vucetic

Random Linear Network Coding (RLNC) has been proved to offer an efficient communication scheme, leveraging an interesting robustness against packet losses. However, it suffers from a high computational complexity and some novel approaches,…

Networking and Internet Architecture · Computer Science 2016-07-25 Garrido Pablo , Lucani E. Daniel , Aguero Ramon

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

We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results. First, for rates $<1/2$ there exists a broad family of rank metric codes for which any symmetric error pattern, even of maximal rank…

Information Theory · Computer Science 2023-03-23 Alain Couvreur

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

High data rates are one of the most prevalent requirements in current mobile communications. To cover this and other high standards regarding performance, increasing coverage, capacity, and reliability, numerous works have proposed the…

Information Theory · Computer Science 2023-07-26 Gabriela Morillo , John Cosmas

A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

This paper introduces a new and unified bit error rates performance analysis of space-time block codes (STBC) deployed in wireless systems with spatial diversity in generalized shadowed fading and noise scenarios. Specifically, we derive a…

Information Theory · Computer Science 2017-10-12 Ehab Salahat , Ali Hakam , Nazar Ali

An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…

Information Theory · Computer Science 2009-01-23 In Sook Park

We consider a multi-cell massive MIMO system where a time-division duplex protocol is used to estimate the channel state information via uplink pilots. When maximum ratio combining (MRC) is used at the BSs, the re-use of pilots across cells…

Information Theory · Computer Science 2019-11-26 Meysam Shahrbaf Motlagh , Subhajit Majhi , Patrick Mitran

This paper discusses the problem of extracting spread spectrum hidden data from the perspective of lattice decoding. Since the conventional blind extraction scheme multi-carrier iterative generalize least-squares (M-IGLS) and non-blind…

Cryptography and Security · Computer Science 2023-06-01 Fan Yang , Shanxiang Lyu , Hao Cheng , Jinming Wen , Hao Chen

In this paper, we design space-time block codes (STBCs) to broadcast the common information omnidirectionally in a massive MIMO downlink. To reduce the burden of the downlink channel estimation and achieve partial spatial diversity from…

Information Theory · Computer Science 2016-10-26 Xin Meng , Xiang-Gen Xia , Xiqi Gao

We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In particular, here we consider a generalized setting where…

Information Theory · Computer Science 2014-03-13 Lawrence Ong , Fabian Lim , Chin Keong Ho

The performance of a multiuser communication system with single-antenna transmitting terminals and a multi-antenna base-station receiver is analytically investigated. The system operates under independent and non-identically distributed…

Information Theory · Computer Science 2016-10-27 Nikolaos I. Miridakis , Theodoros A. Tsiftsis , Corbett Rowell