TY - GEN
T1 - Full-duplex bidirectional MIMO
T2 - 45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
AU - Day, Brian P.
AU - Bliss, Daniel W.
AU - Margetts, Adam R.
AU - Schniter, Philip
PY - 2011
Y1 - 2011
N2 - In this paper we consider the problem of full-duplex bidirectional communication between a pair of modems, each with multiple transmit and receive antennas. The principal difficulty in implementing such a system is that, due to the close proximity of each modem's transmit antennas to its receive antennas, each modem's outgoing signal can exceed the dynamic range of its input circuitry, making it difficult - if not impossible - to recover the desired incoming signal. To address these challenges, we consider systems that use pilot-aided channel estimates to perform transmit beamforming, receive beamforming, and interference cancellation. Modeling transmitter/receiver dynamic-range limitations explicitly, we derive tight upper and lower bounds on the achievable sum-rate, and propose a transmission scheme based on maximization of the lower bound, which requires us to (numerically) solve a nonconvex optimization problem. In addition, we derive an analytic approximation to the achievable sum-rate, and show, numerically, that it is quite accurate.
AB - In this paper we consider the problem of full-duplex bidirectional communication between a pair of modems, each with multiple transmit and receive antennas. The principal difficulty in implementing such a system is that, due to the close proximity of each modem's transmit antennas to its receive antennas, each modem's outgoing signal can exceed the dynamic range of its input circuitry, making it difficult - if not impossible - to recover the desired incoming signal. To address these challenges, we consider systems that use pilot-aided channel estimates to perform transmit beamforming, receive beamforming, and interference cancellation. Modeling transmitter/receiver dynamic-range limitations explicitly, we derive tight upper and lower bounds on the achievable sum-rate, and propose a transmission scheme based on maximization of the lower bound, which requires us to (numerically) solve a nonconvex optimization problem. In addition, we derive an analytic approximation to the achievable sum-rate, and show, numerically, that it is quite accurate.
UR - http://www.scopus.com/inward/record.url?scp=84861316101&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861316101&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2011.6190243
DO - 10.1109/ACSSC.2011.6190243
M3 - Conference contribution
AN - SCOPUS:84861316101
SN - 9781467303231
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1386
EP - 1390
BT - Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
Y2 - 6 November 2011 through 9 November 2011
ER -