The rank revealing QR factorization is a useful tool in many signal pr
ocessing applications, since it explicitly yields all the necessary in
formation to solve rank deficient least-squares problems and subset se
lection problems, to compute signal and noise subspaces, etc. We prese
nt a systolic algorithm for computing a rank revealing QR factorizatio
n, and we consider the performance of the algorithm.