In this paper, recursive VLSI designs for the inversion of nonsingular matrices and determinant computation are presented. The VLSI network for the inversion requires a time T = O (n log n) and an area A = O (n?2log?3n), matching the area x (time)?2 lower bound up to logarithmic factors. The same complexity is attained by the network for the computation of the determinant.

VLSI computation of the inverse and the determinant of a matrix

Codenotti B;
1984

Abstract

In this paper, recursive VLSI designs for the inversion of nonsingular matrices and determinant computation are presented. The VLSI network for the inversion requires a time T = O (n log n) and an area A = O (n?2log?3n), matching the area x (time)?2 lower bound up to logarithmic factors. The same complexity is attained by the network for the computation of the determinant.
1984
Istituto di informatica e telematica - IIT
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
VLSI design
Area-time complexity
Matrix inversion
Determinant computation
File in questo prodotto:
File Dimensione Formato  
prod_420453-doc_149026.pdf

accesso aperto

Descrizione: VLSI computation of the inverse and the determinant of a matrix
Dimensione 883.35 kB
Formato Adobe PDF
883.35 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/373144
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact