Analog Network Coding in Nonlinear Chains
Samar Agnihotri

TL;DR
This paper introduces nonlinear chain networks and approximation schemes to better understand and compute the optimal analog network coding rate in complex wireless relay networks, improving analysis and efficiency.
Contribution
It proposes nonlinear chain network models and two approximation schemes to analyze the optimal ANC rate with reduced complexity in general wireless relay networks.
Findings
Tightly characterizes the optimal ANC rate with low complexity.
Extends analysis beyond layered networks to more general topologies.
Provides practical schemes for approximating the optimal rate.
Abstract
The problem of characterizing the optimal rate achievable with analog network coding (ANC) for a unicast communication over general wireless relay networks is computationally hard. A relay node performing ANC scales and forwards its input signals. The source-destination channel in such communication scenarios is, in general, an intersymbol interference (ISI) channel which leads to the single-letter characterization of the optimal rate in terms of an optimization problem with nonconvex, non closed-form objective function and non-convex constraints. For a special class of such networks, called layered networks, a few key results and insights are however available. To gain insights into the nature of the optimal solution and to construct low-complexity schemes to characterize the optimal rate for general wireless relay networks, we need (1) network topologies that are regular enough to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications · Wireless Communication Security Techniques
