Open AccessHardware‐efficient tree expansion for MIMO symbol detection
Author(s) -
Kong B.Y.,
Park I.C.
Publication year - 2013
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2012.1074
Subject(s) - mimo , tree (set theory) , symbol (formal) , computer science , algorithm , simple (philosophy) , bit error rate , tree structure , computational complexity theory , arithmetic , mathematics , decoding methods , telecommunications , binary tree , mathematical analysis , channel (broadcasting) , philosophy , epistemology , programming language
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.