English
Related papers

Related papers: Low-delay, Low-PAPR, High-rate Non-square Complex …

200 papers

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The…

Information Theory · Computer Science 2016-11-17 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

The integration of multicarrier modulation and multiple-input-multiple-output (MIMO) is critical for reliable transmission of wireless signals in complex environments, which significantly improve spectrum efficiency. Existing studies have…

Information Theory · Computer Science 2026-01-09 Yuhao Chi , Zhiyuan Peng , Lei Liu , Ying Li , Yao Ge , Chau Yuen

In this study, we propose two schemes for uplink control channels based on non-contiguous complementary sequences (CSs) where the peak-to-average-power ratio (PAPR) of the resulting orthogonal frequency division multiplexing (OFDM) signal…

Information Theory · Computer Science 2019-04-03 Alphan Şahin , Rui Yang

Orthogonal time frequency space (OTFS) modulation is anticipated to be a promising candidate for supporting integrated sensing and communications (ISAC) systems, which is considered as a pivotal technique for realizing next generation…

Signal Processing · Electrical Eng. & Systems 2024-10-22 Jun Wu , Weijie Yuan , Zhiqiang Wei , Kecheng Zhang , Fan Liu , Derrick Wing Kwan Ng

One of the most important multi-carrier transmission techniques used in the latest wireless communication arena is known as Orthogonal Frequency Division Multiplexing (OFDM). It has several characteristics such as providing greater immunity…

Networking and Internet Architecture · Computer Science 2014-06-13 Md. Munjure Mowla , Liton Chandra Paul , Md. Rabiul Hasan

Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no less than 1 Tb/s, which is comparable to existing long-haul…

Information Theory · Computer Science 2024-10-28 Kirill Andreev , Pavel Rybin , Alexey Frolov

This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be satisfied when the linear minimum distance is to be ensured.…

Information Theory · Computer Science 2010-10-12 Iryna Andriyanova , Jean-Pierre Tillich

We study fast lattice decodability of space-time block codes for $n$ transmit and receive antennas, written very generally as a linear combination $\sum_{i=1}^{2l} s_i A_i$, where the $s_i$ are real information symbols and the $A_i$ are…

Information Theory · Computer Science 2016-11-18 Grégory Berhuy , Nadya Markin , B. A. Sethuraman

We propose the CLEX supercomputer topology and routing scheme. We prove that CLEX can utilize a constant fraction of the total bandwidth for point-to-point communication, at delays proportional to the sum of the number of intermediate hops…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-07-04 Christoph Lenzen , Roger Wattenhofer

Zero-delay transmission of a Gaussian source over an additive white Gaussian noise (AWGN) channel is considered with a one-bit analog-to-digital converter (ADC) front end and a correlated side information at the receiver. The design of the…

Information Theory · Computer Science 2019-12-18 Morteza Varasteh , Borzoo Rassouli , Osvaldo Simeone , Deniz Gunduz

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

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

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

We consider transmission over a general memoryless channel, with bounded decoding complexity per bit under message passing decoding. We show that the achievable rate is bounded below capacity if there is a finite success in the decoding in…

Information Theory · Computer Science 2007-07-13 Pulkit Grover

We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…

Computational Complexity · Computer Science 2020-11-17 Venkatesan Guruswami , Chaoping Xing

A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight…

Information Theory · Computer Science 2016-11-17 G. Susinder Rajan , B. Sundar Rajan

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications…

Information Theory · Computer Science 2019-07-23 Hossein Khoshnevis , Ian Marsland , Hamid Jafarkhani , Halim Yanikomeroglu

We study variable-length feedback (VLF) codes under a strict delay constraint to maximize their average transmission rate (ATR) in a discrete memoryless channel (DMC) while considering periodic decoding attempts. We first derive a lower…

Information Theory · Computer Science 2015-02-25 Seong Hwan Kim , Dan Keun Sung , Tho Le-Ngoc

We derive two families of EA-QC quantum LDPC (EA-QC-QLDPC) codes by tiling permutation matrices of prime and composite orders. The unassisted portion of the Tanner graphs corresponding to these codes, constructed from two distinct classical…

Information Theory · Computer Science 2025-11-04 Pavan Kumar , Abhi Kumar Sharma , Shayan Srinivasa Garani

We consider the problem of two transmitters wishing to exchange information through a relay in the middle. The channels between the transmitters and the relay are assumed to be synchronized, average power constrained additive white Gaussian…

Information Theory · Computer Science 2016-09-08 Makesh Pravin Wilson , Krishna Narayanan , Henry Pfister , Alex Sprintson