{"title":"密集MIMO矩阵格及其构造中的类场论主题","authors":"J. Lahtonen","doi":"10.1109/ITWITWN.2007.4318040","DOIUrl":null,"url":null,"abstract":"Since the cyclic division algebras and their orders have become standard material for researchers seeking to construct good MIMO-lattices. The usual construction of the actual lattice corresponds to a cyclic submodule of an order. In a recent submission we studied the problem of identifying those cyclic division algebras that consume the least amount of the available signal space for a given minimum determinant. In this semi-tutorial note some of the material from is recapped together with hopefully illuminating examples. We also motivate our concept of density by previewing upper and lower bounds, and taking a closer look at some of the suggested MIMO-lattices in relation to these bounds.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"168 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction\",\"authors\":\"J. Lahtonen\",\"doi\":\"10.1109/ITWITWN.2007.4318040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the cyclic division algebras and their orders have become standard material for researchers seeking to construct good MIMO-lattices. The usual construction of the actual lattice corresponds to a cyclic submodule of an order. In a recent submission we studied the problem of identifying those cyclic division algebras that consume the least amount of the available signal space for a given minimum determinant. In this semi-tutorial note some of the material from is recapped together with hopefully illuminating examples. We also motivate our concept of density by previewing upper and lower bounds, and taking a closer look at some of the suggested MIMO-lattices in relation to these bounds.\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"168 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318040\",\"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 Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction
Since the cyclic division algebras and their orders have become standard material for researchers seeking to construct good MIMO-lattices. The usual construction of the actual lattice corresponds to a cyclic submodule of an order. In a recent submission we studied the problem of identifying those cyclic division algebras that consume the least amount of the available signal space for a given minimum determinant. In this semi-tutorial note some of the material from is recapped together with hopefully illuminating examples. We also motivate our concept of density by previewing upper and lower bounds, and taking a closer look at some of the suggested MIMO-lattices in relation to these bounds.