Presentation 2008-02-29
Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
Atsushi OKAWADO, Ryutaroh MATSUMOTO, Tomohiko UYEMATSU,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximum-likelihood (ML) detection of signals over multiple-input-multiple-output (MIMO) channels. After that, we compare the performances of proposed algorithm, QR decomposition M-algorithm (QRD-MLD), and its improvement. When the list size is set to achieve the almost same symbol error rate (SER) as the QRD-MLD, the proposed algorithm has smaller average computational complexity.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Dijkstra's algorithm / MIMO channel / QRD-MLD
Paper # IT2007-70,ISEC2007-167,WBS2007-101
Date of Issue

Conference Information
Committee WBS
Conference Date 2008/2/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Wideband System(WBS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
Sub Title (in English)
Keyword(1) Dijkstra's algorithm
Keyword(2) MIMO channel
Keyword(3) QRD-MLD
1st Author's Name Atsushi OKAWADO
1st Author's Affiliation Department of Communication and Integrated Systems, Tokyo Institute of Technology()
2nd Author's Name Ryutaroh MATSUMOTO
2nd Author's Affiliation Department of Communication and Integrated Systems, Tokyo Institute of Technology
3rd Author's Name Tomohiko UYEMATSU
3rd Author's Affiliation Department of Communication and Integrated Systems, Tokyo Institute of Technology
Date 2008-02-29
Paper # IT2007-70,ISEC2007-167,WBS2007-101
Volume (vol) vol.107
Number (no) 503
Page pp.pp.-
#Pages 6
Date of Issue