Abstract
The concept of Mixed Arithmetic Logic and Expansions is introduced in this paper. The recursive ways of generating Forward and Inverse Fast Transforms for Mixed Arithmetic Logic are presented. The paper describes basic properties and lists those Mixed Arithmetic Transforms which have convenient fast forward algorithms and easily defined inverse transforms. Finally, the computational advantages and usefulness of new expansions based on Mixed Arithmetic Logic in comparison to known Arithmetic expansions are illustrated on some examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
