9 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 9 / 9
Yayın Enabling cooperation, resource allocation and receiver selection across cells: complementary fractional frequency reuse(IEEE, 2013) Bakşi, Saygın; Kaya, Onur; Bıyıkoğlu, TürkerFor a multi-cell multiple access channel, we develop a comprehensive cooperative communication framework: we propose a novel complementary fractional frequency reuse (FFR) strategy tailored specifically for pairwise user cooperation, also taking into account cell sectoring. This strategy allows the cell edge users not only to pool their resources and cooperate across cells, but also to choose the best receiver. We divide the users into cooperating inner and outer user pairs, and assign each pair orthogonal resources using OFDMA. We employ pairwise bidirectional cooperation based on block Markov superposition encoding among user pairs. We derive the achievable rates, while taking into account the geometry dependent interference at the users and the receiver. We find the jointly optimal power allocation, partner selection and receiver selection strategies that maximize the sum rate of the system. We then propose a heuristic matching algorithm, which operates based only on user and receiver locations. We compare the performance of our proposed strategies with several non-cooperative models, and demonstrate that the sum rate can nearly be doubled, while using the same resources.Yayın Incremental construction of rule ensembles using classifiers produced by different class orderings(IEEE, 2016) Yıldız, Olcay Taner; Ulaş, AydınIn this paper, we discuss a novel approach to incrementally construct a rule ensemble. The approach constructs an ensemble from a dynamically generated set of rule classifiers. Each classifier in this set is trained by using a different class ordering. We investigate criteria including accuracy, ensemble size, and the role of starting point in the search. Fusion is done by averaging. Using 22 data sets, floating search finds small, accurate ensembles in polynomial time.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 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 Optimal and near-optimal partner selection algorithms in cooperative OFDMA(IEEE, 2012) Bakşi, Saygın; Kaya, Onur; Bıyıkoğlu, TürkerWe obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner selection steps can be performed sequentially, and the latter step can be formulated as a maximum weighted matching problem on an undirected graph, which can be solved in polynomial time. We further propose practical algorithms, and compare their performances to the optimal matching algorithm, and demonstrate that very simple and low complexity algorithms based on user-user and user-receiver distances may provide near-optimum rate performance. Moreover, we observe that algorithms that achieve superior sum-rate performance, surprisingly pair the cell edge users, with the strong users near the base station.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 Incremental construction of classifier and discriminant ensembles(Elsevier Science Inc, 2009-04-15) Ulaş, Aydın; Semerci, Murat; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim EthemWe discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier is used for some classes only. We investigate criteria including accuracy, significant improvement, diversity, correlation, and the role of search direction. For discriminant ensembles, we test subset selection and trees. Fusion is by voting or by a linear model. Using 14 classifiers on 38 data sets. incremental search finds small, accurate ensembles in polynomial time. The discriminant ensemble uses a subset of discriminants and is simpler, interpretable, and accurate. We see that an incremental ensemble has higher accuracy than bagging and random subspace method; and it has a comparable accuracy to AdaBoost. but fewer classifiers.Yayın Adaptive Kalman receiver for OFDM systems with transmit diversity in mobile wireless channels(Walter De Gruyter GMBH, 2004-12) Şen, Adnan; Çırpan, Hakan Ali; Panayırcı, ErdalA new joint channel tracking and symbol detection scheme is proposed in this paper for pilot symbol assisted transmit diversity OFDM systems by exploiting the correlation of the adjacent subchannels. Modelling the channel frequency response of every subcarrier corresponding to each transmit antenna as random processes, we employ Kalman filters for both channel tracking and subsequent decoding with diversity gain. Among different stochastic models, the AR model is adopted herein for channel dynamics. Since the proposed adaptive receiver uses two Kalman filters to track the variations of the channel and subsequently to detect the information symbols, they are combined in the coupled receiver structure. Finally the performance of the proposed method is studied through experimental results.Yayın A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC(IEEE, 2013) Edemen, Çağatay; Kaya, OnurFor a three user cooperative multiple access channel (MAC), we propose a new block Markov superposition encoding strategy, which enables all three users to cooperate collectively as well as in pairs. We obtain the resulting achievable rate expressions and compare them with existing two and three user cooperative strategies. We demonstrate that significant rate gains may be possible, without resorting to adaptive encoding/decoding techniques. We investigate the contributions from pairwise and collective cooperation signals while achieving tuples on the rate region boundary, and compare by simulations the sum rates achievable by two user versus three user grouping in cooperative MACs with fixed total resources.
