File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A fast geometric decoding algorithm for MIMO systems

TitleA fast geometric decoding algorithm for MIMO systems
Authors
Shao, ZYCheung, SWYuk, TI
KeywordsGeometric decoding
Low complexity
MIMO
Issue Date2009
PublisherIEEE. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1001111
Citation
The 11th International Conference on Advanced Communication Technology (ICACT 2009), Phoenix Park, Korea, 15-18 February 2009. Proceedings of the ICACT, 2009, v. 3, p. 2108-2111 How to Cite?
AbstractOne 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.
Persistent Identifierhttp://hdl.handle.net/10722/126063
ISBN
978-89-5519-139-4
ISSN
1738-9445
2020 SCImago Journal Rankings: 0.239
ISI Accession Number ID
WOS:000268233601122
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorShao, ZYen_HK
dc.contributor.authorCheung, SWen_HK
dc.contributor.authorYuk, TIen_HK
dc.date.accessioned2010-10-31T12:07:48Z-
dc.date.available2010-10-31T12:07:48Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 11th International Conference on Advanced Communication Technology (ICACT 2009), Phoenix Park, Korea, 15-18 February 2009. Proceedings of the ICACT, 2009, v. 3, p. 2108-2111en_HK
dc.identifier.isbn978-89-5519-139-4-
dc.identifier.issn1738-9445en_HK
dc.identifier.urihttp://hdl.handle.net/10722/126063-
dc.description.abstractOne 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.-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1001111-
dc.relation.ispartofProceedings of the 11th International Conference on Advanced Communication Technologyen_HK
dc.rightsInternational Conference on Advanced Communication Technology. 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.subjectGeometric decodingen_HK
dc.subjectLow complexityen_HK
dc.subjectMIMOen_HK
dc.titleA fast geometric decoding algorithm for MIMO systemsen_HK
dc.typeConference_Paperen_HK
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.scopuseid_2-s2.0-67649891331en_HK
dc.identifier.hkuros180672en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67649891331&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3en_HK
dc.identifier.spage2108en_HK
dc.identifier.epage2111en_HK
dc.identifier.isiWOS:000268233601122-
dc.identifier.scopusauthoridShao, ZY=26531855600en_HK
dc.identifier.scopusauthoridCheung, SW=7202472784en_HK
dc.identifier.scopusauthoridYuk, TI=6603685705en_HK
dc.identifier.issnl1738-9445-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats