{"title":"基于图的部分响应信道高速率软可解码码构造","authors":"B. Vasic","doi":"10.1109/ICC.2001.936644","DOIUrl":null,"url":null,"abstract":"In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.","PeriodicalId":203874,"journal":{"name":"ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A graph based construction of high-rate soft decodable codes for partial response channels\",\"authors\":\"B. Vasic\",\"doi\":\"10.1109/ICC.2001.936644\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.\",\"PeriodicalId\":203874,\"journal\":{\"name\":\"ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.2001.936644\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2001.936644","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A graph based construction of high-rate soft decodable codes for partial response channels
In partial response systems with maximum likelihood sequence estimation a short list of error events dominate. In this paper we introduce a graph-based construction of high rate codes capable of correcting errors from a given list. We define a directed graph describing a universe of error-event-detecting codes, and construct a code by tracing a path through the graph that gives the best probability of error. We demonstrate a substantial SNR gain when these codes are used in a scheme which combines the error event detection and the list soft decoding.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
