Related papers: A Phenomenological Study on Threshold Improvement …
Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a…
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is still a considerable gap between the performance of the BP…
In this work, we consider the problem of reduced latency of low-density parity-check (LDPC) codes with iterative detection and decoding (IDD) receiver in multiuser multiple-antenna systems. The proposed knowledge-aided IDD (KA-IDD) system…
Probability Shaping (PS) is a method to improve a Modulation and Coding Scheme (MCS) in order to increase reliability of data transmission. It is already implemented in some modern radio broadcasting and optic systems, but not yet in…
In this letter, we propose a new coordinated multipoint (CoMP) technique based on mutual information (MI) accumulation using rateless codes. Using a stochastic geometry model for the cellular downlink, we quantify the performance…
Regular spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we…
Multi-connected universe models with space identification scales smaller than the size of the observable universe produce topological images of cosmic sources. We generalise to locally hyperbolic spaces the crystallographic method, aimed to…
In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization in cellular networks. However, the explicit impact of spatial interference, imposed by FD communications, on uplink and downlink…
In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes…
This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density…
We investigate the spatiotemporal dynamics of a network of coupled chaotic maps, with varying degrees of randomness in coupling connections. While strictly nearest neighbour coupling never allows spatiotemporal synchronization in our…
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
We investigate the possible occurrence of a positive cosmic acceleration in a spatially averaged, expanding, unbound Lemaitre-Tolman-Bondi cosmology. By studying an approximation in which the contribution of three-curvature dominates over…
In this paper, a downlink macro-diversity precodingaided spatial modulation (MD-PSM) scheme is proposed, in which two base stations (BSs) communicate simultaneously with a single mobile station (MS). As such, the proposed scheme achieved…
A Bounded-Degree Low-Rank Parity-Check (BD-LRPC) code is a rank-metric code that admits a parity-check matrix whose support is generated by a set of powers of an element. This specific structure of the parity-check matrix was employed to…
An MN-Gallager Code over Galois fields, $q$, based on the Dynamical Block Posterior probabilities (DBP) for messages with a given set of autocorrelations is presented with the following main results: (a) for a binary symmetric channel the…
This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…
We derive bounds on the asymptotic density of parity-check matrices and the achievable rates of binary linear block codes transmitted over memoryless binary-input output-symmetric (MBIOS) channels. The lower bounds on the density of…
A practical $2^m$-ary polar coded modulation (PCM) scheme with optimal constellation labeling is proposed. To efficiently find the optimal labeling rule, the search space is reduced by exploiting the symmetry properties of the channels.…
The investigation of spatio-temporal couplings (STCs) of broadband light beams is becoming a key topic for the optimization as well as applications of ultrashort laser systems. This calls for accurate measurements of STCs. Yet, it is only…