Computation Alignment: Capacity Approximation Without Noise Accumulation
Authors:
- 7 February 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 59 (6) , 3811-3832
Abstract
Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by Avestimehr has approximated the capacity of this network up to an additive gap. The communication scheme achieving this capacity approximation is based on compress-and-forward, resulting in noise accumulation as the messages traverse the network. As a consequence, the approximation gap increases linearly with the network depth. This paper develops a computation alignment strategy that can approach the capacity of a class of layered, time-varying wireless relay networks up to an approximation gap that is independent of the network depth. This strategy is based on the compute-and-forward framework, which enables relays to decode deterministic functions of the transmitted messages. Alone, compute-and-forward is insufficient to approach the capacity as it incurs a penalty for approximating the wireless channel with complex-valued coefficients by a channel with integer coefficients. Here, this penalty is circumvented by carefully matching channel realizations across time slots to create integer-valued effective channels that are well suited to compute-and-forward. Unlike prior constant gap results, the approximation gap obtained in this paper also depends closely on the fading statistics, which are assumed to be i.i.d. Rayleigh.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Two-Unicast Wireless Networks: Characterizing the Degrees of FreedomIEEE Transactions on Information Theory, 2012
- Aligned Interference Neutralization and the Degrees of Freedom of the 2$\,\times \,$2$\,\times \,$2 Interference ChannelIEEE Transactions on Information Theory, 2012
- Nested Lattice Codes for Gaussian Relay Networks With InterferenceIEEE Transactions on Information Theory, 2011
- Lattice Strategies for the Dirty Multiple Access ChannelIEEE Transactions on Information Theory, 2011
- Interference Alignment in Dense Wireless NetworksIEEE Transactions on Information Theory, 2011
- Approximate capacity of a class of multi-source Gaussian relay networks2010
- Lattices are everywhere2009
- A layered lattice coding scheme for a class of three user Gaussian interference channels2008
- Nested linear/lattice codes for structured multiterminal binningIEEE Transactions on Information Theory, 2002
- Network information flowIEEE Transactions on Information Theory, 2000