A Low-Complexity Path Metric for Tree-Based Multiple-Antenna Detectors

Traditional multiple-antenna detectors - which search a tree or a lattice structure - typically apply a metric that requires a preprocessing. Contrary to that, we present a straightforward solution for the metric that avoids those additional computations prior to the search. This new metric approach can even be used for the detection in under-determined systems with fewer receive than transmit antennas. Exemplarily, results are presented for turbo detection with the list-sequential (LISS) detector.