Work

A New Low Computational Complexity Sphere Decoding Algorithm

Year: 2009
Type: preprint
Abstract: The complexity of sphere decoding (SD) has been widely studied in that the algorithm is vital in providing the optimal Maximum Likelihood performance with low complexity. In this paper, we propose a proper tree search technique that reduces overall SD computational complexity without sacrificing performance. We build a check-table to pre-calculate and store some terms, temporally store some mid-stage terms, and take advantage of a new lattice representation of our previous work. This method allows significant reduction for the number of operations required to decode the transmitted symbols. We consider 2x2 and 4x4 systems employing 4-QAM and 64-QAM, and show that this approach achieves large gains for average number of real multiplications and real additions, which range
Language: English
Open Access status: green
OpenAlex ID: W1759032104
Cites: 8
Cited by:
Related to: 10