File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A simple and optimum geometric decoding algorithm for MIMO systems

TitleA simple and optimum geometric decoding algorithm for MIMO systems
Authors
KeywordsBlock-error rates
Channel matrices
Complete searches
Complexity reductions
Decoding algorithms
Issue Date2009
PublisherIEEE.
Citation
The 4th International Symposium on Wireless and Pervasive Computing (ISWPC 2009), Melbourne, Australia, 11-13 February 2009. In Proceedings of the 4th ISWPC, 2009, p. 1-5 How to Cite?
AbstractGeometric decoding (GD) is a newly proposed decoding technique for multiple-input multiple-output (MIMO) transmission over the fading channels. With a complete search on all symbol vectors in the lattice structure, GD requires about the same decoding complexity to achieve the same optimum block-error rates (BLERs) as that of ML decoding. In this paper, we propose a simple implementation of GD for optimum decoding of MIMO transmission. The GD decoder uses the channel matrix to construct a hyper paraboloid and the zero forcing solution to obtain a hyper ellipsoid projected from the hyper paraboloid. It then restricts the search among the symbol vectors within the hyper ellipsoid. Computer simulation studies on 2x2, 3x3 and 4x 4 MIMO systems transmitting 8P AM and 16QAM show that the proposed GD algorithm can achieve the same BLERs as those of the ML decoders, yet having complexity reduction of more than 90%. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/126091
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorShao, ZYen_HK
dc.contributor.authorCheung, SWen_HK
dc.contributor.authorYuk, TIen_HK
dc.date.accessioned2010-10-31T12:09:18Z-
dc.date.available2010-10-31T12:09:18Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 4th International Symposium on Wireless and Pervasive Computing (ISWPC 2009), Melbourne, Australia, 11-13 February 2009. In Proceedings of the 4th ISWPC, 2009, p. 1-5en_HK
dc.identifier.isbn978-1-4244-2965-3-
dc.identifier.urihttp://hdl.handle.net/10722/126091-
dc.description.abstractGeometric decoding (GD) is a newly proposed decoding technique for multiple-input multiple-output (MIMO) transmission over the fading channels. With a complete search on all symbol vectors in the lattice structure, GD requires about the same decoding complexity to achieve the same optimum block-error rates (BLERs) as that of ML decoding. In this paper, we propose a simple implementation of GD for optimum decoding of MIMO transmission. The GD decoder uses the channel matrix to construct a hyper paraboloid and the zero forcing solution to obtain a hyper ellipsoid projected from the hyper paraboloid. It then restricts the search among the symbol vectors within the hyper ellipsoid. Computer simulation studies on 2x2, 3x3 and 4x 4 MIMO systems transmitting 8P AM and 16QAM show that the proposed GD algorithm can achieve the same BLERs as those of the ML decoders, yet having complexity reduction of more than 90%. © 2009 IEEE.-
dc.languageengen_HK
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the 4th International Symposium on Wireless and Pervasive Computing, ISWPC 2009en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsInternational Symposium on Wireless Pervasive Computing. Copyright © IEEE.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectBlock-error rates-
dc.subjectChannel matrices-
dc.subjectComplete searches-
dc.subjectComplexity reductions-
dc.subjectDecoding algorithms-
dc.titleA simple and optimum geometric decoding algorithm for MIMO systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=978-1-4244-2965-3&volume=&spage=1&epage=5&date=2009&atitle=A+simple+and+optimum+geometric+decoding+algorithm+for+MIMO+systems-
dc.identifier.emailCheung, SW:swcheung@eee.hku.hken_HK
dc.identifier.emailYuk, TI:tiyuk@eee.hku.hken_HK
dc.identifier.authorityCheung, SW=rp00102en_HK
dc.identifier.authorityYuk, TI=rp00210en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ISWPC.2009.4800560en_HK
dc.identifier.scopuseid_2-s2.0-65249098955en_HK
dc.identifier.hkuros180668en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-65249098955&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
dc.description.otherThe 4th International Symposium on Wireless and Pervasive Computing (ISWPC 2009), Melbourne, Australia, 11-13 February 2009. In Proceedings of the 4th ISWPC, 2009, p. 1-5-
dc.identifier.scopusauthoridShao, ZY=26531855600en_HK
dc.identifier.scopusauthoridCheung, SW=7202472784en_HK
dc.identifier.scopusauthoridYuk, TI=6603685705en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats