{"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}
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.