高斯多址信道的k用户并行连接代码

Guanghui Song, Jun Cheng, Y. Watanabe
{"title":"高斯多址信道的k用户并行连接代码","authors":"Guanghui Song, Jun Cheng, Y. Watanabe","doi":"10.1109/ICC.2013.6655052","DOIUrl":null,"url":null,"abstract":"A k-user parallel concatenated code (PCC) is proposed for a Gaussian multiple-access channel with symbol synchronization and equal power users. In this code, each user employs a PCC with M + 1 component codes, where the first component code is a rate 1/q repetition code and the other M component codes are the same rate-1 convolutional code 1/1+D. The K-user PCC achieves a larger maximum sum rate, at the high rate region, than the conventional scheme of an error correction code serially concatenated with a spreading.","PeriodicalId":6368,"journal":{"name":"2013 IEEE International Conference on Communications (ICC)","volume":"407 1","pages":"3286-3291"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"K-user parallel concatenated code for Gaussian multiple-access channel\",\"authors\":\"Guanghui Song, Jun Cheng, Y. Watanabe\",\"doi\":\"10.1109/ICC.2013.6655052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A k-user parallel concatenated code (PCC) is proposed for a Gaussian multiple-access channel with symbol synchronization and equal power users. In this code, each user employs a PCC with M + 1 component codes, where the first component code is a rate 1/q repetition code and the other M component codes are the same rate-1 convolutional code 1/1+D. The K-user PCC achieves a larger maximum sum rate, at the high rate region, than the conventional scheme of an error correction code serially concatenated with a spreading.\",\"PeriodicalId\":6368,\"journal\":{\"name\":\"2013 IEEE International Conference on Communications (ICC)\",\"volume\":\"407 1\",\"pages\":\"3286-3291\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2013.6655052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2013.6655052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对具有符号同步和等功率用户的高斯多址信道,提出了一种k用户并行级联码(PCC)。在此代码中,每个用户使用具有M + 1分量代码的PCC,其中第一个分量代码是速率为1/q的重复代码,其他M分量代码是相同速率为1的卷积代码1/1+D。在高速率区域,k用户PCC比传统的纠错码串行连接扩频方案实现了更大的最大和速率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
K-user parallel concatenated code for Gaussian multiple-access channel
A k-user parallel concatenated code (PCC) is proposed for a Gaussian multiple-access channel with symbol synchronization and equal power users. In this code, each user employs a PCC with M + 1 component codes, where the first component code is a rate 1/q repetition code and the other M component codes are the same rate-1 convolutional code 1/1+D. The K-user PCC achieves a larger maximum sum rate, at the high rate region, than the conventional scheme of an error correction code serially concatenated with a spreading.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信