2010 IEEE Information Theory Workshop最新文献

筛选
英文 中文
On achievable rates for classes of non-linear deterministic interference channels 非线性确定性干扰信道的可实现速率
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592731
A. Jafarian, S. Vishwanath
{"title":"On achievable rates for classes of non-linear deterministic interference channels","authors":"A. Jafarian, S. Vishwanath","doi":"10.1109/CIG.2010.5592731","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592731","url":null,"abstract":"This paper extends the literature on interference alignment to more certain classes of deterministic channels which incorporate non-linear input-output relationships. It is found that the concept of alignment extends naturally to these deterministic interference channels, and in many cases, the achieved degrees of freedom (DoF) can be shown to be optimal. A key contribution of the paper is the connection it builds between interference alignment and number theory.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115701114","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
Error exponents in multiple hypothesis testing for arbitrarily varying sources 任意变化源的多重假设检验中的误差指数
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592740
Naira Grigoryan, A. Harutyunyan
{"title":"Error exponents in multiple hypothesis testing for arbitrarily varying sources","authors":"Naira Grigoryan, A. Harutyunyan","doi":"10.1109/CIG.2010.5592740","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592740","url":null,"abstract":"The problem of multiple hypothesis testing (HT) for arbitrarily varying sources (AVS) is considered. The achievable error probability exponents (reliabilities) region is derived, optimal decision schemes are described. The result extends the known ones by Fu and Shen and by Tuncel. The Chernoff bounds for AVS binary and M-ary HT are specified via indication of a Sanov theorem for those sources.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122912316","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}
引用次数: 6
On the parallel programming of flash memory cells 快闪存储单元并行编程研究
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592806
Eitan Yaakobi, Anxiao Jiang, P. Siegel, A. Vardy, J. Wolf
{"title":"On the parallel programming of flash memory cells","authors":"Eitan Yaakobi, Anxiao Jiang, P. Siegel, A. Vardy, J. Wolf","doi":"10.1109/CIG.2010.5592806","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592806","url":null,"abstract":"Parallel programming is an important tool used in flash memories to achieve high write speed. In parallel programming, a common programm voltage is applied to many cells for simultaneous charge injection. This property significantly simplifies the complexity of the memory hardware, and is a constraint that limits the storage capacity of flash memories. Another important property is that cells have different hardness for charge injection. It makes the charge injected into cells differ even when the same program voltage is applied to them. In this paper, we study the parallel programming of flash memory cells, focusing on the above two properties. We present algorithms for parallel programming when there is information on the cells' hardness for charge injection, but there is no feedback information on cell levels during programming. We then proceed to the programming model with feedback information on cell levels, and study how well the information on the cells' hardness for charge injection can be obtained. The results can be useful for understanding the storage capacity of flash memories with parallel programming.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116018618","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}
引用次数: 8
On the capacity region of the degraded Z channel 关于退化Z通道的容量区域
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592773
Sadaf Salehkalaibar, M. Aref
{"title":"On the capacity region of the degraded Z channel","authors":"Sadaf Salehkalaibar, M. Aref","doi":"10.1109/CIG.2010.5592773","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592773","url":null,"abstract":"In this paper, we consider the two-user Z Channel (ZC). There are two senders and two receivers in the model. One of the senders transmits information to its intended receiver, while the other sender transmits information to both receivers. We establish a new achievable rate region for the ZC, using Marton's binning technique. At the receivers, we use joint decoding strategy. To illustrate the tightness of the proposed inner bound, we consider the degraded ZC which was first introduced by Chong et. al. We then characterize the capacity region of this type of degraded ZC.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014330","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}
引用次数: 13
Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime 有限缓冲状态下带反馈的无环擦除网络的吞吐量和延迟
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592797
Nima Torabkhani, B. Vellambi, F. Fekri
{"title":"Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime","authors":"Nima Torabkhani, B. Vellambi, F. Fekri","doi":"10.1109/CIG.2010.5592797","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592797","url":null,"abstract":"The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks, packets are lost due to either link erasures or blocking by the full buffers. In this paper, we propose a novel method that iteratively estimates the performance parameters of the network and more importantly reduces the computational complexity compared to the exact analysis. This is the first work that analytically studies the effect of finite memory on the throughput and latency in general wired acyclic networks with erasure links. As a case study, a random packet routing scheme with ideal feedback on the links is used. The proposed framework yields a fairly accurate estimate of the probability distribution of buffer occupancies at the intermediate nodes using which we can not only identify the congested and starving nodes but also obtain analytical expressions for throughput and average delay of a packet in the network. The theoretical framework presented here can be applied to many wired networks, from Internet to more futuristic applications such as networks-on-chip under various communication and network coding scenarios.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126382033","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}
引用次数: 3
Boolean functions whose restrictions are highly nonlinear 约束是高度非线性的布尔函数
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592908
Constanza Riera, M. Parker
{"title":"Boolean functions whose restrictions are highly nonlinear","authors":"Constanza Riera, M. Parker","doi":"10.1109/CIG.2010.5592908","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592908","url":null,"abstract":"We construct Boolean functions whose non-trivial restrictions are either highly nonlinear with respect to the Walsh-Hadamard or the negahadamard transform. We generalise these properties, identify group actions that preserve them, and obtain complementary sets from our functions.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401696","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}
引用次数: 5
The benefits from simultaneous transmission and reception in wireless networks 无线网络中同时传输和接收的好处
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592815
C. Weeraddana, M. Codreanu, M. Latva-aho, A. Ephremides
{"title":"The benefits from simultaneous transmission and reception in wireless networks","authors":"C. Weeraddana, M. Codreanu, M. Latva-aho, A. Ephremides","doi":"10.1109/CIG.2010.5592815","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592815","url":null,"abstract":"In a wireless network, the problem of self interference arises whenever a node transmits and receives simultaneously in the same frequency band. So far only two extreme approaches to circumvent this problem were thoroughly investigated in the literature. The first one prevents any node to transmit and receive simultaneously which may lead to a too conservative design. The second one assumes perfect self interference cancelation which can be too optimistic since it ignores all possible technological limitations. To fill this gap, we provide a method to evaluate the network layer benefits from simultaneous transmission and reception when the network nodes employ self interference cancelation techniques with different degrees of accuracy. From a network design perspective, the provided method can be used to find the required level of accuracy for the self interference cancelation such that certain gains are achieved at the network layer. Numerical results suggest that the accuracy of existing self interference cancelation techniques can provide significant gains for certain network setups.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126771378","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
Source coding with common reconstruction and action-dependent side information 具有共同重构和动作相关侧信息的源编码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592707
Kittipong Kittichokechai, T. Oechtering, M. Skoglund
{"title":"Source coding with common reconstruction and action-dependent side information","authors":"Kittipong Kittichokechai, T. Oechtering, M. Skoglund","doi":"10.1109/CIG.2010.5592707","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592707","url":null,"abstract":"We determine the rate region of a source coding problem with common reconstruction and action-dependent side information where an action sequence is taken by an encoder over a rate-limited link. We show that the rate region depends only on the sum-rate and the sum-rate distortion and cost function is characterized. The result serves as a fundamental limit in transmission scenarios where the encoder wants to control and monitor the quality of the decoder's reconstruction via the respective uses of action sequences and a common reconstruction constraint.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794416","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}
引用次数: 8
The collection channel in a Wireless Sensor Network 无线传感器网络中的采集通道
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592725
B. Larish, G. Riley
{"title":"The collection channel in a Wireless Sensor Network","authors":"B. Larish, G. Riley","doi":"10.1109/CIG.2010.5592725","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592725","url":null,"abstract":"We define the collection channel in a Wireless Sensor Network (WSN) and show how this collection channel can be used in the proofs of new types of coding theorems for WSNs. These coding theorems differ from traditional coding theorems in that they are used to describe aspects of the WSN other than source and channel codes. We also determine the capacity of the collection channel. This capacity is complementary to the transport capacity of a communication system and represents the WNS's ability to obtain information about a phenomenon that it is sensing.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125776631","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}
引用次数: 3
Applications of semidefinite programming to coding theory 半定规划在编码理论中的应用
2010 IEEE Information Theory Workshop Pub Date : 2010-09-08 DOI: 10.1109/CIG.2010.5592938
C. Bachoc
{"title":"Applications of semidefinite programming to coding theory","authors":"C. Bachoc","doi":"10.1109/CIG.2010.5592938","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592938","url":null,"abstract":"We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130234247","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}
引用次数: 5
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学术文献互助群
群 号:604180095
Book学术官方微信