An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs
From MaRDI portal
Publication:4578344
DOI10.1109/TSP.2012.2223697zbMATH Open1393.94954arXiv1205.0329OpenAlexW1989346830MaRDI QIDQ4578344
Author name not available (Why is that?)
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: A low complexity, essentially-ML decoding technique for the Golden code and the 3 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 sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the 3 and 4 antenna Perfect codes, the 3 antenna Threaded Algebraic Space-Time code and the 4 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 outperform all known codes in terms of decoding complexity and error performance for 2,3 and 4 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.
Full work available at URL: https://arxiv.org/abs/1205.0329
Recommendations
- Adaptive Joint Decoding and Equalization for Space-Time Block-Coded Amplify-and-Forward Relaying Systems 👍 👎
- A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder 👍 👎
- Adaptive Multiset Stochastic Decoding of Non-Binary LDPC Codes 👍 👎
- Low Complexity Adaptive Design for Full-Diversity Full-Rate Space-Time Codes 👍 👎
- Dynamic Nulling-and-Canceling for Efficient Near-ML Decoding of MIMO Systems 👍 👎
- Joint Channel-Estimation/Decoding With Frequency-Selective Channels and Few-Bit ADCs 👍 👎
- An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes 👍 👎
- Forced-convergence decoding for LDPC-coded modulation 👍 👎
- Training-Symbol Embedded, High-Rate, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks 👍 👎
This page was built for publication: An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578344)
