Transformation of linearly constrained broadband processors to unconstrained partitioned form

The paper presents a technique for transforming linearly constrained broadband time-domain processors to an unconstrained partitioned form via an orthogonal decomposition of the constraint matrix. It is shown that the partitioned structure drops out naturally from solving the mathematics of the transformed unconstrained, optimisation problem. This approach enables the relationship between the Frost-type processor and the unconstrained partitioned processor to be established in a direct way.