15 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 15
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 Birleşik çöz/sıkıştır ve ilet tabanlı işbirlikçi çoklu erişim(IEEE, 2012-04-18) Güneş, Mehmet; Kaya, OnurBu bildiride, iki kullanıcılı bir işbirlikçi çoklu erişim kanalı için çöz-ilet ve sıkıştır-ilet tekniklerinin eş zamanlı kullanılmasına dayalı kodlama ve kodçözme teknikleri geliştiriyor, ve karşılık gelen erişilebilir veri hızı ifadelelerini türetiyoruz. Sonuçlarımızı bilinen bazı çift yönlü işbirliği stratejilerinin veri hızları ile kıyaslayarak, iki tekniğin bir arada kullanılmasının erişilebilir veri hızı bölgesini genişletebildiğini benzetimler yolu ile gösteriyoruz.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 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.Yayın Channel adaptive encoding and decoding strategies and rate regions for the three user cooperative multiple access channel(IEEE, 2008) Edemen, Çağatay; Kaya, OnurFor a cooperative Gaussian multiple access channel (MAC), we propose a new channel adaptive three user cooperation strategy, based on a non-trivial extension of block Markov super-position encoding. We obtain the expressions for the resulting achievable rate region. We demonstrate through simulations that the participation of an extra user in cooperation provides significant rate improvements. The proposed strategy also improves upon our earlier results on the three user cooperative MAC [1], under certain channel conditions.Yayın Blind channel estimation for space-time coding systems with Baum-Welch algorithm(IEEE, 2002) Çırpan, Hakan Ali; Panayırcı, ErdalIn recent years, space-time coding is proposed to provide significant capacity gains over the traditional communication systems in fading wireless channels. In this paper, we consider the problem of blind estimation of the channel parameters along with space-time coded signals. Our proposed approach exploits the finite alphabet property of the space-time coded signals and is based on the unconditional signal model by treating the information sequence as stochastic I.I.D. sequences. The iterative Baum-Welch algorithm is then adapted to solve resulting unconditional ML optimization cost function. Finally, some simulation results are presented.Yayın Achievable rates for the three user cooperative multiple access channel(IEEE, 2008) Edemen, Çağatay; Kaya, OnurFor a three user Gaussian multiple access channel (MAC), we propose a new superposition block Markov encoding based cooperation scheme. Our scheme allows the three users to simultaneously cooperate both in pairs, and collectively, by dividing the transmitted messages into sub messages intended for each cooperating partner. The proposed encoding and decoding at the transmitters take into account the relative qualities of the cooperation links between the transmitters. We obtain and evaluate the achievable rate region based on our encoding strategy, and compare it with the achievable rates for the two user cooperative MAC. We demonstrate that the added diversity by the presence of the third user improves the region of achievable rates, and this improvement is especially significant as far as the sum rate of the system is concerned.Yayın Maintenance policy simulation for a factored partially observable system(The Society for Modeling and Simulation International, 2019-07) Özgür Ünlüakın, Demet; Kıvanç, İpekTaking maintenance decisions is one of the well-known stochastic sequential decision problems under uncertainty. Partially Observable Markov Decision Processes (POMDPs) are powerful tools for such problems. Nevertheless, POMDPs are rarely used for tackling maintenance problems of multi-component systems because their state spaces grow exponentially with the increasing number of components. Factored representations have been proposed for POMDPs taking advantage of the factored structure already available in the nature of the problem. Our aim in this study is to show how to formulate a factored POMDP model for the maintenance problem of a multi-component dynamic system and how to simulate and evaluate the obtained policy before implementing it in real life. The sensitivity of the methodology is analyzed under several cost values, and the methodology is compared to other predefined policies. The results show that the policies generated via the POMDP solver perform better than the predefined policies.
