loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Automation and Test in Europe (DATE'05) Volume 2
Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination
Munich, Germany
March 07-March 11
ISBN: 0-7695-2288-2
Kedarnath J. Balakrishnan, University of Texas at Austin
Nur A. Touba, University of Texas at Austin
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.
Citation:
Kedarnath J. Balakrishnan, Nur A. Touba, "Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination," date, vol. 2, pp.1130-1135, Design, Automation and Test in Europe (DATE'05) Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.