Richard G. Lyons
Bio: Richard G. Lyons is an academic researcher from San Diego State University. The author has contributed to research in topics: Digital signal processing & Filter design. The author has an hindex of 11, co-authored 40 publications receiving 1838 citations. Previous affiliations of Richard G. Lyons include Portland State University & University of Nantes.
01 Nov 1996
TL;DR: In this article, the author covers the essential mathematics by explaining the meaning and significance of the key DSP equations, and the book will help to achieve a thorough grasp of the basics and move gradually to more sophisticated DSP concepts and applications.
Abstract: From the Publisher: This is undoubtedly the most accessible book on digital signal processing (DSP) available to the beginner. Using intuitive explanations and well-chosen examples, this book gives you the tools to develop a fundamental understanding of DSP theory. The author covers the essential mathematics by explaining the meaning and significance of the key DSP equations. Comprehensive in scope, and gentle in approach, the book will help you achieve a thorough grasp of the basics and move gradually to more sophisticated DSP concepts and applications.
01 Jan 2007
TL;DR: An alternative method for nonstandard filter design has been described, which recasts the filter design problem as a minimization problem and solves the minimization via the DE minimizer.
Abstract: This chapter contains sections titled: Recasting Filter Design as a Minimization Problem Minimization with Differential Evolution A Differential Evolution Design Example Conclusions References
01 Jan 2007
TL;DR: Several efficient approximations for the arctangent function using Lagrange interpolation and minimax optimization techniques are provided, and they are extended to all four quadrants.
Abstract: 1053-5888/06/$20.00©2006IEEE T his article provides several efficient approximations for the arctangent function using Lagrange interpolation and minimax optimization techniques. These approximations are particularly useful when processing power, memory, and power consumption are important issues. In addition to comparing the errors and the computational workload of these approximations, we also extend them to all four quadrants.
29 May 2012
TL;DR: New, but tried-and-true, clever implementations of digital filter design, spectrum analysis, signal generation, high-speed function approximation, and various other DSP functions are presented.
Abstract: This book presents recent advances in DSP to simplify, or increase the computational speed of, common signal processing operations. The topics describe clever DSP tricks of the trade not covered in conventional DSP textbooks. This material is practical, real-world, DSP tips and tricks as opposed to the traditional highly-specialized, math-intensive, research subjects directed at industry researchers and university professors. This book goes well beyond the standard DSP fundamentals textbook and presents new, but tried-and-true, clever implementations of digital filter design, spectrum analysis, signal generation, high-speed function approximation, and various other DSP functions.
TL;DR: This article describes a general discrete-signal network that appears, in various forms, inside many digital signal processing (DSP) applications and illustrates its fundamental strength: its ability to be reconfigured to perform a surprisingly large number of useful functions based on the values of its seven control parameters.
Abstract: This article describes a general discrete-signal network that appears, in various forms, inside many digital signal processing (DSP) applications. So the "DSP Tip" for this column is for every DSP engineer to become acquainted with this network. We show how the network's structure has the distinct look of a digital filter, a comb filter followed by a second-order recursive network. However, we do not call this unique general network a filter because its capabilities extend far beyond simple filtering. Through a series of examples, we illustrate the fundamental strength of the network: its ability to be reconfigured to perform a surprisingly large number of useful functions based on the values of its seven control parameters.
TL;DR: A detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far are presented.
Abstract: Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational steps as employed by a standard evolutionary algorithm (EA). However, unlike traditional EAs, the DE-variants perturb the current-generation population members with the scaled differences of randomly selected and distinct population members. Therefore, no separate probability distribution has to be used for generating the offspring. Since its inception in 1995, DE has drawn the attention of many researchers all over the world resulting in a lot of variants of the basic algorithm with improved performance. This paper presents a detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far. Also, it provides an overview of the significant engineering applications that have benefited from the powerful nature of DE.
TL;DR: In this article, the capacity limit of fiber-optic communication systems (or fiber channels?) is estimated based on information theory and the relationship between the commonly used signal to noise ratio and the optical signal-to-noise ratio is discussed.
Abstract: We describe a method to estimate the capacity limit of fiber-optic communication systems (or ?fiber channels?) based on information theory. This paper is divided into two parts. Part 1 reviews fundamental concepts of digital communications and information theory. We treat digitization and modulation followed by information theory for channels both without and with memory. We provide explicit relationships between the commonly used signal-to-noise ratio and the optical signal-to-noise ratio. We further evaluate the performance of modulation constellations such as quadrature-amplitude modulation, combinations of amplitude-shift keying and phase-shift keying, exotic constellations, and concentric rings for an additive white Gaussian noise channel using coherent detection. Part 2 is devoted specifically to the "fiber channel.'' We review the physical phenomena present in transmission over optical fiber networks, including sources of noise, the need for optical filtering in optically-routed networks, and, most critically, the presence of fiber Kerr nonlinearity. We describe various transmission scenarios and impairment mitigation techniques, and define a fiber channel deemed to be the most relevant for communication over optically-routed networks. We proceed to evaluate a capacity limit estimate for this fiber channel using ring constellations. Several scenarios are considered, including uniform and optimized ring constellations, different fiber dispersion maps, and varying transmission distances. We further present evidences that point to the physical origin of the fiber capacity limitations and provide a comparison of recent record experiments with our capacity limit estimation.
TL;DR: Numerical results show that, among the algorithms considered in this study, the most efficient additional components in a DE framework appear to be the population size reduction and the scale factor local search.
Abstract: Differential Evolution (DE) is a simple and efficient optimizer, especially for continuous optimization. For these reasons DE has often been employed for solving various engineering problems. On the other hand, the DE structure has some limitations in the search logic, since it contains too narrow a set of exploration moves. This fact has inspired many computer scientists to improve upon DE by proposing modifications to the original algorithm. This paper presents a survey on DE and its recent advances. A classification, into two macro-groups, of the DE modifications is proposed here: (1) algorithms which integrate additional components within the DE structure, (2) algorithms which employ a modified DE structure. For each macro-group, four algorithms representative of the state-of-the-art in DE, have been selected for an in depth description of their working principles. In order to compare their performance, these eight algorithm have been tested on a set of benchmark problems. Experiments have been repeated for a (relatively) low dimensional case and a (relatively) high dimensional case. The working principles, differences and similarities of these recently proposed DE-based algorithms have also been highlighted throughout the paper. Although within both macro-groups, it is unclear whether there is a superiority of one algorithm with respect to the others, some conclusions can be drawn. At first, in order to improve upon the DE performance a modification which includes some additional and alternative search moves integrating those contained in a standard DE is necessary. These extra moves should assist the DE framework in detecting new promising search directions to be used by DE. Thus, a limited employment of these alternative moves appears to be the best option in successfully assisting DE. The successful extra moves are obtained in two ways: an increase in the exploitative pressure and the introduction of some randomization. This randomization should not be excessive though, since it would jeopardize the search. A proper increase in the randomization is crucial for obtaining significant improvements in the DE functioning. Numerical results show that, among the algorithms considered in this study, the most efficient additional components in a DE framework appear to be the population size reduction and the scale factor local search. Regarding the modified DE structures, the global and local neighborhood search and self-adaptive control parameter scheme, recently proposed in literature, seem to be the most promising modifications.
TL;DR: In this article, a tutorial on Hilbert transform applications to mechanical vibration is presented, with a large number of examples devoted to illustrating key concepts on actual mechanical signals and demonstrating how the Hilbert transform can be taken advantage of in machine diagnostics, identification of mechanical systems and decomposition of signal components.
Abstract: This paper is a tutorial on Hilbert transform applications to mechanical vibration. The approach is accessible to non-stationary and nonlinear vibration application in the time domain. It thrives on a large number of examples devoted to illustrating key concepts on actual mechanical signals and demonstrating how the Hilbert transform can be taken advantage of in machine diagnostics, identification of mechanical systems and decomposition of signal components.
TL;DR: The finding suggests that the early-evoked gamma band response to auditory stimuli is deficiently synchronized in schizophrenia, and is to be reconciled with prior studies that failed to find this effect.
Abstract: An increasing number of schizophrenia studies have been examining electroencephalography (EEG) data using time-frequency analysis, documenting illness-related abnormalities in neuronal oscillations and their synchronization, particularly in the gamma band. In this article, we review common methods of spectral decomposition of EEG, time-frequency analyses, types of measures that separately quantify magnitude and phase information from the EEG, and the influence of parameter choices on the analysis results. We then compare the degree of phase locking (ie, phase-locking factor) of the gamma band (36-50 Hz) response evoked about 50 milliseconds following the presentation of standard tones in 22 healthy controls and 21 medicated patients with schizophrenia. These tones were presented as part of an auditory oddball task performed by subjects while EEG was recorded from their scalps. The results showed prominent gamma band phase locking at frontal electrodes between 20 and 60 milliseconds following tone onset in healthy controls that was significantly reduced in patients with schizophrenia (P = .03). The finding suggests that the early-evoked gamma band response to auditory stimuli is deficiently synchronized in schizophrenia. We discuss the results in terms of pathophysiological mechanisms compromising event-related gamma phase synchrony in schizophrenia and further attempt to reconcile this finding with prior studies that failed to find this effect.