An algebraic approach to physical-layer network coding
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1017-1021
Abstract
The problem of designing new physical-layer network coding (PNC) schemes via lattice partitions is considered. Building on a recent work by Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, we take an algebraic approach to show its potential in non-asymptotic settings. We first relate Nazer-Gastpar's approach to the fundamental theorem of finitely generated modules over a principle ideal domain. Based on this connection, we generalize their code construction and simplify their encoding and decoding methods. This not only provides a transparent understanding of their approach, but more importantly, it opens up the opportunity to design efficient and practical PNC schemes. Finally, we apply our framework for PNC to a Gaussian relay network and demonstrate its advantage over conventional PNC schemes.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Optimized constellations for two-way wireless relaying with physical network codingIEEE Journal on Selected Areas in Communications, 2009
- Power-constrained communications using LDLC lattices2009
- Low Density Lattice Codes2006
- Sphere Packings, Lattices and Groups1999
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997