Cergy, France
Cergy, France
SEARCH FILTERS
Time filter
Source Type

Grant
Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2011.9.1 | Award Amount: 2.16M | Year: 2013

The ongoing miniaturization of data processing and storage devices and the imperative of low-energy consumption can only be sustained through low-powered components. Lower supply voltages and variations in technological process of emerging nanoelectronic devices make them inherently unreliable. As a consequence, the nanoscale integration of chips built out of unreliable components has emerged as one of the most critical challenges for the next-generation electronic circuit design. To make such nanoscale integration economically viable, new solutions for efficient and fault-tolerant data processing and storage must now be invented. The i-RISC project aims at achieving these goals, by providing innovative fault-tolerant solutions at both device- and system-level that are fundamentally rooted in mathematical models, algorithms, and techniques of information theory. Proposed solutions will build on error correcting codes and encoder/decoder architectures able to provide reliable error protection even if they themselves operate on unreliable hardware. The project will develop the scientific foundation and provide a first proof-of-concept by validating the proposed solutions on accurate error models and energy measurement tools developed within the project. In the forthcoming challenge of nanoscale technologies, the i-RISC project is an essential prerequisite for preparing the European industry for this paradigm shift.


Grant
Agency: European Commission | Branch: FP7 | Program: NOE | Phase: ICT-2007.1.1 | Award Amount: 9.17M | Year: 2008

NEWCOM\\ is the acronym of a proposed Network of Excellence in Wireless COMmunications, submitted to Call 1 of the VII Framework Programme under the Objective ICT-2007.1.1: The Network of the Future, mainly in its target direction Ubiquitous network infrastructure and architectures. The current proposal draws inspiration, shape/form, and substantive direction from its successful predecessor, the NoE NEWCOM, which was approved and funded by the EC for 36 months starting March 1st, 2004 and ending February 28, 2007. At the same time, NEWCOM\\ aspires to inject new vision, expanded roles, ever-higher degrees of research integration, and a definitive roadmap to financial security for the long-term life of this undertaking in the European research and higher-learning space. The core concept of NEWCOM\\ is that of an NoE of medium size, greatly reduced from the initial NEWCOM Consortium, formed by keeping the most committed and performing partners, exploiting the successful integration tools that NEWCOM designed and activated, and which is created for the purpose of scientifically addressing medium/long term, complex, interdisciplinary, fundamental research problems in the field of wireless networks, focused towards identifying, posing in the right modelling perspective, and at least partially characterizing the information-communication theoretical limits. Its main objectives are: Identify a selective set of scenarios, Define suitable performance measures that take into account the wireless channel nature, Perform a detailed analysis of the main theoretical results available, Evaluate information-theoretical bounds on the achievable performance, Design and analyze transmitting/receiving algorithms and protocols in order to approach those limits, Analyze implementation aspects of the above algorithms in flexible, energy-aware user terminals, Output the major findings into an integrated simulation library, Enhance the already good cooperation level among research


Sassatelli L.,French National Center for Scientific Research | Declercq D.,ENSEA Cergy
IEEE Transactions on Information Theory | Year: 2010

In this paper, a new class of low-density parity-check (LDPC) codes, named hybrid LDPC codes, is introduced. Hybrid LDPC codes are characterized by an irregular connectivity profile and heterogeneous orders of the symbols in the codeword. It is shown in particular that the class of hybrid LDPC codes can be asymptotically characterized and optimized using density evolution (DE) framework, and a technique to maximize the minimum distance of the code is presented. Numerical assessment of hybrid LDPC code performances is provided, by comparing them to protograph-based and multiedge-type (MET) LDPC codes. Hybrid LDPC codes are shown to allow to achieve an interesting tradeoff between good error-floor performance and good waterfall region with nonbinary coding techniques. © 2010 IEEE.


Grant
Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2007.1.1 | Award Amount: 3.63M | Year: 2008

The DaVinci project aims at developing new technologies targeting future B3G or 4G wireless broadband transmission systems such as IEEE 802.16e/m, or 3GPP-LTE. It is well known that the increase in data rate and heterogeneous transport in wireless networks demands very efficient coding schemes, coupled with adaptive resource allocation strategies. Beside the recent progress made these last 15 years, coded modulation schemes presenting near-Shannon performance at high spectral efficiency with short blocks are still missing. Besides, whilst most of the European technology has focused on Turbo-Codes (3GPP, DVB-RCS, IEEE 802.16), it has facilitated as a side effect development of the competing technology, namely LDPC codes worldwide (3GPP2, DVB-S2, IEEE 802.11n).\nIn order to ensure European supremacy in enabling technologies mandatory for IMT-Advanced systems, the DaVinci project plans to go beyond usual LDPC codes, and develop breakthrough channel coding, together with tailored Link Level technologies. The DaVinci solution is based on systems which completely operate using high order nonbinary symbols, in all receiver blocks. However, the expected performance gain comes at the expense of increased hardware complexity, and unsolved technical issues such as nonbinary Hybrid-ARQ strategies, or nonbinary turbo-receivers. Consequently, low complexity nonbinary LDPC codes/decoders will be developed in the DaVinci project, and compared in a realistic framework, using a versatile FPGA implementation and real link using a MIMO-OFDM platform.\nOur consortium has a strong expertise in the design of efficient, but practical B3G/4G communication systems, and we believe that the joint design of the code, the resource allocation and the hardware model is the necessary basis for proposing better systems for next generation wireless networks. We target, as main dissemination of the DaVinci project, a system proposal for the IMT-advanced call in 2008-2009.


State bounding observation based on zonotopes is the subject of this paper. Dealing with zonotopes is motivated by set operations resulting in simple matrix calculations with regard to the often huge number of facets and vertices of the equivalent polytopes. Discrete-time LTV/LPV systems with state and measurement uncertainties are considered. Based on a new zonotope size criterion called FW-radius, and by merging optimal and robust observer gain designs, a Zonotopic Kalman Filter (ZKF) is proposed with a proof of robust convergence. The notion of covariation is introduced and results in an explicit bridge between the zonotopic set-membership and the stochastic paradigms for Kalman Filtering. No intersection is used and the influence of the reduction operator limiting to a tunable maximum the size of the matrices involved in the zonotopic set computations is fully taken into account in the LMI-based robust stability analysis. A numerical example illustrates the effectiveness of the proposed ZKF. © 2015 Elsevier Ltd.


Paolini E.,University of Bologna | Fossorier M.P.C.,ENSEA Cergy | Chiani M.,University of Bologna
IEEE Transactions on Information Theory | Year: 2010

In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the binary erasure channel (BEC), based on extrinsic information transfer (EXIT) chart, is described. This method overcomes the problem consisting of the impossibility to evaluate the EXIT function for the check or variable component codes, in situations where the information functions or split information functions for component codes are unknown. According to the proposed technique, GLDPC codes and D-GLDPC codes where the generalized check and variable component codes are random codes with minimum distance at least 2, are considered. A technique is then developed which finds the EXIT chart for the overall GLDPC or D-GLDPC code, by evaluating the expected EXIT function for each check and variable component code. This technique is finally combined with the differential evolution algorithm in order to generate some good GLDPC and D-GLDPC edge distributions. Numerical results of long, random codes, are presented which confirm the effectiveness of the proposed approach. They also reveal that D-GLDPC codes can outperform standard LDPC codes and GLDPC codes in terms of both waterfall performance and error floor. © 2006 IEEE.


Aggoune W.,ENSEA Cergy
Proceedings of the IEEE Conference on Decision and Control | Year: 2011

In this paper, the problem of feedback stabilization of stochastic differential delay systems is considered. The systems under study are nonlinear, nonaffine and involve both discrete and distributed delays. By using a LaSalle-type theorem for stochastic systems, general conditions for stabilizing the closed-loop system with delays are obtained. In addition, stabilizing state feedback control laws are proposed. © 2011 IEEE.


Raka S.-A.,ENSEA Cergy | Combastel C.,ENSEA Cergy
Annual Reviews in Control | Year: 2013

A dynamic interval approach for the fast computation of robust adaptive thresholds for a class of uncertain linear systems is the subject of this paper. An extension of recent results about the design of stable interval observers for linear systems with additive time-varying zonotopic input bounds is proposed. It allows the explicit computation of adaptive thresholds ensuring a guaranteed robustness with respect to structured and bounded disturbances which can be not only additive but also multiplicative. Moreover, the constant term (center) of the uncertain time-varying state matrix need not be diagonalizable thanks to results based on a Jordan decomposition. A sufficient condition not only ensuring the stability of the initial uncertain model but also the nondivergence of the computed adaptive thresholds is given. A numerical example dealing with fault detection in an electrical drive illustrates the proposed scheme. © 2013 Elsevier Ltd. All rights reserved.


Combastel C.,ENSEA Cergy
IEEE Transactions on Automatic Control | Year: 2013

This technical note deals with the design of stable interval observers and estimators for continuous-time linear dynamic systems under uncertain initial states and uncertain inputs enclosed within time-varying zonotopic bounds. No monotony assumption such as cooperativity is required in the vector field: the interval observer stability directly derives from the stability of the observer state matrix, where any poles (real or complex, single or multiple) are handled in the same way. © 2012 IEEE.


Combastel C.,ENSEA Cergy
IFAC Proceedings Volumes (IFAC-PapersOnline) | Year: 2012

This paper deals with a set-membership approach for the fast computation of robust adaptive thresholds. Dynamic model based fault detection under bounded additive and multiplicative disturbances is considered. Based on recent results related to the design of stable interval observers for linear systems with additive time-varying zonotopic input bounds, an extension guaranteeing the robustness with respect to structured and bounded multiplicative disturbances is proposed. A sufficient condition not only ensuring the stability of the initial uncertain model but also the non divergence of the computed bounds (i.e. adaptive thresholds) is also given. Then, a numerical example illustrates the proposed scheme. © 2012 IFAC.

Loading ENSEA Cergy collaborators
Loading ENSEA Cergy collaborators