jfriedt / IFCS2018 article

Download as
Browse Code ยป

Commit b0ed3be3eef886db4fcbf50b7bbe564c761b0531

Authored by jfriedt
1 parent 836ff72905
Exists in master

final version

Showing 2 changed files with 11 additions and 7 deletions Side-by-side Diff

... ... @@ -191,6 +191,10 @@
191 191 author={Andrich, Carsten and Ihlow, Alexander and Bauer, Julia and Beuster, Niklas and Del Galdo, Giovanni},
192 192 journal={IEEE Transactions on Instrumentation and Measurement},
193 193 year={2018},
194   - publisher={IEEE}
  194 + publisher={IEEE},
  195 +pages={1132--1141},
  196 +volume=67,
  197 +number=5,
  198 +month={May}
195 199 }
ifcs2018_proceeding.tex
Diff comments   View file @ b0ed3be
... ... @@ -172,13 +172,13 @@
172 172  
173 173 Specifically the degrees of freedom when addressing the problem of replacing the single monolithic
174 174 FIR with a cascade of optimized filters are the number of coefficients $N_i$ of each filter $i$,
175   -the number of bits $C_i$ representing the coefficients and the number of bits $D_i$ representing
176   --the data fed to the filter. Because each FIR in the chain is fed the output of the previous stage,
  175 +the number of bits $C_i$ representing the coefficients and the number of bits $D_i$ needed to represent
  176 +the data $x_k$ fed to each filter as provided by the acquisition or previous processing stage.
  177 +Because each FIR in the chain is fed the output of the previous stage,
177 178 the optimization of the complete processing chain within a constrained resource environment is not
178 179 trivial. The resource occupation of a FIR filter is considered as $C_i \times N_i$ which aims
179 180 at approximating the number of bits needed in a worst case condition to represent the output of the
180   -FIR. Indeed, the number of bits generated by the FIR is $(C_i+D_i)\times\log_2(N_i)$ with $D_i$
181   -the number of bits needed to represent the data $x_k$ generated by the previous stage, but the
  181 +FIR. Indeed, the number of bits generated by the $i$th FIR is $(C_i+D_i)\times\log_2(N_i)$, but the
182 182 $\log$ function is avoided for its incompatibility with a linear programming description, and
183 183 the simple product is approximated as the number of gates needed to perform the calculation. Such an
184 184 occupied area estimate assumes that the number of gates scales as the number of bits and the number
... ... @@ -424,8 +424,8 @@
424 424 This work is supported by the ANR Programme d'Investissement d'Avenir in
425 425 progress at the Time and Frequency Departments of the FEMTO-ST Institute
426 426 (Oscillator IMP, First-TF and Refimeve+), and by R\'egion de Franche-Comt\'e.
427   -The authors would like to thank E. Rubiola, F. Vernotte, G. Cabodevila for support and
428   -fruitful discussions.
  427 +The authors would like to thank E. Rubiola, F. Vernotte, and G. Cabodevila
  428 +for support and fruitful discussions.
429 429  
430 430 \bibliographystyle{IEEEtran}
431 431 \balance