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

In our recent work, we reported an exhaustive study on the simulated biterror rate (BER) performance of a low-complexity likelihood ascent search (LAS)algorithm for detection in large multiple-input multiple-output (MIMO) systemswith large number of antennas that achieve high spectral efficiencies. Thoughthe algorithm was shown to achieve increasingly closer to nearmaximum-likelihood (ML) performance through simulations, no BER analysis wasreported. Here, we extend our work on LAS and report an asymptotic BER analysisof the LAS algorithm in the large system limit, where $N_t,N_r \to \infty$ with$N_t=N_r$, where $N_t$ and $N_r$ are the number of transmit and receiveantennas. We prove that the error performance of the LAS detector in V-BLASTwith 4-QAM in i.i.d. Rayleigh fading converges to that of the ML detector as$N_t,N_r \to \infty$.

Asymptotic Analysis of the Performance of LAS Algorithm for Large-MIMO Detection