Computer Science – Data Structures and Algorithms
Scientific paper
2006-07-17
Computer Science
Data Structures and Algorithms
Submitted to IEEE Transactions on Wireless Communication in March 2006. Part of this work was presented at the 2005 Global Tel
Scientific paper
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers. However, these lattice-reduction-aided detectors are based on the traditional LLL reduction algorithm that was originally introduced for reducing real lattice bases, in spite of the fact that the channel matrices are inherently complex-valued. In this paper, we introduce the complex LLL algorithm for direct application to reduce the basis of a complex lattice which is naturally defined by a complex-valued channel matrix. We prove that complex LLL reduction-aided detection can also achieve full diversity. Our analysis reveals that the new complex LLL algorithm can achieve a reduction in complexity of nearly 50% over the traditional LLL algorithm, and this is confirmed by simulation. It is noteworthy that the complex LLL algorithm aforementioned has nearly the same bit-error-rate performance as the traditional LLL algorithm.
Gan Ying Hung
Ling Clifton C.
Mow Wai Ho
No associations
LandOfFree
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-506330