VLSI structures and iterative analysis for large-scale computation

Thesis/Dissertation · Wed Jan 01 04:00:00 EST 1986

OSTI ID:5233105

Papadopoulou, E P

Problems of computation and development of VLSI structures are considered in relation to each other. In particular, two issues are addressed: (a) development of components and algorithms for standard operations, suitable for VLSI implementation; (b) large-scale computation, in this case the iterative solution of large least-square problems in a limited-size VLSI architecture. On standard operations, improved and new adders are presented that can be implemented in VLSI. The adders so designed are shown to be superior when compared to other existing ones. Moreover, an iterative multiplier that uses carry save adders is also presented. On large-scale computation, analysis of iterative techniques for least-squares problems is first addressed. New convergence results are obtained and explicit expressions, for the optimal parameters as well as for their corresponding optimal asymptotic rate of convergence are derived for the family of iterative schemes known as Accelerated Overrelaxation (AOR). Moreover, partitioning of the iterative algorithm and time-space expansion are used so that a parallel implementation of the iterative scheme is obtained, in a way that computation can be performed, in a fixed-size VLSI architecture, independent of the size of the problem.

• Research Organization: Clarkson Univ., Potsdam, NY (USA)
• OSTI ID: 5233105
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTER ARCHITECTURE
CONVERGENCE
ELECTRONIC CIRCUITS
IMPLEMENTATION
INTEGRATED CIRCUITS
ITERATIVE METHODS
MATHEMATICAL LOGIC
MICROELECTRONIC CIRCUITS
PARALLEL PROCESSING
PROGRAMMING