抄録
The Breadth First Signal Decoder (BSIDE) algorithm can be expressed as tree searching class of algorithm that does not require an estimate of SNR and provides an optimal BER performance. However, the average number of nodes to be searched by BSIDE in a tree is more that leads to higher implementation complexity. In this letter, a sign prediction technique exploited over the similarity property of QAM that reduces the computational complexity of the algorithm without any degradation in the performance is proposed. Simulation results show that the approach with sign prediction reduces 50% reduction in computational complexity compared to BSIDE for 2 × 2 and 66% for 4 × 4 MIMO systems.
