Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 X 2 and 4 X 2 MIMO Systems

This paper (Part of the content of this manuscript has been accepted for presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low maximum likelihood (ML) decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna ($2\times 2$) and the 4 transmit antenna, 2 receive antenna ($4\times 2$) MIMO systems. Presently, the best known STBC for the $2\times2$ system is the Golden code and that for the $4\times2$ system is the DjABBA code. Following the approach by Biglieri, Hong and Viterbo, a new STBC is presented in this paper for the $2\times 2$ system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be \emph{information-lossless} and \emph{diversity-multiplexing gain} (DMG) tradeoff optimal. This design procedure is then extended to the $4\times 2$ system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of $M^4$ for square QAM of size $M$. In this paper, a scheme that reduces its ML-decoding complexity to $M^2\sqrt{M}$ is presented.Comment: 28 pages, 5 figures, 3 tables, submitted to IEEE Journal of Selected Topics in Signal Processin

Generalized Silver Codes

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an example of a full-rate, full-diversity STBC for 2 transmit antennas. Its ML-decoding complexity is of the order of $M^{2.5}$ for square $M$-QAM. The Silver code for 2 transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of $M^2$. Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for $n_r \geq n_t$) but have a high ML-decoding complexity of the order of $M^{n_tn_{min}}$ (for $n_r < n_t$, the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for $2^a$ transmit antennas and any $n_r$ with reduced ML-decoding complexity of the order of $M^{n_t(n_{min}-(3/4))-0.5}$, is presented. The codes constructed are also information lossless for $n_r \geq n_t$, like the Perfect codes and allow higher mutual information than the comparable punctured Perfect codes for $n_r < n_t$. These codes are referred to as the {\it generalized Silver codes}, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver-Golden codes for 2 transmit antennas. Simulation results of the symbol error rates for 4 and 8 transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.Comment: Accepted for publication in the IEEE Transactions on Information Theory. This revised version has 30 pages, 7 figures and Section III has been completely revise

A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The $2\times 2$ STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.Comment: Submitted to IEEE Globecom - 2008. 6 pages, 3 figures, 1 tabl

Discrete-time output feedback sliding-mode control design for uncertain systems using linear matrix inequalities

An output feedback-based sliding-mode control design methodology for discrete-time systems is considered in this article. In previous work, it has been shown that by identifying a minimal set of current and past outputs, an augmented system can be obtained which permits the design of a sliding surface based upon output information only, if the invariant zeros of this augmented system are stable. In this work, a procedure for realising discrete-time controllers via a particular set of extended outputs is presented for non-square systems with uncertainties. This method is applicable when unstable invariant zeros are present in the original system. The conditions for existence of a sliding manifold guaranteeing a stable sliding motion are given. A procedure to obtain a Lyapunov matrix, which simultaneously satisfies both a Riccati inequality and a structural constraint, is used to formulate the corresponding control to solve the reachability problem. A numerical method using linear matrix inequalities is suggested to obtain the Lyapunov matrix. Finally, the design approach given in this article is applied to an aircraft problem and the use of the method as a reconfigurable control strategy in the presence of sensor failure is demonstrated

An Improved Approach for Contrast Enhancement of Spinal Cord Images based on Multiscale Retinex Algorithm

This paper presents a new approach for contrast enhancement of spinal cord medical images based on multirate scheme incorporated into multiscale retinex algorithm. The proposed work here uses HSV color space, since HSV color space separates color details from intensity. The enhancement of medical image is achieved by down sampling the original image into five versions, namely, tiny, small, medium, fine, and normal scale. This is due to the fact that the each versions of the image when independently enhanced and reconstructed results in enormous improvement in the visual quality. Further, the contrast stretching and MultiScale Retinex (MSR) techniques are exploited in order to enhance each of the scaled version of the image. Finally, the enhanced image is obtained by combining each of these scales in an efficient way to obtain the composite enhanced image. The efficiency of the proposed algorithm is validated by using a wavelet energy metric in the wavelet domain. Reconstructed image using proposed method highlights the details (edges and tissues), reduces image noise (Gaussian and Speckle) and improves the overall contrast. The proposed algorithm also enhances sharp edges of the tissue surrounding the spinal cord regions which is useful for diagnosis of spinal cord lesions. Elaborated experiments are conducted on several medical images and results presented show that the enhanced medical pictures are of good quality and is found to be better compared with other researcher methods.Comment: 13 pages, 6 figures, International Journal of Imaging and Robotics. arXiv admin note: text overlap with arXiv:1406.571

Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs

It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the unitary matrix representations of Clifford Algebras when the number of transmit antennas $n$ is a power of 2. The rate of the square CODs for $n = 2^a$ has been shown to be $\frac{a+1}{2^a}$ complex symbols per channel use. However, SSD codes having unitary-weight matrices need not be CODs, an example being the Minimum-Decoding-Complexity STBCs from Quasi-Orthogonal Designs. In this paper, an achievable upper bound on the rate of any unitary-weight SSD code is derived to be $\frac{a}{2^{a-1}}$ complex symbols per channel use for $2^a$ antennas, and this upper bound is larger than that of the CODs. By way of code construction, the interrelationship between the weight matrices of unitary-weight SSD codes is studied. Also, the coding gain of all unitary-weight SSD codes is proved to be the same for QAM constellations and conditions that are necessary for unitary-weight SSD codes to achieve full transmit diversity and optimum coding gain are presented.Comment: accepted for publication in the IEEE Transactions on Information Theory, 9 pages, 1 figure, 1 Tabl