Fixed complexity LLL algorithm
IEEE Transactions on Signal Processing
Low-complexity systolic V-BLAST architecture
IEEE Transactions on Wireless Communications
A fast recursive algorithm for optimum sequential signal detection in a BLAST system
IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Algorithm and implementation of the K-best sphere decoding for MIMO detection
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
It has been shown in several works that some preprocessing techniques can improve data detection performance when they are applied to the channel matrix of MIMO wireless systems. In particular, these techniques can be used previously to K-Best tree search algorithms, and they are known to achieve successful results. Throughout this work, the performance and complexity of two preprocessing techniques (VBLAST ZF-DFE ordering and LLL lattice-reduction) are evaluated and compared. The LLL algorithm and a recently proposed fixed-complexity version of it are tested. In addition, a low-complexity implementation of the VBLAST ZF-DFE method is proposed. Results show that the LLL preprocessing is less costly than the VBLAST ZF-DFE ordering in average. Also, the BER curves of the K-Best detector in a 4x4 MIMO system reveal that the LLL method can only present better detection performance than the VBLAST ZF-DFE ordering for high SNRs and low values of K.