Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination

Kedarnath J. Balakrishnan (1) , Nur A. Touba (1)

1 Computer Engineering Research Center

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.

Domaines: Architectures Matérielles [cs.AR]; Electronique

Kedarnath J. Balakrishnan, Nur A. Touba. Reconfigurable Linear Decompressors Using Symbolic Gaussian Elimination. DATE'05, Mar 2005, Munich, Germany. pp.1130-1135. ⟨hal-00181284⟩