Small-Area and Low-Energy K-Best MIMO Detector Using Relaxed Tree Expansion and Early Forwarding

Cited 24 time in webofscience Cited 0 time in scopus
  • Hit : 254
  • Download : 0
This paper proposes a new K-best detection method that is efficient in area and energy consumption. To reduce the complexity required in tree expansion and sorting, some children of a candidate are not expanded if they are estimated as inferior ones, and they are not considered in the sorting. In addition, we propose an efficient pipeline scheduling called early forwarding to reduce the overall processing latency and the number of pipeline registers. Employing the relaxed expansion and the early forwarding makes it possible to reduce chip area and power consumption as well as latency. Targeting 4 x 4 16 quadrature amplitude modulation systems, a multiple-input-multiple-output detector integrating four K-best detection units is implemented to validate the proposed method. The four units are operating in an interleaved manner to achieve high throughput. In a 0.18-mu m CMOS technology, the entire detector occupies 1.9 mm(2) and shows a throughput of 584 Mbits/s. The energy consumed in the proposed detector is 443 pJ per bit at 1.8 V.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2010-10
Language
English
Article Type
Article
Keywords

SPHERE-DECODING ALGORITHM; IMPLEMENTATION; SYSTEMS; CHANNEL; DESIGN

Citation

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, v.57, no.10, pp.2753 - 2761

ISSN
1549-8328
DOI
10.1109/TCSI.2010.2046249
URI
http://hdl.handle.net/10203/94909
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 24 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0