• ETRI Journal
• /
• 제44권3호
• /
• pp.379-388
• /
• 2022

This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.

• ETRI Journal
• /
• 제45권6호
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• 대한전자공학회논문지
• /
• 제26권10호
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Korean Journal of Mathematics
• /
• 제19권3호
• /
• pp.243-253
• /
• 2011

We would like to propose a Cooley-Tukey modied algorithm in fast Fourier transform(FFT). Of course, this is a kind of Cooley-Tukey twiddle factor algorithm and we focused on the choice of integers. The proposed algorithm is better than existing ones in speeding up the calculation of the FFT.

• 한국음향학회지
• /
• 제5권4호
• /
• pp.22-26
• /
• 1986

The following methods have been proposed for implementing R2 multi-frequency receiver digitally: using digital filters, period-counting algorithm, discrete Fourier transform or Goertzel algorithm, and fast Fourier transform.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2000년도 제11회 정기총회 및 00년 동계학술발표회 논문집
• /
• pp.296-297
• /
• 2000

프라운호퍼 회절에 의하여 주어진 세기 무늬를 발생시키는 회절광학소자(Diffractive Optical Element, DOE)는 회절무늬소자, 키노폼(kinoform), 컴퓨터 푸리에 홀로그램 (computer-generated Fourier hologram) 등으로 불리우며, 광정보처리, 광연결, 레이저가공에서 중요한 역할을 한다. 이 소자를 설계하는 매우 다양한 방법들이 제안되었는데, iterative Fourier transform 알고리즘(IFTA)과 이를 변형한 알고리즘들이 가장 널리 사용된다. IFTA는 fast Fourier transform(FFT)를 활용하므로 계산시간이 절감되지만 국소 최소점에 고착되는 stagnation문제가 있어 이를 해결하기 위한 많은 변형된 알고리즘들이 제안되었다. 본 연구에서는 최근에 제안한 new Pnoise algorithm with hybrid input-output algorithm(NPA-HIOA)$^{(1)}$ 의 설계 성능을 IFTA, hybrid input-output 알고리즘(HIOA), new Pnoise 알고리즘(NPA)$^{(2)}$ , Nonlinear Least-Square (NLS)$^{(3)}$ 등의 기존의 알고리즘들과 비교하고자 한다. (중략)

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3438-3454
• /
• 2018

In this paper, we propose a robust blind watermarking scheme for high-definition video. In the embedding process, luminance component of each frame is transformed by 2-dimensional fast Fourier transform (2D FFT). A secret key is used to generate a matrix of random numbers for the security of watermark information. The matrix is transformed by inverse steerable pyramid transform (SPT). We embed the watermark into the low and mid-frequency of 2D FFT coefficients with the transformed matrix. In the extraction process, the 2D FFT coefficients of each frame and the transformed matrix are transformed by SPT respectively, to produce two oriented sub-bands. We extract the watermark from each frame by cross-correlating two oriented sub-bands. If a video is degraded by some attacks, the watermarks of frames contain some errors. Thus, we use an ensemble position-based error correcting algorithm to estimate the errors and correct them. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against various attacks. After embedding 64 bits of watermark into each frame, the average peak signal-to-noise ratio between original frames and embedded frames is 45.7 dB.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.449-455
• /
• 2011

Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M-dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 추계학술대회 논문집 학회본부
• /
• pp.131-134
• /
• 1988

This Paper describes a algorithm for evaluating the loss of load probability of a generating system using Fast Hartley Transform. The Fast Hartley Transform(FHT) Is as fast as or faster than the Fast Fourier Transform(FHT) and serves for all the uses such as spectral, digital processing and convolution to which the FFT is at present applied. The method has been tested by applying to IEEE reliability test system and the effectiveness is demonstrated.

• Journal of Electrical Engineering and Technology
• /
• 제13권1호
• /
• pp.298-306
• /
• 2018

This paper presents a harmonic analysis of the modular multilevel converter (MMC) using a double Fourier series (DFS) algorithm. First, the application of DFS for harmonic calculation in the MMC is made by considering the effect of arm inductor. The analytical results are then confirmed by comparing with the simulation results of using the fast Fourier transform (FFT) algorithm. Finally, distribution of harmonics and total harmonic distortion (THD) in the MMC will be analyzed in three cases: harmonics versus number of levels of MMC, harmonics versus total switching frequency and harmonics versus modulation index. The simulation results are performed in the PSCAD/EMTDC simulation program in order to verify the analytical results obtained by Matlab programming.