Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN channels. The outputs of these channels have each a separated receiver, whereas a third receiver has both outputs available. At the transmitter side, a pair of bandwidth-reduction analog mappings are used for joint source-channel coding. The presented scheme has the inherent advantage over digital MD schemes based on separation, that coding and decoding can be performed by using a single-letter (or symbol), a strategy that is very suitable for applications where latency originated by the digital compression and th…
Concurrent and Distributed Projection through Local Interference for Wireless Sensor Networks
In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.
Analog Multiple Description Joint Source-Channel Coding Based on Lattice Scaling
Joint source-channel coding schemes based on analog mappings for point-to-point channels have recently gained attention for their simplicity and low delay. In this paper, these schemes are extended either to scenarios with or without side information at the decoders to transmit multiple descriptions of a Gaussian source over independent parallel channels. They are based on a lattice scaling approach together with bandwidth reduction analog mappings adapted for this multiple description scenario. The rationale behind lattice scaling is to improve performance through bandwidth expansion. Another important contribution of this paper is the proof of the separation theorem for the communication …
Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection
In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…
Statistical modeling, simulation, and experimental verification of wideband indoor mobile radio channel
This paper focuses on the modeling, simulation, and experimental verification of wideband single-input single-output (SISO) mobile fading channels for indoor propagation environments. The indoor reference channel model is derived from a geometrical rectangle scattering model, which consists of an infinite number of scatterers. It is assumed that the scatterers are exponentially distributed over the two-dimensional (2D) horizontal plane of a rectangular room. Analytical expressions are derived for the probability density function (PDF) of the angle of arrival (AOA), the PDF of the propagation path length, the power delay profile (PDP), and the frequency correlation function (FCF). An efficie…
On the error sequences of M-ary FSK modulation schemes over Nakagami-m fading channels
In this paper, we have studied some important statistical properties of error sequences of M-ary orthogonal frequency-shift keying (FSK) modulation schemes over Nakagami-m fading channels. We have derived the joint probability density function (PDF) of error sequences of arbitrary length. From the joint PDF, we have found an analytical solution for the autocorrelation function (ACF) of the error sequences. The correctness of the analytical expression for the ACF of error sequences has been confirmed by simulations, where the simulation results are obtained by using the sum-of-sinusoids principle. The derived joint PDF of error sequences is useful for the development of first-order and highe…
Classes of sum-of-cisoids processes and their statistics for the modeling and simulation of mobile fading channels
Published version of an article in the journal: EURASIP Journal on Wireless Communications and Networking. Also available from the publisher at: http://dx.doi.org/10.1186/1687-1499-2013-125 Open access In this paper, we present a fundamental study on the stationarity and ergodicity of eight classes of sum-of-cisoids (SOC) processes for the modeling and simulation of frequency-nonselective mobile Rayleigh fading channels. The purpose of this study is to determine which classes of SOC models enable the design of channel simulators that accurately reproduce the channel’s statistical properties without demanding information on the time origin or the time-consuming computation of an ensemble ave…