File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICICS.2005.1689035
- Scopus: eid_2-s2.0-34147190942
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: First look at average-case complexity for planar maximum-likelihood detection
Title | First look at average-case complexity for planar maximum-likelihood detection |
---|---|
Authors | |
Issue Date | 2005 |
Publisher | IEEE. |
Citation | 5th International Conference on Information, Communications and Signal Processing (ICICS 2005), Bangkok, Thailand, 6-9 December 2005. In 2005 Fifth International Conference on Information, Communications and Signal Processing, 2005, p. 203-207 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/45557 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, KK | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.date.accessioned | 2007-10-30T06:29:07Z | - |
dc.date.available | 2007-10-30T06:29:07Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | 5th International Conference on Information, Communications and Signal Processing (ICICS 2005), Bangkok, Thailand, 6-9 December 2005. In 2005 Fifth International Conference on Information, Communications and Signal Processing, 2005, p. 203-207 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45557 | - |
dc.description.abstract | In 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.extent | 576277 bytes | - |
dc.format.extent | 4295 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | 2005 Fifth International Conference on Information, Communications and Signal Processing | en_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. | - |
dc.title | First look at average-case complexity for planar maximum-likelihood detection | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICICS.2005.1689035 | - |
dc.identifier.scopus | eid_2-s2.0-34147190942 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-34147190942&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 203 | en_HK |
dc.identifier.epage | 207 | en_HK |
dc.identifier.scopusauthorid | Wong, KK=7404759940 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |