搜索结果: 136-150 共查到“信息论”相关记录674条 . 查询时间(4.716 秒)
Asymptotically good binary linear codes with asymptotically good self-intersection spans
Asymptotically good binary linear codes asymptotically good self-intersection spans Information Theory
font style='font-size:12px;'>
2012/4/16
If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging...
An Outer Bound for the Memoryless Two-user Interference Channel with General Cooperation
Information Theory Memoryless Two-user Interference Channel General Cooperation Outer Bound
font style='font-size:12px;'>
2012/4/16
The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. T...
西安交通大学启动iTunes U平台、i交通大学 （图）
西安交通大学 启动 iTunes U平台 i交通大学
font style='font-size:12px;'>
2012/4/11
2012年4月9日，在交通大学建校116周年暨西安交通大学迁校56周年之际，西安交通大学iTunes U平台、i交通大学（校园移动门户）正式面向全球发布，启动仪式在科学馆隆重举行。
第一届北京航空航天大学—中国科学院交叉学科研讨会召开（图）
第一届 北京航空航天大学 中国科学院 交叉学科 研讨会 召开 计算力学 非线性控制与优化 信息处理
font style='font-size:12px;'>
2012/4/24
2012年3月31日至4月1日，由中国科学院数学与系统科学研究院、北京航空航天大学共同举办的“第一届北航—中科院交叉学科研讨会”在北京召开。来自中科院数学院、北航的近百位专家及学者参加了研讨会。
Mitigating Timing Errors in Time-Interleaved ADCs: a signal conditioning approach
Mitigating Timing Errors Time-Interleaved ADCs signal conditioning approach Information Theory
font style='font-size:12px;'>
2012/4/23
Novel techniques based on signal-conditioning are presented to mitigate timing errors in time-interleaved ADCs. A theoretical bound on the achievable spurious signal content, on applying the technique...
Faster than Nyquist but Slower than Tropp et al
Faster than Nyquist but Slower Information Theory
font style='font-size:12px;'>
2012/4/23
This paper presents a significant modification to the Random Demodulator (RD) of Tropp et al. for sub-Nyquist sampling of frequency-sparse signals. The modification, termed constrained random demodula...
Information Transmission using the Nonlinear Fourier Transform, Part II: Numerical Methods
Fiber-optic communications forward nonlinear Fourier transform Zakharov-Shabat spectral problem numerical methods
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Relative Information Loss in the PCA
Relative Information Loss PCA Information Theory
font style='font-size:12px;'>
2012/4/18
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...