English We consider the joint source-channel coding problem of sending a Gaussian source over a multiple input-multiple output (MIMO) fading channel when the decoder has additional correlated side information whose quality is also time-varying. We assume a block fading model for both the channel and side information qualities, and assume perfect state information at the receiver, while the tran...

Tandem coding and decoding has been demonstrated to yield arbitrarily low error rates provided a sufficiently large block length is used. When applied to practical systems that are inherently limited to a finite complexity and therefore to finite block lengths, such a strategy may be largely suboptimal. Indeed, a tandem decoding strategy ignores two types of information: the source memory and t...

In this paper, the problem of transmission of Raptor codes over fading channel is considered. We present in this paper joint decoder architecture for Raptor codes over phase coherent fading channel. The proposed scheme does not require transmission of pilot symbols or extra coded bits for achieving the same BER performance. The receiver uses sum-product algorithm to jointly estimate the channel...

We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an incremental transmission policy, and the decoder a universal sequential decision test. We show that the decoder is able to decode shortly after the rates of transmission exceed the Slepian-Wolf bounds. The decoder then send an ACK back to the encoders, terminating transmissio...

Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any ε > 0, the set of n-length sequences x and y that are jointly typical [1] according to PXY can be represented on a bipartite graph. We present a formal definition of such a graph, known as a typicality graph, and study some of its properties.

In this paper, we propose a joint source-channel decoding approach for the robust image transmission over wireless channels. In addition to the explicit redundancy coming from channel codes, we also use implicit residual source redundancy for error protection. The source redundancy is modeled by a Markov random field (MRF) source model, which considers the residual spatial correlation after sou...

The class of joint decoder of probabilistic fingerprinting codes is of utmost importance in theoretical papers to establish the concept of fingerprint capacity [1]–[3]. However, no implementation supporting a large user base is known to date. This paper presents an iterative decoder which is, as far as we are aware of, the first practical attempt towards joint decoding. The discriminative featu...

End-to-end training makes the neural machine translation (NMT) architecture simpler, yet elegant compared to traditional statistical machine translation (SMT). However, little is known about linguistic patterns of morphology, syntax and semantics learned during the training of NMT systems, and more importantly, which parts of the architecture are responsible for learning each of these phenomena...

A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DM...

In this paper, we address the issue of joint detection schemes for uplink cellular system when base station cooperation is possible for multi-cell users in multi-cell scenario. The ZF and ZF based SIC detection are analyzed and evaluated, however, they need the increased decoder complexity as the number of iteration is increased. We propose a new joint ZF and partial ML decoding scheme, which c...