• Journal of information and communication convergence engineering
• /
• v.10 no.2
• /
• pp.108-116
• /
• 2012

A novel approach to general linearly constrained adaptive arrays is presented to improve the nulling performance in coherent and noncoherent environments. The narrowband and broadband linearly constrained adaptive arrays are implemented to examine the array performance. It is shown that the proposed approach performs better than the conventional adaptive arrays and the nulling performance depends on the gain factor for the desired response.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.849-856
• /
• 2011

This research introduces three new fractal array configurations that have superior performance over the well-known Sierpinski fractal array. These arrays are based on the fractal shapes Dragon, Twig, and a new shape which will be called Flap fractal. Their superiority comes from the low side lobe level and/or the wide angle between the main lobe and the side lobes, which improves the signal-to-intersymbol interference and signal-to-noise ratio. Their performance is compared to the known array configurations: uniform, random, and Sierpinski fractal arrays.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.788-795
• /
• 2003

We analyze the performance of a truncated power controlled CDMA(code division multiple access) cellular systems with base station antenna arrays. Erlang capacity and the channel capacity which is a maximum date rate to maintain almost error free communication are analytically derived. The numerical results show there can be a substantial increase in Erlang capacity and in channel capacity by antenna arrays incorporating with the truncated power control scheme.

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.225-233
• /
• 2003

In this paper we make use of the parity check matrices of the codes based on inverting construction $Y_1$ to construct a number of new asymmetric orthogonal arrays with higher strength and higher number of levels using the method of construction of asymmetric orthogonal arrays given by Suen et al. (2001).

• The Pure and Applied Mathematics
• /
• v.25 no.2
• /
• pp.127-133
• /
• 2018

We look at Toeplitz arrays on ${\mathbb{Z}}^d$ and study a characterizing property for pure discrete spectrum in terms of the periodic structures of the Toeplitz arrays.

• Journal of the Korean Statistical Society
• /
• v.19 no.1
• /
• pp.1-14
• /
• 1990

This paper proposes an approach to the identification of trnasfer function models. A strategy for the identification of the model structure is based on R and S arrays constructed by the impulse response function of the model. Theoretical patterns of the arrays associated with the model are investigated, and the practical implementation method of the suggested approach is also discussed. Finally two published samples are employed to demonstrate the practicability of the approach.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.4
• /
• pp.524-529
• /
• 2012

This paper proposes a novel control strategy of a PV tracking system considering the shadow influence. If distance of between PV arrays is not enough, shadow can be occurred to PV module. In PV system, if shadow is occurred to PV modules then PV modules operates reverses bias, and will eventually cause hot-spot and loss. To reduce loss by shadow influence, this paper proposes shadow compensation algorithm using distance between arrays and shadow length of array. The distance between arrays is calculated by using azimuth of solar, and length of array shadow is calculated using by altitude of solar. The shadow compensation algorithm proposed in this paper compares distance between arrays and length of array shadow. When the shadow length is longer than the distance between arrays, the algorithm adjusts altitude of array to avoid the shadow effects. The control algorithm proposed in this paper proves validity through compared with conventional algorithm and proposes experiment result.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.858-863
• /
• 2004

In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.

• Journal of the Optical Society of Korea
• /
• v.14 no.4
• /
• pp.438-443
• /
• 2010

In this paper, behaviors of photonic crystal (PC) radiative structures and antenna arrays have been compared for two types of uniform and binomial excitations. Appropriate duality has been shown between them. These results can be generalized to other types of excitation and arrangement of photonic crystal radiative arrays such as linear, planar and circular arrays of three dimensional (3D) photonic crystal termination resonators. Using these results in designing photonic circuits has some advantages for shaping a particular radiative beam at the photonic crystal exit, for instance reducing the divergence angle of the main lobe in order to enhance the directivity, for better coupling, or for splitting the emitted beam, for dividing the output beam to the next devices in photonic integrated circuits (PIC). For analysis and simulation of the photonic crystal structures, the finite difference time domain (FDTD) method has been employed.

• Transactions of the Society of Information Storage Systems
• /
• v.10 no.1
• /
• pp.14-18
• /
• 2014

Adhesion between carbon nanotube (CNT) arrays is measured and characterized for number of different contact areas. The CNT arrays are directly grown on an electrostatic microactuator, and they make contact with each other during the growth process. The pull-out force is precisely applied by the microactuator while the contact status is identified by measuring electrical resistance between the CNT arrays. We have designed different contact areas of 1000, 6000, and 8500 ${\mu}m^2$ between the CNT arrays, and the corresponding adhesion increases from 0.9 to 3.7 ${\mu}N$ as the contact area increases.