14 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 14
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 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 Low complexity inter-mode selection for H.264(IEEE, 2006) Ba, Seydou Nourou; Altunbaşak, Yücel; Ateş, Hasan FehmiThe coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitions, the Motion estimation module has extremely high complexity that makes it unpractical for most real-time applications on resource-limited platforms such as hand held devices. In this paper we propose a novel algorithm that significantly reduces the encoding complexity while maintaining high rate distortion performance. The proposed method reduces the Motion estimation (ME) computational complexity by accurately predicting the optimal MB partitions and restricting the number of candidate modes based on a-priori probabilities computed from spatio-temporal information. The experimental results show that the speed up of UmHexagonS [1] (one of the most efficient ME algorithms) can be doubled while maintaining the coding efficiency of Full Search.Yayın Hızlı sönümlemeli kanallarda yeni bir uzay-zaman-frekans kodlamalı OFDM sistem tasarımı(IEEE, 2004) Oğuz, Onur; Aygölü, Hasan Ümit; Panayırcı, ErdalBu çalışmada, frekans seçici hızlı sönümlemeli kanallarda telsiz iletişim için bir uzay-zaman-frekans çeşitlemesi yöntemi önerilmiştir. Önerilen yöntem, OFDM tekniğini kullanarak frekans seçici kanalı uygun hale getirdikten sonra sırasıyla dik uzay-frekans ve dik uzay-zaman blok kodlama uygulayarak uzay-zaman-frekans çeşitlemesi sağlamaktadır. Elde edilen sistemin başarımını arttırmak üzere sisteme uygun bu kafes kodlama tekniği araştırılmış ve uygun kafes yapısının oluşturulması için yeni kriterler ortaya çıkarılmıştır. Oluşan sistemin başarımını, bilgisayar benzetimleriyle incelenmiş ve var olan yöntemlerle karşılaştırılmıştır.Yayın Channel estimation for space-time block coded OFDM systems in the presence of multipath fading(IEEE, 2002) Panayırcı, Erdal; Çırpan, Hakan AliIn this paper, a computationally efficient, non-data-aided maximum a posterlori(MAP) channel estimation algorithm is proposed for orthogonal frequency division multiplexing (OFDM) systems with transmitter diversity using space-time block coding. The Alamouti's transmit diversity scheme with two transmit antennas is employed here and generalized for OFDM systems. The algorithm requires a convenient representation of the discrete multipath fading channel based on the Karhunen-Loeve orthogonal expansion and estimates the complex channel parameters of each subcarriers iteratively using the Expectation Maximization(EM) method, which converges to the true MAP estimation of the unknown channel. Ananalytical expression is derived for the Modified Cramer-Rao. lower bound of the proposed MAP channel estimator. The performance is presented in terms of the mean-square error for a system employing QPS signaling.Yayın MIMO sinyalleri için uzay-zaman blok kodu klasifikasyonu(IEEE, 2014-04-26) Turan, Merve; Öner, Mustafa Mengüç; Çırpan, Hakan AliBilinmeyen haberleşme sinyallerinin gözü kapalı ve işbirliksiz tanınması için geliştirilen teknikler, hem askeri hem de sivil uygulamalarda kullanım bulmuştur. Çok Girdili Çok Çıktılı (MIMO) haberleşme sistemleri, sinyal tanıma sistemleri için üstesinden gelinmesi gereken yeni problemler ortaya koymaktadır. MIMO haberleşmesinde kullanılan uzay zaman kodlarının gözükapalı tanınması bu problemlerin en önemlilerinden biri olarak görülebilir. Bu çalışmada uzay zaman blok kodlanmış sinyal vektörlerinin döngüsel-durağan (cyclostationary) karakteristiklerinin farklı uzay zaman blok kodlarını birbirinden ayırdetmek amacıyla kullanıldığı yenilikçi uzay-zaman kodu tanıma algoritmaları öneriyoruz.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 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.
