• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.795-802
• /
• 2005

Binary CDMA(B-CDMA) is a new modulation scheme that employs a constant envelope modulation scheme By quantizing the envelope of multi-codes CDMA signal into a small number of levels, the B-CDMA can reduce the peak-to-average power ratio, while preserving the advantages of CDMA signaling such as the soft capacity and robustness to interference. In this paper, we analyze the performance of B-CDMA systems in multi-path channel assuming that the spreading factor is not too small. Finally, the analytic results are verified by computer simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.109.5-109
• /
• 2001

The separation of scintillation phenomena concurrent with rain attenuation phenomena can be accomplished by filtering. Based on the analysis of satellite signal fading during rain, scintillation and rain attenuation phenomena are examined and extracting from raw data by using adaptive IIR high-pass filter and adaptive IIR low-pass filter. Adaptive IIR filter are designed by using the algorithm of Least Mean p-Power (LMP) Error Criterion which have been modified by Quantizing Gradient technique. This algorithm reduces amount of multiplication computational equal to the length of input data. It is prove here that the convergence speed, variance, bias independence on p values. For this application, p=1 is chosen. The procedure of application ...

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.653-662
• /
• 1989

Cerebellar Model Arithmetic Controller (CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d.o.f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process. A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.723-726
• /
• 2009

This paper describes a non-causal interpolative prediction method for B-picture encoding. Interpolative prediction uses correlations between neighboring pixels, including non-causal pixels, for high prediction performance, in contrast to the conventional prediction, using only the causal pixels. For the interpolative prediction, the optimal quantizing scheme has been investigated for preventing conding error power from expanding in the decoding process. In this paper, we extend the optimal quantization sceme to inter-frame prediction in video coding. Unlike H.264 scheme, our method uses non-causal frames adjacent to the prediction frame.

• 한국기계연구소 소보
• /
• s.19
• /
• pp.93-115
• /
• 1989

Cerebellar Model Arithmetic Controller(CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d. o. f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process; A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.81-95
• /
• 1996

In this paper, we propose a motio estiamtion algorithm using low-resolution quantization to reduce the computation of the full search algorithm. The proposed algorithm consists of the low-resolution search which determins the candidate motion vectors by comparing the low-resolution image and the full-resolution search which determines the motion vector by comparing the full-resolution image on the positions of the candidate motion vectors. The low-resolution image is generated by subtracting each pixel value in the reference block or the search window by the mean of the reference block, and by quantizing it is 2-bit resolution. The candidate motion vectors are determined by counting the number of pixels in the reference block whose quantized codes are unmatched to those in the search window. Simulation results show that the required computational cost of the proposed algorithm is reduced to 1/12 of the full search algorithm while its performance degradation is 0.03~0.12 dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1613-1623
• /
• 1996

In this paper, an image coding scheme using removal of isolated coefficients and quadtree structure in wavelet transformed domain, is suggested. The number of significant coefficients can be reduced by quantizing in different stages according to the weights of the each band. The quadtree structure preseves the location information while significantly reducing the number of bits required to represent the locality of an image. To increase the efficienty of the wavelet transformed images using quadtree, the energy of the isolated coefficients is analyzed and those with low energy are eliminated. Furthermore, to control the bit rate the entropy of each block is sorted according to its energy concentration and the number of bits required for encoding, and the blocks with low energy are removed to achieve the desired compression rate.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.138-145
• /
• 1997

This paper proposes an adaptive algorithm for the quantization step size control of MPEG-2, using the information obtained from the previously encoded picture. Before quantizing the DCT coefficients, the properties of reconstruction error of each macro block (MB) is predicted from the previous frame. For the prediction of the error of current MB, a block with the size of MB in the previous frame are chosen by use of the motion vector. Since the original and reconstructed images of the previous frame are available in the encoder, we can calculate the reconstruction error of this block. This error is considered as the expected error of the current MB if it is quantized with the same step size and bit rate. Comparing the error of the MB with the average of overall MBs, if it is larger than the average, small step size is given for this MB, and vice versa. As a result, the error distribution of the MB is more concentrated to the average, giving low variance and improved image quality. Especially for the low bit application, the proposed algorithm gives much smaller error variance and higher PSNR compared to TM5 (test model 5).

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.501-504
• /
• 2003

In this out watermarking method, a key is determined by quantizing the maximum motion difference between frames. We have a problem the key value for embedding and detection are different in 1 to 3% frames of all frames. This problem can be easily solved by using a new key according to bit error rate of the extracted watermark. Since the watermark is embedded in each frame nth different keys and detected In all the frames, out method is resistant against attacks such as the frame averaging and frame drop.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.197-205
• /
• 2018

Nowadays, wireless sensor networks (WSNs) have been widely adopted in structural health monitoring (SHM) systems for social overhead capital (SOC) public infrastructures. Structural health information, environmental disturbances and sudden changes of weather conditions, damage detections, and external load quantizing are among the capabilities required of SHM systems. These information requires an efficient transmission with which an efficient mobility management support for wireless networks can provide. This paper deals with the analysis of mobility management schemes in order to address the real-time requirement of data traffic delivery for critical SHM information. The host-based and network-based mobility management protocols have been identified and the advantages of network mobility (NEMO) enabled Proxy Mobile Internet Protocol version 6 (PMIPv6) have been leveraged in order to address the SHM information transmission needs. The scheme allows an efficient information transmission as it improves the handover performance due to shortened handover latency as well as reduced signaling overhead.