Abstract

For massive multiple-input multiple-output (MIMO) systems, minimum mean square error (MMSE) detection is near-optimal, but requires high-complexity matrix inversion. To avoid matrix inversion, we formulate MMSE detection as a strictly convex quadratic optimization problem, which can be solved iteratively by the recognized most efficient Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method. According to special properties of massive MIMO systems, we propose a novel limited-memory BFGS (L-BFGS) scheme for MMSE detection with one correction search, unit step length, and simplified initialization, which can greatly reduce the storage and computation cost compared to BFGS method. Simulation results finally verify the effectiveness of the proposed scheme.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call