Handbook of Applied Cryptography
Handbook of Applied Cryptography
Rijndael FPGA Implementations Utilising Look-Up Tables
Journal of VLSI Signal Processing Systems
SBCCI '05 Proceedings of the 18th annual symposium on Integrated circuits and system design
The Effect of LUT and Cluster Size on a Tree Based FPGA Architecture
RECONFIG '08 Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs
Composite Look-Up Table Gaussian Pseudo-Random Number Generator
RECONFIG '09 Proceedings of the 2009 International Conference on Reconfigurable Computing and FPGAs
Decimal Adders/Subtractors in FPGA: Efficient 6-input LUT Implementations
RECONFIG '09 Proceedings of the 2009 International Conference on Reconfigurable Computing and FPGAs
Investigation of DPA Resistance of Block RAMs in Cryptographic Implementations on FPGAs
RECONFIG '10 Proceedings of the 2010 International Conference on Reconfigurable Computing and FPGAs
Hi-index | 0.00 |
Interpolation is a useful technique for storage of complex functions on limited memory space: some few sampling values are stored on amemory bank, and the function values in between are calculated by interpolation. This paper presents a programmable Look-Up Table-based interpolator, which uses a reconfigurable nonuniform sampling scheme: the sampled points are not uniformly spaced. Their distribution can also be reconfigured to minimize the approximation error on specific portions of the interpolated function's domain. Switching from one set of configuration parameters to another set, selected on the fly from a variety of precomputed parameters, and using different sampling schemes allow for the interpolation of a plethora of functions, achieving memory saving and minimum approximation error. As a study case, the proposed interpolator was used as the core of a programmable noise generator--output signals drawn from different Probability Density Functions were produced for testing FPGA implementations of chaotic encryption algorithms. As a result of the proposed method, the interpolation of a specific transformation function on a Gaussian noise generator reduced the memory usage to 2.71% when compared to the traditional uniform sampling scheme method, while keeping the approximation error below a threshold equal to 0.000030518.