Dawei Yin, Xiaojing Zhang, Xichao Shu, Guiying Yan, Guanghui Wang
{"title":"利用图谱搜索好的不规则低密度奇偶校验码","authors":"Dawei Yin, Xiaojing Zhang, Xichao Shu, Guiying Yan, Guanghui Wang","doi":"10.1109/PIMRC50174.2021.9569696","DOIUrl":null,"url":null,"abstract":"Research on the expander code shows that for a regular low-density parity-check (LDPC) code, the Tanner graph’s spectrum determines its properties, such as the minimum distance and the size of stopping sets. In this study, we demonstrate theoretically and experimentally that the performance of irregular LDPC codes is related to the graph spectrum. Our observations may provide an efficient metric to search for good irregular LDPC codes.","PeriodicalId":283606,"journal":{"name":"2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum\",\"authors\":\"Dawei Yin, Xiaojing Zhang, Xichao Shu, Guiying Yan, Guanghui Wang\",\"doi\":\"10.1109/PIMRC50174.2021.9569696\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Research on the expander code shows that for a regular low-density parity-check (LDPC) code, the Tanner graph’s spectrum determines its properties, such as the minimum distance and the size of stopping sets. In this study, we demonstrate theoretically and experimentally that the performance of irregular LDPC codes is related to the graph spectrum. Our observations may provide an efficient metric to search for good irregular LDPC codes.\",\"PeriodicalId\":283606,\"journal\":{\"name\":\"2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC50174.2021.9569696\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC50174.2021.9569696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum
Research on the expander code shows that for a regular low-density parity-check (LDPC) code, the Tanner graph’s spectrum determines its properties, such as the minimum distance and the size of stopping sets. In this study, we demonstrate theoretically and experimentally that the performance of irregular LDPC codes is related to the graph spectrum. Our observations may provide an efficient metric to search for good irregular LDPC codes.