By Topic

Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Junil Ahn ; School of Information and Mechatronics, Department of Nanobio Materials and Electronics, WCU, Gwangju Institute of Science and Technology (GIST), 1 Oryong-dong, Buk-gu, Gwangju 500-712, Republic of Korea ; Kiseon Kim

Depth-first tree search with multiple radii (DFTS-MR) algorithm attains significant complexity reduction over DFTS with a single radius (DFTS-SR) for solving integer least-squares (ILS) problems. Herein, we derive the lower bound on the expected complexity of DFTS-MR under i.i.d. complex Gaussian environments. Currently, the upper bound on the expected DFTS-MR complexity is known. Our analytical result shows the computational dependence on the statistics of the channel, the noise, and the transmitted symbols. It also reflects the use of multiple radii, which is one of the main characteristics of DFTS-MR. The resultant lower bound provides an efficient means to better understand the complexity behavior of DFTS-MR, along with the (known) upper bound.

Published in:

IEEE Communications Letters  (Volume:16 ,  Issue: 6 )