Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low-Complexity QL-QR Decomposition Based Beamforming Design for Two-Way MIMO Relay Networks (1502.04860v1)

Published 17 Feb 2015 in cs.IT and math.IT

Abstract: In this paper, we investigate the optimization problem of joint source and relay beamforming matrices for a twoway amplify-and-forward (AF) multi-input multi-output (MIMO) relay system. The system consisting of two source nodes and two relay nodes is considered and the linear minimum meansquare- error (MMSE) is employed at both receivers. We assume individual relay power constraints and study an important design problem, a so-called determinant maximization (DM) problem. Since this DM problem is nonconvex, we consider an efficient iterative algorithm by using an MSE balancing result to obtain at least a locally optimal solution. The proposed algorithm is developed based on QL, QR and Choleskey decompositions which differ in the complexity and performance. Analytical and simulation results show that the proposed algorithm can significantly reduce computational complexity compared with their existing two-way relay systems and have equivalent bit-error-rate (BER) performance to the singular value decomposition (SVD) based on a regular block diagonal (RBD) scheme.

Citations (1)

Summary

We haven't generated a summary for this paper yet.