{"title":"最大化增量冗余方案平均码率的解析方法","authors":"E. Uhlemann, L. Rasmussen","doi":"10.1109/APCC.2005.1554106","DOIUrl":null,"url":null,"abstract":"An analytical design procedure for maximizing the average code rate of incremental redundancy retransmission schemes is presented. Union bounds are used as the tool to select good puncturing patterns and to obtain bounds on frame error rate for the punctured codes. This, in turn, is used for determining the optimal packet size of each retransmission, so that the average code rate is maximized","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Analytical Approach for Maximizing the Average Code Rate of Incremental Redundancy Schemes\",\"authors\":\"E. Uhlemann, L. Rasmussen\",\"doi\":\"10.1109/APCC.2005.1554106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An analytical design procedure for maximizing the average code rate of incremental redundancy retransmission schemes is presented. Union bounds are used as the tool to select good puncturing patterns and to obtain bounds on frame error rate for the punctured codes. This, in turn, is used for determining the optimal packet size of each retransmission, so that the average code rate is maximized\",\"PeriodicalId\":176147,\"journal\":{\"name\":\"2005 Asia-Pacific Conference on Communications\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2005.1554106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2005.1554106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analytical Approach for Maximizing the Average Code Rate of Incremental Redundancy Schemes
An analytical design procedure for maximizing the average code rate of incremental redundancy retransmission schemes is presented. Union bounds are used as the tool to select good puncturing patterns and to obtain bounds on frame error rate for the punctured codes. This, in turn, is used for determining the optimal packet size of each retransmission, so that the average code rate is maximized