{"title":"连接树代码和相关方案","authors":"L. Ping, B. Bai, K.W.W. Leung","doi":"10.1109/ITW.2001.955141","DOIUrl":null,"url":null,"abstract":"We report the progress in concatenated tree (CT) codes and related schemes, including low rate codes for CDMA applications and bandwidth efficient coded modulation schemes. It is shown that CT codes provide efficient solutions for various situations. Near capacity performances (within about 0.5 dB) can be achieved at significantly reduced decoding costs.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"86 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Concatenated tree codes and related schemes\",\"authors\":\"L. Ping, B. Bai, K.W.W. Leung\",\"doi\":\"10.1109/ITW.2001.955141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We report the progress in concatenated tree (CT) codes and related schemes, including low rate codes for CDMA applications and bandwidth efficient coded modulation schemes. It is shown that CT codes provide efficient solutions for various situations. Near capacity performances (within about 0.5 dB) can be achieved at significantly reduced decoding costs.\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"86 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We report the progress in concatenated tree (CT) codes and related schemes, including low rate codes for CDMA applications and bandwidth efficient coded modulation schemes. It is shown that CT codes provide efficient solutions for various situations. Near capacity performances (within about 0.5 dB) can be achieved at significantly reduced decoding costs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
