File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A fast-decodable code structure for linear dispersion codes

TitleA fast-decodable code structure for linear dispersion codes
Authors
KeywordsComplexity of sphere decoding
Fast-decodable code
Linear dispersion code
MIMO system
Issue Date2009
PublisherIEEE.
Citation
Ieee Transactions On Wireless Communications, 2009, v. 8 n. 9, p. 4417-4420 How to Cite?
AbstractThis paper proposes the design of a new family of fast-decodable, full-rank, flexible-rate linear dispersion codes (LDCs) for MIMO systems with arbitrary numbers of transmit and receive antennas. The codewords of LDCs can be expressed as a linear combination of certain dispersion matrices and, in this new family of LDCs, we propose to have orthogonal rows in as many dispersion matrices as possible. We show that, with the proposed code, the number of levels in the tree search and hence the complexity of the sphere decoder (SD) at the receiver can be substantially reduced. Monte Carlo computer simulation has shown that the LDCs with and without the orthogonal structure have nearly identical bit-error-rate (BER) performances. However, the complexity of the SD used for decoding the proposed family of LDCs is substantially reduced. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/124674
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorDai, XGen_HK
dc.contributor.authorCheung, SWen_HK
dc.contributor.authorYuk, TIen_HK
dc.date.accessioned2010-10-31T10:47:49Z-
dc.date.available2010-10-31T10:47:49Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Wireless Communications, 2009, v. 8 n. 9, p. 4417-4420en_HK
dc.identifier.issn1536-1276en_HK
dc.identifier.urihttp://hdl.handle.net/10722/124674-
dc.description.abstractThis paper proposes the design of a new family of fast-decodable, full-rank, flexible-rate linear dispersion codes (LDCs) for MIMO systems with arbitrary numbers of transmit and receive antennas. The codewords of LDCs can be expressed as a linear combination of certain dispersion matrices and, in this new family of LDCs, we propose to have orthogonal rows in as many dispersion matrices as possible. We show that, with the proposed code, the number of levels in the tree search and hence the complexity of the sphere decoder (SD) at the receiver can be substantially reduced. Monte Carlo computer simulation has shown that the LDCs with and without the orthogonal structure have nearly identical bit-error-rate (BER) performances. However, the complexity of the SD used for decoding the proposed family of LDCs is substantially reduced. © 2009 IEEE.-
dc.languageengen_HK
dc.publisherIEEE.-
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE Transactions on Wireless Communications. 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.subjectComplexity of sphere decodingen_HK
dc.subjectFast-decodable codeen_HK
dc.subjectLinear dispersion codeen_HK
dc.subjectMIMO systemen_HK
dc.titleA fast-decodable code structure for linear dispersion codesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1536-1276&volume=8&issue=9&spage=4417&epage=4420&date=2009&atitle=A+fast-decodable+code+structure+for+linear+dispersion+codes-
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/TWC.2009.080841en_HK
dc.identifier.scopuseid_2-s2.0-70350331615en_HK
dc.identifier.hkuros180290en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70350331615&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume8en_HK
dc.identifier.issue9en_HK
dc.identifier.spage4417en_HK
dc.identifier.epage4420en_HK
dc.identifier.isiWOS:000269621700009-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridDai, XG=23481122600en_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