{"title":"基于原生图的咬尾LDPC卷积码","authors":"M. Tavares, K. Zigangirov, G. Fettweis","doi":"10.1109/VETECF.2007.227","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce and investigate the tail- biting low-density parity-check convolutional codes (LDPCCCs) based on protographs. We show a construction algorithm for these codes, which is based on a modified version of the PEG algorithm [1] and on the unwrapping [2] technique. The basic ideas behind the decoder architecture for these codes are also discussed. Finally, the performances of the tail-biting LDPCCCs based on protographs are evaluated through computer simulations, where we also examine a family of rate-compatible codes.","PeriodicalId":261917,"journal":{"name":"2007 IEEE 66th Vehicular Technology Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Tail-Biting LDPC Convolutional Codes Based on Protographs\",\"authors\":\"M. Tavares, K. Zigangirov, G. Fettweis\",\"doi\":\"10.1109/VETECF.2007.227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce and investigate the tail- biting low-density parity-check convolutional codes (LDPCCCs) based on protographs. We show a construction algorithm for these codes, which is based on a modified version of the PEG algorithm [1] and on the unwrapping [2] technique. The basic ideas behind the decoder architecture for these codes are also discussed. Finally, the performances of the tail-biting LDPCCCs based on protographs are evaluated through computer simulations, where we also examine a family of rate-compatible codes.\",\"PeriodicalId\":261917,\"journal\":{\"name\":\"2007 IEEE 66th Vehicular Technology Conference\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 66th Vehicular Technology Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VETECF.2007.227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 66th Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECF.2007.227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tail-Biting LDPC Convolutional Codes Based on Protographs
In this paper, we introduce and investigate the tail- biting low-density parity-check convolutional codes (LDPCCCs) based on protographs. We show a construction algorithm for these codes, which is based on a modified version of the PEG algorithm [1] and on the unwrapping [2] technique. The basic ideas behind the decoder architecture for these codes are also discussed. Finally, the performances of the tail-biting LDPCCCs based on protographs are evaluated through computer simulations, where we also examine a family of rate-compatible codes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
