A fast geometric decoding algorithm for MIMO systems

Authors:
Z. Y. Shao;S. W. Cheung;T. I. Yuk
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Year:
2009

Citing 4
Cited 0

Advanced Engineering Mathematics: Maple Computer Guide

Advanced Engineering Mathematics: Maple Computer Guide
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

Wireless Personal Communications: An International Journal
Introduction to Space-Time Wireless Communications

Introduction to Space-Time Wireless Communications
Capacity limits of MIMO channels

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the practical challenges of Wireless communications over Multiple-input Multiple-output (MIMO) channels is to reduce the complexity of the decoding algorithm without sacrifice in performance degradation. Geometric decoding (GD) is an emerging technique which can offer substantially lower complexity while maintaining about the same error rate as that of Maximum likelihood (ML) decoding. In this paper we propose a fast GD algorithm which uses a hyper ellipsoid to reduce the searching region. Simulation results on different MIMO systems transmitting 64QAM show that the proposed GD algorithm can achieve about the same error-rate performance as an ML decoder, yet having less than 5% of the decoding complexity of an ML decoder.