Sciweavers

779 search results - page 100 / 156
» A Simple Program Transformation for Parallelism
Sort
View
TWC
2010
13 years 2 months ago
Rateless coding for MIMO fading channels: performance limits and code construction
In this letter the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the sys...
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor
ENTCS
2002
98views more  ENTCS 2002»
13 years 7 months ago
Verified Code Generation for Embedded Systems
Digital signal processors provide specialized SIMD (single instruction multiple data) operations designed to dramatically increase performance in embedded systems. While these ope...
Sabine Glesner, Rubino Geiß, Boris Boesler
JAR
1998
60views more  JAR 1998»
13 years 7 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
ANSS
2006
IEEE
14 years 1 months ago
Performance Enhancement by Eliminating Redundant Function Execution
Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, “function reuse”. Previously, we have shown such a behavior ...
Peng Chen, Krishna M. Kavi, Robert Akl
BIRTHDAY
2009
Springer
14 years 13 days ago
Pervasive Theory of Memory
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buers and store buer forwarding, cache coherence protocols, o...
Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer