From b0ed3be3eef886db4fcbf50b7bbe564c761b0531 Mon Sep 17 00:00:00 2001 From: jmfriedt Date: Mon, 21 May 2018 11:34:24 +0200 Subject: [PATCH] final version --- biblio.bib | 6 +++++- ifcs2018_proceeding.tex | 12 ++++++------ 2 files changed, 11 insertions(+), 7 deletions(-) diff --git a/biblio.bib b/biblio.bib index 0acc509..534b559 100644 --- a/biblio.bib +++ b/biblio.bib @@ -191,5 +191,9 @@ year = {2011} author={Andrich, Carsten and Ihlow, Alexander and Bauer, Julia and Beuster, Niklas and Del Galdo, Giovanni}, journal={IEEE Transactions on Instrumentation and Measurement}, year={2018}, - publisher={IEEE} + publisher={IEEE}, +pages={1132--1141}, +volume=67, +number=5, +month={May} } diff --git a/ifcs2018_proceeding.tex b/ifcs2018_proceeding.tex index 2eedb07..9eea1c4 100644 --- a/ifcs2018_proceeding.tex +++ b/ifcs2018_proceeding.tex @@ -172,13 +172,13 @@ resources indeed matches the definition of a classical optimization problem. Specifically the degrees of freedom when addressing the problem of replacing the single monolithic FIR with a cascade of optimized filters are the number of coefficients $N_i$ of each filter $i$, -the number of bits $C_i$ representing the coefficients and the number of bits $D_i$ representing --the data fed to the filter. Because each FIR in the chain is fed the output of the previous stage, +the number of bits $C_i$ representing the coefficients and the number of bits $D_i$ needed to represent +the data $x_k$ fed to each filter as provided by the acquisition or previous processing stage. +Because each FIR in the chain is fed the output of the previous stage, the optimization of the complete processing chain within a constrained resource environment is not trivial. The resource occupation of a FIR filter is considered as $C_i \times N_i$ which aims at approximating the number of bits needed in a worst case condition to represent the output of the -FIR. Indeed, the number of bits generated by the FIR is $(C_i+D_i)\times\log_2(N_i)$ with $D_i$ -the number of bits needed to represent the data $x_k$ generated by the previous stage, but the +FIR. Indeed, the number of bits generated by the $i$th FIR is $(C_i+D_i)\times\log_2(N_i)$, but the $\log$ function is avoided for its incompatibility with a linear programming description, and the simple product is approximated as the number of gates needed to perform the calculation. Such an occupied area estimate assumes that the number of gates scales as the number of bits and the number @@ -424,8 +424,8 @@ atomic transition). This work is supported by the ANR Programme d'Investissement d'Avenir in progress at the Time and Frequency Departments of the FEMTO-ST Institute (Oscillator IMP, First-TF and Refimeve+), and by R\'egion de Franche-Comt\'e. -The authors would like to thank E. Rubiola, F. Vernotte, G. Cabodevila for support and -fruitful discussions. +The authors would like to thank E. Rubiola, F. Vernotte, and G. Cabodevila +for support and fruitful discussions. \bibliographystyle{IEEEtran} \balance -- 2.16.4