Full-rate, full-diversity, finite feedback space-time schemes with minimum feedback and transmission duration

Natarajan, Lakshmi Prasad ; Sundar Rajan, B. (2013) Full-rate, full-diversity, finite feedback space-time schemes with minimum feedback and transmission duration In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), 7-12 July 2013, Istanbul, Turkey.

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/6620759/

Related URL: http://dx.doi.org/10.1109/ISIT.2013.6620759

Abstract

In this paper a MIMO quasi static block fading channel with finite N-ary delay-free, noise-free feedback is considered. The transmitter uses a set of N Space-Time Block Codes (STBCs), one corresponding to each of the N possible feedback values, to encode and transmit information. The feedback function used at the receiver and the N component STBCs used at the transmitter together constitute a Finite Feedback Scheme (FFS). If each of the component codes encodes K independent complex symbols and is of transmission duration T, the rate of the FFS is K/T complex symbols per channel use. Although a number of FFSs are available in the literature that provably achieve full-diversity, there is no known universal criterion to determine whether a given arbitrary FFS achieves full-diversity or not. Further, all known full-diversity FFSs for T <; Nt where Nt is the number of transmit antennas, have rate at the most 1. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, using which the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs-schemes that use minimum amount of feedback N given the transmission duration T, and minimum transmission duration given the amount of feedback to achieve full-diversity-is introduced. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC with T = Nt, and the proposed necessary condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity, viz. every non-zero codeword difference matrix of the STBC must be of rank Nt. Also, a sufficient condition for full-diversity is given for those FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen. Using this sufficient condition, full-rate (rate Nt) full-diversity FT-optimal schemes are constructed for all (Nt, T, N) with NT = Nt. These are the first full-rate full-diversity FFSs reported in the literature for T <; Nt. Simulation results show that the new schemes have the best error performance among all known FFSs.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
ID Code:110007
Deposited On:08 Dec 2017 10:19
Last Modified:08 Dec 2017 10:19

Repository Staff Only: item control page