Generalised modal realisation as a practical and efficient tool for FWL implementation

Autor: Philippe Chevrel, Yu Feng, Thibault Hilaire
Přispěvatelé: Institut de Recherche en Communications et en Cybernétique de Nantes (IRCCyN), Mines Nantes (Mines Nantes)-École Centrale de Nantes (ECN)-Ecole Polytechnique de l'Université de Nantes (EPUN), Université de Nantes (UN)-Université de Nantes (UN)-PRES Université Nantes Angers Le Mans (UNAM)-Centre National de la Recherche Scientifique (CNRS), Performance et Qualité des Algorithmes Numériques (PEQUAN), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
Jazyk: angličtina
Rok vydání: 2011
Předmět:
Zdroj: International Journal of Control
International Journal of Control, Taylor & Francis, 2011, 84 (1), pp.66-77. ⟨10.1080/00207179.2010.540714⟩
International Journal of Control, 2011, 84 (1), pp.66-77. ⟨10.1080/00207179.2010.540714⟩
ISSN: 0020-7179
1366-5820
DOI: 10.1080/00207179.2010.540714⟩
Popis: International audience; Finite word length (FWL) effects have been a critical issue in digital filter implementation for almost four decades. Although some optimisations may be attempted to get an optimal realisation with regards to a particular effect, for instance the parametric sensitivity or the round-off noise gain, the purpose of this article is to propose an effective one, i.e. taking into account all the aspects. Based on the specialised implicit form, a new effective and sparse structure, named rho-modal realisation, is proposed. This realisation meets simultaneously accuracy (low sensitivity, round-off noise gain and overflow risk), few and flexible computational efforts with a good readability (thanks to sparsity) and simplicity (no tricky optimisation is required to obtain it) as well. Two numerical examples are included to illustrate the rho-modal realisation's interest.
Databáze: OpenAIRE