Hardware-efficient tree expansion for MIMO symbol detection

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 244
  • Download : 37
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.
Publisher
INST ENGINEERING TECHNOLOGY-IET
Issue Date
2013-01
Language
English
Article Type
Article
Citation

ELECTRONICS LETTERS, v.49, no.3, pp.226 - 227

ISSN
0013-5194
DOI
10.1049/el.2012.1074
URI
http://hdl.handle.net/10203/174912
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0