结合CPM的卷积码m算法译码

W. Finamore, C. Pimentel, J.B. Anderson
{"title":"结合CPM的卷积码m算法译码","authors":"W. Finamore, C. Pimentel, J.B. Anderson","doi":"10.1109/ITS.1990.175658","DOIUrl":null,"url":null,"abstract":"The performance of convolutional codes combined with continuous phase modulation schemes (CC/CPM) with M-algorithm decoding is evaluated by computer simulation. New CC/CPM schemes with a feedback convolutional encoder having, in some cases, better distances than previous CC/CPM which uses a feedforward encoder, are presented. Comparison of CC/CPM and CPM, constrained to the same complexity and bandwidth, shows that the former have a better performance. The simulation results also corroborate the fact that the M-algorithm is far more efficient than the Viterbi algorithm.<<ETX>>","PeriodicalId":405932,"journal":{"name":"SBT/IEEE International Symposium on Telecommunications","volume":"395 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"M-algorithm decoding of convolutional code combined with CPM\",\"authors\":\"W. Finamore, C. Pimentel, J.B. Anderson\",\"doi\":\"10.1109/ITS.1990.175658\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of convolutional codes combined with continuous phase modulation schemes (CC/CPM) with M-algorithm decoding is evaluated by computer simulation. New CC/CPM schemes with a feedback convolutional encoder having, in some cases, better distances than previous CC/CPM which uses a feedforward encoder, are presented. Comparison of CC/CPM and CPM, constrained to the same complexity and bandwidth, shows that the former have a better performance. The simulation results also corroborate the fact that the M-algorithm is far more efficient than the Viterbi algorithm.<<ETX>>\",\"PeriodicalId\":405932,\"journal\":{\"name\":\"SBT/IEEE International Symposium on Telecommunications\",\"volume\":\"395 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SBT/IEEE International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.1990.175658\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SBT/IEEE International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.1990.175658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

通过计算机仿真对卷积码与连续相位调制方案(CC/CPM)结合m算法译码的性能进行了评价。在某些情况下,采用反馈卷积编码器的CC/CPM方案比以前使用前馈编码器的CC/CPM具有更好的距离。CC/CPM与CPM在相同复杂度和带宽约束下的性能比较表明,CC/CPM具有更好的性能。仿真结果也证实了m算法的效率远高于Viterbi算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
M-algorithm decoding of convolutional code combined with CPM
The performance of convolutional codes combined with continuous phase modulation schemes (CC/CPM) with M-algorithm decoding is evaluated by computer simulation. New CC/CPM schemes with a feedback convolutional encoder having, in some cases, better distances than previous CC/CPM which uses a feedforward encoder, are presented. Comparison of CC/CPM and CPM, constrained to the same complexity and bandwidth, shows that the former have a better performance. The simulation results also corroborate the fact that the M-algorithm is far more efficient than the Viterbi algorithm.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信