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
M-user Cooperative Wireless Communications Based on Nonbinary Network Codes
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2009 (English)In: ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY, NEW YORK: IEEE , 2009, 316-320 p.Conference paper, Published paper (Refereed)
Abstract [en]

We propose a new method of applying network coding for cooperative wireless networks. The network consists of multiple (M >= 2) users having independent information to be transmitted to a common base station (BS). These users form partners and relay information for each other. The transmission blocks are subject to block-fading with independent fading coefficients for each block. Designed non-binary network codes over finite fields are used on top of channel codes. Assuming perfect error detection, erroneous blocks out from channel decoders are discarded (erasure). Thus, relaying nodes may not have information messages of some partners (erasure in inter-user channels), and the BS may not decode some blocks correctly either. The network topology from the point of view of network coding is dynamic. To improve performance, we propose dynamic-network codes (deterministic codes for dynamic networks) for the cooperative networks. The codes are designed such that the BS can rebuild user information from a minimum possible set of coding blocks. In this sense, dynamic-network codes achieve the min-cut for cooperative networks with a dynamic topology. For block fading channels, the proposed scheme obtains high asymptotic performance. For two-user networks, we calculate the resulting outage probabilities. We also present simulations with specific channel codes. Numerical results show substantial improvement over previous schemes. Then, we generalize the results to multiple-user (M > 2) networks. We investigate the existence of deterministic dynamic-network codes for multiple-user networks, and show that the diversity order of the proposed scheme can achieve 2M - 1.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 316-320 p.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-30220DOI: 10.1109/ITWNIT.2009.5158594ISI: 000273966100066Scopus ID: 2-s2.0-77950662951ISBN: 978-1-4244-4535-6 (print)OAI: oai:DiVA.org:kth-30220DiVA: diva2:399063
Conference
IEEE Information Theory Workshop on Networking and Information Theory Volos, GREECE, JUN 10-12, 2009
Note
QC 20110221Available from: 2011-02-21 Created: 2011-02-21 Last updated: 2011-02-21Bibliographically 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
ACCESS Linnaeus CentreCommunication Theory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 41 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