• DocumentCode
    1272255
  • Title

    Mixed Radix Reed-Muller Expansions

  • Author

    Rafiev, Ashur ; Mokhov, Andrey ; Burns, Frank P. ; Murphy, Julian P. ; Koelmans, Albert ; Yakovlev, Alex

  • Author_Institution
    Sch. of Electr., Electron. & Comput. Eng., Newcastle Univ., Newcastle upon Tyne, UK
  • Volume
    61
  • Issue
    8
  • fYear
    2012
  • Firstpage
    1189
  • Lastpage
    1202
  • Abstract
    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.
  • Keywords
    Reed-Muller codes; digital arithmetic; logic design; Galois field arithmetic; cryptographic circuits; mixed radix Reed-Muller expansions; multivalued logic synthesis; Benchmark testing; Cryptography; Encoding; Equations; Logic gates; Protocols; Switches; Automatic synthesis; data encryption.; multiple valued logic;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2011.124
  • Filename
    5953584