{"title":"PR通道上常规LDPC代码的阈值","authors":"A. Thangaraj, S. McLaughlin","doi":"10.1109/ISIT.2001.935933","DOIUrl":null,"url":null,"abstract":"We consider a graphical procedure to calculate the coding threshold for regular low-density parity-check (LDPC) codes over binary-input partial response (PR) channels using Gaussian approximations. The calculated threshold, while serving as a target for design of LDPC codes over PR channels, can also be used as a upper bound on the capacity-achieving SNR of PR channels.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Threshold for regular LDPC codes over PR channels\",\"authors\":\"A. Thangaraj, S. McLaughlin\",\"doi\":\"10.1109/ISIT.2001.935933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a graphical procedure to calculate the coding threshold for regular low-density parity-check (LDPC) codes over binary-input partial response (PR) channels using Gaussian approximations. The calculated threshold, while serving as a target for design of LDPC codes over PR channels, can also be used as a upper bound on the capacity-achieving SNR of PR channels.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"51 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935933\",\"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. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider a graphical procedure to calculate the coding threshold for regular low-density parity-check (LDPC) codes over binary-input partial response (PR) channels using Gaussian approximations. The calculated threshold, while serving as a target for design of LDPC codes over PR channels, can also be used as a upper bound on the capacity-achieving SNR of PR channels.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
