N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis
{"title":"为实现任意分集顺序的空间耦合码设计原型机","authors":"N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis","doi":"10.1109/ITWF.2015.7360752","DOIUrl":null,"url":null,"abstract":"This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Protograph design for spatially-coupled codes to attain an arbitrary diversity order\",\"authors\":\"N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis\",\"doi\":\"10.1109/ITWF.2015.7360752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.\",\"PeriodicalId\":281890,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWF.2015.7360752\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop - Fall (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWF.2015.7360752","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Protograph design for spatially-coupled codes to attain an arbitrary diversity order
This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.