<?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-01347634</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-25T12:37:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Computing the Worst-Case Peak Gain of Digital Filter in Interval Arithmetic</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>
              <affiliation ref="#struct-389984"/>
            </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-389984"/>
            </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>
              <affiliation ref="#struct-389984"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Anastasia</forename>
                <surname>Volkova</surname>
              </persName>
              <email type="md5">e5456fe1b67ef688106f21bf06411945</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-36826"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-07-21 14:07:21</date>
              <date type="whenWritten">2016-05-09</date>
              <date type="whenModified">2025-09-29 12:29:43</date>
              <date type="whenReleased">2016-07-25 13:45:22</date>
              <date type="whenProduced">2016-09-26</date>
              <date type="whenEndEmbargoed">2016-07-21</date>
              <ref type="file" target="https://hal.sorbonne-universite.fr/hal-01347634v1/document">
                <date notBefore="2016-07-21"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.sorbonne-universite.fr/hal-01347634v1/file/VolkovaLauterHilaire.pdf" id="file-1347634-1428151">
                <date notBefore="2016-07-21"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="304091">
                <persName>
                  <forename>Anastasia</forename>
                  <surname>Volkova</surname>
                </persName>
                <email type="md5">e5456fe1b67ef688106f21bf06411945</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01347634</idno>
            <idno type="halUri">https://hal.sorbonne-universite.fr/hal-01347634</idno>
            <idno type="halBibtex">volkova:hal-01347634</idno>
            <idno type="halRefHtml">&lt;i&gt;17th International Symposium on Scientific Computing, Computer Arithmetics and Verified Numerics. &lt;/i&gt;, Sep 2016, Uppsala, Sweden</idno>
            <idno type="halRef">17th International Symposium on Scientific Computing, Computer Arithmetics and Verified Numerics. , Sep 2016, Uppsala, Sweden</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1347634-1428151"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Computing the Worst-Case Peak Gain of Digital Filter in Interval Arithmetic</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>
                  <affiliation ref="#struct-389984"/>
                </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-389984"/>
                </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>
                  <affiliation ref="#struct-389984"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>17th International Symposium on Scientific Computing, Computer Arithmetics and Verified Numerics. </title>
                  <date type="start">2016-09-26</date>
                  <date type="end">2016-09-29</date>
                  <settlement>Uppsala</settlement>
                  <country key="SE">Sweden</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">interval arithmetic</term>
                <term xml:lang="en">digital filters</term>
                <term xml:lang="en">worst-case peak gain</term>
              </keywords>
              <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-ts">Computer Science [cs]/Signal and Image Processing</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The Worst-Case Peak Gain (WCPG) of a Linear Time Invariant (LTI) filter is used to determine the output interval of a filter and in error propagation analysis. Previously, the authors presented an approach on the computation of the WCPG in arbitrary precision. However, the approach considered filter coefficients to be exact. We consider now LTI filters which have coefficients that are rounded prior to implementation. To provide a reliable filter implementation, these rounding errors must be taken into account in the WCPG computation. In this work we represent rounded coefficients as intervals with small radii and adapt the WCPG computation for the interval case.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-389984" status="OLD">
          <orgName>Performance et Qualité des Algorithmes Numériques</orgName>
          <orgName type="acronym">PEQUAN</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </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>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-36826" status="VALID">
          <idno type="anr">ANR-13-INSE-0007</idno>
          <idno type="program">Ingénierie Numérique et Sécurité</idno>
          <orgName>MetaLibm</orgName>
          <desc>Générateurs de code pour les fonctions mathématiques et les filtres</desc>
          <date type="start">2013</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>