A Low Complexity Coding And Decoding Strategy For The Quadratic Gaussian Ceo Problem

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)We consider the quadratic Gaussian CEO problem, where the goal is to estimate a measure based on several Gaussian noisy observations which must be encoded and sent to a centralized receiver using limited transmission rate. For real applications, besides minimizing the average distortion, given the transmission rate, it is important to take into account memory and processing constraints. Considering these motivations, we present a low complexity coding and decoding strategy, which exploits the correlation between the measurements to reduce the number of bits to be transmitted by refining the output of the quantization stage. The CEO makes an estimate using a decoder based on a process similar to majority voting. We derive explicit expression for the CEO's error probability and compare numerical simulations with known achievability results and bounds. (C) 2016 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.353643656Sao Paulo Research Foundation (FAPESP) [2013/25977-7]Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP

Curves on Flat Tori and Analog Source-Channel Codes

In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.59106646665

Construção e análise de códigos esféricos com boas taxas binárias

In this paper we deals with the construction of spherical codes for the Gaussian channel. We present families of structured spherical codes, designed in layers of flat tori, that can be constructed in linear time for even dimensions and improves, for certain parameters, the lower bound for the binary rate given by Shannon.Neste trabalho consideramos a distribuição de um conjunto discreto de pontos sobre a superfície de uma esfera euclidiana unitária, com o propósito de construir códigos esféricos para o canal Gaussiano. Apresentamos famílias de códigos esféricos estruturados, que podem ser construídas em tempo linear para dimensões pares e superam, para alguns parâmetros, o limitante inferior de Shannon para a taxa binária de informação.132