Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Using hidden convexity in structured communication problems

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

3 Author(s)
Morsy, T. ; Inf. Process. Lab., Tech. Univ. Dortmund, Dortmund, Germany ; Gotze, J. ; Nassar, H.

Generalized minimum mean squared error (GMMSE) detector has a bit error rate (BER) performance that is almost the same as minimum mean squared error (MMSE) detector and it has the advantage that it does not require the knowledge of the noise power. However, the computational complexity of GMMSE detector is higher than that of MMSE detector. In this paper, the computational complexity of the GMMSE detector is reduced by using the hidden convexity combined with the idea of using the circular approximation of the banded Toeplitz channel matrix. In this case, the solutions are obtained by computing the EVD of the circular matrix using FFT/IFFT such that, the required EVD implies no additional effort.

Published in:

Performance Computing and Communications Conference (IPCCC), 2011 IEEE 30th International

Date of Conference:

17-19 Nov. 2011