Time complexity and input design in worst-case identification using binary sensors

This paper addresses system identification using binary-valued sensors in a worst-case setting. The first contribution is an upper bound on time complexity for identification of FIR models, which improves over existing bounds in the literature. The second result concerns the solution of the optimal input design problem for identification of a scalar gain. It is shown that the two contributions can be combined to construct suboptimal input signals for identification of FIR models of arbitrary order.