Delay-exponent of decode-forward streaming
2013 (English)In: IEEE International Symposium on Information Theory: Proceedings, 2013, 2805-2809 p.Conference paper (Refereed)
We propose a decode-forward protocol for streaming over a relay network using sequential random tree codes. An achievable bound on the end-to-end error performance is derived. The bound is parameterised by the number of errors occuring at the relay, which is the sum of correlated Bernoulli processes. The bound is useful for determining the achievable delay-exponent as well as for designing finite-delay relaying schemes. For a wide range of conjectured correlation models, the proposed scheme can achieve the delay-exponent of full source-relay cooperation.
Place, publisher, year, edition, pages
2013. 2805-2809 p.
, IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
Decode-forward relaying, delay, Gallager error-exponent, sequential random codes, streaming
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-139147DOI: 10.1109/ISIT.2013.6620737ScopusID: 2-s2.0-84890354876ISBN: 9781479904464OAI: oai:DiVA.org:kth-139147DiVA: diva2:684804
2013 IEEE International Symposium on Information Theory, ISIT 2013; Istanbul, Turkey, 7 July-12 July 2013
QC 201401082014-01-082014-01-072014-01-23Bibliographically approved