Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination

  • Authors:
  • Kedarnath J. Balakrishnan;Nur A. Touba

  • Affiliations:
  • University of Texas at Austin;University of Texas at Austin

  • Venue:
  • Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A methodology for designing a reconfigurable linear decompressor is presented. A symbolic Gaussian elimination method to solve a constrained Boolean matrix is proposed and utilized for designing the reconfigurable network. The proposed scheme can be implemented in conjunction with any decompressor that has a combinational linear network. Using the given linear decompressor as a starting point, the proposed method improves the compression further. A nice feature of the proposed method is that it can be implemented with very little hardware overhead. Experimental results indicate that significant improvements can be achieved.