Showing papers in "Signal Processing in 1983"

TL;DR: In this article, a modification of LPC, called time-varying LPC is proposed, which can be used to analyze nonstationary speech signals, where the coefficients of the linear combination of functions are obtained by the same least squares error technique used by the LPC.

TL;DR: It is shown how the approach using eigenfilters relates to Laws' approach and to the co-occurrence matrix approach.

TL;DR: It is shown that most of the commonly used features (mean value, energy, autocorrelation function, DFT, Z-transform, entropy, etc.) satisfy these analytic expressions.

TL;DR: In this article, a thorough analysis of the so-called impossible figures phenomenon is attempted, in which the notion of an impossible figure and some other related phenomena (e.g., "likely" and "unlikely" figures) are precisely defined and analyzed.

TL;DR: It is shown in this paper that the classical Parks-McClellan program can be converted into a general program for constrained approximation, which can serve for the design of both linear and minimum phase FIR digital filters.

TL;DR: Several sampling representations for bandlimited and non-bandlimeted functions and their derivatives, as well as of the Hilbert transform and its derivatives are established in this paper, where the results are deduced from a general theorem which in turn is a consequence of the Parseval formula for Fourier series.

TL;DR: First the general problem of block matrix inversion and linear system solution is considered and a corresponding algorithm is developed, together with a block form of triangularization theorem, yielding most existing efficient algorithms.

TL;DR: The algorithm is fast since it works in one pass through the given data and it does not require much memory space, and the peak points are preserved and become corners of the resulting piecewise linear curve.

TL;DR: An approximation to the discrete cosine transform (DCT) called the C -matrix transform (CMT) has been developed by Jones et al. as mentioned in this paper for N = 8 and its performance is compared with the DCT based on some standard criteria.

TL;DR: An exact definition of linear discrete-time systems is suggested which covers all linear systems used in practice and is shown that the proof of the fundamental theorem of stability from [1,2] is incomplete and it is given correct.

TL;DR: A smoothness optimization approach to the nonlinear smoothing problem, based on a criterion for the overall smoothness of the curve, optimized by a dynamic programming strategy, which turns out to be computationally attractive.

TL;DR: In this paper, a local feature operator was used to reduce the incoming grey-level image to a feature image yielding high feature values for the flaws (shrink-holes) and low values for most of the regular regions of the test piece.

TL;DR: In this paper, the orthogonality of branches with a common root is shown to be necessary and sufficient for the overall transform to be orthogonal. But this condition is only applicable to tree structures.

TL;DR: In this paper, the authors derived a coherent theory on a signal representation in an instantaneous frequency vs. time plane by switching the frequency axis from a fixed axis to an instantaneous frequency axis and distributing the energy of the signal on the time plane.

TL;DR: A comparison test involving various quantizing strategies demonstrated the efficiency of the developed techniques, especially with regard to adaptive quantization with 11 levels per picture element, suitable for the transmission of broad-band TV-signals with 34 Mbits/s.

TL;DR: In this paper, the authors considered the problem of finding the optimum signal estimate that is constrained to lie in a given linear subspace, defined in the sense of weighted mean square error.

TL;DR: Three optimization problems concerning the maximization of the signal-to-interference ratio for a doubly spread target via signal design are expressed in terms of equivalent nonlinear programming problems defined on a real space by restricting the transmit and processing waveforms to be complex weighted, uniformly spaced pulse trains.

TL;DR: One important advantage of this approach is that the optimization of the window coefficients is reduced to the proper selection of one single parameter which in a monotonic manner controls the trade-off between the two relevant window features mainlobe width and sidelobe level.

TL;DR: In this article, a method for performing the two-dimensional Hadamard transformation is presented, which is based on a fast hadamard algorithm as used in digital data processing.

TL;DR: The instrument described here is a multi-parameter micro-processor controlled flow system built at the laboratory and significant improvements to human chromosome analysis and sorting resulting from signal averaging and multi- parameter signal gating are demonstrated.

TL;DR: The TDPA is highly suitable for implementation on a 16-bit microprocessor, since it uses no multiply operations and the computation can be performed in integer arithmetic without exceeding the dynamic range of the microprocessor.

TL;DR: A novel technique for estimating the sampled impulse-response of a time-varying channel, where the latter involves an HF radio link with two independent Rayleigh fading sky waves, which obtains a more accurate estimate than that given by more conventional techniques.

TL;DR: A machine vision system for automatic inspection of keyboards verifies that each location on a keyboard contains the correct, properly oriented key and that the graphics are not badly distorted.

TL;DR: The paper is mainly concerned with emphasizing the influence of the finite sample number upon the final error of the mean value of the RRQ output.

TL;DR: This paper deals with the question, up to which bit the result of a calculation can be considered as being correct with a certain probability, if in addition the probability density function of the error is known.

TL;DR: A method is proposed for accessing the inside of outlined contours so as to evaluate density features of the contoured regions while measuring their perimeter and area, which requires a much smaller amount of main memory, yet remaining fast enough for many purposes.

TL;DR: In this paper, a preliminary investigation of the possibility of classifying flaws in the inner surfaces of steam-generator tubes scanned in a helical path by a rotating eddy-current probe is reported.