<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01918650v2</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-18T18:59:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Arithmetic approaches for rigorous design of reliable Fixed-Point LTI filters</title>
            <author role="aut">
              <persName>
                <forename type="first">Anastasia</forename>
                <surname>Volkova</surname>
              </persName>
              <email type="md5">8194e686aafb0fcfe44b6784e4dff79f</email>
              <email type="domain">univ-nantes.fr</email>
              <idno type="idhal" notation="string">a-volkova</idno>
              <idno type="idhal" notation="numeric">5476</idno>
              <idno type="halauthorid" notation="string">23766-5476</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-0702-5652</idno>
              <idno type="IDREF">https://www.idref.fr/080754643</idno>
              <orgName ref="#struct-93591"/>
              <affiliation ref="#struct-178327"/>
              <affiliation ref="#struct-473973"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Thibault</forename>
                <surname>Hilaire</surname>
              </persName>
              <email type="md5">a2a13f02ff5e5d7c79d21d5a332afa00</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">thibault-hilaire</idno>
              <idno type="idhal" notation="numeric">1144</idno>
              <idno type="halauthorid" notation="string">8138-1144</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6365-9695</idno>
              <idno type="IDREF">https://www.idref.fr/110983300</idno>
              <orgName ref="#struct-93591"/>
              <affiliation ref="#struct-212219"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christoph</forename>
                <surname>Lauter</surname>
              </persName>
              <email type="md5">df8c4631b4ab1b79d8bb6d9d7f41d3fc</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">christoph-lauter</idno>
              <idno type="idhal" notation="numeric">13523</idno>
              <idno type="halauthorid" notation="string">2127-13523</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7335-8220</idno>
              <idno type="IDREF">https://www.idref.fr/13979459X</idno>
              <affiliation ref="#struct-344819"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Thibault</forename>
                <surname>Hilaire</surname>
              </persName>
              <email type="md5">a2a13f02ff5e5d7c79d21d5a332afa00</email>
              <email type="domain">lip6.fr</email>
            </editor>
            <funder ref="#projanr-47707"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2018-11-12 11:22:09</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2019-12-04 16:01:24</date>
              <date type="whenModified">2026-01-19 16:46:19</date>
              <date type="whenReleased">2019-12-04 16:13:14</date>
              <date type="whenProduced">2020-04-01</date>
              <date type="whenEndEmbargoed">2019-12-04</date>
              <ref type="file" target="https://hal.science/hal-01918650v2/document">
                <date notBefore="2019-12-04"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01918650v2/file/wcpg.pdf" id="file-2394037-2287926">
                <date notBefore="2019-12-04"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-01918650/file/wcpg.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="303086">
                <persName>
                  <forename>Thibault</forename>
                  <surname>Hilaire</surname>
                </persName>
                <email type="md5">a2a13f02ff5e5d7c79d21d5a332afa00</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01918650</idno>
            <idno type="halUri">https://hal.science/hal-01918650</idno>
            <idno type="halBibtex">volkova:hal-01918650</idno>
            <idno type="halRefHtml">&lt;i&gt;IEEE Transactions on Computers&lt;/i&gt;, 2020, 69 (4), pp.489 - 504. &lt;a target="_blank" href="https://dx.doi.org/10.1109/TC.2019.2950658"&gt;&amp;#x27E8;10.1109/TC.2019.2950658&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">IEEE Transactions on Computers, 2020, 69 (4), pp.489 - 504. &amp;#x27E8;10.1109/TC.2019.2950658&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2394037-2287926"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
            <idno type="stamp" n="UNIV-NANTES">Université de Nantes</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="EC-NANTES">Ecole Centrale de Nantes</idno>
            <idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNAM">l'unam - université nantes angers le mans</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LRI-VALS" corresp="UMR8623">Laboratoire de Recherche en Informatique. Équipe: Vérification d'Algorithmes, Langages et Systèmes</idno>
            <idno type="stamp" n="LS2N">Laboratoire des Sciences du Numérique de Nantes</idno>
            <idno type="stamp" n="LS2N-OGRE" corresp="LS2N">LS2N - équipe OGRE ( Optimisation Globale et Résolution Ensembliste )</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="ENS-PSACLAY">Ecole Normale Supérieure Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="GS-LIFE-SCIENCES-HEALTH" corresp="UNIVERSITE-PARIS-SACLAY">Graduate School Life Sciences and Health</idno>
            <idno type="stamp" n="LMF">Laboratoire Méthodes Formelles</idno>
            <idno type="stamp" n="LMF-AR">Arithmétique</idno>
            <idno type="stamp" n="NANTES-UNIVERSITE">Nantes Université</idno>
            <idno type="stamp" n="UNIV-NANTES-AV2022">Université de Nantes</idno>
            <idno type="stamp" n="NU-CENTRALE">École Centrale de Nantes</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
            <idno type="stamp" n="INRIA-ETATSUNIS">Copublications Inria-Etats-Unis</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Arithmetic approaches for rigorous design of reliable Fixed-Point LTI filters</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Anastasia</forename>
                    <surname>Volkova</surname>
                  </persName>
                  <email type="md5">8194e686aafb0fcfe44b6784e4dff79f</email>
                  <email type="domain">univ-nantes.fr</email>
                  <idno type="idhal" notation="string">a-volkova</idno>
                  <idno type="idhal" notation="numeric">5476</idno>
                  <idno type="halauthorid" notation="string">23766-5476</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-0702-5652</idno>
                  <idno type="IDREF">https://www.idref.fr/080754643</idno>
                  <orgName ref="#struct-93591"/>
                  <affiliation ref="#struct-178327"/>
                  <affiliation ref="#struct-473973"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Thibault</forename>
                    <surname>Hilaire</surname>
                  </persName>
                  <email type="md5">a2a13f02ff5e5d7c79d21d5a332afa00</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">thibault-hilaire</idno>
                  <idno type="idhal" notation="numeric">1144</idno>
                  <idno type="halauthorid" notation="string">8138-1144</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6365-9695</idno>
                  <idno type="IDREF">https://www.idref.fr/110983300</idno>
                  <orgName ref="#struct-93591"/>
                  <affiliation ref="#struct-212219"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christoph</forename>
                    <surname>Lauter</surname>
                  </persName>
                  <email type="md5">df8c4631b4ab1b79d8bb6d9d7f41d3fc</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">christoph-lauter</idno>
                  <idno type="idhal" notation="numeric">13523</idno>
                  <idno type="halauthorid" notation="string">2127-13523</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7335-8220</idno>
                  <idno type="IDREF">https://www.idref.fr/13979459X</idno>
                  <affiliation ref="#struct-344819"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">5369</idno>
                <idno type="issn">0018-9340</idno>
                <title level="j">IEEE Transactions on Computers</title>
                <imprint>
                  <publisher>Institute of Electrical and Electronics Engineers</publisher>
                  <biblScope unit="volume">69</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">489 - 504</biblScope>
                  <date type="datePub">2020-04-01</date>
                  <date type="dateEpub">2019-10-31</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/TC.2019.2950658</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Eigendecomposition</term>
                <term xml:lang="en">Floating-Point Arithmetic</term>
                <term xml:lang="en">Multiple Precision</term>
                <term xml:lang="en">Digital Filters</term>
                <term xml:lang="en">Interval Arithmetic</term>
                <term xml:lang="en">Table Maker's Dilemma</term>
                <term xml:lang="en">Gershgorin circles</term>
                <term xml:lang="en">Fixed-Point Arithmetic</term>
                <term xml:lang="en">Reliable Computations</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ao">Computer Science [cs]/Computer Arithmetic</classCode>
              <classCode scheme="halDomain" n="info.info-na">Computer Science [cs]/Numerical Analysis [cs.NA]</classCode>
              <classCode scheme="halDomain" n="info.info-ms">Computer Science [cs]/Mathematical Software [cs.MS]</classCode>
              <classCode scheme="halDomain" n="info.info-ts">Computer Science [cs]/Signal and Image Processing</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper we target the Fixed-Point (FxP) implementation of Linear Time-Invariant (LTI) filters evaluated with state-space equations. We assume that wordlengths are fixed and that our goal is to determine binary point positions that guarantee the absence of overflows while maximizing precision. We provide a model for the worst-case error analysis of FxP filters that gives tight bounds on the output error. Then we develop an algorithm for the determination of binary point positions that takes rounding errors and their amplification fully into account. The proposed techniques are rigorous, i.e. based on proofs, and no simulations are ever used. In practice, Floating-Point (FP) errors that occur in the implementation of FxP design routines can lead to overestimation/underestimation of result parameters. Thus, along with FxP analysis of digital filters, we provide FP analysis of our filter design algorithms. In particular, the core measure in our approach, Worst-Case Peak Gain, is defined as an infinite sum and has matrix powers in it. We provide fine-grained FP error analysis of its evaluation and develop multiple precision algorithms that dynamically adapt their internal precision to satisfy an a priori absolute error bound. Our techniques on multiple precision matrix algorithms, such as eigendecomposition, are of independent interest as a contribution to Computer Arithmetic. All algorithms are implemented as C libraries, integrated into an open-source filter code generator and tested on numerical examples.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-178327" status="OLD">
          <idno type="RNSR">201221021B</idno>
          <orgName>Arithmetic and Computing</orgName>
          <orgName type="acronym">ARIC</orgName>
          <date type="start">2013-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 Lyon France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/aric</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2497" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-35418" type="direct"/>
            <relation active="#struct-6818" type="indirect"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="indirect"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-473973" status="OLD">
          <idno type="IdRef">203637585</idno>
          <idno type="RNSR">201722241F</idno>
          <idno type="ROR">https://ror.org/02snf8m58</idno>
          <orgName>Laboratoire des Sciences du Numérique de Nantes</orgName>
          <orgName type="acronym">LS2N</orgName>
          <date type="start">2017-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>Université de Nantes – faculté des Sciences et Techniques (FST)2 Chemin de la HoussinièreBP 92208, 44322 Nantes Cedex 3</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ls2n.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-97058" type="direct"/>
            <relation active="#struct-93263" type="indirect"/>
            <relation active="#struct-111023" type="direct"/>
            <relation name="UMR6004" active="#struct-441569" type="direct"/>
            <relation active="#struct-481355" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-212219" status="OLD">
          <idno type="RNSR">201221053L</idno>
          <orgName>Formally Verified Programs,   Certified Tools and Numerical Computations</orgName>
          <orgName type="acronym">TOCCATA</orgName>
          <date type="start">2012-09-01</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Université Paris-Sud ; Bâtiment 650 ; 91405 ORSAY CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/toccata</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2544" type="direct"/>
            <relation active="#struct-92966" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR8623" active="#struct-441569" type="indirect"/>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-344819" status="VALID">
          <idno type="ROR">https://ror.org/03k3c2t50</idno>
          <orgName>University of Alaska [Anchorage]</orgName>
          <desc>
            <address>
              <addrLine>3211 Providence DriveAnchorage, AK 99508</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.uaa.alaska.edu/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2497" status="VALID">
          <idno type="RNSR">199218244V</idno>
          <idno type="ROR">https://ror.org/00n8d6z93</idno>
          <orgName>Centre Inria de l'Université Grenoble Alpes</orgName>
          <desc>
            <address>
              <addrLine>Inovallée655 avenue de l'Europe38330 Montbonnot</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/grenoble</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-35418" status="VALID">
          <idno type="IdRef">191041289</idno>
          <idno type="ISNI">0000000104538607</idno>
          <idno type="RNSR">200317503S</idno>
          <idno type="ROR">04msnz457</idno>
          <orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
          <orgName type="acronym">LIP</orgName>
          <date type="start">1990-01-01</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6818" type="direct"/>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6818" status="VALID">
          <idno type="IdRef">149154992</idno>
          <idno type="ISNI">0000000123319856</idno>
          <idno type="ROR">https://ror.org/04zmssz18</idno>
          <idno type="Wikidata">Q10159</idno>
          <orgName>École normale supérieure de Lyon</orgName>
          <orgName type="acronym">ENS de Lyon</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens-lyon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301088" status="VALID">
          <idno type="ROR">https://ror.org/01rk35k63</idno>
          <orgName>Université de Lyon</orgName>
          <desc>
            <address>
              <addrLine>92 rue Pasteur - CS 30122, 69361 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-lyon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-194495" status="VALID">
          <idno type="IdRef">026402823</idno>
          <idno type="ISNI">0000000121686185</idno>
          <idno type="ROR">https://ror.org/029brtt94</idno>
          <orgName>Université Claude Bernard Lyon 1</orgName>
          <orgName type="acronym">UCBL</orgName>
          <desc>
            <address>
              <addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="regrouplaboratory" xml:id="struct-97058" status="OLD">
          <orgName>Université de Nantes - UFR des Sciences et des Techniques</orgName>
          <orgName type="acronym">UN UFR ST</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>2, rue de la Houssinière - BP 92208 - 44322 Nantes cedex 3</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sciences-techniques.univ-nantes.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93263" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93263" status="OLD">
          <idno type="IdRef">026403447</idno>
          <idno type="ROR">https://ror.org/03gnr7b55</idno>
          <orgName>Université de Nantes</orgName>
          <orgName type="acronym">UN</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>1, quai de Tourville - BP 13522 - 44035 Nantes cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-nantes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-111023" status="OLD">
          <idno type="IdRef">03063525X</idno>
          <idno type="ISNI">0000000122039289</idno>
          <idno type="ROR">https://ror.org/03nh7d505</idno>
          <orgName>École Centrale de Nantes</orgName>
          <orgName type="acronym">ECN</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>1 rue de la Noë - BP 92101 - 44321 Nantes cedex 3</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ec-nantes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-481355" status="VALID">
          <idno type="IdRef">202743233</idno>
          <idno type="ROR">https://ror.org/030hj3061</idno>
          <orgName>IMT Atlantique</orgName>
          <orgName type="acronym">IMT Atlantique</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Brest : Technopôle Brest-Iroise CS 8381829238 BREST Cedex 3 -Campus Nantes : 4, rue Alfred Kastler- La chantrerie 44300 NANTES -Campus Rennes :  2 Rue de la Châtaigneraie, 35510 CESSON SEVIGNE</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt-atlantique.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-47707" status="VALID">
          <idno type="anr">ANR-16-IDEX-0007</idno>
          <orgName>NExT (I-SITE)</orgName>
          <desc>NExT (I-SITE)</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>