Convex programming for detection in structured communication problems

[摘要] The generalized Minimum Mean Squared Error (GMMSE) detector has a bit errorrate performance, which is similar to the MMSE detector. The advantage of theGMMSE detector is that it does not require the knowledge of the noise power.However, the computational complexity of the GMMSE detector is significantlyhigher than the computational complexity of the MMSE detector. In this paper,the complexity of the GMMSE detector is reduced by taking into account thestructure of the system matrix (Toeplitz). Furthermore, byusing circular approximation of the structured system matrix an approximateGMMSE detector is presented, whose computational complexity is only slightlyhigher than MMSE, i.e.~only an iterative gradient descent algorithm based onthe inversion of diagonal matrices is additionally required.

[学科分类] 电子、光学、磁材料