Performance Analysis of SSMA Communication Systems With Spreading Sequences of Markov Chains: Large Deviations Principle Versus the Central Limit Theorem
Performance Analysis of SSMA Communication Systems With Spreading Sequences of Markov Chains: Large Deviations Principle Versus the Central Limit Theorem
复制标题
DOI：
10.1109/tit.2011.2110030
复制
发表时间：
2011-04
影响因子：
2.5
通讯作者：
H. Fujisaki
中科院分区：
文献类型：
--
作者：
H. Fujisaki
在本文中，我们考虑异步扩频多址（SSMA）通信系统的扩展序列的马尔可夫链。我们表明，给定相移和时间延迟，经验平均的多址干扰（MAI），这样的系统满足条件大偏差原理（LDP）与凸，良好的速率函数。通过改进的大偏差分析，我们也得到了这样的系统中的比特错误概率的精确渐近。误码率的理论表达式与实验结果相比，我们确认，对于太小的用户数相比，扩频序列的长度，中心极限渐近变得无效，但大偏差渐近变成相关的。
In this paper, we consider asynchronous spread spectrum multiple access (SSMA) communication systems with spreading sequences of Markov chains. We show that, given phase shifts and time delays, the empirical mean of the multiple access interference (MAI) for such systems satisfies the conditional large deviations principle (LDP) with the convex, good rate function. By refinement of the large deviations analysis, we also obtain exact asymptotics of bit-error probabilities in such systems. Comparing theoretical expressions of bit-error probabilities with experimental results, we confirm that for too small numbers of users compared to the lengths of spreading sequences, the central limit asymptotics become invalid, but the large deviations asymptotics turn out to be relevant.