Recursive least squares problem implementation on a generalized interconnection of DSP processors

Authors:
Sati Banerjee;Paul M. Chau
Affiliations:
Dept. of ECE, University of California, San Diego, La Jolla, CA;Dept. of ECE, University of California, San Diego, La Jolla, CA
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: digital speech processing - Volume III
Year:
1993

Citing 3
Cited 0

A unified systolic array for adaptive beamforming

Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Adaptive filter theory (2nd ed.)

Adaptive filter theory (2nd ed.)
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the problem of implementing a Recursive Least Squares problem on a multiprocessor network comprising of general purpose DSP processors has been addressed. As an example of an application scenario, the adaptive beamforming problem has been chosen where an RLS formulation has been adopted for obtaining the optimum weights. Although optimal array processors have been proposed for this problem, implementation on a generalized network affords a flexible as well aa a modular and reconfigurable solution, suitable for a highly dynamic environment with changing applications and problem sizes. The parallelization issues have been explored and a scheme for an efficient implementation has been described. An implementation of the MVDR problem on a network of DSP32C processors has been evaluated.