Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Design of network codes for multiple-user multiple-relay wireless networks
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
the Klipsch School of Electrical and Computer Engineering, New Mexico State University, U.S.A.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2012 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 60, no 12, 3755-3766 p.Article in journal (Refereed) Published
Abstract [en]

We investigate the design of network codes for multiple-user multiple-relay (MUMR) wireless networks with slow fading (quasi-static) channels. In these networks, M users have independent information to be transmitted to a common base station (BS) with the help of N relays, where M ≥ 2 and N ≥ 1 are arbitrary integers. We investigate such networks in terms of diversity order to measure asymptotic performance. For networks with orthogonal channels, we show that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N+1. We further show that the MDS coding construction of network codes is also necessary to obtain full diversity for linear finite field network coding (FFNC). Then, we compare the performance of the FFNC approach with superposition coding (SC) at the relays. The results show that the FFNC based on MDS codes has better performance than SC in both the high rate and the high SNR regime. Further, we discuss networks without direct source-to-BS channels for N ≥ M. We show that the proposed FFNC can obtain the diversity order N-M+1, which is equivalent to achieving the Singleton bound for network error-correction codes. Finally, we study the network with nonorthogonal channels and show our codes can still achieve a diversity order of N+1, which cannot be achieved by a scheme based on SC.

Place, publisher, year, edition, pages
2012. Vol. 60, no 12, 3755-3766 p.
Keyword [en]
diversity order, finite field, MDS codes, Network coding, relay
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-103349DOI: 10.1109/TCOMM.2012.091012.110121ISI: 000312833300024Scopus ID: 2-s2.0-84871659603OAI: oai:DiVA.org:kth-103349DiVA: diva2:559869
Funder
Swedish Research CouncilVinnova
Note

QC 20130116

Available from: 2012-10-10 Created: 2012-10-10 Last updated: 2017-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, MingSkoglund, Mikael

Search in DiVA

By author/editor
Xiao, MingSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Communications
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 112 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf