• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.515-525
• /
• 2018

In this paper, we investigate a modified $G^2$ transform on a class of Boehmians. We prove the axioms which are necessary for establishing the $G^2$ class of Boehmians. Addition, scalar multiplication, convolution, differentiation and convergence in the derived spaces have been defined. The extended $G^2$ transform of a Boehmian is given as a one-to-one onto mapping that is continuous with respect to certain convergence in the defined spaces. The inverse problem is also discussed.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.281-284
• /
• 1998

In this paper, a RS(Reed-Solomon) docoder is designed in the transform domain instead of most time domain. The transform RS decoder have simpler structure for error-correction procedure but because of his larger chip area, the time domain RS decoder is popular currently. To solve this proplem, the nomal basis representation and the conjugate property is utilized. Therefore the chip area can be reduced for the stucture of syndrome delay, nomalization and inverse transform circuit. These modified structures have been implemented using VHDL and synthesized on 0.8${\mu}{\textrm}{m}$ CMOS technology. The results have been compared with other structure for chip area and performance.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.63-66
• /
• 2001

In this paper a binary image encryption technique and decryption system based on a joint transform correlator (JTC) are Proposed. In this method, a Fourier transform of the encrypted image is used as the encrypted data and a Fourier transform of the random phase is used as the key code. The original binary image can be reconstructed on a square law device, such as a CCD camera after the joint input is inverse Fourier transformed. The proposed encryption technique does not suffer from strong auto-correlation terms appearing in the output plane. Based on computer simulations, the proposed encryption technique and decoding system were demonstrated as adequate for optical security applications.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2471-2474
• /
• 2003

The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.5 no.4
• /
• pp.237-242
• /
• 2005

H.264/AVC adopts new features compared with previous multimedia algorithms. It is inefficient to implement some of the new blocks using existing DSP instructions. Hence, new instructions are required to implement H.264/AVC. This paper proposes novel instructions for intra-prediction, in-loop deblocking filter, entropy coding and integer transform. Performance comparisons show that the required computation cycles for the in-loop deblocking filter can be reduced about $20{\sim}25%$. This paper also proposes new instructions for the integer transform. The proposed instructions can execute one dimension forward/inverse integer transform. The integer transform can be implemented using much smaller hardware size than existing DSPs.

• Journal of Information Processing Systems
• /
• v.17 no.6
• /
• pp.1170-1178
• /
• 2021

This paper proposed a versatile algorithm based on a dual-tree complex wavelet transform for intensifying the visual aspect of medical images. First, the decomposition of the input image into a high sub-band and low-sub-band image is done. Further, to improve the resolution of the resulting image, the high sub-band image is interpolated using Lanczos interpolation. Also, contrast enhancement is performed by singular value decomposition (SVD). Finally, the image reconstruction is achieved by using an inverse wavelet transform. Then, the Gaussian filter will improve the visual quality of the image. We have collected images from the hospital and the internet for quantitative and qualitative analysis. These images act as a reference image for comparing the effectiveness of the proposed algorithm with the existing state-of-the-art. We have divided the proposed algorithm into several stages: preprocessing, contrast enhancement, resolution enhancement, and visual quality enhancement. Both analyses show the proposed algorithm's effectiveness compared to existing methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.205-211
• /
• 2012

By using an adaptive threshold and weight based on the wavelet transform and Haar transform, a novel image enhancement algorithm is proposed. First, a medical image was decomposed with wavelet transform and all high-frequency sub-images were decomposed with Haar transform. Secondly, noise in the frequency domain was reduced by the proposed soft-threshold method. Thirdly, high-frequency coefficients were enhanced by the proposed weight values in different sub-images. Then, the enhanced image was obtained through the inverse Haar transform and wavelet transform. But the pixel range of the enhanced image is narrower than a normal image. Lastly, the image's histogram was stretched by nonlinear histogram equalization. Experiments showed that the proposed method can be not only enhance an image's details but can also preserve its edge features effectively.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.10
• /
• pp.1574-1582
• /
• 2004

Binary manipulators have recently received much attention due to hyper-redundancy, light weight, good controllability and high reliability. The precise positioning of the manipulator end-effecter requires the use of many modules, which results in a high-dimensional workspace. When the workspace dimension is large, existing inverse kinematics methods such as the Ebert-Uphoff algorithm may require impractically large memory size in determining the binary positions of all actuators. To overcome this limitation, we propose a new inverse kinematics algorithm: the inverse kinematics problem is formulated as an optimization problem using real-valued design variables, The key procedure in this approach is to transform the integer-variable optimization problem to a real-variable optimization problem and to push the real-valued design variables as closely as possible to the permissible binary values. Since the actual optimization is performed in real-valued design variables, the design sensitivity becomes readily available, and the optimization method becomes extremely efficient. Because the proposed formulation is quite general, other design considerations such as operation power minimization can be easily considered.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.3
• /
• pp.240-248
• /
• 2013

In this paper, we propose a super-resolution algorithm using an adaptive weighted interpolation(AWI) and discrete wavelet transform(DWT). In general, super-resolution algorithms for single-image, probability based operations have been used for searching high-frequency components. Consequently, the complexity of the algorithm is increased and it causes the increase of processing time. In the proposed algorithm, we first find high-frequency sub-bands by using DWT. Then we apply an AWI to the obtained high-frequency sub-bands to make them have the same size as the input image. Now, the interpolated high-frequency sub-bands and input image are properly combined and perform the inverse DWT. For the experiments, we use the down-sampled version of the original image($512{\times}512$) as a test image($256{\times}256$). Through experiment, we confirm the improved efficiency of the proposed algorithm comparing with interpolation algorithms and also save the processing time comparing with the probability based algorithms even with the similar performance.