Gradient Adaptive Lattice Algorithm Suitable for Fixed Point Implementation

The lattice-based implementations of the gradient adaptive algorithms offer improved convergence rate capabilities, especially for high correlated inputs. In the classical gradient adaptive lattice (GAL) algorithm a division operation per stage is used, which significant grows the computational complexity in a fixed-point implementation context. In this paper, an approximate version of the GAL algorithm is proposed. This algorithm replaces the division operation by three multiplication operations and one addition operation. The simulation results prove that this algorithm keeps the rate of convergence and the good numerical properties of the classical GAL algorithm.