Related papers: Spreading Code Optimization for Low-Earth Orbit Sa…
We study the theoretical performance of a combined approach to demodulation and decoding of binary continuous-phase modulated signals under repetition-like codes. This technique is motivated by a need to transmit packetized or framed data…
This paper proposes a joint optimization framework for energy-efficient linear precoding and feeder-link-beam matching design in a multi-gateway multi-beam bent-pipe satellite communication system. The proposed scheme jointly optimizes the…
Spatial complementary code keying modulation (SCCKM) is proposed as a novel block coding modulation scheme. An input binary sequence is modulated based on the different lengths of complementary code keying (CCK) modulation and then spread…
We develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable, but let them be coupled linearly. To our knowledge, ours…
This article investigates the transmission delay of a Low Earth Orbit (LEO) satellite communication system in a bent pipe structure. By employing a stochastic geometry framework, satellites are modeled as spherical binomial point processes…
In this paper, we investigate network nest coded modulation schemes for multiple access relay channels. The performance of the distributed systems which are based on distributed convolutional codes with network coded modulation is…
In this letter, we present a hybrid iterative decoder for non-binary low density parity check (LDPC) codes over binary erasure channel (BEC), based on which the recursion of the erasure probability is derived to design non-binary LDPC codes…
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…
Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…
In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of…
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…
This paper investigates the maximum achievable downlink spectral efficiency of low Earth orbit (LEO) satellite constellations. Spectral efficiency is defined here as the total network sum rate per unit bandwidth per unit area of Earth's…
Future wireless systems are expected to employ extremely large-scale multiple-input multiple-output (XL-MIMO) arrays at high carrier frequencies, where near-field propagation makes the channel depend jointly on angle and distance. The…
Sharing global channel information at base stations (BSs) is commonly assumed for downlink multi-cell precoding. In the context of massive multi-input multi-output (MIMO) systems where each BS is equipped with a large number of antennas,…
In this paper, we investigate and compare the performance of single- and multi-carrier modulation schemes for indoor visible light communication (VLC). Particularly, the performances of single carrier frequency domain equalization (SCFDE),…
Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…
This paper is focused on the design of phase sequences with good (aperiodic) autocorrelation properties in terms of Peak Sidelobe Level (PSL) and Integrated Sidelobe Level (ISL). The problem is formulated as a bi-objective Pareto…
Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…
In this work, we investigate the radius maximizing reliability for binary modulation on conjugate-reciprocal zeros (BMOCZ) implemented with both maximum likelihood (ML) and direct zero-testing (DiZeT) decoders. We first show that the…
In this work, we consider efficient maximum-likelihood decoding of linear block codes for small-to-moderate block lengths. The presented approach is a branch-and-bound algorithm using the cutting-plane approach of Zhang and Siegel (IEEE…