Abstract
This paper proposes three blind multiuser detection algorithms based on set theory. They all originate from the set-membership filter (SMF). Our algorithms have some advantages over traditional adaptive algorithms. First, They provide region estimates in addition to point estimates. Second, they exhibit better convergence due to the optimization of the weighting sequence. Third, our algorithms feature a unique selective update criterion that requires parameter updates to be computed for only a small fraction of the data. Simulation shows our algorithms are superior to other blind algorithms in serious near-far effect.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
