19 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 19
Yayın Maximum likelihood blind channel estimation for space-time coding systems(Hindawi Publishing Corporation, 2002-05) Çırpan, Hakan Ali; Panayırcı, Erdal; Çekli, ErdinçSophisticated signal processing techniques have to be developed for capacity enhancement of future wireless communication systems, In recent years, space-time coding is proposed to provide significant capacity gains over the traditional communication systems in fading wireless channels. Space-time codes are obtained by combining channel coding, modulation, transmit diversity, and optional receive diversity in order to provide diversity at the receiver and coding gain without sacrificing the bandwidth. In this paper, we consider the problem of blind estimation of space-time coded signals along with the channel parameters. Both conditional and unconditional maximum likelihood approaches are developed and iterative solutions are proposed. The conditional maximum likelihood algorithm is based on iterative least squares with projection whereas the unconditional maximum likelihood approach is developed by means of finite state Markov process modelling. The performance analysis issues of the proposed methods are studied. Finally, some simulation results are presented.Yayın Optimal primary-secondary user pairing and power allocation in cognitive cooperative multiple access channels(IEEE, 2014) Bakşi, Saygın; Kaya, OnurWe develop jointly optimal power control and primary-secondary user partnering strategies for a cognitive cooperative multiple access channel with K primary and K secondary users. For each primary user, a cooperating secondary user is assigned. We consider both underlay and overlay modes for cognition/cooperation. In overlay mode, each secondary user decodes and relays part of its assigned primary user's message, and simultaneously transmits its own independent message, while ensuring the primary user achieves at least its single user capacity with power control. The encoding is based on channel adaptive block Markov superposition coding, where the powers assigned to primary and secondary user codewords are optimized so as to maximize either the system's sum rate, or the sum of secondary users' rates. In underlay mode, each secondary user employs independent signalling and allocates its power to maximize its own rate, without decreasing its assigned primary user's rate. The partnering problem for either mode is reduced to a maximum weighted matching (MWM) problem on a bipartite graph, and solved jointly optimally with the power allocation problem.Yayın Optimum power control for transmitter cooperation in OFDMA based wireless networks(IEEE, 2011) Bakım, İsmail Sezi; Kaya, OnurFor a cooperative orthogonal frequency division multiple access (OFDMA) system with two transmitters (TXs), and full channel state information (CSI), we obtain the optimal power allocation (PA) policies which maximize the rate region achievable by a recently introduced version of block Markov superposition encoding (BMSE): inter-subchannel cooperative encoding (ISCE) [1]. We provide the optimality conditions that need to be satisfied by the powers associated with the transmitted codewords. We propose two algorithms that yield the optimal power distribution: a subgradient algorithm which achieves an arbitrary rate point on the achievable rate region boundary, and an iterative waterfilling-like algorithm which maximizes the sum rate, and converges much faster. We observe that, utilization of power control to take advantage of the diversity offered by the cooperative OFDMA system, not only leads to a remarkable improvement in achievable rates, but also may help determine how the subchannels have to be instantaneously allocated to various tasks in cooperation.Yayın Cooperative strategies and achievable rates for two user OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2011-12) Bakım, İsmail Sezi; Kaya, OnurWe propose three encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding (BMSE). We obtain the expressions for the resulting achievable rate regions for all three encoding strategies. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved. We demonstrate potential rate gains attained by cooperative OFDMA, through simulations.Yayın Maintenance policy analysis of the regenerative air heater system using factored POMDPs(Elsevier Ltd, 2022-03) Kıvanç, İpek; Özgür Ünlüakın, Demet; Bilgiç, TanerMaintenance optimization of multi-component systems is a difficult problem. Partially Observable Markov Decision Processes (POMDPs) are powerful tools for such problems under uncertainty in stochastic environments. In this study, the main POMDP solution approaches and solvers are surveyed. Then, based on experimental models with different complexities in the size of the system space, selected POMDP solvers using different representation patterns for modeling and different procedures for updating the value function while solving are compared. Furthermore, to show that factored representations are advantageous in modeling and solving the maintenance problem of multi-component systems where there exist also stochastic dependencies among the components, the maintenance problem of the one-line regenerative air heater system available in thermal power plants is modeled and solved with factored POMDPs. In-depth sensitivity analyses are performed on the obtained policy. The results show that factored POMDPs enable compact modeling, efficient policy generation and practical policy analysis for the tackled problem. Furthermore, they also motivate the use of factored POMDPs in the generation and analysis of maintenance policies for similar multi-component systems.Yayın Achievable rates for two user cooperative OFDMA(IEEE, 2010) Bakım, İsmail Sezi; Kaya, OnurWe propose two encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding. We obtain the expressions for the resulting achievable rate regions for both encoding strategies, and evaluate them through simulations. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved.Yayın Power control for fading cooperative multiple access channels(IEEE, 2007-08) Kaya, Onur; Ulukuş, ŞennurFor a fading Gaussian multiple access channel with user cooperation, we obtain the power allocation policies that maximize the average rates achievable by block Markov superposition coding, subject to average power constraints. The optimal policies result in a coding scheme that is simpler than the one for a general multiple access channel with generalized feedback. This simpler coding scheme also leads to the possibility of formulating an otherwise non-concave optimization problem as a concave one. Using the perfect channel state information available at the transmitters to adapt the powers, we demonstrate gains over the achievable rates for existing cooperative systems.Yayın Co-registration of surfaces by 3D least squares matching(Amer Soc Photogrammetry, 2010-03) Akça, Mehmet DevrimA method for the automatic co-registration of 3D surfaces is presented. Die method utilizes the mathematical model of Least Squares 2D image matching and extends it for solving the 3D surface matching problem The transformation parameters of the search surfaces are estimated with respect to a template surface. The solution is achieved when the sum of the squares of the 3D Spatial (Euclidean) distances between the surfaces are minimized. The parameter estimation is achieved using the Generalized Gauss-Markov model. Execution level implementation details are given. Apart from the co-registration of the point clouds generated from spacaborne airborne and terrestinal sensors and techniques. the proposed method is also useful for change detection, 3D comparison, and quality assessment tasks Experiments, terrain data examples show file capabilities of the method.Yayın An effective maintenance policy for a multi-component dynamic system using factored POMDPs(Springer Verlag, 2019-09-20) Kıvanç, İpek; Özgür Ünlüakın, DemetWith the latest advances in technology, almost all systems are getting substantially more uncertain and complex. Since increased complexity costs more, it is challenging to cope with this situation. Maintenance optimization plays a critical role in ensuring effective decision-making on the correct maintenance actions in multi-component systems. A Partially Observable Markov Decision Process (POMDP) is an appropriate framework for such problems. Nevertheless, POMDPs are rarely used for tackling maintenance problems. This study aims to formulate and solve a factored POMDP model to tackle the problems that arise with maintenance planning of multi-component systems. An empirical model consisting of four partially observable components deteriorating in time is constructed. We resort to Symbolic Perseus solver, which includes an adapted variant of the point-based value iteration algorithm, to solve the empirical model. The obtained maintenance policy is simulated on the empirical model in a finite horizon for many replications and the results are compared to the other predefined maintenance policies. Drawing upon the policy results of the factored representation, we present how factored POMDPs offer an effective maintenance policy for the multi-component systems.Yayın Power control in the cognitive cooperative multiple access channel(IEEE, 2012) Kaya, Onur; İşleyen, MuratWe extend several encoding and decoding techniques from cooperative communications framework, to a cognitive radio system consisting of a primary user (PU) and a secondary user (SU), sending their messages to a common receiver. Assuming that the transmitters and the receiver have full channel state information (CSI) collected and distributed by the common receiver, and that the SU knows the PU's codebook, the cooperation is obtained by block Markov superposition coding, and backwards decoding, which yield a causal overlay scenario. We formulate two rate optimization problems with the aim of, (i) maximizing the sum rate of the system, and (ii) maximizing the rate of the secondary user. We obtain the optimal power allocations for both cases, and the resulting rate regions. The power controlled cooperation turns out to be especially useful when maximizing the sum rate of the system, as it gives the PU significant rate rewards for allowing the cognitive transmitter to access its resources.
