TY - GEN
T1 - Full-duplex MIMO relaying
T2 - 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
AU - Day, Brian P.
AU - Margetts, Adam R.
AU - Bliss, Daniel W.
AU - Schniter, Philip
PY - 2012/12/1
Y1 - 2012/12/1
N2 - In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between multi-antenna source and destination nodes. The principal difficulty in implementing such a system is that, due to the limited attenuation between the relay's transmit and receive antenna arrays, the relay's outgoing signal may overwhelm its limited-dynamic-range input circuitry, making it difficult - if not impossible - to recover the desired incoming signal. While explicitly modeling transmitter/receiver dynamic-range limitations and channel estimation error, we derive tight upper and lower bounds on the end-to-end achievable rate of decode-and-forward-based full-duplex MIMO relay systems, and propose a transmission scheme based on maximization of the lower bound. The maximization requires us to (numerically) solve a nonconvex optimization problem, for which we detail a novel approach based on bisection search and gradient projection. To gain insights into system design tradeoffs, we also derive an analytic approximation to the achievable rate and numerically demonstrate its accuracy.
AB - In this paper we consider the problem of full-duplex multiple-input multiple-output (MIMO) relaying between multi-antenna source and destination nodes. The principal difficulty in implementing such a system is that, due to the limited attenuation between the relay's transmit and receive antenna arrays, the relay's outgoing signal may overwhelm its limited-dynamic-range input circuitry, making it difficult - if not impossible - to recover the desired incoming signal. While explicitly modeling transmitter/receiver dynamic-range limitations and channel estimation error, we derive tight upper and lower bounds on the end-to-end achievable rate of decode-and-forward-based full-duplex MIMO relay systems, and propose a transmission scheme based on maximization of the lower bound. The maximization requires us to (numerically) solve a nonconvex optimization problem, for which we detail a novel approach based on bisection search and gradient projection. To gain insights into system design tradeoffs, we also derive an analytic approximation to the achievable rate and numerically demonstrate its accuracy.
UR - http://www.scopus.com/inward/record.url?scp=84876275488&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876275488&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2012.6489232
DO - 10.1109/ACSSC.2012.6489232
M3 - Conference contribution
AN - SCOPUS:84876275488
SN - 9781467350518
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1290
EP - 1294
BT - Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Y2 - 4 November 2012 through 7 November 2012
ER -