Magnus Brandt-Moller

Magnus Brandt-Moller

Auto-generated profile, based on publicly available information

Magnus Brandt-Moller

Technical University of Denmark, DTU Space, Kongens Lyngby, Denmark

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 March 2024 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
MBMagnus Brandt-Møller
Magnus Brandt-Møller
MMMichael Mattes
Michael Mattes
OBOlav Breinbjerg
Olav Breinbjerg
MZMin Zhou
Min Zhou
EJErik Jørgensen
Erik Jørgensen
The Higher-Order Array Decomposition Method (HO-ADM) is extended to handle fully populated or thinned finite array antennas and scatterers which can be modeled as arrays with connected elements lying on a regular lattice. The Discontinuous Galerkin Method (DGM) is employed to retain the multi-level block-Toeplitz Method of Moments (MoM) matrix structure even for connected elements. Moreover, by zeroing a selected subset of unknowns in the iterative solution process, thinned arrays can be handled as well. The presented method yields more than an order of magnitude shorter solution times for both a 32×32-element square- and a 793-element circular-thinned array with a memory consumption comparable to existing fast methods such as MLFMM.

22 August 2022 in IEEE Antennas and Wireless Propagation Letters
Verified
Journal Article
Closed access
MBMagnus Brandt-Moller
Magnus Brandt-Moller
MMMichael Mattes
Michael Mattes
OBOlav Breinbjerg
Olav Breinbjerg
MZMin Zhou
Min Zhou
OBOscar Borries
Oscar Borries
The full-wave Array Decomposition Method for regular antenna arrays with arbitrary elements using higher-order hierarchical basis functions is investigated. We show that the use of higher-order basis functions results in significantly reduced memory consumption and computation time for a $\mathbf {10\times 10}$ element conical horn array with an aperture size of $22\lambda \times 22\lambda$, without the need for analytical nor numerical approximations. In addition, we demonstrate that by employing higher-order basis functions, the far-field error is considerably lower than by using common first-order basis functions for the same total number of unknowns.