A Lower Bound Analysis of Hamming Distortion for a Binary CEO Problem With Joint Source Channel Coding
A two node binary chief executive officer (CEO) problem is investigated. Noise corrupted versions of a binary sequence are forwarded by two nodes to a single destination node over orthogonal additive white Gaussian noise (AWGN) channels. We first reduce the binary CEO problem to a binary multiterminal source coding problem, of which an outer bound for the rate distortion region is derived. The distortion function is then established by evaluating the relationship between the binary CEO and multiterminal source coding problems. A lower bound approximation on the Hamming distortion (HD) is obtained by minimizing a distortion function subject to constraints obtained based on the source channel separation theorem. Encoding/decoding algorithms using concatenated convolutional codes and a joint decoding scheme are used to verify the lower bound on the HD. It is found that the theoretical lower bounds on the HD and the computer simulation based bit error rate performance curves have the same tendencies. The differences in the threshold signal to noise ratio between the theoretical lower bounds and those obtained by simulations are around 1.5 dB in AWGN channel. The theoretical lower bound on the HD in block Rayleigh fading channel is also evaluated by performing Monte Carlo simulation.
IEEE Transactions on Communications