L. Voies-traditionnelles-de-calcul and .. , 91 II.2.3.1Entrelacement temporel sans ddbordement par addition 91 II.2.3.2Entrelacement temporel avec division systtmatique par 2 92 II.2.3.4Entrelacement frrquentiel avec division systtmatique par 2, p.92

I. Sommaire, 1 Spciicitts de la reconstitution de donnnes, ., vol.2, issue.1, p.8

T. F. Une, multidimensionnelle est synonyme d'un grand nombre d''chantillons, mais dans notre cas un pourcentage important d'entre eux a une valeur nulle, Ce qui rrduit en conssquence 146

I. Bibliographie, A. N. Ahmed, and K. R. Rao, Orthogonal Transforms for Digital Signal Processing, 1975.

A. Avizienis, Signed-digit number representation for fast parallel arithmetic, IEEE Transactions on Electronic Computers, vol.10, p.389400, 1961.

M. Bel966 and . Bellanger, Traitement nummrique du signal, 1996.

B. R. Bouraoui, A. Guyot, and G. Walker, On-line operator for Euclidean distance, EDAC-EUROASIC93, 1993.

C. Coles and J. , Le DSP spciique : une solution conomique parfaite? Electronique, p.7880, 1991.

C. K. Chen and C. Svensson, A 512 processor array for videooimage processing, From pixel to features II, p.349361

D. and D. V. James, Quantization errors in the fast Fourier transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.23, issue.3, p.277283, 1975.
DOI : 10.1109/TASSP.1975.1162687

D. J. Dufourd, J. F. Naviner, and F. Jutand, Preform: a process independent symbolic layout system, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, 1990.
DOI : 10.1109/ICCAD.1990.129893

F. and F. Grosvalet, RRaliser un calcul de FFT complexe pour l'analyse de signal, Electronique, vol.12, p.7173, 1991.

G. and G. U. Ramos, Roundoo error analysis of the fast Fourier transform, Math. Comput, vol.25, p.757768, 1971.

G. and G. Bongiovanni, Two VLSI Structures for the Discret Fourier Transform, IEEE Transactions on Computers, vol.328, p.750753, 1983.

A. Guyot and Y. Kusumaputri, Ocapi : prototype for high precision arithmetic, VLSI'91, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00014957

G. A. Greiner, C. Kara-terki, H. Mehrez, and G. Noguez, A exible high performance serial radix 2 t butterry arithmetic unit, ESSIRC, p.2528, 1985.

G. I. Gertner and M. Shamash, VLSI Architectures for Multidimensional Fourier Transform Processing, IEEE Transactions on Computers, vol.36, issue.11, p.12651274, 1987.
DOI : 10.1109/TC.1987.5009467

A. Gue877 and . Guerin, CRASY : un Calculateur de R seaux Adaptatifs SYstoloique, application au calcul neuromim tique, 1987.

J. and J. Pauthion, Un circuit spciique pour une FFT plus de 20 MHz, Electronique, vol.12, p.7378, 1991.

J. A. Joh844 and . Johnston, Generating multipliers for a radix-4 parallel t algorithm, Signal Processing, vol.6, p.6166, 1984.

C. Jut877 and . Jutten, Calculs neuromim tiques et traitement du signal : analyse en composantes ind pendantes, 1987.

J. , W. J. Cooley, and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput, vol.19, p.297301, 1965.

Y. Kus933 and . Kusumaputri, Op rateurs Arithm tiques Standards En Ligne tr s Grande Pr cision. T se inpg, INPG, 1993.

L. and L. F. Eyck, Crystallographic Fast Fourier Transforms, Acta Crystallography, vol.29, p.183191, 1973.

L. , L. F. Eyck, L. H. Weaver, and B. W. Matthews, A method of obtaining a stereochemically acceptable protein model wich ts a set of atomic coordinates, Acta Crystallography, vol.23, p.349350, 1976.

L. and L. F. Eyck, EEcient Structure-Factor Calculation for Large Molecules by the Fast Fourier Transform, Acta Crystallography, vol.33, p.486492, 1977.

J. C. Law933 and . Lawson, SMART : Un Neurocalculateur parall le exploitant des Matrices Creuses, 1993.

L. P. Larsson and C. Svensson, A serial-parallel multiplier for a narrow pitch l a yout, EDAC'93, 1993.

R. F. Lyo766 and . Lyon, Two's complement pipeline multipliers, Transactions on Communications, p.418425, 1976.

R. F. Lyo811 and . Lyon, A bit-serial vlsi architecture methodology for signal processing, 1981.

R. F. Lyo844 and . Lyon, VLSI Signal Processing, section A Bit-Serial Multiprocessor for Signal Processing, 1984.

M. , D. M. Ercegovac, and K. S. Trivedi, On-line algorithms for division and multiplication, IEEE Transactions on Computers, vol.267, p.681687, 1977.

H. Meh833 and . Mehrez, Etude et classiication des algorithmes de la Transformation de Fourier Rapide Application la conception d'un circuit Papillon FFT int egr e : unit e arithm etique de base d'un processeur FFT, Thhse de troisiime cycle, 1983.

H. Meh911 and . Mehrez, Des Architectures VLSI Pipelines pour les Algorithmes Num eriques ots de Donn ees en Repr esentations Arithm etiques Virgule Fixe et Virgule Flottante, Thhse d' etat, 1991.

N. J. Naviner and J. C. Dufourd, Preformeeagape : a synergy between symbolic cell design and assembly. I n EUROMICRO, P aris, 1992.

O. V. Oklobdzija, D. Villeger, and T. Soulas, An integrated multiplier for complex numbers, Journal of VLSI signal processing systems for signal, image and video technology, vol.11, issue.No. 3, p.213222, 1994.
DOI : 10.1007/BF02409398

P. Parker, D. Stott, and J. , Notes on shuueeexchange-type schwitching networks, IEEE Transactions on Computers, vol.293, p.213222, 1980.

W. H. Ptf2ss, S. A. Press, W. T. Teukolsky, B. P. Vetterling, and . Flannery, Numerical Recipes in Fortran, The Art of Scientiic Computing, 1992.

R. and R. C. Agarwal, A New Least-Squares Reenement T echnique Based on the Fast Fourier Transform Algorithm, Acta Crystallography, vol.34, p.791809, 1978.

S. A. Skaf, J. C. Bajard, A. Guyot, and J. M. Muller, On-line approximation of real functions using polynomials VLSI design of on-line adddmultiply algorithms, ICM'92 ICCD'93, p.264267, 1992.

A. Ska955 and . Skaf, Conception de Processeurs arithm tiques en ligne. T se inpg, INPG Sto711 Stone, Harold S. Parallel Processing with the Perfect Shuue, IEEE Transactions on Computers, vol.202, p.153161, 1971.

T. Trrr-thhhg and B. Liu, Fixed-point fast fourier transform error analysis, IEEE Trans. Acoustics, Speech, Signal Processing, vol.246, p.563573, 1976.

T. N. Takagi, H. Yasuura, and S. Yajima, High-speed vlsi multiplier algorithm with a redundant binary addition tree, IEEE Transactions on Computers, vol.349, p.789796, 1986.

A. Va94aa, A. Vacher, and . Guyot, A VLSI Implementation of Fast Fourier Transform for a Large Number of Samples, SPRANN'94, 1994.

A. Va94bb, A. Vacher, and . Guyot, Error-Speed Compromise for FFT VLSI, SSST'94, 1994.

A. Va95aa, A. Vacher, and . Guyot, Radix-8 Butterries for Folded FFT, SSST'95, 1995.

A. Va95bb, A. Vacher, and . Guyot, Spread and Folded Architectures for FFT, SSST'95, 1995.

A. Vbg-+-944, M. Vacher, A. Benkhebbab, T. Guyot, A. Rousseau et al., A VLSI Implementation of Parallel Fast Fourier Transform, EDAC-ETC-EUROASIC'94, 1994.

C. Ver944 and . Verdier, M moires parall les et r seau d'interconnexion pour architectures SIMD, Thhse enst, 1994.

A. Vq95aa, D. T. Vacher, and . Qui, Hard-wired Computation of FFT : An Application to Cristallography. I n SSST'95, 1995.

A. Vq95bb, D. T. Vacher, and . Qui, Hard-wired Computation of FFT : An Application to Cristallography, M2SABI'95, 1995.

C. J. Wei699 and . Weinstein, Quantization eeects in digital lters, 1969.

P. D. Wel699 and . Elch, A xed point fast fourier transform error analysis, IEEE Trans. Audio Electroacoust, vol.17, p.151157, 1969.