Joint design of channel and network coding for star networks connected by binary symmetric channels

In a network application, channel coding alone is not sufficient to reliably transmit a message of finite length K from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, suc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2014-01, Vol.62 (1), p.158-169
Main Authors: Koller, Christian, Haenggi, Martin, Kliewer, Jorg, Costello, Daniel J.
Format: Article
Language:English
Subjects:
and joint channel and network coding
Applied sciences
Automatic repeat request
Blocking
Channels
Coding
Coding, codes
Encoding
Exact sciences and technology
Information, signal and communications theory
Mathematical analysis
Messages
Multiple access
Network coding
Networks
Random linear network coding
Relays
Signal and communications theory
star networks
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Throughput
Time Division Multiple Access
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a network application, channel coding alone is not sufficient to reliably transmit a message of finite length K from a source to one or more destinations as in, e.g., file transfer. To ensure that no data is lost, it must be combined with rateless erasure correcting schemes on a higher layer, such as a time-division multiple access (TDMA) system paired with automatic repeat request (ARQ) or random linear network coding (RLNC). We consider binary channel coding on a binary symmetric channel (BSC) and q-ary RLNC for erasure correction in a star network, where Y sources send messages to each other with the help of a central relay. In this scenario RLNC has been shown to have a throughput advantage over TDMA schemes as K→∞ and q→∞. In this paper we focus on finite block lengths and compare the expected throughputs of RLNC and TDMA. For a total message length of K bits, which can be subdivided into blocks of smaller size prior to channel coding, we obtain the channel code rate and the number of blocks that maximize the expected throughput of both RLNC and TDMA, and we find that TDMA is more throughput-efficient for small message lengths K and small q.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.110413.120971