최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보처리학회논문지. The KIPS transactions. Part A. Part A, v.12A no.3 = no.93, 2005년, pp.215 - 222
박능수 (건국대학교 컴퓨터공학부) , 최영호 (건국대학교 전기공학과)
The efficient utilization of cache memories is a key factor in achieving high performance for computing large signal transforms. Nonunit stride access in computation of large DFTs causes cache conflict misses, thereby resulting in poor cache performance. It leads to a severe degradation in overall p...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
A. Ailamaki, D. DeWitt, M. D. Hill, M. Skounakis, 'Weaving Relations for Cache Performance,' in Proc. 27th International Conference Very Large Data Base, 2001
D. H. Bailey, 'Unfavorable Strides in Cache Memory Systems,' Scientific Programming, 1995
S. Egner, 'Zur Algorithmischen Zerlegungstheorie Linearer Transformationen mit Symmetire,' Ph.D. Thesis, Universitat Karlsruhe, 1997
G. Haentjens, 'An Investigation of Recursive FFT Implementations,' Master's Thesis, Dept. of Electrical and Computer Engineering, Canegie Mellon University, 2000
W. Liu and V. K. Prasanna, 'Utilizing the Power of High-Performance Computing,' IEEE Signal Processing, September, 1998
V. VanLoan, 'Computational Frameworks for the Fast Fourier Transform,' Frontieres in Applied Mathmetics, Vol. 10, SIAM, 1992
D. Mirkovic, R. Mahassom, and L. Johnsson, 'An Adaptive Software Library for Fast Fourier Transforms,' Proceedings of the 2000 International Conference on Supercomputing, May, 2000
R. Tolimieri, M. An, and C. Lu, 'Algorithms for Discrete Fourier Transforms and Convolution,' Springer, 1997
※ AI-Helper는 부적절한 답변을 할 수 있습니다.