2017/05/21 by Aleksandr Cariow, Cariow, Aleksandr, Galina Cariowa +1
Computer Science · Mathematics · #15A23 #65F30 #65Y20 #Computability, Logic, AI Algorithms #F.2.1 #FOS: Computer and information sciences #G.1.0 #Hardware Architecture (cs.AR) #I.1.2 #Mathematical and Theoretical Analysis #Numerical Methods and Algorithms #Polynomial and algebraic computation #Quantum Computing Algorithms and Architecture #acm:15A23 #acm:65F30 #acm:65Y20 #cs.AR #msc:15A23 #msc:65F30 #msc:65Y20
paper · pdf · doi:10.48550/arxiv.1705.07465
3 pages. 3 figures, 2 tables
arxiv created 2017/05/21 · openalex publication_date 2017/05/21 · arxiv updated 2017/05/23 · openalex created_date 2019/10/03 · openalex updated_date 2026/07/28
In this paper, new schemes for a squarer, multiplier and divider of complex numbers are proposed. Traditional structural solutions for each of these operations require the presence some number of general-purpose binary multipliers. The advantage of our solutions is a removing of multiplications through replacing them by less costly squarers. We use Logan's trick and quarter square technique, which propose to replace the calculation of the product of two real numbers by summing the squares. Replacing usual multipliers on digital squares implies reducing power consumption as well as decreases hardware circuit complexity. The squarer requiring less area and power as compared to general-purpose multiplier, it is interesting to assess the use of squarers to implementation of complex arithmetic.