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
On network coding with finite channel state information
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.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
2011 (English)In: 2011 8th International Symposium on Wireless Communication Systems (ISWCS), IEEE , 2011, 487-491 p.Conference paper, Published paper (Refereed)
Abstract [en]

We study network coding for wireless networks with finite channel state information (CSI) at intermediate nodes (relays). Based on the CSI of the relay-sink channels, we adapt the network codes at the relays. For a specific network with two sources, four relays and two sinks, the analytic results show that one bit CSI of all relay-sink channels (global CSI) can reduce complexity (field size), and simultaneously decrease the erasure probability. Then, we generalize the results to relay networks with M users, N relays and J sinks. We show that fixed network codes without CSI cannot achieve instantaneous min-cut, i.e., min-cut under current channel state. We also show that with one bit global CSI, we can achieve instantaneous min-cut by adapting the network codes using an alphabet size L, where L is the number of sinks connecting to a relay. Yet, the fixed MDS network codes use an alphabet size L(M-1N-1). For the networks with perfect or imperfect source-relay channels, adaptive network codes with one bit global CSI have lower erasure probability than the codes without CSI. Thus, one bit global CSI can reduce the erasure probability, and simultaneously reduce coding complexity.

Place, publisher, year, edition, pages
IEEE , 2011. 487-491 p.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-70117DOI: 10.1109/ISWCS.2011.6125407Scopus ID: 2-s2.0-84857468641ISBN: 978-1-61284-403-9 (print)OAI: oai:DiVA.org:kth-70117DiVA: diva2:485908
Conference
2011 8th International Symposium on Wireless Communication Systems (ISWCS). Aachen. 6-9 Nov. 2011
Note
QC 20120416Available from: 2012-01-30 Created: 2012-01-30 Last updated: 2012-04-16Bibliographically 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
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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