Probabilistic Spherical Detection and VLSI Implementation for Multiple-Antenna Systems

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 340
  • Download : 0
This paper presents a novel probabilistic spherical detection (P-SD) method which applies the probabilistic-search algorithm to conventional depth-first SD (DF-SD). By confining the tree search into candidates which can be selected in an adaptive manner, a large number of promising candidates can be evaluated before termination. Consequently, the proposed P-SD improves the error performance of DF-SD with early termination, while retaining the hardware efficiency. An efficient VLSI architecture is proposed for implementation of the P-SD algorithm, and the results of the synthesized architecture are presented. The main advantage of P-SD is that it can fully exploit the state-of-the-art architectures of DF-SD, since it can be implemented by simply adding two functional blocks to conventional DF-SD. By analyzing the performance-complexity tradeoffs, it is concluded that our proposed P-SD is advantageous over conventional DF-SD and K-best algorithm, when the maximum-likelihood error performance is desired.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2009-03
Language
English
Article Type
Article; Proceedings Paper
Keywords

DECODING ALGORITHM; MIMO; COMPLEXITY; CHANNEL; CODES

Citation

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, v.56, no.3, pp.685 - 698

ISSN
1549-8328
URI
http://hdl.handle.net/10203/100965
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 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0