ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network

Singhvi, S and Gayathri, R and Kumar, PV (2022) Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. In: 2022 IEEE International Symposium on Information Theory, ISIT 2022, 26 June - 1 July 2022, Espoo, pp. 1957-1962.

IEEE_ISIT_2022.pdf - Published Version

Download (1MB) | Preview
Official URL: https://doi.org/10.1109/ISIT50566.2022.9834645


In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packets to the destination via the relay. The three-node D&F relay network is constrained by a decoding delay of T packets, i.e., the packet transmitted by the source at time i must be decoded by the destination by time i + T. For the individual channels from source to relay and relay to destination, we assume a delay-constrained sliding-window (DCSW) based packet-erasure model that can be viewed as a tractable approximation to the commonly-accepted Gilbert-Elliot channel model. Under the model, any time-window of width w contains either up to a random erasures or else erasure burst of length at most b (≥ a). Thus the source-relay and relay-destination channels are modelled as (a1, b1, w1, T1) and (a2, b2, w2, T2) DCSW channels. We first derive an upper bound on the capacity of the three-node D&F relay network. We then show that the upper bound is tight for the parameter regime: max{b1, b2} | (T - b1 - b2 - max {a1, a2} + 1) by constructing streaming codes achieving the bound. The code construction requires field size linear in T , and has decoding complexity equivalent to that of decoding an MDS code.

Item Type: Conference Paper
Publication: IEEE International Symposium on Information Theory - Proceedings
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright for this article belongs to the Authors.
Keywords: Decoding; Relay control systems, Decode-and-forward; Decode-and-forward relay; Decoding delay; Gilbert-Elliot channel model; Parameter regimes; Relay network; Sliding Window; Sliding window-based; Time windows; Upper Bound, Network coding
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 15 Sep 2022 09:18
Last Modified: 15 Sep 2022 09:18
URI: https://eprints.iisc.ac.in/id/eprint/76476

Actions (login required)

View Item View Item