A better approximation of small reflections for synthesis of impedance matching networks for antenna arrays

2002-08-05
A study was conducted on the theory of transmission line networks. Such a study aims to improve the approximate theory for small reflections for synthesis problem of impedance matching networks which can be applied to large scale problems such as antenna array feed network designs. This paper presents the results used to derive a better and a more accurate approximation to the network response.
2002 IEEE Antennas and Propagation Society International Symposium

Suggestions

A marginalized multilevel model for bivariate longitudinal binary data
Inan, Gul; İlk Dağ, Özlem (Springer Science and Business Media LLC, 2019-06-01)
This study considers analysis of bivariate longitudinal binary data. We propose a model based on marginalized multilevel model framework. The proposed model consists of two levels such that the first level associates the marginal mean of responses with covariates through a logistic regression model and the second level includes subject/time specific random intercepts within a probit regression model. The covariance matrix of multiple correlated time-specific random intercepts for each subject is assumed to ...
A tool for designing robust autopilots for ramjet missiles
Kahvecioğlu, Alper; Alemdaroğlu, Hüseyin Nafiz; Department of Aerospace Engineering (2006)
The study presented in this thesis comprises the development of the longitudinal autopilot algorithm for a ramjet powered air-to-surface missile. Ramjet Missiles have short time-of-flight, however they suffer from limited angle of attack margins due to poor operational-region characteristics of the ramjet engine. Because of such limitations and presence of uncertainties involved, Robust Control Techniques are used for the controller design. Robust Control Techniques not only provide an easy limitation/uncer...
Probabilistic distance clustering on networks
İyigün, Cem (null; 2018-11-05)
In this study, a soft clustering problem on networks is investigated. It is assumed that cluster centers are located not only on vertices, but also on the edges of the network. Two different soft assignment schemes are studied where different membership functions are considered for the assignments. Structural properties for the clustering problem have been derived for different problem settings and the relation to the p-median problem has been shown under specific conditions. As a solution approach, a metah...
Development of a three-tier test to assess ninth grade students' misconceptions about simple electric circuits
Peşman, Haki; Eryılmaz, Ali; Department of Secondary Science and Mathematics Education (2005)
The main purpose of this study was to develop a three-tier test for assessing ninth-grade students̕ misconceptions about simple electric circuits. The first tier of an item on the test presents an ordinary multiple choice question, the second tier presents a set of reasons for the response given to the first tier, and the third tier questions if examinees are confident for their responses to the first two tiers. The study was carried in Polatlı, the biggest outlying district of capital Ankara. In the light ...
An Improved Stereo Matching Algorithm with Ground Plane and Temporal Smoothness Constraints
Cigla, Cevahir; Alatan, Abdullah Aydın (2012-10-13)
In this study, novel techniques are presented addressing the challenges of stereo matching algorithms for surveillance and vehicle control. For this purpose, one of the most efficient local stereo matching techniques, namely permeability filter, is modified in terms of road plane geometry and temporal consistency in order to take the major challenges of such a scenario into account. Relaxing smoothness assumption of the permeability filter along vertical axis enables extraction of road geometry with high ac...
Citation Formats
Ş. Demir, “A better approximation of small reflections for synthesis of impedance matching networks for antenna arrays,” San Antonio, TX, Amerika Birleşik Devletleri, 2002, vol. 3, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0036073844&origin=inward.