Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems
We study a distributed antenna system where L antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite capacity R0, and serve K user terminals (UTs). This model has been widely investigated both for the uplink (UTs to CP) and for the downlink (CP to UT...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 59; no. 9; pp. 5227 - 5243 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.09.2013
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We study a distributed antenna system where L antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite capacity R0, and serve K user terminals (UTs). This model has been widely investigated both for the uplink (UTs to CP) and for the downlink (CP to UTs), which are instances of the general multiple-access relay and broadcast relay networks. We contribute to the subject in the following ways: 1) For the uplink, we consider the recently proposed "compute and forward" (CoF) approach and examine the corresponding system optimization at finite SNR. 2) For the downlink, we propose a novel precoding scheme nicknamed "reverse compute and forward" (RCoF). 3) In both cases, we present low-complexity versions of CoF and RCoF based on standard scalar quantization at the receivers, that lead to discrete-input discrete-output symmetric memoryless channel models for which near-optimal performance can be achieved by standard single-user linear coding. 4) We provide extensive numerical results and finite SNR comparison with other "state of the art" information theoretic techniques, in scenarios including fading and shadowing. The proposed uplink and downlink system optimization focuses specifically on the ATs and UTs selection problem. In both cases, for a given set of transmitters, the goal consists of selecting a subset of the receivers such that the corresponding system matrix has full rank and the sum rate is maximized. We present low-complexity ATs and UTs selection schemes and demonstrate through Monte Carlo simulation that the proposed schemes essentially eliminate the problem of rank deficiency of the system matrix and greatly mitigate the noninteger penalty affecting CoF/RCoF at high SNR. Comparison with other state-of-the art information theoretic schemes, show competitive performance of the proposed approaches with significantly lower complexity. |
|---|---|
| AbstractList | We study a distributed antenna system where L antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite capacity R0, and serve K user terminals (UTs). This model has been widely investigated both for the uplink (UTs to CP) and for the downlink (CP to UTs), which are instances of the general multiple-access relay and broadcast relay networks. We contribute to the subject in the following ways: 1) For the uplink, we consider the recently proposed "compute and forward" (CoF) approach and examine the corresponding system optimization at finite SNR. 2) For the downlink, we propose a novel precoding scheme nicknamed "reverse compute and forward" (RCoF). 3) In both cases, we present low-complexity versions of CoF and RCoF based on standard scalar quantization at the receivers, that lead to discrete-input discrete-output symmetric memoryless channel models for which near-optimal performance can be achieved by standard single-user linear coding. 4) We provide extensive numerical results and finite SNR comparison with other "state of the art" information theoretic techniques, in scenarios including fading and shadowing. The proposed uplink and downlink system optimization focuses specifically on the ATs and UTs selection problem. In both cases, for a given set of transmitters, the goal consists of selecting a subset of the receivers such that the corresponding system matrix has full rank and the sum rate is maximized. We present low-complexity ATs and UTs selection schemes and demonstrate through Monte Carlo simulation that the proposed schemes essentially eliminate the problem of rank deficiency of the system matrix and greatly mitigate the noninteger penalty affecting CoF/RCoF at high SNR. Comparison with other state-of-the art information theoretic schemes, show competitive performance of the proposed approaches with significantly lower complexity. We study a distributed antenna system where $L$ antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite capacity $R_{0}$, and serve $K$ user terminals (UTs). This model has been widely investigated both for the uplink (UTs to CP) and for the downlink (CP to UTs), which are instances of the general multiple-access relay and broadcast relay networks. We contribute to the subject in the following ways: 1) For the uplink, we consider the recently proposed "compute and forward" (CoF) approach and examine the corresponding system optimization at finite SNR. 2) For the downlink, we propose a novel precoding scheme nicknamed "reverse compute and forward" (RCoF). 3) In both cases, we present low-complexity versions of CoF and RCoF based on standard scalar quantization at the receivers, that lead to discrete-input discrete-output symmetric memoryless channel models for which near-optimal performance can be achieved by standard single-user linear coding. 4) We provide extensive numerical results and finite SNR comparison with other "state of the art" information theoretic techniques, in scenarios including fading and shadowing. The proposed uplink and downlink system optimization focuses specifically on the ATs and UTs selection problem. In both cases, for a given set of transmitters, the goal consists of selecting a subset of the receivers such that the corresponding system matrix has full rank and the sum rate is maximized. We present low-complexity ATs and UTs selection schemes and demonstrate through Monte Carlo simulation that the proposed schemes essentially eliminate the problem of rank deficiency of the system matrix and greatly mitigate the noninteger penalty affecting CoF/RC- F at high SNR. Comparison with other state-of-the art information theoretic schemes, show competitive performance of the proposed approaches with significantly lower complexity. [PUBLICATION ABSTRACT] |
| Author | Song-Nam Hong Caire, Giuseppe |
| Author_xml | – sequence: 1 surname: Song-Nam Hong fullname: Song-Nam Hong email: songnamh@usc.edu organization: Ming Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA – sequence: 2 givenname: Giuseppe surname: Caire fullname: Caire, Giuseppe email: caire@usc.edu organization: Ming Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27677258$$DView record in Pascal Francis |
| BookMark | eNp9kEFLAzEQRoNUsK3eBS8L4nFrkt3J7h5LtVoRPFjPSzY7kUib1CRV_PemtPTgwVOY8L75hjciA-ssEnLJ6IQx2twuF8sJp6yYcC5ANHBChgygyhsB5YAMKWV13pRlfUZGIXyksQTGh-Rp5tabbcRc2j6fO_8tfZ-9Ri8jvhsMmXY-mzm3wfRjvjC7MyF606VEn01tRGtl9voTIq7DOTnVchXw4vCOydv8fjl7zJ9fHhaz6XOuCs5ijpLrXkIDQoHSEmnFoVTACl1DIYBWskBWSdR1h7zsKy0k8o71WtUgoKPFmFzv9268-9xiiO2H23qbKltWclEDh6pO1M2BkkHJlfbSKhPajTdr6X9aXokqFe84uueUdyF41EeE0XZntk1m253Z9mA2RcSfiDIx6XE2eTOr_4JX-6BBxGOPAM5ZuuQXU-iH6g |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_LCOMM_2014_2343614 crossref_primary_10_1109_JSTSP_2018_2863189 crossref_primary_10_1109_TWC_2016_2626360 crossref_primary_10_1109_TCOMM_2016_2538767 crossref_primary_10_1109_TIT_2018_2872053 crossref_primary_10_1109_TIT_2021_3093454 crossref_primary_10_1109_MSP_2014_2330031 crossref_primary_10_1109_TIT_2018_2869881 crossref_primary_10_1109_ACCESS_2020_2967666 crossref_primary_10_1109_TWC_2015_2405547 crossref_primary_10_1109_ACCESS_2022_3195056 crossref_primary_10_1109_COMST_2018_2866711 crossref_primary_10_1109_TIT_2015_2416344 crossref_primary_10_3390_e25030409 crossref_primary_10_1109_TIT_2018_2836675 crossref_primary_10_1109_TIT_2019_2930568 crossref_primary_10_1007_s11276_017_1583_1 crossref_primary_10_1109_TVT_2017_2761398 crossref_primary_10_1109_LCOMM_2014_2323253 crossref_primary_10_1109_TSP_2015_2481876 crossref_primary_10_1109_TVT_2018_2886330 crossref_primary_10_1109_TIT_2020_3010253 crossref_primary_10_1049_iet_com_2019_0868 crossref_primary_10_1109_TCOMM_2020_3035607 crossref_primary_10_1109_TWC_2019_2963878 crossref_primary_10_1109_TIT_2014_2368564 crossref_primary_10_1109_TIT_2022_3197592 crossref_primary_10_1109_TIT_2016_2620466 crossref_primary_10_1109_TCOMM_2018_2817225 crossref_primary_10_1109_TVT_2025_3553918 crossref_primary_10_1109_TWC_2024_3442787 crossref_primary_10_1109_TIT_2021_3078851 crossref_primary_10_1109_TSP_2021_3129337 crossref_primary_10_1109_TWC_2015_2465904 crossref_primary_10_1109_TVT_2015_2506981 crossref_primary_10_1109_LWC_2016_2612185 crossref_primary_10_1109_TIT_2025_3560447 crossref_primary_10_1109_LWC_2022_3207422 crossref_primary_10_1109_TWC_2022_3142262 crossref_primary_10_1109_TWC_2017_2711002 crossref_primary_10_1109_TWC_2016_2587627 crossref_primary_10_1109_ACCESS_2017_2736543 crossref_primary_10_1109_TIT_2015_2453942 crossref_primary_10_1109_TIT_2018_2791589 crossref_primary_10_3390_info12040155 crossref_primary_10_1109_TIT_2021_3063268 crossref_primary_10_1109_TIT_2014_2316136 crossref_primary_10_1109_JSAC_2016_2544459 crossref_primary_10_1109_TSP_2013_2280111 crossref_primary_10_1109_LCOMM_2016_2549513 crossref_primary_10_1109_TIT_2020_3009634 crossref_primary_10_1109_TCOMM_2018_2842758 crossref_primary_10_1016_j_matpr_2020_11_570 crossref_primary_10_1109_TIT_2016_2593633 crossref_primary_10_1109_TWC_2024_3364662 crossref_primary_10_1109_TIT_2014_2361782 crossref_primary_10_1109_TCOMM_2016_2611673 crossref_primary_10_1109_TWC_2021_3054337 crossref_primary_10_1109_TIT_2015_2453416 crossref_primary_10_1109_TIT_2015_2389244 crossref_primary_10_1109_TIT_2014_2323234 crossref_primary_10_1109_TCOMM_2017_2711031 crossref_primary_10_1109_TIT_2019_2897564 crossref_primary_10_1109_TCOMM_2020_2992719 crossref_primary_10_3390_e24010047 crossref_primary_10_1109_JSAC_2014_2328133 crossref_primary_10_1109_TWC_2016_2602205 crossref_primary_10_1109_TSP_2016_2616335 crossref_primary_10_1109_TCOMM_2020_2987891 crossref_primary_10_1109_TC_2016_2574353 crossref_primary_10_1109_TWC_2017_2699178 crossref_primary_10_1049_iet_com_2014_0764 |
| Cites_doi | 10.1109/TIT.2009.2023732 10.1109/ISIT.2010.5513577 10.1147/JRD.2009.2037680 10.1007/BF01584082 10.1109/ITW.2011.6089493 10.1109/ITA.2011.5743593 10.1109/TIT.2002.1003821 10.1109/TSP.2005.855401 10.1109/49.761034 10.5802/jtnb.176 10.1007/BF01457454 10.1109/ISIT.2009.5205840 10.1109/LEOS.2004.1363108 10.1016/j.aeue.2004.11.028 10.1109/18.340450 10.1109/TIT.2011.2119930 10.1109/IZS.2006.1649066 10.1137/1108003 10.1109/TIT.2012.2211566 10.1109/TIT.1979.1056046 10.1109/TIT.2003.817444 10.1109/ISIT.2009.5205911 10.1155/2009/840814 10.1109/TCOM.1972.1091221 10.1109/ICUWB.2009.5288814 10.1007/978-0-387-21735-2 10.1017/CBO9781139030687 10.1007/b98818 10.1109/TIT.2004.834787 10.1109/TIT.2009.2027579 10.1109/ISIT.2010.5513739 10.1112/plms/s3-7.1.300 10.1109/TWC.2004.830852 10.1109/TIT.2011.2110110 10.1109/18.841165 10.1109/TIT.2011.2165816 10.1049/el:19710089 10.1109/JSAC.2005.862421 |
| ContentType | Journal Article |
| Copyright | 2014 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2013 |
| Copyright_xml | – notice: 2014 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2013 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.2013.2265695 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 5243 |
| ExternalDocumentID | 3051472261 27677258 10_1109_TIT_2013_2265695 6522158 |
| Genre | orig-research Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c321t-ea2fda5956c5cfae07254c513f8536507a3e17aef8be24d7f6ae2b1dfc8565b03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 120 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000323455800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Mon Jun 30 03:11:52 EDT 2025 Mon Jul 21 09:16:06 EDT 2025 Tue Nov 18 22:11:36 EST 2025 Sat Nov 29 03:53:15 EST 2025 Tue Aug 26 16:39:30 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | Performance evaluation lattice codes Parameter estimation State of the art Relay Relay network Downlink distributed antenna systems Optimization Linear coding Signal quantization Channel estimation Compute and forward Pretreatment Uplink Antenna array Antenna multicell cooperation Fading Multiple access Cooperative systems Distributed system Selection problem Memoryless channel reverse compute and forward Numerical simulation Shadowing Signal to noise ratio Information theory |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c321t-ea2fda5956c5cfae07254c513f8536507a3e17aef8be24d7f6ae2b1dfc8565b03 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1426852578 |
| PQPubID | 36024 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1109_TIT_2013_2265695 pascalfrancis_primary_27677258 ieee_primary_6522158 proquest_journals_1426852578 crossref_citationtrail_10_1109_TIT_2013_2265695 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-09-01 |
| PublicationDateYYYYMMDD | 2013-09-01 |
| PublicationDate_xml | – month: 09 year: 2013 text: 2013-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2013 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref34 ref12 ref37 ref15 ref36 ref14 ref30 ref33 ref11 ref32 ref10 ref39 ref17 ref16 ref19 ref18 fischer (ref31) 2005; 59 caire (ref38) 2002 fischer (ref35) 2002 avestimehr (ref6) 2011; 57 ref24 ref45 ref23 ref26 ref25 segel (ref1) 0 ref42 ref41 ref22 ref44 simeone (ref13) 2009; 2009 ref21 ref43 flanagan (ref2) 2011 ref28 ref27 ref8 ref7 ref4 tunali (ref20) 2012 ref3 ref5 ref40 ahuja (ref29) 1993 cover (ref9) 2006 |
| References_xml | – ident: ref12 doi: 10.1109/TIT.2009.2023732 – ident: ref8 doi: 10.1109/ISIT.2010.5513577 – ident: ref3 doi: 10.1147/JRD.2009.2037680 – year: 2006 ident: ref9 publication-title: Elements of Information Theory – ident: ref42 doi: 10.1007/BF01584082 – ident: ref19 doi: 10.1109/ITW.2011.6089493 – year: 2002 ident: ref38 article-title: Writing on dirty tape with LDPC codes publication-title: DIMACS Workshop Signal Process Wireless Transmiss – ident: ref4 doi: 10.1109/ITA.2011.5743593 – ident: ref24 doi: 10.1109/TIT.2002.1003821 – ident: ref44 doi: 10.1109/TSP.2005.855401 – year: 2002 ident: ref35 article-title: Space-time transmission using Tomlinson-Harashima precoding publication-title: Proc 4th Int ITG Conference Source Channel Coding – ident: ref17 doi: 10.1109/49.761034 – ident: ref28 doi: 10.5802/jtnb.176 – ident: ref27 doi: 10.1007/BF01457454 – ident: ref15 doi: 10.1109/ISIT.2009.5205840 – ident: ref5 doi: 10.1109/LEOS.2004.1363108 – volume: 59 start-page: 244 year: 2005 ident: ref31 article-title: The modulo-lattice channel: The key feature in precoding schemes publication-title: Int J Electron Commun doi: 10.1016/j.aeue.2004.11.028 – ident: ref16 doi: 10.1109/18.340450 – ident: ref7 doi: 10.1109/TIT.2011.2119930 – ident: ref37 doi: 10.1109/IZS.2006.1649066 – ident: ref32 doi: 10.1137/1108003 – ident: ref10 doi: 10.1109/TIT.2012.2211566 – ident: ref11 doi: 10.1109/TIT.1979.1056046 – year: 1993 ident: ref29 publication-title: Network Flows Theory Algorithms and Application – ident: ref25 doi: 10.1109/TIT.2003.817444 – ident: ref40 doi: 10.1109/ISIT.2009.5205911 – volume: 2009 year: 2009 ident: ref13 article-title: Downlink multicell processing with limited-backhaul capacity publication-title: EURASIP J Adv Signal Process doi: 10.1155/2009/840814 – year: 0 ident: ref1 publication-title: Light radio white paper 1 technical overview – ident: ref34 doi: 10.1109/TCOM.1972.1091221 – start-page: 33 year: 2012 ident: ref20 article-title: Lattice codes based on Eisenstein integers for compute and forward publication-title: Proc 50th Annu Allerton Conf Commun Control Comput – year: 2011 ident: ref2 publication-title: Creating cloud base stations with TI's keystone multicore architecture – ident: ref18 doi: 10.1109/ICUWB.2009.5288814 – ident: ref22 doi: 10.1007/978-0-387-21735-2 – ident: ref45 doi: 10.1017/CBO9781139030687 – ident: ref26 doi: 10.1007/b98818 – ident: ref23 doi: 10.1109/TIT.2004.834787 – ident: ref39 doi: 10.1109/TIT.2009.2027579 – ident: ref21 doi: 10.1109/ISIT.2010.5513739 – ident: ref41 doi: 10.1112/plms/s3-7.1.300 – ident: ref36 doi: 10.1109/TWC.2004.830852 – volume: 57 start-page: 1872 year: 2011 ident: ref6 article-title: Wireless network information flow: A deterministic approach publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2011.2110110 – ident: ref30 doi: 10.1109/18.841165 – ident: ref14 doi: 10.1109/TIT.2011.2165816 – ident: ref33 doi: 10.1049/el:19710089 – ident: ref43 doi: 10.1109/JSAC.2005.862421 |
| SSID | ssj0014512 |
| Score | 2.4972556 |
| Snippet | We study a distributed antenna system where L antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite capacity... We study a distributed antenna system where $L$ antenna terminals (ATs) are connected to a central processor (CP) via digital error-free links of finite... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 5227 |
| SubjectTerms | Antenna arrays Antennas Applied sciences Coding, codes Comparative analysis Compute and forward Decoding distributed antenna systems Downlink Encoding Exact sciences and technology Information theory Information, signal and communications theory lattice codes Lattices Monte Carlo simulation multicell cooperation Optimization Radiocommunications Receivers reverse compute and forward Signal and communications theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Uplink |
| Title | Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems |
| URI | https://ieeexplore.ieee.org/document/6522158 https://www.proquest.com/docview/1426852578 |
| Volume | 59 |
| WOSCitedRecordID | wos000323455800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5UPOjBt7i-yMGLYNw22TTtUdRFRcTDCt5KHhMQpJXd1d9v0qZFUQRvhU5KySSdbzqT7wM4YTpRWAhOnUxyOipsRrUQlurM8NTl3DLXqJbcy4eH_Pm5eFyAs_4sDCI2zWd4Hi6bWr6tzXv4VTbMPFhIRb4Ii1Jm7VmtvmIwEmnLDJ76Dexzjq4kmRTDye0k9HDxcw81RBaUJL6EoEZTJXREqpmfFNeqWfz4MDfRZrz-v_fcgLWIKslFuww2YQGrLVjvFBtI3MBbsPqFfnAb7qIBVZWl43oaGmhJR1eLM-LxLLms6zds2cHJVSDZDfpYaMlFaH2vFImM5zvwNL6eXN7QqK1ADWfpnKJizirhsyMjjFOYSJ8pGpFy5-O3R21ScUylQpdrZCMrXaaQ6dQ6k3sIqBO-C0tVXeEeEJOgx1jM8UKLkRVWY6ILlNYHRca0wgEMu-kuTSQeD_oXr2WTgCRF6R1UBgeV0UEDOO1HvLWkG3_YbgcH9HZx7gdw_M2j_X0mM59QBIPDzsVl3LYznwexLA_8sPn-7489gBXW6GGEJrNDWJpP3_EIls3H_GU2PW5W5Ce5Ht8H |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na9wwEB3SNNDm0LRJS7ZNUx16CVRZWbL8cVy2XZJ2u_Swgb0ZfYwgUOywu8nvj2TLZktKoTeDR8ZoJM8bz-g9gM9cM4WlFNTlrKBpaTOqpbRUZ0YkrhCWu1a1ZJ4vFsVqVf7agy_DWRhEbJvP8DJctrV825j78KtsnHmwkMjiGTyXacpZd1prqBmkMum4wRO_hX3W0RclWTleXi9DF5e49GBDZkFLYicItaoqoSdSbfy0uE7P4smnuY03s6P_e9PX8CriSjLpFsIb2MP6GI56zQYSt_AxHO4QEJ7A92hAVW3prFmHFlrSE9bihnhES6ZNc4cdPzj5Gmh2g0IWWjIJze-1IpHz_C3czL4tp1c0qitQI3iypai4s0r6_MhI4xSy3OeKRibC-QjucVuuBCa5Qldo5KnNXaaQ68Q6U3gQqJl4B_t1U-MpEMPQoyzuRKllaqXVyHSJufVhkXOtcATjfrorE6nHgwLG76pNQVhZeQdVwUFVdNAILoYRdx3txj9sT4IDBrs49yM4_8Ojw32eZz6lCAZnvYuruHE3PhPiWREYYov3f3_sJ3hxtfw5r-bXix8f4CVv1TFCy9kZ7G_X9_gRDszD9nazPm9X5yN3VOJO |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Compute-and-Forward+Strategies+for+Cooperative+Distributed+Antenna+Systems&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Song-Nam+Hong&rft.au=Caire%2C+Giuseppe&rft.date=2013-09-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=59&rft.issue=9&rft.spage=5227&rft.epage=5243&rft_id=info:doi/10.1109%2FTIT.2013.2265695&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2013_2265695 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |