{"title":"协同分集放大转发中继网络中非二进制LDPC码的低复杂度解码器设计","authors":"Yier Yan, Ying Guo, M. Lee","doi":"10.1109/ISSSTA.2010.5650020","DOIUrl":null,"url":null,"abstract":"In this paper, a simple cooperative diversity scheme in M + 2 relay network with low-density parity-check (LDPC) codes is proposed. By allocating random interleavers to each relay node, the interleaved sequences provide M copies of received vector to achieve the cooperative diversity. An efficiently iterative coding algorithm is proposed with low complexity. The complexity involved grows linearly with the number of relay nodes and size of Galois Field.","PeriodicalId":433699,"journal":{"name":"2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Low complexity decoder design of non-binary LDPC codes in amplify-and-forward relay networks with cooperative diversity\",\"authors\":\"Yier Yan, Ying Guo, M. Lee\",\"doi\":\"10.1109/ISSSTA.2010.5650020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a simple cooperative diversity scheme in M + 2 relay network with low-density parity-check (LDPC) codes is proposed. By allocating random interleavers to each relay node, the interleaved sequences provide M copies of received vector to achieve the cooperative diversity. An efficiently iterative coding algorithm is proposed with low complexity. The complexity involved grows linearly with the number of relay nodes and size of Galois Field.\",\"PeriodicalId\":433699,\"journal\":{\"name\":\"2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2010.5650020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 11th International Symposium on Spread Spectrum Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2010.5650020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low complexity decoder design of non-binary LDPC codes in amplify-and-forward relay networks with cooperative diversity
In this paper, a simple cooperative diversity scheme in M + 2 relay network with low-density parity-check (LDPC) codes is proposed. By allocating random interleavers to each relay node, the interleaved sequences provide M copies of received vector to achieve the cooperative diversity. An efficiently iterative coding algorithm is proposed with low complexity. The complexity involved grows linearly with the number of relay nodes and size of Galois Field.