• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.91-98
• /
• 1997

In this paper, a new pixel decimation algorithm for the estimation of motion vector is proposed. In traditional methods, the computational cost can be reduced since only part of the pixels are used for motion vector calculation. But these methods limits the accuracy ofmotion vector because of the same reason. We derive a selection criteria of subsampled pixels that can reduce the probablity of false motion vector detection based on stochastic point of view. By using this criteria, a new pixel decimation algorithm that can reduce the prediction error with similar computational cost is presented. The simulation results applied to standard images haveshown that the proposed algorithm has less mean absolute prediction error than conventional pixel decimation algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.5
• /
• pp.16-22
• /
• 2000

This paper presents a compression algorithm applicable for transmitting a HPO hologram data. The proposed algorithm exploits a modulating function to compress the bandwidth of the hologram pattern, resulting in decimation due to relaxed Nyquist sampling constraints. At the receiver, the compressed data will be interpolated and compensated via being divided by the modulating function. We also present compression rate and analyze the resolution of a reconstructed image and the periodicity of harmonic interferences. Finally, we shows the validity of the proposed algorithm by simulation where a reconstructed image from undersampled data is compared with a reconstructed image obtained through decimatioin by modulating function, interpolation and compensation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.338-347
• /
• 2005

In this paper, a decimation-in-time search direction algorithm for displacement prediction of moving object is proposed. The initialization of the proposed algorithm for moving direction prediction is performed by detecting moving objects at sequential frames and by obtaining a moving angle and a moving distance. A moving direction of the moving object at current frame is obtained by applying the decimation-in-time search direction mask. The decimation-in-tine search direction mask is that the moving object is detected by thinning out frames among the sequential frames, and the moving direction of the moving object is predicted by the search mask which is decided by obtaining the moving angle of the moving object in the 8 directions. to examine the propriety of the proposed algorithm, velocities of a driving car are measured and tracked, and to evaluate the efficiency, the proposed algorithm is compared to the full search algorithm. The evaluated results show that the number of displacement search times is reduced up to 91.8$\%$ on the average in the proposed algorithm, and the processing time of the tracking is 32.1ms on the average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1145-1147
• /
• 2013

There are two FFT(Fast Fourier Transform) algorithms, which are DIT(Decimation-In-Time) and DIF(Decimation-In- Frequency). Even the DIF algorithm is more widely used because of its various implementation architectures, the DIT structures have not been investigated. In this paper, the DIT Radix-4 algorithm is derived and its efficient butterfly structure is proposed for SoC(System on a Chip) implementation.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.347-358
• /
• 2000

The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

• Journal of Broadcast Engineering
• /
• v.12 no.3
• /
• pp.266-277
• /
• 2007

Recently, Transmitter Identification(TxID) technology has been issued as a technology of ATSC DTV. ATSC DTV networks are comprised of a plurality of transmitters, broadcasting the same signal sing one frequency network(SFN) connected to EDOCR. In this single frequency network, TxID technology has been recognized as a technology in the ATSC DTV system since it enables the broadcast authorities and classify multiple transmitters. However, conventional TxID uses extremely long spreading sequence to identifying transmitters, so it increases H/W complexity and registers. Thus, to solve those hardware problems, we propose an efficient signal processing technology using decimation algorithm. Furthermore, we certified the availability of the proposed algorithm via various simulations.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1045-1048
• /
• 1998

This paper proposes a efficient algorithm of letter-box converter using 4:3 decimation algorithm. To display 16:9 wide images on a 4:3 screen, there is need to convert the 16:9 wide images. The letter-box converter is designed with multiplierless architecture. We have modeled the letter-box converter in verilog-HDL and verified to show little difference between the original image and the converte image.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5579-5585
• /
• 2015

In FFT(Fast Fourier Transform) implementation, DIT(Decimation-In-Time) and DIF (Decimation-In-Frequency) methods are mostly used. Among them, various DIF structures such as Radix-2/4/8 algorithm have been developed. Compared to the DIF, the DIT structures have not been investigated even though they have a big advantage producing a sequential output. In this paper, a butterfly structure for DIT Radix-8 algorithm is proposed. The proposed structure has smaller latency time because of Radix-8 algorithm in addition to the advantage of the sequential output. In case of 4096-point FFT implementation, the proposed structure has only 4 stages which shows the smaller latency time compared to the 12 stages of Radix-2 algorithm. The proposed butterfly can be used in FFT block required the sequential output and smaller latency time.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1187-1194
• /
• 2005

In this paper, new contrast enhancement algorithms that use temporal decimation method and approximated CDF(Cumulative Distribution Function) are proposed. They reduce the amount of computation which is required for image contrast enhancement. Simulation results show that the algorithms can achieve significant reduction in the computational cost and the hardware complexity. Visual test and standard deviation of their histogram have been introduced to evaluate the resultant output images of the proposed method and the original ones.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.145-156
• /
• 2005

In application for acoustic echo cancellation and adaptive equalization, input signal is highly correlated and the long length of adaptive filter is needed. Affine projection algorithms, in these applications, can produce a good convergence performance. However, they have a drawback that is a complex hardware implementation. In this paper, we propose a new subband affine projection algorithm with improved convergence and reduced computational complexity. In addition, we suggest a good approach to implement the proposed method. In this method by applying polyphase decomposition, noble identity and critical decimation to the anne projection algorithm the number of input vectors for decorrelation can be reduced. The weight-updating formula of the proposed method is derived as a simple form that compared with the NLMS(normalized least mean square) algorithm by the reduced projection order The efficiency of the proposed algorithm for a colored input signal was evaluated by using computer simulations.