TY - GEN
T1 - Interference suppression in the presence of quantization errors
AU - Bakr, Omar
AU - Johnson, Mark
AU - Mudumbai, Raghuraman
AU - Madhow, Upamanyu
PY - 2009
Y1 - 2009
N2 - Multi-element antennas offer the possibility of increasing the spatial reuse of wireless spectrum by "nulling" out interfering signals. However, the interference suppression performance is highly sensitive to small errors in the gains applied to the antenna elements. In this paper, we examine in detail the effect of one specific source of error that arises from quantizing array weights. We show that a simple approach based on scalar quantization that ignores the correlation of the quantization errors fails to fully utilize the interference suppression capability of the array: the residual interference level does not decrease with the number of antennas. Unfortunately, the optimum approach to computing the weights involves vector quantization over a space that grows exponentially with the number of antennas and number of quantization bits, and is therefore computationally intractable. We propose instead a simple suboptimal method that greedily optimizes the SIR, coefficient-by-coefficient. Simulations show that this greedy approach provides substantial SIR gains over the naive approach, with SIR growing polynomially in the number of antennas. We derive analytical bounds that indicate that even larger SIR gains (exponential in the number of antennas) are potentially achievable, so that finding tractable algorithms that improve upon our suboptimal approach is an important open problem.
AB - Multi-element antennas offer the possibility of increasing the spatial reuse of wireless spectrum by "nulling" out interfering signals. However, the interference suppression performance is highly sensitive to small errors in the gains applied to the antenna elements. In this paper, we examine in detail the effect of one specific source of error that arises from quantizing array weights. We show that a simple approach based on scalar quantization that ignores the correlation of the quantization errors fails to fully utilize the interference suppression capability of the array: the residual interference level does not decrease with the number of antennas. Unfortunately, the optimum approach to computing the weights involves vector quantization over a space that grows exponentially with the number of antennas and number of quantization bits, and is therefore computationally intractable. We propose instead a simple suboptimal method that greedily optimizes the SIR, coefficient-by-coefficient. Simulations show that this greedy approach provides substantial SIR gains over the naive approach, with SIR growing polynomially in the number of antennas. We derive analytical bounds that indicate that even larger SIR gains (exponential in the number of antennas) are potentially achievable, so that finding tractable algorithms that improve upon our suboptimal approach is an important open problem.
UR - http://www.scopus.com/inward/record.url?scp=77949627458&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2009.5394552
DO - 10.1109/ALLERTON.2009.5394552
M3 - Conference contribution
AN - SCOPUS:77949627458
SN - 9781424458714
T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
SP - 1161
EP - 1168
BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Y2 - 30 September 2009 through 2 October 2009
ER -