Section: New Results
Communication and control co-design for networked systems
Energy-aware communication and control co-design in wireless networked control systems
Participants : C. Canudas de Wit [Contact person] , N. Cardoso de Castro, F. Garin, D. Quevedo [Newcastle Univ., Australia] .
This work is the topic of the PhD thesis of N. Cardoso de Castro  . We have considered an event-based approach to energy-efficient management of the radio chip in the sensor node of a wireless networked control system.. Indeed, as we had pointed out in the review paper  , the radio is the main energy consumer, and intermittent data transmission allows one to reduce the use of the radio. While the existing literature in the control community on event-based control only addresses policies using two radio-modes (Transmitting/Sleep), our work follows some considerations on the radio-chip modes well-known in the communication networks literature, and introduces various radio-modes: different `idle' non-transmitting modes, where only part of the radio-chip is switched off (thus consuming more energy than `Sleep', but allowing for faster transition to transmission), and various transmitting modes, with different power levels. We propose an event-based radio-mode switching policy, which allows to perform a trade-off between energy saving and performance of the control application. To this end, a switched model describes the system, taking into account control and communication. The optimal switching policy is computed using Dynamic Programming, considering a cost either over an infinite time-horizon  or over a finite receding horizon  .
System-theoretic analysis of modern error correcting codes (serial turbo codes)
Participants : F. Garin [Contact person] , G. Como [Lund Univ., Sweden] , F. Fagnani [Polit. Torino, Italy] .
Serial turbo codes are a family of codes for error correction in point-to-point digital communication. The encoder can be described as the composition of three linear maps, the intermediate one being a permutation (called interleaver) while the inner and outer one are convolutional codes, i.e., linear dynamical systems where state, input and output belong to a vector space over the finite field . The decoding is performed with iterative low-complexity algorithms which give a good approximation of the optimal maximum-likelihood (ML) decoder. Using system-theoretic properties of the constituent convolutional codes and probabilistic arguments, we study the average and the typical behavior of ensembles of such codes (with fixed convolutional codes, and random interleaver), asymptotically in the block-length  . We disprove the common conjecture that the typical behavior concentrates around the average: indeed, the average error decays polynomially in the block-length , while the typical code has a faster error decay (exponential in some fractional power of ); however, the typical-code analysis confirms the same design parameters for the convolutional codes that were already suggested by the study of the ensemble average: free distance of the outer encoder, and effective free distance of the inner encoder.