M. Khojastepour, K. Sundaresan, Mohammad Farajzadeh-Tehrani, S. Rangarajan
{"title":"Degrees of freedom per communication node","authors":"M. Khojastepour, K. Sundaresan, Mohammad Farajzadeh-Tehrani, S. Rangarajan","doi":"10.1109/WIOPT.2014.6850368","DOIUrl":null,"url":null,"abstract":"The classical definition of degrees of freedom (DoF) deals with the degrees of a communication channel or multiple communication channels in the limit of high SNR. This can be interpreted as the number of independent streams that can be sent in each communication channel in the high SNR regime. We introduce the concept of DoF per communication node where at a transmitting node the DoF is the number of independent dimensions that can be used for transmission and at each receiver node the DoF is the number of independent dimensions that can be used for receiving data signals. In general the communication channels or links in a network can be divided into two sets: the interfering channels and the intended channels; hence, the network may be considered as an overlay of two networks, respectively: the interfering network and data-intended network. In the classical form, DoF is defined for channels in the data-intended network. We illustrate a new interpretation of DoF that depends only on the interfering network and can be formalized in full generality based on degrees of freedom per node in the network. While the classical DoF has been studied generally in the context of interference and X-channels, the per node DoF concept generalizes the idea to other possible networks. Using this generalized notion of DoF, this paper provides new results on DoF for different networks and also makes a connection to the classical definition of DoF defined in interference and X-channels.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2014.6850368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The classical definition of degrees of freedom (DoF) deals with the degrees of a communication channel or multiple communication channels in the limit of high SNR. This can be interpreted as the number of independent streams that can be sent in each communication channel in the high SNR regime. We introduce the concept of DoF per communication node where at a transmitting node the DoF is the number of independent dimensions that can be used for transmission and at each receiver node the DoF is the number of independent dimensions that can be used for receiving data signals. In general the communication channels or links in a network can be divided into two sets: the interfering channels and the intended channels; hence, the network may be considered as an overlay of two networks, respectively: the interfering network and data-intended network. In the classical form, DoF is defined for channels in the data-intended network. We illustrate a new interpretation of DoF that depends only on the interfering network and can be formalized in full generality based on degrees of freedom per node in the network. While the classical DoF has been studied generally in the context of interference and X-channels, the per node DoF concept generalizes the idea to other possible networks. Using this generalized notion of DoF, this paper provides new results on DoF for different networks and also makes a connection to the classical definition of DoF defined in interference and X-channels.