Hardware‐efficient tree expansion for MIMO symbol detection | Zendy

Kong B.Y. | Zendy; Park I.C. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hardware‐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 , symbol (formal) , tree (set theory) , computer science , electronic engineering , computer hardware , arithmetic , computer engineering , telecommunications , mathematics , engineering , channel (broadcasting) , programming language , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research