Polynomial complexity optimal multiuser detection for wider class of problems

Abstract

Optimal multiuser detection for code division multiple access has complexity which grows exponentially with the number of users. Recently proposed algorithms enable polynomial complexity optimal detection for certain special spreading sequences. It is shown that these algorithms are applicable to a wider class of spreading sequences than initially proposed.