Pub Date : 2012-09-01DOI: 10.1109/ITW.2012.6404659
V. Aggarwal, M. Duarte, A. Sabharwal, N. K. Shankaranarayanan
Full duplex communication requires nodes to cancel their own signal which appears as an interference at their receive antennas. Recent work has experimentally demonstrated the feasibility of full duplex communications using software radios. In this paper, we address capacity comparisons when the total amount of analog radio hardware is bounded. Under this constraint, it is not immediately clear if one should use these radios to perform full-duplex self-interference cancellation or use the radios to give additional MIMO multiplexing advantage. We find that repurposing radios for cancellation, instead of using all of them for half-duplex over-the-air transmission, can be beneficial since the resulting full-duplex system performs better in some practical SNR regimes and almost always outperforms half duplex in symmetric degrees-of-freedom (large SNR regime).
{"title":"Full- or half-duplex? A capacity analysis with bounded radio resources","authors":"V. Aggarwal, M. Duarte, A. Sabharwal, N. K. Shankaranarayanan","doi":"10.1109/ITW.2012.6404659","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404659","url":null,"abstract":"Full duplex communication requires nodes to cancel their own signal which appears as an interference at their receive antennas. Recent work has experimentally demonstrated the feasibility of full duplex communications using software radios. In this paper, we address capacity comparisons when the total amount of analog radio hardware is bounded. Under this constraint, it is not immediately clear if one should use these radios to perform full-duplex self-interference cancellation or use the radios to give additional MIMO multiplexing advantage. We find that repurposing radios for cancellation, instead of using all of them for half-duplex over-the-air transmission, can be beneficial since the resulting full-duplex system performs better in some practical SNR regimes and almost always outperforms half duplex in symmetric degrees-of-freedom (large SNR regime).","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116360737","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404673
Satyajit Thakor, A. Grant, T. Chan
The polymatroid axioms are dominantly used to study the capacity limits of various communication systems. In fact for most of the communication systems, for which the capacity is known, these axioms are solely required to obtain the characterization of capacity. Moreover, the polymatroid axioms are stronger tools to tackle the implication problem for conditional independencies compared to the axioms used in Bayesian networks. However, their use is prohibitively complex as the number of random variables increases since the number of inequalities to consider increases exponentially. In this paper we give a compact characterization of the minimal set of polymatroid axioms when arbitrary conditional independence and functional dependence constraints are given. In particular, we identify those elemental equalities which are implied by given constraints. We also identify those elemental inequalities which are redundant given the constraints.
{"title":"Compact representation of polymatroid axioms for random variables with conditional independencies","authors":"Satyajit Thakor, A. Grant, T. Chan","doi":"10.1109/ITW.2012.6404673","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404673","url":null,"abstract":"The polymatroid axioms are dominantly used to study the capacity limits of various communication systems. In fact for most of the communication systems, for which the capacity is known, these axioms are solely required to obtain the characterization of capacity. Moreover, the polymatroid axioms are stronger tools to tackle the implication problem for conditional independencies compared to the axioms used in Bayesian networks. However, their use is prohibitively complex as the number of random variables increases since the number of inequalities to consider increases exponentially. In this paper we give a compact characterization of the minimal set of polymatroid axioms when arbitrary conditional independence and functional dependence constraints are given. In particular, we identify those elemental equalities which are implied by given constraints. We also identify those elemental inequalities which are redundant given the constraints.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117033085","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404699
Camilo G. Taborda, F. Pérez-Cruz
In this paper it is found that, regardless of the statistics of the input, the derivative of the relative entropy over the Binomial channel can be seen as the expectation of a function that has as argument the mean of the conditional distribution that models the channel. Based on this relationship we formulate a similar expression for the mutual information concept. In addition to this, using the connection between the Binomial and Poisson distribution we develop similar results for the Poisson channel. Novelty of the results presented here lies on the fact that, expressions obtained can be applied to a wide range of scenarios.
{"title":"Derivative of the relative entropy over the poisson and Binomial channel","authors":"Camilo G. Taborda, F. Pérez-Cruz","doi":"10.1109/ITW.2012.6404699","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404699","url":null,"abstract":"In this paper it is found that, regardless of the statistics of the input, the derivative of the relative entropy over the Binomial channel can be seen as the expectation of a function that has as argument the mean of the conditional distribution that models the channel. Based on this relationship we formulate a similar expression for the mutual information concept. In addition to this, using the connection between the Binomial and Poisson distribution we develop similar results for the Poisson channel. Novelty of the results presented here lies on the fact that, expressions obtained can be applied to a wide range of scenarios.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117192448","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404750
François Simon
This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates (and not only asymptotically dominates) the AMS probability distribution. Some results established for two-sided channels can be partly extended to recurrent AMS one-sided channels.
{"title":"Recurrent AMS one-sided channels","authors":"François Simon","doi":"10.1109/ITW.2012.6404750","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404750","url":null,"abstract":"This paper is devoted to a first analysis of the class of recurrent AMS formal communication channels. The purpose is to generalize some results and approaches dealing with two-sided channels to a wider class of AMS channels assuming non-invertible shifts and thus to cover, to a certain extent, one-sided channels. The basis is to consider recurrent random processes for which the stationary mean dominates (and not only asymptotically dominates) the AMS probability distribution. Some results established for two-sided channels can be partly extended to recurrent AMS one-sided channels.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569233","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404762
M. Rezaee, M. Guillaud
A simple limited feedback scheme is proposed for interference alignment on the K-user Multiple-Input-Multiple-Output Interference Channel (MIMO-IC). The scaling of the number of feedback bits with the transmit power required to preserve the multiplexing gain that can be achieved using perfect channel state information (CSI) is derived. This result is obtained through a reformulation of the interference alignment problem in order to exploit the benefits of quantization on the Grassmann manifold, which is well investigated in the single-user MIMO channel. Furthermore, through simulations we show that the proposed scheme outperforms the naive feedback scheme consisting in independently quantizing the channel matrices, in the sense that it yields a better sum rate performance for the same number of feedback bits.
{"title":"Limited feedback for interference alignment in the K-user MIMO Interference Channel","authors":"M. Rezaee, M. Guillaud","doi":"10.1109/ITW.2012.6404762","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404762","url":null,"abstract":"A simple limited feedback scheme is proposed for interference alignment on the K-user Multiple-Input-Multiple-Output Interference Channel (MIMO-IC). The scaling of the number of feedback bits with the transmit power required to preserve the multiplexing gain that can be achieved using perfect channel state information (CSI) is derived. This result is obtained through a reformulation of the interference alignment problem in order to exploit the benefits of quantization on the Grassmann manifold, which is well investigated in the single-user MIMO channel. Furthermore, through simulations we show that the proposed scheme outperforms the naive feedback scheme consisting in independently quantizing the channel matrices, in the sense that it yields a better sum rate performance for the same number of feedback bits.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830529","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404651
K. Woyach, Kate Harrison, G. Ranade, A. Sahai
The idea of modeling an unknown channel using a broadcast channel was first introduced by Cover1 in 1972. This paper builds on his line of thought to consider priority encoding of communication over unknown channels without feedback, using fixed-length codes and from a single-shot, individual channel perspective. A ratio-regret metric is used to understand how well we can perform with respect to the actual channel realization.
{"title":"Comments on unknown channels","authors":"K. Woyach, Kate Harrison, G. Ranade, A. Sahai","doi":"10.1109/ITW.2012.6404651","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404651","url":null,"abstract":"The idea of modeling an unknown channel using a broadcast channel was first introduced by Cover1 in 1972. This paper builds on his line of thought to consider priority encoding of communication over unknown channels without feedback, using fixed-length codes and from a single-shot, individual channel perspective. A ratio-regret metric is used to understand how well we can perform with respect to the actual channel realization.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192148","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404690
L. Georgiadis, G. Paschos, L. Tassiulas, Lavy Libman
We consider a system where jobs (packets) arrive for processing using one of the policies in a given class. We study the connection between the minimal evacuation times and the stability region of the system under the given class of policies. The result is used to establish the equality of information theoretic capacity region and system stability region for the multiuser broadcast erasure channel with feedback.
{"title":"Stability and capacity through evacuation times","authors":"L. Georgiadis, G. Paschos, L. Tassiulas, Lavy Libman","doi":"10.1109/ITW.2012.6404690","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404690","url":null,"abstract":"We consider a system where jobs (packets) arrive for processing using one of the policies in a given class. We study the connection between the minimal evacuation times and the stability region of the system under the given class of policies. The result is used to establish the equality of information theoretic capacity region and system stability region for the multiuser broadcast erasure channel with feedback.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123279590","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404644
Jinfeng Du, Ming Xiao, M. Skoglund, S. Shamai
Noisy network coding (NNC) has been shown to outperform standard compress-and-forward (CF) in networks with multiple relays and/or multiple destinations. Recently, short-message noisy network coding (SNNC) has been proved to achieve the same rate region as NNC for independent sources but with significantly reduced encoding delay and decoding complexity. In this paper, we show that when partial cooperation between source nodes is possible, by performing rate-splitting, message exchange, and superposition coding with proper power allocation at the source nodes, SNNC can achieve a strictly larger rate region than NNC. The gain comes from coherent combining at all the receiving nodes.
{"title":"Short-message noisy network coding with partial source cooperation","authors":"Jinfeng Du, Ming Xiao, M. Skoglund, S. Shamai","doi":"10.1109/ITW.2012.6404644","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404644","url":null,"abstract":"Noisy network coding (NNC) has been shown to outperform standard compress-and-forward (CF) in networks with multiple relays and/or multiple destinations. Recently, short-message noisy network coding (SNNC) has been proved to achieve the same rate region as NNC for independent sources but with significantly reduced encoding delay and decoding complexity. In this paper, we show that when partial cooperation between source nodes is possible, by performing rate-splitting, message exchange, and superposition coding with proper power allocation at the source nodes, SNNC can achieve a strictly larger rate region than NNC. The gain comes from coherent combining at all the receiving nodes.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131463960","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404718
Milad Sefidgaran, A. Tchamkerten
A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function f(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover f(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.
发射机可以访问X，中继器可以访问Y，接收器可以访问Z，并且想要计算一个给定的函数f(X, Y, Z)。发射机向中继器和中继器向接收器必须传输多少位，以便后者能够可靠地恢复f(X, Y, Z)?主要结果是当X - Y - Z形成马尔可夫链时，该问题的速率区是紧的。
{"title":"On function computation over a cascade network","authors":"Milad Sefidgaran, A. Tchamkerten","doi":"10.1109/ITW.2012.6404718","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404718","url":null,"abstract":"A transmitter has access to X, a relay has access to Y, and a receiver has access to Z and wants to compute a given function f(X, Y, Z). How many bits must be transmitted from the transmitter to the relay and from the relay to the receiver so that the latter can reliably recover f(X, Y, Z)? The main result is an inner bound to the rate region of this problem which is tight when X - Y - Z forms a Markov chain.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125516664","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 : 2012-09-01DOI: 10.1109/ITW.2012.6404677
M. Neely
This paper considers optimal control for a collection of separate Markov decision systems that operate asynchronously over their own state spaces. Decisions at each system affect: (i) the time spent in the current state, (ii) a vector of penalties incurred, and (iii) the next-state transition probabilities. An example is a network of smart devices that perform separate tasks but share a common wireless channel. The model can also be applied to data center scheduling and to various types of cyber-physical networks. The combined state space grows exponentially with the number of systems. However, a simple strategy is developed where each system makes separate decisions. Total complexity grows only linearly in the number of systems, and the resulting performance can be pushed arbitrarily close to optimal.
{"title":"Asynchronous control for coupled Markov decision systems","authors":"M. Neely","doi":"10.1109/ITW.2012.6404677","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404677","url":null,"abstract":"This paper considers optimal control for a collection of separate Markov decision systems that operate asynchronously over their own state spaces. Decisions at each system affect: (i) the time spent in the current state, (ii) a vector of penalties incurred, and (iii) the next-state transition probabilities. An example is a network of smart devices that perform separate tasks but share a common wireless channel. The model can also be applied to data center scheduling and to various types of cyber-physical networks. The combined state space grows exponentially with the number of systems. However, a simple strategy is developed where each system makes separate decisions. Total complexity grows only linearly in the number of systems, and the resulting performance can be pushed arbitrarily close to optimal.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129961973","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
扫码关注我们
求助内容：
应助结果提醒方式：