39 search results - page 1 / 8 » SPEED: Symbolic Complexity Bound Analysis |
CAV
2009
Springer
14 years 5 months ago
2009
Springer
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Due to relative motion between the transmitter and the receiver, the carrier of the received signal in digital burstmode transmission can be affected by Doppler distortion. Thi...
TCOM
2008
13 years 4 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...