![]() |
CiteULike | ![]() |
daniel51's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Linear interference cancellation in CDMA based on iterative techniques for linear equation systemsby: P. H. Tan, L. K. Rasmussen
Communications, IEEE Transactions on In Communications, IEEE Transactions on, Vol. 48, No. 12. (2000), pp. 2099-2108.
|
Reviews
[Write a review of this article]
Notes for this articleuses outer block of GS and inner block of jacobi
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIt has previously been shown that well known iterations 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 iteration. 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 iteration. When a true inner iteration is used, this approach allows for a timely derivation of the acceleration parameters required by advanced 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 detectors 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
BibTeX record
RIS record