Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks
Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves...
Uložené v:
| Vydané v: | IEEE transactions on information theory Ročník 53; číslo 11; s. 4106 - 4118 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.11.2007
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 0018-9448, 1557-9654 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their "scale-free" property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time. |
|---|---|
| AbstractList | Distributed spaceA...time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a spaceA...time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed spaceA...time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of spaceA...time codes for multiple-antenna systems. It is well known that orthogonal spaceA~time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed spaceA...time coding since their A...scale-freeA... property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed spaceA...time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed spaceA...time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed spaceA...time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time. (ProQuest: ... denotes formulae/symbols omitted.) Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their "scale-free" property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time. Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender [abstract truncated by publisher]. |
| Author | Jafarkhani, H. Jing, Y. |
| Author_xml | – sequence: 1 givenname: Y. surname: Jing fullname: Jing, Y. organization: Univ. of California, Irvine, CA, USA – sequence: 2 givenname: H. surname: Jafarkhani fullname: Jafarkhani, H. organization: Univ. of California, Irvine, CA, USA |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19204440$$DView record in Pascal Francis |
| BookMark | eNp90c9LHDEUB_AgFrrannvoZRCUXmZNJr_mHUVrFaTSstLjEOPLNjommjdL8b83y0pbPHgKST7fPMJ3h22nnJCxT4LPheBwuDhfzDvO7Ry41cJssZnQ2rZgtNpmM85F34JS_Xu2Q3Rbt0qLbsbOriimZXNZpt95mZMbG5dumh8rR7H97_AEKS4TNTE1v2LBEYmanzi6p-Y7Tn9yuaMP7F1wI-HHl3WXXZ1-XRyftReX386Pjy5a34Gd2pte-ACgkHcBTdACjQLoUXoIwnjrbAfCe3Reu3oXJAQFIliFUutr8HKXHWzefSj5cYU0DfeRPI6jS5hXNEhlQEipKvzyJhTGCtl3GtZ07xW9zatS_10VaBBGmr6i_RfkyLsxFJd8pOGhxHtXnirsuFKKV3e4cb5kooLhH-HDuqmhNjWsmxo2TdWEfpXwcXJTzGkqLo5v5D5vchER_05R0krFQT4DAIaguw |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_4218_etrij_13_0212_0495 crossref_primary_10_1109_TWC_2009_081290 crossref_primary_10_1007_s11277_013_1085_0 crossref_primary_10_1109_LSP_2015_2442587 crossref_primary_10_4018_jitwe_2011100105 crossref_primary_10_1109_TWC_2009_080501 crossref_primary_10_1049_iet_com_2013_0251 crossref_primary_10_1109_TNET_2014_2300147 crossref_primary_10_1109_TCOMM_2016_2589269 crossref_primary_10_1007_s11277_015_2368_4 crossref_primary_10_1109_TWC_2010_102210_101071 crossref_primary_10_1109_LSP_2009_2015988 crossref_primary_10_1109_TWC_2011_020811_100375 crossref_primary_10_1109_TWC_2013_072513_121203 crossref_primary_10_1109_LCOMM_2014_2361524 crossref_primary_10_1109_LCOMM_2013_101813_131703 crossref_primary_10_1109_JSAC_2012_120912 crossref_primary_10_1007_s11277_016_3179_y crossref_primary_10_1016_j_sigpro_2012_12_001 crossref_primary_10_1155_2008_149803 crossref_primary_10_1109_TWC_2009_080379 crossref_primary_10_1109_TWC_2009_080895 crossref_primary_10_1109_TCOMM_2010_07_090038 crossref_primary_10_1109_TWC_2017_2777446 crossref_primary_10_1109_TVT_2011_2177482 crossref_primary_10_1049_joe_2014_0063 crossref_primary_10_1109_JPROC_2018_2848363 crossref_primary_10_1186_1687_1499_2013_113 crossref_primary_10_1007_s11265_010_0516_3 crossref_primary_10_1049_el_20092091 crossref_primary_10_1109_TSP_2011_2151191 crossref_primary_10_1109_TIT_2011_2179116 crossref_primary_10_1109_TVT_2010_2080296 crossref_primary_10_1186_s13638_015_0266_9 crossref_primary_10_1109_TCOMM_2014_031214_120454 crossref_primary_10_1109_TWC_2010_061710_090972 crossref_primary_10_1049_iet_com_2012_0782 crossref_primary_10_1109_TWC_2008_080109 crossref_primary_10_1049_iet_com_2013_0354 crossref_primary_10_1109_TSP_2010_2077632 crossref_primary_10_1109_TWC_2009_081580 crossref_primary_10_1186_1687_6180_2014_177 crossref_primary_10_1007_s11277_014_2239_4 crossref_primary_10_1109_TSP_2009_2039837 crossref_primary_10_1109_LCOMM_2008_081119 crossref_primary_10_1109_TCOMM_2012_110616_110616 crossref_primary_10_1109_TSP_2011_2123890 crossref_primary_10_1109_TWC_2015_2495347 crossref_primary_10_1109_TVT_2018_2791472 crossref_primary_10_1155_2009_295418 crossref_primary_10_1155_2010_640186 crossref_primary_10_1109_TWC_2009_080796 crossref_primary_10_1109_TWC_2014_2373372 crossref_primary_10_1007_s11277_011_0238_2 crossref_primary_10_1186_1687_6180_2014_165 crossref_primary_10_1109_TWC_2012_061912_111416 crossref_primary_10_1007_s13369_018_3139_9 crossref_primary_10_1049_iet_com_2013_0170 crossref_primary_10_1049_iet_com_2010_0291 crossref_primary_10_1109_TIT_2011_2162189 crossref_primary_10_1109_TSP_2010_2046079 crossref_primary_10_1109_TWC_2009_080545 crossref_primary_10_1002_ett_3580 crossref_primary_10_1007_s11277_018_5812_4 crossref_primary_10_1109_TSP_2008_925945 crossref_primary_10_3390_s23177540 crossref_primary_10_1109_TSP_2009_2017002 crossref_primary_10_1109_TSP_2009_2018610 crossref_primary_10_1109_TWC_2010_120610_101315 crossref_primary_10_1109_TWC_2011_080311_102004 crossref_primary_10_1049_iet_com_2016_1342 crossref_primary_10_1007_s11277_010_0016_6 crossref_primary_10_1109_TCOMM_2012_050912_110380 crossref_primary_10_1109_TWC_2010_011111_100640 crossref_primary_10_1155_2009_612719 crossref_primary_10_1007_s11277_013_1415_2 crossref_primary_10_1109_TVT_2009_2024499 crossref_primary_10_1049_iet_com_2015_0857 crossref_primary_10_1109_TWC_2011_010411_100644 crossref_primary_10_1109_TVT_2012_2227521 crossref_primary_10_1109_TCOMM_2013_053013_120541 crossref_primary_10_1049_iet_com_2013_0444 crossref_primary_10_1109_TIT_2013_2242115 crossref_primary_10_1049_iet_com_2014_0011 crossref_primary_10_1109_TSP_2010_2055561 crossref_primary_10_1109_TWC_2012_121412_120145 crossref_primary_10_1109_TVT_2009_2013631 crossref_primary_10_1049_iet_com_2009_0279 crossref_primary_10_1109_LCOMM_2014_030114_132857 crossref_primary_10_1186_1687_1499_2012_351 crossref_primary_10_1007_s11277_010_0163_9 crossref_primary_10_1049_iet_com_2012_0463 crossref_primary_10_1049_cmu2_12045 crossref_primary_10_1002_dac_3008 crossref_primary_10_1109_TIT_2010_2048475 crossref_primary_10_1049_iet_wss_2012_0026 crossref_primary_10_1109_TVT_2017_2786471 crossref_primary_10_1109_TCOMM_2008_060388 crossref_primary_10_1109_TWC_2014_2334615 crossref_primary_10_1109_TSP_2015_2423255 crossref_primary_10_1007_s11277_011_0499_9 crossref_primary_10_1002_wcm_1246 |
| Cites_doi | 10.1109/TIT.2006.876245 10.1109/TWC.2006.1638664 10.1109/TIT.2003.817829 10.1109/TIT.2005.858920 10.1109/TIT.2003.817830 10.1109/49.730453 10.1017/CBO9780511536779 10.1109/TIT.2002.1013127 10.1109/TCOMM.2003.818096 10.1109/26.898239 10.1109/18.771146 10.1109/TIT.2004.834740 10.1109/JSAC.2004.830922 10.1109/TWC.2006.256975 10.1109/INFCOM.2002.1019409 10.1109/18.661517 |
| ContentType | Journal Article |
| Copyright | 2007 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2007 |
| Copyright_xml | – notice: 2007 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Nov 2007 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2007.907516 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| 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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology 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 Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 4118 |
| ExternalDocumentID | 1378050211 19204440 10_1109_TIT_2007_907516 4373409 |
| 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 F28 FR3 |
| ID | FETCH-LOGICAL-c297t-d81cf994e02fe6f51e64998e3c9f16c7a7291cceac5a1e6f39f491f74e355b9c3 |
| IEDL.DBID | RIE |
| ISSN | 0018-9448 |
| IngestDate | Thu Oct 02 11:44:32 EDT 2025 Thu Oct 02 06:51:31 EDT 2025 Sun Sep 07 03:40:04 EDT 2025 Mon Jul 21 09:15:45 EDT 2025 Tue Nov 18 22:18:53 EST 2025 Sat Nov 29 03:53:03 EST 2025 Wed Aug 27 02:47:12 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Performance evaluation Space-time codes Relay Relay network Error probability distributed space-time coding Wireless telecommunication Error rate orthogonal and quasi-orthogonal designs Random codes Transmission time diversity Relay channel Simulation Orthogonal code Transmitting antenna Coding pairwise error probability (PEP) coding gain Algorithm complexity Linear complexity Data transmission network Antenna array |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-d81cf994e02fe6f51e64998e3c9f16c7a7291cceac5a1e6f39f491f74e355b9c3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 ObjectType-Article-2 |
| PQID | 195916368 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | proquest_journals_195916368 pascalfrancis_primary_19204440 proquest_miscellaneous_34691334 proquest_miscellaneous_1671382594 crossref_primary_10_1109_TIT_2007_907516 crossref_citationtrail_10_1109_TIT_2007_907516 ieee_primary_4373409 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-11-00 |
| PublicationDateYYYYMMDD | 2007-11-01 |
| PublicationDate_xml | – month: 11 year: 2007 text: 2007-11-00 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2007 |
| 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 | ref13 ref15 ref14 ref11 jing (ref12) 2005 gradshteyn (ref20) 2000 ref2 ref1 ref17 ref16 hua (ref10) 2003 ref19 ref18 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – year: 2000 ident: ref20 publication-title: Table of Integrals Series and Products – ident: ref9 doi: 10.1109/TIT.2006.876245 – ident: ref14 doi: 10.1109/TWC.2006.1638664 – ident: ref5 doi: 10.1109/TIT.2003.817829 – ident: ref8 doi: 10.1109/TIT.2005.858920 – ident: ref16 doi: 10.1109/TIT.2003.817830 – ident: ref17 doi: 10.1109/49.730453 – ident: ref19 doi: 10.1017/CBO9780511536779 – ident: ref15 doi: 10.1109/TIT.2002.1013127 – ident: ref4 doi: 10.1109/TCOMM.2003.818096 – ident: ref13 doi: 10.1109/26.898239 – ident: ref2 doi: 10.1109/18.771146 – ident: ref18 doi: 10.1109/TIT.2004.834740 – ident: ref3 doi: 10.1109/TCOMM.2003.818096 – ident: ref6 doi: 10.1109/JSAC.2004.830922 – start-page: 47 year: 2003 ident: ref10 article-title: wireless antennasmaking wireless communications perform like wireline communications publication-title: IEEE AP-S Topical Conf Wireless Communication Technology – ident: ref11 doi: 10.1109/TWC.2006.256975 – ident: ref7 doi: 10.1109/INFCOM.2002.1019409 – year: 2005 ident: ref12 publication-title: Cooperative Diversity in Wireless Relay Networks With Multiple-Antenna Nodes – ident: ref1 doi: 10.1109/18.661517 |
| SSID | ssj0014512 |
| Score | 2.3851104 |
| Snippet | Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this... Distributed spaceA...time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 4106 |
| SubjectTerms | Analysis Analytical models Antennas Applied sciences Channels Coding coding gain Coding, codes Decoding Design engineering distributed space-time coding diversity Electric power lines Error analysis Exact sciences and technology Information analysis Information theory Information, signal and communications theory Networks orthogonal and quasi-orthogonal designs Pairwise error probability pairwise error probability (PEP) Radiocommunications Receiving antennas Relay Relay network Relay networks Relays Signal and communications theory Simulation Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Transmitters Transmitting antennas Valuation and optimization of characteristics. Simulation Wireless networks |
| Title | Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks |
| URI | https://ieeexplore.ieee.org/document/4373409 https://www.proquest.com/docview/195916368 https://www.proquest.com/docview/1671382594 https://www.proquest.com/docview/34691334 |
| Volume | 53 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) 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/eLvHCXMwlV3BbtQwEB2VigMcKLQgQqEYiQMH0saJY8dHBFRFQgtIi9Rb5DjjslKVRZtdJP6eGScbFkEP3KJkYlkzHnvGHr8H8NJp2eRZ5dJgmipVDmXahLJJHdLwyDQaGyJryUczm1WXl_bzHrye7sIgYiw-w1N-jGf57dJveKvsjGF4FN_Wu2WMHu5qTScGqpQDMrgkB6acY4TxkZk9m3-YD1iFlAiWTGy-swJFShUuiHQ96SQMZBZ_zctxsTk_-L9u3od7Y1Ap3gyj4AHsYXcIB1vCBjH67yHc3UEfPIKLWC4gPq3W35ZXHJAL17Xiy8b1i3Tn5btY49GLRSe4VPaapkbBJXQ_xWwoIe8fwtfz9_O3F-lIrJD63Jp12lbSB2sVZnlAHUqJmhKfCgtvg9TeOIq4pfc0J5eOvoXCBmVlMAopOmmsLx7Bfrfs8DGIyhe5bwxlcRT7NdQopXCBEX2q1jV5iwmcbpVd-xF1nMkvruuYfWS2JuswF6apB-sk8Gr64fsAuHGz6BErfxIb9Z7AyR_W_N2MzRkdL0vgeGveevTYvmaQHYpNdZXAi-kruRqfn7gOlxsS0YYRG0urEnh-g0yhtKW0Xz35d9-O4U7cHI6XGZ_C_nq1wWdw2_9YL_rVSRzRvwBLG_Qw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RT9swED4hhrTtYTAYWsYAI-1hDwvEiRPHj9MYKqIrTOok3iLHsaESSlHTIu3f785JQ6eNB96i5GJZdz77zj5_H8AnnfEyjnIdOlnmodCWh6VLy1BbHB5RZqVynrVkKEej_PpaXa3Bl_4ujLXWF5_ZY3r0Z_nV1Cxoq-yEYHgE3dZ7kQoRR-1trf7MQKS8xQbn6MKYdXRAPjxSJ-PzcYtWiKlgStTmK2uQJ1WhkkjdoFZcS2fxz8zsl5uzzed1dAvedGEl-9qOg7ewZutt2FxSNrDOg7fh9Qr-4A4MfMEAu5zNb6c3FJIzXVfs50I3k3Dl5amv8mjYpGZULHuHkyOjIrrfbNQWkTfv4NfZ9_G3QdhRK4QmVnIeVjk3Tilho9jZzKXcZpj65DYxyvHMSI0xNzcGZ-VU4zeXKCcUd1JYjE9KZZJdWK-ntX0PLDdJbEqJeRxGfyU2ikmcI0yfvNJlXNkAjpfKLkyHO070F3eFzz8iVaB1iA1TFq11Avjc_3DfQm48LbpDyu_FOr0HcPCXNR-bUTHh40UB7C3NW3Q-2xQEs4PRaZYHcNR_RWejExRd2-kCRTJJmI2pEgEcPiGTiExh4i8-_L9vh_ByMP4xLIbno4s9eOW3iv3Vxo-wPp8t7D5smIf5pJkd-NH9Bx9693c |
| 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=Using+Orthogonal+and+Quasi-Orthogonal+Designs+in+Wireless+Relay+Networks&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Jing%2C+Y&rft.au=Jafarkhani%2C+H&rft.date=2007-11-01&rft.issn=0018-9448&rft.volume=53&rft.issue=11&rft.spage=4106&rft.epage=4118&rft_id=info:doi/10.1109%2FTIT.2007.907516&rft.externalDBID=NO_FULL_TEXT |
| 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 |