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

This paper proposes two low-complexity iterative algorithms to compute thecapacity of a single-user multiple-input multiple-output channel withper-antenna power constraint. The first method results from manipulating theoptimality conditions of the considered problem and applying fixed-pointiteration. In the second approach, we transform the considered problem into aminimax optimization program using the well-known MAC- BC duality, and thensolve it by a novel alternating optimization method. In both proposed iterativemethods, each iteration involves an optimization problem which can beefficiently solved by the water-filling algorithm. The proposed iterativemethods are provably convergent. Complexity analysis and extensive numericalexperiments are carried out to demonstrate the superior performance of theproposed algorithms over an existing approach known as the mode-droppingalgorithm.

Low-complexity Approaches for MIMO Capacity with Per-antenna Power Constraint