{"title":"近BER最优部分响应码","authors":"V. Rusek, John B. Anderson","doi":"10.1109/ISIT.2005.1523393","DOIUrl":null,"url":null,"abstract":"Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to noise ratios. The BER objective function is no longer linear, but it is still convex","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"47 11","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Near BER optimal partial response codes\",\"authors\":\"V. Rusek, John B. Anderson\",\"doi\":\"10.1109/ISIT.2005.1523393\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to noise ratios. The BER objective function is no longer linear, but it is still convex\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"47 11\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523393\",\"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. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Partial response signaling (PRS) codes with maximal minimum Euclidean distance have previously been found by linear programming. These perform very well in the narrowband-high energy region, but they were not optimized for minimal bit error rate (BER), so they are only optimal in the limit of infinite signal to noise ratio. Here we search for codes that perform better for more practical signal to noise ratios. The BER objective function is no longer linear, but it is still convex
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
