Differential Detection Based on Space-Time Block Codes
Wireless Personal Communications: An International Journal
Space-Time Block Coding for Wireless Communications
Space-Time Block Coding for Wireless Communications
Convex Optimization
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
IEEE Transactions on Signal Processing
Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems
IEEE Transactions on Signal Processing - Part I
Closed-form blind MIMO channel estimation for orthogonal space-time block codes
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
On maximum-likelihood detection and decoding for space-time codingsystems
IEEE Transactions on Signal Processing
Blind ML Detection of Orthogonal Space-Time Block Codes: Identifiability and Code Construction
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
A Novel Signaling Scheme for Blind Unique Identification of Alamouti Space-Time Block-Coded Channel
IEEE Transactions on Signal Processing
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Channel identifiability under orthogonal space-time coded modulations without training
IEEE Transactions on Wireless Communications
Efficient Blind Receiver Design for Orthogonal Space-Time Block Codes
IEEE Transactions on Wireless Communications
Semidefinite programming relaxation approach for multiuser detection of QAM signals
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Space-time block codes: a maximum SNR approach
IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
On the Blind Identifiability of Orthogonal Space–Time Block Codes From Second-Order Statistics
IEEE Transactions on Information Theory
A linear programming receiver for blind detection of full rate space-time block codes
IEEE Transactions on Signal Processing
Fractional models for modeling complex linear systems under poor frequency resolution measurements
Digital Signal Processing
Hi-index | 35.69 |
This paper considers the blind maximum-likelihood (ML) detection problem for orthogonal space-time block codes (OSTBCs) in multiple-input multiple-output flat-fading channels. While the blind ML detection problem for general space-time codes is difficult to solve, it has been shown that for OSTBCs with constant modulus constellations, the blind ML detection problem can be formulated as a discrete quadratic program, and then handled by a powerful convex approximation technique known as semidefinite relaxation (SDR). In this paper, we turn our attention to the case of higher order QAM OSTBCs. Due to the nonconstant modulus nature of higher order QAM signals, the blind ML detection problem turns out to be a discrete Rayleigh quotient maximization problem, and as a result the current SDR technique is no longer directly applicable. We propose a linear fractional SDR (LFSDR) approach to this problem. This approach first relaxes the higher order QAM blind ML detection problem into a quasi-convex problem, followed by a simple solution approximation procedure. In general, quasi-convex problems are computationally more complex to solve than convex problems, but we show that an optimum solution of our quasi-convex problem can be efficiently obtained by solving a convex semidefinite program. The approximation accuracy of the proposed approach relative to other possible relaxation approaches is also studied. Simulation results are presented to demonstrate that the proposed LFSDR-based blind ML detector outperforms some existing suboptimal detectors and can yield promising performance even with a small to moderate number of code blocks.