Bounds on worst-case bit-error probability for asynchronous spread-spectrum multiple-access

The Gaussian multiple-access channel shared by K asynchronous transmitters is considered. A simplified model for uncoded bit-error probability is introduced for direct-sequence spread-spectrum multi-access systems with unknown, nonrandom transmitter parameters. Worst-case bit-error probability is in...

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Communications, - Spanning the Universe pp. 1410 - 1414 vol.3
Main Authors Hizlan, M., Hughes, B.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1988
Subjects
Delay effects
Error probability
Interference constraints
Power system modeling
Radio transmitters
Random variables
Signal to noise ratio
Spread spectrum communication
System performance
Upper bound
Online AccessGet full text

Cover

More Information
Summary:The Gaussian multiple-access channel shared by K asynchronous transmitters is considered. A simplified model for uncoded bit-error probability is introduced for direct-sequence spread-spectrum multi-access systems with unknown, nonrandom transmitter parameters. Worst-case bit-error probability is investigated in the presence of a maximum-power constraint on the channel interference. A low bound and a Chernoff upper bound are presented for the worst-case bit-error probability.< >
DOI:10.1109/ICC.1988.13781