On Correlated Binary Data: Bounds, Optimal Sequences, and their Dependence on Stochastic Interactions
Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany
Proceedings: TURBO - CODING - 2006
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Schnurr, Clemens (University of Technology Berlin, Heinrich-Hertz Chair, EECS, Einsteinufer 25, 10587 Berlin, Germany)
Stanczak, Slawomir (Fraunhofer German-Sino Lab for Mobile Communications, Einsteinufer 37, 10587 Berlin, Germany)
Abstract:
This paper deals with data transmission over a Gaussian code division multiple access (CDMA) channel with correlated sources. We assume the jointly optimum detector and focus on binary sources with arbitrary statistical dependencies. The objective is to characterize signature sequences that minimize the bit error probability for each source. We derive an upper bound on the bit error probability and show that under certain correlation structures, there exist sequences for which the upper bound equals a simple genie-aided lower bound that is independent of the choice of sequences. A brief discussion on the choice of sequences for other correlation structures completes the paper.