TY - GEN
T1 - Analog network coding in general SNR regime
AU - Agnihotri, Samar
AU - Jaggi, Sidharth
AU - Chen, Minghua
PY - 2012
Y1 - 2012
N2 - The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. Recently this problem has been considered under two assumptions: (A) each relay node scales its received signal to the upper bound of its transmit power constraint, (B) the relay nodes in specific subsets of the network operate in the high-SNR regime. We establish that assumption (A), in general, leads to suboptimal end-to-end rate. We also characterize the performance of analog network coding in a class of symmetric layered networks without assumption (B). The key contribution of this work is a lemma that states that in a layered relay network a globally optimal set of scaling factors for the nodes that maximizes the end-to-end rate can be computed layer-by-layer. Specifically, a rate-optimal set of scaling factors for the nodes in a layer is the one that maximizes the sum-rate of the nodes in the next layer. This critical insight allows us to characterize analog network coding performance in network scenarios beyond those that can be analyzed using the existing approaches. We illustrate this by computing the maximum rate achievable with analog network coding in one particular layered network, in various communication scenarios.
AB - The problem of maximum rate achievable with analog network coding for a unicast communication over a layered wireless relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. Recently this problem has been considered under two assumptions: (A) each relay node scales its received signal to the upper bound of its transmit power constraint, (B) the relay nodes in specific subsets of the network operate in the high-SNR regime. We establish that assumption (A), in general, leads to suboptimal end-to-end rate. We also characterize the performance of analog network coding in a class of symmetric layered networks without assumption (B). The key contribution of this work is a lemma that states that in a layered relay network a globally optimal set of scaling factors for the nodes that maximizes the end-to-end rate can be computed layer-by-layer. Specifically, a rate-optimal set of scaling factors for the nodes in a layer is the one that maximizes the sum-rate of the nodes in the next layer. This critical insight allows us to characterize analog network coding performance in network scenarios beyond those that can be analyzed using the existing approaches. We illustrate this by computing the maximum rate achievable with analog network coding in one particular layered network, in various communication scenarios.
UR - https://www.scopus.com/pages/publications/84867527891
U2 - 10.1109/ISIT.2012.6283722
DO - 10.1109/ISIT.2012.6283722
M3 - Conference Contribution (Conference Proceeding)
AN - SCOPUS:84867527891
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2052
EP - 2056
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -