Abinesh Ramakrishnan, S. Krishnamurthy, S. Jafar, Yaming Yu
{"title":"具有秩亏转移矩阵的干扰信道的自由度","authors":"Abinesh Ramakrishnan, S. Krishnamurthy, S. Jafar, Yaming Yu","doi":"10.1109/ISIT.2014.6875027","DOIUrl":null,"url":null,"abstract":"We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel coefficients. We present a modified version of the [CJ08] alignment scheme, to handle these dependencies while aligning interference, and state the sufficient conditions for achieving half rate per user using this scheme. The difficulties in proving these sufficient conditions are shown for K = 4 and K = 5. We also show that these sufficient conditions are not satisfied for K ≥ 6.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Degrees of freedom of interference channel with rank-deficient transfer matrix\",\"authors\":\"Abinesh Ramakrishnan, S. Krishnamurthy, S. Jafar, Yaming Yu\",\"doi\":\"10.1109/ISIT.2014.6875027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel coefficients. We present a modified version of the [CJ08] alignment scheme, to handle these dependencies while aligning interference, and state the sufficient conditions for achieving half rate per user using this scheme. The difficulties in proving these sufficient conditions are shown for K = 4 and K = 5. We also show that these sufficient conditions are not satisfied for K ≥ 6.\",\"PeriodicalId\":127191,\"journal\":{\"name\":\"2014 IEEE International Symposium on Information Theory\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2014.6875027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2014.6875027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Degrees of freedom of interference channel with rank-deficient transfer matrix
We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel coefficients. We present a modified version of the [CJ08] alignment scheme, to handle these dependencies while aligning interference, and state the sufficient conditions for achieving half rate per user using this scheme. The difficulties in proving these sufficient conditions are shown for K = 4 and K = 5. We also show that these sufficient conditions are not satisfied for K ≥ 6.