Superresolution algorithms for detecting overlapped paths in DS-CDMA systems with long codes

The problem of closely-spaced paths in DS-CDMA systems is a challenging task at the baseband receiver for applications such as mobile location and RAKE receivers. Previously, we introduced a method based on Teager-Kaiser (1990) operator for resolving paths spaced at less than one chip distance. We compare the performance of TK operator with that of the subspace based MUSIC (multiple signal classification) algorithm. In order to make a fair comparison, an extension of MUSIC algorithm to the systems with long codes is derived and the performance of both algorithms is assessed via simulations.