scispace - formally typeset
Search or ask a question
Author

Ali H. Sayed

Bio: Ali H. Sayed is an academic researcher from École Polytechnique Fédérale de Lausanne. The author has contributed to research in topics: Adaptive filter & Optimization problem. The author has an hindex of 81, co-authored 728 publications receiving 36030 citations. Previous affiliations of Ali H. Sayed include Harbin Engineering University & University of California, Los Angeles.


Papers
More filters
Proceedings ArticleDOI
05 Jun 2000
TL;DR: New tracking results for adaptive filtering algorithms operating in the presence of two sources of non-stationarities: a carrier frequency offset and random variations are derived.
Abstract: This paper derives new tracking results for adaptive filtering algorithms operating in the presence of two sources of non-stationarities: a carrier frequency offset and random variations. Both impairments are common in digital communications due to variations in channel characteristics and to mismatches between transmitter and receiver carrier generators.

7 citations

Proceedings ArticleDOI
24 Mar 2011
TL;DR: The network of bees is model as a network of mobile nodes with the nodes having asymmetric access to information about the location of the new hive and Diffusion adaptation is used to model and explain the swarming behavior of bees.
Abstract: Honeybees swarm when they move to a new site for their hive. During the process of swarming, their behavior can be analyzed by classifying them as informed scouts or uninformed bees, where the scouts have information about the destination while the uninformed bees follow the scouts. We model the network of bees as a network of mobile nodes with the nodes having asymmetric access to information about the location of the new hive. Diffusion adaptation is then used to model and explain the swarming behavior of bees.

7 citations

Proceedings ArticleDOI
01 Oct 2006
TL;DR: In this paper, the joint effects of IQ imbalance and phase noise on OFDM systems are analyzed, and a compensation scheme is proposed to improve the system performance, which consists of a joint channel estimation algorithm and a joint data symbol estimation algorithm.
Abstract: The joint effects of IQ imbalance and phase noise on OFDM systems are analyzed, and a compensation scheme is proposed to improve the system performance The scheme consists of a joint channel estimation algorithm and a joint data symbol estimation algorithm In the proposed channel estimation algorithm, the channel coefficients are jointly estimated with the IQ imbalance parameters and the phase noise components Its performance is demonstrated to be close to the associated Cramer-Rao lower bound In the proposed data symbol estimation algorithm, the joint compensation is decomposed into IQ imbalance compensation and phase noise compensation It is shown both by theory and computer simulations that the proposed scheme can effectively improve the signal-to-noise ratio at the receiver As a result, the sensitivity of OFDM receivers to the physical impairments can be significantly lowered, simplifying the RF and analog circuitry design in terms of implementation cost, power consumption, and silicon fabrication yield

7 citations

Proceedings ArticleDOI
01 Nov 2014
TL;DR: This work explores the adaptation and learning behavior of the multitask diffusion LMS algorithm under asynchronous conditions when networks are subject to various sources of uncertainties, including random link failures and agents turning on and off randomly.
Abstract: The multitask diffusion LMS algorithm is an efficient strategy to address distributed estimation problems that are multitask-oriented in the sense that the optimum parameter vector may not be the same for every cluster of nodes. In this work, we explore the adaptation and learning behavior of the algorithm under asynchronous conditions when networks are subject to various sources of uncertainties, including random link failures and agents turning on and off randomly. We conduct a mean-square-error performance analysis and examine how asynchronous events interfere with the learning performance.

7 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Journal ArticleDOI
TL;DR: This survey provides an overview of higher-order tensor decompositions, their applications, and available software.
Abstract: This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or $N$-way array. Decompositions of higher-order tensors (i.e., $N$-way arrays with $N \geq 3$) have applications in psycho-metrics, chemometrics, signal processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, and elsewhere. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix singular value decomposition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal component analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative variants of all of the above. The N-way Toolbox, Tensor Toolbox, and Multilinear Engine are examples of software packages for working with tensors.

9,227 citations

Proceedings ArticleDOI
22 Jan 2006
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

7,116 citations

Journal ArticleDOI

6,278 citations

01 Jan 2016
TL;DR: The table of integrals series and products is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
Abstract: Thank you very much for downloading table of integrals series and products. Maybe you have knowledge that, people have look hundreds times for their chosen books like this table of integrals series and products, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. table of integrals series and products is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the table of integrals series and products is universally compatible with any devices to read.

4,085 citations