By the same authors

Complex sphere decoding with a modified tree pruning and successive interference cancellation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

Title of host publicationProceedings of the International Symposium on Wireless Communication Systems
DatePublished - 24 Dec 2012
Pages226-230
Number of pages5
Original languageEnglish

Abstract

A novel complex sphere decoder is proposed in this paper, which achieves a lower complexity than existing techniques with the aid of successive interference cancellation (SIC), statistical pruning strategy (SPS) and a modified probabilistic tree pruning (MPTP) in the search strategy. In the proposed method, enumeration schemes can be avoided once the best partial path metrics (PPMs) fail to satisfy the constraint obtained by the MPTP for a given layer. In addition, the SIC provides a simple method to obtain the possible best candidate for each layer. This strategy effectively eliminates the extra branches without enumeration, if no candidates are available for each layer. Simulations illustrate that the proposed algorithm can reach near-maximum likelihood (ML) performance with a reduction in computational complexity.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations