2016 IEEE International Symposium on Information Theory (ISIT)最新文献_第10页

Caching in mobile HetNets: A throughput-delay trade-off perspective 移动HetNets中的缓存:吞吐量-延迟权衡的视角

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541498

Trung-Anh Do, Sang-Woon Jeon, Won-Yong Shin

引用次数: 5

Ginibre sampling and signal reconstruction Ginibre采样和信号重建

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541422

F. Zabini, A. Conti

{"title":"Ginibre sampling and signal reconstruction","authors":"F. Zabini, A. Conti","doi":"10.1109/ISIT.2016.7541422","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541422","url":null,"abstract":"The spatial distribution of sensing nodes plays a crucial role in signal sampling and reconstruction via wireless sensor networks. Although homogeneous Poisson point process (PPP) model is widely adopted for its analytical tractability, it cannot be considered a proper model for all experiencing nodes. The Ginibre point process (GPP) is a class of determinantal point processes that has been recently proposed for wireless networks with repulsiveness between nodes. A modified GPP can be considered an intermediate class between the PPP (fully random) and the GPP (relatively regular) that can be derived as limiting cases. In this paper we analyze sampling and reconstruction of finite-energy signals in ℝd when samples are gathered in space according to a determinantal point process whose second order product density function generalizes to ℝd that of a modified GPP in ℝ2. We derive closed form expressions for sampled signal energy spectral density (ESD) and for signal reconstruction mean square error (MSE). Results known in the literature are shown to be sub-cases of the proposed framework. The proposed analysis is also able to answer to the fundamental question: does the higher regularity of GPP also imply an higher signal reconstruction accuracy, according to the intuition? Theoretical results are illustrated through a simple case study.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852256","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}

引用次数: 11

Some results on the scalar Gaussian interference channel 关于标量高斯干涉信道的一些结果

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541689

Salman Beigi, Sida Liu, Chandra Nair, M. Yazdanpanah

引用次数: 11

Broadcast channel under unequal coherence intervals 不等相干间隔下的广播信道

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541304

Mohamed Fadel, Aria Nosratinia

引用次数: 5

Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth 具有最优修复带宽的MDS阵列码和RS码的显式构造

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541489

Min Ye, A. Barg

引用次数: 43

A general optimality condition of link scheduling for emptying a wireless network 清空无线网络的链路调度的一般最优性条件

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541538

Qing He, D. Yuan, A. Ephremides

引用次数: 2

Zero-rate achievability of posterior matching schemes for channels with memory 具有记忆信道后验匹配方案的零速率可达性

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541726

Jui Wu, A. Anastasopoulos

引用次数: 2

Integer-forcing source coding: Successive cancellation and source-channel duality 整数强制源编码:连续消去和源信道对偶性

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541280

Wenbo He, B. Nazer

引用次数: 12

Two-stage orthogonal Subspace Matching Pursuit for joint sparse recovery 联合稀疏恢复的两阶段正交子空间匹配追踪

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541724

Kyung-Su Kim, Sae-Young Chung

{"title":"Two-stage orthogonal Subspace Matching Pursuit for joint sparse recovery","authors":"Kyung-Su Kim, Sae-Young Chung","doi":"10.1109/ISIT.2016.7541724","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541724","url":null,"abstract":"The joint sparse recovery problem addresses simultaneous recovery of jointly sparse signals (signal matrix) and their union support whose cardinality is k from their multiple measurement vectors (MMV) obtained through a common sensing matrix. k + 1 is the ideal lower bound on the minimum required number of measurements for perfect recovery for almost all signals, i.e., excluding a set of Lebesgue measure zero. To get close to the lower bound by taking advantage of the signal structure, Lee, et al. proposed the Subspace-Augmented MUltiple SIgnal Classification (SA-MUSIC) method which is guaranteed to achieve the lower bound when the rank of signal matrix is k and provided less restrictive conditions than existing methods in approaching k +1 in the practically important case when the rank of the signal matrix is smaller than k. The conditions, however, are still restrictive despite its empirically superior performance. We propose an efficient algorithm called the Two-stage orthogonal Subspace Matching Pursuit (TSMP) which has less theoretical restriction in approaching the lower bound than existing algorithms. Empirical results show that the TSMP method with low complexity outperforms most existing methods. The proposed scheme has better empirical performance than most existing methods even in the single measurement vectors (SMV) problem case. Variants of restricted isometry property or mutual coherence are used to improve the theoretical guarantees of TSMP and to cover the noisy case as well.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"601 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123177449","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

An LP lower bound for rate distortion with variable side information 具有可变侧信息的率失真的LP下界

2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541356

Sinem Unal, A. Wagner

引用次数: 3