A symmetrizer of a nonsymmetric matrix A is the symmetric matrix X that satisfies the equation XA = A(t)X, where t indicates the transpose. A symmetrizer is useful in converting a nonsymmetric eigenvalue problem into a symmetric one which is relatively easy to solve and finds applications in stability problems in control theory and in the study of general matrices. Three designs based on VLSI parallel processor arrays are presented to compute a symmetrizer of a lower Hessenberg matrix. Their scope is discussed. The first one is the Leiserson systolic design while the remaining two, viz., the double pipe design and the fitted diagonal design are the derived versions of the first design with improved performance.

Computational Aspects of Vlsi

Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays

Bit-serial VLSI sorter with high reliability specifications

LSI‐oriented scanning systems using tree structures

The article deals views one of the options to improve the reliability of automatic control systems through the use of the quality of the circuitry complete functional tolerant look-up table (FCTLUT) with the ability to save original function in case of transistor failure. The authors presentthe analysis of the features offered with FCTLUT elements included in the FPGA for high-reliability applications in the case of restrictions on the length of the sequential chain of transistors. The article has the conclusion about the preference of FCTLUT on the probability of fail-safe operation over triple redundancystructures.

Computational Aspects of Vlsi

Citations

Symmetrizing a Hessenberg matrix: Designs for VLSI parallel processor arrays

Bit-serial VLSI sorter with high reliability specifications

LSI‐oriented scanning systems using tree structures

Configurable Fault Tolerant Logic Elements

Design of fault-tolerant computing systems using real-time performance monitors

Related Papers (5)

Introduction to VLSI systems

The Design and Analysis of Computer Algorithms

Why systolic architectures

Parallel Processing with the Perfect Shuffle

Computers and Intractability: A Guide to the Theory of NP-Completeness