Wireless systems and interference avoidance

TY - JOUR

T1 - Wireless systems and interference avoidance

AU - Rose, Christopher

AU - Ulukus, Sennur

AU - Yates, Roy D.

N1 - Funding Information: Manuscript received May 18, 2000; revised August 21, 2001; accepted August 28, 2001. The editor coordinating the review of this paper and approving it for publication is S. Tekinay. This work was supported in part by National Science Foundation under Grant CCR-99-73012.

PY - 2002

Y1 - 2002

N2 - Motivated by the emergence of programmable radios, we seek to understand a new class of communication system where pairs of transmitters and receivers can adapt their modulation/demodulation method in the presence of interference to achieve better performance. Using signal to interference ratio as a metric and a general signal space approach, we present a class of iterative distributed algorithms for synchronous systems which results in an ensemble of optimal waveforms for multiple users connected to a common receiver (or colocated independent receivers). That is, the waveform ensemble meets the Welch Bound with equality and, therefore, achieves minimum average interference over the ensemble of signature waveforms. We derive fixed points for a number of scenarios, provide examples, look briefly at ensemble stability under user addition and deletion as well as provide a simplistic comparison to synchronous code-division multiple-access. We close with suggestions for future work.

AB - Motivated by the emergence of programmable radios, we seek to understand a new class of communication system where pairs of transmitters and receivers can adapt their modulation/demodulation method in the presence of interference to achieve better performance. Using signal to interference ratio as a metric and a general signal space approach, we present a class of iterative distributed algorithms for synchronous systems which results in an ensemble of optimal waveforms for multiple users connected to a common receiver (or colocated independent receivers). That is, the waveform ensemble meets the Welch Bound with equality and, therefore, achieves minimum average interference over the ensemble of signature waveforms. We derive fixed points for a number of scenarios, provide examples, look briefly at ensemble stability under user addition and deletion as well as provide a simplistic comparison to synchronous code-division multiple-access. We close with suggestions for future work.

KW - Adaptive modulation

KW - Code-division multiple-access systems

KW - Codeword optimization

KW - Interference avoidance

KW - Multiuser detection

KW - Sum capacity

KW - Vector channels

UR - http://www.scopus.com/inward/record.url?scp=0842327441&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0842327441&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/TWC.2002.800540

DO - https://doi.org/10.1109/TWC.2002.800540

M3 - Article

SN - 1536-1276

VL - 1

SP - 415

EP - 428

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 3

ER -