By Topic

Mapping and Performance Analysis of Lookup Table Implementations on Reconfigurable Platform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Majzoub, S. ; American Univ. of Beirut, Beirut ; Diab, H.

Reconfigurable computing has a recognized potential in processor design. It provides a middle trade-off between speed and flexibility. It provides performance close to application-specific-hardware, yet preserves the general-purpose-processor flexibility. This paper presents the mapping and performance analysis of the implementation of the lookup table for two encryption algorithms, namely Rijndael and Twofish, on a coarse grain dynamic reconfigurable platform, namely MorphoSys. MorphoSys is a dynamic reconfigurable architecture targeted for computer intensive applications with parallel nature. Since the MorphoSys does not support the indirect addressing, we present in this paper a methodology to implement an alternative. We present the details of the mapping of the two lookup tables with thorough analysis. The methodology we used can be utilized in other Memoryless systems. Finally, an instruction set extension was proposed to enhance the performance.

Published in:

Computer Systems and Applications, 2007. AICCSA '07. IEEE/ACS International Conference on

Date of Conference:

13-16 May 2007