• DocumentCode
    1811807
  • Title

    Boolean verification with fastest LIA transforms

  • Author

    Falkowski, Bogdan J. ; Rahardja, Susanto

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
  • Volume
    5
  • fYear
    2002
  • fDate
    2002
  • Abstract
    The fastest transform in the family of fast Linearly Independent Arithmetic (LIA) logic is introduced in this paper. The transform is the most efficient LIA transform in terms of complexity. Recursive equations defining the LIA transform and the corresponding butterfly diagrams are shown. Finally, application of the new LIA transform in Boolean functions verifications is discussed.
  • Keywords
    Boolean functions; formal verification; recursive functions; transforms; Boolean function verifications; Boolean verification; LIA transform; butterfly diagrams; complexity; fast linearly independent arithmetic logic; recursive equations; Algebra; Arithmetic; Boolean functions; Circuit testing; Equations; Fault detection; Logic circuits; Logic design; Logic functions; Transforms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
  • Print_ISBN
    0-7803-7448-7
  • Type

    conf

  • DOI
    10.1109/ISCAS.2002.1010705
  • Filename
    1010705
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1811807