Browsing by Subject "Iterative algorithms"
Now showing 1 - 8 of 8
Results Per Page
Sort Options
Item Open Access Çok kullanıcılı çok antenli sistemlerde iş birlikli iletim(IEEE, 2008-04) Yazarel, Y. K.; Aktaş, DefneBu çalışmada işbirlikli, çok kullanıcılı, ve çok antenli bir haberleşme sisteminde telsiz erişim terminallerinin en iyi veri iletimi tekniğine ortaklaşa karar vermeleri problemini inceliyoruz. Burada pek çok çalışmadan farklı olarak kullanıcıların bireysel başarım hedefleri ve anten başına iletim gücü kısıtlamaları olduğu durumu ele alıyoruz. Önceki bir çalışmamızda bu kısıtlamalar altında en iyi sonucu bulan döngülü bir algoritma sunmuştuk. Ancak bu algoritma merkezi bir yapıda olduğu için tam anlamıyla dağıtılmış şekilde gerçeklenememektedir. Bununla birlikte basit yaklaşıklıklar kullanarak en iyiye yakın bir başarım sağlayan ve kısıtlı ve yerel veri iletimi ile gerçeklenebilecek etkin bir algoritma öneriyoruz.Item Open Access Color holographic reconstruction using multiple SLMs and LED illumination(SPIE, 2009-01) Yaraş, Fahri; Onural, LeventA color holographic reconstruction technique by using three light emitting diodes (LEDs) is described. Reflective type phase-only spatial light modulators (SLMs) are used since they are suitable for in-line phase holograms. Gerchberg-Saxton iterative algorithm is used for computing phase holograms. Three phase holograms are calculated separately for red, green and blue colors, for a color reconstruction, and separately loaded to corresponding SLMs. Three LEDs are used for illuminating those phase holograms and reconstructions are combined and captured. Experimental results are satisfactory. © 2009 SPIE-IS&T.Item Open Access Downlink beamforming under individual SINR and per antenna power constraints(IEEE, 2007-08) Yazarel, Y. K.; Aktaş, DefneIn this paper we consider the problem of finding the optimum beamforming vectors for the downlink of a multiuser system, where there are individual signal to interference plus noise ratio (SINR) targets for each user. Majority of the previous work on this problem assumed a total power constraint on the base stations. However, since each transmit antenna is limited by the amount of power it can transmit due to the limited linear region of the power amplifliers, a more realistic constraint is to place a limit on the per antenna power. In a recent work, Yu and Lan proposed an iterative algorithm for computing the optimum beamforming vectors minimizing the power margin over all antennas under individual SINR and per antenna power constraints. However, from a system designer point of view, it may be more desirable to minimize the total transmit power rather than minimizing the power margin, especially when the system is not symmetric. Reformulating the transmitter optimization problem to minimize the total transmit power subject to individual SINR constraints on the users and per antenna power constraints on the base stations, the algorithm proposed by Yu and Lan is modified. Performance of the modified algorithm is compared with existing methods for various cellular array scenarios. ©2007 IEEE.Item Open Access Efficient solution of the electric-field integral equation using the iterative LSQR algorithm(Institute of Electrical and Electronics Engineers, 2008) Ergül, Özgür; Gürel, LeventIn this letter, we consider iterative solutions of the three-dimensional electromagnetic scattering problems formulated by surface integral equations. We show that solutions of the electric-field integral equation (EFIE) can be improved by employing an iterative least-squares QR (LSQR) algorithm. Compared to many other Krylov subspace methods, LSQR provides faster convergence and it becomes an alternative choice to the time-efficient no-restart generalized minimal residual (GMRES) algorithm that requires large amounts of memory. Improvements obtained with the LSQR algorithm become significant for the solution of large-scale problems involving open surfaces that must be formulated using EFIE, which leads to matrix equations that are usually difficult to solve iteratively, even when the matrix-vector multiplications are accelerated via the multilevel fast multipole algorithm.Item Open Access Iterative solution of the normal-equations form of the electric-field integral equation(IEEE, 2007) Ergül, Özgür; Gürel, LeventIn this paper, we show that transforming the original equations into normal equations improves the convergence of EFIE significantly. We present the solutions of EFIE by employing the least-squares QR (LSQR) algorithm, which corresponds to a stable application of the conjugate gradient (CG) algorithm on the normal equations. Despite the squaring of the condition number due to such a transformation into the normal equations, LSQR improves the convergence rate of the iterative solutions of EFIE and performs better than many other iterative algorithms that are commonly used in the literature. In addition to LSQR, we present the accelerated convergence of the normal equations in the context of the generalized minimal residual (GMRES) algorithm, where the memory requirement is reduced significantly due to the improved convergence characteristics.Item Open Access Preconditioned MLFMA solution of multiple dielectric-metallic composite objects with the electric and magnetic current combined-field integral equation (JMCFIE)(IEEE, 2009-06) Ergül, Özgür; Gürel, LeventWe consider fast and accurate solutions of scattering problems involving multiple dielectric and composite dielectric-metallic structures with three-dimensional arbitrary shapes. Problems are formulated rigorously with the electric and magnetic current combined-field integral equation (JMCFIE), which produces well-conditioned matrix equations. Equivalent electric and magnetic surface currents are discretized by using the Rao-Wilton-Glisson (RWG) functions defined on planar triangles. Matrix equations obtained with JMCFIE are solved iteratively by employing a Krylov subspace algorithm, where the required matrix- vector multiplications are performed efficiently with the multilevel fast multipole algorithm (MLFMA). We also present a four-partition block-diagonal preconditioner (4PBDP), which provides efficient solutions of JMCFIE by reducing the number of iterations significantly. The resulting implementation based on JMCFIE, MLFMA, and 4PBDP is tested on large electromagnetics problems.Item Open Access Signal recovery from partial fractional fourier transform information(IEEE, 2004) Çetin, A. Enis; Özaktaş, H.; Özaktaş, Haldun M.The fractional Fourier transform has found many applications in signal and image processing and optics. An iterative algorithm for signal recovery from partial fractional Fourier transform information is presented. The signal recovery algorithm is constructed by using the method of projections onto convex sets and convergence of the algorithm is assured.Item Open Access Three-dimensional motion and dense-structure estimation using convex projections(SPIE, 1997-02) Alatan, A. Aydın; Erdem, A. Tanju; Onural, LeventWe propose a novel method for estimating the 3D motion and dense structure of an object form its two 2D images. The proposed method is an iterative algorithm based on the theory of projections onto convex sets (POCS) that involves successive projections onto closed convex constraint sets. We seek a solution for the 3D motion and structure information that satisfies the following constraints: (i) rigid motion - the 3D motion parameters are the same for each point on the object. (ii) Smoothness of the structure - depth values of the neighboring points on the object vary smoothly. (iii) Temporal correspondence - the intensities in the given 2D images match under the 3D motion and structure parameters. We mathematically derive the projection operators onto these sets and discuss the convergence properties of successive projections. Experimental results show that the proposed method significantly improves the initial motion and structure estimates.