A new deflected stochastic-gradient algorithm for adaptive sensor arrays is introduced. It is shown to have the capability of converging substantially faster than the nondeflected stochastic gradient (LMS) algorithm b...
详细信息
A new deflected stochastic-gradient algorithm for adaptive sensor arrays is introduced. It is shown to have the capability of converging substantially faster than the nondeflected stochastic gradient (LMS) algorithm but slower than the recursive least squares (RLS) algorithm. Because of its amenability to reduction of computational complexity by data quantization, it has the potential for processing digital signals with bandwidths one to two orders of magnitude larger than the bandwidths manageable with the RLS algorithm for sensor arrays containing a number of adjustable weights in the approximate range of 10-50.
The importance of the concept of cyclostationarity in design and analysis of signal detectors, synchronizers, and extractors in communication systems is briefly discussed, and the central role of spectral correlation,...
详细信息
The importance of the concept of cyclostationarity in design and analysis of signal detectors, synchronizers, and extractors in communication systems is briefly discussed, and the central role of spectral correlation, in the characterization of random processes that are cyclostationary in the wide sense, is explained. A spectral correlation function that is a generalization of the power spectral density function is described, and a corresponding generalization of the Wiener-Khinchine relation and several other fundamental spectral correlation relations also are described. Explicit formulas for the spectral correlation function for various types of analog-modulated signals are derived. This includes pulse and carrier amplitude modulation, quadrature amplitude carrier modulation, and phase and frequency carrier modulation. To illustrate the differing spectral correlation characteristics of different modulation types, the magnitudes of the spectral correlation functions are graphed or described in graphical terms as the heights of surfaces above a bifrequency plane.
As a continuation of Part I, the spectral correlation function is presented for a variety of types of digitally modulated signals. These include digital pulse-amplitude, pulse-width, and pulse-position modulation, and...
详细信息
As a continuation of Part I, the spectral correlation function is presented for a variety of types of digitally modulated signals. These include digital pulse-amplitude, pulse-width, and pulse-position modulation, and various types of phase-shift keying and frequency-shift keying. The magnitudes of the spectral correlation functions are graphed as the heights of surfaces above a bifrequency plane, and these graphs are used as visual aids for comparison and contrast of the spectral correlation properties of different modulation types.
Upper and lower bounding first-order linear recursions for the mean-squared error realized with the LMS algorithm subjected to a sequence of independent nonstationary training vectors are derived. These bounds coincid...
详细信息
Upper and lower bounding first-order linear recursions for the mean-squared error realized with the LMS algorithm subjected to a sequence of independent nonstationary training vectors are derived. These bounds coincide to give the exact evolution of mean-squared error for the problem of identification of a nonrecursive time-varying system with white-noise excitation. This leads to an exact formula for time-averaged mean-squared error that is used to study optimization of the step-size parameter for minimum time-average misadjustment. New results on dependence of the minimal step size and the minimum misadjustment on the degree of nonstationarity are obtained.
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Four...
详细信息
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses fewer operations than any other real-valued power-of-2-length FFT. We also compare the performance of inherently real-valued transform algorithms such as the fast Hartley transform (FHT) and the fast cosine transform (FCT) to real-valued FFT algorithms for the computation of power spectra and cyclic convolutions. Comparisons of these techniques reveal that the alternative techniques always require more additions than a method based on a real-valued FFT algorithm and result in computer code of equal or greater length and complexity.
This paper discusses the relationship between the zero crossings or zeros of band-limited signals and their nonlinear transformations. It is proved that the bandwidth of a signal can be compressed by a ratio of 1/ n i...
详细信息
This paper discusses the relationship between the zero crossings or zeros of band-limited signals and their nonlinear transformations. It is proved that the bandwidth of a signal can be compressed by a ratio of 1/ n if and only if the signal has n th-order zero crossings or zeros (if complex). Also, a monotonic nonlinearity in the observation of a band-limited signal can be identified from the zero crossings (or zeros) of the derivative of the observed signal. (The results are for one-dimensional signals. Extensions to two-dimensional signals remain to be addressed.)
The concept of fast KL transform coding introduced earlier [7], [8] for first-order Markov processes and certain random fields has been extended to higher order autoregressive (AR) sequences and practical images yield...
详细信息
The concept of fast KL transform coding introduced earlier [7], [8] for first-order Markov processes and certain random fields has been extended to higher order autoregressive (AR) sequences and practical images yielding what we call recursive block coding (RBC) algorithms. In general, the rate-distortion performance for these algorithms is significantly superior to that of the conventional block KL transform algorithm. Moreover, these algorithms permit the use of small size transforms, thereby removing the need for fast transforms and making the hardware implementation of such coders more appealing. This improved performance has been verified for practical image data and results in suppression of the block-boundary effect commonly observed in traditional transform coding techniques. This is illustrated by comparing RBC with cosine transform coding using both one- and twodimensional algorithms. Examples of RBC encoded images at various rates are given.
Although the magnitude of the discrete Fourier transform of a maximal-length shift-register sequence is flat, except for its value at zero frequency, the higher resolution spectral content given by the Fourier-series ...
详细信息
Although the magnitude of the discrete Fourier transform of a maximal-length shift-register sequence is flat, except for its value at zero frequency, the higher resolution spectral content given by the Fourier-series transform is highly erratic. This little-known fact is described, and its ramifications on fast Fourier transforms of one-digit-extended pseudo noise and zero-padded pseudo noise are explained.
The popular class of synchronizers that consist of a quadratic nonlinearity followed by a phase-lock loop is investigated, and it is shown that the optimum design of the quadratic transformation is characterized in te...
详细信息
The popular class of synchronizers that consist of a quadratic nonlinearity followed by a phase-lock loop is investigated, and it is shown that the optimum design of the quadratic transformation is characterized in terms of a spectral correlation function for the signal to be synchronized to. It is also shown that the SNR performance of this quadratic transformation, and the mean-square phase jitter of the phaselock loop are both characterized in terms of spectral correlation functions. The conditions under which the optimum quadratic transformations, for symbol synchronization of BPSK, QPSK, SQPSK, and MSK, and for carrier synchronization of BPSK, reduce to the well-known matched-filter-squarer are identified. In addition, the well-known zeromean-square-phase-jitter condition is generalized from PAM to all synchronizable signals, and is characterized in terms of the spectral correlation function. The low-SNR maximum-likelihood synchronizer for all quadratically synchronizable signals is characterized in terms of a multiplicity of maximum-SNR quadratic spectral-line generators. A closed form implementation in terms of a matched filter, squarer, and symbol-rate-synchronized averager is obtained for BPSK and QPSK signals.
A new algorithm for ray tracing parametric surface patches is presented. The method uses quasi-Newton iteration to solve for the ray/surface intersection and utilizes ray-to-ray coherence by using numerical informatio...
详细信息
暂无评论