Hardware-efficient tree expansion for MIMO symbol detection
نویسنده
چکیده
A simple yet effective method is proposed to reduce the hardware complexity of tree expansion in multiple-input multiple-output (MIMO) symbol detection. Tree-expansion equations are transformed in the proposed method so as to maximise common subexpressions that can be shared. The proposed method reduces the number of operators significantly, especially multipliers which are costly, without any degradation of bit error rate.
منابع مشابه
Efficient V-BLAST Detection Using Modified Fano Algorithm
We propose a sub-optimal but computationally efficient Modified Fano Detection algorithm (MFD) for V-BLAST systems. This algorithm utilizes the QR decomposition of the channel matrix and the sequential detection scheme based on tree searching to find the optimal symbol sequence. For more reliable signal detection, the decoder is designed to move backward for the specified value at the end of th...
متن کاملTurbo detection for MIMO systems: bit labeling and pre-coding
Bit-interleaved coded modulation with iterative detection for MIMO systems demands an efficient APP detector that delivers soft information about the coded bits. The list-sequential detector is a reduced-complexity approximation to an exhaustive APP detector. It uses a tree search employing the stack algorithm to find dominant terms of the log-likelihood ratio. The commonly used symbol-by-symbo...
متن کاملEfficient Implementation of MIMO Decoders
Multiple-Input Multiple-Output (MIMO) technology has emerged as a promising technology for achieving the high data rates of next generation wireless communication systems. MIMO systems improve either the bit-error rate (BER) performance by using spatial diversity or the date rate via spatial multiplexing. However, Maximum-likelihood (ML) detection for high order MIMO systems faces a major chall...
متن کاملA Computationally Efficient Fano-Based Sequential Detection Algorithm for V-BLAST Systems
We present a computationally efficient sequential detection scheme using a modified Fano algorithm (MFA) for V-BLAST systems. The proposed algorithm consists of the following three steps: initialization, tree searching, and optimal selection. In the first step, the proposed detection scheme chooses several candidate symbols at the tree level of one. Based on these symbols, the MFA then finds th...
متن کاملReduced-Complexity Stack-Based Iterative Detection for V-BLAST Systems
In this paper, a computationally efficient stack-based iterative detection algorithm is proposed for V-BLAST systems. To minimize the receiver’s efforts as much as possible, the proposed scheme employs iterative tree search for complexity reduction and storage saving. After an M-ary tree structure by QR decomposition of channel matrix is constructed, the full tree depth is divided into the firs...
متن کامل