Browsing DSP Publications by Title
Now showing items 119138 of 508

Effect of Utterance Duration and Phonetic Content on Speaker Identification Usind Second Order Statistical Methods
(19950101)Secondorder statistical methods show very good results for automatic speaker identification in controlled recording conditions. These approaches are generally used on the entire speech material available. In this paper, ... 
Efficient Approximation of Continuous Wavelet Transforms
(19910401)An efficient method, based on the chirpz transform, for computing equally spaced time samples of a continuous wavelet transform at arbitrary scale samples is developed. Applications include efficient computation of samples ... 
Efficient Methods for Identification of Volterra Filters
(19960201)A major drawback of the truncated Volterra series or "Volterra filter" for system identification is the large number of parameters required by the standard filter structure. The corresponding estimation problem requires ... 
Efficient Solution of a ToeplitzPlusHankel Coefficient Matrix System of Equations
(19800501)Frequently in signal processing one is faced with situations where a large system of linear equations, with a Toeplitz or a Hankel coefficient matrix, needs to be solved. One efficient way of solving these kinds of equations ... 
Efficient VLSI Architectures for Baseband Signal Processing for Wireless BaseStation Receivers
(20000720)A realtime VLSI architecture is designed for multiuser channel estimation, one of the core baseband processing operations in wireless basestation receivers. Future wireless basestation receivers will need to use ... 
Efficient VLSI architectures for multiuser channel estimation in wireless basestation receivers
(20020620)This paper presents a reducedcomplexity, fixedpoint algorithm and efficient realtime VLSI architectures for multiuser channel estimation, one of the core baseband processing operations in wireless basestation receivers ... 
EIGENVALUE ANALYSIS FOR SOURCE DETECTION WITH NARROWBAND PASSIVE ARRAYS
(1987)Knowing the number of sources in the acoustic field of a narrowband passive array can be very useful when determining the bearing of these sources relative to the array; many of the "high resolution" bearing estimation ... 
The Embedded Triangles Algorithm for Distributed Estimation in Sensor Networks
(20030901)We propose a new iterative distributed estimation algorithm for Gaussian hidden Markov graphical models with loops. We decompose a loopy graph into a number of linked <i>embedded triangles</i> and then apply a parallel ... 
Empirical Mode Decomposition Based Frequency Attributes
(19991101)This paper describes a new technique, called <i>Empirical Mode Decomposition</i> (EMD), which allows the decomposition of onedimensional signals into intrinsic oscillatory modes. Each component, called <i>Intrinsic Mode ... 
Enhanced Pseudo Power Signatures for Nonstationary Signal Classification: The Projector Approach
(19990501)The classification of nonstationary signals of unknown duration is of great importance in areas like oil exploration, moving target detection, and pattern recognition. In an earlier work, we provided a solution to this ... 
Enhanced signatures for event classification: The projector approach
(19981001)The classification of nonstationary signals of unknown duration is of great importance in areas like oil exploration, moving target detection, and pattern recognition. In an earlier work, we provided a solution to this ... 
Enhancement of Decompressed Images at Low Bit Rates
(19940720)Transform coding at low bit rates introduces artifacts associated with the basis functions of the transform. For example, decompressed images based on the DCT (discrete cosine transform) like JPEG<sup>16</sup>  exhibit ... 
Equivalence of Generalized Joint Signal Representations of Arbitrary Variables
(19961220)Joint signal representations (JSRs) of arbitrary variables generalize timefrequency representations (TFRs) to a much broader class of nonstationary signal characteristics. Two main distributional approaches to JSRs of ... 
The Equivalent Circuit Concept: The CurrentSource Equivalent
(20030520)The equivalent circuit concept derives from the Superposition Principle and Ohm's Law. Two forms of the equivalent circuit, the Thevenin equivalent and the Norton equivalent, distill any linear circuit into a source and ... 
EstimationQuantization Geometry Coding Using Normal Meshes
(20030301)We propose a new algorithm for compressing threedimensional triangular mesh data used for representing surfaces. We apply the EstimationQuantization (EQ) algorithm originally designed for still image compression to the ... 
Examining methods for estimating mutual information in spiking neural systems
(20050601)Mutual information enjoys wide use in the computational neuroscience community for analyzing spiking neural systems. Its direct calculation is difficult because estimating the joint stimulusresponse distribution requires ... 
Exceptions to the Multifractal Formalism for Discontinuous Measures
(19980115)In an earlier paper the authors introduced the <i>inverse measure</i> <i>Âµ</i><sup>â </sup>(<i>dt</i>) of a given measure <i>Âµ</i>(<i>dt</i>) on [0,1] and presented the 'inversion formula' <i>f</i><sup>â </sup>(<i>a</i>) ... 
Exchange Algorithms that Complement the ParksMcClellan Algorithm for Linear Phase FIR Filter Design
(19970201)This paper describes an exchange algorithm for the frequency domain design of linear phase FIR equiripple filters where the Chebyshev error in each band is specified. The algorithm is a hybrid of the algorithm of Hofstetter, ... 
Explicit Lower Bounds of the Hausdorff Dimension of Certain Self Affine Sets
(19950120)A lower bound of the Hausdorff dimension of certain selfaffine sets is given. Moreover, this and other known bounds such as the box dimension are expressed in terms of solutions of simple equations involving the singular ... 
Extending Winograd's Small Convolution Algorithm to Longer Lengths
(19940115)For short data sequences, Winograd's convolution algorithms attaining the minimum number of multiplications also attain a low number of additions, making them very efficient. However, for longer lengths they require a ...