A new family of unitary space-time codes with a fast parallel sphere decoder algorithm
From MaRDI portal
Publication:3546704
DOI10.1109/TIT.2005.860421zbMATH Open1294.94023arXiv0707.0799OpenAlexW2170806021MaRDI QIDQ3546704
Could not fetch data.
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In this paper we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown fading coefficients. Extensive simulations show that the new codes have significantly better performance than existing codes. We have compared the performance of our codes with differential detection schemes using orthogonal design, Cayley differential codes, fixed-point-free group codes and product of groups and for the same bit error rate, our codes allow smaller signal to noise ratio by as much as 10 dB. The design of the new codes is accomplished in a systematic way through the optimization of a performance index that closely describes the bit error rate as a function of the signal to noise ratio. The new performance index is computationally simple and we have derived analytical expressions for its gradient with respect to constellation parameters. Decoding of the proposed constellations is reduced to a set of one-dimensional closest point problems that we solve using parallel sphere decoder algorithms. This decoding strategy can also improve efficiency of existing codes.
Full work available at URL: https://arxiv.org/abs/0707.0799
Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
This page was built for publication: A new family of unitary space-time codes with a fast parallel sphere decoder algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546704)
