The central limit theorem for the normalized sums of the MAI for SSMA communication systems using spreading sequences of Markov chains
We extend the sliding block code in symbolic dynamics to transform J(>= 2) sequences of Markov chains with time delays. Under the assumption that the chains are irreducible and aperiodic, we prove the central limit theorem (CLT) for the normalized sums of extended sliding block codes from J sequences of Markov chains. We apply the theorem to the system analysis of asynchronous spread spectrum multiple access (SSMA) communication systems using spreading sequences of Markov chains. We find that the standard Gaussian approximation (SGA) for estimations of bit error probabilities in such systems is the 0-th order approximation of the evaluation based on the CLT. We also provide a simple theoretical evaluation of bit error probabilities in such systems, which agrees properly with the experimental results even for the systems with small number of users and low length of spreading sequences.
markov chain sliding block code central limit theorem (clt) spread spectrum multiple access (ssma) communication system bit error probability a(n)-mixing