Real-time coding of Gauss-Markov sources over burst erasure channels

We study real-time coding of Gauss-Markov sources over burst-erasure channels. A time-invariant encoder sequentially compresses a sequence of vector Gaussian sources, which are spatially i.i.d. and temporally correlated according to a Gauss-Markov model. The channel is a burst erasure channel that e...

Full description

Saved in:
Bibliographic Details
Main Authors: Etezadi, F., Khisti, A.
Format: Conference Proceeding
Language:English
Subjects:
Decoding
Encoding
Entropy
Markov processes
Real-time systems
Steady-state
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2044
container_issue
container_start_page 2037
container_title
container_volume
creator Etezadi, F.
Khisti, A.
description We study real-time coding of Gauss-Markov sources over burst-erasure channels. A time-invariant encoder sequentially compresses a sequence of vector Gaussian sources, which are spatially i.i.d. and temporally correlated according to a Gauss-Markov model. The channel is a burst erasure channel that erases up to B packets in a single burst. The decoder is interested in instantaneously reconstructing all the source sequences within a quadratic (mean square error) distortion D, except for packets lost in the erasure burst window. We study the minimum achievable rate for the encoder under these constraints and define it as the lossy rate-recovery function R(B, D). We develop lower and upper bounds for the function and observe that the bounds coincide in the high resolution limit. Numerical comparisons indicate that the proposed joint source-channel coding scheme provides significant gains over a separation based scheme.
doi_str_mv 10.1109/Allerton.2012.6483473
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6483473</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6483473</ieee_id><sourcerecordid>6483473</sourcerecordid><originalsourceid>FETCH-LOGICAL-i222t-41634d0a5ee6006c8598a3ee8e0b4c47bf6468da5810128c1014f352a88d304b3</originalsourceid><addsrcrecordid>eNpVj81Kw0AUhUdEUGqeQIR5gcT5uZncLEvVKlQE0XW5SW40mmZkJin07RuwGzfncBbng0-IW60yrVV5t-x7DqMfMqO0yRyghcKeiaQsUIMrLOS2NOf_doGXIonxWyk1I5wGvBL3b0x9OnY7lrVvuuFT-lauaYoxfaHw4_cy-inUHKXfc5DVFOIoOVCcwvz4omHgPl6Li5b6yMmpF-Lj8eF99ZRuXtfPq-Um7YwxYwraWWgU5cxOKVdjXiJZZmRVQQ1F1Tpw2FCOenbCek5obW4IsbEKKrsQN3_cjpm3v6HbUThsT-72CNn6Tcg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Real-time coding of Gauss-Markov sources over burst erasure channels</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Etezadi, F. ; Khisti, A.</creator><creatorcontrib>Etezadi, F. ; Khisti, A.</creatorcontrib><description>We study real-time coding of Gauss-Markov sources over burst-erasure channels. A time-invariant encoder sequentially compresses a sequence of vector Gaussian sources, which are spatially i.i.d. and temporally correlated according to a Gauss-Markov model. The channel is a burst erasure channel that erases up to B packets in a single burst. The decoder is interested in instantaneously reconstructing all the source sequences within a quadratic (mean square error) distortion D, except for packets lost in the erasure burst window. We study the minimum achievable rate for the encoder under these constraints and define it as the lossy rate-recovery function R(B, D). We develop lower and upper bounds for the function and observe that the bounds coincide in the high resolution limit. Numerical comparisons indicate that the proposed joint source-channel coding scheme provides significant gains over a separation based scheme.</description><identifier>ISBN: 9781467345378</identifier><identifier>ISBN: 1467345377</identifier><identifier>EISBN: 9781467345392</identifier><identifier>EISBN: 1467345385</identifier><identifier>EISBN: 9781467345385</identifier><identifier>EISBN: 1467345393</identifier><identifier>DOI: 10.1109/Allerton.2012.6483473</identifier><language>eng</language><publisher>IEEE</publisher><subject>Decoding ; Encoding ; Entropy ; Markov processes ; Real-time systems ; Steady-state ; Upper bound</subject><ispartof>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012, p.2037-2044</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6483473$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6483473$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Etezadi, F.</creatorcontrib><creatorcontrib>Khisti, A.</creatorcontrib><title>Real-time coding of Gauss-Markov sources over burst erasure channels</title><title>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</title><addtitle>Allerton</addtitle><description>We study real-time coding of Gauss-Markov sources over burst-erasure channels. A time-invariant encoder sequentially compresses a sequence of vector Gaussian sources, which are spatially i.i.d. and temporally correlated according to a Gauss-Markov model. The channel is a burst erasure channel that erases up to B packets in a single burst. The decoder is interested in instantaneously reconstructing all the source sequences within a quadratic (mean square error) distortion D, except for packets lost in the erasure burst window. We study the minimum achievable rate for the encoder under these constraints and define it as the lossy rate-recovery function R(B, D). We develop lower and upper bounds for the function and observe that the bounds coincide in the high resolution limit. Numerical comparisons indicate that the proposed joint source-channel coding scheme provides significant gains over a separation based scheme.</description><subject>Decoding</subject><subject>Encoding</subject><subject>Entropy</subject><subject>Markov processes</subject><subject>Real-time systems</subject><subject>Steady-state</subject><subject>Upper bound</subject><isbn>9781467345378</isbn><isbn>1467345377</isbn><isbn>9781467345392</isbn><isbn>1467345385</isbn><isbn>9781467345385</isbn><isbn>1467345393</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVj81Kw0AUhUdEUGqeQIR5gcT5uZncLEvVKlQE0XW5SW40mmZkJin07RuwGzfncBbng0-IW60yrVV5t-x7DqMfMqO0yRyghcKeiaQsUIMrLOS2NOf_doGXIonxWyk1I5wGvBL3b0x9OnY7lrVvuuFT-lauaYoxfaHw4_cy-inUHKXfc5DVFOIoOVCcwvz4omHgPl6Li5b6yMmpF-Lj8eF99ZRuXtfPq-Um7YwxYwraWWgU5cxOKVdjXiJZZmRVQQ1F1Tpw2FCOenbCek5obW4IsbEKKrsQN3_cjpm3v6HbUThsT-72CNn6Tcg</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Etezadi, F.</creator><creator>Khisti, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20120101</creationdate><title>Real-time coding of Gauss-Markov sources over burst erasure channels</title><author>Etezadi, F. ; Khisti, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i222t-41634d0a5ee6006c8598a3ee8e0b4c47bf6468da5810128c1014f352a88d304b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Decoding</topic><topic>Encoding</topic><topic>Entropy</topic><topic>Markov processes</topic><topic>Real-time systems</topic><topic>Steady-state</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Etezadi, F.</creatorcontrib><creatorcontrib>Khisti, A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (IEEE/IET Electronic Library - IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Etezadi, F.</au><au>Khisti, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Real-time coding of Gauss-Markov sources over burst erasure channels</atitle><btitle>2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</btitle><stitle>Allerton</stitle><date>2012-01-01</date><risdate>2012</risdate><spage>2037</spage><epage>2044</epage><pages>2037-2044</pages><isbn>9781467345378</isbn><isbn>1467345377</isbn><eisbn>9781467345392</eisbn><eisbn>1467345385</eisbn><eisbn>9781467345385</eisbn><eisbn>1467345393</eisbn><abstract>We study real-time coding of Gauss-Markov sources over burst-erasure channels. A time-invariant encoder sequentially compresses a sequence of vector Gaussian sources, which are spatially i.i.d. and temporally correlated according to a Gauss-Markov model. The channel is a burst erasure channel that erases up to B packets in a single burst. The decoder is interested in instantaneously reconstructing all the source sequences within a quadratic (mean square error) distortion D, except for packets lost in the erasure burst window. We study the minimum achievable rate for the encoder under these constraints and define it as the lossy rate-recovery function R(B, D). We develop lower and upper bounds for the function and observe that the bounds coincide in the high resolution limit. Numerical comparisons indicate that the proposed joint source-channel coding scheme provides significant gains over a separation based scheme.</abstract><pub>IEEE</pub><doi>10.1109/Allerton.2012.6483473</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781467345378
ispartof 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012, p.2037-2044
issn
language eng
recordid cdi_ieee_primary_6483473
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Decoding
Encoding
Entropy
Markov processes
Real-time systems
Steady-state
Upper bound
title Real-time coding of Gauss-Markov sources over burst erasure channels
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T17%3A17%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Real-time%20coding%20of%20Gauss-Markov%20sources%20over%20burst%20erasure%20channels&rft.btitle=2012%2050th%20Annual%20Allerton%20Conference%20on%20Communication,%20Control,%20and%20Computing%20(Allerton)&rft.au=Etezadi,%20F.&rft.date=2012-01-01&rft.spage=2037&rft.epage=2044&rft.pages=2037-2044&rft.isbn=9781467345378&rft.isbn_list=1467345377&rft_id=info:doi/10.1109/Allerton.2012.6483473&rft.eisbn=9781467345392&rft.eisbn_list=1467345385&rft.eisbn_list=9781467345385&rft.eisbn_list=1467345393&rft_dat=%3Cieee_6IE%3E6483473%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i222t-41634d0a5ee6006c8598a3ee8e0b4c47bf6468da5810128c1014f352a88d304b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6483473&rfr_iscdi=true