2012 IEEE Information Theory Workshop最新文献_第7页

Fundamental limits on power consumption for lossless signal reconstruction 无损信号重建的基本功耗限制

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404730

P. Grover

{"title":"Fundamental limits on power consumption for lossless signal reconstruction","authors":"P. Grover","doi":"10.1109/ITW.2012.6404730","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404730","url":null,"abstract":"Does approaching fundamental limits on rates of information acquisitionor transmission fundamentally require increased power consumption in the processing circuitry? Our recent work shows that this is the case for channel coding for some simple circuit and channel models. In this paper, we first develop parallel results for source coding. Reinterpreting existing results on complexity of lossless source coding, we first observe that the sum power consumed in computational nodes in the circuitry of the encoder and the decoder diverges to infinity as the target error probability approaches zero and the coding rate approaches the source entropy. Next, focusing on on-chip wires, we show that the power consumed in circuit wiring also diverges to infinity as the error probability approaches zero. For the closely related problem of recovering a sparse signal, we first derive a fundamental bound on the required number of “finite-capacity” (e.g. quantized or noisy) measurements. By extending our bounds on wiring complexity and power consumption to sparse-signal recovery, we observe that there is a tradeoff between measurement power and power required to compute the recovered signal.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130089401","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}

引用次数: 5

Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decoding 解码和转发为高斯中继信道通过标准AWGN编码和解码

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404714

A. Khina, Or Ordentlich, U. Erez, Y. Kochman, G. Wornell

引用次数: 16

A theoretical approach to gene network identification 基因网络识别的理论方法

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404709

J. Birget, D. Lun, Anthony Wirth, Dawei Hong

引用次数: 2

Grassmannian signalling achieves the ergodic high SNR capacity of the non-coherent MIMO relay channel within an SNR-independent gap 格拉斯曼信令在信噪比无关的间隙内实现了非相干MIMO中继信道的遍历高信噪比容量

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404711

R. Gohary, H. Yanikomeroglu

引用次数: 0

Constructing good QC-LDPC codes by pre-lifting protographs 用预提升原型构造好的QC-LDPC代码

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404658

David G. M. Mitchell, R. Smarandache, D. Costello

引用次数: 3

An MDL-based change-detection algorithm with its applications to learning piecewise stationary memoryless sources 一种基于mdl的变化检测算法及其在分段平稳无记忆源学习中的应用

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404736

Hiroki Kanazawa, K. Yamanishi

引用次数: 0

Privacy amplification theorem for bounded storage eavesdropper 有界存储窃听器的隐私放大定理

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404652

Shun Watanabe, Y. Oohama

引用次数: 5

Finite-length performance of spatially-coupled LDPC codes under TEP decoding 空间耦合LDPC码在TEP译码下的有限长度性能

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404722

P. Olmos, F. Pérez-Cruz, Luis Salamanca, J. J. Murillo-Fuentes

引用次数: 1

The analog formulation of sparsity implies infinite divisibility and rules out Bernoulli-Gaussian priors 稀疏性的模拟公式意味着无限可除性，并排除伯努利-高斯先验

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404765

A. Amini, U. Kamilov, M. Unser

引用次数: 8

The energy harvesting multiple access channel with energy storage losses 具有储能损耗的能量收集多址信道

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404772

Kaya Tutuncuoglu, A. Yener

引用次数: 11