IEEE Transactions on Acoustics, Speech, and Signal Processing

Issue 5 • October 1983

Filter Results

Displaying Results 1 - 25 of 42
  • [Front cover and table of contents]

    Publication Year: 1983, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (247 KB)
    Freely Available from IEEE
  • Recursive FIR digital filter design using az-transform on a finite ring

    Publication Year: 1983, Page(s):1155 - 1164
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    Properties of a new complex number-theoretic z-transform (CNT z-transform) over a finite ring are presented here and related to the usual z-transform. Using the Chinese remainder theorem, it is convenient to use finite rings that are isomorphic to the direct sum of finite or Galois fields of the form GF(q2) where q is a Mersenne prime. Many properties of the usual z-transform are preser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient inversion of Toeplitz-block Toeplitz matrix

    Publication Year: 1983, Page(s):1218 - 1221
    Cited by:  Papers (60)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    An iterative algorithm for the inversion of a Toeplitz-block Toeplitz matrix consisting of m × m blocks of size p × p is described. The algorithm presented exploits the structure of the Toeplitz-block Toeplitz matrix and outperforms Akaike's algorithm by a factor ofmax {2(p/m), 2}. The use of this algorithm for an iterative solution of a Toeplitz-block Toeplitz set of linear e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast Kalman filter for images degraded by both blur and noise

    Publication Year: 1983, Page(s):1248 - 1256
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1683 KB)

    In this paper a fast Kalman filter is derived for the nearly optimal recursive restoration of images degraded in a deterministic way by blur and in a stochastic way by additive white noise. Straightforwardly implemented optimal restoration schemes for two-dimensional images degraded by both blur and noise create dimensionality problems which, in turn, lead to large storage and computational requir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • C-matrix transform

    Publication Year: 1983, Page(s):1304 - 1307
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB)

    An approximation to the discrete cosine transform (DCT), called the C-matrix transform (CMT), has been developed by Jones et al. [3] for N = 8. This is extended to N = 16 and 32 and its performance is compared with the DCT based on some standard criteria. CMT is computationally simpler as it involves only integer arithmetic. It has potential in signal processing applications because of its closene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A two-parameter class of Bessel weightings for spectral analysis or array processing--The ideal weighting-window pairs

    Publication Year: 1983, Page(s):1309 - 1312
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    A unified theory for array processing in 1, 2, or 3 dimensions is pointed out and illustrated by a two-parameter class of Bessel weightings. This class subsumes theI_{0}-sinhweighting-window pair as well as the ideal space factor of van der Maas in one dimension. The weightings that realize the ideal space factor in 2 and 3 dimensions are generalized functions more singular than the del... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments and corrections on the use of polar sampling theorems in CT

    Publication Year: 1983, Page(s):1329 - 1331
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB)

    In two recent papers, an exact polar interpolation formula was used to reconstruct computer tomography (CT) imagery by a procedure known as direct Fourier transform inversion. The resulting imagery compared favorably to CT imagery reconstructed by filtered convolution back projection. Strictly speaking, however, the interpolation formula was inappropriately used since it is valid only for an odd n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back cover]

    Publication Year: 1983, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (611 KB)
    Freely Available from IEEE
  • Periodic sampling of broad-band sparse spectra

    Publication Year: 1983, Page(s):1317 - 1319
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Shannon's theorem is generalized to broad-band sparse spectra. As they consist of a finite number of isolated bands, they can be sampled without aliasing and without an antialiasing filter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast convergence frequency domain adaptive filter

    Publication Year: 1983, Page(s):1312 - 1314
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    This correspondence presents a new fast convergence algorithm for frequency domain adaptive filter and its applicability to acoustic noise cancellation in speech signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal reconstruction from signed Fourier transform magnitude

    Publication Year: 1983, Page(s):1286 - 1293
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    In this paper, we show that a one-dimensional or multidimensional sequence is uniquely specified under mild restrictions by its signed Fourier transform magnitude (magnitude and 1 bit of phase information). In addition, we develop a numerical algorithm to reconstruct a one-dimensional or multidimensional sequence from its Fourier transform magnitude. Reconstruction examples obtained using this alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separation of superimposed signals by a cross-correlation method

    Publication Year: 1983, Page(s):1084 - 1089
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    An approach is presented for separating a superposition of delayed finite-duration signals, with unknown gains and delays, which overlap both in the time and frequency domains. The method is partly based on the cross-correlations among the signals and some of their derivatives. Given the data, an initial detection scheme formulates hypotheses on signals which may be present in the mixture, and pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of two-channel prediction filtering to the recursive filter design problem

    Publication Year: 1983, Page(s):1169 - 1177
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    We consider the recursive filter design problem for the case where the numerator and denominator polynomials have the same order and represent the problem in the context of two-channel prediction filtering. A new method of solution is then obtained by applying Strand's two-channel extension of the Burg scheme. The new method is shown to yield a stable recursive filter while providing an improvemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of an FFT-based voice coding system in quiet and noisy environments

    Publication Year: 1983, Page(s):1323 - 1327
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    This paper describes a 2400 bit/s vocoder based on spectral envelope estimation, spectral coding to 48 bits, pitch extraction, and decreasing-chirp excitation for voiced synthesis. Several spectral smoothing and coding schemes are described and intelligibility test results compared. This vocoder was implemented on the CSP-30 high speed digital processor at the RADC/EEV Speech Processing Research a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fully recursive filter: A general 2-D recursive filter

    Publication Year: 1983, Page(s):1327 - 1329
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    The conventional 2-D recursive filter can be thought of as performing a linear combination of 1-D filterings on past and present input and output data rows. All of these component 1-D filters are FIR except for that of the current output row. In a fully recursive filter all the component 1-D filters are IIR. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic inversion of Fisher's information matrix for delay, delay rate, and higher derivatives

    Publication Year: 1983, Page(s):1307 - 1309
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Fisher's information matrix for delay (which corresponds to range), Doppler (range rate), and higher derivatives was recently presented by Schultheiss and Weinstein [1], [2]. Its inverse, which provides a lower bound on the error covariance matrix, was obtained numerically by them. An analytic inversion is presented here. It applies to the case of one reference signal (single-frequency) and one re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum localization of multiple sources by passive arrays

    Publication Year: 1983, Page(s):1210 - 1217
    Cited by:  Papers (100)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The maximum likelihood (ML) estimator of the location of multiple sources and the corresponding Cramer-Rao lower bound on the error covariance matrix are derived. The derivation is carried out for the general case of correlated sources so that multipath propagation is included as a special case. It is shown that the ML processor consists of a bank of beam-formers, each focused to a different sourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Magnitude-only reconstruction of two-dimensional sequences with finite regions of support

    Publication Year: 1983, Page(s):1256 - 1261
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    In this paper, a conceptual algorithm for reconstructing a two-dimensional (2-D) complex-valued finite sequence from an adequate set of samples of the magnitude of its Fourier transform is presented. In particular, one obtains, at least theoretically, all solutions of the 2-D magnitude-only reconstruction problem, provided that the modulus of the DFT is available in a sufficiently large set of poi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings

    Publication Year: 1983, Page(s):1125 - 1134
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    In a recent paper, Dubois and Venetsanopoulos [6] have derived methods for convolving sequences of numbers belonging to a ring S, using number theoretic transforms (NTT's) over an extension ring R of S. In this paper we obtain more explicit expressions for some of their results and, more important, improve the efficiency of their methods. Attention is focused on the case R = S[z]/(P(z)), that is, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The "Unity-lagged" short-time spectrum of a narrow-band Gaussian process

    Publication Year: 1983, Page(s):1100 - 1109
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    A form of the short-time cross-spectrum of a signal with its delayed self is considered. Its statistical and signal-characterizing properties are derived for the case of a narrow-band random Gaussian signal in white Gaussian noise. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the extrapolation of band-limited functions with energy constraints

    Publication Year: 1983, Page(s):1222 - 1234
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    A modification of the algorithm proposed by Papoulis and Gerchberg for extrapolating band-limited functions is suggested to extend its applicability over data corrupted by noise. We assume that energy constraints are known either for the band-limited signal or for the noise. In addition, the discrete formulation of the iterative algorithm is derived, and the transition from the continuous algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speech parameter estimation by time-weighted-error Kalman filtering

    Publication Year: 1983, Page(s):1300 - 1303
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    In this paper, we discuss a method of improving the parameter-tracking performance of the Kalman filter for modeling time-varying signals. The Kalman filter is an effective means of recursively estimating the coefficients of an AR (or ARMA) model; however, its effectiveness is diminished by the weight which the filter gives to the history of the signal. With a view toward improved modeling of spee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast lattice algorithm for PARCOR parameter estimation based on an approximate likelihood

    Publication Year: 1983, Page(s):1319 - 1323
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A new fast algorithm for PARCOR parameter estimation based on an approximate likelihood is proposed. The exact likelihood of AR processes based on the Gaussian assumption is approximated by taking the exponential part only. The criterion is just a modification of that of the prewindowed method by using backward predictions. Then, a fast recursive lattice type algorithm is derived. Its performance ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a single-chip 1-D median filter

    Publication Year: 1983, Page(s):1164 - 1168
    Cited by:  Papers (121)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The design and implementation of a VLSI chip for the one-dimensional median filtering operation is presented. The device is designed to operate on 8-bit sample sequences with a window size of five samples. Extensive pipelining and employment of systolic data-flow concepts at the bit level enable the chip to filter at rates up to ten megasamples per second. A configuration for using the chip for ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to time- and frequency-domain realization of FIR adaptive digital filters

    Publication Year: 1983, Page(s):1073 - 1083
    Cited by:  Papers (107)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    Specific implementations of the finite impulse response (FIR) block adaptive filter in the frequency domain are presented and some of their important properties are discussed. The time-domain block adaptive filter implemented in the frequency domain is shown to be equivalent to the frequency-domain adaptive filter (derived in the frequency domain), provided data sectioning is done properly. All of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

This Transactions ceased production in 1990. The current retitled publication is IEEE Transactions on Signal Processing.

Full Aims & Scope