Low-complexity implementation of quasi-OBE algorithm

The quasi-OBE (QOBE) algorithm is a set-membership adaptive filtering algorithm based on the principles of optimal bounding ellipsoid (OBE) processing. This algorithm can provide enhanced convergence and tracking performance as well as reduced average computational complexity in comparison with the more traditional adaptive filtering algorithms. In this reported work, the QOBE algorithm is implemented using the dichotomous coordinate descent iterations. This significantly reduces QOBE´s per-update computational complexity, especially the number of required multiplications, and delivers a trade-off between performance and complexity.