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

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

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

On storage codes allowing partially collaborative repairs 存储代码允许部分协作修复

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

Shiqiu Liu, F. Oggier

引用次数: 10

Weakly secure data exchange with Generalized Reed Solomon codes 用广义Reed Solomon码进行弱安全数据交换

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

M. Yan, A. Sprintson, I. Zelenko

引用次数: 41

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

Cache-induced opportunistic MIMO cooperation: A new paradigm for future wireless content access networks 缓存诱导的机会性MIMO合作:未来无线内容接入网络的新范例

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

An Liu, V. Lau

引用次数: 11

Codes for high performance write and read processes in multi-level NVMs 多级nvm中高性能读写进程代码

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

Evyatar Hemo, Yuval Cassuto

引用次数: 2

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

Distributed decode-forward for multicast 用于组播的分布式解码转发

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

S. Lim, Kwang Taik Kim, Young-Han Kim

引用次数: 31

Capacity approximation of memoryless channels with countable output alphabets 具有可计数输出字母的无记忆信道的容量近似

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

Tobias Sutter, Peyman Mohajerin Esfahani, David Sutter, J. Lygeros

引用次数: 4