Author:
Jothikumar Ramya,Rangaswamy Nakkeeran
Abstract
AbstractThe breadth first signal decoder (BSIDE) is well known for its optimal maximum likelihood (ML) performance with lesser complexity. In this paper, we analyze a multiple-input multiple-output (MIMO) detection scheme that combines; column norm based ordering minimum mean square error (MMSE) and BSIDE detection methods. The investigation is carried out with a breadth first tree traversal technique, where the computational complexity encountered at the lower layers of the tree is high. This can be eliminated by carrying detection in the lower half of the tree structure using MMSE and upper half using BSIDE, after rearranging the column of the channel using norm calculation. The simulation results show that this approach achieves 22% of complexity reduction for 2×2 and 50% for 4×4 MIMO systems without any degradation in the performance.
Reference12 articles.
1. Practical aspects of preprocessing techniques for Best tree search MIMO detectors of Computers and;Roger;Journal Electrical Engineering,2011
2. Reduced complexity soft output MIMO sphere detectors - part optimizations on Processing vol no pp;Mansour;IEEE Transactions Signal,2014
3. An architecture for realizing very high data rates over the richscattering wireless channel Signals Systems Pisa Italy pp;Wolniansky;Proc Int Electronics,1998
4. Best - First Hard Decision Tree Searching MIMO Decoder for a System Transactions on Very Large Scale Integration systems vol no pp;Shen;Soft IEEE VLSI,2012
5. Two - Stage list sphere decoding for Under - Determined Multi - Input Multi - Output systems on vol no pp;Qian;IEEE Transactions Wireless Communications,2013