Precoder Optimization via Correlation Matrix Transformation

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

The complexity of computing precoders in multi-antenna wireless communication systems, particularly with large antenna arrays, makes conventional precoding optimization infeasible due to high computational complexity.

Innovation Solution

A low-complexity alternative is proposed by using computationally light approximations for mutual information and MMSE matrix computations, which are integrated into the existing iterative precoder-optimization algorithm to reduce computational burden while maintaining near-optimal performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional precoding optimization is used in multi-antenna wireless communication systems, then precoder performance is optimized, but computational complexity becomes infeasible for large antenna arrays

Engineering Contradiction:

Improveprecoder optimization performanceVSAvoidcomputational complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent transforms the original non-convex precoder optimization problem into a convex semidefinite programming (SDP) problem by changing the parameter representation from direct precoder matrices to correlation matrices. This parameter transformation enables the use of efficient convex optimization algorithms while maintaining the essential properties of the original problem, thereby reducing computational complexity for large antenna arrays

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent introduces correlation matrices as an intermediary representation between the original precoder design and the final beamforming solution. By working with correlation matrices instead of direct precoder matrices, the optimization problem becomes computationally tractable while still achieving the desired beamforming performance through subsequent precoder extraction

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If iterative precoder-optimization algorithms are implemented, then precoder performance approaches optimal, but computational burden increases significantly

Engineering Contradiction:

Improveprecoder performanceVSAvoidcomputational burden

Core Design Contradiction:

ReliabilityVSPower

Solution Approach 1:

The patent changes the optimization parameters from precoder matrices to correlation matrices, transforming the problem into a convex semidefinite program. This parameter transformation eliminates the need for complex iterative algorithms while maintaining near-optimal performance, significantly reducing the computational burden

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS12267130B2Network node and method performed in a wireless communication network for pre-coder optimization

Publication Date: 2025.04.01 TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)

AI summary

Embodiments herein disclose a method performed by a network node for handling communication in a wireless communication network. The network node selects a precoder based on mutual information related to channel capacity of a channel, wherein the mutual information is computed in a closed-form computation within a set interval. The network node transmits data over the channel using the selected precoder.