A Non-Orthogonal Multiple-Access Scheme Using Reliable Physical-Layer Network Coding and Cascade-Computation Decoding

Yang, T; Yang, L; Guo, YJ; Yuan, J

A Non-Orthogonal Multiple-Access Scheme Using Reliable Physical-Layer Network Coding and Cascade-Computation Decoding

Yang, T

Yang, L Guo, YJ

Yuan, J

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Wireless Communications, 2017, 16 (3), pp. 1633 - 1645
Issue Date:: 2017-03-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (4.73 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Yang, T https://orcid.org/0000-0002-9870-6866	en_US
dc.contributor.author	Yang, L	en_US
dc.contributor.author	Guo, YJ https://orcid.org/0000-0001-6008-9682	en_US
dc.contributor.author	Yuan, J	en_US
dc.date.issued	2017-03-01	en_US
dc.identifier.citation	IEEE Transactions on Wireless Communications, 2017, 16 (3), pp. 1633 - 1645	en_US
dc.identifier.issn	1536-1276	en_US
dc.identifier.uri	http://hdl.handle.net/10453/73224
dc.description.abstract	© 2017 IEEE. This paper studies non-orthogonal transmission over a K -user fading multiple access channel. We propose a new reliable physical-layer network coding and cascade-computation decoding scheme. In the proposed scheme, K single-antenna users encode their messages by the same practical channel code and QAM modulation, and transmit simultaneously. The receiver chooses K linear coefficient vectors and computes the associated K layers of finite-field linear message combinations in a cascade manner. Finally, the K users' messages are recovered by solving the K linear equations. The proposed can be regarded as a generalized onion peeling. We study the optimal network coding coefficient vectors used in the cascade computation. Numerical results show the performance of the proposed approaches that of the iterative maximum a posteriori probability detection and decoding scheme, but without using receiver iteration. This results in considerable complexity reduction, processing delay, and easier implementation. Our proposed scheme significantly outperforms the iterative detection and decoding scheme with a single iteration, for example, by 1.7 dB for the two user case. The proposed scheme provides a competitive solution for non-orthogonal multiple access.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150100636
dc.relation.ispartof	IEEE Transactions on Wireless Communications	en_US
dc.relation.isbasedon	10.1109/TWC.2017.2650900	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	A Non-Orthogonal Multiple-Access Scheme Using Reliable Physical-Layer Network Coding and Cascade-Computation Decoding	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	16	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	open_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	16	en_US

Abstract:

© 2017 IEEE. This paper studies non-orthogonal transmission over a K -user fading multiple access channel. We propose a new reliable physical-layer network coding and cascade-computation decoding scheme. In the proposed scheme, K single-antenna users encode their messages by the same practical channel code and QAM modulation, and transmit simultaneously. The receiver chooses K linear coefficient vectors and computes the associated K layers of finite-field linear message combinations in a cascade manner. Finally, the K users' messages are recovered by solving the K linear equations. The proposed can be regarded as a generalized onion peeling. We study the optimal network coding coefficient vectors used in the cascade computation. Numerical results show the performance of the proposed approaches that of the iterative maximum a posteriori probability detection and decoding scheme, but without using receiver iteration. This results in considerable complexity reduction, processing delay, and easier implementation. Our proposed scheme significantly outperforms the iterative detection and decoding scheme with a single iteration, for example, by 1.7 dB for the two user case. The proposed scheme provides a competitive solution for non-orthogonal multiple access.

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

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