Lattice Reduction aided Selective Spanning with Fast Enumeration for soft-output MIMO detection (original) (raw)
Related papers
An Improved Soft Decision Based MIMO Detection Using Lattice Reduction
This paper presents a performance analysis of soft decision based Lattice Reduction (LR) aided Schnorr-Euchner (SE) multiple-input-multiple-output (MIMO) detection algorithm with that of a hard one. We develop an advanced soft decoding scheme, for 4×4 MIMO with different modulation schemes and it provides 1.3 to 1.5 dB improvement compared to the LR-aided hard decision based detection method. The optimum parameters for K and saturation limit are further derived using extensive simulation. In the conventional K-best algorithm limiting the LLR values is not beneficiary in reducing the optimum size of candidate list, whereas applying the saturation limit on the LLR values in LR-aided algorithm will result in more than 8x reduction in list size as well as in the complexity of detector and LLR calculation unit.
2010
Lattice reduction-aided linear detectors for MIMO systems are a promising receiver structure for low-complexity implementations. In this paper we present a lattice reductionaided MIMO data detection architecture based on Seysen's algorithm, where the algorithm is carried out exclusively on the Gram matrix of the channel and its inverse. Furthermore, we describe and evaluate several modification of Seysen's algorithm tailored to reduce the total complexity with respect to hardware implementation. By means of complexity-performance trade-offs we demonstrate the potential benefit of the various algorithmic modifications. First, novel schemes to identify the update steps in each iteration of Seysen's algorithm are presented. Second, we show that further complexity reduction of Seysen's algorithm can be obtained by severely constraining the update coefficients. Eventually, methods are devised that terminate Seysen's algorithm prematurely and thus result in a reduction of the average complexity.
A Diagonal Lattice Reduction Algorithm for MIMO Detection
IEEE Signal Processing Letters, 2000
Recently, an efficient lattice reduction method, called the effective LLL (ELLL) algorithm, was presented for the detection of multiinput multioutput (MIMO) systems. In this letter, a novel lattice reduction criterion, called diagonal reduction, is proposed. The diagonal reduction is weaker than the ELLL reduction, however, like the ELLL reduction, it has identical performance with the LLL reduction when applied for the sphere decoding and successive interference cancelation (SIC) decoding. It improves the efficiency of the ELLL algorithm by significantly reducing the size-reduction operations. Furthermore, we present a greedy column traverse strategy, which reduces the column swap operations in addition to the size-reduction operations.
A Hybrid Method for Lattice-Reduction-Aided MIMO Detection
Proceedings of the 2nd World Congress on Electrical Engineering and Computer Systems and Science, 2016
Lattice reduction has been successfully applied to data detection in multiple-input multiple-output (MIMO) systems. In this paper, we introduce a polynomial time algorithm for lattice-reduction-aided (LR-aided) MIMO detection. The hybrid method we present integrates the length-based size reduction technique into an angle-measured method. To assess the performance of the algorithm, we compare it with the LLL algorithm, a widely used algorithm in MIMO and wireless communications. Our experimental results show that despite that the two algorithms have the same complexity, the hybrid method is empirically more efficient than the LLL algorithm, and the communication channels improved by our hybrid method have smaller bit error rate (BER) than those improved by the LLL algorithm in data detection.
On Reduced Complexity Soft-Output MIMO ML detection
Computing Research Repository, 2006
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with the spectral efficiency. The current state of the art in MIMO detection is l ist decoding and lattice decoding. This paper proposes a new class of lattice detectors that combines some of the principles of both list and
A customized lattice reduction multiprocessor for MIMO detection
2015 IEEE International Symposium on Circuits and Systems (ISCAS), 2015
Lattice reduction (LR) is a preprocessing technique for multiple-input multiple-output (MIMO) symbol detection to achieve better bit error-rate (BER) performance. In this paper, we propose a customized homogeneous multiprocessor for LR. The processor cores are based on transport triggered architecture (TTA). We propose some modification of the popular LR algorithm, Lenstra-Lenstra-Lovász (LLL) for high throughput. The TTA cores are programmed with high level language. Each TTA core consists of several special function units to accelerate the program code. The multiprocessor takes 187 cycles to reduce a single matrix for LR. The architecture is synthesized on 90 nm technology and takes 405 kgates at 210 MHz.
On Decreasing the Complexity of Lattice-Reduction-Aided K-Best MIMO Detectors
2009
The application of Lattice Reduction techniques over the MIMO channel matrix is known to improve the performance of MIMO detectors. Several authors have proposed Lattice-Reduction-Aided K-Best detectors for improving the performance of conventional K-Best algorithms. In this paper, efficient ways of decreasing the computational complexity of previously proposed schemes are presented. The knowledge about how the Lattice Reduction stage affects the transmitted symbols is exploited in order to significantly decrease the complexity without performance loss.
Lattice-Reduction-Aided Conditional Detection for MIMO Systems
IEEE Transactions on Communications, 2014
We introduce a low-complexity detector with nearoptimal performance for transmission over multi-antenna systems. By using lattice basis reduction for generating almost orthogonal channel submatrices, we enhance the conditional optimization technique to implement a fast yet efficient detector. The lattice-reduction-aided (LRA) conditional method is presented as a general detection technique over fading channels to yield significant saving in computational complexity while achieving close to Maximum Likelihood (ML) error performance. By employing the orthogonality defect factor as a universal measure to select a near-orthogonal channel submatrix for conditional detection, we implement efficient detectors for MIMO systems. In particular, an almost optimal decoder with linear complexity for the Golden code is presented over quasi-static channels.
A low complexity ZF-based lattice reduction detection using curtailment parameter in MIMO systems
2016
As the large-scale multiple-input multiple-output (MIMO) systems have been advanced in wireless communication, the low complexity and high performance receiver technique have been required. Recently, lattice reduction technique have attracted attention in MIMO detection. Especially, lattice reduction aided linear detection like zero-forcing (ZF) can largely improve the performance with low complexity. Among all the lattice reduction algorithms, the Lenstra-Lenstra-Lovasz (LLL) algorithm is well-known and widely used algorithm. LLL algorithm reduces the basis of channel matrix by using two conditions and it adopts a parameter in order to get nearly orthogonal basis. Although the parameter is defined range, a constant value is commonly used. However it can't be said that the constant value is the best value for all MIMO system. In this paper, we propose an appropriate parameter to reduce computational complexity in LLL algorithm for ZF detection and we also propose an architecture to adapt our proposed parameter in MIMO detection. The proposed parameter is showed simply and corresponds to the number of antennas. Simulation results show that the proposed parameter provides LLL lattice reduction aided ZF detection achieving the same performance as the widely used constant value with lower complexity and also correspond to every MIMO system including large-scale MIMO system.