It is shown that a non-square (NS) 2-ary quadrature amplitude modulation (QAM) can be decomposed into a single-parity-check (SPC) block encoder and a memoryless modulator with independent in-phase (I) and quadrature (Q) symbol mapping. When NS-2-QAM is concatenated with a forward-errorcorrecting (FEC) code, iterative demodulation and decoding of the FEC code and the inherent SPC code of NS-2-QA...

We show that the Extrinsic Information about the coded bits of any good (capacity achieving) code operating over a wide class of discrete memoryless channels (DMC) is zero when channel capacity is below the code rate and positive constant otherwise, that is, the Extrinsic Information Transfer (EXIT) chart is a step function of channel quality, for any capacity achieving code. It follows that, f...

Minimum distance (MD), maximum likelihood (ML), and maximum a posteriori (MAP) decoding is considered for synchronization error correcting (SEC) codes with known codeword boundaries when transmitted over the Binary Substitution, Insertion and Deletion channel. It is shown that MD decoding is sub-optimal, unlike ML or MAP decoding. Based on ML and MAP decoding, a new measure called the Change Pr...

A fountain code produces for given set of k input symbols (x1, . . . , xk) a potentially limitless stream of output symbols z1, z2, . . .. The input and output symbols can be binary vectors of arbitrary length. Each output symbol is the sum of a randomly and independently chosen subset of the input symbols. Information describing the relations between input and output symbols is obtained at the...

The description of the developed algorithm for optimal symbol-by-symbol reception signal structures based on frequency-efficient signals with two-dimensional «constellations» intensively used in applications and block correction codes non-binary Galois fields is given. It shown that minimizes error probability code symbol or information bit contrast to well-known maximum likelihood rule which e...

We present a lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a Gaussian channel. The bound is tight for error probabilities and signal-to-noise ratios of practical interest, as opposed to most existing bounds that become tight asymptotically for high signal-to-noise ratios. The bound is also universal: it provides a limit on the hi...

In multicarrier code-division multiple-access (MCCDMA) the total system bandwidth is divided into a number of subbands, where each subband may use direct-sequence (DS) spreading and each subband signal is transmitted using a subcarrier frequency. In this contribution we divide the symbol duration into a number of fractional sub-symbol durations also referred to here as fractions, in a manner an...

Lossless compression is studied for a countably infinite alphabet source with an unknown, off-centered, two-sided geometric (TSG) distribution, which is a commonly used statistical model for image prediction residuals. In this paper, we demonstrate that arithmetic coding based on a simple strategy of model adaptation, essentially attains the theoretical lower bound to the universal coding redun...

We describe a new language translation framework (partial translation) and the application of one of its instances: the C-iication of Binary Prolog. Our partial translation framework compiles selected sequences of em-ulator instructions down to native code. The technique can be seen as an automatic specialization with respect to a given program of the traditional instruction folding techniques ...