• Journal of the Korean Society for Railway
• /
• v.9 no.1 s.32
• /
• pp.63-68
• /
• 2006

This paper proposes a fast Fourier transform(FFT)-based spectral analysis method(SAM) for the dynamic responses of the linear discrete dynamic models with non-proportional damping. The SAM was developed by using discrete Fourier transform(DFT)-theory. To verify the proposed SAM, a three-DOF system with non-proportional viscous damping is considered as an illustrative example. The present SAM is evaluated by comparing the dynamic responses obtained by SAM with those obtained by Runge-Kutta method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1292-1306
• /
• 2014

This paper proposes a space-polarization division multiple access (SPDMA) system that has limited feedback channels. The system simultaneously serves data streams to multiple mobile users through dual-polarized antenna arrays, by using pre-determined sets of precoding vectors that are orthogonal in both space and polarization domains. To this end, a codebook whose elements are sets of the precoding vectors is systematically designed based on the discrete Fourier transform (DFT) matrix and considering the power imbalance of polarized channels. Throughput of the SPDMA system is evaluated and compared to that of space division multiple access (SDMA) system, according to the various parameters including cross polarization discrimination (XPD). The results show that the throughput of SPDMA system outperforms that of SDMA in the environments of high XPD with many mobile users.

• Proceedings of the KIPE Conference
• /
• 2008.06a
• /
• pp.91-93
• /
• 2008

In this paper, novel phase angle following algorithm for the single phase grid-connected inverter is proposed. Gird-connected inverter needs phase angle detection for synchronization grid voltage with the inverter output. In case of single phase grid-connected inverter, zero crossing detection and virtual 2-phase PLL using digital all pass filter or digital low pass filter are used conventionally. But these methods have a weakness for harmonics, noises and ripples. The proposed method of PLL achieve DFT(Discrete Fourier Transform) using Goertzel algorithm. It can extract fundamental voltage of grid. As a results, it can obtain phase angle using digital all pass filter without effect of harmonics, noises and ripples. Simulation results are presented to demonstrate the effectiveness of the proposed algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.3
• /
• pp.192-199
• /
• 2018

This paper proposes an improved discrete Fourier transform spread single sideband(DFT-s-SSB) orthogonal frequency division multiplexing(OFDM) system that solves the problems of conventional DFT-s-SSB OFDM systems. Conventional DFT-s-SSB systems use pulse amplitude modulation(PAM) for applying SSB modulation. The higher the modulation level, the worse is the BER performance. Further, transmission is possible only through the lower sideband(LSB) spectrum. When transmitting using the LSB and upper sideband(USB) spectra simultaneously, interference occurs and spectrum recovery is not performed correctly. To solve this problem, the proposed system applies the 2/3 convolution coding to improve the bit error rate(BER) performance, adjusts the DFT size, and selects the USB spectrum to utilize the remaining spectrum resources. In addition, when using this system in an environment that supports multiuser or limited bandwidth, it uses only half of the spectrum; therefore, it can utilize the remaining spectrum resources and improve the spectral efficiency.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.6
• /
• pp.293-305
• /
• 2005

This paper describes an improved Prony method in its speed, accuracy and reliability by efficiently determining the optimal sampling interval with use of DFT (discrete Fourier transformation). In the Prony method the computation time is dominated by the size of the linear prediction matrix, which is given by the number of data times the modeling order The size of the matrix in a general Prony method becomes large because of large number of data and so does the computation time. It is found that the Prony method produces satisfactory results when SNR is greater than three. The maximum sampling interval resulting minimum computation time is determined using the fact that the spectrum in DFT is inversely proportional to sampling interval. Also the process of computing the modes is made efficient by applying Hessenberg method to the companion matrix with complex shift and computing selectively only the dominant modes of interest. The proposed method is tested against the 2003 KEPCO system and found to be efficient and reliable. The proposed method may play a key role in monitoring in real time low frequency oscillations of power systems .

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.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.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.159-167
• /
• 2006

The transform domain characterization of cyclic codes over finite fields using Discrete Fourier Transform(DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$. We give a way to characterize cyclic codes over $F_p + uF_p +... + u^{k-l}F_p$ by Mattson-Solomon polynomials and multiple defining sets.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.17 no.2
• /
• pp.93-98
• /
• 2012

A precise measurement of the grid voltage is one of the essential techniques, which is required to connect a renewable energy to the grid. In general, when a filter is used to eliminate unnecessary harmonics and noises, a signal is distorted by phase delay, amplitude attenuation, and other distortions. And the response characteristic of a controller is directly affected by bandwidth of cut-off frequency of the filter. To alleviate this problems, we propose an effective algorithm based on DFT(Discrete Fourier Transform) instead of approaching the filter application. The proposed algorithm ensures high precise measurement of the grid voltage because it can extract the fundamental and harmonics from the raw signal without any distortions. The high performance of the proposed algorithm is verified by PSIM simulation and experiments of Grid-Connected VSI.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.392-403
• /
• 2024

Even though generalized frequency division multiplexing is an alternative waveform method expected to replace the orthogonal frequency division multiplexing in the future, its implementation must alleviate channel effects. Least-squares (LS), a low-complexity channel estimation technique, could be improved by using the discrete Fourier transform (DFT) without increasing complexity. Unlike the usage of the LS method, the DFT-based method requires the receiver to know the channel impulse response (CIR) length, which is unknown. This study introduces a simple, yet effective, CIR length estimator by utilizing LS estimation. As the cyclic prefix (CP) length is commonly set to be longer than the CIR length, it is possible to search through the first samples if CP is larger than a threshold set using the remaining samples. An adaptive scale is also designed to lower the error probability of the estimation, and a simple signal-to-interference-noise ratio estimation is also proposed by utilizing a sparse preamble to support the use of the scale. A software simulation is used to show the ability of the proposed system to estimate the CIR length. Due to shorter CIR length of rural area, the performance is slightly poorer compared to urban environment. Nevertheless, satisfactory performance is shown for both environments.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.18-26
• /
• 1993

This paper presents a multiplier free technique for the complex DFT by rotations and additions based on the complex approximation of the ring of algebraic integers. Speeding-up the computation time and reducing the dynamic range growth has been achieved by the elimination of multiplication. Moreover the DFT of no twiddle factor quantization errors is possible. Numerical examples are given to prove the algorithm and the applicable size of the DFT is 16 has been concluded.