{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T18:40:25Z","timestamp":1718044825125},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,8,23]],"date-time":"2015-08-23T00:00:00Z","timestamp":1440288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11042-015-2843-7","type":"journal-article","created":{"date-parts":[[2015,8,22]],"date-time":"2015-08-22T07:49:59Z","timestamp":1440229799000},"page":"6015-6030","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fast Fourier transform benchmark on X86 Xeon system for multimedia data processing"],"prefix":"10.1007","volume":"76","author":[{"given":"Young-Soo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koo-Rack","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Mook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwa-Young","family":"Jeong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,23]]},"reference":[{"key":"2843_CR1","doi-asserted-by":"crossref","unstructured":"Blumofe RD, Frigo M, Joerg CF, Leiserson CE, Randall KH (1996) An analysis of dag-consistent distributed shared-memory algorithms. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), (Padua, Italy), pp. 297\u2013308","DOI":"10.1145\/237502.237574"},{"key":"2843_CR2","doi-asserted-by":"crossref","unstructured":"Blumofe RD, Joerg CF, Kuszmaul BC, Leiserson CE, Randall KH, Zhou Y (1995) Cilk: an efficient multithreaded runtime system. In Proceedings of the Fifth ACMSIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), (Santa Barbara, California). pp. 207\u2013216","DOI":"10.1145\/209936.209958"},{"key":"2843_CR3","unstructured":"Borgerding M (2006) KissFFT v1.2.5. http:\/\/sourceforge.net\/projects\/kisst\/"},{"key":"2843_CR4","unstructured":"Cooley JW, Lewis PAW, Welch PD (1967) The fast Fourier transform algorithm and its applications, IBM Research"},{"key":"2843_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley JW, Tukey JW (1965) An algorithm for themachine computation of the complex Fourier series. Math Comput 19:297\u2013301","journal-title":"Math Comput"},{"key":"2843_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. The MIT Press, Cambridge"},{"key":"2843_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0165-1684(90)90158-U","volume":"19","author":"P Duhamel","year":"1990","unstructured":"Duhamel P, Vetterli M (1990) Fast Fourier transforms: a tutorial review and a state of the art. Signal Proc 19:259\u2013299","journal-title":"Signal Proc"},{"key":"2843_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","volume":"B 20","author":"IJ Good","year":"1958","unstructured":"Good IJ (1958) The interaction algorithm and practical Fourier analysis. J Roy Stat Soc B 20:361\u2013372","journal-title":"J Roy Stat Soc"},{"key":"2843_CR9","unstructured":"Hong J-W, Kung HT (1981) I\/O complexity: the red-blue pebbling game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, (Milwaukee), pp. 326\u2013333"},{"key":"2843_CR10","unstructured":"Intel\u00ae Math Kernel Library Reference Manual, https:\/\/software.intel.com\/sites\/products\/documentation\/hpc\/mkl\/mklman\/ ]"},{"key":"2843_CR11","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TASSP.1983.1164071","volume":"31","author":"HW Johnson","year":"1983","unstructured":"Johnson HW, Burrus CS (1983) The design of optimal DFT algorithms using dynamic programming. IEEE Trans Acoust Speech Signal Proc 31:378\u2013387","journal-title":"IEEE Trans Acoust Speech Signal Proc"},{"key":"2843_CR12","unstructured":"Leroy X (1996) The caml light system release 0.71. Institute National de Recherche en Informatique at Automatique (INRIA)"},{"key":"2843_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970999","volume-title":"Computational frameworks for the fast Fourier transform","author":"CV Loan","year":"1992","unstructured":"Loan CV (1992) Computational frameworks for the fast Fourier transform. SIAM, Philadelphia"},{"key":"2843_CR14","first-page":"07632","volume-title":"Discrete-time signal processing","author":"AV Oppenheim","year":"1989","unstructured":"Oppenheim AV, Schafer RW (1989) Discrete-time signal processing. Prentice-Hall, Englewood Cliffs, p 07632"},{"key":"2843_CR15","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1109\/TASSP.1987.1165265","volume":"35","author":"F Perez","year":"1987","unstructured":"Perez F, Takaoka T (1987) A prime factor FFT algorithm implementation using a program generation technique. IEEE Trans Acoust Speech Signal Proc 35:1221\u20131223","journal-title":"IEEE Trans Acoust Speech Signal Proc"},{"key":"2843_CR16","unstructured":"PRACE-1IP Whitepapers, Evaluations on Intel MIC, http:\/\/www.prace-ri.eu\/Evaluation-Intel-MIC"},{"key":"2843_CR17","volume-title":"Numerical recipes in C: the art of scientific computing","author":"WH Press","year":"1992","unstructured":"Press WH, Flannery BP, Teukolsky SA, Vetterling WT (1992) Numerical recipes in C: the art of scientific computing, 2nd edn. Cambridge University Press, New York","edition":"2"},{"key":"2843_CR18","unstructured":"Savage JE (1993) Space-time tradeoffs in memory hierarchies, Tech. Rep. CS 93-08, Brown University, CS Dept., Providence, RI 02912"},{"key":"2843_CR19","doi-asserted-by":"crossref","unstructured":"Selesnick I, Burrus CS (1996) Automatic generation of prime length FFT programs. IEEE Trans Signal Proc 14\u201324","DOI":"10.1109\/78.482008"},{"key":"2843_CR20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TAU.1969.1162042","volume":"AU-17","author":"RC Singleton","year":"1969","unstructured":"Singleton RC (1969) An algorithm for computing the mixed radix fast Fourier transform. IEEE Trans Audio Electroacoust AU-17:93\u2013103","journal-title":"IEEE Trans Audio Electroacoust"},{"key":"2843_CR21","doi-asserted-by":"crossref","unstructured":"Swarztrauber PN (1982) Vectorizing the FFTs, parallel computations. pp. 51\u201383","DOI":"10.1016\/B978-0-12-592101-5.50007-5"},{"key":"2843_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0021-9991(85)90164-0","volume":"58","author":"C Temperton","year":"1985","unstructured":"Temperton C (1985) Implementation of a self-sorting in-place prime factor FFT algorithm. J Comput Phys 58:283\u2013299","journal-title":"J Comput Phys"},{"key":"2843_CR23","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0021-9991(88)90106-4","volume":"75","author":"C Temperton","year":"1988","unstructured":"Temperton C (1988) A new set of minimum-add small-n rotated DFT modules. J Comput Phys 75:190\u2013198","journal-title":"J Comput Phys"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-2843-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-015-2843-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-2843-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-2843-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T17:53:51Z","timestamp":1718042031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-015-2843-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,23]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["2843"],"URL":"https:\/\/doi.org\/10.1007\/s11042-015-2843-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,23]]}}}