Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Short-Message Noisy Network Coding with Partial Source Cooperation
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (Communication Theory)ORCID iD: 0000-0002-9709-0713
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (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. (Communication Theory)ORCID iD: 0000-0002-7926-5081
Technion - Israel Institute of Technology. (Department of Electrical Engineering)
2012 (English)In: Information Theory Workshop (ITW), 2012 IEEE, IEEE conference proceedings, 2012, 144-147 p.Conference paper, Published paper (Refereed)
Abstract [en]

Noisy network coding (NNC) has been shown to outperform standard compress-and-forward (CF) in networks with multiple relays and/or multiple destinations. Recently, short-message noisy network coding (SNNC) has been proved to achieve the same rate region as NNC for independent sources but with significantly reduced encoding delay and decoding complexity. In this paper, we show that when partial cooperation between source nodes is possible, by performing rate-splitting, message exchange, and superposition coding with proper power allocation at the source nodes, SNNC can achieve a strictly larger rate region than NNC. The gain comes from coherent combining at all the receiving nodes.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2012. 144-147 p.
Keyword [en]
Capacity Theorems, Relay, Channel
National Category
Telecommunications
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-98095DOI: 10.1109/ITW.2012.6404644ISI: 000313526400031Scopus ID: 2-s2.0-84873206347ISBN: 978-1-4673-0223-4 (print)OAI: oai:DiVA.org:kth-98095DiVA: diva2:535388
Conference
IEEE Information Theory Workshop, ITW 2012; Lausanne; 3 September 2012 through 7 September 2012
Funder
ICT - The Next Generation
Note

QC 20121218

Available from: 2012-06-19 Created: 2012-06-19 Last updated: 2014-07-03Bibliographically approved

Open Access in DiVA

SNNC12(272 kB)103 downloads
File information
File name FULLTEXT01.pdfFile size 272 kBChecksum SHA-512
771af15d77c4d443024211589e6ab38db521fb2d8e1a08918cbce40ebb8c670df0db36530edce17e763261fc69c341fc7edd7fa6dcdaa4a084ee2a152d9d25fd
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusLink to articleIEEEXplore

Authority records BETA

Du, JinfengXiao, MingSkoglund, Mikael

Search in DiVA

By author/editor
Du, JinfengXiao, MingSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 103 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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