English
Related papers

Related papers: Square Complex Orthogonal Designs with Low PAPR an…

200 papers

Increasing demands on high data rate mobile communications services will inevitably drive future broadband mobile communication systems toward achieving data transmission rates in excess of 100 Mbps. One of the promising technologies which…

Information Theory · Computer Science 2012-09-24 Sanjay Singh , M. Sathish Kumar , H. S. Mruthyunjaya

Future 6G wireless networks will once again have to raise the capability in most of the technology domains by a factor of 10-100. Depending on the application, future requirements include peak data rates of 1Tb/s per user, 0.1ms latency,…

Signal Processing · Electrical Eng. & Systems 2021-10-08 Traian E. Abrudan , Stepan Kucera , Holger Claussen

Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and…

Information Theory · Computer Science 2013-02-07 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively,…

Information Theory · Computer Science 2020-12-14 Hsin-Po Wang , Iwan Duursma

This paper investigates an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in…

Information Theory · Computer Science 2017-12-14 Yanqing Xu , Chao Shen , Tsung-Hui Chang , Shih-Chun Lin , Yajun Zhao , Gang Zhu

Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords…

Information Theory · Computer Science 2017-03-14 Cynthia Rush , Adam Greig , Ramji Venkataramanan

Orthogonal frequency division multiplexing (OFDM) is a promising modulation radio access scheme for next generation wireless communication systems because of its inherent immunity to multipath interference due to a low symbol rate, the use…

Networking and Internet Architecture · Computer Science 2014-04-10 Md. Munjure Mowla , Md. Yeakub Ali , Abdulla Al Suman

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $min(n_t,n_r)$ complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for…

Information Theory · Computer Science 2010-01-13 K. Pavan Srinath , B. Sundar Rajan

Noisy index coding problems over AWGN channel are considered. For a given index coding problem and a chosen scalar linear index code of length $N$, we propose to transmit the $N$ index coded bits as a single signal from a $2^N$- PSK…

Information Theory · Computer Science 2016-03-11 Anjana A. Mahesh , B. Sundar Rajan

We propose a new type of ultimate-Shannon-limit-approaching codes called spatially coupled protograph-based low-density parity-check Hadamard convolutional codes (SC-PLDPCH-CCs), which are constructed by spatially coupling PLDPC-Hadamard…

Information Theory · Computer Science 2022-07-26 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…

Information Theory · Computer Science 2007-07-13 Petros Elia , B. A. Sethuraman , P. Vijay Kumar

Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this…

Information Theory · Computer Science 2019-11-05 Ramji Venkataramanan , Sekhar Tatikonda , Andrew Barron

Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…

Information Theory · Computer Science 2025-09-23 Alexander Fengler , Burak Çakmak , Giuseppe Caire

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical…

Information Theory · Computer Science 2009-08-11 J. Harshan , B. Sundar Rajan

Square COD (complex orthogonal design) with size $[n, n, k]$ is an $n \times n$ matrix $\mathcal{O}_z$, where each entry is a complex linear combination of $z_i$ and their conjugations $z_i^*$, $i=1,\ldots, k$, such that $\mathcal{O}_z^H…

Information Theory · Computer Science 2013-03-19 Yuan Li

Orthogonal Time Frequency Space (OTFS) systems face significant challenges in channel estimation due to high pilot overhead and peak-to-average power ratio (PAPR). To address these issues, we propose a two-step channel estimation method for…

Information Theory · Computer Science 2026-02-18 Omid Abbassi Aghda , Mohammad Javad Omidi , Hamid Saeedi-Sourck

A constant-amplitude code is a code that reduces the peak-to-average power ratio (PAPR) in multicode code-division multiple access (MC-CDMA) systems to the favorable value 1. In this paper quaternary constant-amplitude codes (codes over…

Information Theory · Computer Science 2009-09-24 Kai-Uwe Schmidt

A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the energy expended in processing the data at the encoder and the decoder and…

Information Theory · Computer Science 2008-05-19 Pulkit Grover , Anant Sahai

The problem of channel code design for the $M$-ary input AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the encoder is considered. The code design criterion at high SNR…

Information Theory · Computer Science 2007-11-13 Hamid Farmanbar , Shahab Oveis Gharan , Amir Keyvan Khandani

Low-coherence sequences with low peak-to-average power ratio (PAPR) are crucial for multi-carrier wireless communication systems and are used for pilots, spreading sequences, and so on. This letter proposes an efficient low-coherence…

Signal Processing · Electrical Eng. & Systems 2024-10-23 Gangle Sun , Wenjin Wang , Wei Xu , Christoph Studer
‹ Prev 1 4 5 6 7 8 10 Next ›