On bit error probabilities of SSMA communication systems using spreading sequences of Markov chains
We study asynchronous SSMA communication systems using binary spreading sequences of Markov chains and prove the CLT (central limit theorem) for the empirical distribution of the normalized MAI (multiple-access interference). We also prove that the distribution of the normalized MAI for asynchronous systems can never be Gaussian if chains are irreducible and aperiodic. Based on these results, we propose novel theoretical evaluations of bit error probabilities in such systems based on the CLT and compare these and conventional theoretical estimations based on the SGA (standard Gaussian approximation) with experimental results. Consequently we confirm that the proposed theoretical evaluations based on the CLT agree with the experimental results better than the theoretical evaluations based on the SGA. Accordingly, using the theoretical evalutions based on the CLT, we give the optimum spreading sequences of Markov chains in terms of bit error probabilities.
bit error probability spreading sequences markov chains clt (central limit theorem) mai (multiple-access interference) sga (standard gaussian approximation) ssma (spread spectrum multiple access) communication systems