• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.54-62
• /
• 2000

Adaptive filtering method is one of signal processing area which is frequently used in the case of statistical characteristic change in time-varing situation. The performance of adaptive filter is usually evaluated with complexity of its structure, convergence speed and misadjustment. The structure of adaptive filter must be simple and its speed of adaptation must be fast for real-time implementation. In this paper, we propose chirp discrete cosine transform (CDCT), which has the characteristics of CZT (chrip z-transform) and DCT (discrete cosine transform), and then CDCTLMS (chirp discrete cosine transform LMS) using the above mentioned algorithm for the improvement of its speed of adaptation. Using loaming curve, we prove that the proposed method is superior to the conventional US (normalized LMS) algorithm and DCTLMS (discrete cosine transform LMS) algorithm. Also, we show the real application for the ultrasonic signal processing.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.727-732
• /
• 2012

This paper presents an approach to classify normal and arrhythmia from the MIT-BIH Arrhythmia Database using Discrete Cosine Transform(DCT), Discrete Wavelet Transform(DWT) and neural network. In the first step, Discrete Cosine Transform is used to obtain the representative 15 coefficients for input features of neural network. In the second step, Discrete Wavelet Transform are used to extract maximum value, minimum value, mean value, variance, and standard deviation of detail coefficients. Neural network classifies normal and arrhythmia beats using 55 numbers of input features, and then the accuracy rate is 98.8%.

• Journal of Broadcast Engineering
• /
• v.28 no.1
• /
• pp.100-108
• /
• 2023

In hybrid block-based video coding, transform coding converts spatial domain residual signals into frequency domain data and concentrates energy in a low frequency band to achieve a high compression efficiency in entropy coding. The state-of-the-art video coding standard, VVC(Versatile Video Coding), uses DCT-2(Discrete Cosine Transform type 2), DST-7(Discrete Sine Transform type 7), and DCT-8(Discrete Cosine Transform type 8) for primary transform. In this paper, considering that DCT-2, DST-7, and DCT-8 are all linear transformations, we propose an inverse transform that reduces the number of multiplications in the inverse transform by using the linearity of the linear transform. The proposed inverse transform method reduced encoding time and decoding time by an average 26%, 15% in AI and 4%, 10% in RA without the increase of bitrate compared to VTM-8.2.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.901-910
• /
• 2004

In this paper, we propose a content-based MPEG transcoding method using a discontinuity feature in the Discrete Cosine Transform (DCT) domain. A DCT block is transcoded differently depending on the height of dominant discontinuity within a block. In the experiment, we show the result that the video quality of content-based transcoding is better than that of a constant cut-off method and the processing time of the adaptive method is much faster compared with the pixel domain methods in the same bandwidth.

• Journal of the Korean Professional Engineers Association
• /
• v.22 no.2
• /
• pp.19-25
• /
• 1989

Utilizing a cosine transform in image compression has several recognized performance benefits, resulting in the ability to attain large compression ratio with small quality loss. Also, various models incorporating Human Visual System (HVS) to Discrete Cosine Trans-form (DCT) scheme are considered. Using the exact frequency components of DCT basis function, the optimum modulation transfer function (MTF) is obtained analytically. The errors at a block boundary which is important factor in transform coder are criteria for error measurement. The HVS weight coding results in perceptually higher quality images compared with the unweighted scheme.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.609-614
• /
• 2002

Watermarking is embedding a digital signal called as watermark into images to claim the ownership. In this paper, a new digital watermarking algorithm based on DCT (Discrete Cosine Transform) which enhances invisibility and robustness is proposed to improve contentional digital watermarking method using DCT. In the proposed method, it is possible to enhance invisibility and robustness using watermark reordering in which the relative significance of original DCT coefficients can be preserved in watermarked DCT coefficients, and the distortions of original DCT coefficients can be minimized. The experimental results show that the proposed method improves invisibility approximately 9～12[dB] and is more robust to various attacks than the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2407-2414
• /
• 1999

This paper introduces the concept of warped discrete cosine transform (WDCT) and an image compression algorithm based on the WDCT. The proposed WDCT is a cascade connection of a conventional DCT and all-pass filters whose parameters can be adjusted to provide frequency warping. In the proposed image compression scheme, the frequency response of the all-pass filter is controlled by a set of parameters with each parameter for a specified frequency range. For each image block, the best parameter is chosen from the set and is sent to the decoder as a side information along with the result of corresponding WDCT computation. For actual implementation, the combination of the all-pass IIR filters and the DCT can be viewed as a cascade of a warping matrix and the DCT matrix, or as a filter bank which is obtained by warping the frequency response of the DCT filter bank. Hence, the WDCT can be implemented by a single matrix computation like the DCT. The WDCT based compression, outperforms the DCT based compression, for high bit rate applications and for images with high frequency components.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.97-103
• /
• 2008

In this paper, $256{\times}256$ input image is classified into a validity block and an edge block of $8{\times}8$ block for image compression. DCT(Discrete Cosine Transform) is executed only for the DC coefficient that is validity coefficients for a validity block. Predict the position where a quantization coefficient becomes 0 for an edge block, I propose new algorithm to execute DCT in the reduced region. Not only this algorithm that I proposed reduces computational complexity of FDCT(Forward DCT) and IDCT(Inverse DCT) and decreases encoding time and decoding time. I let compressibility increase by accomplishing other stability verticality zigzag scan by the block size that was classified for each block at the time of huffman encoding each. In addition, the algorithm that I suggested reduces Run-Length by accomplishing the level verticality zigzag scan that is good for a classified block characteristic and, I offer the compressibility that improved thereby.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.497-505
• /
• 2016

The two-dimensional (2D) Discrete Cosine Transform (DCT) is used widely in image and video processing systems. The perception of human visualization permits us to design approximate rather than exact DCT. In this paper, we propose a digital implementation of 16-point approximate 2D DCT architecture based on one-dimensional (1D) DCT and Modified Gate Diffusion Input (MGDI) technique. The 8-point 1D Approximate DCT architecture requires only 12 additions for realization in digital VLSI. Additions can be performed using the proposed 8 transistor (8T) MGDI Full Adder which reduces 2 transistors than the existing 10 transistor (10T) MGDI Full Adder. The Approximate MGDI 2D DCT using 8T MGDI Full adders is simulated in Tanner SPICE for $0.18{\mu}m$ CMOS process technology at 100MHZ.The simulation result shows that 13.9% of area and 15.08 % of power is reduced in the 8-point approximate 2D DCT, 10.63 % of area and 15.48% of power is reduced in case of 16-point approximate 2D DCT using 8 Transistor MGDI Full Adder than 10 Transistor MGDI Full Adder. The proposed architecture enhances results in terms of hardware complexity, regularity and modularity with a little compromise in accuracy.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.313-320
• /
• 2005

The 2-D discrete cosine transform (DCT) is an integral part of video and image processing; it is used in both the PEG and MPEG enciding standards. As streaming video is brought to mobile devices, it becomes important that it is possible to calculate the DCT in an energy-efficient manner. In this paper, we present a new algorithm the DCT with a linear array PEs. This design is optimized for energy efficiency. We analyze the energy, area, and latency tradeoffs available with this design and then compare its energy dissipation, area, and latency to those of Xilinx's optimized IP core.