A Recursive Construction for Low-Complexity Non-coherent Constellations

Simple item page
dc.citation.bibtexNamearticleen_US
dc.citation.journalTitleIEEE Journal in Selected Areas in Communicationen_US
dc.contributor.authorBorran, Mohammad Jaberen_US
dc.contributor.authorSabharwal, Ashutoshen_US
dc.contributor.authorAazhang, Behnaamen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:37:57Zen_US
dc.date.available2007-10-31T00:37:57Zen_US
dc.date.issued2004-04-01en_US
dc.date.modified2004-05-14en_US
dc.date.submitted2004-05-14en_US
dc.descriptionJournal Paperen_US
dc.description.abstractIt is known that at high signal to noise ratio (SNR), or for large coherence interval (T), a constellations of unitary matrices can achieve the capacity of the non-coherent multiple-antenna system in block Rayleigh flat-fading channel. For a single transmit antenna system, a unitary constellation is simply a collection of T-dimensional unit vectors. Nevertheless, except for a few special cases, the optimal constellations are obtained only through exhaustive or random search, and their decoding complexity is exponential in the rate of the constellation and the length of the coherence interval, T. In this work, we propose a recursive construction method for real-valued single transmit antenna non-coherent constellations, in which a T-dimensional unitary constellation is constructed by using a number of (T-1)-dimensional unitary or spherical constellations as its equi-latitude subsets. Comparison of the minimum distances achieved by the proposed constructions with the best known packings in G(T, 1) [1] shows that, for practical values of T, the recursive constellations are close to optimal. We also propose a simple low-complexity decoding algorithm for the single-antenna recursive constellations. The complexity of the proposed decoder is linear in the total number of the two-dimensional constituent subsets, which is usually much smaller than the number of the constellation points. Nevertheless, the performance of the suboptimal decoder is similar to the optimal decoder. A comparison of the error rate performance of the recursive constellations with the complex-valued systematic designs of [2] shows that the proposed real-valued constellations have similar performance to the complex-valued systematic designs. The recursive designs also show a significant gain over the low-complexity PSK constellations of [3].en_US
dc.identifier.citationM. J. Borran, A. Sabharwal and B. Aazhang, "A Recursive Construction for Low-Complexity Non-coherent Constellations," <i>IEEE Journal in Selected Areas in Communication,</i> 2004.en_US
dc.identifier.urihttps://hdl.handle.net/1911/19750en_US
dc.language.isoengen_US
dc.subjectRecursive unitary constellationsen_US
dc.subjectnon-coherent detectionen_US
dc.subjectfading channelsen_US
dc.subjectchannel codingen_US
dc.subjectwireless communicationsen_US
dc.subject.keywordRecursive unitary constellationsen_US
dc.subject.keywordnon-coherent detectionen_US
dc.subject.keywordfading channelsen_US
dc.subject.keywordchannel codingen_US
dc.subject.keywordwireless communicationsen_US
dc.titleA Recursive Construction for Low-Complexity Non-coherent Constellationsen_US
dc.typeJournal articleen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Bor2004Non1ARecursive.PDF
Size:
173.63 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications