搜索结果: 1-6 共查到“信息论 I/O Performance”相关记录6条 . 查询时间(0.156 秒)
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 ...
An Adaptive Conditional Zero-Forcing Decoder with Full-diversity, Least Complexity and Essentially-ML Performance for STBCs
Adaptive Conditional Zero-Forcing Decoder Full-diversity Essentially-ML Performance STBCs
2012/5/24
A low complexity, essentially-ML decoding technique for the Golden code and the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the de...
Performance Analysis of Decode-and-Forward Relaying in Gamma-Gamma Fading Channels
Performance Analysis Decode-and-Forward Gamma-Gamma Fading Channels Information Theory
2012/5/24
Decode-and-forward (DF) cooperative communication based on free space optical (FSO) links is studied in this letter. We analyze performance of the DF protocol in the FSO links following the Gamma-Gamm...
Coding Scheme for Optimizing Random I/O Performance
Coding Scheme Optimizing Random I/O Performance
2012/3/1
Flash memories intended for SSD and mobile applications need to provide high random I/O performance. This requires using efficient schemes for reading small chunks of data (e.g. 0.5KB - 4KB) from rand...
Monobit Digital Receivers for QPSK: Design, Analysis and Performance
Monobit Digital Receivers QPSK Design Analysis and Performance
2012/2/29
Future communication system requires large bandwidth to achieve high data rate up to multigigabit/ sec, which makes analog-to-digital (ADC) become a key bottleneck for the implementation of digital re...
Performance Guarantee under Longest-Queue-First Schedule in Wireless Networks
Wireless Networks Scheduling Longest Queue First Policy Stability Local Pooling Interference
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...