Achieving the Near-Capacity of Two-Way Relay Channels With Modulation-Coded Physical-Layer Network Coding

Yang, L; Yang, T; Yuan, J; An, J

Achieving the Near-Capacity of Two-Way Relay Channels With Modulation-Coded Physical-Layer Network Coding

Yang, L Yang, T

Yuan, J An, J

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Wireless Communications, 2015, 14 (9), pp. 5225 - 5239
Issue Date:: 2015-09-01

Closed Access

	Filename	Description	Size
	LeiYang TWC15 Achieving the Near Capacity of Two Way.pdf	Published Version	1.17 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yang, L	en_US
dc.contributor.author	Yang, T https://orcid.org/0000-0002-9870-6866	en_US
dc.contributor.author	Yuan, J	en_US
dc.contributor.author	An, J	en_US
dc.date.issued	2015-09-01	en_US
dc.identifier.citation	IEEE Transactions on Wireless Communications, 2015, 14 (9), pp. 5225 - 5239	en_US
dc.identifier.issn	1536-1276	en_US
dc.identifier.uri	http://hdl.handle.net/10453/43554
dc.description.abstract	© 2015 IEEE. We propose and design a practical modulation-coded (MC) physical-layer network coding (PNC) scheme to approach the capacity limits of Gaussian and fading two-way relay channels (TWRCs). In the proposed scheme, an irregular repeat-accumulate (IRA) MC over GF(q) with the same random coset is employed at two users, which directly maps the message sequences into coded PAM or QAM symbol sequences. The relay chooses appropriate network coding coefficients and computes the associated finite-field linear combinations of the two users' message sequences using an iterative belief propagation algorithm. For a symmetric Gaussian TWRC, we show that, by introducing the same random coset vector at the two users and a time-varying accumulator in the IRA code, the MC-PNC scheme exhibits symmetry and permutation-invariant properties for the soft information distribution of the network-coded message sequence (NCMS). We explore these properties in analyzing the convergence behavior of the scheme and optimizing the MC to approach the capacity limit of a TWRC. For a block fading TWRC, we present a new MC linear PNC scheme and an algorithm used at the relay for computing the NCMS. We demonstrate that our developed schemes achieve near-capacity performance in both Gaussian and Rayleigh fading TWRCs. For example, our designed codes over GF(7) and GF(3) with a code rate of 3/4 are within 1 and 1.2 dB of the TWRC capacity, respectively. Our method can be regarded as a practical embodiment of the notion of compute-and-forward with a good nested lattice code, and it can be applied to a wide range of network configurations.	en_US
dc.relation.ispartof	IEEE Transactions on Wireless Communications	en_US
dc.relation.isbasedon	10.1109/TWC.2015.2434874	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Achieving the Near-Capacity of Two-Way Relay Channels With Modulation-Coded Physical-Layer Network Coding	en_US
dc.type	Journal Article
utslib.citation.volume	9	en_US
utslib.citation.volume	14	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.issue	9	en_US
pubs.publication-status	Published	en_US
pubs.volume	14	en_US

Abstract:

© 2015 IEEE. We propose and design a practical modulation-coded (MC) physical-layer network coding (PNC) scheme to approach the capacity limits of Gaussian and fading two-way relay channels (TWRCs). In the proposed scheme, an irregular repeat-accumulate (IRA) MC over GF(q) with the same random coset is employed at two users, which directly maps the message sequences into coded PAM or QAM symbol sequences. The relay chooses appropriate network coding coefficients and computes the associated finite-field linear combinations of the two users' message sequences using an iterative belief propagation algorithm. For a symmetric Gaussian TWRC, we show that, by introducing the same random coset vector at the two users and a time-varying accumulator in the IRA code, the MC-PNC scheme exhibits symmetry and permutation-invariant properties for the soft information distribution of the network-coded message sequence (NCMS). We explore these properties in analyzing the convergence behavior of the scheme and optimizing the MC to approach the capacity limit of a TWRC. For a block fading TWRC, we present a new MC linear PNC scheme and an algorithm used at the relay for computing the NCMS. We demonstrate that our developed schemes achieve near-capacity performance in both Gaussian and Rayleigh fading TWRCs. For example, our designed codes over GF(7) and GF(3) with a code rate of 3/4 are within 1 and 1.2 dB of the TWRC capacity, respectively. Our method can be regarded as a practical embodiment of the notion of compute-and-forward with a good nested lattice code, and it can be applied to a wide range of network configurations.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/39560