搜索结果: 46-60 共查到“知识库 信息论”相关记录313条 . 查询时间(2.438 秒)
Information Transmission using the Nonlinear Fourier Transform, Part II: Numerical Methods
Fiber-optic communications forward nonlinear Fourier transform Zakharov-Shabat spectral problem numerical methods
2012/4/23
In this paper, numerical methods are suggested to compute the discrete and the continuous spectrum of a signal with respect to the Zakharov-Shabat system, a Lax operator underlying numerous integrable...
Compressed Sensing for Denoising in Adaptive System Identification
Sparse system identification compressed sensing reconstruction algorithm random filter least mean square
2012/4/23
We propose a new technique for adaptive identification of sparse systems based on the compressed sensing (CS) theory. We manipulate the transmitted pilot (input signal) and the received signal such th...
Exploiting Channel Correlation and PU Traffic Memory for Opportunistic Spectrum Scheduling
Cognitive radio networks spectrum server temporal correlation partially observable Markov decision processes genie-aided system
2012/4/23
We consider a cognitive radio network with multiple primary users (PUs) and one secondary user (SU), where a spectrum server is utilized for spectrum sensing and scheduling the SU to transmit over one...
Gradually Atom Pruning for Sparse Reconstruction and Extension to Correlated Sparsity
Smoothed l0 l1 minimization compressed sensing reconstruction algorithm correlated sparsity
2012/4/23
We propose a new algorithm for recovery of sparse signals from their compressively sensed samples. The proposed algorithm benefits from the strategy of gradual movement to estimate the positions of no...
Atomic norm denoising with applications to line spectral estimation
Atomic norm line spectral estimation Information Theory
2012/4/18
The sub-Nyquist estimation of line spectra is a classical problem in signal processing, but currently popular subspace-based techniques have few guarantees in the presence of noise and rely on a prior...
Implementation Of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs
Implementation Of Decoders LDPC Block Codes LDPC Convolutional Codes GPUs
2012/4/17
With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. LDPC codes can accomplish bit error rates (BERs) as low as...
Decomposition Methods for Large Scale LP Decoding
LP Decoding Alternating Direction Method of Multipliers Information Theory
2012/4/18
When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be ...
On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder
Dispersions of Discrete Memoryless Channels Noncausal State Information Encoder Information Theory
2012/4/18
In this paper, we study the finite blocklength limits of state-dependent discrete memoryless channels where the discrete memoryless state is known noncausally at the encoder. For the point-to-point ca...
In this work we analyze principle component analysis (PCA) as a deterministic input-output system. We show that the relative information loss induced by reducing the dimensionality of the data after p...
Let $x \in \R$ be given. As we know the, amount of bits needed to binary code $x$ with given accuracy ($h \in \R$) is approximately $ \m_{h}(x) \approx \log_{2}(\max {1, |\frac{x}{h}|}). $ We consider...
On The Achievable Rate Region of a New Wiretap Channel With Side Information
Equivocation rate secrecy capacity side information wiretap channel perfect secrecy
2012/4/17
A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the tr...
Worst-Case Robust Multiuser Transmit Beamforming Using Semidefinite Relaxation: Duality and Implications
Worst-Case Robust Multiuser Semidefinite Relaxation Duality Implications Information Theory
2012/4/17
This paper studies a downlink multiuser transmit beamforming design under spherical channel uncertainties, using a worst-case robust formulation. This robust design problem is nonconvex. Recently, a c...
Covering Numbers for Convex Functions
Covering Numbers Convex Functions Information Theory
2012/4/17
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C(...
Partition Reduction for Lossy Data Compression Problem
Partition Reduction Lossy Data Compression Problem Information Theory
2012/4/17
We consider the computational aspects of lossy data compression problem, where the compression error is determined by a cover of the data space. We propose an algorithm which reduces the number of par...
R\'enyi entropy of order \alpha is a general measure of entropy. In this paper we derive estimations for the R\'enyi entropy of the mixture of sources in terms of the entropy of the single sources. Th...