搜索结果: 121-135 共查到“知识库 信息论”相关记录313条 . 查询时间(2.001 秒)
Duals of Affine Grassmann Codes and their Relatives
Duals of Affine Grassmann Codes Information Theory
font style='font-size:12px;'>
2011/9/14
Abstract: Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more gen...
Communication Systems for Grid Integration of Renewable Energy Resources
Communication Systems Grid Renewable Energy
font style='font-size:12px;'>
2011/9/13
Abstract: There is growing interest in renewable energy around the world. Since most renewable sources are intermittent in nature, it is a challenging task to integrate renewable energy resources into...
Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices
Complex Orthogonal Forbidden Information Theory
font style='font-size:12px;'>
2011/9/13
Abstract: Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $...
Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Area theorem BP threshold EXIT curve GEXIT curve ISI channels LDPC codes MAP threshold
font style='font-size:12px;'>
2011/9/13
Abstract: Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of bi...
Performance Guarantee under Longest-Queue-First Schedule in Wireless Networks
Wireless Networks Scheduling Longest Queue First Policy Stability Local Pooling Interference
font style='font-size:12px;'>
2011/9/13
Abstract: Efficient link scheduling in a wireless network is challenging. Typical optimal algorithms require solving an NP-hard sub-problem. To meet the challenge, one stream of research focuses on fi...
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
belief propagation max product min sum LDPC codes linear programming decoding
font style='font-size:12px;'>
2011/9/9
Abstract: Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and ...
Use of Hamiltonian Cycles in Cryptograph
Diffie-Hellman key exchange Symmetric key RSA PKI SSL/TLS VPN Hamiltonian cycle
font style='font-size:12px;'>
2011/9/9
Abstract: In cryptography, key distribution is always an important issue in establishing a symmetric key. The famous method of exchanging keys, Diffie-Hellman key exchange, is also vulnerable to a man...
Non-equilibrium Information Envelopes and the Capacity-Delay-Error-Tradeoff of Source Coding
Non-equilibrium Information Envelopes Capacity-Delay-Error-Tradeoff Source Coding Information Theory
font style='font-size:12px;'>
2011/10/8
Abstract: This paper develops an envelope-based approach to establish a link between information and queueing theory. Unlike classical, equilibrium information theory, information envelopes focus on t...
Adaptive Content Search Through Comparisons
Adaptive Content Search Comparisons Learning
font style='font-size:12px;'>
2011/10/8
Abstract: We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem. However, c...
An Introductory Review of Information Theory in the Context of Computational Neuroscience
Introductory Review of Information Theory the Context of Computational Neuroscience Information Theory
font style='font-size:12px;'>
2011/9/9
Abstract: This paper introduces several fundamental concepts in information theory from the perspective of their origins in engineering. Understanding such concepts is important in neuroscience for tw...
A Two Stage Selective Averaging LDPC Decoding
LDPC Decoding Information Theory
font style='font-size:12px;'>
2011/9/8
Abstract: Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over...
Diverse Applications of Algorithmic Probability Theory
Algorithmic Probability Theory Diverse Applications Information Theory
font style='font-size:12px;'>
2011/9/6
Abstract: We reminisce and discuss applications of Algorithmic Probability Theory to a wide range of problems in Artificial Intelligence, philosophy and technological society. We argue that Solomonoff...
Subset sum phase transitions and data compression
Number partitioning integer partitioning subset sum data compression source coding entropy phase transitions
font style='font-size:12px;'>
2011/9/6
Abstract: We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to th...
Sensitivity of Noncoherent WSSUS Fading Channel Capacity
Noncoherent WSSUS Fading Channel Capacity Information Theory
font style='font-size:12px;'>
2011/9/5
Abstract: The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the support of ...
Improving Energy Efficiency Through Multimode Transmission in the Downlink MIMO Systems
downlink MIMO systems singular value decomposition (SVD) block diagonalization (BD) imperfect CSIT
font style='font-size:12px;'>
2011/9/5
Abstract: Adaptively adjusting system parameters including bandwidth, transmit power and mode to maximize the "Bits per-Joule" energy efficiency (BPJ-EE) in the downlink MIMO systems with imperfect ch...