Shaped Beam Synthesis of Arrays via Sequential Convex Optimizations
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
Bearing estimation algorithms obtain only a small number of direction of arrivals (DOAs) within the entire angle domain, when the sources are spatially sparse. Hence, we propose a method to specifically exploit this spatial sparsity property. The method us ...
Institute of Electrical and Electronics Engineers2012
This dissertation aims to explore the design trade-offs and technological limitations of planar antenna elements and arrays for Ka-band space applications. The motivation for this research stems from the growing importance of wideband millimetre wave radio ...
An iterative algorithm to synthesize uniform amplitude focused beam arrays is presented. While the number of array elements and the excitations are fixed and known, the locations of the elements are optimized to radiate a narrow beam low sidelobe pattern. ...
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...
Institute of Electrical and Electronics Engineers2013
The joint synthesis of the spatial power pattern and polarization of arbitrary arrays is addressed. Specifically, the proposed approach gives the solution to a frequently encountered problem, namely the array design (i.e., the determination of the radiatin ...
Institute of Electrical and Electronics Engineers2011
An iterative procedure for the synthesis of sparse arrays radiating focused or shaped beampattern is presented. The algorithm consists in solving a sequence of weighted l(1) convex optimization problems. The method can thus be readily implemented and effic ...
Institute of Electrical and Electronics Engineers2012
An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...
In this work a conceptual design of a conformal antenna array is presented for a millimeter-wave antenna system, optimized for low-cost mass production in PCB technology. The conformal array is constituted by four cube faces with two antennas realized on e ...
