Abstract
In this paper, a computationally efficient iterative detection algorithm (IDA) for D-STTD systems is presented. To find an optimal sequence by iterative searching, the proposed scheme consists of two stages. Firstly, the IDA establishes the candidate sequences. Then, it iteratively finds an optimal sequence by examining the candidate sequences until the early termination condition is satisfied. The adaptation of the number of candidate sequences makes the proposed IDA more efficient in computational complexity. The proposed detector is shown to achieve the near-ML performance with significantly reduced complexity.
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.
