Design of finite-word-length FIR filters with least-squares error

Abstract

This paper proposes a new algorithm for designing finite word length linear-phase FIR filters. The new algorithm produces finite-precision least-squares error (LSE) solutions with much reduced search time than the brute-force full search algorithm. It is different from the full search algorithm that tries all possible combinations directly. The new algorithm utilizes geometric properties of a hyper-space to pinpoint potential solutions in a much more restricted way. Accordingly, a much smaller search space is generated. (C) 2000 Elsevier Science B.V. All rights reserved.