{"title":"准静态衰落信道中空时码的Gallager界","authors":"Cong Ling","doi":"10.1109/ITW2.2006.323842","DOIUrl":null,"url":null,"abstract":"Gallager's bounding techniques are employed to derive tight upper bounds on the decoding error probability of space-time codes in quasi-static Rayleigh fading channels. The bounds converge rapidly and are within a few decibels from simulation results. Moreover, they permit efficient numerical computation, which represents a major advantage over the existing limit-before-average technique. Therefore, the proposed bounds are a meaningful and practical tool for performance analysis and computer search of good space-time codes","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Gallager Bounds for Space-Time Codes in Quasi-Static Fading Channels\",\"authors\":\"Cong Ling\",\"doi\":\"10.1109/ITW2.2006.323842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gallager's bounding techniques are employed to derive tight upper bounds on the decoding error probability of space-time codes in quasi-static Rayleigh fading channels. The bounds converge rapidly and are within a few decibels from simulation results. Moreover, they permit efficient numerical computation, which represents a major advantage over the existing limit-before-average technique. Therefore, the proposed bounds are a meaningful and practical tool for performance analysis and computer search of good space-time codes\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gallager Bounds for Space-Time Codes in Quasi-Static Fading Channels
Gallager's bounding techniques are employed to derive tight upper bounds on the decoding error probability of space-time codes in quasi-static Rayleigh fading channels. The bounds converge rapidly and are within a few decibels from simulation results. Moreover, they permit efficient numerical computation, which represents a major advantage over the existing limit-before-average technique. Therefore, the proposed bounds are a meaningful and practical tool for performance analysis and computer search of good space-time codes
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
