최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기전기전자학회논문지 = Journal of IKEEE, v.25 no.4, 2021년, pp.697 - 702
김지훈 (Dept. of Electrical and Information Eng., SeooulTech)
Fast Fourier Transform (FFT) is a major signal processing block being widely used. For long-point FFT processing, usually more than 1024 points, its low-complexity implementation becomes very important while retaining high SQNR (Signal-to-Quantization Noise Ratio). In this paper, we present a low-co...
J. W. Cooley and J. W. Tukey, "An algorithm for the machine computation of the complex Fourier series," Math. Computation. vol.19, pp.297-301, 1965. DOI: 10.1090/S0025-5718-1965-0178586-1
Y. W. Lin, H. Y. Liu and C. Y. Lee, "A 1-GS/s FFT/IFFT Processor for UWB Applications," IEEE J. Solid-State Circuits, vol.40, no.8, pp.1726-1735, 2005. DOI: 10.1109/JSSC.2005.852007
David Elam and Cesar Iovescu, "A Block Floating Point Implementation for an N-Point FFT on the TMS320C55x DSP," Application Report, SPRA948, Texas Instruments, 2003.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.