English
Related papers

Related papers: Generalized Silver Codes

200 papers

A wireless communication system using multiple antennas promises reliable transmission under Rayleigh flat fading assumptions. Design criteria and practical schemes have been presented for both coherent and non-coherent communication…

Combinatorics · Mathematics 2016-11-15 Guangyue Han

Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense…

Information Theory · Computer Science 2020-06-05 Erdem Biyik , Jean Barbier , Mohamad Dia

Motivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation (SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) filters to achieve transmit diversity gains, we propose TOPS for Space-Time Block…

Information Theory · Computer Science 2012-04-26 Rakshith Rajashekar , K. V. S. Hari

In this paper, we introduce the novel use of linear spatial precoding based on fixed and known parameters of multiple-input multiple-output (MIMO) channels to improve the performance of space-time coded MIMO systems. We derive linear…

Information Theory · Computer Science 2007-07-13 Tharaka A. Lamahewa , Rodney A. Kennedy , Thushara D. Abhayapala , Van K. Nguyen

Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such…

Information Theory · Computer Science 2007-09-04 Harshan J. , B. Sundar Rajan

The new generation of telecommunication systems must provide acceptable data rates and spectral efficiency for new applications. Recently massive MIMO has been introduced as a key technique for the new generation of telecommunication…

Systems and Control · Electrical Eng. & Systems 2021-04-07 A. Mazhari Saray , J. Pourrostam , S. H. Mousavi , M. Mohassel Feghhi

Generalized spatial modulation (GSM) uses $n_t$ transmit antenna elements but fewer transmit radio frequency (RF) chains, $n_{rf}$. Spatial modulation (SM) and spatial multiplexing are special cases of GSM with $n_{rf}=1$ and $n_{rf}=n_t$,…

Information Theory · Computer Science 2016-11-15 T. Lakshmi Narasimhan , P. Raviteja , A. Chockalingam

We consider the problem of joint source-channel coding for transmitting K samples of a complex Gaussian source over T = bK uses of a block-fading multiple input multiple output (MIMO) channel with M transmit and N receive antennas. We…

Information Theory · Computer Science 2016-11-17 Kapil Bhattad , Krishna R. Narayanan , Giuseppe Caire

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes…

Information Theory · Computer Science 2007-12-17 Sanjay Karmakar , B. Sundar Rajan

We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…

Information Theory · Computer Science 2022-12-12 Bruno Bauwens , Marius Zimand

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

We present constructions of Space-Time (ST) codes based on lattice coset coding. First, we focus on ST code constructions for the short block-length case, i.e., when the block-length is equal to or slightly larger than the number of…

Information Theory · Computer Science 2008-04-14 K. Raj Kumar , Giuseppe Caire

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2019-10-21 Fabian Steiner , Emna Ben Yacoub , Balazs Matuz , Gianluigi Liva , Alexandre Graell i Amat

Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…

Information Theory · Computer Science 2022-04-05 Aimin Li , Shaohua Wu , Jian Jiao , Ning Zhang , Qinyu Zhang

This paper presents a novel semantic-enhanced decoding scheme for transmitting natural language sentences with multiple short block codes over noisy wireless channels. After ASCII source coding, the natural language sentence message is…

Signal Processing · Electrical Eng. & Systems 2025-05-15 Jiafu Hao , Chentao Yue , Hao Chang , Branka Vucetic , Yonghui Li

This paper presents the first in-depth analysis on the energy efficiency of LT codes with Non Coherent M-ary Frequency Shift Keying (NC-MFSK), known as green modulation [1], in a proactive Wireless Sensor Network (WSN) over Rayleigh…

Information Theory · Computer Science 2009-12-07 Jamshid Abouei , J. David Brown , Konstantinos N. Plataniotis , Subbarayan Pasupathy

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the…

Information Theory · Computer Science 2018-10-12 Emna Ben Yacoub , Fabian Steiner , Balazs Matuz , Gianluigi Liva

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship