@inproceedings{est-mar-reg-20-aa-legpol,
  author = {Esteban, Luis and L{\'o}pez, Juan A. and Regadio, Alberto},
  title = {Round-Off Noise Estimation of Fixed-Point Algorithms using {Modified} {Affine} {Arithmetic} and {Legendre} Polynomials},
  booktitle = {Proceedings of the XXXV Conference on Design of Circuits and Integrated Systems (DCIS)},
  location = {Virtual meeting},
  pages = {1-6},
  year = 2020,
  month = nov,
  doi = {10.1109/DCIS51330.2020.9268668},
  comment = {Uses ``modified affine arithmetic'' and Legendre polynomials (how?) to estimate the roundoff error of DSPs with fixed-point arithmetic, since it says that plain AA is not good enough.},
  abstract = {The implementation of algorithms in fixed-point format causes the apparition of Round-Off Noise which propagates through the different functional units of the system. This issue causes the Signal-to-Noise Ratio of the outputs is degraded. Given an algorithm, it is essential to estimate the integer and fractional bit-widths of all the variables and operations to comply with the Signal-to-Noise Ratio requirements. In this context, Affine Arithmetic can obtain fast and accurate estimations of the bit-widths for linear systems. However, for non-linear systems, Affine Arithmetic loses the temporal correlation of the variables. Other existing frameworks are either time consuming or lead to inaccurate bound estimations. In this paper, a Modified Affine Arithmetic framework with Legendre polynomials is used to obtain fast and accurate bound estimations also for non-linear systems. Moreover, the approach proposed in this paper obtains speedups in the range of 7 to 100 compared to Monte-Carlo simulations.}
}