Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Volume & Issues
Volume 31, Issue 12C - Dec 2006
Volume 31, Issue 12B - Dec 2006
Volume 31, Issue 12A - Dec 2006
Volume 31, Issue 11C - Nov 2006
Volume 31, Issue 11B - Nov 2006
Volume 31, Issue 11A - Nov 2006
Volume 31, Issue 10C - Oct 2006
Volume 31, Issue 10B - Oct 2006
Volume 31, Issue 10A - Oct 2006
Volume 31, Issue 9C - Sep 2006
Volume 31, Issue 9B - Sep 2006
Volume 31, Issue 9A - Sep 2006
Volume 31, Issue 8C - Aug 2006
Volume 31, Issue 8B - Aug 2006
Volume 31, Issue 8A - Aug 2006
Volume 31, Issue 7C - Jul 2006
Volume 31, Issue 7B - Jul 2006
Volume 31, Issue 7A - Jul 2006
Volume 31, Issue 6C - Jun 2006
Volume 31, Issue 6B - Jun 2006
Volume 31, Issue 6A - Jun 2006
Volume 31, Issue 5C - May 2006
Volume 31, Issue 5B - May 2006
Volume 31, Issue 5A - May 2006
Volume 31, Issue 4C - Apr 2006
Volume 31, Issue 4B - Apr 2006
Volume 31, Issue 4A - Apr 2006
Volume 31, Issue 3C - Mar 2006
Volume 31, Issue 3B - Mar 2006
Volume 31, Issue 3A - Mar 2006
Volume 31, Issue 2C - Feb 2006
Volume 31, Issue 2B - Feb 2006
Volume 31, Issue 2A - Feb 2006
Volume 31, Issue 1C - Jan 2006
Volume 31, Issue 1B - Jan 2006
Volume 31, Issue 1A - Jan 2006
Selecting the target year
An Inter-provider Roaming Authentication and Key Establishment Protocol Providing Anonymity in IEEE 802.16e Networks
Park, Young-Man ; Park, Sang-Kyu ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1023~1029
In this Paper, we present a novel authentication and key exchange(AKE) protocol for inter-NSP(provider) roaming in IEEE 802.16e networks. The proposed protocol allows performing both user and device authentication jointly by using two different authentication credentials and Provides user anonymity and session key establishment. Also, this protocol requires only two round number message exchange between foreign network and home network.
Error Correction by Redundant Bits in Constant Amplitude Multi-code CDMA
Song, Hee-Keun ; Kim, Sung-Man ; Kim, Bum-Gon ; Kim, Tong-Sok ; Ko, Dae-Won ; Kim, Yong-Cheol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1030~1036
In this paper, we present two methods of correcting bit errors in constant amplitude multi-code (CAMC) CDMA, which uses the redundant bits only. The first method is a parity-based bit correction with hard-decision, where the received signals despread into n two-dimensional structure with both horizontal parity and vertical parity. Then, an erroneous bit is corrected for each
pattern. The second method is a turbo decoding, which is modified from the decoding of a single parity check product code (SPCPC). Experimental results show that, in the second method, the redundant bits in CAMC can be fully used for the error correction and so they are not really a loss of channel bandwidth. Hence, CAMC provides both a low peak-to-average power ratio and robustness to bit errors.
A Two-Dimensional Pseudo-balanced Code for Holographic Data Storage Systems
Kim, Na-Young ; Lee, Jae-Jin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1037~1043
In this paper, we introduce a two-dimensional modulation code for holographic data storage systems(HDSS), which is a candidate for the next generation data storage system. The two-dimensional(2D) intersymbol interference(ISI) induces higher bit error rate(BER). The balanced number of zeros(dark) and ones(light) in each page reduces inter-page interference(IPI). The code rate is 519. Although the proposed code has higher code rate than other 2D code with rate 4/9, the BER performances of two codes are similar.
Fault Diagnosis Using t/k-Diagnosable System in Hypercube Networks
Kim, Jang-Hwan ; Rhee, Chung-Sei ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1044~1051
System level diagnosis algorithms use the properties of t-diagnosable system where the maximum number of the faults does not exceed 1. The existing diagnosis algorithms have limit when dealing with large fault sets in large multiprocessor systems. Somani and Peleg proposed t/k-diagnosable system to diagnose more faults than t by allowing upper bounded few number of units to be diagnosed incorrectly. In this paper, we propose adaptive hypercube diagnosis algorithm using t/k-diagnosable system. When the number of faults exceeds t, we allow k faults to be diagnosed incorrectly. Simulation shows that the performance of the proposed algorithm is better than Feng's HADA algorithm. We propose new algorithm to reduce test rounds by analyzing the syndrome of RGC-ring obtained in the first step of HADA/IHADA method. The proposed algorithm also gives similar performance compared to HYP-DIAG algorithm.
Implementation of a PRML Detection for Asymmetric High-density Optical Storage System
Lee, Kyu-Suk ; Lee, Jae-Jin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1052~1057
The implement the adaptive partial response maximum likelihood (PRML) detector with tilt analyzer for asymmetric high-density optical storage system. For the estimation of disc tilt, we exploit spc patterns in each data frame. Because of using the ROM table to renew the coefficients of equalizer and reference values of branches, the complexity of the hardware is reduced. The proposed PRML has been designed and verified by VerilogHDL and synthesized by the Synopsys Design Compiler with Hynix
STD cell library. In the result, the total gate count is 35K, and the maximum operating frequency is 140MHz.
A New Coding Method for Improving the Performance of MPEG-4 Part 10 Video Coding Standard
Moon, Yong-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1058~1065
In this paper, we propose a new motion vector coding algorithm suitable for MPEG-4 Part 10 video coding standard. In the proposed algorithm, the amount of the motion for a given video sequence is Predicted by using a characteristic of the motion vector distribution for the neighboring blocks as well as the MB_type, which is the syntax element in the standard. And one of the independent coding and the combined coding methods is adaptively employed to compress the motion vector difference. Simulation results show that the proposed algorithm outperforms the conventional methods without additional memory and calculations.
Residual Filter to Improve Performance of H.264 Video Coding Standard
Song, Won-Seon ; Hong, Min-Cheol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1066~1070
In this paper, we present a residual filter to improve performance of H.264 compressed video. In general, noisy video sequences captured by imaging system result in decline of coding efficiency and unpleasant coding artifacts due to higher frequency components. By incorporating local statistics and quantization parameter into filtering process, the spurious noise is significantly attenuated and coding efficiency is improved, leading to improvement of visual quality and to bit-rate saving for given quantization step size. In addition, in order to reduce the complexity of the residual filter, noise induced by analyzing H.264 transformation and quantization processes are introduced. The simulation results show the capability of the proposed algorithm.
Face and Hand Tracking Algorithm for Sign Language Recognition
Park, Ho-Sik ; Bae, Cheol-Soo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1071~1076
In this paper, we develop face and hand tracking for sign language recognition system. The system is divided into two stages; the initial and tracking stages. In initial stage, we use the skin feature to localize face and hands of signer. The ellipse model on CbCr space is constructed and used to detect skin color. After the skin regions have been segmented, face and hand blobs are defined by using size and facial feature with the assumption that the movement of face is less than that of hands in this signing scenario. In tracking stage, the motion estimation is applied only hand blobs, in which first and second derivative are used to compute the position of prediction of hands. We observed that there are errors in the value of tracking position between two consecutive frames in which velocity has changed abruptly. To improve the tracking performance, our proposed algorithm compensates the error of tracking position by using adaptive search area to re-compute the hand blobs. The experimental results indicate that our proposed method is able to decrease the prediction error up to 96.87% with negligible increase in computational complexity of up to 4%.
A Fast Inter Prediction Encoding Technique for Real-time Compression of H.264/AVC
Kim, Young-Hyun ; Choi, Hyun-Jun ; Seo, Young-Ho ; Kim, Dong-Wook ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1077~1084
This paper proposed a fast algorithm to reduce the amount of calculation for inter prediction which takes a great deal of the operational time in H.264/AVC. This algorithm decides a search range according to the direction of predicted motion vector, and then performs an adaptive spiral search for the candidates with JM(Joint Model) FME(Fast Motion Estimation) which employs the rate-distortion optimization(RDO) method. Simultaneously, it decides a threshold cost value for each of the variable block sizes and performs the motion estimation for the variable search ranges with the threshold. These activities reduce the great amount of the complexity in inter prediction encoding. Experimental results by applying the proposed method .to various video sequences showed that the process time was decreased up to 80% comparing to the previous prediction methods. The degradation of video quality was only from 0.05dB to 0.19dB and the compression ratio decreased as small as 0.58% in average. Therefore, we are sure that the proposed method is an efficient method for the fast inter prediction.
Reduced RBF Centers Based Multiuser Detection in DS-CDMA System
Lee, Jung-Sik ; Hwang, Jae-Jeong ; Park, Chi-Yeon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1085~1091
The major goal of this paper is to develop a practically implemental radial basis function (RBF) neural network based multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work is expected to provide an efficient solution for RBF based MUD by quickly setting up the proper number of RBF centers and their locations required in training. The basic idea in this research is to estimate all the possible RBF centers by using supervised
clustering technique, and select the only centers which locate near seemingly decision boundary between centers, and reduce further by grouping the some of centers adjacent each other. Therefore, it reduces the computational burden for finding the proper number of RBF centers and their locations in the existing RBF based MUD, and ultimately, make its implementation practical.
Efficient Selection Methods of Transmit-Receive Antennas Based on Channel Capacity For MIMO Systems
Kim, Hyo-Shil ; Kim, Ryun-Woo ; Kim, Jong-Deuk ; Byun, Youn-Shik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1092~1099
Future wireless communication systems will employ spatial multiplexing with multiple antennas at both transmitter and receiver to take advantage of larger capacity gains as compared to the systems that use a single antenna. However, in order to reduce higher hardware costs and computational burden, it will require an efficient transmit-receive antenna selection algorithm, which we propose in this paper. Through simulation and comparative analysis of various existing methods and the one we propose in this paper, the algorithm we propose was validated as nearer to the optimal selection technique than existing nearly optimal antenna selection schemes.
An Efficient Adaptive Modulation and Coding Scheme on Downlink Rayleigh Fading Channels Considering Channel-State-Information Feedback Delay
Rhee, Du-Ho ; Hwang, Hae-Gwang ; Sang, Young-Jin ; Kim, Kwang-Soon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1100~1106
In downlink of mobile communication systems, the feedback delay between channel estimation and actual transmission causes inaccuracy in channel-state-information (CSI) and this results in performance degradation. In order to overcome this phenomenon, channel prediction is inevitable. In this paper, an adaptive transmission scheme based on channel prediction is proposed and its performance is evaluated. From simulation results, it is shown that the performance degradation due to the feedback delay is successfully mitigated by using the proposed scheme.
A New Fast Wavelet Transform Based Adaptive Algorithm for OFDM Adaptive Equalizer and its VHDL Implementation
Joung, Min-Soo ; Lee, Jae-Kyun ; Lee, Chae-Wook ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1107~1119
Data transmission experiences multiplicative distortion in frequency nonselective fading channel. This distortion occurs in OFDM communication channel and can be compensated using an equalizer. Usually, in the case of LMS equalizer, eigenvalue distribution of training signal is enlarged. Large eigenvalue distribution causes principally the performance of a communication system to be deteriorated. This paper proposes a new algorithm that shows the same performance as the existing fast wavelet transform algorithm with less computational complexity. The proposed algorithm was applied to an adaptive equalizer of OFDM communication system. Matlab simulation results show a better performance than the existing one. The proposed algorithm was implemented in VHDL and simulated.
Word Level Multiplier for
Using Gaussian Normal Basis
Kim, Chang-Hoon ; Kwon, Yun-Ki ; Kim, Tae-Ho ; Kwon, Soon-Hak ; Hong, Chun-Pyo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 11C, 2006, Pages 1120~1127
] for elliptic curve cryptosystem. The proposed multiplier uses Gaussian normal basis representation and produces multiplication results at a rate of one per [m/w] clock cycles, where w is the selected we.4 size. We implement the p.oposed design using Xilinx XC2V1000 FPGA device. Our design has significantly less critical path delay compared with previously proposed hard ware implementations.