Distributed Space-Time Coding for Full-Duplex Asynchronous Cooperative Communications

In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 11; číslo 7; s. 2680 - 2688
Hlavní autoři: Liu, Yi, Xia, Xiang-Gen, Zhang, Hailin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.07.2012
Institute of Electrical and Electronics Engineers
Témata:
ISSN:1536-1276
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel cancellation and amplifying, where some loop signals are used as the self-coding instead of treated as interference to be directly cancelled. We show this scheme can achieve full asynchronous cooperative diversity. We then evaluate the performance of the two schemes when loop channel information is not accurate and present an amplifying factor control method for the DLC-STC Scheme 2 to improve its performance with inaccurate loop channel information. Simulation results show that the DLC-STC Scheme 1 outperforms the DLC-STC Scheme 2 and the delay diversity scheme if perfect or high quality loop channel information is available at the relay, while the DLC-STC Scheme 2 achieves better performance if the loop channel information is imperfect.
AbstractList In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative communications. The DLC-STC Scheme 1 is for the case of the complete loop channel cancellation, which achieves the full asynchronous cooperative diversity. The DLC-STC Scheme 2 is for the case of the partial loop channel cancellation and amplifying, where some loop signals are used as the self-coding instead of treated as interference to be directly cancelled. We show this scheme can achieve full asynchronous cooperative diversity. We then evaluate the performance of the two schemes when loop channel information is not accurate and present an amplifying factor control method for the DLC-STC Scheme 2 to improve its performance with inaccurate loop channel information. Simulation results show that the DLC-STC Scheme 1 outperforms the DLC-STC Scheme 2 and the delay diversity scheme if perfect or high quality loop channel information is available at the relay, while the DLC-STC Scheme 2 achieves better performance if the loop channel information is imperfect.
Author Xiang-Gen Xia
Hailin Zhang
Yi Liu
Author_xml – sequence: 1
  givenname: Yi
  surname: Liu
  fullname: Liu, Yi
– sequence: 2
  givenname: Xiang-Gen
  surname: Xia
  fullname: Xia, Xiang-Gen
– sequence: 3
  givenname: Hailin
  surname: Zhang
  fullname: Zhang, Hailin
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=26185831$$DView record in Pascal Francis
BookMark eNqFkE9LwzAYh3OY4Db9BIL04rEzf5q0BS9jcyoMPLjhMSRpopE2KUkr7tvbWfXgxdOPF37P-748MzBx3mkALhFcIATL693zaoEhwgvIIB4CIYxRNgFTRAlLEc7ZKZjF-AYhyhmlU7Bf29gFK_tOV8lTK5ROd7bRycpX1r0kxodk09d1uu7bWn8ky3hw6jV45_s4dHyrg-js-7HfNL2zapi8i2fgxIg66vPvnIP95na3uk-3j3cPq-U2VSRHXZoRKWlFTEFzKTOFWEGoKDQt4PCfyDJDjclIqUtdSUUrIyXLVamhgkKQTCsyB1fj3lZEJWoThFM28jbYRoQDxwwVtCBo6N2MPRV8jEEbrmz39WoXhK05gvyojw_6-FEfH_XxUd-Asz_4z4V_wYsRtFrrX4hhRCAh5BPQZYIn
CODEN ITWCAX
CitedBy_id crossref_primary_10_1007_s11276_015_0920_5
crossref_primary_10_1109_TVT_2016_2542207
crossref_primary_10_1109_LCOMM_2021_3121553
crossref_primary_10_1049_iet_com_2018_5840
crossref_primary_10_1109_TCOMM_2017_2704109
crossref_primary_10_12677_OJNS_2014_24008
crossref_primary_10_1109_WCL_2013_070113_130400
crossref_primary_10_1109_TITS_2018_2850311
crossref_primary_10_1002_ett_2938
crossref_primary_10_11159_ijecs_2017_001
crossref_primary_10_1049_iet_com_2017_0476
crossref_primary_10_1109_TWC_2017_2728524
crossref_primary_10_1109_TVT_2019_2947336
crossref_primary_10_1109_ACCESS_2019_2959673
crossref_primary_10_1109_TWC_2014_2321382
crossref_primary_10_1109_ACCESS_2020_2990660
crossref_primary_10_1109_TWC_2018_2797914
crossref_primary_10_1109_TVT_2024_3426540
crossref_primary_10_1109_COMST_2015_2403614
crossref_primary_10_1007_s13369_018_3139_9
crossref_primary_10_1051_matecconf_201818904003
crossref_primary_10_1109_ACCESS_2016_2635677
crossref_primary_10_1109_TPDS_2013_206
crossref_primary_10_1109_TSP_2017_2675861
crossref_primary_10_1109_TVT_2017_2723430
crossref_primary_10_1109_COMST_2015_2394324
crossref_primary_10_1109_TWC_2014_030314_131068
crossref_primary_10_1109_TWC_2017_2723564
crossref_primary_10_1109_TWC_2013_102313_130541
crossref_primary_10_3390_s16071130
crossref_primary_10_1007_s11277_015_2368_4
crossref_primary_10_1007_s11277_016_3227_7
crossref_primary_10_1007_s11432_014_5201_x
crossref_primary_10_1088_1757_899X_864_1_012104
crossref_primary_10_1109_TWC_2014_2381264
crossref_primary_10_1002_ett_2789
crossref_primary_10_1109_TVT_2017_2724238
crossref_primary_10_1049_iet_com_2014_0960
crossref_primary_10_1109_TVT_2014_2322623
Cites_doi 10.1109/ICC.2002.997188
10.1109/JSAC.2008.081008
10.1109/TCOMM.2010.102910.090420
10.1109/TWC.2011.071411.102266
10.1109/TIT.2004.838089
10.1109/78.869048
10.1109/GLOCOM.2010.5683902
10.1109/WCNC.2009.4917875
10.1109/ACSSC.2009.5470111
10.1109/18.661517
10.1109/ISIT.2007.4557439
10.1109/TWC.2010.101310.091396
10.1109/TSP.2006.885761
10.1109/LSP.2005.853067
10.1109/TCOMM.2003.818096
10.1109/TSP.2003.821100
10.1109/TIT.2005.853304
10.1109/MCOM.2004.1341264
10.1109/JSAC.2004.830922
10.1109/ICC.2008.221
10.1109/TWC.2009.080542
10.1109/SPAWC.2009.5161790
10.1109/TIT.2006.876222
10.1109/TCOMM.2007.894117
10.1109/TIT.2003.817829
10.1109/PIMRC.2009.5450057
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright_xml – notice: 2015 INIST-CNRS
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
DOI 10.1109/TWC.2012.060212.112214
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EndPage 2688
ExternalDocumentID 26185831
10_1109_TWC_2012_060212_112214
6213033
Genre orig-research
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
AAYXX
CITATION
IQODW
RIG
ID FETCH-LOGICAL-c371t-43bb5d3f857bb4c16835a8e580001a44f5ff439e9edbc5dfbb67c9e0c0aa34ec3
IEDL.DBID RIE
ISICitedReferencesCount 55
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000306600200032&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1536-1276
IngestDate Mon Jul 21 09:14:01 EDT 2025
Sat Nov 29 02:55:02 EST 2025
Tue Nov 18 20:38:48 EST 2025
Wed Aug 27 02:52:39 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 7
Keywords Performance evaluation
Space-time codes
Relay
full-duplex transmission
distributed space-time coding
Convolutional code
Control system
Asynchronous cooperative diversity
Full duplex transmission
Duplex process
Simulation
Coding
Control method
Delay time
cooperative communications
Asynchronous transmission
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c371t-43bb5d3f857bb4c16835a8e580001a44f5ff439e9edbc5dfbb67c9e0c0aa34ec3
PageCount 9
ParticipantIDs ieee_primary_6213033
crossref_citationtrail_10_1109_TWC_2012_060212_112214
crossref_primary_10_1109_TWC_2012_060212_112214
pascalfrancis_primary_26185831
PublicationCentury 2000
PublicationDate 2012-07-01
PublicationDateYYYYMMDD 2012-07-01
PublicationDate_xml – month: 07
  year: 2012
  text: 2012-07-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle IEEE transactions on wireless communications
PublicationTitleAbbrev TWC
PublicationYear 2012
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref27
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref27
  doi: 10.1109/ICC.2002.997188
– ident: ref9
  doi: 10.1109/JSAC.2008.081008
– ident: ref4
  doi: 10.1109/TCOMM.2010.102910.090420
– ident: ref17
  doi: 10.1109/TWC.2011.071411.102266
– ident: ref3
  doi: 10.1109/TIT.2004.838089
– ident: ref25
  doi: 10.1109/78.869048
– ident: ref24
  doi: 10.1109/GLOCOM.2010.5683902
– ident: ref18
  doi: 10.1109/WCNC.2009.4917875
– ident: ref16
  doi: 10.1109/ACSSC.2009.5470111
– ident: ref26
  doi: 10.1109/18.661517
– ident: ref23
  doi: 10.1109/ISIT.2007.4557439
– ident: ref10
  doi: 10.1109/TWC.2010.101310.091396
– ident: ref11
  doi: 10.1109/TSP.2006.885761
– ident: ref6
  doi: 10.1109/LSP.2005.853067
– ident: ref2
  doi: 10.1109/TCOMM.2003.818096
– ident: ref13
  doi: 10.1109/TSP.2003.821100
– ident: ref19
  doi: 10.1109/TIT.2005.853304
– ident: ref5
  doi: 10.1109/MCOM.2004.1341264
– ident: ref12
  doi: 10.1109/JSAC.2004.830922
– ident: ref20
  doi: 10.1109/ICC.2008.221
– ident: ref14
  doi: 10.1109/TWC.2009.080542
– ident: ref15
  doi: 10.1109/SPAWC.2009.5161790
– ident: ref22
  doi: 10.1109/TIT.2006.876222
– ident: ref21
  doi: 10.1109/TCOMM.2007.894117
– ident: ref8
  doi: 10.1109/TIT.2003.817829
– ident: ref1
  doi: 10.1109/TCOMM.2003.818096
– ident: ref7
  doi: 10.1109/PIMRC.2009.5450057
SSID ssj0017655
Score 2.3078387
Snippet In this paper, we propose two distributed linear convolutional space-time coding (DLC-STC) schemes for full-duplex (FD) asynchronous cooperative...
SourceID pascalfrancis
crossref
ieee
SourceType Index Database
Enrichment Source
Publisher
StartPage 2680
SubjectTerms Applied sciences
Asynchronous cooperative diversity
Channel estimation
Coding, codes
cooperative communications
Delay
distributed space-time coding
Encoding
Exact sciences and technology
full-duplex transmission
Generators
High definition video
Information, signal and communications theory
Interference
Relays
Signal and communications theory
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Title Distributed Space-Time Coding for Full-Duplex Asynchronous Cooperative Communications
URI https://ieeexplore.ieee.org/document/6213033
Volume 11
WOSCitedRecordID wos000306600200032&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/IET Electronic Library
  issn: 1536-1276
  databaseCode: RIE
  dateStart: 20020101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0017655
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS-RAEC5UPOjBx7riuCo5eNw4SbrTj6OMiicRVPQW-lENgkyGyYy4_367kmxwQFi8BdJFQld36qt01fcBnNvcWI5YpE54k3Idc1btfEh5YYKQqLRnphWbkHd36uVF36_B76EXBhHb4jO8oMv2LN_Xbkm_ysaioC8uW4d1KUXXqzWcGEjRKpzGDUy6MlL03cB5psePzxOq4SouMkGE5tQ1U-R8JRC1yipUF2maODWh07T4FGhudr_3inuw0wPK5LJbAfuwhtMfsP2JZvAAnq6IHZeErdAnDzFJxpQ6P5JJTYEribA1oUw0vVrO3vAjuWz-TB1x5tbLJo6pZ9ixgycrzSTNT3i6uX6c3Ka9nELqmMwXKWfWlp4FVUpructFBF9GYakI5xnOQxlChCeo0VtX-mCtkE5j5jJjGEfHDmFjWk_xCBKR2WCZ9sq4wIWSyhQe8yCD8gTgshGU_-a2cj3XOElevFVtzpHpKvqkIp9UnU-qzicjGA92s45t478WB-SEYXQ__yM4W3HlcD8mjKpULD_-2u4XbNEzunrcE9hYzJd4CpvuffHazM_aFfcXgNPTfQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS9xAEB6sLbR9qLUqvVZtHnxsvCS72R-PciqW2kPwpL6F_TELglwOc1fqf-9OkgYPCqVvgeyQsLOb-SY7830ARzY3liMWqRPepFzHnFU7H1JemCAkKu2ZacUm5HSqbm_11QZ8HXphELEtPsNjumzP8n3tVvSrbCwK-uKyF_Cy5LzIum6t4cxAilbjNG5hUpaRou8HzjM9nv2cUBVXcZwJojSnvpki52uhqNVWocpI08TJCZ2qxbNQc771fy_5Ht71kDI56dbANmzg_AO8fUY0uAM3p8SPS9JW6JPrmCZjSr0fyaSm0JVE4JpQLpqerhb3-Ds5aR7njlhz61UTx9QL7PjBk7V2kmYXbs7PZpOLtBdUSB2T-TLlzNrSs6BKaS13uYjwyygsFSE9w3koQ4gABTV660ofrBXSacxcZgzj6NgebM7rOX6ERGQ2WKa9Mi5woaQyhcc8yKA8QbhsBOWfua1czzZOohf3VZt1ZLqKPqnIJ1Xnk6rzyQjGg92i49v4p8UOOWEY3c__CA7XXDncjymjKhXLP_3d7gu8vpj9uKwuv02_f4Y39LyuOncfNpcPKzyAV-7X8q55OGxX3xOqatbE
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=Distributed+Space-Time+Coding+for+Full-Duplex+Asynchronous+Cooperative+Communications&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Liu%2C+Yi&rft.au=Xia%2C+Xiang-Gen&rft.au=Zhang%2C+Hailin&rft.date=2012-07-01&rft.issn=1536-1276&rft.volume=11&rft.issue=7&rft.spage=2680&rft.epage=2688&rft_id=info:doi/10.1109%2FTWC.2012.060212.112214&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TWC_2012_060212_112214
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon