MIMO detector based on trellis structure

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 393
  • Download : 0
The depth-first sphere decoder (SD) and the K-best algorithm have been widely studied as near optimum detectors. Depth-first SD has a non-deterministic computational throughput and K-best requires a sorting unit whose complexity is significant when a large K is used together with high modulation constellations. In this letter, we propose a MIMO detector that employs the trellis structure instead of the conventional tree searching. This detector can keep the computational throughput constant and reduce the complexity because the sorting is not required. From the simulation and complexity analysis, we investigate the advantage and drawback of the proposed detector.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2008-03
Language
English
Article Type
Article
Keywords

VLSI

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E91B, no.3, pp.951 - 954

ISSN
0916-8516
DOI
10.1093/ietcom/e91-b.3.951
URI
http://hdl.handle.net/10203/88566
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0