Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054681
Kamiar Rahnama Rad
Imagine the vector y = Xβ + ε where β ∈ ℝm has only k non zero entries and ε ∈ Rn is a Gaussian noise. This can be viewed as a linear system with sparsity constraints corrupted with noise. We find a non-asymptotic upper bound on the error probability of exact recovery of the sparsity pattern given any generic measurement matrix X. By drawing X from a Gaussian ensemble, as an example, to ensure exact recovery, we obtain asymptotically sharp sufficient conditions on n which meet the necessary conditions introduced in (Wang et al., 2008).
假设向量y = Xβ + ε，其中β∈λ m只有k个非零项，ε∈Rn是高斯噪声。这可以看作是一个被噪声破坏的具有稀疏性约束的线性系统。我们找到了给定任意一般测量矩阵X的稀疏模式精确恢复的误差概率的非渐近上界。以高斯系综中的X为例，为了保证精确恢复，我们在n上得到了渐近尖锐的充分条件，满足(Wang et al.， 2008)中引入的必要条件。
{"title":"Sharp upper bound on error probability of exact sparsity recovery","authors":"Kamiar Rahnama Rad","doi":"10.1109/CISS.2009.5054681","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054681","url":null,"abstract":"Imagine the vector y = Xβ + ε where β ∈ ℝ<sup>m</sup> has only k non zero entries and ε ∈ R<sup>n</sup> is a Gaussian noise. This can be viewed as a linear system with sparsity constraints corrupted with noise. We find a non-asymptotic upper bound on the error probability of exact recovery of the sparsity pattern given any generic measurement matrix X. By drawing X from a Gaussian ensemble, as an example, to ensure exact recovery, we obtain asymptotically sharp sufficient conditions on n which meet the necessary conditions introduced in (Wang et al., 2008).","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128301356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054760
X. Cao, J. Spall
Confidence intervals for the maximum likelihood estimates (MLEs) are commonly used in statistical inference. To accurately construct such confidence intervals, one typically needs to know the distribution of the MLE. Standard statistical theory says normalized MLE is asymptotically normal with mean zero and variance being a function of the Fisher Information Matrix (FIM) at the unknown parameter. Two common estimates for the variance of MLE are the observed FIM (same as Hessian of negative log-likelihood) and the expected FIM, both of which are evaluated at the MLE given sample data. We show that, under reasonable conditions, the expected FIM tends to outperform the observed FIM under a mean-squared error criterion. This result suggests that, under certain conditions, the expected FIM is a better estimate for the variance of MLE when used in confidence interval calculations.
{"title":"Preliminary results in comparing the expected and observed Fisher information for maximum likelihood estimates","authors":"X. Cao, J. Spall","doi":"10.1109/CISS.2009.5054760","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054760","url":null,"abstract":"Confidence intervals for the maximum likelihood estimates (MLEs) are commonly used in statistical inference. To accurately construct such confidence intervals, one typically needs to know the distribution of the MLE. Standard statistical theory says normalized MLE is asymptotically normal with mean zero and variance being a function of the Fisher Information Matrix (FIM) at the unknown parameter. Two common estimates for the variance of MLE are the observed FIM (same as Hessian of negative log-likelihood) and the expected FIM, both of which are evaluated at the MLE given sample data. We show that, under reasonable conditions, the expected FIM tends to outperform the observed FIM under a mean-squared error criterion. This result suggests that, under certain conditions, the expected FIM is a better estimate for the variance of MLE when used in confidence interval calculations.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126433623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054730
K. Benson, L. Marvel
Detecting anomalies in network traffic is a challenging task, not only because of the inherent difficulty of identifying anomalies such as intrusions [1] but also because of the sheer volume of data. In this paper, we attempt to extend existing work in the field of steganalysis to the problem of detecting anomalies in network traffic. By losslessly compressing network traffic using an adaptive compression algorithm, we postulate that it is possible to characterize normal network traffic. Once typical traffic has been defined, it is possible to identify anomalous traffic as the traffic that does not compress well.
{"title":"Using adaptive lossless compression to characterize network traffic","authors":"K. Benson, L. Marvel","doi":"10.1109/CISS.2009.5054730","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054730","url":null,"abstract":"Detecting anomalies in network traffic is a challenging task, not only because of the inherent difficulty of identifying anomalies such as intrusions [1] but also because of the sheer volume of data. In this paper, we attempt to extend existing work in the field of steganalysis to the problem of detecting anomalies in network traffic. By losslessly compressing network traffic using an adaptive compression algorithm, we postulate that it is possible to characterize normal network traffic. Once typical traffic has been defined, it is possible to identify anomalous traffic as the traffic that does not compress well.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054788
Hang Su, Xi Zhang
Cognitive radio technology is widely accepted as an efficient approach to solve the problem that the wireless spectrum has been getting scarcer and scarcer due to the rapid growth in the ubiquitous wireless applications. Several cognitive medium access control (MAC) protocols have been proposed for the secondary users (non-licensed users) to take advantage of the vacant channels whenever they are not occupied by the primary users (licensed users) in the wireless time division multiple access (TDMA)-based networks. In this paper, by exploiting the unique property of the wireless fading channel and cross-layer design technique, we develop a packets scheduling scheme for the primary users in the context of wireless TDMA networks, which is set up to operate friendly towards the secondary users in terms of vacant-channel probability. Our proposed scheme can be implemented with just slight modification on the traditional TDMA scheduling algorithm. We develop a rigorous queuing model and then quantitatively analyze the tradeoff among multiple performance metrics to identify when and where the cost for favoring the secondary users is worthy. The analytical results show that our proposed scheme can generate more vacant-channel opportunities for secondary users, at the expense of little increasing packet delay, as compared with the traditional wireless TDMA scheduling algorithm. In addition, since the implementation of our proposed scheme only needs little modification on the existing TDMA scheduling algorithm, our proposed scheme is a practical and cost-effective approach to increase the wireless spectrum utilization.
{"title":"Secondary user friendly TDMA scheduling for primary users in cognitive radio networks","authors":"Hang Su, Xi Zhang","doi":"10.1109/CISS.2009.5054788","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054788","url":null,"abstract":"Cognitive radio technology is widely accepted as an efficient approach to solve the problem that the wireless spectrum has been getting scarcer and scarcer due to the rapid growth in the ubiquitous wireless applications. Several cognitive medium access control (MAC) protocols have been proposed for the secondary users (non-licensed users) to take advantage of the vacant channels whenever they are not occupied by the primary users (licensed users) in the wireless time division multiple access (TDMA)-based networks. In this paper, by exploiting the unique property of the wireless fading channel and cross-layer design technique, we develop a packets scheduling scheme for the primary users in the context of wireless TDMA networks, which is set up to operate friendly towards the secondary users in terms of vacant-channel probability. Our proposed scheme can be implemented with just slight modification on the traditional TDMA scheduling algorithm. We develop a rigorous queuing model and then quantitatively analyze the tradeoff among multiple performance metrics to identify when and where the cost for favoring the secondary users is worthy. The analytical results show that our proposed scheme can generate more vacant-channel opportunities for secondary users, at the expense of little increasing packet delay, as compared with the traditional wireless TDMA scheduling algorithm. In addition, since the implementation of our proposed scheme only needs little modification on the existing TDMA scheduling algorithm, our proposed scheme is a practical and cost-effective approach to increase the wireless spectrum utilization.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"1 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120842426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054796
Zhen Zhao, A. Elancheziyan, J. D. Oliveira
Sleeping policies are widely used in many contexts to reduce energy consumption in sensor nodes, ad-hoc terminals or mobile cell phones. Although there is extensive literature on energy saving in sensor networks, little has been done with respect to comparing additional costs, such as packet drop probability and buffer occupancies of sleeping versus non-sleeping policies, especially for multiple classes of data. In this paper, we employ discrete time vacation modeling results from queueing theory to obtain the quantities of interest, i.e., blocking probabilities, and queue lengths incurred by sleeping policies for a sensor node with a finite buffer.We propose a 2-class Geo/G/1/K vacation model, where two classes of data, each with its own buffer, are collected by a sensor node following a sleeping policy. At any time instant, only one packet can be transferred and the transmission order is selected by a scheduling function. The sleeping, transfer and selection processes have general distributions. To the best of our knowledge, this is the first work on modeling and analyzing the performance characteristics of a sensor node with a sleeping policy, collecting heterogeneous data. First, we present a Markov renewal process embedded at the time instant of transfer completion and then obtain the marginal occupancy distributions at an arbitrary time instant. Simulation results validate our theoretical derivation and demonstrate how the results can be applied to understand the behavior of sensor nodes with heterogeneous data.
{"title":"Sleeping policy cost analysis for sensor nodes collecting heterogeneous data","authors":"Zhen Zhao, A. Elancheziyan, J. D. Oliveira","doi":"10.1109/CISS.2009.5054796","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054796","url":null,"abstract":"Sleeping policies are widely used in many contexts to reduce energy consumption in sensor nodes, ad-hoc terminals or mobile cell phones. Although there is extensive literature on energy saving in sensor networks, little has been done with respect to comparing additional costs, such as packet drop probability and buffer occupancies of sleeping versus non-sleeping policies, especially for multiple classes of data. In this paper, we employ discrete time vacation modeling results from queueing theory to obtain the quantities of interest, i.e., blocking probabilities, and queue lengths incurred by sleeping policies for a sensor node with a finite buffer.We propose a 2-class Geo/G/1/K vacation model, where two classes of data, each with its own buffer, are collected by a sensor node following a sleeping policy. At any time instant, only one packet can be transferred and the transmission order is selected by a scheduling function. The sleeping, transfer and selection processes have general distributions. To the best of our knowledge, this is the first work on modeling and analyzing the performance characteristics of a sensor node with a sleeping policy, collecting heterogeneous data. First, we present a Markov renewal process embedded at the time instant of transfer completion and then obtain the marginal occupancy distributions at an arbitrary time instant. Simulation results validate our theoretical derivation and demonstrate how the results can be applied to understand the behavior of sensor nodes with heterogeneous data.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054790
Jia Liu, Yiwei Thomas Hou, H. Sherali
In this paper, we investigate optimal power allocation to achieve perfect secrecy capacity in Gaussian MIMO wire-tap channels. The number of antennas in the MIMO wire-tap channel is arbitrary at the transmitter, the intended receiver, and the eavesdropper. For this challenging non-convex optimization problem, we design a novel global optimization algorithm called branch-and-bound with reformulation and linearization technique (BB/RLT). As opposed to convex programming methods that only yield local optimal solutions, our proposed BB/RLT method guarantees finding a global optimal solution. The main contribution in this paper is that our proposed BB/RLT algorithm is the first method that solves the optimal power allocation problem for achieving perfect secrecy capacity problem in MIMO wire-tap channels. Numerical examples are also given to demonstrate the efficacy of the proposed algorithm.
{"title":"Optimal power allocation for achieving perfect secrecy capacity in MIMO wire-tap channels","authors":"Jia Liu, Yiwei Thomas Hou, H. Sherali","doi":"10.1109/CISS.2009.5054790","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054790","url":null,"abstract":"In this paper, we investigate optimal power allocation to achieve perfect secrecy capacity in Gaussian MIMO wire-tap channels. The number of antennas in the MIMO wire-tap channel is arbitrary at the transmitter, the intended receiver, and the eavesdropper. For this challenging non-convex optimization problem, we design a novel global optimization algorithm called branch-and-bound with reformulation and linearization technique (BB/RLT). As opposed to convex programming methods that only yield local optimal solutions, our proposed BB/RLT method guarantees finding a global optimal solution. The main contribution in this paper is that our proposed BB/RLT algorithm is the first method that solves the optimal power allocation problem for achieving perfect secrecy capacity problem in MIMO wire-tap channels. Numerical examples are also given to demonstrate the efficacy of the proposed algorithm.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131148900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054758
Mohammed D. Halloush, H. Radha
In this paper, we evaluate the priority transmission characteristic of Network Coding (NC) with Multi-Generation Mixing (MGM). MGM supports priority transmission by providing enhanced reliability for delivering different groups of sender packets. MGM is a generalized approach for practical network coding that enhances its performance. With MGM, sender packets are grouped in generations that constitute mixing sets. By employing the novel inter-generation network coding approach, each generation within a mixing set can be considered as a priority layer. This is due to the varying levels of data protection provided to the different generations within a mixing set. Traditionally, priority transmission is done by increasing the level of FEC protection assigned to sender data of higher priority. This incurs transmission overhead that consumes bandwidth. MGM supports priority transmission by network encoding data of higher priority in more sender packets so that more packets support its recovery. At the same time there is no increase in the total number of packets transmitted and hence no additional transmission overhead.
{"title":"Performance evaluation: Priority transmission using network coding with multi-generation mixing","authors":"Mohammed D. Halloush, H. Radha","doi":"10.1109/CISS.2009.5054758","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054758","url":null,"abstract":"In this paper, we evaluate the priority transmission characteristic of Network Coding (NC) with Multi-Generation Mixing (MGM). MGM supports priority transmission by providing enhanced reliability for delivering different groups of sender packets. MGM is a generalized approach for practical network coding that enhances its performance. With MGM, sender packets are grouped in generations that constitute mixing sets. By employing the novel inter-generation network coding approach, each generation within a mixing set can be considered as a priority layer. This is due to the varying levels of data protection provided to the different generations within a mixing set. Traditionally, priority transmission is done by increasing the level of FEC protection assigned to sender data of higher priority. This incurs transmission overhead that consumes bandwidth. MGM supports priority transmission by network encoding data of higher priority in more sender packets so that more packets support its recovery. At the same time there is no increase in the total number of packets transmitted and hence no additional transmission overhead.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115409649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054762
R. Carrillo, K. Barner
Finding sparse solutions of under-determined systems of linear equations is a problem of significance importance in signal processing and statistics. In this paper we study an iterative reweighted least squares (IRLS) approach to find sparse solutions of underdetermined system of equations based on smooth approximation of the L0 norm and the method is extended to find sparse solutions from noisy measurements. Analysis of the proposed methods show that weaker conditions on the sensing matrices are required. Simulation results demonstrate that the proposed method requires fewer samples than existing methods, while maintaining a reconstruction error of the same order and demanding less computational complexity.
{"title":"Iteratively re-weighted least squares for sparse signal reconstruction from noisy measurements","authors":"R. Carrillo, K. Barner","doi":"10.1109/CISS.2009.5054762","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054762","url":null,"abstract":"Finding sparse solutions of under-determined systems of linear equations is a problem of significance importance in signal processing and statistics. In this paper we study an iterative reweighted least squares (IRLS) approach to find sparse solutions of underdetermined system of equations based on smooth approximation of the L0 norm and the method is extended to find sparse solutions from noisy measurements. Analysis of the proposed methods show that weaker conditions on the sensing matrices are required. Simulation results demonstrate that the proposed method requires fewer samples than existing methods, while maintaining a reconstruction error of the same order and demanding less computational complexity.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113967512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054772
Hyosung Kim, Jitendra Tugnait
An adaptive MIMO channel estimation scheme, exploiting the oversampled complex exponential basis expansion model (CE-BEM), is presented for doubly-selective fading channels where we track the BEM coefficients. The time-varying nature of the channel is well captured by the CE-BEM while the time-variations of the (unknown) BEM coefficients are likely much slower than that of the channel. We apply the exponentially-weighted and sliding-window recursive least-squares (RLS) algorithms to track the BEM coefficients subblock-by-subblock, using time-multiplexed periodically transmitted training symbols. Simulation examples demonstrate its superior performance over the conventional block-wise channel estimator.
{"title":"Recursive least-squares doubly-selective MIMO channel estimation using exponential basis models","authors":"Hyosung Kim, Jitendra Tugnait","doi":"10.1109/CISS.2009.5054772","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054772","url":null,"abstract":"An adaptive MIMO channel estimation scheme, exploiting the oversampled complex exponential basis expansion model (CE-BEM), is presented for doubly-selective fading channels where we track the BEM coefficients. The time-varying nature of the channel is well captured by the CE-BEM while the time-variations of the (unknown) BEM coefficients are likely much slower than that of the channel. We apply the exponentially-weighted and sliding-window recursive least-squares (RLS) algorithms to track the BEM coefficients subblock-by-subblock, using time-multiplexed periodically transmitted training symbols. Simulation examples demonstrate its superior performance over the conventional block-wise channel estimator.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115300671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-03-18DOI: 10.1109/CISS.2009.5054854
M. Charafeddine, A. Paulraj
This paper applies recent advances in communicating over the interference channel while treating the interference as noise. Two maximization utilities are considered: maximizing the sum rates and maximizing the minimum rate. The channel model is based on a 2—sector interference channel within a single cell. The utilities maximization is presented from the perspective of the interference channel's achievable rates region. Maximizing the minimum rate parts from the traditional problem formulation of casting it as a pure power control problem. Instead, the problem is presented as maximization over the convex hull of the rates region, therefore employing both power control and time-sharing strategies. For maximizing the minimum rate, it is shown that optimal communication over a 2—sector channel is not homogenous, and an interplay of different time-sharing types and/or power control is required to achieve optimality. Systems results are presented together with the gains achieved by using the proposed techniques over the traditional paradigms used in communicating over the 2—sector channel. Finally, insights and the contextualization of the aforementioned techniques within an information theoretic perspective are discussed.
{"title":"2—Sector interference channel communication for sum rates and minimum rate maximization","authors":"M. Charafeddine, A. Paulraj","doi":"10.1109/CISS.2009.5054854","DOIUrl":"https://doi.org/10.1109/CISS.2009.5054854","url":null,"abstract":"This paper applies recent advances in communicating over the interference channel while treating the interference as noise. Two maximization utilities are considered: maximizing the sum rates and maximizing the minimum rate. The channel model is based on a 2—sector interference channel within a single cell. The utilities maximization is presented from the perspective of the interference channel's achievable rates region. Maximizing the minimum rate parts from the traditional problem formulation of casting it as a pure power control problem. Instead, the problem is presented as maximization over the convex hull of the rates region, therefore employing both power control and time-sharing strategies. For maximizing the minimum rate, it is shown that optimal communication over a 2—sector channel is not homogenous, and an interplay of different time-sharing types and/or power control is required to achieve optimality. Systems results are presented together with the gains achieved by using the proposed techniques over the traditional paradigms used in communicating over the 2—sector channel. Finally, insights and the contextualization of the aforementioned techniques within an information theoretic perspective are discussed.","PeriodicalId":433796,"journal":{"name":"2009 43rd Annual Conference on Information Sciences and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116629899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：