Design of a multi-core hardware architecture for consensus-based MIMO detection algorithms

Tscherkaschin, Konstantin; Knoop, Benjamin; Rust, Jochen; Paul, Steffen

doi:10.1109/acssc.2016.7869174

Cited by 2 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be seen that the objective function in (7) is not separable for the following reasons: 1) the first term of the objective function, ψ(X, G, B), may incorporate terms related to both G and B; 2) when choosing different values for p, such as p = 2 or p = ∞, the norm term is inseparable (as opposed to the p = 1 case that is demonstrated below (in ( 8)), while the constraints of the problem in (7) are separable.…”

Section: Cmlementioning

confidence: 99%

“…, and Since problem (7) is convex, the proposed ALM converges for all ρ > 0 under mild conditions [50]. The ALM algorithm has two main stages.…”

Section: B Alm Solutionmentioning

confidence: 99%

“…Complex-valued graph signals arise in several real-world applications [5], such as multi-agent systems [6], wireless communication systems [7], voltage and power phasors in electrical networks [8]- [10], and probabilistic graphical models with complex-valued multivariate Gaussian vectors [11]. Despite the widespread use of complex-valued graph signals, the recovery of complex-valued Laplacians is a crucial problem that has not been well explored.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Estimation of the Admittance Matrix in Power Systems Under Laplacian and Physical Constraints

Halihal

Routtenberg

2022

ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

In this paper, we investigate the problem of estimating a complex-valued Laplacian matrix from a linear Gaussian model, with a focus on its application in the estimation of admittance matrices in power systems. The proposed approach is based on a constrained maximum likelihood estimator (CMLE) of the complex-valued Laplacian, which is formulated as an optimization problem with Laplacian and sparsity constraints. The complex-valued Laplacian is a symmetric, non-Hermitian matrix that exhibits a joint sparsity pattern between its real and imaginary parts. Leveraging the ℓ1 relaxation and the joint sparsity, we develop two estimation algorithms for the implementation of the CMLE. The first algorithm is based on casting the optimization problem as a semi-definite programming (SDP) problem, while the second algorithm is based on developing an efficient augmented Lagrangian method (ALM) solution. Next, we apply the proposed SDP and ALM algorithms for the problem of estimating the admittance matrix under three commonly-used measurement models, that stem from Kirchhoff's and Ohm's laws, each with different assumptions and simplifications: 1) the nonlinear alternating current (AC) model; 2) the decoupled linear power flow (DLPF) model; and 3) the direct current (DC) model. The performance of the SDP and the ALM algorithms is evaluated using data from the IEEE 33-bus power system data under different settings. The numerical experiments demonstrate that the proposed algorithms outperform existing methods in terms of mean-squared-error (MSE) and F-score, thus, providing a more accurate recovery of the admittance matrix.

show abstract

Section: Cmlementioning

confidence: 99%

“…, and Since problem (7) is convex, the proposed ALM converges for all ρ > 0 under mild conditions [50]. The ALM algorithm has two main stages.…”

Section: B Alm Solutionmentioning

confidence: 99%