2014 IEEE International Symposium on Information Theory最新文献_第6页

Efficient subnetwork selection in relay networks 中继网络中有效的子网选择

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875169

Siddhartha Brahma, Ayan Sengupta, C. Fragouli

{"title":"Efficient subnetwork selection in relay networks","authors":"Siddhartha Brahma, Ayan Sengupta, C. Fragouli","doi":"10.1109/ISIT.2014.6875169","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875169","url":null,"abstract":"We consider a source that would like to communicate with a destination over a layered Gaussian relay network.We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting the source with the destination. Our method starts by formulating an integer optimization problem that maximizes the rates that the Quantize-Map-and-Forward relaying protocol can achieve over a selected subnetwork; we then relax the integer constraints to obtain a non-linear optimization over reals. For diamond networks, we prove that this optimization over reals is concave while for general layered networks we give empirical demonstrations of near-concavity, paving the way for efficient algorithms to solve the relaxed problem. We then round the relaxed solution to select a specific subnetwork. Simulations using off-the-shelf non-linear optimization algorithms demonstrate excellent performance with respect to the true integer optimum for both diamond networks as well as multi-layered networks. Even with these non-customized algorithms, significant time savings are observed vis-à-vis exhaustive integer optimization.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"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":"129272453","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

Scrutinizing the average error probability for Nakagami fading channels 中上衰落信道的平均误差概率研究

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875361

G. Alirezaei, R. Mathar

引用次数: 9

One helper source coding problem for a class of correlated sources with memory 一类具有内存的相关源的辅助源编码问题

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874899

Y. Oohama

引用次数: 2

Polarized random variables: Maximal correlations and common information 极化随机变量:最大相关性和共同信息

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875112

Naveen Goela

引用次数: 4

An information-spectrum approach to weak variable-length Slepian-Wolf coding 弱变长睡眠狼编码的信息谱方法

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875321

S. Kuzuoka, Shun Watanabe

引用次数: 1

Cumulant generating function of codeword lengths in optimal lossless compression 最优无损压缩中码字长度累积量生成函数

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875283

T. Courtade, S. Verdú

引用次数: 36

Secure successive refinement with degraded side information 安全的连续细化与退化的侧信息

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875319

Dejian Xu, Kittipong Kittichokechai, T. Oechtering, M. Skoglund

引用次数: 3

On the design and throughput analysis of a new MME detector using Bartlett's method 基于Bartlett方法的新型MME检测器的设计与通量分析

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875406

E. G. Yousif, T. Ratnarajah

{"title":"On the design and throughput analysis of a new MME detector using Bartlett's method","authors":"E. G. Yousif, T. Ratnarajah","doi":"10.1109/ISIT.2014.6875406","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875406","url":null,"abstract":"Detection of primary users is a very crucial task for cognitive radio networks. On the other hand, the choice of the spectrum sensing algorithm affects the achievable throughput of the secondary network when the cognitive radios employ the interweave approach. Focusing on the eigenvalue-based detector, it can be seen that most proposed methods are based on time domain. Therefore, in this paper we present and analyse a new class of eigenvalue detectors in frequency domain (FD). The major contributions of this paper are of two parts. First, we introduce a new minimum-maximum eigenvalue (MME) spectrum sensing method based on Bartlett's method of estimation. By making use of the eigenvalues of the diagonalized quadratic form representation of Bartlett's estimate, the distribution of the ratio of extreme eigenvalues is studied, and then the performance of the detector is addressed and accurate expressions where obtained for the probabilities of false alarm and detection. Second, assuming that the secondary network employs an interweave approach we study the average achievable throughput. All obtained formulas are verified through Monte Carlo simulations. The obtained results gives an insight into the validity of using MME detection in FD.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"33 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":"125100257","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

A novel collusion attack on finite alphabet digital fingerprinting systems 有限字母数字指纹系统的一种新型合谋攻击

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875231

Jalal Etesami, N. Kiyavash

引用次数: 1

Stable grassmann manifold embedding via Gaussian random matrices 基于高斯随机矩阵的稳定格拉斯曼流形嵌入

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875310

Hailong Shi, Hao Zhang, Gang Li, Xiqin Wang

引用次数: 0