Improved clustered look-ahead pipelining algorithm with minimum order augmentation

The author compares the overall performance of clustered look-ahead (CLA) filters with minimum order augmentation and scattered look-ahead (SLA) filters. To optimize the domain searching procedure and to improve the numerical performance, an improved CLA algorithm with minimum order augmentation, which is especially beneficial for high-Q high-speed digital filters, is proposed. This algorithm is optimized in the aspect of minimizing both the augmented pipelining order and undesirable quantization effects simultaneously. The proposed CLA structure with minimum order augmentation turns out to be very suitable for the applications that require high-speed and numerical stability