{"title":"最小复杂性设计的分析描述网格代码","authors":"J. M. Turgeon, P. McLane","doi":"10.1109/ICC.1988.13653","DOIUrl":null,"url":null,"abstract":"G. Ungerboeck (1982) has shown how to specify trellis codes that have some power gain and the same bandwidth as their corresponding uncoded schemes. He realizes his trellis codes by a convolutional encoder followed by a mapping rule. R. Calderbank and J.E. Mazo (1984) have shown how to realize these two operations in a single-step procedure, thus yielding analytically described trellis codes. These ideas are extended to any number of dimensions and to rotationally invariant trellis codes. Design rules that yield minimal complexity for analytically described trellis codes are presented, and these rules generally provide a hand design for trellis codes. A 2-D and 4-D example are used to illustrate the author's approach.<<ETX>>","PeriodicalId":191242,"journal":{"name":"IEEE International Conference on Communications, - Spanning the Universe.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Minimal complexity design of analytically described trellis codes\",\"authors\":\"J. M. Turgeon, P. McLane\",\"doi\":\"10.1109/ICC.1988.13653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"G. Ungerboeck (1982) has shown how to specify trellis codes that have some power gain and the same bandwidth as their corresponding uncoded schemes. He realizes his trellis codes by a convolutional encoder followed by a mapping rule. R. Calderbank and J.E. Mazo (1984) have shown how to realize these two operations in a single-step procedure, thus yielding analytically described trellis codes. These ideas are extended to any number of dimensions and to rotationally invariant trellis codes. Design rules that yield minimal complexity for analytically described trellis codes are presented, and these rules generally provide a hand design for trellis codes. A 2-D and 4-D example are used to illustrate the author's approach.<<ETX>>\",\"PeriodicalId\":191242,\"journal\":{\"name\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1988.13653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Communications, - Spanning the Universe.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1988.13653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
摘要
G. Ungerboeck(1982)展示了如何指定与相应的未编码方案具有一定功率增益和相同带宽的网格码。他通过一个卷积编码器和一个映射规则来实现他的网格代码。R. Calderbank和J.E. Mazo(1984)展示了如何在一个单步过程中实现这两个操作，从而产生分析描述的网格代码。这些思想被扩展到任意数量的维度和旋转不变的网格代码。本文提出了对分析描述的网格代码产生最小复杂性的设计规则，这些规则通常为网格代码提供了一种手工设计。一个二维和四维的例子被用来说明作者的方法。
Minimal complexity design of analytically described trellis codes
G. Ungerboeck (1982) has shown how to specify trellis codes that have some power gain and the same bandwidth as their corresponding uncoded schemes. He realizes his trellis codes by a convolutional encoder followed by a mapping rule. R. Calderbank and J.E. Mazo (1984) have shown how to realize these two operations in a single-step procedure, thus yielding analytically described trellis codes. These ideas are extended to any number of dimensions and to rotationally invariant trellis codes. Design rules that yield minimal complexity for analytically described trellis codes are presented, and these rules generally provide a hand design for trellis codes. A 2-D and 4-D example are used to illustrate the author's approach.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
