Short-Message Noisy Network Coding with Partial Source Cooperation
2012 (English)In: Information Theory Workshop (ITW), 2012 IEEE, IEEE conference proceedings, 2012, 144-147 p.Conference paper (Refereed)
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.
Capacity Theorems, Relay, Channel
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-98095DOI: 10.1109/ITW.2012.6404644ISI: 000313526400031ScopusID: 2-s2.0-84873206347ISBN: 978-1-4673-0223-4OAI: oai:DiVA.org:kth-98095DiVA: diva2:535388
IEEE Information Theory Workshop, ITW 2012; Lausanne; 3 September 2012 through 7 September 2012
FunderICT - The Next Generation
QC 201212182012-06-192012-06-192014-07-03Bibliographically approved