P. Kubinec, J. Púc̆ik, M. Hagara, E. Cocherová, O. Ondrácek
{"title":"Successive Approximation Algorithm for Complex Number Magnitude and Argument Computation","authors":"P. Kubinec, J. Púc̆ik, M. Hagara, E. Cocherová, O. Ondrácek","doi":"10.1109/RADIOELEKTRONIKA49387.2020.9092432","DOIUrl":null,"url":null,"abstract":"Determination of complex number modulus and argument is commonly encountered task in digital signal processing. According to definition, this task requires evaluation of square root and inverse tangent functions. When computing hardware resources are limited, e.g. in real-time applications, an approximation by basic arithmetic and logical operations are of interest. We propose method for modulus approximation that uses addition, scaling and comparison, and provides also argument information. At each additional level of our algorithm, modulus approximation error decreases by factor of 4 and argument error by factor of 8.","PeriodicalId":131117,"journal":{"name":"2020 30th International Conference Radioelektronika (RADIOELEKTRONIKA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 30th International Conference Radioelektronika (RADIOELEKTRONIKA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RADIOELEKTRONIKA49387.2020.9092432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Determination of complex number modulus and argument is commonly encountered task in digital signal processing. According to definition, this task requires evaluation of square root and inverse tangent functions. When computing hardware resources are limited, e.g. in real-time applications, an approximation by basic arithmetic and logical operations are of interest. We propose method for modulus approximation that uses addition, scaling and comparison, and provides also argument information. At each additional level of our algorithm, modulus approximation error decreases by factor of 4 and argument error by factor of 8.