{"title":"基于哈达玛矩阵的几种MIMO编码调制","authors":"A. Kreshchuk, V. Potapov","doi":"10.1109/RED.2012.6338402","DOIUrl":null,"url":null,"abstract":"In this paper we consider the coded modulation for Multiple Input Multiple Output (MIMO) channels described earlier in [1]. We study the Permutation Free (PF) and Permutation and Repetition Free (PRF) codes and their cardinality. We propose a new lower bound on PF and PRF code cardinality. We compare it to existing codes cardinality and to the existing upper bound. Then we study the error correction efficiency of these codes with computer simulation. The results of the simulation show that error correction efficiency increases with the length of the PF or PRF code.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On some MIMO coded modulations based on hadamard matrices\",\"authors\":\"A. Kreshchuk, V. Potapov\",\"doi\":\"10.1109/RED.2012.6338402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the coded modulation for Multiple Input Multiple Output (MIMO) channels described earlier in [1]. We study the Permutation Free (PF) and Permutation and Repetition Free (PRF) codes and their cardinality. We propose a new lower bound on PF and PRF code cardinality. We compare it to existing codes cardinality and to the existing upper bound. Then we study the error correction efficiency of these codes with computer simulation. The results of the simulation show that error correction efficiency increases with the length of the PF or PRF code.\",\"PeriodicalId\":403644,\"journal\":{\"name\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RED.2012.6338402\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2012.6338402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On some MIMO coded modulations based on hadamard matrices
In this paper we consider the coded modulation for Multiple Input Multiple Output (MIMO) channels described earlier in [1]. We study the Permutation Free (PF) and Permutation and Repetition Free (PRF) codes and their cardinality. We propose a new lower bound on PF and PRF code cardinality. We compare it to existing codes cardinality and to the existing upper bound. Then we study the error correction efficiency of these codes with computer simulation. The results of the simulation show that error correction efficiency increases with the length of the PF or PRF code.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
