IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

For pt. I, see ibid., vol. 41, no. 10, p. 641-55 (1994). In Part I of the research work, we introduced an extension to the well known Chinese remainder theorem for processing polynomials with coefficients defined over a finite integer ring. We term this extension as the American-Indian-Chinese extension of the Chinese remainder theorem. A systematic procedure for factorizing a monic polynomial int... View full abstract»

The much celebrated Chinese Remainder Theorem has been widely employed in designing fast computationally efficient algorithms in the field of digital signal processing. It has two versions. One is over a ring of integers and the second is over a ring of polynomials with Coefficients defined over a field. In this research work, we extend the Chinese Remainder Theorem to the case of a ring of polyno... View full abstract»

The necessity for an efficient bit-reversal routine in the implementation of fast discrete Fourier transform algorithms is well known. In this paper, we propose a bit-reversal algorithm that reduces the computational effort to an extent that it becomes negligible compared with the data swapping operation for which the bit-reversal is required View full abstract»

This paper presents a novel circuit for parallel bit-level maximum/minimum selection. The selection is based on a label-updating scheme which sequentially scans a set of data patterns from MSB to LSB and generates corresponding labels. The complete circuit realizing this scheme consists of a set of updating units and a global OR unit, where each updating unit is composed of only a few basic gates.... View full abstract»

An orthogonal algorithm is used to design 2-D nonlinear filters which have spatial-domain representations as subsets of the general second-order 2-D nonlinear polynomial. This paper using these polynomial models, introduces a noniterative spatial-domain design technique to find the coefficients of the nonlinear filters. The method makes use of the Minimum Mean-Square Error (MMSE) criterion and all... View full abstract»

Two-dimensional filters with circularly symmetric frequency response find application in isotropic filtering of images. An effective method for designing this class of filters is based on applying the McClellan transformation to a one-dimensional prototype. The requirement of wideband circular symmetry necessitates the use of high-order generalized McClellan transformations, where the transformati... View full abstract»

Recently, unitary FIR filter banks with linear-phase have been completely parameterized by exploiting the eigenstructure of the exchange matrix. This correspondence gives new characterizations of polyphase matrices of filter banks with various types of symmetry on the filters. Using matrix extensions of the well-known hyperbolic and orthogonal lattices, we give a alternative proof for the paramete... View full abstract»

In this paper, a two-dimensional (2-D) nonhomogeneous Gaussian Markov Random Field (GMRF) model is presented and the problem of adaptive parameter estimation for this model is addressed. Two 2-D fast Kalman algorithms are proposed as extensions of the 1-D fast Kalman algorithm, which utilize the shift-invariant and near-to-Toeplitz properties of the coefficient matrix of the normal equation result... View full abstract»