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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Multiple-input multiple-output (MIMO) technology applied with orthogonalfrequency division multiplexing (OFDM) is considered as the ultimate solutionto increase channel capacity without any additional spectral resources. At thereceiver side, the challenge resides in designing low complexity detectionalgorithms capable of separating independent streams sent simultaneously fromdifferent antennas. In this paper, we introduce an upper-lowerbounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm wesolve the problem of high extreme complexity of the conventional spheredecoding by fixing the upper bound complexity to that of the conventionalQRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessaryhypotheses to achieve very low computational requirements. Analyses andsimulation results show that the proposed algorithm achieves the performance ofconventional QRD-M with only 26% of the required computations.

Upper-lower bounded-complexity QRD-M for spatial multiplexing MIMO-OFDM systems