By Topic

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

Issue 10 • Date Oct. 1992

Filter Results

Displaying Results 1 - 10 of 10
  • Comments on "A neural net approach to discrete Hartley and Fourier transforms" by A.D. Culhane et al

    Publication Year: 1992 , Page(s): 756 - 757
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB)  

    By exploiting the structure and the dynamics of a neural net proposed recently for the computation of the discrete Fourier transform (DFT), it is shown to be possible to reduce the neural net given in the above-titled paper (see ibid., vol.36, no.5, p. 695-703, 1989) to a statical conductor array followed by a single row of Hopfield nets with local feedback only. Some modification is also described for better practical implementation. The modified circuit will compute the discrete Hartley transform with the same precision as claimed in the above-titled paper, while at the same time achieve structural modularity which is required to design chips for transforming a large number of samples.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-reuse architecture for gray-scale morphologic operations

    Publication Year: 1992 , Page(s): 753 - 756
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (272 KB)  

    Presents an efficient pipeline architecture to perform gray-scale morphologic operations. The features of the architecture are 1) lower hardware cost, 2) faster operation time in processing an image, 3) lower data access times from the image memory, 4) shorter latency, 5) suitability for VLSI implementation, and 6) adaptability for N×N morphologic operations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The efficient memory-based VLSI array designs for DFT and DCT

    Publication Year: 1992 , Page(s): 723 - 733
    Cited by:  Papers (47)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (836 KB)  

    Efficient memory-based VLSI arrays and a new design approach for the discrete Fourier transform (DFT) and discrete cosine transform (DCT) are presented. The DFT and DCT are formulated as cyclic convolution forms and mapped into linear arrays which characterize small numbers of I/O channels and low I/O bandwidth. Since the multipliers consume much hardware area, the designs utilize small ROMs and adders to implement the multiplications. Moreover, the ROM size can be reduced effectively by arranging the data in the designs appropriately. The arrays outperform others in the architectural topology (local and regular connection), computing speeds, hardware complexity, the number of I/O channels, and I/O bandwidth. They benefit from the advantages of both systolic array and the memory-based architectures View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new adaptive noise cancellation scheme in the presence of crosstalk [speech signals]

    Publication Year: 1992 , Page(s): 681 - 694
    Cited by:  Papers (16)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (748 KB)  

    The application of adaptive filters in noise canceling often requires the relative placement of the two transducers at a distance that necessitates a larger order filter in order to obtain an adequate output signal-to-noise ratio. A new adaptive filter structure is introduced that permits a closer placement of the transducers and that allows the cancellation of noise in the presence of crosstalk. Algorithms are developed for the new transversal and lattice filter estimators. Simulations show considerable improvement in mean-square error over that obtained with standard noise canceling algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient method for the evaluation of the controllability and observability Gramians of 2D digital filters and systems

    Publication Year: 1992 , Page(s): 695 - 704
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (644 KB)  

    An efficient and general method for the evaluation of the Gramians of causal, stable, 2D recursive digital filters and systems is proposed. The method is based on a two-stage extension of the Astrom-Jury-Agniel algorithm which was originally used for the evaluation of the scalar loss function of a stationary random process with rational spectral density. The new method is compared with other known methods for the evaluation of 2D Gramians with respect to accuracy and computational efficiency. The results obtained show that the new method leads to an accurate evaluation of the 2D Gramians and, furthermore, it requires only a small fraction of the computation required by existing methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability of the DPCM transmission system

    Publication Year: 1992 , Page(s): 705 - 722
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1240 KB)  

    Bounded input-bounded output stability of the differential pulse code modulation (DPCM) transmission system is investigated. The output is calculated by a nonlinear feedback loop. In the feedforward path the quantizer characteristic can be taken as continuous. It exhibits a threshold and has a linear part with a variable slope p greater than 1. In the feedback path the linear filter R is recursive. Stability of R is sufficient but not necessary to ensure stability of the DPCM system. Conditions for stability of an order 1 predictor are determined. Comparison with the classical concept of stability for linear systems displays three specific features of the DPCM case: 1) the conditions on the prediction coefficient are less stringent: 2) the kind of stability is weaker; and 3) the negative case has a better stability than the positive case. As a function of the quantizer slope, the maximum prediction coefficient exhibits a maximum. The corresponding value popt delimits two ranges. For smaller slopes the quantizer threshold effect degrades the stability. At the optimum, the range of stability is the same with and without the quantizer threshold View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metastability of CMOS master/slave flip-flops

    Publication Year: 1992 , Page(s): 734 - 740
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (520 KB)  

    Presents circuit techniques to improve the mean time between failures (MTBF) of a latch due to metastable events. The complete approach includes a unique design of the latch and the formation of series connected master/slave (M/S) flip-flops using this latch. An equation is developed to predict the MTBF due to metastability of a single latch and is extended to include single and multiple series connected M/S flip-flops. The equation predicts that the MTBF increases significantly by using such a M/S flip-flop configuration View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spurious signals in digital CMOS VLSI circuits: a propagation analysis

    Publication Year: 1992 , Page(s): 749 - 752
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB)  

    Spurious signals may appear as a result of a variety of causes, such as hazards, crosstalk, and others. These signals may produce transient or even permanent logic errors in digital circuits if they affect memory elements. This work deals with the analysis of the penetration capability and the calculation of the propagation depth of such signals through logic circuits. The results are useful to determine the domain of effect of spurious signals and to point out rules for its detection View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning characteristics of transpose-form LMS adaptive filters

    Publication Year: 1992 , Page(s): 745 - 749
    Cited by:  Papers (11)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB)  

    Transpose-form filter structures have several advantages over direct-form structures for high-speed, parallel implementation of finite impulse response (FIR) filters. Transpose-form least mean square (LMS) adaptive filter architectures are often used in parallel implementations; however, the behavior of these filters differs from the standard LMS algorithm and has not been adequately studied. A method for determining the maximum convergence factor yielding convergence of the mean of the transpose-form LMS adaptive filter taps is developed. The analysis reveals the great similarity of transpose-form LMS adaptive filters to delayed-update LMS adaptive filters, which have been much more fully characterized View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous-time recursive least-squares algorithms

    Publication Year: 1992 , Page(s): 741 - 745
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (440 KB)  

    Two continuous-time recursive least-squares (RLS) algorithms are derived in this work in a unified approach, one for the Gramm-Schmidt orthogonalization (GSO) of multiple signals and the other for the lattice filter with time-shifted data. The GSO algorithm is derived in the continuous-time domain directly in the sense of the exact minimization of integral-squared-error. Then, the lattice algorithm can be obtained by applying the developed GSO to the updates of the forward and backward predictions of time-shifted data. The two algorithms are highly modular and use the same kind of module. Unlike the discrete-time RLS algorithms, no extra parameters are required to link the modules, and each module performs independently a standard order-one continuous-time RLS weight update using its present local information of the inputs and the feedback of the output View full abstract»

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

Aims & Scope

This title ceased production in 2003. The current updated title is IEEE Transactions on Circuits and Systems II: Express Briefs.

Full Aims & Scope