File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive QRD-M detection with variable number of surviving paths for MIMO systems

TitleAdaptive QRD-M detection with variable number of surviving paths for MIMO systems
Authors
KeywordsTree searching
Adaptive QRD-M detection
MIMO
Issue Date2007
PublisherIEEE
Citation
IEEE International Symposium on Communications and Information Technologies (ISCIT '07), Sydney, Australia, 16-19 October 2007 How to Cite?
AbstractThe QR decomposition based M algorithm (QRD-M) is a sub-optimal detection algorithm which can achieve a tradeoff between bit error rate (BER) performance and computational complexity for multiple input multiple output (MIMO) systems. In this paper, an adaptive QRD-M algorithm with variable number of surviving paths is proposed for MIMO systems. The number of surviving paths at each detection stage is adaptively determined according to the instantaneous value and the statistics of channel conditions. The required statistics of the channel conditions is directly derived and given in closed form without a large number of training observations. The proposed algorithm is simple to implement and it is verified by computer simulations that the proposed algorithm has lower computational complexity than the fixed QRD-M algorithms thus can offer a better tradeoff between BER performance and computational complexity.
Persistent Identifierhttp://hdl.handle.net/10722/99259

 

DC FieldValueLanguage
dc.contributor.authorPeng, Wen_HK
dc.contributor.authorMa, Sen_HK
dc.contributor.authorNg, TSen_HK
dc.contributor.authorWang, JZ-
dc.date.accessioned2010-09-25T18:22:20Z-
dc.date.available2010-09-25T18:22:20Z-
dc.date.issued2007en_HK
dc.identifier.citationIEEE International Symposium on Communications and Information Technologies (ISCIT '07), Sydney, Australia, 16-19 October 2007-
dc.identifier.urihttp://hdl.handle.net/10722/99259-
dc.description.abstractThe QR decomposition based M algorithm (QRD-M) is a sub-optimal detection algorithm which can achieve a tradeoff between bit error rate (BER) performance and computational complexity for multiple input multiple output (MIMO) systems. In this paper, an adaptive QRD-M algorithm with variable number of surviving paths is proposed for MIMO systems. The number of surviving paths at each detection stage is adaptively determined according to the instantaneous value and the statistics of channel conditions. The required statistics of the channel conditions is directly derived and given in closed form without a large number of training observations. The proposed algorithm is simple to implement and it is verified by computer simulations that the proposed algorithm has lower computational complexity than the fixed QRD-M algorithms thus can offer a better tradeoff between BER performance and computational complexity.-
dc.languageengen_HK
dc.publisherIEEE-
dc.relation.ispartofProceedings IEEE International Symposium on Communications and Information Technologies (ISCIT 2007)en_HK
dc.subjectTree searching-
dc.subjectAdaptive QRD-M detection-
dc.subjectMIMO-
dc.titleAdaptive QRD-M detection with variable number of surviving paths for MIMO systemsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMa, S: sdma@eee.hku.hken_HK
dc.identifier.emailNg, TS: tsng@eee.hku.hken_HK
dc.identifier.authorityMa, S=rp00153en_HK
dc.identifier.authorityNg, TS=rp00159en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ISCIT.2007.4392053-
dc.identifier.hkuros152289en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats