Download now Free registration required
The complexity of Sphere Decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower complexity. In this paper, the authors propose a proper tree search traversal technique that reduces the overall SD computational complexity without sacrificing the performance. They exploit the similarity among the complex symbols in a square QAM lattice representation and rewrite the squared norm ML metric in a simpler form allowing significant reduction of the number of operations required to decode the transmitted symbols.
- Format: PDF
- Size: 184.8 KB