By Topic

Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA

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
$31 $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

4 Author(s)
Hasegawa, F. ; Dept. of Electr. & Comput. Eng., Connecticut Univ., Storrs, CT, USA ; Luo, J. ; Pattipati, K. ; Willett, P.

We (2001) previously showed that for solutions of the binary quadratic programming problem there exists an "efficient frontier" in the performance/speed domain among the algorithms which characterizes the relative performance of each algorithm. Here, in addition to the algorithms implemented previously, the Boltzmann machine, genetic algorithm and space alternating generalized EM (SAGE) receiver are implemented and results are given for much larger scale problems. Simulation results show that these and several other of the proposed methods can significantly outperform the decision feedback detector or its group counterpart

Published in:

Systems, Man, and Cybernetics, 2001 IEEE International Conference on  (Volume:4 )

Date of Conference: