arXiv subjects

Masaaki Nagahara

Publications and source records attributed to Masaaki Nagahara.

At least 55 records · Page 3Linked to original sources

arXiv2014

Hands-Off Control as Green Control

In this article, we introduce a new paradigm of control, called hands-off control, which can save energy and reduce CO2 emissions in control systems. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum hands-off control is the minimum support (or sparsest) control among all admissible controls. With maximum hands-off control, actuators in the feedback control system can be stopped during time intervals over which the control values are zero. We show the maximum hands-off control is given by L1 optimal control, for which we also show numerical computation formulas.

eess.SY↗

arXiv2014

FIR Digital Filter Design by Sampled-Data H-infinity Discretization

FIR (finite impulse response) digital filter design is a fundamental problem in signal processing. In particular, FIR approximation of analog filters (or systems) is ubiquitous not only in signal processing but also in digital implementation of controllers. In this article, we propose a new design method of an FIR digital filter that optimally approximates a given analog filter in the sense of minimizing the H-infinity norm of the sampled-data error system. By using the lifting technique and the KYP (Kalman-Yakubovich-Popov) lemma, we reduce the H-infinity optimization to a convex optimization described by an LMI (linear matrix inequality). We also extend the method to multi-rate and multi-delay systems. A design example is shown to illustrate the effectiveness of the proposed method.

cs.IT↗

arXiv2013

Sparse Packetized Predictive Control for Networked Control over Erasure Channels

We study feedback control over erasure channels with packet-dropouts. To achieve robustness with respect to packet-dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. To reduce the data size of packets, we propose to adopt sparsity-promoting optimizations, namely, ell-1-ell-2 and ell-2-constrained ell-0 optimizations, for which efficient algorithms exist. We derive sufficient conditions on design parameters, which guarantee (practical) stability of the resulting feedback control systems when the number of consecutive packet-dropouts is bounded.

eess.SY↗

arXiv2013

Multirate Digital Signal Processing via Sampled-Data H-infinity Optimization

In this thesis, we present a new method for designing multirate signal processing and digital communication systems via sampled-data H-infinity control theory. The difference between our method and conventional ones is in the signal spaces. Conventional designs are executed in the discrete-time domain, while our design takes account of both the discrete-time and the continuous-time signals. Namely, our method can take account of the characteristic of the original analog signal and the influence of the A/D and D/A conversion. While the conventional method often indicates that an ideal digital low-pass filter is preferred, we show that the optimal solution need not be an ideal low-pass when the original analog signal is not completely band-limited. This fact can not be recognized only in the discrete-time domain. Moreover, we consider quantization effects. We discuss the stability and the performance of quantized sampled-data control systems. We justify H-infinity control to reduce distortion caused by the quantizer. Then we apply it to differential pulse code modulation. While the conventional Delta modulator is not optimal and besides not stable, our modulator is stable and optimal with respect to the H-infinity-norm. We also give an LMI (Linear Matrix Inequality) solution to the optimal H-infinity approximation of IIR (Infinite Impulse Response) filters via FIR (Finite Impulse Response) filters. A comparison with the Nehari shuffle is made with a numerical example, and it is observed that the LMI solution generally performs better. Another numerical study also indicates that there is a trade-off between the pass-band and stop-band approximation characteristics.

cs.IT↗

arXiv2013

Active Noise Control with Sampled-Data Filtered-x Adaptive Algorithm

Analysis and design of filtered-x adaptive algorithms are conventionally done by assuming that the transfer function in the secondary path is a discrete-time system. However, in real systems such as active noise control, the secondary path is a continuous-time system. Therefore, such a system should be analyzed and designed as a hybrid system including discrete- and continuous- time systems and AD/DA devices. In this article, we propose a hybrid design taking account of continuous-time behavior of the secondary path via lifting (continuous-time polyphase decomposition) technique in sampled-data control theory.

cs.IT↗

arXiv2013

YY Filter - A Paradigm of Digital Signal Processing

YY filter, named after the founder Prof. Yutaka Yamamoto, is a digital filter designed by sampled-data control theory, which can optimize the analog performance of the signal processing system with AD/DA converters. This article discusses problems in conventional signal processing and introduces advantages of the YY filter.

cs.IT↗

arXiv2013

H-infinity Optimal Approximation for Causal Spline Interpolation

In this paper, we give a causal solution to the problem of spline interpolation using H-infinity optimal approximation. Generally speaking, spline interpolation requires filtering the whole sampled data, the past and the future, to reconstruct the inter-sample values. This leads to non-causality of the filter, and this becomes a critical issue for real-time applications. Our objective here is to derive a causal system which approximates spline interpolation by H-infinity optimization for the filter. The advantage of H-infinity optimization is that it can address uncertainty in the input signals to be interpolated in design, and hence the optimized system has robustness property against signal uncertainty. We give a closed-form solution to the H-infinity optimization in the case of the cubic splines. For higher-order splines, the optimal filter can be effectively solved by a numerical computation. We also show that the optimal FIR (Finite Impulse Response) filter can be designed by an LMI (Linear Matrix Inequality), which can also be effectively solved numerically. A design example is presented to illustrate the result.

cs.IT↗

arXiv2013

H-infinity Design of Periodically Nonuniform Interpolation and Decimation for Non-Band-Limited Signals

In this paper, we consider signal interpolation of discrete-time signals which are decimated nonuniformly. A conventional interpolation method is based on the sampling theorem, and the resulting system consists of an ideal filter with complex-valued coefficients. While the conventional method assumes band limitation of signals, we propose a new method by sampled-data H-infinity optimization. By this method, we can remove the band-limiting assumption and the optimal filter can be with real-valued coefficients. Moreover, we show that without band-limited assumption, there can be the optimal decimation patterns among ones with the same ratio. By examples, we show the effectiveness of our method.

cs.IT↗

arXiv2013

Sparse Command Generator for Remote Control

In this article, we consider remote-controlled systems, where the command generator and the controlled object are connected with a bandwidth-limited communication link. In the remote-controlled systems, efficient representation of control commands is one of the crucial issues because of the bandwidth limitations of the link. We propose a new representation method for control commands based on compressed sensing. In the proposed method, compressed sensing reduces the number of bits in each control signal by representing it as a sparse vector. The compressed sensing problem is solved by an L1-L2 optimization, which can be effectively implemented with an iterative shrinkage algorithm. A design example also shows the effectiveness of the proposed method.

eess.SY↗

arXiv2013

Compressive Sampling for Networked Feedback Control

We investigate the use of compressive sampling for networked feedback control systems. The method proposed serves to compress the control vectors which are transmitted through rate-limited channels without much deterioration of control performance. The control vectors are obtained by an L1-L2 optimization, which can be solved very efficiently by FISTA (Fast Iterative Shrinkage-Thresholding Algorithm). Simulation results show that the proposed sparsity-promoting control scheme gives a better control performance than a conventional energy-limiting L2-optimal control.

eess.SY↗

arXiv2013

Min-Max Design of FIR Digital Filters by Semidefinite Programming

In this article we consider two problems: FIR (Finite Impulse Response) approximation of IIR (Infinite Impulse Response) filters and inverse FIR filtering of FIR or IIR filters. By means of Kalman-Yakubovich-Popov (KYP) lemma and its generalization (GKYP), the problems are reduced to semidefinite programming described in linear matrix inequalities (LMIs). MATLAB codes for these design methods are given. An design example shows the effectiveness of these methods.

cs.IT↗

arXiv2013

Signal Reconstruction via H-infinity Sampled-Data Control Theory: Beyond the Shannon Paradigm

This paper presents a new method for signal reconstruction by leveraging sampled-data control theory. We formulate the signal reconstruction problem in terms of an analog performance optimization problem using a stable discrete-time filter. The proposed H-infinity performance criterion naturally takes intersample behavior into account, reflecting the energy distributions of the signal. We present methods for computing optimal solutions which are guaranteed to be stable and causal. Detailed comparisons to alternative methods are provided. We discuss some applications in sound and image reconstruction.

cs.IT↗

arXiv2013

Sparse Representations for Packetized Predictive Networked Control

We investigate a networked control architecture for LTI plant models with a scalar input. Communication from controller to actuator is over an unreliable network which introduces packet dropouts. To achieve robustness against dropouts, we adopt a packetized predictive control paradigm wherein each control packet transmitted contains tentative future plant input values. The novelty of our approach is that we seek that the control packets transmitted be sparse. For that purpose, we adapt tools from the area of compressed sensing and propose to design the control packets via on-line minimization of a suitable L1/L2 cost function. We then show how to choose parameters of the cost function to ensure that the resultant closed loop system be practically stable, provided the maximum number of consecutive packet dropouts is bounded. A numerical example illustrates that sparsity reduces bit-rates, thereby making our proposal suited to control over unreliable and bit-rate limited networks.

eess.SY↗

arXiv2013

Monotone Smoothing Splines Using General Linear Systems

In this paper, a method is proposed to solve the problem of monotone smoothing splines using general linear systems. This problem, also called monotone control theoretic splines, has been solved only when the curve generator is modeled by the second-order integrator, but not for other cases. The difficulty in the problem is that the monotonicity constraint should be satisfied over an interval which has the cardinality of the continuum. To solve this problem, we first formulate the problem as a semi-infinite quadratic programming, and then we adopt a discretization technique to obtain a finite-dimensional quadratic programming problem. It is shown that the solution of the finite-dimensional problem always satisfies the infinite-dimensional monotonicity constraint. It is also proved that the approximated solution converges to the exact solution as the discretization grid-size tends to zero. An example is presented to show the effectiveness of the proposed method.

eess.SY↗

arXiv2013

H-Infinity-Optimal Fractional Delay Filters

Fractional delay filters are digital filters to delay discrete-time signals by a fraction of the sampling period. Since the delay is fractional, the intersample behavior of the original analog signal becomes crucial. In contrast to the conventional designs based on the Shannon sampling theorem with the band-limiting hypothesis, the present paper proposes a new approach based on the modern sampled-data H-infinity optimization that aims at restoring the intersample behavior beyond the Nyquist frequency. By using the lifting transform or continuous-time blocking the design problem is equivalently reduced to a discrete-time H-infinity optimization, which can be effectively solved by numerical computation softwares. Moreover, a closed-form solution is obtained under an assumption on the original analog signals. Design examples are given to illustrate the advantage of the proposed method.

cs.IT↗

arXiv2013

Compressive Sampling for Remote Control Systems

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive sampling technique. The problem of obtaining sparse representation is formulated by cardinality-constrained L2 optimization of the control performance, which is reducible to L1-L2 optimization. The low rate random sampling employed in the proposed method based on the compressive sampling, in addition to the fact that the L1-L2 optimization can be effectively solved by a fast iteration method, enables us to generate the sparse control signal with reduced computational complexity, which is preferable in remote control systems where computation delays seriously degrade the performance. We give a theoretical result for control performance analysis based on the notion of restricted isometry property (RIP). An example is shown to illustrate the effectiveness of the proposed approach via numerical experiments.

eess.SY↗

arXiv2013

Frequency Domain Min-Max Optimization of Noise-Shaping Delta-Sigma Modulators

This paper proposes a min-max design of noise-shaping delta-sigma modulators. We first characterize the all stabilizing loop-filters for a linearized modulator model. By this characterization, we formulate the design problem of lowpass, bandpass, and multi-band modulators as minimization of the maximum magnitude of the noise transfer function (NTF) in fixed frequency band(s). We show that this optimization minimizes the worst-case reconstruction error, and hence improves the SNR (signal-to-noise ratio) of the modulator. The optimization is reduced to an optimization with a linear matrix inequality (LMI) via the generalized KYP (Kalman-Yakubovich-Popov) lemma. The obtained NTF is an FIR (finite-impulse-response) filter, which is favorable in view of implementation. We also derive a stability condition for the nonlinear model of delta-sigma modulators with general quantizers including uniform ones. This condition is described as an H-infinity norm condition, which is reduced to an LMI via the KYP lemma. Design examples show advantages of our design.

cs.IT↗

arXiv2013

L1-Optimal Splines for Outlier Rejection

In this article, we consider control theoretic splines with L1 optimization for rejecting outliers in data. Control theoretic splines are either interpolating or smoothing splines, depending on a cost function with a constraint defined by linear differential equations. Control theoretic splines are effective for Gaussian noise in data since the estimation is based on L2 optimization. However, in practice, there may be outliers in data, which may occur with vanishingly small probability under the Gaussian assumption of noise, to which L2-optimized spline regression may be very sensitive. To achieve robustness against outliers, we propose to use L1 optimality, which is also used in support vector regression. A numerical example shows the effectiveness of the proposed method.

eess.SY↗