This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed. This s...

We propose an iterative receiver for a multi-carrier (MC) code division multiple access (CDMA) system in the uplink for users moving at vehicular speed. MC-CDMA is based on orthogonal frequency division multiplexing (OFDM), thus time-variant channel estimation can be performed for every subcarrier independently. The variation of a subcarrier over the duration of a data block is upper bounded by...

Spatio-spectral concentration theory is concerned with the optimal space localization of a signal bandlimited in the frequency domain. The question was first considered in a series of classic papers by Slepian, Pollak, and Landau [1961; 1961; 1962; 1978] who studied the problem on the real line; an introduction to the early work on the subject can be found in two articles by Slepian [1976; 1983...

In this paper, we analyze classical data compression with quantum side information (also known as the classical-quantum Slepian–Wolf protocol) in so-called large and moderate deviation regimes. non-asymptotic setting, protocol involves compressing sequences of finite length <tex-math notat...

This paper proposes two low-complexity two-dimensional channel estimators forMIMOOFDM systems derived from a joint time–frequency channel estimator. The estimators exploit both time and frequency correlations of the wireless channel via use of Slepianbasis expansions. The computational saving comes from replacing a two-dimensional Slepian-basis expansion with two serially concatenated one-dimen...

We consider a rather simple algorithm to address the fascinating field of numerical extrapolation of (analytic) band-limited functions. It relies on two main elements: namely, the lower frequencies are treated by projecting the known part of the signal to be extended onto the space generated by “Prolate Spheroidal Wave Functions” (PSWF, as originally proposed by Slepian), whereas the higher one...

This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585–592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite cor...

In this paper, we provide a Rapid Orthogonal Approximate Slepian Transform (ROAST) for the discrete vector one obtains when collecting a finite set of uniform samples from a baseband analog signal. The ROAST offers an orthogonal projection which is an approximation to the orthogonal projection onto the leading discrete prolate spheroidal sequence (DPSS) vectors (also known as Slepian basis vect...