搜索结果: 16-30 共查到“知识库 信息论”相关记录312条 . 查询时间(0.406 秒)
Recovery of Sparse 1-D Signals from the Magnitudes of their Fourier Transform
Recovery of Sparse 1-D Signals the Magnitudes their Fourier Transform Information Theory
2012/6/27
The problem of signal recovery from the autocorrelation, or equivalently, the magnitudes of the Fourier transform, is of paramount importance in various fields of engineering. In this work, for one-di...
Lossy Computing of Correlated Sources with Fractional Sampling
Lossy Computing of Correlated Sources Fractional Sampling Information Theory
2012/6/27
This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the ...
Distributed Functional Scalar Quantization Simplified
Distributed Functional Scalar Quantization Simplified Information Theory
2012/6/25
Distributed functional scalar quantization (DFSQ) theory provides optimality conditions and predicts performance of data acquisition systems in which a computation on acquired data is desired. We addr...
Assisted Common Information with an Application to Secure Two-Party Sampling
Assisted Common Information Secure Two-Party Sampling Information Theory
2012/6/25
In this paper we generalize the notion of common information of two dependent variables introduced by G\'acs & K\"orner. They defined common information as the largest entropy rate of a common random ...
Transceiver Design for Multi-user Multi-antenna Two-way Relay Cellular Systems
Two-way relay multi-user multi-antenna transceiver cellular systems
2012/6/21
In this paper, we design interference free transceivers for multi-user two-way relay systems, where a multi-antenna base station (BS) simultaneously exchanges information with multiple single-antenna ...
Conditional Kolmogorov Complexity and Universal Probability
Conditional Kolmogorov Complexity Universal Probability Information Theory
2012/6/21
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discr...
Making WOM Codes Decodable Using Short Synchronous WOM Codes
Making WOM Codes Decodable Short Synchronous WOM Codes Information Theory
2012/6/21
While some write once memory (WOM) codes are inherently decodable, others require the added knowledge of the current generation in order to successfully decode the state of the memory. If there is no ...
Multi-Sparse Signal Recovery for Compressive Sensing
Multi-Sparse Signal Recovery Compressive Sensing Information Theory
2012/6/19
Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one do...
Application of Fractional Fourier Transform in Cepstrum Analysis
Application of Fractional Fourier Transform Cepstrum Analysis Information Theory
2012/6/21
Source wavelet estimation is the key in seismic signal processing for resolving subsurface structural properties. Homomorphic deconvolution using cepstrum analysis has been an effective method for wav...
Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information
Shannon entropy differential entropy sumset bounds inequalities submodularity data processing mutual information
2012/6/19
The sumset and inverse sumset theories of Freiman, Pl\"{u}nnecke and Ruzsa, give bounds connecting the cardinality of the sumset $A+B=\{a+b\;;\;a\in A,\,b\in B\}$ of two discrete sets $A,B$, to the ca...
De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code
De-randomizing Shannon Analysis of a Capacity-Achieving Rateless Code Information Theory
2012/6/15
This paper presents an analysis of spinal codes, a class of rateless codes proposed recently. We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (BSC) and the additiv...
On the Computation of the Higher-Order Statistics of the Channel Capacity for Amplify-and-Forward Multihop Transmission
Computation the Higher-Order Statistics the Channel Capacity Amplify-and-Forward Multihop Transmission Information Theory
2012/6/15
The latest research trends in the wireless communications and standardizations [1] accentuate that the higher-order statistics (HOS) of the channel capacity are necessary to achieve a reliable and tru...
Some contemporary views of the universe assume information and computation to be key in understanding and explaining the basic structure underpinning physical reality. We introduce the Computable Univ...
We consider the problem of designing optimal $M \times N$ ($M \leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the wo...
Detection Performance in Balanced Binary Relay Trees with Node and Link Failures
Detection Performance Balanced Binary Relay Trees Node and Link Failures Information Theory
2012/6/14
We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree are sensors generating binary messages. The root of the tree is a fusion center ...