• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.243-247
• /
• 2005

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.1-9
• /
• 2020

In this paper, we propose an efficient adaptive write scheme that improves the performance of write operation in MLC STT-MRAM caches. The key idea of the proposed scheme is to perform the write operation fast if the target MLC STT-MRAM cells contain a dead block. Even if the fast write operation on the MLC STT-MRAM evicts a cache block from the MLC STT-MRAM cells, its performance impact is low if the evicted block is a dead block which is not used in the future. Through experimental evaluation with a memory simulator, we show that the proposed adaptive write scheme improves the performance of the MLC STT-MRAM caches by 17% on average.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.1
• /
• pp.101-108
• /
• 2005

Adaptive constant false alarm rate(CFAR) algorithm is used for good detection probability as well as constant false alarm rate in clutter background. Especially, filtering technique adaptive to spatial variation is necessary for improving detection quality in non stationary clutter environment which has spatial correlation and large magnitude deviation. In this paper, we propose a two-dimensional block interpolation(TBI) adaptive CFAR algorithm that calculates the node estimate in the fred two dimensional region and subsequently determines the final estimate for each resolution cell by two-dimensional interpolation. The proposed method is efficient for filtering abnormal ejection by adopting distribution median in fixed region and also has advantage of reducing required memory space by using estimation method which gets final values after calculating the block node values. Through simulations, we show that the proposed method is superior to the traditional adaptive CFAR algorithms which are transversal or recursive in aspect of the detection performance and required memory space.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.677-680
• /
• 1998

In this paper, we proposed a lwo bit rate subband coding with adaptive vector quantization using the correlation between motion vector and block energy in subband. In this method, the difference between the input signal and the motion compensated interframe prediction signal is decomposed into several narrow bands using quadrature mirror filter (QMF) structure. The subband signals are then quantized by adaptive vector quantizers. In the codebook generating process, each classified region closer to the block value in the same region after the classification of region by the magnitude of motion vector and the variance values of subband block. Because codebook is genrated considering energy distribution of each region classified by motion vector and variance of subband block, this technique gives a very good visual quality at low bit rate coding.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.179-185
• /
• 2019

This paper proposes a block-type classification based image binarization for the implementation of the low-power feature extraction algorithm. The proposed method can be implemented with threshold value re-use technique approach when the image divided into $64{\times}64$ macro blocks size and calculating the threshold value for each block type only once. The algorithm is validated based on quantitative results that only a threshold value change rate of up to 9% occurs within the same image/block type. Existing algorithms should compute the threshold value for 64 blocks when the macro block is divided by $64{\times}64$ on the basis of $512{\times}512$ images, but all suggestions can be made only once for best cases where the same block type is printed, and for the remaining 63 blocks, the adaptive threshold calculation can be reduced by only performing a block type classification process. The threshold calculation operation is performed five times when all block types occur, and only the block type separation process can be performed for the remaining 59 blocks, so 93% adaptive threshold calculation operation can be reduced.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.11
• /
• pp.101-108
• /
• 2007

In this paper, we propose and verify an adaptive block watermarking algorithm based on JPEG2000 DWT, which determines watermarking for the original image by two scaling factors in order to overcome image degradation and blocking problem at the edge. Adaptive block watermarking algorithm uses 2 scaling factors, one is calculated by the ratio of present block average to the next block average, and the other is calculated by the ratio of total LL subband average to each block average. Signals of adaptive block watermark are obtained from an original image by itself and the strength of watermark is automatically controlled by image characters. Instead of conventional methods using identical intensity of a watermark, the proposed method uses adaptive watermark with different intensity controlled by each block. Thus, an adaptive block watermark improves the visuality of images by 4$\sim$14dB and it is robust against attacks such as filtering, JPEG2000 compression, resizing and cropping. Also we implemented the algorithm in ASIC using Hynix 0.25${\mu}m$ CMOS technology to integrate it in JPEG2000 codec chip.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1005-1012
• /
• 1987

An adaptive scalar DCT-Wiener filtering method that can be applied to the problem of restoring an image degraded by white Gaussian noise is presented. In this method, the power spectrum needed to Winer filering is adaptively estimated in block-wise according to the lical properties in transform domain. In addition, overlapping method for reducing the block artifact is considered. Experimental results show that the adaptive Wiener filter by the proposed method yields performance improvement and better image quality over the nonadaptive one and the spatial Lee filter.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.678-681
• /
• 2002

In this paper, we propose a block LMS algorithm using distributed arithmetic (BDA) and a multi-memory block structured BDA (MBDA). Moreover, we propose an effective VLSI architecture of adaptive digital filter using MBDA, and evaluate the sampling rate and output latency.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.199-204
• /
• 1994

In this paper, we researched abut CELP speech coding algorithm using efficlent pseudo-stochastic block codes, adaptive-codebook and improved fixed-gain codebook. The pseudo-stochastic block codes refer to stochastically populated block codes in which the adjacent codewords in an innovation codebook are non-independent. The adaptive-codebook was made with previous prediction speech data by storage-shift register. This CELP coding algorithm enables the coding of toll quality speech at bit rates from 4.8kbits/s to 9.6 kbits/s. This algorithm was realized TMS320C30 microprocessor in realtime.

• Journal of Korea Multimedia Society
• /
• v.21 no.8
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.