{"title":"衰落信道下卷积码性能的新界限","authors":"R.D. Cideciyan, E. Eleftherion","doi":"10.1109/ISIT.1994.395010","DOIUrl":null,"url":null,"abstract":"New tight upper bounds on the performance or convolutional codes over Rayleigh and Rician fading channels are presented. These bounds can be expressed in terms of the generating function or the convolutional codes and are particularly tight for bit error rates lower than 10/sup -3/.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"New bounds on convolutional code performance over fading channels\",\"authors\":\"R.D. Cideciyan, E. Eleftherion\",\"doi\":\"10.1109/ISIT.1994.395010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"New tight upper bounds on the performance or convolutional codes over Rayleigh and Rician fading channels are presented. These bounds can be expressed in terms of the generating function or the convolutional codes and are particularly tight for bit error rates lower than 10/sup -3/.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.395010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.395010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New bounds on convolutional code performance over fading channels
New tight upper bounds on the performance or convolutional codes over Rayleigh and Rician fading channels are presented. These bounds can be expressed in terms of the generating function or the convolutional codes and are particularly tight for bit error rates lower than 10/sup -3/.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
