• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.1-11
• /
• 1998

We present somple block methods for blind maximal ratio combining (MRC) based on a maximum likelihood (ML) principle and finite alphabet properties (FAP) inherent in digital communication systems. The methods can provide accurate estimates of channel parameters even with a small subset of data, thus realizing nearly perfect combining. The channel parameters of diversity branches and the data sequence are estimated simultaneously by using an alternating projection technique. Two different methods, that is, (1) Joint combining and data sequence estimation(JC-DSE) method and (2) Pre-combining and blind phase estimation (PC-BPE) method are presented. Efficient initiallization schemes that can assure the convergence to the global optimum are also presented. Simulation results demonstrate the performance of two methods on the symbol error rate (SER) and the estimated accuracy of the channel parameters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.8
• /
• pp.24-31
• /
• 2010

A receiver architecture with low complexity for chirp spread spectrum (CSS) of IEEE 802.15.4a is proposed. To demodulate the received signal at the highest signal to noise power ratio, matched filter is generally adopted for the receiver of wireless communication systems. It is, however, not resonable to adjust the matched filter to the receiver of CSS whose objectives are low complexity, low cost and low power consumption since complexity of the matched filter is high. In this paper, we propose a new receiver architecture using differential multiplication and accumulator not matched filter for demodulation. Also, bi-orthogonal decoder implemented by only adder/subtractor is proposed. The hardware resources for implementation are reduced in the proposed receiver architecture, although bit error rate performance is low compared with the receiver architecture based on the matched filter.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.246-256
• /
• 2004

In this paper, we proposed a new lossless image compression algorithm. Lossless image compression has been used in the field that requires the accuracy and precision. Thus, application areas using medical unaging, prepress unaging, image archival systems, precious artworks to be preserved, and remotely sensed images require lossless compression. The compression ratio from lossless image compression has not been satisfactory, thus far. So, new method of lossless image compression has been investigated to get better compression efficiency. We have compared the compression results with the most typical compression methods such as CALIC and JPEG-LS. CALIC has shown the best compression-ratio among the existing lossless coding methods at the cost of the extensive complexity by three pass algorithm. On the other hand, JPEG-LS's compression-ratio is not higher than CALIC, but was adopted as an international standard of ISO because of the low complexity and fast coding process. In the proposed method, we adopted an adaptive predictor that can exploit the characteristics of individual images, and an adaptive arithmetic coding with multiple probability models. As a result, the proposed algorithm showed 5％ improvement in compression efficiency in comparison with JPEG-LS and showed comparable compression ratio with CALIC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.531-538
• /
• 1998

In this paper the system performance degradation resulting from nonlinear transmitter power amplifier which is essential to increase the efficiency is analysed in a CDMA system. The power amplifier is modeled by its AM-AM, AM-PM characteristics. The effects of power amplifier's nonlinearity such as intersymbol interference, phase distonion on the RF system performance were visualized by examining the distorted time domain waveforms, signal vector constellation. And through the investigation of the power spectrum density of the transmitted signal, spectral regrowth or sideband regrowth which is result from amplitude distortion can be seen. All these characteristics result in BER performance degradation due to other user interferences and intersymbol interference. The analysis technique described here applies not only to power amplifier but also to any other nonlinear components such as mixers and switches. Also the effects of adjacent channel interference and supurious emission can be analysed between different systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2647-2654
• /
• 2011

In this paper, the algorithm that recognizes the gesture by configuring the feature information obtained through edge orientation histogram and principal component analysis as low dimensional gesture symbol was described. Since the proposed method doesn't require a lot of computations compared to the existing geometric feature based method or appearance based methods and it can maintain high recognition rate by using the minimum information, it is very well suited for real-time system establishment. In addition, to reduce incorrect recognition or recognition errors that occur during gesture recognition, the model feature values projected in the gesture space is configured as a particular status symbol through clustering algorithm to be used as input symbol of hidden Markov models. By doing so, any input gesture will be recognized as the corresponding gesture model with highest probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.914-920
• /
• 2006

In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, $2^n$-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n - l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.1
• /
• pp.66-75
• /
• 2002

For the theoretical performance analysis of Viterbi Decoder for wireless LAN with data rate 12Mbps, code rate 1/2 and constraint length 7 defined in IEEE 802.11a, the transfer function is derived using Cramer's rule and the first-event error probability and bit error probability is derived under the AWGN. In the design process, input symbol is quantized into 16 steps for 4 bit soft decision and register exchange method instead of memory method is proposed for trace back, which enables the majority at the final decision stage. In the implementation, the Viterbi decoder based on parallel architecture with pipelined scheme for processing 12Mbps high speed data rate and AWGN generator are implemented using FPGA chips. And then its performance is verified in real time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2121-2128
• /
• 2012

This paper proposed the real time face area detection using Wavelet transform and the strong detection algorithm that satisfies the efficiency of computation and detection performance at the same time was proposed. The detected face image recognizes the face by configuring the low-dimensional face symbol through the principal component analysis. The proposed method is well suited for real-time system construction because it doesn't require a lot of computation compared to the existing geometric feature-based method or appearance-based method and it can maintain high recognition rate using the minimum amount of information. In addition, in order to reduce the wrong recognition or recognition error occurred during face recognition, the input symbol of Hidden Markov Model is used by configuring the feature values projected to the unique space as a certain symbol through clustering algorithm. By doing so, any input face will be recognized as a face model that has the highest probability. As a result of experiment, when comparing the existing method Euclidean and Mahananobis, the proposed method showed superior recognition performance in incorrect matching or matching error.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.4
• /
• pp.145-154
• /
• 2008

In this paper, we propose the pet robot control system using hand gesture recognition in image sequences acquired from a camera affixed to the pet robot. The proposed system consists of 4 steps; hand detection, feature extraction, gesture recognition and robot control. The hand region is first detected from the input images using the skin color model in HSI color space and connected component analysis. Next, the hand shape and motion features from the image sequences are extracted. Then we consider the hand shape for classification of meaning gestures. Thereafter the hand gesture is recognized by using HMMs (hidden markov models) which have the input as the quantized symbol sequence by the hand motion. Finally the pet robot is controlled by a order corresponding to the recognized hand gesture. We defined four commands of sit down, stand up, lie flat and shake hands for control of pet robot. And we show that user is able to control of pet robot through proposed system in the experiment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.9
• /
• pp.10-16
• /
• 2011

Interleaving is applied to prevent from exceeding the error-correction capability of channel code. At the receiver, burst errors are converted into random errors after deinterleaving, so the error-correction capability of channel code is not exceeded. However, when a receiver does not have any information on parameters used at an interleaver, interleaving can be seen as an encryption with some pattern. In this case, deinterleaving becomes complicated. In the field of blind deinterleaving, there have recently been a number of researches using linearity of linear block code. In spite of those researches, since the linearity is not applicable to a convolutional code, it is difficult to estimate parameters as in a linear block code. In this paper, we propose a method of blind block deinterleaving using convolutional code reconstruction method.