On the Reachability of Stable Linear Systems with Quantized Input Alphabet

In this paper, we study reachability of linear systems with a finitely quantized input alphabet. We give motivations for a new notion of reachability for this class of systems, and propose a notion of local asymptotic reachability. We then derive a sufficient condition and a necessary condition for the proposed local asymptotic reachability, and present an algorithmic procedure to verify these conditions.