ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

Natarajan, Lakshmi Prasad and Rajan, Sundar B (2013) An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs. In: IEEE TRANSACTIONS ON SIGNAL PROCESSING, 61 (2). pp. 253-263.

[img] PDF
ieee_tra_sig_pro_61-2_253_2013.pdf - Published Version
Restricted to Registered users only

Download (3MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/TSP.2012.2223697


A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Item Type: Journal Article
Additional Information: Copyright for this article belongs to IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, USA
Keywords: Decoding;diversity;interference cancellation;low complexity;maximum-likelihood;MIMO;space-time codes;sphere-decoding;zero-forcing receiver
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 09 Mar 2013 07:16
Last Modified: 09 Mar 2013 07:16
URI: http://eprints.iisc.ac.in/id/eprint/46004

Actions (login required)

View Item View Item