Du är här

Implementation of a Highly Scalable Architecture for Fast Inversion of Triangular Matrices

Publiceringsår: 2003
Språk: Engelska
Sidor: 1137-1140
Dokumenttyp: Konferensbidrag

Sammanfattning

In this paper, an F'F'GA implementation of a novel and
highly scalable hardware architecture for fast inversion of
triangular matrices is presented. An integral part of
modem signal processing and communications
applications involves manipulation of large matrices.
Therefore, scalable and flexible hardware architectures
are increasingly sought for. In this paper, the traditional
triangular shaped array architecture with n(n+1)/2
communicating processors, with n being the number of
inputs, is mapped to a linear structure with only n
processors, The linear and the triangular shaped
architectures are compared in aspect of area consumption,
latencies, and maximum clocking speed. This paper also
show that the linear array structure avoids drawhacks such
as non-scalability, large area, and large power
consumption. The implementation is based on a
numerically stahle recurrence algorithm, which has
excellent properties for hardware implementation.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

IEEE International Conference on Electronics, Circuits, and Systems (ICECS)
Sharjah, United Arab Emirates
Published
Yes

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen

LERU logo U21 logo