210 likes | 580 Views
Amplify-and-Forward in Wireless Relay Networks. Institute of Network Coding. Samar Agnihotri , Sidharth Jaggi , Minghua Chen. The Chinese University of Hong Kong. In the Beginning …. … there was. Analog network coding in the high-SNR regime.
E N D
Amplify-and-Forward in Wireless Relay Networks Institute of Network Coding Samar Agnihotri, SidharthJaggi, Minghua Chen The Chinese University of Hong Kong
In the Beginning … … there was Analog network coding in the high-SNR regime - Marić, Goldsmith, Médard. WiNC 2010 - Layered networks - High SNR
Relay Channel s t s t Capacity is known only for some special cases Capacity of the general relay channel is not known
Achievability Schemes • Decode-and-Forward (Cover/El Gamal 1979) • Compress-and-Forward (Cover/El Gamal 1979) • Amplify-and-Forward (Laneman/Tse 2002) • Compute-and-Forward (Nazer/Gastpar 2006) • Quantize-map-and-Forward (ADT 2010)
Achievability Schemes • Decode-and-Forward (Cover/El Gamal 1979) • Compress-and-Forward (Cover/El Gamal 1979) • Amplify-and-Forward (Laneman/Tse 2002) • Compute-and-Forward (Nazer/Gastpar 2006) • Quantize-map-and-Forward (ADT 2010)
Amplify-and-Forward Relaying • Cooperative communication • Capacity estimation • ANC
General Wireless Networks Any • Size • Topology • Received SNR s t
Network Model -Bidirectional links -Single antenna -Full-duplex -Fixed channel gains, known throughout
Amplify-and-Forward in Wireless Networks “Intersymbol Interference Channel with Colored Gaussian Noise” s t
Achievable Rate for AF Relay Network Lemma (Achievable rate for AF relay network): For an AF-relay network with M nodes, the rate achievable with a given amplification vector β is Proof technique: circular convolution, DFT Maximum Achievable rate: W. Hirt, J. L. Massey, Capacity of the discrete-time Gaussian channel with intersymbol interference, Trans. IT, vol IT-34, 1988.
“Shout Only If You Make Sense” R1 Ps = P1 = P2 = 10 t s R2 1 1 Amplify-and-Forward Scale-and-Forward 1 0.1
Approximating IAF(Ps) Computing IAF(Ps) is ``hard’’ * Relay without Delay Approximation S. Katti, I. Marić, A. Goldsmith, D. Katabi, M. Médard, Joint relaying and network coding in wireless networks, Proc. IEEE ISIT 2007, Nice, France, June 2007.
Lower Bound Computation-I βi = β, 1≤ i ≤ M No Attenuation Constant Total Relay Power Type-A Network
Lower Bound Computation-II βi = β, 1≤ i ≤ M No Attenuation Constant Total Relay Power Type-B Network
Cut-set Upper Bounds s t BC Cut MAC Cut M Relays C ≤ min(CBC , CMAC)
Asymptotic Capacity No Attenuation, Constant Total Relay Power (Type-A Network) (Type-B Network)
Conclusions A unified framework for AF relay networks Tighter lower bounds for AF relay networks AF relaying can be capacity achieving for a broader class of networks ANC in a class of general networks
Current and Future Work Half-duplex networks, multiple-antennas/node, … Distributed schemes Resource-Performance trade-off • rates beyond AF
Thank You! Samar Agnihotri Email:samar@ie.cuhk.edu.hk Web:http://personal.ie.cuhk.edu.hk/~samar/ https://sites.google.com/site/samaragnihotri/