Channel coding and decoding in a relay system operated with physical-layer network coding
This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y 3 = X 1 + X 2 +W 3 , to the network-coded combination of the source...
Saved in:
| Published in: | IEEE journal on selected areas in communications Vol. 27; no. 5; pp. 788 - 796 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.06.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0733-8716, 1558-0008 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y 3 = X 1 + X 2 +W 3 , to the network-coded combination of the source packets, S 1 oplus S 2 . This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S 1 and S 2 explicitly at the relay node. Trying to obtain S 1 and S 2 explicitly is an overkill if we are only interested in S1oplusS 2 . In this paper, we refer to the transformation Y 3 rarr S 1 oplus S 2 as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y 3 rarr S 1 oplusS 2 efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity. |
|---|---|
| AbstractList | This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y sub(3) = X sub(1)+ X sub(2)+W sub(3), to the network-coded combination of the source packets, S sub(1) oplus S sub(2). This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S sub(1) and S sub(2) explicitly at the relay node. Trying to obtain S sub(1) and S sub(2) explicitly is an overkill if we are only interested in S1oplusS sub(2). In this paper, we refer to the transformation Y sub(3) rarr S sub(1) oplus S sub(2) as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y sub(3) rarr S sub(1)oplusS sub(2) efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y 3 = X 1 + X 2 +W 3 , to the network-coded combination of the source packets, S 1 oplus S 2 . This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S 1 and S 2 explicitly at the relay node. Trying to obtain S 1 and S 2 explicitly is an overkill if we are only interested in S1oplusS 2 . In this paper, we refer to the transformation Y 3 rarr S 1 oplus S 2 as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y 3 rarr S 1 oplusS 2 efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity. |
| Author | Soung-Chang Liew Shengli Zhang |
| Author_xml | – sequence: 1 givenname: Shengli surname: Zhang fullname: Zhang, Shengli |
| BookMark | eNp9kE1rGzEQhkVJoY6Te6AX0UtO646k1ccejWn6gaGH-NKTkHdnazlryZFkjP9919j0kENOw8DzvDO8t-QmxICEPDCYMQbN11_P88WMAzQzaEAx84FMmJSmAgBzQyaghaiMZuoTuc15C8Dq2vAJ-bPYuBBwoG3sfPhLXehoh9fFB-powsGdaD7lgjsa95hcwY4efdnQ_eaUfeuGaiQw0YDlGNPLNeqOfOzdkPH-Oqdk9fRttfhRLX9__7mYL6tWcF6qdY28lVD3XBmpeqXXphXIesOQO0SolRIgerFuZOMAeiN7AAG6A8MkODElj5fYfYqvB8zF7nxucRhcwHjI1mgJTDXAR_LLG3IbDymMv1kjdS205jBCcIHaFHNO2Nt98juXTpaBPRdtz0Xbc9H2UvSoqDdK64srPoaSnB_eEz9fRI-I_-9I0FwoIf4BHeeL1A |
| CODEN | ISACEM |
| CitedBy_id | crossref_primary_10_1007_s11276_016_1327_7 crossref_primary_10_1109_TCOMM_2012_050812_110187 crossref_primary_10_1109_TCOMM_2014_2345763 crossref_primary_10_1109_TCOMM_2019_2956920 crossref_primary_10_1016_S1005_8885_10_60061_1 crossref_primary_10_1109_TWC_2014_2365822 crossref_primary_10_1155_2010_423234 crossref_primary_10_1109_TVT_2017_2766209 crossref_primary_10_1109_LCOMM_2012_040912_113270 crossref_primary_10_1109_TWC_2012_012712_111194 crossref_primary_10_1109_JSAC_2016_2611838 crossref_primary_10_1109_TVT_2013_2266127 crossref_primary_10_1109_TCOMM_2012_051712_110224 crossref_primary_10_1002_wcm_2489 crossref_primary_10_1109_TCOMM_2017_2657756 crossref_primary_10_1007_s11432_015_5293_y crossref_primary_10_1109_TCOMM_2012_022513_120085 crossref_primary_10_1016_j_phycom_2019_100833 crossref_primary_10_1109_TVT_2019_2929010 crossref_primary_10_1109_TWC_2012_121712_111811 crossref_primary_10_1109_LCOMM_2013_021913_122843 crossref_primary_10_1109_MVT_2012_2234254 crossref_primary_10_1109_LCOMM_2022_3160607 crossref_primary_10_1109_TIT_2015_2412114 crossref_primary_10_1007_s11277_011_0473_6 crossref_primary_10_1109_TVT_2011_2106810 crossref_primary_10_1109_TWC_2011_120911_111067 crossref_primary_10_1049_iet_com_2016_1025 crossref_primary_10_1109_COMST_2017_2661861 crossref_primary_10_1109_TCOMM_2020_3048046 crossref_primary_10_1109_TVT_2016_2550479 crossref_primary_10_1109_TWC_2011_032411_100794 crossref_primary_10_1109_TIT_2016_2530080 crossref_primary_10_1109_TWC_2011_120511_110269 crossref_primary_10_1002_dac_2642 crossref_primary_10_1002_ett_3790 crossref_primary_10_1016_j_future_2018_10_047 crossref_primary_10_1109_TWC_2010_072110_100138 crossref_primary_10_1109_LCOMM_2023_3281425 crossref_primary_10_1109_TCOMM_2014_013114_130303 crossref_primary_10_3390_rs15040919 crossref_primary_10_1049_iet_com_2014_0571 crossref_primary_10_1109_JSAC_2013_6658242 crossref_primary_10_1109_LSP_2012_2231070 crossref_primary_10_1109_TWC_2013_030514_131312 crossref_primary_10_1109_LCOMM_2017_2699636 crossref_primary_10_1109_TIT_2017_2697426 crossref_primary_10_1109_TWC_2012_120312_120469 crossref_primary_10_1109_COMST_2019_2894154 crossref_primary_10_1109_TVT_2014_2321229 crossref_primary_10_1109_TWC_2014_2316169 crossref_primary_10_1109_TNET_2011_2176958 crossref_primary_10_1109_TCOMM_2014_2376954 crossref_primary_10_1109_TWC_2015_2504471 crossref_primary_10_1109_TVT_2018_2883509 crossref_primary_10_1109_TWC_2011_081011_102277 crossref_primary_10_1049_iet_com_2010_1045 crossref_primary_10_1002_dac_4419 crossref_primary_10_1155_2010_870268 crossref_primary_10_1109_TVT_2018_2841990 crossref_primary_10_1109_TSP_2012_2203812 crossref_primary_10_1109_TWC_2013_092513_121778 crossref_primary_10_1016_j_phycom_2012_02_008 crossref_primary_10_1109_TCOMM_2020_2987891 crossref_primary_10_1109_JPROC_2010_2094170 crossref_primary_10_1109_ACCESS_2019_2900256 crossref_primary_10_1007_s11276_015_0924_1 crossref_primary_10_1049_iet_com_2018_5707 crossref_primary_10_1109_TCOMM_2018_2801788 crossref_primary_10_3390_s19194142 crossref_primary_10_3390_electronics10111294 crossref_primary_10_1109_TWC_2012_070912_111308 crossref_primary_10_1109_JSAC_2013_131103 crossref_primary_10_1109_LCOMM_2022_3151770 crossref_primary_10_1109_TWC_2015_2434874 crossref_primary_10_1016_j_phycom_2013_01_002 crossref_primary_10_1109_TVT_2014_2337880 crossref_primary_10_1109_JSEN_2014_2386536 crossref_primary_10_1007_s11277_014_2075_6 crossref_primary_10_1109_TWC_2014_020414_131260 crossref_primary_10_1109_JIOT_2024_3433489 crossref_primary_10_1109_TWC_2012_101112_120190 crossref_primary_10_1109_TCOMM_2013_012313_110631 crossref_primary_10_1109_TCOMM_2011_111710_100233 crossref_primary_10_1109_COMST_2015_2436705 crossref_primary_10_1109_JSAC_2013_130809 crossref_primary_10_1109_ACCESS_2020_2992933 crossref_primary_10_1109_JSAC_2013_130803 crossref_primary_10_1109_TVT_2015_2391213 crossref_primary_10_1049_iet_com_2017_0382 crossref_primary_10_1109_TVT_2014_2303193 crossref_primary_10_1109_TCOMM_2014_2318052 crossref_primary_10_1109_TWC_2016_2530068 crossref_primary_10_1109_TVT_2017_2757151 crossref_primary_10_1016_j_icte_2017_12_003 crossref_primary_10_1109_TIT_2017_2677965 crossref_primary_10_1109_TCOMM_2014_010414_120940 crossref_primary_10_1186_1687_1499_2013_166 crossref_primary_10_1109_TWC_2017_2755026 crossref_primary_10_1109_ACCESS_2016_2645604 crossref_primary_10_1002_ett_2644 crossref_primary_10_1109_TVT_2012_2210060 crossref_primary_10_3390_electronics14102019 crossref_primary_10_1109_TMC_2015_2473849 crossref_primary_10_1016_j_phycom_2012_05_002 crossref_primary_10_1007_s11276_017_1596_9 crossref_primary_10_1007_s11277_017_4819_6 crossref_primary_10_1109_JSAC_2014_2384332 crossref_primary_10_1109_TSP_2012_2201151 crossref_primary_10_1007_s11277_016_3656_3 crossref_primary_10_1109_TIFS_2015_2405903 crossref_primary_10_1109_TWC_2022_3183407 crossref_primary_10_1109_TCOMM_2011_063011_110030 crossref_primary_10_1109_TVT_2022_3172229 crossref_primary_10_1109_TWC_2013_060513_120334 crossref_primary_10_1007_s11767_010_0316_y crossref_primary_10_1109_TCOMM_2016_2583422 crossref_primary_10_1109_LCOMM_2011_011011_101429 crossref_primary_10_1007_s11277_017_4906_8 crossref_primary_10_1186_s13638_015_0483_2 crossref_primary_10_1109_ACCESS_2018_2825429 crossref_primary_10_1109_JSYST_2019_2891785 crossref_primary_10_1109_JSAC_2013_130820 crossref_primary_10_1109_TWC_2022_3233798 crossref_primary_10_1109_TCOMM_2015_2433293 crossref_primary_10_1109_TVT_2011_2160105 crossref_primary_10_1007_s10776_023_00611_z crossref_primary_10_1109_TCOMM_2016_2622693 crossref_primary_10_1109_TVT_2012_2185966 crossref_primary_10_1109_TWC_2015_2456898 crossref_primary_10_1109_TIT_2016_2549027 crossref_primary_10_1007_s11036_016_0750_4 crossref_primary_10_1109_TWC_2012_051712_111377 crossref_primary_10_1109_ACCESS_2018_2883576 crossref_primary_10_1002_ett_2789 crossref_primary_10_1007_s11276_015_1031_z crossref_primary_10_1109_JSAC_2014_141206 crossref_primary_10_1109_LCOMM_2013_111113_132134 crossref_primary_10_1007_s11277_021_08864_8 |
| Cites_doi | 10.1109/IZS.2008.4497296 10.1109/GLOCOM.2008.ECP.726 10.1109/ICC.2006.255034 10.1109/18.910572 10.1109/TIT.2007.904785 10.7551/mitpress/4347.001.0001 10.1109/ITW.2007.4313084 10.1109/CISS.2007.4298312 10.1109/ICC.2007.121 10.1109/18.910577 10.1002/0471200611 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/JSAC.2009.090618 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Engineering Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0008 |
| EndPage | 796 |
| ExternalDocumentID | 2294947061 10_1109_JSAC_2009_090618 5072363 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 41~ 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 8FD L7M RIG F28 FR3 |
| ID | FETCH-LOGICAL-c322t-b4e2c504f26856f67b8c3e1f81e2aee0466303f3b959a00f85f00307d08150a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 253 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000266877600018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0733-8716 |
| IngestDate | Sun Sep 28 10:51:55 EDT 2025 Sun Jun 29 16:15:31 EDT 2025 Sat Nov 29 05:32:25 EST 2025 Tue Nov 18 20:42:37 EST 2025 Wed Aug 27 02:47:45 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c322t-b4e2c504f26856f67b8c3e1f81e2aee0466303f3b959a00f85f00307d08150a3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| PQID | 857437720 |
| PQPubID | 85481 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_875016902 crossref_primary_10_1109_JSAC_2009_090618 crossref_citationtrail_10_1109_JSAC_2009_090618 proquest_journals_857437720 ieee_primary_5072363 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-06-01 |
| PublicationDateYYYYMMDD | 2009-06-01 |
| PublicationDate_xml | – month: 06 year: 2009 text: 2009-06-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE journal on selected areas in communications |
| PublicationTitleAbbrev | J-SAC |
| PublicationYear | 2009 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | zhang (ref11) 0 ref15 ref14 zhang (ref5) 0 gallager (ref17) 1963 jin (ref13) 2001 wilson (ref9) 0 ref10 wu (ref1) 2005 ref2 ref16 zhang (ref19) 0 ref18 ref8 ref7 ref3 divsalar (ref12) 1998 ref6 zhang (ref4) 2006 |
| References_xml | – ident: ref10 doi: 10.1109/IZS.2008.4497296 – ident: ref14 doi: 10.1109/GLOCOM.2008.ECP.726 – year: 2001 ident: ref13 publication-title: Analysis and design of turbo-like codes – year: 0 ident: ref19 publication-title: Joint design of physical layer network coding and channel coding – year: 0 ident: ref9 publication-title: Joint physical layer coding and network coding for bi-directional relaying – ident: ref3 doi: 10.1109/ICC.2006.255034 – start-page: 201 year: 1998 ident: ref12 article-title: Coding theorems for Turbolike codes publication-title: Proc 36th Allerton – year: 2005 ident: ref1 article-title: Information exchange in wireless networks with network coding and physical-layer broadcast publication-title: Proc 39th Annual Conf Inform Sci and Systems (CISS) – year: 0 ident: ref11 article-title: Capacity of Two Way Relay Channel publication-title: the 3 Beijing-Hong Kong Doctoral Forum 2008 – ident: ref16 doi: 10.1109/18.910572 – ident: ref8 doi: 10.1109/TIT.2007.904785 – year: 1963 ident: ref17 publication-title: Low Density Parity-Check Codes doi: 10.7551/mitpress/4347.001.0001 – ident: ref15 doi: 10.1109/ITW.2007.4313084 – ident: ref2 doi: 10.1109/CISS.2007.4298312 – ident: ref6 doi: 10.1109/ICC.2007.121 – ident: ref18 doi: 10.1109/18.910577 – start-page: 358 year: 2006 ident: ref4 article-title: Hot topic: physical layer network coding publication-title: Proc 12th MobiCom – year: 0 ident: ref5 article-title: Physical layer network coding publication-title: IEEE Trans on Networking – ident: ref7 doi: 10.1002/0471200611 |
| SSID | ssj0014482 |
| Score | 2.4523237 |
| Snippet | This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the... Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 788 |
| SubjectTerms | Belief propagation Bit error rate Broadcasting Channel coding Channels Coding Computer numerical control Decoding Network coding Networks Physical layer physical layer network coding Redesign Relay Relay systems Relays repeat accumulate code Studies Transformations |
| Title | Channel coding and decoding in a relay system operated with physical-layer network coding |
| URI | https://ieeexplore.ieee.org/document/5072363 https://www.proquest.com/docview/857437720 https://www.proquest.com/docview/875016902 |
| Volume | 27 |
| WOSCitedRecordID | wos000266877600018&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 Electronic Library (IEL) customDbUrl: eissn: 1558-0008 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014482 issn: 0733-8716 databaseCode: RIE dateStart: 19830101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5UPOjBt7i-yMGLYN3atGlyFHERkUVQRE-lTSYgSLvsQ_DfO0mzRVEEby2dlJLpZObLl5kBOOGxSYzIVZRgWhFAUSJSMs2iVFlrySEb7hndp7t8OJTPz-p-Ac66XBhE9IfP8Nxdei7fNHrmtsr6FLskXPBFWMxz0eZqdYwBwQzPGOScRw4EzCnJWPVvHy6vQmVKRe5LfnNBvqfKj4XYe5fB-v--awPWQhTJLlu1b8IC1luw-qW24Da8uLyBGt-Ybpx7YmVtmMFw81qzkrk0lg_WlnJmzchVV0bD3MYsGwXtRSSBY1a3Z8XDq3bgcXD9eHUThT4KkSZznUZVionO4tQmQmbCirySmuOFlReYlIiEkAU5Mssrlakyjq3MrLd9Q-FCFpd8F5bqpsY9YDZNrdJaGgJxKce8ouVS0DirTEWBpu5Bfz6zhQ41xl2ri7fCY41YFU4XrvWlKlpd9OC0GzFq62v8Ibvt5r6TC9Peg4O58opggJNCZhQaEXKIe8C6p2Q5jg4pa2xmJELBkiMJk_3f33sAKy115LZcDmFpOp7hESzr9-nrZHzs_75Pkr_WTw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fa9wwDBZdO9j20K0_xm7tNj_0ZbD0XNtJ7MdSWtrtdgx2jO4pJLYMhZIc17vB_vvJji-0rAz2lhA5BCuyPvmzJIAjyZ1wRWkygaqhAMUUmdEqz5Tx3pNDdjIyuj8m5XSqr6_Ntw34NOTCIGI8fIbH4TJy-a6zq7BVNibsImQhn8BWrpTgfbbWwBlQoBE5g1LKLIQBa1KSm_Hn76dnqTalIQemHzih2FXlr6U4-peLl__3Za9gO-FIdtorfgc2sN2FF_eqC-7Bz5A50OIts11wUKxuHXOYbm5aVrOQyPKb9cWcWTcP9ZXRsbA1y-ZJfxlJ4IK1_Wnx9Kp9mF2cz84us9RJIbNksMusUShszpUXhc4LX5SNthJPvD5BUSNSjFyQK_OyMbmpOfc699H6HQGGnNfyNWy2XYtvgHmlvLFWOwrjlMSyoQWzoHHeuIagph3BeD2zlU1VxkOzi9sqRhvcVEEXofmlqXpdjODjMGLeV9j4h-xemPtBLk37CA7WyquSCd5VOidwRLEDHwEbnpLtBEKkbrFbkQjBpUATirePv_cDPLucfZ1Uk6vplwN4LgjPxN0XcQiby8UK38FT-2t5c7d4H__EP97S2Y8 |
| 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=Channel+coding+and+decoding+in+a+relay+system+operated+with+physical-layer+network+coding&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Shengli+Zhang&rft.au=Soung-Chang+Liew&rft.date=2009-06-01&rft.pub=IEEE&rft.issn=0733-8716&rft.volume=27&rft.issue=5&rft.spage=788&rft.epage=796&rft_id=info:doi/10.1109%2FJSAC.2009.090618&rft.externalDocID=5072363 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon |