. Article, Accelerating fixed-point design for MB-OFDM UWB systems

G. A. Constantinides and G. J. Woeginger, The complexity of multiple wordlength assignment, Applied Mathematics Letters, vol.15, issue.2, pp.137-140, 2002.
DOI : 10.1016/S0893-9659(01)00107-0

M. Nemani and F. N. Najm, High-level area and power estimation for VLSI circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.18, issue.6, pp.697-713, 1999.
DOI : 10.1109/43.766722

C. Shi and R. W. Brodersen, Automated fixed-point data-type optimization tool for signal processing and communication systems, Proceedings of the 41st annual conference on Design automation , DAC '04, pp.478-483, 2004.
DOI : 10.1145/996566.996700

D. Cachera and T. Risset, Advances in bit width selection methodology, Proceedings IEEE International Conference on Application- Specific Systems, Architectures, and Processors, pp.17-19, 2002.
DOI : 10.1109/ASAP.2002.1030737

URL : https://hal.archives-ouvertes.fr/inria-00072136

K. Parashar, D. Menard, R. Rocher, and O. Sentieys, Shaping probability density function of quantization noise in fixed point systems, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers, pp.1675-1679, 2010.
DOI : 10.1109/ACSSC.2010.5757824

URL : https://hal.archives-ouvertes.fr/inria-00534529

L. P. Robichaud, Signal flow graphs and applications, 1962.

E. A. Lee and D. G. Messerschmitt, Synchronous data flow, Digest of Papers, Thirty-Second IEEE Computer Society International Conference, pp.310-315, 1987.
DOI : 10.1109/PROC.1987.13876

R. M. Karp, R. E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM, vol.14, issue.3, pp.563-590, 1967.
DOI : 10.1145/321406.321418

B. Widrow, I. Kollar, and M. Liu, Statistical theory of quantization, IEEE Transactions on Instrumentation and Measurement, vol.45, issue.2, pp.353-361, 1996.
DOI : 10.1109/19.492748

G. A. Constantinides, P. Y. Cheung, and W. Luk, Truncation noise in fixed-point SFGs, Electronics Letters, vol.35, issue.23, pp.2012-2014, 1999.
DOI : 10.1049/el:19991375

J. Tourreilles, C. Nouet, and E. Martin, A study on discrete wavelet transform implementation for a high level synthesis tool, Signal Processing Conference, pp.1-4, 1998.

G. A. Constantinides, P. Y. Cheung, and W. Luk, The multiple wordlength paradigm, Field-Programmable Custom Computing Machines, 2001. FCCM'01. The 9th Annual IEEE Symposium on, pp.51-60, 2001.

D. Menard, D. Chillet, F. Charot, and O. Sentieys, Automatic floating-point to fixed-point conversion for DSP code generation, Proceedings of the international conference on Compilers, architecture, and synthesis for embedded systems , CASES '02, pp.270-276, 2002.
DOI : 10.1145/581630.581674

URL : https://hal.archives-ouvertes.fr/inria-00482916

G. A. Constantinides, Perturbation analysis for word-length optimization, 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2003. FCCM 2003., pp.81-90, 2003.
DOI : 10.1109/FPGA.2003.1227244

D. Menard, R. Rocher, P. Scalart, and O. Sentieys, Automatic SQNR determination in non-linear and non-recursive fixed-point systems, Signal Processing Conference, pp.1349-1352, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00482941

R. Rocher, D. Menard, O. Sentieys, and P. Scalart, Analytical accuracy evaluation of fixed-point systems, Signal Processing Conference, pp.999-1003, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00454534

G. Caffarena, J. A. López, A. F. Herrero, and C. Carreras, SQNR estimation of non-linear fixed-point algorithms, 18th European Signal Processing Conference, pp.522-526, 2010.

K. Parashar, System-level approaches for fixed-point refinement of signal processing algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00783806

B. Barrois, K. Parashar, and O. Sentieys, Leveraging Power Spectral Density for Scalable System-Level Accuracy Evaluation, Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.750-755, 2016.
DOI : 10.3850/9783981537079_0204

URL : https://hal.archives-ouvertes.fr/hal-01253494

G. A. Constantinides, P. Y. Cheung, and W. Luk, Wordlength optimization for linear digital signal processing, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.22, issue.10, pp.1432-1442, 2003.
DOI : 10.1109/TCAD.2003.818119

D. Menard, R. Rocher, O. Sentieys-benabderrahmane, L. Pouchet, A. Cohen et al., Analytical Fixed-Point Accuracy Evaluation in Linear Time-Invariant Systems, Proceedings of the 19th Joint European Conference on Theory and Practice of Software, International Conference on Compiler Construction, pp.3197-320810, 2008.
DOI : 10.1109/TCSI.2008.923279

URL : https://hal.archives-ouvertes.fr/inria-00459231

S. Rajopadhye, S. Gupta, and D. Kim, Alphabets: An Extended Polyhedral Equational Language, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp.656-664, 2011.
DOI : 10.1109/IPDPS.2011.206

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991.
DOI : 10.1145/360827.360844

V. Van-dongen and P. Quinton, Uniformization of linear recurrence equations: a step toward the automatic synthesis of systolic arrays, [1988] Proceedings. International Conference on Systolic Arrays, pp.473-482, 1988.
DOI : 10.1109/ARRAYS.1988.18084

W. Shang, E. Hodzic, and Z. Chen, On uniformization of affine dependence algorithms, IEEE Transactions on Computers, vol.45, issue.7, pp.827-840, 1996.
DOI : 10.1109/12.508321

D. Barthou, P. Feautrier, and X. Redon, On the Equivalence of Two Systems of Affine Recurrence Equations, European Conference on Parallel Processing, pp.309-313, 2002.
DOI : 10.1007/3-540-45706-2_40

URL : https://hal.archives-ouvertes.fr/inria-00072302

K. Shashidhar, M. Bruynooghe, F. Catthoor, and G. Janssens, Verification of Source Code Transformations by Program Equivalence Checking, International Conference on Compiler Construction, pp.221-236, 2005.
DOI : 10.1007/978-3-540-31985-6_15

R. M. Karp, R. E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM, vol.14, issue.3, pp.563-590, 1967.
DOI : 10.1145/321406.321418

D. Monniaux, An abstract monte-carlo method for the analysis of probabilistic programs, ACM SIGPLAN Notices, pp.93-101, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00128138

S. Williams, A. Waterman, and D. Patterson, Roofline, Communications of the ACM, vol.52, issue.4, pp.65-76, 2009.
DOI : 10.1145/1498765.1498785

M. Gardner, Mathematical Games, Scientific American, vol.223, issue.4, pp.120-123, 1970.
DOI : 10.1038/scientificamerican1070-120

B. Chopard, Cellular automata modeling of physical systems, Encyclopedia of Complexity and Systems Science, pp.865-892, 2009.

G. B. Ermentrout and L. Edelstein-keshet, Cellular Automata Approaches to Biological Modeling, Journal of Theoretical Biology, vol.160, issue.1, pp.97-133, 1993.
DOI : 10.1006/jtbi.1993.1007

S. Wolfram, Cellular automata as models of complexity, Nature, vol.18, issue.5985, pp.419-424, 1984.
DOI : 10.1145/321650.321652

J. Holewinski, L. Pouchet, and P. Sadayappan, High-performance code generation for stencil computations on GPU architectures, Proceedings of the 26th ACM international conference on Supercomputing, ICS '12, pp.311-320, 2012.
DOI : 10.1145/2304576.2304619

C. Ancourt and F. Irigoin, Scanning polyhedra with do loops, ACM Sigplan Notices, pp.39-50, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

P. Boulet and P. Feautrier, Scanning polyhedra without Do-loops, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), pp.4-11, 1998.
DOI : 10.1109/PACT.1998.727127

URL : https://hal.archives-ouvertes.fr/inria-00564990

F. Irigoin and R. Triolet, Supernode partitioning, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.319-329, 1988.
DOI : 10.1145/73560.73588

D. Kim and S. Rajopadhye, Efficient Tiled Loop Generation: D-Tiling, Proceedings of the 22nd International Workshop on Languages and Compilers for Parallel Computing, p.9, 2009.
DOI : 10.1007/978-3-642-13374-9_20

S. Tavarageri, A. Hartono, M. Baskaran, L. Pouchet, J. Ramanujam et al., Parametric tiling of affine loop nests, Proc. 15th Workshop on Compilers for Parallel Computers, 2010.

A. Hartono, M. M. Baskaran, J. Ramanujam, and P. Sadayappan, DynTile: Parametric tiled loop generation for parallel execution on multicore processors, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp.1-12, 2010.
DOI : 10.1109/IPDPS.2010.5470459

S. Shrestha, J. Manzano, A. Marquez, J. Feo, and G. R. Gao, Jagged Tiling for Intra-tile Parallelism and Fine-Grain Multithreading, International Workshop on Languages and Compilers for Parallel Computing, pp.161-175, 2014.
DOI : 10.1007/978-3-319-17473-0_11

R. T. Mullapudi and U. Bondhugula, Tiling for dynamic scheduling, 2014.

S. Krishnamoorthy, M. Baskaran, U. Bondhugula, J. Ramanujam, A. Rountev et al., Effective automatic parallelization of stencil computations, Proceedings of the 28th Conference on Programming Language Design and Implementation, PLDI '07, pp.235-244, 2007.

V. Bandishti, I. Pananilath, and U. Bondhugula, Tiling stencil computations to maximize parallelism, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis, pp.1-11, 2012.
DOI : 10.1109/SC.2012.107

T. Malas, G. Hager, H. Ltaief, H. Stengel, G. Wellein et al., Multicore-Optimized Wavefront Diamond Blocking for Optimizing Stencil Updates, Parallel and Distributed Computing (ISPDC), 2012 11th International Symposium on, pp.439-464, 2012.
DOI : 10.1137/140991133

T. Grosser, A. Cohen, J. Holewinski, P. Sadayappan, and S. Verdoolaege, Hybrid Hexagonal/Classical Tiling for GPUs, Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization, CGO '14, pp.6666-6675, 2014.
DOI : 10.1145/2581122.2544160

URL : https://hal.archives-ouvertes.fr/hal-00911177

M. M. Strout, L. Carter, J. Ferrante, and B. Simon, Schedule-independent storage mapping for loops, ACM SIGPLAN Notices, vol.33, issue.11, pp.24-33, 1998.
DOI : 10.1145/291006.291015

M. D. Lam, E. E. Rothberg, and M. E. Wolf, The cache performance and optimizations of blocked algorithms, ACM SIGARCH Computer Architecture News, pp.63-74, 1991.

S. Coleman and K. S. Mckinley, Tile size selection using cache organization and data layout, ACM SIGPLAN Notices, pp.279-290, 1995.

J. Cong, P. Li, B. Xiao, and P. Zhang, An optimal microarchitecture for stencil computation acceleration based on non-uniform partitioning of data reuse buffers, Proceedings of the 51st Annual Design Automation Conference, DAC '14, pp.771-77, 2014.

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, Proceedings of the 3rd International Congress on Mathematical Software, ICMS '10, pp.299-302, 2010.
DOI : 10.1007/978-3-642-15582-6_49

M. Kunz, A. Ostrowski, and P. Zipf, An FPGA-optimized architecture of horn and schunck optical flow algorithm for real-time applications, 2014 24th International Conference on Field Programmable Logic and Applications (FPL), pp.1-4, 2014.
DOI : 10.1109/FPL.2014.6927406

W. Luzhou, K. Sano, and S. Yamamoto, Domain-Specific Language and Compiler for Stencil Computation on FPGA-Based Systolic Computational-Memory Array, Proceedings of the 8th International Symposium on Applied Reconfigurable Computing, pp.26-39
DOI : 10.1109/71.97902

G. Natale, G. Stramondo, P. Bressana, R. Cattaneo, D. Sciuto et al., A polyhedral model-based framework for dataflow implementation on FPGA devices of iterative stencil loops, Proceedings of the 35th International Conference on Computer-Aided Design, ICCAD '16, pp.771-77, 2016.
DOI : 10.1145/2435264.2435271