Communications overhead as the cost of constraints
This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the "non-data" portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 369 |
|---|---|
| container_issue | |
| container_start_page | 365 |
| container_title | |
| container_volume | |
| creator | Laneman, J. N. Dunn, B. P. |
| description | This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the "non-data" portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can be used to obtain fundamental limits on overhead information, and multiple constraints lead to an intriguing chain rule for overhead. In principle, protocol overhead in practical implementations can then be benchmarked against these fundamental limits in order to identify opportunities for improvement. Several examples are discussed within this developing framework. |
| doi_str_mv | 10.1109/ITW.2011.6089481 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6089481</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6089481</ieee_id><sourcerecordid>6089481</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-fe3758a203487b0de46e7ede295e8adc338ccfe65ff60257efc84949fc5953103</originalsourceid><addsrcrecordid>eNpVj81KAzEYRSNSUOrsBTd5gRm__CdLGfwpFLqpdFli5guNOBOZRMG3d8BuvJvD3RzuJeSWQccYuPvN_tBxYKzTYJ207II0zlgmlTEghdGX_7oVV6Qp5R2WaO0Eg2vC-zyOX1MKvqY8FZq_cT6hH6gvtJ6QhlwqzXHhVOrs01TLDVlF_1GwOXNNXp8e9_1Lu909b_qHbZuYUbWNKIyynoOQ1rzBgFKjwQG5U2j9EISwIUTUKkYNXBmMwUonXQzKqWWbWJO7P29CxOPnnEY__xzPT8Uv2xJGQg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Communications overhead as the cost of constraints</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Laneman, J. N. ; Dunn, B. P.</creator><creatorcontrib>Laneman, J. N. ; Dunn, B. P.</creatorcontrib><description>This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the "non-data" portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can be used to obtain fundamental limits on overhead information, and multiple constraints lead to an intriguing chain rule for overhead. In principle, protocol overhead in practical implementations can then be benchmarked against these fundamental limits in order to identify opportunities for improvement. Several examples are discussed within this developing framework.</description><identifier>ISBN: 9781457704383</identifier><identifier>ISBN: 1457704382</identifier><identifier>EISBN: 9781457704376</identifier><identifier>EISBN: 1457704374</identifier><identifier>EISBN: 1457704366</identifier><identifier>EISBN: 9781457704369</identifier><identifier>DOI: 10.1109/ITW.2011.6089481</identifier><language>eng</language><publisher>IEEE</publisher><subject>AWGN channels ; Binary phase shift keying ; Channel capacity ; Encoding ; Maximum likelihood decoding ; Protocols</subject><ispartof>2011 IEEE Information Theory Workshop, 2011, p.365-369</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6089481$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6089481$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Laneman, J. N.</creatorcontrib><creatorcontrib>Dunn, B. P.</creatorcontrib><title>Communications overhead as the cost of constraints</title><title>2011 IEEE Information Theory Workshop</title><addtitle>ITW</addtitle><description>This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the "non-data" portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can be used to obtain fundamental limits on overhead information, and multiple constraints lead to an intriguing chain rule for overhead. In principle, protocol overhead in practical implementations can then be benchmarked against these fundamental limits in order to identify opportunities for improvement. Several examples are discussed within this developing framework.</description><subject>AWGN channels</subject><subject>Binary phase shift keying</subject><subject>Channel capacity</subject><subject>Encoding</subject><subject>Maximum likelihood decoding</subject><subject>Protocols</subject><isbn>9781457704383</isbn><isbn>1457704382</isbn><isbn>9781457704376</isbn><isbn>1457704374</isbn><isbn>1457704366</isbn><isbn>9781457704369</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVj81KAzEYRSNSUOrsBTd5gRm__CdLGfwpFLqpdFli5guNOBOZRMG3d8BuvJvD3RzuJeSWQccYuPvN_tBxYKzTYJ207II0zlgmlTEghdGX_7oVV6Qp5R2WaO0Eg2vC-zyOX1MKvqY8FZq_cT6hH6gvtJ6QhlwqzXHhVOrs01TLDVlF_1GwOXNNXp8e9_1Lu909b_qHbZuYUbWNKIyynoOQ1rzBgFKjwQG5U2j9EISwIUTUKkYNXBmMwUonXQzKqWWbWJO7P29CxOPnnEY__xzPT8Uv2xJGQg</recordid><startdate>201110</startdate><enddate>201110</enddate><creator>Laneman, J. N.</creator><creator>Dunn, B. P.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201110</creationdate><title>Communications overhead as the cost of constraints</title><author>Laneman, J. N. ; Dunn, B. P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-fe3758a203487b0de46e7ede295e8adc338ccfe65ff60257efc84949fc5953103</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>AWGN channels</topic><topic>Binary phase shift keying</topic><topic>Channel capacity</topic><topic>Encoding</topic><topic>Maximum likelihood decoding</topic><topic>Protocols</topic><toplevel>online_resources</toplevel><creatorcontrib>Laneman, J. N.</creatorcontrib><creatorcontrib>Dunn, B. P.</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</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>Laneman, J. N.</au><au>Dunn, B. P.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Communications overhead as the cost of constraints</atitle><btitle>2011 IEEE Information Theory Workshop</btitle><stitle>ITW</stitle><date>2011-10</date><risdate>2011</risdate><spage>365</spage><epage>369</epage><pages>365-369</pages><isbn>9781457704383</isbn><isbn>1457704382</isbn><eisbn>9781457704376</eisbn><eisbn>1457704374</eisbn><eisbn>1457704366</eisbn><eisbn>9781457704369</eisbn><abstract>This paper speculates on a perspective for studying overhead in communication systems that contrasts the traditional viewpoint that overhead is the "non-data" portion of transmissions. By viewing overhead as the cost of constraints imposed on a system, information-theoretic techniques can be used to obtain fundamental limits on overhead information, and multiple constraints lead to an intriguing chain rule for overhead. In principle, protocol overhead in practical implementations can then be benchmarked against these fundamental limits in order to identify opportunities for improvement. Several examples are discussed within this developing framework.</abstract><pub>IEEE</pub><doi>10.1109/ITW.2011.6089481</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781457704383 |
| ispartof | 2011 IEEE Information Theory Workshop, 2011, p.365-369 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6089481 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | AWGN channels Binary phase shift keying Channel capacity Encoding Maximum likelihood decoding Protocols |
| title | Communications overhead as the cost of constraints |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T04%3A11%3A10IST&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=Communications%20overhead%20as%20the%20cost%20of%20constraints&rft.btitle=2011%20IEEE%20Information%20Theory%20Workshop&rft.au=Laneman,%20J.%20N.&rft.date=2011-10&rft.spage=365&rft.epage=369&rft.pages=365-369&rft.isbn=9781457704383&rft.isbn_list=1457704382&rft_id=info:doi/10.1109/ITW.2011.6089481&rft_dat=%3Cieee_6IE%3E6089481%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781457704376&rft.eisbn_list=1457704374&rft.eisbn_list=1457704366&rft.eisbn_list=9781457704369&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6089481&rfr_iscdi=true |