Low complexity generalized geometric mean decomposition and DFE transceiver design

Abstract

The complexity of the generalized geometric mean decomposition (GGMD) depends on the GGMD parameters. This paper consider the low complexity GGMD (LCGGMD) which has the least complexity within the class of GGMD. LCGGMD can be used in designing an optimal decision feedback equalizer (DFE) transceiver for a multi-input-multi-output (MIMO) channel. A novel iterative receiver detection algorithm for the receiver is also proposed. A LCGGMD transceiver always has less or equal design and implementation complexity as compared to a GMD DFE minimum mean square error (MMSE) transceiver. For the applications in which the SVDs of the equivalent MIMO channel matrices can be easily computed, such as cyclic prefix (CP) systems, the proposed LCGGMD transceiver has the most complexity-advantage over the GMD transceiver when the size of data block is highly factorable. In the simulations, LCGGMD transceivers are designed for CP systems and performance comparisons are made with well-known transceivers.

Additional details