PE
2008
Springer
13 years 11 months ago
2008
Springer
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
APAL
2006
13 years 11 months ago
2006
If x = x1x2
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
GLVLSI
2002
IEEE
14 years 4 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
INDOCRYPT
2003
Springer
14 years 4 months ago
2003
Springer
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
GLOBECOM
2008
IEEE
14 years 5 months ago
2008
IEEE
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...