An iterative receiver for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems in time-frequency wireless channels is presented. Multi-User Detection (MUD) and Channel Estimation (CE) are performed using soft information iteratively provided by the single-user decoders. Bidimensional Slepian expansion exploits time and frequency channel variation. Perf...

The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in design of distributed source codes, along with the need for distributed compression in sensor networks, has made it crucial to understand how quickly distributed communication systems can approach their ultimate limits. Slepian and Wolf considered the distributed enco...

In conventional decode-and-forward (DF) one-way relay systems, a data block received at the relay node is discarded, if the information part is found to have errors after decoding. Such errors are referred to as intra-link errors in this article. However, in a setup where the relay forwards data blocks despite possible intra-link errors, the two data blocks, one from the source node and the oth...

A method to construct nonasymmetric distributed source coding (DSC) scheme using polar codes which can achieve any point on the dominant face of the Slepian–Wolf (SW) rate region for sources with uniform marginals is considered. In addition to nonasymmetric case, we also discuss and show explicitly how asymmetric and single source compression is done using successive cancellation (SC) polar dec...

In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes. The cost function we consider is given by the product [rate] × [link weight]. The minimization is achieved by jointly optimizing the transm...

This chapter deals with practical solutions for the Slepian Wolf (SW) coding problem, which refers to the problem of lossless compression of correlated sources with coders which do not communicate. Here, we will consider the case of two binary correlated sources X and Y , characterized by their joint distribution. If the two coders communicate, it is well known from Shannon’s theory that the mi...

We study the relation between stochastic domination of an innnitely divisible random vector X by another innnitely divisible random vector Y and their corresponding L evy measures. The results are used to derive a Slepian-type inequality for a general class of symmetric innnitely divisible random vectors.