Applications of transputers to broadband adaptive beamforming

A description is given of a class of exact least-squares algorithms based on a modular structure, known as the multistage lattice predictor and an efficient means of implementing these algorithms in parallel on an array of transputers. These algorithms are known collectively as least-squares lattice (LSL) algorithms, involving both order update and time update recursions. Lattice algorithms are robust, being insensitive to variations in the eigenvalue spread of the correlation matrix of the input data and have a computational cost that increases linearly with the number of adjustable tap weights. The authors derive an efficient systolic array structure for the multi-channel least-squares lattice algorithm and demonstrate how the inherently parallel systolic structure can be mapped onto a transputer array