Realization of Broadband Constrained Partitioned Processor Weights by Solving Lower Dimension Unconstrained Optimization Problem

A constrained partitioned processor is used to implement a broadband time domain antenna array system using a fixed main beam steered in the direction of the desired signal and a set of auxiliary beams to estimate the unwanted noise in the main beam. Weight forming the auxiliary beams are constrained to block the desired signal from the output of the section consisting these beams. This requires solving a constrained beamforming problem of LN dimension with an array of L elements and a tapped delay line filter of length N. This paper presents a technique to estimate LN dimensional weights of the auxiliary beamformer by solving (L - 1) dimensional unconstrained problem and thus produces a computationally efficient method.