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

Convergence and density evolution of a low complexity, iterative MIMOdetection based on belief propagation (BP) over a ring-type pair-wise graph arepresented in this paper. The detection algorithm to be considered iseffectively a forward-backward recursion and was originally proposed in [13],where the link level performance and the convergence for Gaussian input wereanalyzed. Presented here are the convergence proof for discrete alphabet andthe density evolution framework for binary input to give an asymptoticperformance in terms of average SINR and bit error rate (BER) without channelcoding. The BER curve obtained via density evolution shows a good match withsimulation results, verifying the effectiveness of the density evolutionanalysis and the performance of the detection algorithm.

Convergence and Density Evolution of a Low-Complexity MIMO Detector based on Forward-Backward Recursion over a Ring