kth.sePublications
Change search
Refine search result
1234567 101 - 150 of 2323
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 101.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
    Fanelli, Duccio
    Gurbatov, Sergey N
    Moshkov, A.Yu.
    Non-linear regime of the gravitational instability2005In: Proceedings of Frontiers of Nonlinear Physics, 2005, p. 619-629Conference paper (Refereed)
  • 102.
    Aurell, Erik
    et al.
    KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gawȩdzki, K.
    Mejía-Monasterio, C.
    Mohayaee, R.
    Muratore-Ginanneschi, P.
    Refined Second Law of Thermodynamics for Fast Random Processes2012In: Journal of statistical physics, ISSN 0022-4715, E-ISSN 1572-9613, Vol. 147, no 3, p. 487-505Article in journal (Refereed)
    Abstract [en]

    We establish a refined version of the Second Law of Thermodynamics for Langevin stochastic processes describing mesoscopic systems driven by conservative or non-conservative forces and interacting with thermal noise. The refinement is based on the Monge-Kantorovich optimal mass transport and becomes relevant for processes far from quasi-stationary regime. General discussion is illustrated by numerical analysis of the optimal memory erasure protocol for a model for micron-size particle manipulated by optical tweezers.

  • 103.
    Aurell, Erik
    et al.
    KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Mahmoudi, Hamed
    A message-passing scheme for non-equilibrium stationary states2011In: JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, ISSN 1742-5468, p. P04014-Article in journal (Refereed)
    Abstract [en]

    We study stationary states in a diluted asymmetric (kinetic) Ising model. We apply the recently introduced dynamic cavity method to compute magnetizations of these stationary states. Depending on the update rule, different versions of the dynamic cavity method apply. We here study synchronous updates and random sequential updates, and compare local properties computed by the dynamic cavity method to numerical simulations. Using both types of updates, the dynamic cavity method is highly accurate at high enough temperatures. At low enough temperatures, for sequential updates the dynamic cavity method tends to a fixed point, but this does not agree with numerical simulations, while for parallel updates, the dynamic cavity method may display oscillatory behavior. When it converges and is accurate, the dynamic cavity method offers a huge speed-up compared to Monte Carlo, particularly for large systems.

  • 104.
    Aurell, Erik
    et al.
    KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Mahmoudi, Hamed
    Dynamic mean-field and cavity methods for diluted Ising systems2012In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, ISSN 1539-3755, E-ISSN 1550-2376, Vol. 85, no 3, p. 031119-Article in journal (Refereed)
    Abstract [en]

    We compare dynamic mean-field and dynamic cavity methods to describe the stationary states of dilute kinetic Ising models. We compute dynamic mean-field theory by expanding in interaction strength to third order, and we compare to the exact dynamic mean-field theory for fully asymmetric networks. We show that in diluted networks, the dynamic cavity method generally predicts magnetizations of individual spins better than both first-order ("naive") and second-order ("TAP") dynamic mean-field theory.

  • 105.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
    Mahmoudi, Hamed
    KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
    Three Lemmas on Dynamic Cavity Method2011In: Communications in Theoretical Physics, ISSN 0253-6102, E-ISSN 1572-9494, Vol. 56, no 1, p. 157-162Article in journal (Refereed)
    Abstract [en]

    We study the dynamic cavity method for dilute kinetic Ising models with synchronous update rules. For he parallel update rule we find for fully asymmetric models that the dynamic cavity equations reduce to a Markovian dynamics of the (time-dependent) marginal probabilities. For the random sequential update rule, also an instantiation of a synchronous update rule, we find on the other hand that the dynamic cavity equations do not reduce to a Markovian dynamics, unless an additional assumption of time factorization is introduced. For symmetric models we show that a fixed point of ordinary Belief propagation is also a fixed point of the dynamic cavity equations in the time factorized approximation. For clarity, the conclusions of the paper are formulated as three lemmas.

  • 106.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
    Mejia-Monasterio, Carlos
    Muratore-Ginanneschi, Paolo
    Optimal Protocols and Optimal Transport in Stochastic Thermodynamics2011In: Physical Review Letters, ISSN 0031-9007, E-ISSN 1079-7114, Vol. 106, no 25, p. 250601-Article in journal (Refereed)
    Abstract [en]

    Thermodynamics of small systems has become an important field of statistical physics. Such systems are driven out of equilibrium by a control, and the question is naturally posed how such a control can be optimized. We show that optimization problems in small system thermodynamics are solved by (deterministic) optimal transport, for which very efficient numerical methods have been developed, and of which there are applications in cosmology, fluid mechanics, logistics, and many other fields. We show, in particular, that minimizing expected heat released or work done during a nonequilibrium transition in finite time is solved by the Burgers equation and mass transport by the Burgers velocity field. Our contribution hence considerably extends the range of solvable optimization problems in small system thermodynamics.

  • 107.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
    Muratore-Ginnaneschi, Paolo
    Departments of Mathematics and Statistics, University of Helsinki.
    Optimal hedging of derivatives with transaction costs2006In: International Journal of Theoretical and Applied Finance, ISSN 0219-0249, Vol. 9, no 7, p. 1051-1069Article in journal (Refereed)
    Abstract [en]

    We investigate the optimal strategy over a finite time horizon for a portfolio of stock and bond and a derivative in an multiplicative Markovian market model with transaction costs (friction). The optimization problem is solved by a Hamilton-Bellman-Jacobi equation, which by the verification theorem has well-behaved solutions if certain conditions on a potential are satisfied. In the case at hand, these conditions simply imply arbitrage-free ("Black-Scholes") pricing of the derivative. While pricing is hence not changed by friction allow a portfolio to fluctuate around a delta hedge. In the limit of weak friction, we determine the optimal control to essentially be of two parts: a strong control, which tries to bring the stock-and-derivative portfolio towards a Black-Scholes delta hedge; and a weak control, which moves the portfolio by adding or subtracting a Black-Scholes hedge. For simplicity we assume growth-optimal investment criteria and quadratic friction.

  • 108.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ollion, Charles
    Roudi, Y.
    Dynamics and performance of susceptibility propagation on synthetic data2010In: European Physical Journal B: Condensed Matter Physics, ISSN 1434-6028, E-ISSN 1434-6036, Vol. 77, no 4, p. 587-595Article in journal (Refereed)
    Abstract [en]

    We study the performance and convergence properties of the susceptibility propagation (SusP) algorithm for solving the Inverse Ising problem. We first study how the temperature parameter (T) in a Sherrington-Kirkpatrick model generating the data influences the performance and convergence of the algorithm. We find that at the high temperature regime (T > 4), the algorithm performs well and its quality is only limited by the quality of the supplied data. In the low temperature regime (T < 4), we find that the algorithm typically does not converge, yielding diverging values for the couplings. However, we show that by stopping the algorithm at the right time before divergence becomes serious, good reconstruction can be achieved down to T a parts per thousand 2. We then show that dense connectivity, loopiness of the connectivity, and high absolute magnetization all have deteriorating effects on the performance of the algorithm. When absolute magnetization is high, we show that other methods can be work better than SusP. Finally, we show that for neural data with high absolute magnetization, SusP performs less well than TAP inversion.

  • 109.
    Aurell, Erik
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Pfitzner, Rene
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Gaussian belief with dynamic data and in dynamic network2009In: Europhysics letters, ISSN 0295-5075, E-ISSN 1286-4854, Vol. 87, no 6Article in journal (Refereed)
    Abstract [en]

    In this paper we analyze Belief Propagation over a Gaussian model in a dynamic environment. Recently, this has been proposed as a method to average local measurement values by a distributed protocol (Consensus Propagation, Moallemi C. C. and Van Roy B., IEEE Trans. Inf. Theory, 52 (2006) 4753) where the average is available for read-out at every single node. In the case that the underlying network is constant but the values to be averaged fluctuate ("dynamic data"), convergence and accuracy are determined by the spectral properties of an associated Ruelle-Perron-Frobenius operator. For Gaussian models on Erdos-Renyi graphs, numerical computation points to a spectral gap remaining in the large- size limit, implying exceptionally good scalability. In a model where the underlying network also fluctuates ("dynamic network"), averaging is more effective than in the dynamic data case. Altogether, this implies very good performance of these methods in very large systems, and opens a new field of statistical physics of large (and dynamic) information systems.

  • 110.
    Aurell, Erik
    et al.
    KTH, School of Computer Science and Communication (CSC), Computational Biology, CB. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Aalto Univ.
    Zakrzewski, Jakub
    Zyczkowski, Karol
    Time reversals of irreversible quantum maps2015In: Journal of Physics A: Mathematical and Theoretical, ISSN 1751-8113, E-ISSN 1751-8121, Vol. 48, no 38, article id 38FT01Article in journal (Refereed)
    Abstract [en]

    We propose an alternative notion of time reversal in open quantum systems as represented by linear quantum operations, and a related generalization of classical entropy production in the environment. This functional is the ratio of the probability to observe a transition between two states under the forward and the time reversed dynamics, and leads, as in the classical case, to fluctuation relations as tautological identities. As in classical dynamics in contact with a heat bath, time reversal is not unique, and we discuss several possibilities. For any bistochastic map its dual map preserves the trace and describes a legitimate dynamics reversed in time, in that case the entropy production in the environment vanishes. For a generic stochastic map we construct a simple quantum operation which can be interpreted as a time reversal. For instance, the decaying channel, which sends the excited state into the ground state with a certain probability, can be reversed into the channel transforming the ground state into the excited state with the same probability.

  • 111.
    Avventi, Enrico
    et al.
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
    Lindquist, Anders
    KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Wahlberg, Bo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Graphical Models of Autoregressive Moving-Average Processes2010In: The 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), 2010Conference paper (Refereed)
    Abstract [en]

    Consider a Gaussian stationary stochastic vector process with the property that designated pairs of components are conditionally independent given the rest of the components. Such processes can be represented on a graph where the components are nodes and the lack of a connecting link between two nodes signifies conditional independence. This leads to a sparsity pattern in the inverse of the matrix-valued spectral density. Such graphical models find applications in speech, bioinformatics, image processing, econometrics and many other fields, where the problem to fit an autoregressive (AR) model to such a process has been considered. In this paper we take this problem one step further, namely to fit an autoregressive moving-average (ARMA) model to the same data. We develop a theoretical framework which also spreads further light on previous approaches and results.

    Download full text (pdf)
    IR-EE-RT 2010:032
  • 112. Azmi, Marwan H.
    et al.
    Yuan, Jinhong
    Lechner, Gottfried
    Rasmussen, Lars Kildehöj
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Design of Multi-Edge-Type Bilayer-Expurgated LDPC Codes for Decode-and-Forward in Relay Channels2011In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 59, no 11, p. 2993-3006Article in journal (Refereed)
    Abstract [en]

    We consider the design of bilayer-expurgated low-density parity-check (BE-LDPC) codes as part of a decode-and-forward protocol for use over the full-duplex relay channel. A new ensemble of codes, termed multi-edge-type bilayer-expurgated LDPC (MET-BE-LDPC) codes, is introduced where the BE-LDPC code design problem is transformed into the problem of optimizing the multinomials of a multi-edge-type LDPC code. We propose two design strategies for optimizing MET-BE-LDPC codes; the bilayer approach is preferred when the difference in SNR between the source-to-relay and the source-to-destination channels is small, while the bilayer approach with intermediate rates is preferred when this difference is large. In both proposed design strategies multi-edge-type density evolution is used for code optimization. The resulting MET-BE-LDPC codes exhibit improved threshold and bit-error-rate performance as compared to previously reported bilayer LDPC codes.

  • 113. Baliosian, Javier
    et al.
    Matusikova, Katarina
    Quinn, Karl
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Policy-based self-healing for radio access networks2008In: 2008 IEEE NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, IEEE , 2008, p. 1007-1010Conference paper (Refereed)
    Abstract [en]

    Various centralized, distributed or cooperative management systems have been proposed to address the demands of wireless telecommunication networks. However, considering the size, complexity and heterogeneity that those networks will have in the future, current solutions either do not scale properly, or have no support for automation, or lack of the flexibility and simple control that operators will need for managing future networks in a cost-effective way. To address this problem, we designed Omega, a distributed and policy-based network management system that uses rich knowledge-modeling techniques to develop self-configuration capabilities. Omega also implements a novel conflict-resolution method that uses high-level goals and machine learning techniques to optimize its policy-based decisions. Using simulations, in this paper we show how Omega reduces the impact of a node crash on the overall availability of a radio access network by optimizing the lists of neighboring cells of the nodes in the vicinity.

    Download full text (pdf)
    fulltext
  • 114. Balluchi, A.
    et al.
    Benvenuti, L.
    Engell, S.
    Geyer, T.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lamnabhi-Lagarrigue, F.
    Lygeros, J.
    Morari, M.
    Papafotioug, G.
    Sangiovanni-Vincentelli, A. L.
    Santuchi, F.
    Stursberg, O.
    Hybrid control of networked embedded systems2005In: European Journal of Control, ISSN 0947-3580, E-ISSN 1435-5671, Vol. 11, no 4-5, p. 478-508Article in journal (Refereed)
    Abstract [en]

    Hybrid systems that involve the interaction of continuous and discrete dynamics have been an active area of research for a number of years. In this paper, we start by briefly surveying the main theoretical control problems that have been treated in the hybrid systems setting and classify them into stabilization, optimal control and language specification problems. We then provide an overview of recent developments in four of the most prominent areas where these hybrid control methods have found application: control of power systems, industrial process control, design of automotive electronics and communication networks.

    Download full text (pdf)
    hybrid_ejc05
  • 115. Bao, J.
    et al.
    Ma, Z.
    Xiao, Ming
    KTH, School of Electrical Engineering (EES), Information Science and Engineering. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Tsiftsis, T. A.
    Zhu, Z.
    Performance analysis of uplink sparse code multiple access with iterative multiuser receiver2017In: 2017 IEEE International Conference on Communications, ICC 2017, Institute of Electrical and Electronics Engineers (IEEE), 2017, article id 7996537Conference paper (Refereed)
    Abstract [en]

    This paper investigates the asymptotic performance of bit-interleaved coded modulation (BICM) with iterative multiuser detection and decoding in uplink sparse code multiple access (SCMA) systems. The extrinsic information transfer (EXIT) characteristics analysis of the joint multiuser detector for SCMA is provided, and shows that the average detection reliability for multiple users converges to the single-user case, if ideal feedback from the decoder is available to the detector. We develop a tight analytical bound on the convolutionally encoded bit-error rate (BER) for independent Rayleigh fadings, based on the single-user bound with arbitrary multidimensional constellations. Moreover, we analyze the achievable coding and diversity gains of the SCMA-BICM system with iterative receiver. Simulations are carried out to verify the effectiveness of the analysis.

  • 116. Bao, L.
    et al.
    Skoglund, M.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Rate allocation with power constraints for quantized control over binary symmetric channelsManuscript (preprint) (Other academic)
  • 117. Bao, L.
    et al.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Encoder-decoder design for feedback control over the binary symmetric channel2006In: 2006 IEEE International Symposium on Information Theory, Vols 1-6, Proceedings, IEEE , 2006, p. 2481-2485Conference paper (Refereed)
    Abstract [en]

    Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm.

    Download full text (pdf)
    coding-control_isit06
  • 118.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On rate allocation for multiple plants in a networked control system2012In: 2012 American Control Conference (ACC), IEEE Computer Society, 2012, p. 2024-2029Conference paper (Refereed)
    Abstract [en]

    The problem of allocating communication resources to multiple plants in a networked control system is investigated. In the presence of a shared communication medium, a total transmission rate constraint is imposed. For the purpose of optimizing the rate allocation to the plants over a finite horizon, two objective functions are considered. The first one is a single-objective function, and the second one is a multi-objective function. Because of the difficulty to derive the closed-form expression of these functions, which depend on the instantaneous communication rate, an approximation is proposed by using high-rate quantization theory. It is shown that the approximate objective functions are convex in the region of interest both in the scalar case and in the multi-objective case. This allows to establish a linear control policy given by the classical linear quadratic Gaussian theory as function of the channel. Based on this result, a new complex relation between the control performance and the channel error probability is characterized.

  • 119.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Shirazinia, Amirpasha
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Iterative encoder-controller design based on approximate dynamic programming2010In: IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC, 2010Conference paper (Refereed)
    Abstract [en]

    In this paper, we study the iterative optimization of the encoder-controller pair for closed-loop control of a multi-dimensional plant over a noisy discrete memoryless channel. With the objective to minimize the expected linear quadratic cost over a finite horizon, we propose a joint design of the sensor measurement quantization, channel error protection, and optimal controller actuation. It was shown in our previous work that despite this optimization problem is known to be hard in general, an iterative design procedure can be derived to obtain a local optimal solution. However, in the vector case, optimizing the encoder for a fixed controller is in general not practically feasible due to the curse of dimensionality. In this paper, we propose a novel approach that uses the approximate dynamic programming (ADP) to implement a computationally feasible encoder updating policy with promising performance. Especially, we introduce encoder updating rules adopting the rollout approach. Numerical experiments are carried out to demonstrate the performance obtained by employing the proposed iterative design procedure and to compare it with other relevant schemes.

  • 120.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Encoder-controller design for control over the binary-input Gaussian channel2010In: IEEE International Symposium on Spread Spectrum Techniques and Applications, IEEE , 2010, p. 23-28Conference paper (Refereed)
    Abstract [en]

    In this paper, we consider the problem of the joint optimization of encoder-controller for closed-loop control with state feedback over a binary-input Gaussian channel (BGC). The objective is to minimize the expected linear quadratic cost over a finite horizon. Thisencoder-controller optimization problem is hard in general, mostly because of the curse of dimensionality. The result of this paper is a synthesis technique for a computationally feasible suboptimal controller which exploits both the soft and hard information of thechannel outputs. The proposed controller is efficient in the sense that it embraces measurement quantization, error protection and control over a finite-input infinite-output noisy channel. How to effectively implement this controller is also addressed in the paper. In particular, this is done by using Hadamard techniques. Numerical experiments are carried out to verify the promising gain offered by the combined controller, in comparison to the hard-information-based controller.

  • 121.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimized Rate Allocation for State Estimation over Noisy Channels2009In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, NEW YORK: IEEE , 2009, p. 2684-2688Conference paper (Refereed)
    Abstract [en]

    Optimal rate allocation in a networked control system with limited communication resources is instrumental to achieve satisfactory overall performance. In this paper, a practical rate allocation technique for state estimation in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall distortion is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved by using Lagrange duality. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations.

    Download full text (pdf)
    coding-control_isit09
  • 122.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimized rate allocation for state feedback control over noisy channels2009In: Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on, IEEE , 2009, p. 573-578Conference paper (Refereed)
    Abstract [en]

    Optimal rate allocation in a networked control system with highly limited communication resources is instrumental to achieve satisfactory overall performance. In this paper, we propose a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel. Our method consists of two steps: (i) the overall distortion is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. We show that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance compared to arbitrarily selected rate allocations.

  • 123.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Rate Allocation for Quantized Control Over Binary Symmetric Channels2012In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 60, no 6, p. 3188-3202Article in journal (Refereed)
    Abstract [en]

    Utility maximization in networked control systems (NCSs) is difficult in the presence of limited sensing and communication resources. In this paper, a new communication rate optimization method for state feedback control over a noisy channel is proposed. Linear dynamic systems with quantization errors, limited transmission rate, and noisy communication channels are considered. The most challenging part of the optimization is that no closed-form expressions are available for assessing the performance and the optimization problem is nonconvex. The proposed method consists of two steps: (i) the overall NCS performance measure is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize a weighted quadratic objective function is solved. The proposed method is applied to the problem of state feedback control and the problem of state estimation. Monte Carlo simulations illustrate the performance of the proposed rate allocation. It is shown numerically that the proposed method has better performance when compared to arbitrarily selected rate allocations. Also, it is shown that in certain cases nonuniform rate allocation can outperform the uniform rate allocation, which is commonly considered in quantized control systems, for feedback control over noisy channels.

  • 124.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Fischione, Carlo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Rate allocation for quantized control over noisy channels2009In: Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2009, Vol. WiOpt 2009, p. 595-603Conference paper (Refereed)
    Abstract [en]

    To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations.

    Download full text (pdf)
    coding-control_concom09
  • 125. Bao, Lei
    et al.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    A scheme for joint quantization, error protection and feedback control over noisy channels2007In: 2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13: PROCEEDINGS OF THE AMERICAN CONTROL CONFERENCE, IEEE , 2007, p. 2456-2461Conference paper (Refereed)
    Abstract [en]

    We study a closed-loop scalar control system with feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The goal is to minimize a linear quadratic cost function over a finite horizon. In particular we focus on a special case where we verify that certainty equivalence holds, and for this case we design joint source-channel encoder and decoder/estimator pairs. The proposed algorithm leads to a practically feasible design of time-varying non-uniform quantization and control. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm.

    Download full text (pdf)
    coding-control_acc07
  • 126.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Encoder-decoder design for event-triggered feedback control over bandlimited channels2006In: 2006 American Control Conference, IEEE , 2006, Vol. 1-12, p. 4183-4188Conference paper (Refereed)
    Abstract [en]

    Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization.

    Download full text (pdf)
    fulltext
  • 127.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Iterative Encoder-Controller Design for Feedback Control Over Noisy Channels2011In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 56, no 2, p. 265-278Article in journal (Refereed)
    Abstract [en]

    We study a closed-loop control system with state feedback transmitted over a noisy discrete memoryless channel. With the objective to minimize the expected linear quadratic cost over a finite horizon, we propose a joint design of the sensor measurement quantization, channel error protection, and controller actuation. It is argued that despite that this encoder-controller optimization problem is known to be hard in general, an iterative design procedure can be derived in which the controller is optimized for a fixed encoder, then the encoder is optimized for a fixed controller, etc. Several properties of such a scheme are discussed. For a fixed encoder, we study how to optimize the controller given that full or partial side-information is available at the encoder about the symbols received at the controller. It is shown that the certainty equivalence controller is optimal when the encoder is optimal and has full side-information. For a fixed controller, expressions for the optimal encoder are given and implications are discussed for the special cases when process, sensor, or channel noise is not present. Numerical experiments are carried out to demonstrate the performance obtained by employing the proposed iterative design procedure and to compare it with other relevant schemes.

    Download full text (pdf)
    coding-control_ieeetac10
  • 128.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On Iterative System Design and Separation in Control Over Noisy Channels2008In: IFAC World Congress, Volume 17, Part 1, IFAC , 2008Conference paper (Refereed)
    Abstract [en]

    We study a closed-loop control system with feedback transmitted over a noisy discrete memoryless channel. We design encoder-controller pairs that jointly optimize the sensor measurement quantization, protection against channel errors, and control. The designgoal is to minimize an expected linear quadratic cost over a finite horizon. As a result of deriving optimality criteria for this problem, we present new results on the validity of theseparation principle subject to certain assumptions. More precisely, we show that the certainty equivalence controller is optimal when the encoder is optimal and has full side-information about the symbols received at the controller. We then use this result to formulate tractable design criteria in the general case. Finally, numerical experiments are carried out to demonstrate the performance obtained by various design methods. 

  • 129. Bao, Lei
    et al.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On optimal system design for feedback control over noisy channels2007In: 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, IEEE , 2007, p. 2486-2490Conference paper (Refereed)
    Abstract [en]

    We study a closed-loop multivariable control system with sensor feedback transmitted over a discrete noisy channel. For this problem, we propose a joint design of the state measurement quantization, protection against channel errors, and control. The proposed algorithm leads to a practically feasible design of time-varying non-uniform encoding and control. Numerical results demonstrate the performance obtained by employing the proposed iterative optimization algorithm.

    Download full text (pdf)
    coding-control_isit07
  • 130.
    Bao, Lei
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On the separation principle in optimal control over noisy channels2008Conference paper (Refereed)
  • 131.
    Barceló, Guillem Casas
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Panahandeh, Ghazaleh
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Jansson, Magnus
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Image-Based Floor Segmentation in Visual Inertial Navigation2013In: 2013 IEEE International Instrumentation and Measurement Technology Conference (I2MTC), New York: IEEE , 2013, , p. 6p. 1402-1407Conference paper (Refereed)
    Abstract [en]

    This paper presents a floor segmentation algorithmfor indoor sequences that works with single grey-scale images.The portion of the floor closest to the camera is segmentedby judiciously joining a set of horizontal and vertical lines,previously detected. Since the proposed method is not based oncomputing the vanishing point, the system can deal with anykind of indoor scenes and adapts quickly to camera movements.A second contribution is the detection of moving features forpoints within the segmented floor area. Based on the estimatedcamera ego-motion, the ground plane homography is derived.Then, the expected optical flow for the ground points is calculatedand used for rejecting features that belong to moving obstacles.A key point of the designed method is that no restrictions on thecamera motion are imposed for the homography derivation.

    Download full text (pdf)
    fulltext
  • 132.
    Barenthin, Märta
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Bombois, Xavier
    TU Delft.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Mixed H-2 and H-Infinity$ Input Design for Multivariable Systems2006In: 14th IFAC Symposium on System Identification, 2006, p. 1335-1340Conference paper (Refereed)
    Abstract [en]

    In this contribution a new procedure for input design for identification of linear multivariable systems is proposed. The goal is to minimize the input power used in the system identification experiment. The quality constraint on the estimated model is formulated in H∞. The input design problem is converted to linear matrix inequalities by a separation of graphs theorem. For illustration, the proposed method is applied on a chemical distillation column and the result shows that it is optimal to amplify the low gain direction of the plant.

  • 133.
    Barenthin, Märta
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Bombois, Xavier
    TU Delft.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Scorletti, Gerard
    Ecole Centrale de Lyon.
    Identification for control of multivariable systems: Controller validation and experiment design via LMIs2008In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 44, no 12, p. 3070-3078Article in journal (Refereed)
    Abstract [en]

    This paper presents a new controller validation method for linear multivariable time-invariant models. Classical prediction error system identification methods deliver uncertainty regions which are nonstandard in the robust control literature. Our controller validation criterion computes an upper bound for the worst case performance, measured in terms of the H-infinity-norm of a weighted closed loop transfer matrix, achieved by a given controller over all plants in such uncertainty sets. This upper bound on the worst case performance is computed via an LMI-based optimization problem and is deduced via the separation of graph framework. Our main technical contribution is to derive, within that framework, a very general parametrization for the set of multipliers corresponding to the nonstandard uncertainty regions resulting from PE identification of MIMO systems. The proposed approach also allows for iterative experiment design. The results of this paper are asymptotic in the data length and it is assumed that the model structure is flexible enough to capture the true system.

  • 134.
    Barenthin, Märta
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Identification and control: Joint input design and H-infinity state feedback with ellipsoidal parametric uncertainty via LMIs2008In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 44, no 2, p. 543-551Article in journal (Refereed)
    Abstract [en]

    One obstacle in connecting robust control with models generated from prediction error identification is that very few control design methods are able to directly cope with the ellipsoidal parametric uncertainty regions that are generated by such identification methods. In this contribution we present a joint robust state feedback control/input design procedure which guarantees stability and prescribed closed-loop performance using models identified from experimental data. This means that given H-infinity specifications on the closed-loop transfer function are translated into sufficient requirements on the input signal spectrum used to identify the process. The condition takes the form of a linear matrix inequality.

  • 135.
    Barenthin, Märta
    et al.
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Wahlberg, Bo
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hjalmarsson, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Barkhagen, Mathias
    KTH, School of Electrical Engineering (EES), Automatic Control.
    Data-driven methods for L2-gain estimation2009In: IFAC Proceedings Volumes (IFAC-PapersOnline), 2009, Vol. 15, no PART 1, p. 1597-1602Conference paper (Refereed)
    Abstract [en]

    In this paper we present and discuss some data-driven methods for estimation of the L2-gain of dynamical systems. Partial results on convergence and statistical properties are provided. The methods are based on multiple experiments on the system. The main idea is to directly estimate the maximizing input signal by using iterative experiments on the true system. We study such a data-driven method based on a stochastic gradient method. We show that this method is very closely related to the so-called power iteration method based on the power method in numerical analysis. Furthermore, it is shown that this method is applicable for linear systems with noisy measurements. We will also study L2-gain estimation of Hammerstein systems. The stochastic gradient method and the power iteration method are evaluated and compared in simulation examples. © 2009 IFAC.

    Download full text (pdf)
    IR-EE-RT 2009:012
  • 136.
    Baudic, Gwilherm
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Complexity Efficient Decoder Design for Vehicular Communication2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Vehicular communication is currently seen as a key technology for enabling safer and more comfortable driving. In the general effort to reduce the number of casualties and improve the traffic flow despite an increasing number of vehicles, this field has a promising future. IEEE 802.11p has been chosen as the standard for the Physical Layer (PHY) design for wireless vehicular communication. However, the channels encountered in such situations pose several challenges for reliable communications. Time and frequency selectivity caused by dispersive environments and high mobility lead to doubly-selective channels. The systems are expected to conduct proper operation, in spite of these disturbances. In this thesis, we focus on the design of receivers working on the PHY layer, with an emphasis on limited complexity. This poses high constraints on the algorithms, which already have to cope with the limited amount of information provided by the training sequences. The solutions considered all involve joint channel estimation and decoding, characterized by the use of an iterative structure. Such structures allow the channel estimation to benefit from the knowledge brought by the decoder, which ultimately decreases the error rate. Following a previous work, we use algorithms based on Minimum Mean Square Error (MMSE) or Maximum A Posteriori (MAP) estimation. These receivers were modified to operate on full frames instead of individual subcarriers, and various improvements were studied. We provide a detailed analysis of the complexity of the proposed designs, along with an evaluation of their decoding performance. The trade-offs between these two parameters are also discussed. A part of these analyses isused in [10]. Finally, we give an insight into some considerations which may arise when implementing the algorithms on testbeds.

    Download full text (pdf)
    fulltext
  • 137. Bechlioulis, C. P.
    et al.
    Dimarogonas, Dimos V
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Automatic Control.
    Kyriakopoulos, K. J.
    Robust control of large vehicular platoons with prescribed transient and steady state performance2014In: Proceedings of the IEEE Conference on Decision and Control, IEEE conference proceedings, 2014, no February, p. 3689-3694Conference paper (Refereed)
    Abstract [en]

    In this paper, we consider the longitudinal control problem for a platoon of vehicles with unknown nonlinear dynamics. More specifically, we design a decentralized model-free control protocol in the sense that each vehicle utilizes only local relative information regarding its front vehicle, obtained by its on-board sensors, to calculate its own control signal, without incorporating any prior knowledge of the model nonlinearities/disturbances or any approximation structures to acquire such knowledge. Additionally, the transient and steady state response is a priori determined by certain designer-specified performance functions and is fully decoupled by the agents' dynamic model, the number of vehicles composing the platoon and the control gains selection, which relaxes significantly the control design procedure. Moreover, introducing certain inter-vehicular distance constraints during the transient response shaping, collisions between successive vehicles as well as connectivity breaks owing to limited sensing capabilities are provably avoided. Finally, the proposed methodology results in a low complexity design. Actually, it is a static scheme involving very few and simple calculations to output the control signal, thus making its distributed implementation straightforward.

  • 138. Bemporad, Alberto
    et al.
    Di Cairano, Stefano
    Henriksson, Erik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hybrid Model Predictive Control Based on Wireless Sensor Feedback: an experimental study2007In: Proceedings of the 46th IEEE Conference on Decision and Control, New Orleans, Louisiana, USA., 2007, p. 5062-5067Conference paper (Refereed)
    Abstract [en]

    This paper presents the design and the experimental validation of model predictive control (MPC) of a hybrid dynamical process based on measurements collected by a wireless sensor network. The proposed setup is the prototype of an industrial application in which a remote station controls the process via wireless network links. The experimental platform is a laboratory process consisting of four infrared lamps, controlled in pairs by two on/off switches, and of a transport belt, where moving parts equipped with wireless sensors are heated by the lamps. By approximating the stationary heat spatial distribution as a piecewise affine function of the position along the belt, the resulting plant model is a hybrid dynamical system. The control architecture is based on the reference governor approach: the process is actuated by a local controller, while a hybrid MPC algorithm running on a remote base station sends optimal belt velocity set-points and lamp on/off commands over a network link exploiting the information received through the wireless network. A discrete-time hybrid model of the process is used for the hybrid MPC algorithm and for the state estimator.

    Download full text (pdf)
    networked_control_cdc07_mpc
  • 139. Bemporad, Alberto
    et al.
    Di Cairano, Stefano
    Henriksson, Erik
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Hybrid model predictive control based on wireless sensor feedback: An experimental study2010In: International Journal of Robust and Nonlinear Control, ISSN 1049-8923, E-ISSN 1099-1239, Vol. 20, no 2, p. 209-225Article in journal (Refereed)
    Abstract [en]

    Design and experimental validation of model predictive control (MPC) of a hybrid dynamical laboratory process with wireless sensors is presented. The laboratory process consists of four infrared lamps, controlled in pairs by two on/off switches, and of a transport belt, where moving parts equipped with wireless sensors are heated by the lamps. The process, which is motivated by heating processes in the plastic and printing industry, presents interesting hybrid dynamics. By approximating the stationary heat spatial distribution as a piecewise affine function of the position along the belt, the resulting plant model is a hybrid dynamical system. The control architecture is based on the reference governor approach: the process is actuated by a local controller, while a hybrid MPC algorithm running on a remote base station sends optimal belt velocity setpoints and lamp on/off commands over a wireless link, exploiting the sensor information received through the wireless network. A discrete-time hybrid model of the process is used for the hybrid MPC algorithm and for the state estimator. The physical modelling of the process and the hybrid MPC algorithm are presented in detail, together with the hardware and software architectures. The experimental results show that the presented theoretical framework is well suited for control of the new laboratory process, and that the process can be used as a prototype system for evaluating hybrid and networked control strategies.

    Download full text (pdf)
    networked_control_ijrnc09mpc
  • 140.
    Bengtsson, Mats
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    ALGORITHMIC SOLUTIONS FOR PILOT DESIGN OPTIMIZATION IN ARBITRARILY CORRELATED SCENARIOS2014Conference paper (Refereed)
    Abstract [en]

    We consider optimized design of training sequences, given knowledge of the channel and noise statistics. Recently, pilot designs considering the end performance of the channel estimate, have been proposed, both optimizing the average performance and the performance at a certain outage level. Unfortunately, these problems, as well as previously proposed designs optimizing the channel estimation MSE, are non-convex for arbitrary channel and noise correlations so additional assumptions have been introduced in the literature to be able to find tractable solutions. Here, we show that arbitrarily correlated scenarios can easily be handled by resorting to alternating optimization, for all the previously mentioned problem formulations. Furthermore, we numerically compare the average and outage performance of the proposed algorithms, to alternative solutions adopted from the literature.

  • 141.
    Bengtsson, Mats
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Spatial Interference Suppression for Shared Spectrum2008In: ICT Mobile and Wireless Communications Summit / [ed] Paul Cunningham and Miriam Cunningham, IIMC International Information Management Corporation , 2008Conference paper (Refereed)
    Abstract [en]

    We consider a scenario where a (future generation) cellular system shares the spectrum with a fixed-satellite services (FSS) system or other system that has primary access to the radio spectrum. Normally, the coverage of such a cellular system will have to stay outside an exclusion zone around the FSS ground station, to keep the interference low enough. Here we investigate how spatial interference suppression can be used at a transmitting multi-antenna base station to reduce the exclusion zone and provide downlink coverage closer to the FSS ground station. The study considers both transmit schemes that exploit knowledge about the channel between the base station and mobile station, as well as schemes that only rely on partial or no channel knowledge at all. Numerical examples illustrate that the interference level for the primary system can be reduced by at least 20dB, without a major loss of quality of service within the secondary system.

  • 142.
    Bengtsson, Mats
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.
    Optimal Downlink BeamformingUsing Semidefinite Optimization1999In: Proc. of 37th Annual Allerton Conference on Communication,Control, and Computing, 1999, p. 987-996Conference paper (Other academic)
    Abstract [en]

    When using antenna arrays at the base station of a cellular system, one critical aspectis the transmission strategy. An optimal choice of beamformers for simultaneous transmissionto several co-channel users must be solved jointly for all users and base stations in anarea. We formulate an optimal transmit strategy and show how the solution can be calculatedefficiently using interior point methods for semidefinite optimization. The algorithmminimizes the total transmitted power under certain constraints to guarantee a specificquality of service. The method provides large flexibility in the choice of constraints andcan be extended to be robust to channel perturbations.

    Download full text (pdf)
    fulltext
  • 143. Berardinelli, G.
    et al.
    Zetterberg, Per
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Tonelli, O.
    Cattoni, A. F.
    Sørensen, T. B.
    Mogensen, P.
    An SDR architecture for OFDM transmission over USRP2 boards2011In: Conference Record: Asilomar Conference on Signals, Systems and Computers, 2011, p. 965-969Conference paper (Refereed)
    Abstract [en]

    The Universal Software Radio Peripheral (USRP) developed by Ettus research is emerging as one of the most promising hardware solution for building a Software Defined Radio (SDR) platform. Originally designed for supporting GNU radio, it can also be interfaced to customized C++ code, thus allowing a higher degree of flexibility in the design of the transceiver chain. In this paper we describe the implementation of a coded Orthogonal Frequency Division Multiplexing (OFDM) transceiver running over USRP2 boards. The baseband processing and the radio-frequency settings are designed for coping with a local area scenario as well as with the physical capabilities of the USRP2 boards. Moreover, a simple subcarrier blinding algorithm is proposed with the aim of compensating the common phase error in the symbol constellation due to the limited nominal accuracy of the local oscillators. Performance results show the effectiveness of the proposed architecture and settings for achieving Block Error Rate (BLER) results below 1% at 12 dB of Signal-to-Noise Ratio (SNR) without requiring a high precision reference clock.

  • 144. Bergenheim, Jon
    et al.
    Händel, Peter
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Remle, Susanne
    Ekosläckning2002Patent (Other (popular science, discussion, etc.))
    Abstract [en]

    The present invention relates to a cancellation of echoes in telecommunications systems, more specifically it relates to adaptive alignment of a linear filter (500) used for echo cancellation. According to the invention, it is continuously determined, by means of control logic (520), if a reflection replica delay included in an echo replica signal (110), which delay is provided by a signal buffer (510), should be attempted to be increased or not. Similarly, it is continuously determined if the reflection replica delay should be attempted to be decreased or not. In this way it is possible to provide a delay of the reflection replica which corresponds to the pure delay of a corresponding reflection included in an echo signal (120) received over an echo path. The invention is advantageous since the filter (500) will continuously and quickly adapt to changes in the echo path delay by continuously increasing or decreasing, in an incremental and smooth manner, a present replica delay.

  • 145.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Järmyr, Simon
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Jorswieck, E.
    Optimization with skewed majorization constraints: Application to MIMO systems2008Conference paper (Refereed)
    Abstract [en]

    This paper considers the problem of optimizing a Schur-convex objective under a linearly shifted, or skewed, majorization constraint. Similar to the case with a regular majorization constraint, the solution is found to be the same for the entire class of cost functions. Furthermore, it is shown that the problem is equivalent to identifying the convex hull under a simple polygon defined by the constraint parameters. This leads to an algorithm that produces the exact optimum with linear computational complexity. As an application, we present a novel precoder design for a multi-input multi-output communication system with heterogeneous signal constellations utilizing decision feedback detection at the receiver.

  • 146.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lattice based linear precoding for MIMO block codes2007In: 2007 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE , 2007, p. 329-332Conference paper (Refereed)
    Abstract [en]

    Herein, the design of linear dispersion codes for block based multiple-input multiple-output communication systems is investigated. The receiver as well as the transmitter are assumed to have perfect knowledge of the channel, and the receiver is assumed to employ maximum likelihood detection. We propose to use linear precoding and lattice invariant operations to transform the channel matrix into a lattice with large coding gain. With appropriate approximations, it is shown that this corresponds to selecting lattices with good sphere packing properties. Lattice invariant transformations are then used to minimize the power consumption. An algorithm for this power minimization is presented along with a lower bound on the optimization. Numerical results indicate that there is a potential gain of several dB by using the method compared to channel inversion with adaptive bit loading.

  • 147.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lattice-based linear precoding for MIMO channels with transmitter CSI2008In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 56, no 7, p. 2902-2914Article in journal (Refereed)
    Abstract [en]

    Herein, the design of linear dispersion codes for multiple-input multiple-output communication systems is investigated. The receiver as well as the transmitter are assumed to have perfect knowledge of the channel, and the receiver is assumed to employ maximum likelihood detection. We propose to use linear precoding and lattice invariant operations to transform the channel matrix into a lattice generator matrix with large minimum distance separation. With appropriate approximations, it is shown that this corresponds to selecting lattices with good sphere-packing properties. Lattice invariant transformations are then used to minimize the power consumption. An algorithm for this power minimization is presented along with a lower bound on the optimization. Numerical results indicate significant gains by using the proposed method compared to channel diagonalization with adaptive bit loading.

  • 148.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Palomar, Daniel P.
    Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Joint Bit Allocation and Precoding for MIMO Systems With Decision Feedback Detection2009In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 57, no 11, p. 4509-4521Article in journal (Refereed)
    Abstract [en]

    This paper considers the joint design of bit loading, precoding and receive filters for a multiple-input multiple-output (MIMO) digital communication system employing decision feedback (DF) detection at the receiver. Both the transmitter as well as the receiver are assumed to know the channel matrix perfectly. It is well known that, for linear MIMO transceivers, a diagonal transmission (i.e., orthogonalization of the channel matrix) is optimal for some criteria. Surprisingly, it was shown five years ago that for the family of Schur-convex functions an additional rotation of the symbols is necessary. However, if the bit loading is optimized jointly with the linear transceiver, then this rotation is unnecessary. Similarly, for DF MIMO optimized transceivers a rotation of the symbols is sometimes needed. The main result of this paper shows that for a DF MIMO transceiver where the bit loading is jointly optimized with the transceiver filters, the rotation of the symbols becomes unnecessary, and because of this, also the DF part of the receiver is not required. The proof is based on a relaxation of the available bit rates on the individual substreams to the set of positive real numbers. In practice, the signal constellations are discrete and the optimal relaxed bit loading has to be rounded. It is shown that the loss due to rounding is small, and an upper bound on the maximum loss is derived. Numerical results are presented that confirm the theoretical results and demonstrate that orthogonal transmission and the truly optimal DF design perform almost equally well.

  • 149.
    Bergman, Svante
    et al.
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Palomar, Daniel P.
    Dept. of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong.
    Ottersten, Björn
    KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Optimal Bit Loading for MIMO Systems with Decision Feedback Detection2009In: 2009 IEEE Vehicular Technology Conference, IEEE , 2009, p. 831-835Conference paper (Refereed)
    Abstract [en]

    This paper considers the joint design of bit loading, precoding and receive filters for a multiple-input multiple-output (MIMO) digital communication system employing decision feedback (DF) detection at the receiver. Both the transmitter as well as the receiver are assumed to know the channel matrix perfectly. It is well known that, for linear MIMO transceivers, a diagonal transmission (i.e., orthogonalization of the matrix channel) is optimal for some criteria. Surprisingly, it was shown five years ago that for the family of Schur-convex functions an additional rotation of the symbols is necessary. However, if the bit loading is optimized jointly with the linear transceiver, then the rotation is unnecessary. Similarly, for DF MIMO transceivers, a rotation of the symbols is sometimes needed. The main result of this paper shows that for a DF MIMO transceiver where the bit loading is jointly optimized with the transceiver filters, the rotation of the symbols becomes unnecessary and, consequently, also the DF part of the receiver is not required.

  • 150. Besselink, B.
    et al.
    Feyzmahdavian, Hamid Reza
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Håkan
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Mikael
    KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    D-stability and delay-independent stability of monotone nonlinear systems with max-separable Lyapunov functions2016In: 2016 IEEE 55th Conference on Decision and Control, CDC 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 3172-3177, article id 2-s2.0-85010722892Conference paper (Refereed)
    Abstract [en]

    Stability properties of monotone nonlinear systems with max-separable Lyapunov functions are considered in this paper, motivated by the following observations. First, recent results have shown that such Lyapunov functions are guaranteed to exist for asymptotically stable monotone systems on compact sets. Second, it is well-known that, for monotone linear systems, asymptotic stability implies the stronger properties of D-stability and robustness with respect to time-delays. This paper shows that similar properties hold for monotone nonlinear systems that admit max-separable Lyapunov functions. In particular, a notion of D-stability for monotone nonlinear systems and delay-independent stability will be discussed. The theoretical results are illustrated by means of examples.

1234567 101 - 150 of 2323
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf