IEEE Trans. Inf. Theory最新文献_第2页

The Approximate Capacity of the Gaussian $N$-Relay Diamond Network 高斯$N$中继菱形网络的近似容量

IEEE Trans. Inf. Theory Pub Date : 2013-02-01 DOI: 10.1109/TIT.2012.2219154

Urs Niesen, S. Diggavi

{"title":"The Approximate Capacity of the Gaussian $N$-Relay Diamond Network","authors":"Urs Niesen, S. Diggavi","doi":"10.1109/TIT.2012.2219154","DOIUrl":"https://doi.org/10.1109/TIT.2012.2219154","url":null,"abstract":"We consider the Gaussian “diamond” or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even for the symmetric setting, in which the channel gains to the relays are identical and the channel gains from the relays are identical, the capacity of this channel is unknown in general. The best known capacity approximation is up to an additive gap of order N bits and up to a multiplicative gap of order N2, with both gaps independent of the channel gains. In this paper, we approximate the capacity of the symmetric Gaussian N-relay diamond network up to an additive gap of 1.8 bits and up to a multiplicative gap of a factor 14. Both gaps are independent of the channel gains and, unlike the best previously known result, are also independent of the number of relays N in the network. Achievability is based on bursty amplify-and-forward, showing that this simple scheme is uniformly approximately optimal, both in the low-rate as well as in the high-rate regimes. The upper bound on capacity is based on a careful evaluation of the cut-set bound. We also present approximation results for the asymmetric Gaussian N-relay diamond network. In particular, we show that bursty amplify-and-forward combined with optimal relay selection achieves a rate within a factor O(log4(N)) of capacity with preconstant in the order notation independent of the channel gains.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"17 1","pages":"845-859"},"PeriodicalIF":0.0,"publicationDate":"2013-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83907869","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}

引用次数: 25

Restricted isometry constants where lpsparse recovery can fail for 0 < p <= 1 限制等距常数，当0 < p <= 1时，lp稀疏恢复可能失败

IEEE Trans. Inf. Theory Pub Date : 2009-05-01 DOI: 10.1109/TIT.2009.2016030

Mike Davies, Rémi Gribonval

{"title":"Restricted isometry constants where lpsparse recovery can fail for 0 < p <= 1","authors":"Mike Davies, Rémi Gribonval","doi":"10.1109/TIT.2009.2016030","DOIUrl":"https://doi.org/10.1109/TIT.2009.2016030","url":null,"abstract":"This paper investigates conditions under which the solution of an underdetermined linear system with minimal lP norm, 0 < p ≤ 1, is guaranteed to be also the sparsest one. Matrices are constructed with restricted isometry constants (RIC) δ2m arbitrarily close to 1/ √2 ≅ 0.707 where sparse recovery with p = 1 fails for at least one m-sparse vector, as well as matrices with δ2m arbitrarily close to one where l1 minimization succeeds for any m-sparse vector. This highlights the pessimism of sparse recovery prediction based on the RIC, and indicates that there is limited room for improving over the best known positive results of Foucart and Lai, which guarantee that l1 minimization recovers all m-sparse vedors for any matrix with δ2m < 2(3 - √2)/7 ≅ 0.4531. These constructions are a by-product of tight conditions for lp recovery (0 ≤ p ≤ 1) with matrices of unit spectral norm, which are expressed in terms of the minimal singular values of 2m-column submatrices. Compared to l1 minimization, lp minimization recovery failure is shown to be only slightly delayed in terms of the RIC values. Furthermore in this case the minimization is nonconvex and it is important to consider the specific minimization algorithm being used. It is shown that when lp optimization is attempted using an iterative reweighted l1 scheme, failure can still occur for δ2m arbitrarily close to 1/ √2.","PeriodicalId":13250,"journal":{"name":"IEEE Trans. Inf. Theory","volume":"5 1","pages":"2203-2214"},"PeriodicalIF":0.0,"publicationDate":"2009-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88624445","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}

引用次数: 63

Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899] 更正“合谋攻击下私人指纹识别系统的容量博弈”[05月884-899]

IEEE Trans. Inf. Theory Pub Date : 2008-11-01 DOI: 10.1109/TIT.2008.929955

A. Somekh-Baruch, N. Merhav

引用次数: 2

Correction to "On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability" [Jun 07 1983-2009] 更正“宽频带下的非相干MIMO信道:容量与可靠性”[june 07 1983-2009]

IEEE Trans. Inf. Theory Pub Date : 2008-11-01 DOI: 10.1109/TIT.2008.929921

Surapol Tan-a-ram

引用次数: 0

Comments on "A New Construction of 16-QAM Golay Complementary Sequences" and Extension for 64-QAM Golay Sequences “16-QAM Golay互补序列的新构造”及64-QAM Golay序列的推广

IEEE Trans. Inf. Theory Pub Date : 2008-07-01 DOI: 10.1109/TIT.2008.924735

Ying Li