English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A low complexity, essentially-ML decoding technique for the Golden code andthe 3 antenna Perfect code was introduced by Sirianunpiboon, Howard andCalderbank. Though no theoretical analysis of the decoder was given, thesimulations showed that this decoding technique has almost maximum-likelihood(ML) performance. Inspired by this technique, in this paper we introduce twonew low complexity decoders for Space-Time Block Codes (STBCs) - the AdaptiveConditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successiveinterference cancellation (ACZF-SIC), which include as a special case thedecoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SICdecoders are capable of achieving full-diversity, and we give sufficientconditions for an STBC to give full-diversity with these decoders. We then showthat the Golden code, the 3 and 4 antenna Perfect codes, the 3 antenna ThreadedAlgebraic Space-Time code and the 4 antenna rate 2 code of Srinath and Rajanare all full-diversity ACZF/ACZF-SIC decodable with complexity strictly lessthan that of their ML decoders. Simulations show that the proposed decodingmethod performs identical to ML decoding for all these five codes. These STBCsalong with the proposed decoding algorithm outperform all known codes in termsof decoding complexity and error performance for 2,3 and 4 transmit antennas.We further provide a lower bound on the complexity of full-diversityACZF/ACZF-SIC decoding. All the five codes listed above achieve this lowerbound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decodingcomplexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decodingimplementation.

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