Theoretical results due to V. Malyugin on linearization of arithmetical models of logical functions are interpreted and refined from the viewpoint of modern techniques of logical design of integral circuits and nearest neighbor technologies.

We consider a variant of the graph partitioning problem involving knapsack constraints with Gaussian random coefficients. In this new variant, under this assumption of probability distribution, the problem can be traditionally formulated as a binary SOCP for which the continuous relaxation is convex. In this paper, we reformulate the problem as a binary quadratic constrained program for which t...

This paper concerns the application of reduced order modeling techniques to power grid simulation. Swing dynamics is a complex non-linear phenomenon due to which model order reduction of these problems is intricate. A multi point linearization based model reduction technique trajectory piece-wise linearization (TPWL) method is adopted to address the problem of approximating the nonlinear term i...

Localization is a fundamental problem for mobile robot autonomous navigation. EKF is an efficient tool for position estimation, but it suffers from linearization errors due to linear approximation of nonlinear system equations. In this paper we describe a position estimation method for mobile robot. Process and measurement equations are linear by appropriately constructing the state vector and ...

A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non–differentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constr...

A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non{diierentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constra...

The purpose of this paper is to provide a uniied description of iterative algorithms for the solution of traac equilibrium problems. We demonstrate that a large number of well known solution techniques can be described in a uniied manner through the concept of partial linearization, and establish close relationships with other algorithmic classes for nonlinear programming and variational inequa...

Amplification of generalized multicarrier (GMC) signals by high-power amplifiers (HPAs) before transmission can result in undesirable out-of-band spectral components, necessitating power backoff, and low HPA efficiency. We evaluate variations of several peak-to-average power ratio (PAPR) reduction and HPA linearization techniques which were previously proposed for OFDM signals. Our main emphasi...

The modeling approaches of power converters occupy an important position in electronic systems and have made considerable progress over the past years. Continuous linearization techniques are reviewed, including state-space average model, generalized averaged small-signal describing function method. A Buck converter with PWM modulation voltage-mode control is taken as example to compare advanta...

Linearization technologies that can be used for linearizing RoF transmission are reviewed. Three main linearization methods, i.e. electrical analog linearization, optical linearization, and electrical digital linearization are presented and compared. Analog linearization can be achieved using analog predistortion circuits, and can be used for suppression of odd order nonlinear distortion compon...