Iterative implementations of linear receivers for spatial diversity channels

We investigate iterative implementations of linear receivers for spatial diversity channels This work has been motivated by previous results concerning iterative implementations of linear multiuser receivers, under the assumption of long random sequences. We explore implementation issues for such iterative methods for finite system dimensions. We consider the Chebyshev iteration using estimates of the extreme eigenvalues based on the Gersgorin circle theorem. This method achieves the same bit error rate performance as direct implementation yet requiring very few iterations. This reduces the computational cost of the receiver