Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources
We study the transmission of a set of correlated sources (U 1 , . . . , U K ) over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞, while th...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2016-01, Vol.62 (1), p.309-321 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 321 |
|---|---|
| container_issue | 1 |
| container_start_page | 309 |
| container_title | IEEE transactions on information theory |
| container_volume | 62 |
| creator | Ebrahimzadeh Saffar, Hamidreza Badiei Khuzani, Masoud Mitran, Patrick |
| description | We study the transmission of a set of correlated sources (U 1 , . . . , U K ) over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞, while the relative ratio d max (n)/n of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem and under specific gain conditions, we derive necessary and sufficient conditions for reliable communications and show that separate source and channel coding achieves optimal performance. In particular, we first derive a general outer bound on the source entropy content for all channel gains as our main result. Then, using Slepian-Wolf source coding combined with the channel coding scheme on top of block Markov coding, we show that the thus achieved inner bound matches the outer bound. As a corollary, we also address the problem of sending a pair of correlated sources over a two-user interference channel in the same context. |
| doi_str_mv | 10.1109/TIT.2015.2495136 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1753528236</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7308056</ieee_id><sourcerecordid>1793242003</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-993229683756b00e2030fa21c51996237ee99c22ba695e20d4ac921641666b033</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWKt3wUvAi5etmXzt5liK1kJF0RWPIU2ndMt2tya7h_57UysePA0z87zz8RJyDWwEwMx9OStHnIEacWkUCH1CBqBUnhmt5CkZMAZFZqQszslFjJuUSgV8QF7LaovZOO4bvw5t0_aRTl0fY-Ua-tzXXbWrkY69xxjpG9ZuTydr1zRY08-qW9NJG0Kqdrik720fEnZJzlaujnj1G4fk4_GhnDxl85fpbDKeZ16A6TJjBOdGFyJXesEYcibYynHwCozRXOSIxnjOF04blbpL6bzhoCVonQRCDMndce4utF89xs5uq-ixrl2D6QsLedogOftBb_-hm3Rrk65LlBKKF1zoRLEj5UMbY8CV3YVq68LeArMHi22y2B4str8WJ8nNUVIh4h-eC1YwpcU3UuB07A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1753528236</pqid></control><display><type>article</type><title>Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources</title><source>IEEE Electronic Library (IEL)</source><creator>Ebrahimzadeh Saffar, Hamidreza ; Badiei Khuzani, Masoud ; Mitran, Patrick</creator><creatorcontrib>Ebrahimzadeh Saffar, Hamidreza ; Badiei Khuzani, Masoud ; Mitran, Patrick</creatorcontrib><description>We study the transmission of a set of correlated sources (U 1 , . . . , U K ) over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞, while the relative ratio d max (n)/n of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem and under specific gain conditions, we derive necessary and sufficient conditions for reliable communications and show that separate source and channel coding achieves optimal performance. In particular, we first derive a general outer bound on the source entropy content for all channel gains as our main result. Then, using Slepian-Wolf source coding combined with the channel coding scheme on top of block Markov coding, we show that the thus achieved inner bound matches the outer bound. As a corollary, we also address the problem of sending a pair of correlated sources over a two-user interference channel in the same context.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2015.2495136</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Blocking ; Channels ; Coding ; Coding theory ; correlated sources ; Correlation ; Correlation analysis ; Encoding ; Entropy ; Gain ; Interference channel ; joint source-channel coding ; Multiple access ; Multiple access relay channel ; Multiple access relay channels ; Normal distribution ; Offsets ; Relay ; Relays ; Reliability ; time asynchronism ; Transmitters</subject><ispartof>IEEE transactions on information theory, 2016-01, Vol.62 (1), p.309-321</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c319t-993229683756b00e2030fa21c51996237ee99c22ba695e20d4ac921641666b033</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7308056$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7308056$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ebrahimzadeh Saffar, Hamidreza</creatorcontrib><creatorcontrib>Badiei Khuzani, Masoud</creatorcontrib><creatorcontrib>Mitran, Patrick</creatorcontrib><title>Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We study the transmission of a set of correlated sources (U 1 , . . . , U K ) over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞, while the relative ratio d max (n)/n of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem and under specific gain conditions, we derive necessary and sufficient conditions for reliable communications and show that separate source and channel coding achieves optimal performance. In particular, we first derive a general outer bound on the source entropy content for all channel gains as our main result. Then, using Slepian-Wolf source coding combined with the channel coding scheme on top of block Markov coding, we show that the thus achieved inner bound matches the outer bound. As a corollary, we also address the problem of sending a pair of correlated sources over a two-user interference channel in the same context.</description><subject>Blocking</subject><subject>Channels</subject><subject>Coding</subject><subject>Coding theory</subject><subject>correlated sources</subject><subject>Correlation</subject><subject>Correlation analysis</subject><subject>Encoding</subject><subject>Entropy</subject><subject>Gain</subject><subject>Interference channel</subject><subject>joint source-channel coding</subject><subject>Multiple access</subject><subject>Multiple access relay channel</subject><subject>Multiple access relay channels</subject><subject>Normal distribution</subject><subject>Offsets</subject><subject>Relay</subject><subject>Relays</subject><subject>Reliability</subject><subject>time asynchronism</subject><subject>Transmitters</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE1LAzEQhoMoWKt3wUvAi5etmXzt5liK1kJF0RWPIU2ndMt2tya7h_57UysePA0z87zz8RJyDWwEwMx9OStHnIEacWkUCH1CBqBUnhmt5CkZMAZFZqQszslFjJuUSgV8QF7LaovZOO4bvw5t0_aRTl0fY-Ua-tzXXbWrkY69xxjpG9ZuTydr1zRY08-qW9NJG0Kqdrik720fEnZJzlaujnj1G4fk4_GhnDxl85fpbDKeZ16A6TJjBOdGFyJXesEYcibYynHwCozRXOSIxnjOF04blbpL6bzhoCVonQRCDMndce4utF89xs5uq-ixrl2D6QsLedogOftBb_-hm3Rrk65LlBKKF1zoRLEj5UMbY8CV3YVq68LeArMHi22y2B4str8WJ8nNUVIh4h-eC1YwpcU3UuB07A</recordid><startdate>201601</startdate><enddate>201601</enddate><creator>Ebrahimzadeh Saffar, Hamidreza</creator><creator>Badiei Khuzani, Masoud</creator><creator>Mitran, Patrick</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201601</creationdate><title>Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources</title><author>Ebrahimzadeh Saffar, Hamidreza ; Badiei Khuzani, Masoud ; Mitran, Patrick</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-993229683756b00e2030fa21c51996237ee99c22ba695e20d4ac921641666b033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Blocking</topic><topic>Channels</topic><topic>Coding</topic><topic>Coding theory</topic><topic>correlated sources</topic><topic>Correlation</topic><topic>Correlation analysis</topic><topic>Encoding</topic><topic>Entropy</topic><topic>Gain</topic><topic>Interference channel</topic><topic>joint source-channel coding</topic><topic>Multiple access</topic><topic>Multiple access relay channel</topic><topic>Multiple access relay channels</topic><topic>Normal distribution</topic><topic>Offsets</topic><topic>Relay</topic><topic>Relays</topic><topic>Reliability</topic><topic>time asynchronism</topic><topic>Transmitters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ebrahimzadeh Saffar, Hamidreza</creatorcontrib><creatorcontrib>Badiei Khuzani, Masoud</creatorcontrib><creatorcontrib>Mitran, Patrick</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ebrahimzadeh Saffar, Hamidreza</au><au>Badiei Khuzani, Masoud</au><au>Mitran, Patrick</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2016-01</date><risdate>2016</risdate><volume>62</volume><issue>1</issue><spage>309</spage><epage>321</epage><pages>309-321</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We study the transmission of a set of correlated sources (U 1 , . . . , U K ) over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset dmax(n) between the transmitters grows without bound as the block length n → ∞, while the relative ratio d max (n)/n of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem and under specific gain conditions, we derive necessary and sufficient conditions for reliable communications and show that separate source and channel coding achieves optimal performance. In particular, we first derive a general outer bound on the source entropy content for all channel gains as our main result. Then, using Slepian-Wolf source coding combined with the channel coding scheme on top of block Markov coding, we show that the thus achieved inner bound matches the outer bound. As a corollary, we also address the problem of sending a pair of correlated sources over a two-user interference channel in the same context.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2015.2495136</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2016-01, Vol.62 (1), p.309-321 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_journals_1753528236 |
| source | IEEE Electronic Library (IEL) |
| subjects | Blocking Channels Coding Coding theory correlated sources Correlation Correlation analysis Encoding Entropy Gain Interference channel joint source-channel coding Multiple access Multiple access relay channel Multiple access relay channels Normal distribution Offsets Relay Relays Reliability time asynchronism Transmitters |
| title | Time-Asynchronous Gaussian Multiple Access Relay Channel With Correlated Sources |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T01%3A23%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Time-Asynchronous%20Gaussian%20Multiple%20Access%20Relay%20Channel%20With%20Correlated%20Sources&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Ebrahimzadeh%20Saffar,%20Hamidreza&rft.date=2016-01&rft.volume=62&rft.issue=1&rft.spage=309&rft.epage=321&rft.pages=309-321&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2015.2495136&rft_dat=%3Cproquest_RIE%3E1793242003%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1753528236&rft_id=info:pmid/&rft_ieee_id=7308056&rfr_iscdi=true |