Related papers: Low-delay, Low-PAPR, High-rate Non-square Complex …
We apply linear network coding (LNC) to broadcast a block of data packets from one sender to a set of receivers via lossy wireless channels, assuming each receiver already possesses a subset of these packets and wants the rest. We aim to…
Given a distributed network represented by a weighted undirected graph $G=(V,E)$ on $n$ vertices, and a parameter $k$, we devise a distributed algorithm that computes a routing scheme in $(n^{1/2+1/k}+D)\cdot n^{o(1)}$ rounds, where $D$ is…
In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the…
A comprehensive study of the coded performance of long-haul spectrally-efficient WDM optical fiber transmission systems with different coded modulation decoding structures is presented. Achievable information rates are derived for three…
This letter produces a family of rate-compatible protograph-based LDPC codes approaching the independent and uniformly distributed (i.u.d.) capacity of inter-symbol interference (ISI) channels. This problem is highly nontrivial due to the…
Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…
In this paper, we discuss a construction of CSS codes derived from pairs of practical irregular LDPC codes. Our design of irregular LDPC codes is based the design written in the standardization of IEEE802.16e. Our research has tried to make…
Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate…
We consider a setting in which a sender wishes to broadcast a block of K data packets to a set of wireless receivers, where each of the receivers has a subset of the data packets already available to it (e.g., from prior transmissions) and…
Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail…
Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…
Fifth generation new radio aims to facilitate new use cases in wireless communications. Some of these new use cases have highly de-manding latency requirements; many of the powerful forward error correction codes deployed in current…
The rapidly improving performance of modern hardware renders convolutional codes obsolete, and allows for the practical implementation of more sophisticated correction codes such as low density parity check (LDPC) and turbo codes (TC). Both…
A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the…
The performance of a CDMA based wireless system is largely dependent on the characteristics of pseudo-random spreading codes. The spreading codes should be carefully chosen to ensure highest possible peak value of auto-correlation function…
Designing channel codes under low-latency constraints is one of the most demanding requirements in 5G standards. However, a sharp characterization of the performance of traditional codes is available only in the large block-length limit.…
We consider an asynchronous network of $n$ message-sending parties, up to $t$ of which are byzantine. We study approximate agreement, where the parties obtain approximately equal outputs in the convex hull of their inputs. In their seminal…
The problem of characterizing the optimal rate achievable with analog network coding (ANC) for a unicast communication over general wireless relay networks is computationally hard. A relay node performing ANC scales and forwards its input…
The decoding error probability of codes is studied as a function of their block length. It is shown that the existence of codes with a polynomially small decoding error probability implies the existence of codes with an exponentially small…