Sciweavers

6111 search results - page 151 / 1223
» Time, Hardware, and Uniformity
Sort
View
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 10 months ago
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 10 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
14 years 4 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
ECRTS
2008
IEEE
14 years 4 months ago
A Gravitational Task Model for Target Sensitive Real-Time Applications
The commonly used task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Within these windows, execut...
Raphael Guerra, Gerhard Fohler
BIRTHDAY
2005
Springer
14 years 3 months ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....