• Title/Summary/Keyword: Discrete Fourier transform

Search Result 335, Processing Time 0.029 seconds

Novel Digital Cancelation Method in Presence of Harmonic Self-Interference

  • Ju, Hyungsik;Gwak, Donghyuk;Lee, Yuro;Kim, Tae-Joong
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.245-254
    • /
    • 2017
  • In-band full-duplex (IFD) communication has recently attracted a great deal of interest because it potentially provides a two-fold spectral efficiency increase over half-duplex communications. In this paper, we propose a novel digital self-interference cancelation (DSIC) algorithm for an IFD communication system in which two nodes exchange orthogonal frequency-division multiplexing (OFDM) symbols. The proposed DSIC algorithm is based on the least-squares estimation of a self-interference (SI) channel with block processing of multiple OFDM symbols, in order to eliminate the fundamental and harmonic components of SI induced through the practical radio frequency devices of an IFD transceiver. In addition, the proposed DSIC algorithm adopts discrete Fourier transform processing of the estimated SI channel to further enhance its cancelation performance. We provide a minimum number of training symbols to estimate the SI channel effectively. The evaluation results show that our proposed DSIC algorithm outperforms a conventional algorithm.

Space-Polarization Division Multiple Access System with Limited Feedback

  • Joung, Heejin;Jo, Han-Shin;Mun, Cheol;Yook, Jong-Gwan
    • 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.

PLL Method Using The Improved Discrete Fourier Transform (개선된 DFT를 이용한 위상 추종방법)

  • Kim, Jae-Hyung;Ji, Young-Hyok;Won, Chung-Yuen;Jung, Yong-Chae
    • 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.

  • PDF

Partial Shift Mapping for PAPR Reduction with Low Complexity in OFDM Systems

  • Ouyang, Xing;Jin, Jiyu;Jin, Guiyue;Wang, Zhisen
    • ETRI Journal
    • /
    • v.34 no.2
    • /
    • pp.268-271
    • /
    • 2012
  • The high peak-to-average power is one of the main drawbacks in OFDM systems. This letter proposes a partial shift mapping (PSM) method for peak power reduction in OFDM systems. By utilizing the properties of the discrete Fourier transform, the proposed method generates a set of candidate signals without additional complex multiplication and selects the one with minimum peak power for transmission. Analyses and simulations confirm that the PSM method achieves satisfactory peak power reduction performance and low complexity compared with other kindred methods, for example, selected mapping and partial transmit sequences.

Roughness and Shape Analysis on Granular Materials (조립토의 거칠기 및 모양 분석)

  • 민덕기;이완진;이종익
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2002.10a
    • /
    • pp.245-252
    • /
    • 2002
  • The roughness of Joomoonjin sand and the Dongchun river sand was analysed by the fractal theory. It was found that the fractal dimension(D$\_$F/) of Joomoonjin sand is a little smaller than the Dongchun river sand. That means Joomoonjin sand is smoother than the Dongchun river sand. The measurements of D$\_$F/ of different fraction of the Donchun river sand showed that large particles were rougher than fine particles. The shapes of both sands were analysed by the Discrete Fourier Transform(DFT) and the Grid-based(GB) method. Normalization of coefficients with respect to size, starting point and its orientation made the coefficients invaried to these characteristics. The mean of the normalized coefficients was used to reconstruct the average shape for both sands, respectively. The measurements of the ellipticity ratio of different fraction of both sands showed that Joomoonjin sand is slightly flatter than the Dongcun river sand.

  • PDF

A Performance Analysis of OFDM Systems in Excessively Dispersive Multipath Channels

  • Lee Woo-Kwon;Curry Christopher S.
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.323-329
    • /
    • 2006
  • For orthogonal frequency division multiplexing (OFDM), the discrete Fourier transform (DFT)-based processing at the receiver has been perceived equivalent to the matched filter (MF)-based processing. In this paper, we revisit the equivalence and mathematically show that when the guard interval is insufficient, the well-known DFT-based processing inherently causes more intersymbol and interchannel interference (ISI/ICI) than the MF-based processing. Then, with the adverse increase of interference, analytical expressions for the link performance are derived in terms of bit error rate (BER). Numerical results from computer simulation and analysis are presented to justify our claims.

Access timing offsets-resilient SC-FDMA (접속동기 오차에 강한 SC-FDMA 기법)

  • Kim, Bong-Seok;Choi, Kwonhue
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.26-29
    • /
    • 2012
  • In this paper, we propose a Single Carrier Frequency Division Multiple Access(SC-FDMA) scheme with greatly enhanced tolerance of timing offset among the users. The type of the proposed scheme is similar to code spread Multiple Carrier Direct Spread Code Division Multiple Access(MC DS CDMA). The proposed scheme performs partial Discrete Fourier Transform(DFT) in order to solve high Peak to Average Power Ratio(PAPR) of the MC DS CDMA before Inverse Fast Fourier Transform(IFFT). Exploiting the property Properly Scrambled Walsh-Hadamard(PSW) code has zero correlation despite ${\pm}1$ chip timing offset, the proposed scheme achieves Multiple Access Interference free performance with the timing offset up to ${\pm}1$ OFDM symbol duration with low PAPR. In contrast, the other existing schemes in comparison undergo severe performance degradation even with small timing offset in multipath fading channel.

A Fast IFFT Algorithm for IMDCT of AAC Decoder (AAC 디코더의 IMDCT를 위한 고속 IFFT 알고리즘)

  • Chi, Hua-Jun;Kim, Tae-Hoon;Park, Ju-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.5
    • /
    • pp.214-219
    • /
    • 2007
  • This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The $2^n$(N-point) type IMDCT is the most powerful among many IMDCT algorithms, however it includes IFFT that requires many calculation cycles. The IFFT used in $2^n$(N-point) type IMDCT employ the bit-reverse data arrangement of inputs and N/4-point complex IFFT to reduce the calculation cycles. We devised a new data arrangement method of IFFT input and $N/4^{n+1}$-type IFFT and thus we can reduce multiplication cycles, addition cycles, and ROM size.

Object-based digital watermarking methods in frequency domain (주파수 영역에서의 객체기반 디지털 워터마크)

  • Kim, Hyun-Tae;Kim, Dae-Jin;Won, Chee-Sun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.5
    • /
    • pp.9-20
    • /
    • 2000
  • In this paper we compare two frequency domain digital watermarking methods for digital Images, namely DCT(Discrete Cosine Transform) based and DFT(Discrete Fourier Transform) based methods. Unlike DCT coefficients, which always have real values, DFT coefficients normally have complex values Therefore, the DFT coefficients have amplitude and phase components Among them, the phase components are known to carry more Important information for the Images. So, we insert the watermark to the phase of the DFT coefficients only This DFT watermarking method is compared with the conventional DCT based watermarking method for the object-based watermarking problem. Experimental results show that the DFT-phase based method IS more robust to general Image processing attacks including resize, lossy compression(JPEG), blurring and median filtering. On the other hand, the DCT based method is more robust to the malicious attack which inserts different watermarks.

  • PDF

A Simple Discrete Cosine Transform Systolic Array Based on DFT for Video Codec (DFT에 의한 비데오 코덱용 DCT의 단순한 시스톨릭 어레이)

  • 박종오;이광재;양근호;박주용;이문호
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.11
    • /
    • pp.1880-1885
    • /
    • 1989
  • In this paper, a new approach for systolic array realizing the discrete cosine transform (DCT) based on discrete Fourier transform (DFT) of an input sequence is presented. The proposed array is based on a simple modified DFT(MDFT) version of the Goertzel algorithm combined with Kung's approach and is proved perfectly. This array requires N cells, one multiplier and takes N clock cycles to produce a complete N-point DCT and also is able to process a continuous stream of data sequences. We have analyzed the output signal-to-noise ratio(SNR) and designed the circuit level layout of one-PE chip. The array coefficients are static adn thus stored-product ROM's can be used in place of multipliers to limit cost as eliminate errors due to coefficients quantization.

  • PDF