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

Murad Hizlan; Hughes

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

Murad Hizlan
, Hughes

Electrical and Computer Engineering

McKusick-Nathans Institute of Genetic Medicine, Johns Hopkins University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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 multiple-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 lower bound and a Chernoff upper bound are presented for the worst-case bit-error probability.

Original language	English
Title of host publication	IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.
Publisher	Publ by IEEEPiscataway, NJ, United States
Pages	1410-1414
Number of pages	5
State	Published - Dec 1 1988
Event	IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe. - Duration: Dec 1 1988 → …

Conference

Conference	IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.
Period	12/1/88 → …

Cite this

@inproceedings{3373a64c8684417880e43cbaa7f3b8a3,

title = "Bounds on worst-case bit-error probability for asynchronous spread-spectrum multiple-access.",

abstract = "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 multiple-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 lower bound and a Chernoff upper bound are presented for the worst-case bit-error probability.",

author = "Murad Hizlan and Hughes",

year = "1988",

month = dec,

day = "1",

language = "English",

pages = "1410--1414",

booktitle = "IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.",

publisher = "Publ by IEEEPiscataway, NJ, United States",

note = "IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe. ; Conference date: 01-12-1988",

}

Hizlan, M & Hughes 1988, Bounds on worst-case bit-error probability for asynchronous spread-spectrum multiple-access. in IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.. Publ by IEEEPiscataway, NJ, United States, pp. 1410-1414, IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe., 12/1/88.

Bounds on worst-case bit-error probability for asynchronous spread-spectrum multiple-access. / Hizlan, Murad; Hughes.
IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.. Publ by IEEEPiscataway, NJ, United States, 1988. p. 1410-1414.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Hizlan, Murad

AU - Hughes, null

PY - 1988/12/1

Y1 - 1988/12/1

N2 - 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 multiple-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 lower bound and a Chernoff upper bound are presented for the worst-case bit-error probability.

AB - 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 multiple-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 lower bound and a Chernoff upper bound are presented for the worst-case bit-error probability.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0024136433&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=0024136433&origin=inward

M3 - Conference contribution

SP - 1410

EP - 1414

BT - IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.

PB - Publ by IEEEPiscataway, NJ, United States

T2 - IEEE International Conference on Communications '88: Digital Technology - Spanning the Universe.

Y2 - 1 December 1988

ER -

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

Abstract

Conference

Other files and links

Cite this