CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Minimax approximation of a complex-valued function modulus by means of linear programming
Authors
Agliullin I.
Choni Y.
Talyzin V.
Publication date
1 January 2017
Publisher
Abstract
© 2016 IEEE.The problem of approximating the complex-valued function modulus using a minimax criterion is of interest in many technical applications, such as standard process controlling systems with limiting the transient oscillations, low-side-lobe antenna arrays, or multiplexing devices having a deep channel isolation. The paper introduces approximate formulas to compute the absolute value of a complex number based on piecewise linear inequalities, thanks to which the approximation problem may be reduced to the minimax linear programming problem allowing the use of standard application packages. Computational experiments, the results of which are discussed, have proven the efficiency of the proposed computing algorithm combining high speed and good approximation accuracy
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Kazan Federal University Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dspace.kpfu.ru:net/145345
Last time updated on 07/05/2019