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

Design of non-precoded protograph-based LDPC codes 基于非预编码原型的LDPC代码设计

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

H. Uchikawa

引用次数: 34

To average or not to average: Trade-off in compressed sensing with noisy measurements 平均或不平均:带噪声测量的压缩感知中的权衡

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

Kei Sano, Ryosuke Matsushita, Toshiyuki TANAKA

引用次数: 2

A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes 使用稀疏图码计算O(k log n)样本复杂度的k-稀疏n-长度DFT的鲁棒R-FFAST框架

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

S. Pawar, K. Ramchandran

{"title":"A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes","authors":"S. Pawar, K. Ramchandran","doi":"10.1109/ISIT.2014.6875154","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875154","url":null,"abstract":"The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X⃗ of the signal x⃗ has only k non-zero coefficients (where k <; n), can we do better? In [1], we presented a novel FFAST (Fast Fourier Aliasing-based Sparse Transform) algorithm that cleverly induces sparse graph codes in the DFT domain, via a Chinese-Remainder-Theorem (CRT)-guided sub-sampling operation of the time-domain samples. The resulting sparse graph code is then exploited to devise a simple and fast iterative onion-peeling style decoder that computes an n length DFT of a signal using only O(k) time-domain samples and O(k log k) computations, in the absence of any noise. In this paper, we extend the FFAST framework of [1] to the case where the time-domain samples are corrupted by white Gaussian noise. In particular, we show that the extended noise robust algorithm R-FFAST computes an n-length k-sparse DFT X⃗ using O(k log n)1 noise-corrupted time-domain samples, in O(n log n) computations2. While our theoretical results are for signals with a uniformly random support of the non-zero DFT coefficients and additive white Gaussian noise, we provide simulation results which demonstrates that the R-FFAST algorithm performs well even for signals like MR images, that have an approximately sparse Fourier spectrum with a non-uniform support for the dominant DFT coefficients.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"25 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":"122246044","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}

引用次数: 19

Variable-density sampling on the dual lattice 对偶晶格上的变密度采样

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

Peng Zhang, Sumei Sun, Cong Ling

引用次数: 0

A greedy search algorithm with tree pruning for sparse signal recovery 稀疏信号恢复的树剪枝贪婪搜索算法

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

Jaeseok Lee, Seokbeop Kwon, B. Shim

引用次数: 1

Capacity theorems for multi-functioning radios 多功能无线电的容量定理

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

Yu Zhao, Biao Chen

引用次数: 9

New results on third-order coding rate for universal fixed-to-variable source coding 通用定变源编码的三阶编码速率新结果

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

O. Kosut, L. Sankar

引用次数: 15

Generalized sphere packing bound: Applications 广义球填充界:应用

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

Arman Fazeli, A. Vardy, Eitan Yaakobi

{"title":"Generalized sphere packing bound: Applications","authors":"Arman Fazeli, A. Vardy, Eitan Yaakobi","doi":"10.1109/ISIT.2014.6875035","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875035","url":null,"abstract":"In this paper we study a generalization of the sphere packing bound for channels that are not regular (the size of balls with a fixed radius is not necessarily the same). Our motivation to tackle this problem is originated by a recent work by Kulkarni and Kiyavash who introduced a method, based upon tools from hypergraph theory, to calculate explicit upper bounds on the cardinalities of deletion-correcting codes. Under their setup, the deletion channel is represented by a hypergraph such that every deletion ball is a hyperedge. Since every code is a matching in the hypergraph, an upper bound on the codes is given by an upper bound on the largest matching in a hypergraph. This bound, called here the generalized sphere packing bound, can be found by the solution of a linear programming problem. We similarly study and analyze specific examples of error channels. We start with the Z channel and show how to exactly find the generalized sphere packing bound for this setup. Next studied is the non-binary limited magnitude channel both for symmetric and asymmetric errors. We focus on the case of single error and derive upper bounds on the generalized sphere packing bound in this channel. We follow up on the deletion case, which was the original motivation of the work by Kulkarni and Kiyavash, and show how to improve upon their upper bounds for the single deletion case. Finally, we apply this method for projective spaces and find its generalized sphere packing bound for the single-error case.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"25 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":"133102043","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

Asymptotically minimax regret for models with hidden variables 隐变量模型的渐近极大极小误差

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

J. Takeuchi, A. Barron

引用次数: 4

A space-time Tx scheme for two-cell MISO-BC with delayed CSIT 一种具有延迟CSIT的双单元MISO-BC空时传输方案

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

Jhanak Parajuli, G. Abreu

引用次数: 4