Reduced-complexity stack-based iterative detection for V-BLAST systems

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 294
  • Download : 0
In this paper, a computationally efficient stack-based iterative detection algorithm is proposed for V-BLAST systems. To minimize the receiver's efforts as much as possible, the proposed scheme employs iterative tree search for complexity reduction and storage saving. After an M-ary tree structure by QR decomposition of channel matrix is constructed, the full tree depth is divided into the first depth and the remaining ones. At tree depth of one, the proposed algorithm finds M candidate symbols. Based on these symbols, it iteratively searches the remaining symbols at second-to-last depth, until finding an optimal symbol sequence. Simulation results demonstrate that the proposed algorithm yields the performance close to that of sphere detection (SD) with significant saving in complexity and storage.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
2007-10
Language
English
Article Type
Article
Keywords

DECODER; SEARCH

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E90B, no.10, pp.2897 - 2902

ISSN
0916-8516
URI
http://hdl.handle.net/10203/88982
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 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0