File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: First look at average-case complexity for planar maximum-likelihood detection

TitleFirst look at average-case complexity for planar maximum-likelihood detection
Authors
Issue Date2005
PublisherIEEE.
Citation
2005 Fifth International Conference On Information, Communications And Signal Processing, 2005, v. 2005, p. 203-207 How to Cite?
AbstractIn this paper, an efficient exact maximum-likelihood (ML) detection scheme is presented for a multiple-input singleoutput (MI SO) system with real signal constellations. The proposed technique has a geometrical interpretation of exploring the points jointly "close" in all coordinate axes around the decoding hyperplane and is therefore dubbed planar detection. The fact that the lattice points which are close in all coordinate axes are much less, leads to dramatic reduction in detection complexity. Making a few approximations, this paper derives the average-case complexity exponent, ec, for planar detection analytically in a closed form. Numerical results show that for an (n, 1) 1 system, although the expected complexity is still exponential, complexity reduction of 2 exponents, i.e., from ec to ec - 2, is realized and such advantage is promised irrespective of the size of the signal constellations and the received signal-to-noise ratio (SNR). © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45557
References

 

DC FieldValueLanguage
dc.contributor.authorWong, KKen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.date.accessioned2007-10-30T06:29:07Z-
dc.date.available2007-10-30T06:29:07Z-
dc.date.issued2005en_HK
dc.identifier.citation2005 Fifth International Conference On Information, Communications And Signal Processing, 2005, v. 2005, p. 203-207en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45557-
dc.description.abstractIn this paper, an efficient exact maximum-likelihood (ML) detection scheme is presented for a multiple-input singleoutput (MI SO) system with real signal constellations. The proposed technique has a geometrical interpretation of exploring the points jointly "close" in all coordinate axes around the decoding hyperplane and is therefore dubbed planar detection. The fact that the lattice points which are close in all coordinate axes are much less, leads to dramatic reduction in detection complexity. Making a few approximations, this paper derives the average-case complexity exponent, ec, for planar detection analytically in a closed form. Numerical results show that for an (n, 1) 1 system, although the expected complexity is still exponential, complexity reduction of 2 exponents, i.e., from ec to ec - 2, is realized and such advantage is promised irrespective of the size of the signal constellations and the received signal-to-noise ratio (SNR). © 2005 IEEE.en_HK
dc.format.extent576277 bytes-
dc.format.extent4295 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartof2005 Fifth International Conference on Information, Communications and Signal Processingen_HK
dc.rights©2005 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.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleFirst look at average-case complexity for planar maximum-likelihood detectionen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-34147190942en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34147190942&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2005en_HK
dc.identifier.spage203en_HK
dc.identifier.epage207en_HK
dc.identifier.scopusauthoridWong, KK=7404759940en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats