English
Related papers

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

200 papers

The upcoming 5G networks demand high-speed and high spectral-efficiency communications to keep up with the proliferating traffic demands. To this end, Massive multiple-input multiple-output (MIMO) techniques have gained significant traction…

Information Theory · Computer Science 2019-08-06 Anu Jagannath , Jithin Jagannath , Andrew Drozd

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used)…

Information Theory · Computer Science 2008-06-24 Chau Yuen , Yan Wu , Sumei Sun

In this paper, we consider an intensity modulated direct detection MIMO optical wireless communication (OWC) system. For such a system, a novel super-rectangular cover theory is developed to characterize both the unique identifiability and…

Information Theory · Computer Science 2016-07-15 Yan-Yu Zhang , Hong-Yi Yu , Jian-Kang Zhang , Jin-Long Wang

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum…

Information Theory · Computer Science 2015-03-19 Laura Luzzi , Frédérique Oggier

For any $n_t$ transmit, $n_r$ receive antenna ($n_t\times n_r$) MIMO system in a quasi-static Rayleigh fading environment, it was shown by Elia et al. that linear space-time block code-schemes (LSTBC-schemes) which have the non-vanishing…

Information Theory · Computer Science 2013-04-30 K. Pavan Srinath , B. Sundar Rajan

Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure…

Information Theory · Computer Science 2016-11-17 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Yue Zhou , Er Yang Zhang

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

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

Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme. However, the SCL decoding scheme suffers…

Information Theory · Computer Science 2016-09-29 Mao-Ching Chiu , Wei-De Wu

A Space-Time Block Code (STBC) in $K$ symbols (variables) is called $g$-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of $g$ terms such that each term is a function of a subset of the $K$ variables…

Information Theory · Computer Science 2007-07-16 Sanjay Karmakar , B. Sundar Rajan

Centralized baseband processing (CBP) is required to achieve the full potential of massive multiple-input multiple-output (MIMO) systems. However, due to the large number of antennas, CBP suffers from two major issues: 1) Tremendous data…

Information Theory · Computer Science 2025-01-31 Zeyan Zhuang , Xin Zhang , Dongfang Xu , Shenghui Song , Yonina C. Eldar

The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on…

Information Theory · Computer Science 2016-07-12 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Rüdiger Urbanke

To combine the power efficiency of Continuous Phase Modulation (CPM) with enhanced performance in fading environments, some authors have suggested to use CPM in combination with Space-Time Codes (STC). Recently, we have proposed a CPM…

Information Theory · Computer Science 2009-02-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…

Information Theory · Computer Science 2007-07-13 Gil Wiechman , Igal Sason

Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

The cost of radio frequency (RF) chains is the biggest drawback of massive MIMO millimeter wave networks. By employing spatial modulation (SM), it is possible to implement lower number of RF chains than transmit antennas but still achieve…

Information Theory · Computer Science 2017-09-15 Merve Yüzgeçcioglu , Eduard Jorswieck

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

For a low-mobile Poisson bipolar network and under line-of-sight/non-line-of-sight (LOS/NLOS) path-loss model, we study repetitive retransmissions (RR) and blocked incremental redundancy (B-IR). We consider spatially-coded multiple-input…

Information Theory · Computer Science 2019-02-01 Mohammad G. Khoshkholgh , Victor C. M. Leung

Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even {\em perfect}…

Information Theory · Computer Science 2019-04-24 Steffen Bondorf , Binbin Chen , Jonathan Scarlett , Haifeng Yu , Yuda Zhao