Sciweavers

143 search results - page 26 / 29
» Perfect Space Time Block Codes
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras
— For the number of transmit antennas N = 2a the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a 2aâˆ...
Sanjay Karmakar, B. Sundar Rajan
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 months ago
Asymptotically-Good, Multigroup ML-Decodable STBCs
For a family/sequence of Space-Time Block Codes (STBCs) C1, C2, . . . , with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use, i = 1, 2, . ....
Natarajan Lakshmi Prasad, B. Sundar Rajan
SIGIR
2002
ACM
13 years 7 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby
CODES
2003
IEEE
14 years 1 months ago
Accurate estimation of cache-related preemption delay
Multitasked real-time systems often employ caches to boost performance. However the unpredictable dynamic behavior of caches makes schedulability analysis of such systems difficul...
Hemendra Singh Negi, Tulika Mitra, Abhik Roychoudh...
CLEIEJ
2006
96views more  CLEIEJ 2006»
13 years 8 months ago
A Single-Version Algorithmic Approach to Fault Tolerant Computing Using Static Redundancy
This paper describes a single-version algorithmic approach to design in fault tolerant computing in various computing systems by using static redundancy in order to mask transient...
Goutam Kumar Saha