多址中继网络的空时网格码:空间分集与时间分集的优势

Cheng-Chun Chang, Heung-no Lee
{"title":"多址中继网络的空时网格码:空间分集与时间分集的优势","authors":"Cheng-Chun Chang, Heung-no Lee","doi":"10.1109/ITA.2007.4357565","DOIUrl":null,"url":null,"abstract":"We consider a wireless multiple access network where the sender nodes are aided by a number of relay nodes. A transmission of bit-messages is completed in two phases: in the first phase each sender node originates its message which is overheard at the relay node, and in the second phase each relay node transmits the parity bit calculated from the overheard bit-messages. The low-density parity-check codes are used at the sender nodes in the time-domain, and the low-density generator-matrix code is formed across the spatial domain. At the access node, the received bits from multiple sender nodes and relay nodes are thus encoded in both the time and the spatial domain. We call this combination a space-time mesh code here. In this paper, an iterative decoding scheme is designed for the mesh code and its BER performance in AWGN, fast Rayleigh fading, and quasi-static Rayleigh fading channels are investigated. We note that there is an important trade-off relation between the time-domain and the spatial domain coding. Namely, the time-domain coding is desired when the channel exhibits fast fading; while the spatial domain coding is preferred when the channel is in quasi-static fading state.","PeriodicalId":439952,"journal":{"name":"2007 Information Theory and Applications Workshop","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Space-Time Mesh Codes for the Multiple-Access Relay Network: Space vs. Time Diversity Benefits\",\"authors\":\"Cheng-Chun Chang, Heung-no Lee\",\"doi\":\"10.1109/ITA.2007.4357565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a wireless multiple access network where the sender nodes are aided by a number of relay nodes. A transmission of bit-messages is completed in two phases: in the first phase each sender node originates its message which is overheard at the relay node, and in the second phase each relay node transmits the parity bit calculated from the overheard bit-messages. The low-density parity-check codes are used at the sender nodes in the time-domain, and the low-density generator-matrix code is formed across the spatial domain. At the access node, the received bits from multiple sender nodes and relay nodes are thus encoded in both the time and the spatial domain. We call this combination a space-time mesh code here. In this paper, an iterative decoding scheme is designed for the mesh code and its BER performance in AWGN, fast Rayleigh fading, and quasi-static Rayleigh fading channels are investigated. We note that there is an important trade-off relation between the time-domain and the spatial domain coding. Namely, the time-domain coding is desired when the channel exhibits fast fading; while the spatial domain coding is preferred when the channel is in quasi-static fading state.\",\"PeriodicalId\":439952,\"journal\":{\"name\":\"2007 Information Theory and Applications Workshop\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2007.4357565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2007.4357565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

我们考虑一个无线多址网络,其中发送节点由许多中继节点辅助。位消息的传输分两个阶段完成:在第一阶段,每个发送节点发出自己的消息,该消息被中继节点窃听;在第二阶段,每个中继节点发送由窃听到的位消息计算出的奇偶校验位。在时间域的发送节点上使用低密度的奇偶校验码,在空间域上形成低密度的生成矩阵码。因此,在接入节点上,从多个发送方节点和中继节点接收的位在时间和空间域中进行编码。我们称这种组合为时空网格代码。本文设计了一种网格码的迭代译码方案,并研究了该方案在AWGN、快速瑞利衰落和准静态瑞利衰落信道下的误码率性能。我们注意到时域和空域编码之间存在重要的权衡关系。即,当信道呈现快速衰落时,需要进行时域编码;而当信道处于准静态衰落状态时,首选空域编码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Space-Time Mesh Codes for the Multiple-Access Relay Network: Space vs. Time Diversity Benefits
We consider a wireless multiple access network where the sender nodes are aided by a number of relay nodes. A transmission of bit-messages is completed in two phases: in the first phase each sender node originates its message which is overheard at the relay node, and in the second phase each relay node transmits the parity bit calculated from the overheard bit-messages. The low-density parity-check codes are used at the sender nodes in the time-domain, and the low-density generator-matrix code is formed across the spatial domain. At the access node, the received bits from multiple sender nodes and relay nodes are thus encoded in both the time and the spatial domain. We call this combination a space-time mesh code here. In this paper, an iterative decoding scheme is designed for the mesh code and its BER performance in AWGN, fast Rayleigh fading, and quasi-static Rayleigh fading channels are investigated. We note that there is an important trade-off relation between the time-domain and the spatial domain coding. Namely, the time-domain coding is desired when the channel exhibits fast fading; while the spatial domain coding is preferred when the channel is in quasi-static fading state.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信