Abstract
A strategy of user ordering and time labeling for a decision feedback (DF) detector in asynchronous code-division multiple-access communications is proposed and is proved to be optimal for the ideal DF detector. The proposed algorithm requires O(K/sup 4/) offline operations, where K is the number of users. Although error propagation complicates the analysis of the actual DF detector, computer simulations show that, with the proposed user ordering and time labeling, the performance of an actual DF detector overlays the theoretical bound in most cases.
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.
