发布求助
文献互助 智能选刊 最新文献

2014 Information Theory and Applications Workshop (ITA)最新文献

筛选
英文 中文
Eulerian numbers revisited: Slices of hypercube 重新审视欧拉数:超立方体的切片
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804233
Kingo Kobayashi, Hajime Sato, M. Hoshi, H. Morita
{"title":"Eulerian numbers revisited: Slices of hypercube","authors":"Kingo Kobayashi, Hajime Sato, M. Hoshi, H. Morita","doi":"10.1109/ITA.2014.6804233","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804233","url":null,"abstract":"In this talk, we provide a simple proof on an interesting equality connecting the number of permutations of 1, ..., n with k runs, i.e., Eulerian numbers to the volumes of slices between k-1 and k of the n-dimensional hypercube along the diagonal axis. The proof is simple and elegant, but the detail structures in the problem are left to be unclear. In order to get more information on this problem, we give the second proof relied on the direct calculation of the related numbers and the volumes. By computing conditional probabilities with respect to slices, we can obtain the known recurrence relation on Eulerian numbers.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116148460","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}
引用次数: 0
The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate 模式最大似然估计的Bethe和Sinkhorn近似及其与Valiant-Valiant估计的联系
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804280
P. Vontobel
{"title":"The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate","authors":"P. Vontobel","doi":"10.1109/ITA.2014.6804280","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804280","url":null,"abstract":"For estimating a source's distribution histogram, Orlitsky and co-workers have proposed the pattern maximum likelihood (PML) estimate, which says that one should choose the distribution histogram that has the largest likelihood of producing the pattern of the observed symbol sequence. It can be shown that finding the PML estimate is equivalent to finding the distribution histogram that maximizes the permanent of a certain non-negative matrix. However, in general this optimization problem appears to be intractable and so one has to compute suitable approximations of the PML estimate. In this paper, we discuss various efficient PML estimate approximation algorithms, along with their connections to the Valiant-Valiant estimate of the distribution histogram. These connections are established by associating an approximately doubly stochastic matrix with the Valiant-Valiant estimate and comparing this approximately doubly stochastic matrix with the doubly stochastic matrices that appear in the free energy descriptions of the PML estimate and its approximations.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116168367","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}
引用次数: 23
Large-scale multiuser SM-MIMO versus massive MIMO 大规模多用户SM-MIMO与大规模MIMO
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804246
T. L. Narasimhan, P. Raviteja, A. Chockalingam
{"title":"Large-scale multiuser SM-MIMO versus massive MIMO","authors":"T. L. Narasimhan, P. Raviteja, A. Chockalingam","doi":"10.1109/ITA.2014.6804246","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804246","url":null,"abstract":"Spatial modulation (SM) is attractive for multi-antenna wireless communications. SM uses multiple transmit antenna elements but only one transmit radio frequency (RF) chain. In SM, in addition to the information bits conveyed through conventional modulation symbols (e.g., QAM), the index of the active transmit antenna also conveys information bits. In this paper, we establish that SM has significant signal-to-noise (SNR) advantage over conventional modulation in large-scale multiuser (multiple-input multiple-output) MIMO systems. Our new contribution in this paper addresses the key issue of large-dimension signal processing at the base station (BS) receiver (e.g., signal detection) in large-scale multiuser SM-MIMO systems, where each user is equipped with multiple transmit antennas (e.g., 2 or 4 antennas) but only one transmit RF chain, and the BS is equipped with tens to hundreds of (e.g., 128) receive antennas. Specifically, we propose two novel algorithms for detection of large-scale SM-MIMO signals at the BS; one is based on message passing and the other is based on local search. The proposed algorithms achieve very good performance and scale well. For the same spectral efficiency, multiuser SM-MIMO outperforms conventional multiuser MIMO (recently being referred to as massive MIMO) by several dBs. The SNR advantage of SM-MIMO over massive MIMO can be attributed to: (i) because of the spatial index bits, SM-MIMO can use a lower-order QAM alphabet compared to that in massive MIMO to achieve the same spectral efficiency, and (ii) for the same spectral efficiency and QAM size, massive MIMO will need more spatial streams per user which leads to increased spatial interference.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121914928","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}
引用次数: 81
MIMO broadcast channels with Gaussian CSIT and application to location based CSIT 基于高斯CSIT的MIMO广播信道及其在基于位置CSIT中的应用
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804252
M. Bashar, Yohan Lejosne, D. Slock, Yuan-Wu Yi
{"title":"MIMO broadcast channels with Gaussian CSIT and application to location based CSIT","authors":"M. Bashar, Yohan Lejosne, D. Slock, Yuan-Wu Yi","doi":"10.1109/ITA.2014.6804252","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804252","url":null,"abstract":"Channel State Information at the Transmitter (CSIT), which is crucial in multi-user systems, is always imperfect in practice. In this paper we focus on the optimization of beamformers for the expected weighted sum rate (EWSR) in the MIMO Broadcast Channel (BC) (multi-user MIMO downlink). We first review some beamformer (BF) designs for the perfect CSIT case, such as Weighted Sum MSE (WSMSE) and we introduce the Weighted Sum SINR (WSSINR) point of view, an optimal form of the Signal to Leakage plus Noise Ratio (SLNR) or Signal to Jamming plus Noise Ratio (SJNR) approaches. The discussion then turns to mean and covariance Gaussian CSIT. We review an exact Monte Carlo based approach and a variety of approximate techniques and bounds that all reduce to problems of the (deterministic) form of perfect CSIT. Other simplified exact solutions can be obtained through massive MIMO asymptotics, or the more precise large MIMO asymptotics. Whereas in the perfect CSI case, all reviewed approaches are equivalent, they differ in the partial CSIT case. In particular the expected WSSINR approach is significantly better than expected WSMSE, with large MIMO asymptotics introducing some further tweaking weights that yield a deterministic approach that becomes exact when the number of antennas increases. The complexity and relative performance of the in the end many possible approaches and approximations are then compared.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128082047","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}
引用次数: 12
On a problem of Massey 关于梅西的一个问题
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804256
J. Hamkins
{"title":"On a problem of Massey","authors":"J. Hamkins","doi":"10.1109/ITA.2014.6804256","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804256","url":null,"abstract":"In 1976, Massey introduced a method to compute the confidence interval for the frame error rate of a coded communications system based on the simulation of just a few frame errors [1]. He commented that his approach did not apply to bit error rate confidence intervals, because bit errors are not independent in a coded system. In this paper, we show how to overcome the limitation Massey recognized, and present a method to compute a confidence interval of the bit error rate of a coded communications system from a simulation of bit and frame error events. The proposed interval may be easily computed from the first and second sample moments of the number of bits errors per frame.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679438","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}
引用次数: 1
Reliable, deniable and hidable communication 可靠、可否认、可隐藏的沟通
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI: 10.1109/ITA.2014.6804271
Pak Hou Che, Mayank Bakshi, Chung Chan, S. Jaggi
{"title":"Reliable, deniable and hidable communication","authors":"Pak Hou Che, Mayank Bakshi, Chung Chan, S. Jaggi","doi":"10.1109/ITA.2014.6804271","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804271","url":null,"abstract":"Alice wishes to potentially communicate covertly with Bob over a Binary Symmetric Channel while Willie the wiretapper listens in over a channel that is noisier than Bob's. We show that Alice can send her messages reliably to Bob while ensuring that even whether or not she is actively communicating is (a) deniable to Willie, and (b) optionally, her message is also hidable from Willie. We consider two different variants of the problem depending on the Alice's “default” behavior, i.e., her transmission statistics when she has no covert message to send: 1) When Alice has no covert message, she stays “silent”, i.e., her transmission is 0; 2) When has no covert message, she transmits “innocently”, i.e., her transmission is drawn uniformly from an innocent random codebook; We prove that the best rate at which Alice can communicate both deniably and hid ably in model 1 is O(1/√n). On the other hand, in model 2, Alice can communicate at a constant rate.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287387","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}
引用次数: 29
Increasing flash memory lifetime by dynamic voltage allocation for constant mutual information 通过动态电压分配恒定互信息增加闪存寿命
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-03-17 DOI: 10.1109/ITA.2014.6804242
Tsung-Yi Chen, Adam R. Williamson, R. Wesel
{"title":"Increasing flash memory lifetime by dynamic voltage allocation for constant mutual information","authors":"Tsung-Yi Chen, Adam R. Williamson, R. Wesel","doi":"10.1109/ITA.2014.6804242","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804242","url":null,"abstract":"The read channel in Flash memory systems degrades over time because the Fowler-Nordheim tunneling used to apply charge to the floating gate eventually compromises the integrity of the cell because of tunnel oxide degradation. While degradation is commonly measured in the number of program/erase cycles experienced by a cell, the degradation is proportional to the number of electrons forced into the floating gate and later released by the erasing process. By managing the amount of charge written to the floating gate to maintain a constant read-channel mutual information, Flash lifetime can be extended. This paper proposes an overall system approach based on information theory to extend the lifetime of a flash memory device. Using the instantaneous storage capacity of a noisy flash memory channel, our approach allocates the read voltage of flash cell dynamically as it wears out gradually over time. A practical estimation of the instantaneous capacity is also proposed based on soft information via multiple reads of the memory cells.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"35 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131562474","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}
引用次数: 16
Communication and interference coordination 通信与干扰协调
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-02-18 DOI: 10.1109/ITA.2014.6804218
Ricardo Blasco-Serrano, R. Thobaben, M. Skoglund
{"title":"Communication and interference coordination","authors":"Ricardo Blasco-Serrano, R. Thobaben, M. Skoglund","doi":"10.1109/ITA.2014.6804218","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804218","url":null,"abstract":"We study the problem of controlling the interference created to an external observer by a communication processes. We model the interference in terms of its type (empirical distribution), and we analyze the consequences of placing constraints on the admissible type. Considering a single interfering link, we characterize the communication-interference capacity region. Then, we look at a scenario where the interference is jointly created by two users allowed to coordinate their actions prior to transmission. In this case, the tradeoff involves communication and interference as well as coordination. We establish an achievable communication-interference region and show that efficiency is significantly improved by coordination.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121032124","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}
引用次数: 4
Controlled sampling using an energy harvesting sensor 使用能量采集传感器控制采样
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-02-01 DOI: 10.1109/ITA.2014.6804220
A. Seyedi
{"title":"Controlled sampling using an energy harvesting sensor","authors":"A. Seyedi","doi":"10.1109/ITA.2014.6804220","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804220","url":null,"abstract":"The problem of sampling from a remote sensor, powered by energy harvesting, is considered. The problem is formulated as a partially observable Markov decision process (POMDP), since the controller only has partial knowledge of the energy reserve at the sensor. Three policies are proposed and their performances are evaluated and compared to that of a clairvoyant policy.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"1996 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553119","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}
引用次数: 1
Reinforcement learning, particle filters and the EM algorithm 强化学习，粒子滤波和EM算法
2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-02-01 DOI: 10.1109/ITA.2014.6804269
V. Borkar, Ankush Jain
{"title":"Reinforcement learning, particle filters and the EM algorithm","authors":"V. Borkar, Ankush Jain","doi":"10.1109/ITA.2014.6804269","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804269","url":null,"abstract":"We consider a parameter estimation problem for a Hidden Markov Model in the framework of particle filters. Using constructs from reinforcement learning for variance reduction in particle filters, a simulation based scheme is developed for estimating the partially observed log-likelihood function. A Kiefer-Wolfowitz like stochastic approximation scheme maximizes this function over the unknown parameter. The two procedures are performed on two different time scales, emulating the alternating `expectation' and `maximization' operations of the EM algorithm. Numerical experiments are presented in support of the proposed scheme.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129303706","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信