Abstract
This paper links the asynchronous CDMA system signal detection problem to the parallel profiles with linear dependencies (PARALIND), and derives a deterministic blind PARALIND algorithm whose performance is close to nonblind space-time minimum mean square error method. The proposed algorithm has the better performance than space-time matched filter, supports small sample sizes, and even works well in array error condition. Most notably, it does not require knowledge of the direction of arrival and channel fading information.
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.
