Abstract
In this paper, we propose a modified Euclidean norm computation for breadth-first signal decoder (BSIDE) that reduces the computational complexity without sacrificing the performance. We exploit the reordered channel representation and rewrite the Euclidean norm computation in a simpler form, which results at significant reduction in number of operations required to decode the transmitted symbols. Also from the simulation results, it is observed that the reduction in complexity is 59 % for 2 × 2 and 75 % for the 4 × 4 multiple-input multiple output systems when compared to BSIDE.
Full Text
Published Version
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 call