• 방송공학회논문지
• /
• 제17권2호
• /
• pp.344-353
• /
• 2012

본 논문에서는 이산 웨이블릿 변환(Discrete Wavelet Transform: DWT)을 이용한 새로운 초고해상도 기법을 제안한다. 기존의 단일 영상에 적용되는 초고해상도 기법들의 경우 영상에서의 고주파 대역을 찾기 위하여 확률 기반의 방법들을 사용하였다. 그로 인한 연산의 복잡도 증가는 처리시간 증가라는 문제점을 발생시켰다. 제안된 기법에서는 고주파 대역을 찾기 위한 방법으로 DWT를 이용한다. DWT 수행 시 수반되는 다운 샘플링 과정을 수행하지 않음으로써 입력 받은 영상과 동일한 크기의 고주파 부대역(sub-band)들을 생성하고, 이 부대역들과 입력 받은 영상을 조합하여 이산 웨이블릿 역변환(Inverse Discrete Wavelet Transform: Inverse DWT)을 수행함으로써 고해상도의 영상을 획득한다. 제안하는 기법에서 사용한 실험영상은 원본영상($512{\times}512$)을 다운 샘플링하여 획득한 실험영상($256{\times}256$)을 사용한다. 실험을 통하여 제안된 기법이 기존의 보간법에 비해 향상된 효율을 보이며, 확률 기반의 기법들에 비해 처리시간이 줄어드는 것을 확인하였다.

• 한국항행학회논문지
• /
• 제14권3호
• /
• pp.446-451
• /
• 2010

본 논문은 H.264에서 모드 결정을 위한 간소화된 왜곡치 예측 방법을 소개하였다. 왜곡치 계산은 양자화된 변환 계수와 역양자화된 변환 계수의 차이로 계산되는데, 일반적으로 이 과정은 DCT 변환, 양자화, 역양자화 및 역 DCT 변환이 수행되어져야 한다. 제안하는 방식에서는 왜곡치를 계산하기 위하여 일련의 간소화된 수식을 사용함으로써 역양자화 및 역 DCT 과정을 생략하였다. 실험결과, PSNR은 거의 일치하면서도, RDO 모드 결정 시간은 기존의 방식보다 8~15 %의 감소를 보였다.

• 방송공학회논문지
• /
• 제16권5호
• /
• pp.782-792
• /
• 2011

In this paper, we address a new fast DCT-II/DFT/HWT hybrid transform architecture for digital video and fusion mobile handsets based on Jacket-like sparse matrix decomposition. This fast hybrid architecture is consist of source coding standard as MPEG-4, JPEG 2000 and digital filtering discrete Fourier transform, and has two operations: one is block-wise inverse Jacket matrix (BIJM) for DCT-II, and the other is element-wise inverse Jacket matrix (EIJM) for DFT/HWT. They have similar recursive computational fashion, which mean all of them can be decomposed to Kronecker products of an identity Hadamard matrix and a successively lower order sparse matrix. Based on this trait, we can develop a single chip of fast hybrid algorithm architecture for intelligent mobile handsets.

• 한국전자파학회논문지
• /
• 제17권10호
• /
• pp.913-919
• /
• 2006

본 논문에서는 움직이는 표적에 대한 ISAR(Inverse SAR) 영상의 움직임 보상 기법에 대해서 기술하였다. 움직이는 표적에 대해서 단순히 퓨리에 변환만을 이용하여 ISAR 영상을 얻으면 일반적으로 영상에 퍼짐 현상이 나타난다. 이러한 영상의 퍼짐 현상에 대한 문제는 시간-주파수 변환 기법으로 해결할 수 있다. 본 논문에서는 ISAR 영상의 움직임 보상 기법 중에서도 짧은 시간 퓨리에 변환과 Gator 웨이브릿 변환의 방법에 대해서 기술하고 있다. 이러한 각 알고리즘에 대한 성능을 나타내기 위해서 우리는 이상적인 점 산란체와 simulated MIG-25에 대한 산란파를 이용하여 움직임 보상이 된 ISAR 영상을 획득하였다. 또한 짧은 시간 퓨리에 변환과 Gabor 웨이브릿 변환을 이용하여 구한 ISAR 영상의 해상도를 나타내고 있다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제7권4호
• /
• pp.247-253
• /
• 2007

In this paper, a high throughput multiple transform architecture for H.264 Fidelity Range Extensions (FRExt) is proposed. New techniques are adopted which (1) regularize the $8{\times}8$ integer forward and inverse DCT transform matrices, (2) divide them into four $4{\times}4$ sub-matrices so that simple fast butterfly algorithm can be used, (3) because of the similarity of the sub-matrices, mixed butterflies are proposed that all the sub-matrices of $8{\times}8$ and matrices of $4{\times}4$ forward DCT (FDCT), inverse DCT (IDCT) and Hadamard transform can be merged together. Based on these techniques, a hardware architecture is realized which can achieve throughput of 1.488Gpixel/s when processing either $4{\times}4\;or\;8{\times}8$ transform. With such high throughput, the design can satisfy the critical requirement of the real-time multi-transform processing of High Definition (HD) applications such as High Definition DVD (HD-DVD) ($1920{\times}1080@60Hz$) in H.264/AVC FRExt. This work has been synthesized using Rohm 0.18um library. The design can work on a frequency of 93MHz and throughput of 1.488Gpixel/s with a cost of 56440 gates.

• Management Science and Financial Engineering
• /
• 제20권1호
• /
• pp.27-32
• /
• 2014

This paper introduces three different simulation algorithms of the shifted Poisson distribution. The first algorithm is the inverse transform method, the second is the rejection sampling, and the third is gamma-Poisson hierarchy sampling. Three algorithms have different regions of parameters at which they are efficient. We numerically compare those algorithms with different sets of parameters. As an application, we give a simulation method of the constant elasticity of variance model.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.38-48
• /
• 2006

A synchronous multicarrier (MC) code-division multiple access (CDMA) system using inverse fast Fourier transform (IFFT) and fast Fourier transform (FFT) for the downlink mobile communication system operating in a frequency selective Rayleigh fading channel is analyzed. Both carrier frequency offset and timing offset are considered in the analysis. Bit error rate performance of the system with both equal gain combining and maximum ratio combining are obtained. The performance is compared to that of the conventional system using correlation receiver. It is shown that when subcarrier number is large, the system using IFFT/FFT has nearly the same performance as the conventional one, while when the sub carrier number is small, the system using IFFT/FFT will suffer slightly worse performance in the presence of carrier frequency offset.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권8호
• /
• pp.368-373
• /
• 2002

The inverse z-transform of a z-domain expression of a sequence can be Performed in many different methods among which the recursive computational method is based on the difference equation. In applying this method, a few initial values of the sequence should be obtained separately. Although the existing method generates the right initial values of the sequence, its derivation and justification are not theoretically in view of the definition of z-transform and its shift theorems. In this paper a general approach for formulating a difference equation and for obtaining required initial values of a sequence is proposed, which completely complies to the definition of the z-transform and an interpretation of the validity of the existing method which is theoretically incorrect.

• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2351-2354
• /
• 2003

A new transform coder for arbitrarily shaped image segments is proposed. In the encoder, a block-based DCT is applied to the resulting image block after shifting pixels within the image segment to block border and padding the mean value of the pixels to empty region. For reducing the transmission bit rate, the transform coefficients located in padded region are truncated and only the remaining transform coefficients are transmitted to the decoder. In the decoder, the transform coefficients truncated in the encoder are recovered using received transform coefficients and a block-based inverse DCT is performed.