Summary
International Symposium on Nonlinear Theory and Its Applications
2016
Session Number:A4L-C
Session:
Number:A4L-C-7
A Realization of Optimum Binary Spreading Sequences of Markov Chains Based on Discretized $\beta$-Transformations
Hiroshi Fujisaki,
pp.-
Publication Date:2016/11/27
Online ISSN:2188-5079
Summary:
We construct optimum binary spreading sequences of Markov chains in terms of bit error probabilities in asynchronous spread-spectrum multiple-access (SSMA) communication systems based on discretized $\beta$-transformations. We also evaluate the normalized autocorrelation function for the optimum binary spreading sequences of Markov chains based on the discretized $\beta$-transformations. The experimental results of the bit error probabilities in the asynchronous SSMA communication systems using the obtained sequences agree with the theoretical estimations of the bit error probabilities based on the central limit theorem (CLT).