I. Introduction
For Space Division Multiplexing, where information is transmitted and received over several transmit and receive antennas in parallel, the optimal receiver is the maximum likelihood detector (MLD) [1]. Basically MLD tries to maximize the conditional probability , where is the received signal and is a possible transmitted signal. One way to implement this receiver is to exhaustively for all possible transmitted symbol vectors. This requires Q Euclidean distances calculation, where Q is the constellation size of each element in the transmitted vector, and M ‘ is the number of transmit antennas. The complexity is huge and increases exponentially with the number of transmit antennas. Recently, the lattice decoding algorithms [2]–[5] have been proposed to reduce its computation complexity significantly. The lattice decoder can be interpreted as a depth-first tree search approach with pruning. It has the disadvantage that the computation requirement varies with the input signal and hence the decoding throughput is also varying, which is not desirable for real time signal detection.