Issue No. 08 - Aug. (2012 vol. 61)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.124
Frank P. Burns , Newcastle University, Newcastle Upon Tyne
Albert Koelmans , Newcastle University, Newcastle Upon Tyne
Andrey Mokhov , Newcastle University, Newcastle Upon Tyne
Ashur Rafiev , Newcastle University, Newcastle Upon Tyne
Alex Yakovlev , Newcastle University, Newcastle Upon Tyne
Julian P. Murphy , Newcastle University, Newcastle Upon Tyne
The choice of radix is crucial for multivalued logic synthesis. Practical examples, however, reveal that it is not always possible to find the optimal radix when taking into consideration actual physical parameters of multivalued operations. In other words, each radix has its advantages and disadvantages. Our proposal is to synthesize logic in different radices, so it may benefit from their combination. The theory presented in this paper is based on Reed-Muller expansions over Galois field arithmetic. The work aims to first estimate the potential of the new approach and to second analyze its impact on circuit parameters down to the level of physical gates. The presented theory has been applied to real-life examples focusing on cryptographic circuits where Galois Fields find frequent application. The benchmark results show that the approach creates a new dimension for the trade-off between circuit parameters and provides information on how the implemented functions are related to different radices.
Automatic synthesis, multiple valued logic, data encryption.
Frank P. Burns, Albert Koelmans, Andrey Mokhov, Ashur Rafiev, Alex Yakovlev, Julian P. Murphy, "Mixed Radix Reed-Muller Expansions", IEEE Transactions on Computers, vol. 61, no. , pp. 1189-1202, Aug. 2012, doi:10.1109/TC.2011.124