K-best MIMO detection based on interleaving of distributed sorting

Abstract

A simple yet efficient technique is proposed to improve the performance of distributed sorting based K-best detection. The proposed technique is to interleave partially sorted elements so as to reduce the distribution skew that is the major cause of performance degradation of distributed sorting. Experimental results show that the proposed interleaving almost fully recovers the degradation and makes the performance close to that of the original K-best detection.