{"title":"Control your information for better predictions","authors":"Michal Moshkovitz, Naftali Tishby","doi":"10.1109/ISIT.2014.6874966","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874966","url":null,"abstract":"We suggest a unified view of two known prediction algorithms: Context Tree Weighting (CTW) and Prediction Suffix Tree (PST), by formulating them as information limited control problems. Using a unified view of planning and information gathering we suggest a new algorithm that combines the advantages of these two extreme algorithms and interpolates efficiently between them. The unified view is based on recent ideas from optimal control under information constraints.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126974105","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}
{"title":"Delay-limited capacity of MIMO channels with limited feedback","authors":"Erdem Koyuncu, H. Jafarkhani","doi":"10.1109/ISIT.2014.6875294","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875294","url":null,"abstract":"We consider a fixed data rate slow-fading MIMO channel with a long-term power constraint P at the transmitter. A relevant performance limit is the delay-limited capacity, which is the largest data rate at which the outage probability is zero. It is well-known that if both the transmitter and the receiver have full channel state information (CSI) and if either of them has multiple antennas, the delay-limited capacity is non-zero and grows logarithmically with P. Achieving even a positive delay-limited capacity however becomes a difficult task when the CSI at the transmitter (CSIT) is imperfect. In this context, the standard partial CSIT model where the transmitter has a fixed finite bits of quantized CSI feedback for each channel state results in zero delay-limited capacity. We show that by using a variable-length feedback scheme that utilizes different number of feedback bits for different channel states, a non-zero delay-limited capacity can be achieved if the feedback rate is greater than 1 bit per channel state. Moreover, we show that the delay-limited capacity loss due to finite-rate feedback decays at least inverse linearly with respect to the feedback rate.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927040","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}
Zhengchuan Chen, Pingyi Fan, D. Wu, Yunquan Dong, K. Letaief
{"title":"On the achievable sum rate of Gaussian interference channel via Gaussian signaling","authors":"Zhengchuan Chen, Pingyi Fan, D. Wu, Yunquan Dong, K. Letaief","doi":"10.1109/ISIT.2014.6875332","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875332","url":null,"abstract":"Two user Gaussian interference channel (GIC) consists of two source-destination pairs which transmit independent messages and interfere with each other. The best achievable rate region, referred to HK sum rate bound, requires the sources to split the information into public messages and private messages. As Gaussian signaling holds the potential of approaching the capacity, finding the HK sum rate achieved by Gaussian signaling is of great importance. However, The optimal power allocation over messages for Gaussian signaling are not known yet This work clearly describes the optimal power allocation and corresponding sum rate achieved by Gaussian signaling without time sharing (TS) in closed form. It lays a foundation for finding the TS strategy achieving the optimal sum rate. The obtained power allocation indicates that without TS, message splitting may not be always necessary. Besides, the conditions for using and not using message splitting are also characterized in detail.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"51 1-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132569398","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}
{"title":"A hybrid algorithm for content placement in distributed video on demand systems","authors":"James Yifei Yang, B. Hajek","doi":"10.1109/ISIT.2014.6874946","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874946","url":null,"abstract":"We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize the rate from caches. Our approach reduces the analysis for multiple videos to consideration of decoupled systems with a single video each. For each placement policy, insights gained from the single video analysis carry back to the original multiple video content placement problem. Finally, we introduce a hybrid placement technique that achieves near optimal performance with low complexity.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132620598","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}
{"title":"Proving and disproving information inequalities","authors":"Siu-Wai Ho, C. Tan, R. Yeung","doi":"10.1109/ISIT.2014.6875347","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875347","url":null,"abstract":"Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1], Yeung developed a framework that uses linear programming for verifying linear information inequalities. Under this framework, this paper considers a few other problems that can be solved by using Lagrange duality and convex approximation. We will demonstrate how linear programming can be used to find an analytic proof of an information inequality. The way to find a shortest proof is explored. When a given information inequality cannot be proved, the sufficient conditions for a counterexample to disprove the information inequality are found by linear programming.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134414800","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}
{"title":"A note on polarization martingales","authors":"E. Arıkan","doi":"10.1109/ISIT.2014.6875076","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875076","url":null,"abstract":"Polarization results rely on martingales of mutual information and entropy functions. In this note an alternative formulation is considered where martingales are constructed on sample functions of the entropy function.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133850981","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}
{"title":"Feasibility study of physical-layer network coding in 802.11p VANETs","authors":"I. W. Ho, S. Liew, Lu Lu","doi":"10.1109/ISIT.2014.6874912","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874912","url":null,"abstract":"Vehicular Ad-hoc Network (VANET) is expected to play a major role in improving road safety and traffic efficiency in people's daily life. However, the main issue in VANETs remains to be intermittent node connectivity and relatively short contact duration due to the high mobility of vehicles. Physical-layer Network Coding (PNC) that enables data exchange within a much shorter airtime (e.g., twice faster than traditional scheduling) favors the highly-dynamic link condition in vehicular environments and hence appears to be a powerful tool in VANETs. One of the most important challenges in applying PNC to VANETs comes from the Doppler shift due to high-speed vehicle motion, which leads to carrier frequency offset (CFO) and hence introduces inter-carrier interference (ICI) that degrades the bit error rate performance. In this paper, we investigate the impact of motion-induced CFO/ICI on the overall signal detection. In particular, we study whether PNC in VANETs can be made feasible with conventional equalization techniques that suppress the effect of CFO. We found that PNC suffers only a 3 dB SINR penalty in the worst case compared with generic point-to-point (P2P) communications, and generally PNC is feasible in vehicular environments even if the transmission powers of source nodes cannot be finely controlled.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130349137","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}
{"title":"Interference mitigation and signal enhancement for K-user MIMO interference channels","authors":"Xiaohu Shang","doi":"10.1109/ISIT.2014.6875403","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875403","url":null,"abstract":"The optimal signaling for K-user multiple-antenna Gaussian interference channels with single-user detection has been studied. It is shown that to achieve the boundary of the rate region, the rank of the optimal input covariance matrix is no greater than the rank of the direct link channel matrix as long as this transmitter has perfect channel state information of its direct link. Based on this, interference mitigation and signal enhancement are derived and shown to be necessary conditions for the optimal signaling. Different power constraints and channel availability scenarios are also considered.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"s3-29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130123580","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}
{"title":"Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics","authors":"Y. M. Chee, Van Khu Vu","doi":"10.1109/ISIT.2014.6875376","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875376","url":null,"abstract":"Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301208","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}
{"title":"Asymptotically minimax regret for models with hidden variables","authors":"J. Takeuchi, A. Barron","doi":"10.1109/ISIT.2014.6875392","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875392","url":null,"abstract":"We study the problems of data compression, gambling and prediction of a string xn = x1x2...xn from an alphabet X, in terms of regret with respect to models with hidden variables including general mixture families. When the target class is a non-exponential family, a modification of Jeffreys prior which has measure outside the given family of densities was introduced to achieve the minimax regret [8], under certain regularity conditions. In this paper, we show that the models with hidden variables satisfy those regularity conditions, when the hidden variables' model is an exponential family. In paticular, we do not have to restrict the class of data strings so that the MLE is in the interior of the parameter space for the case of the general mixture family.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077780","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}