Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Abstract— We analyze fading relay networks, where a singleantenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop...
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
Chao Wang, Zijiang Yang, Aarti Gupta, Franjo Ivanc...
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...