Abstract
It has previously been shown that well-known iter- ations for solving a set of linear equations correspond to linear interference cancellation structures. Here, we suggest applying a block-wise iteration that consists of an outer and an inner iter- ation. The outer iteration used is the Gauss-Seidel (GS) method, while for the inner iteration, we study direct matrix inversion, the Jacobi over-relaxation iteration, and the conjugate gradient itera- tion. When a true inner iteration is used, this approach allows for a timely derivation of the acceleration parameters required by ad- vanced iterations. The block iteration is based on a symbol-level implementation which leads to the same detection delay profile for both parallel and serial structures at the expense of differences in the amount of serial processing required. This is discussed in some detail and quantified for comparison. The performance of the de- tectors is studied via computer simulations where it is found that the block approach can provide significantly faster convergence, leading to improved detection delay over the simpler GS iteration. The improvements are obtained at the expense of an increase in the required serial processing speed.

This publication has 27 references indexed in Scilit: