Fast algorithm and architecture for constrained adaptive side-lobe cancellation

An efficient implementation of auxiliary constraints for a concurrent-block least-squares adaptive side-lobe canceler is described. A QR decomposition of the auxiliary data matrix is computed, and this information is sent to one or more main beam processors, where the constraints are applied using blocking matrices and the individual residuals are computed. Structured blocking matrices are used to derive a fast algorithm and architecture for constrained main beam processing. This approach reduces the operation count of this phase of the processing from O(n/sup 3/) to O(n/sup 2/), where n is the number of auxiliary sensors.<
>