Hardware-efficient tree expansion for MIMO symbol detection

Abstract

A simple yet effective method is proposed to reduce the hardware complexity of tree expansion in multiple-input multiple-output (MIMO) symbol detection. Tree-expansion equations are transformed in the proposed method so as to maximise common subexpressions that can be shared. The proposed method reduces the number of operators significantly, especially multipliers which are costly, without any degradation of bit error rate.