串联内核代码的性能评估

2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN) Pub Date : 2017-03-01 DOI:10.1109/ICSCN.2017.8085667

C. P. Kumar, R. Selvakumar

{"title":"串联内核代码的性能评估","authors":"C. P. Kumar, R. Selvakumar","doi":"10.1109/ICSCN.2017.8085667","DOIUrl":null,"url":null,"abstract":"Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance evaluation of concatenated kernel codes\",\"authors\":\"C. P. Kumar, R. Selvakumar\",\"doi\":\"10.1109/ICSCN.2017.8085667\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.\",\"PeriodicalId\":383458,\"journal\":{\"name\":\"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSCN.2017.8085667\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCN.2017.8085667","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

Forney提出的级联码在数字通信中得到了广泛的应用。本文通过串接内核码，构造了由内码和外码组成的一类群码。通过实例讨论了串接内核代码的二进制和非二进制变体。构造的连接内核代码在网格上表示。给出了连接内核代码的最小网格表示，并讨论了其状态复杂度特征。从误码率的角度对串接内核代码进行了性能评价。结果表明，随机选择组的串接核码比随机选择同态的编码增益的串接核码性能更好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Performance evaluation of concatenated kernel codes

Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)

自引率

0.00%

发文量