By Topic

Approximations for bit error probabilities in SSMA communication systems using spreading sequences of Markov chains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujisaki, H. ; Graduate Sch. of Natural Sci. & Technol., Kanazawa Univ., Ishikawa, Japan ; Keller, G.

In previous research, we considered SSMA (spread spectrum multiple access) communication systems using spreading sequences of Markov chains and pointed out that the theoretical evaluations of bit error probabilities in such systems based on the SGA (standard Gaussian approximation) is rather optimistic comparing with those based on the CLT (central limit theorem). The theoretical evaluations of bit error probabilities in such systems based on the CLT were in the forms of multiple integrals. In this report, we give approximations for these forms and show that they agree properly with the experimental results.

Published in:

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Date of Conference:

23-26 May 2005