On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains

Abstract

We discuss evaluations of bit error probabilities in SSMA (spread spectrum multiple access) communication systems using binary spreading sequences of Markov chains and the designing of binary spreading sequences of Markov chains optimal in terms of bit error probabilities. We study SSMA communication systems using binary spreading sequences of Markov chains and give a necessary and sufficient condition that the distribution of the normalized MAI (multiple-access interference) is Gaussian. Based on this result, we discuss theoretical evaluations of bit error probabilities in such systems based on the CLT (central limit theorem) and those based on the SGA (standard Gaussian approximation). We compare these theoretical evaluations with experimental results and also discuss the optimum spreading sequences of Markov chains in terms of bit error probabilities based on the CLT.