• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.85-88
• /
• 2000

In order to resolve problems according to the phase error in QPSK demodulator of the digital communication systems. The demodulator requires carrier recovery loop which searches for the frequency and phase of the carrier. In this paper the complexity of implementation is reduced by the reduction into half of the number of the multiplier in filter structure of the conventional carrier recovery loop, and as the drawback of NCO of the conventional carrier recovery loop wastes a amount of power for the structure of lookup table , We designed the structure of combinational logic without the lookup table. In the comparison with dynamic power of the proposed NCO, the power of NCO with the lookup table is 175㎼, NCO with the proposed structure is 24.65㎼. As the result, it is recognized that about one eight of loss power is reduced. In the simulation of carrier recovery loop designed QPSK demodulator, it is known that the carrier phase is compensated.

• Proceedings of the IEEK Conference
• /
• 2001.06e
• /
• pp.165-168
• /
• 2001

In this W the complexity of implementation is reduced by the reduction into half of the number of the multiplier in filter structure of the conventional carrier recovery loop, and as the drawback of NCO of the conventional carrier recovery loop wastes a amount of power for the structure of lookup table, We designed the structure of combinational logic without the lookup table. In the comparison with dynamic power of the proposed NCO, the power of NCO with the lookup table is 175${\mu}$W, NCO with the proposed of structure is 24,65${\mu}$W. As if result, it is recognized that about one eight of loss power is reduced In the simulation of carrier recovery loop designed QPSK demodulator, it is known that the carrier phase is compensated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.454-460
• /
• 2003

In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.773-778
• /
• 2007

In order to resolve problems with the phase error in QPSK demodulator of the digital satellite broadcasting systems, the demodulator requires carrier recovery loop which searches for the frequency and phase of the carrier. In this paper the complexity of implementation is reduced by the reduction into half of the number of the multiplier in Inter structure of the conventional carrier recovery loop, and as the drawback of NCO of the conventional carrier recovery loop wastes a amount of power for the structure of lookup table, We designed the structure of combinational logic without the lookup table. In the comparison with dynamic power of the proposed NCO, the power of NCO with the lookup table is $175{\mu}W$, NCO with the proposed structure is $24.65{\mu}W$. As the result, it is recognized that about one eight of loss power is reduced. In the simulation of carrier recovery loop designed QPSK demodulator, it is known that the carrier phase is compensated.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.331-334
• /
• 2004

A new measurement scheme is proposed to generate an optimized boost table for video rate LCD response time compensation. This method, which closely follows basic theory, enables up to a 90% reduction in the lookup table creation time compared to conventional methods. Furthermore, while conventional approaches require all measurements to be repeated in order to load the entire LUT whenever key parameters such as refresh rate or boost intensity are modified, the method proposed in this paper allows the new table to be calculated by utilizing saved waveform data without the need for any repeated measurements.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1928-1931
• /
• 2002

Orthogonal Frequency Division Multiplexing or OFDM is a form of multi-carrier modulation technique. High spectral efficiency, robustness to channel fading, immunity to impulse interference, uniform average spectral density, capability of handling very strong echoes and less on linear distortion are among the favorite properties of OFDM. Even though there are many advantages of OFDM, t has two main drawbacks: high Peak to Average Power Ratio (PAPR) and frequency of offset. In this paper, the issue of PAPR in OFDM is discussed. A new algorithm is proposed to reduce PAPR by selecting the input sequences property using a lookup table.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1868-1873
• /
• 2021

This paper proposes the Hough transform(HT) using an extended lookup table(LUT) to reduce the computational burden of the HT that is a typical straight line detection algorithm, and analyzes its performance. The conventional HT also uses a LUT to the calculation of the parameter 𝜌 of all straight lines passing through an edge pixel of interest(ePel) in order to reduce the computational burden. However, the proposed HT adopts an extended LUT that can be applied to straight lines across the ePel as well as its peripheral edge pixels to induce more computational reduction. This paper proves the validity of the proposed algorithm mathematically and also verifies it through simulation. The simulation results show that the proposed HT reduces the multiplication computation from 49.6% up to 16.1%, depending on the image and the applied extended LUT, compared to the conventional HT.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.824-832
• /
• 1998

In this paper, wc proposed new method for corner point detection on digital contours using directional angle and area dcviation_ First of all, dircctional angle was detccted according to contours by lookup table, then corner point was detected using arca deviation aftcr the pixels over standard value had selected as a candidate point. This method has the advantage the rcduction of processing time for real time processing and the reduction of round-off error on digital image reprcsentation. For vcrification of the proposed method simulation results which applied on various tcst pattern were compared with existing methods.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.3
• /
• pp.314-319
• /
• 2019

Computing chromagram similarity is indispensable in constructing cover song identification system. This paper proposes a code-based chromagram similarity to reduce the computational and the storage costs for cover song identification. By learning a song-specific codebook, a chromagram sequence is converted into a code sequence, which results in the reduction of the feature storage cost. We build a lookup table over the learned codebooks to compute chromagram similarity efficiently. Experiments on two music datasets were performed to compare the proposed code-based similarity with the conventional one in terms of cover song search accuracy, feature storage, and computational cost.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.127-135
• /
• 2010

In motion adaptive temporal noise reduction filtering used for reducing video noises, the strength of motion adaptive temporal filtering should be carefully controlled according to temporal movement. This paper presents a motion adaptive temporal filtering scheme based on least-square training. Each pixel is classified to a specific class code according to temporal movement, and then, an iterative least-square training method is applied for each class code to find optimal filtering coefficients. The iterative least-square training is an off-line procedure, and the trained filter coefficients are stored in a lookup table (LUT). In actual noise reduction filtering operation, after each pixel is classified by temporal movement, simple filtering operation is applied with the filter coefficients stored in the LUT according to the class code. Experiment results show that the proposed method efficiently reduces video noises without introducing blurring.