An Analysis of the Bidirectional LMS Algorithm over Fast-Fading Channels

Yapici, Yavuz
Yılmaz, Ali Özgür
A bidirectional LMS algorithm is considered for estimation of fast frequency-selective time-varying channels with a promise of near optimal tracking performance and robustness to parameter imperfections under various scenarios at a practical level of complexity. The performance of the algorithm is verified by the theoretical steady-state MSE analysis and experimental bit error rate (BER) results.


A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter Wave Channels
Güvensen, Gökhan Muzaffer (2016-01-01)
Recently, a two-stage beamforming concept under the name of Joint Spatial Division and Multiplexing (JSDM), a kind of divide-and-conquer approach based on statistical user-grouping, has been proposed to enable simplified system operations in massive MIMO. In this study, we establish a general framework on the reduced dimensional channel state information (CSI) estimation and pre-beamformer design for frequency-selective massive MIMO systems employing single-carrier (SC) modulation in time division duplex (T...
A reformulation of the ant colony optimization algorithm for large scale structural optimization
Hasançebi, Oğuzhan; Saka, M.p. (2011-01-01)
This study intends to improve performance of ant colony optimization (ACO) method for structural optimization problems particularly with many design variables or when design variables are chosen from large discrete sets. The algorithm developed with ACO method employs the so-called pheromone scaling approach to overcome entrapment of the search in a poor local optimum and thus to recover efficiency of the method for large-scale optimization problems. Besides, a new formulation is proposed for the local upda...
An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks
Yalcinkaya, Beyazit; Nasri, Mitra; Brandenburg, Bjoern B. (2019-01-01)
Exact schedulability analysis of limited-preemptive (or non-preemptive) real-time workloads with variable execution costs and release jitter is a notoriously difficult challenge due to the scheduling anomalies inherent in non-preemptive execution. Furthermore, the presence of self-suspending tasks is well-understood to add tremendous complications to an already difficult problem. By mapping the schedulability problem to the reachability problem in timed automata (TA), this paper provides the first exact sch...
A neural network method for direction of arrival estimation with uniform circular dipole array in the presence of mutual coupling
Caylar, Selcuk; Leblebicioğlu, Mehmet Kemal; Dural, Guelbin (2007-06-16)
In recent years application of Neural Network (NN) algorithms in both target tracking problem and DoA estimation have become popular because of the increased computational efficiency This paper presents the implementation of modified neural network algorithm(MN-MUST) to the uniform circular dipole array in the presence of mutual coupling. In smart antenna systems, mutual coupling between elements can significantly degrade the processing algorithms. In this paper mutual coupling affects on MN-MUST has been i...
An interactive approximation algorithm for multi-objective integer programs
Lokman, Banu; Korhonen, Pekka J.; Wallenius, Jyrki (2018-08-01)
We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change th...
Citation Formats
Y. Yapici and A. Ö. Yılmaz, “An Analysis of the Bidirectional LMS Algorithm over Fast-Fading Channels,” IEEE TRANSACTIONS ON COMMUNICATIONS, pp. 1759–1764, 2012, Accessed: 00, 2020. [Online]. Available: