• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.106-114
• /
• 2015

Despite a series of various developments in underwater acoustic sensor networks, there are still occasions of loss of connection over the network. Because sufficient amounts of drawbacks causing disconnections posed particularly in the middle of connection over the network emerge in the ocean environment, there is a need of new testing mechanism for underwater acoustic networks. In this paper, we proposed to investigate the most vital parts of the network deployment whether they function well in order, without any failure so as to identify where exactly communication process problems and failures are. We introduce step-wised out-test mechanism for UWASNS and accomplished the mechanism by implementing experiments and rigorously checked all the underwater devices utilizing out-test function. Experimental results and out-test function are evinced by implementing, in order to explain our system and conclude with possible future improvements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1797-1804
• /
• 2011

In this paper, I analyzed array organization of MIMO channel antenna and effect of operation environment by evaluating average BER from linear Space-Time Block Code orthogonal design and suggests designing condition of MT antenna for improved BER and the fading index m. To analyze system performance, I used M-PSK and M-QAM modulation, and to use analysis equations I used integrated by Nakagami fading variable, non-integrated Nakagami fading variable. We can get the organization of channel array by using mathematical calculation on matrix. STBE BER performance will decrease as AOA spreading decrease and such loss can be compensated from extending antenna spacing, and changing array organization.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.949-955
• /
• 2005

In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1629-1637
• /
• 2003

In this paper, we analyzed the performance of a hybird DS/SFH(Direct­Sequency­Slow Frequency­Hopping) Spread Spectrum system with BFSK modulation over Nakagami­m fading channel with multitone jamming. The performance of the system was improved when a frequency bowing rate increased. In case that process gain of hybrid DS/SFH Spread Spectrum system to be fixed, the hybrid DS/SFH Spread Spectrum takes the low bit error probability than a DS Spread Spectrum system. Also, when the fading index m increases, the fading effect decrease, when the JSR(jamming to signal power ratio) increases ,the performance of a hybrid DS/SFH Spread Spectrum system improved than DS Spread Spectrum system. The result, we have been proved that performance of a hybrid DS/SFH Spread Spectrum was superior to DS Spend Spectrum system over Nakagami­m fading with tome jamming.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1217-1230
• /
• 2010

The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1134-1141
• /
• 1999

In this paper, we implement an optical code division multiple access(OCDMA) system and analyze the performance of the implemented system. In the implemented system, a transmitter encodes input data into optical pulses by using laser diode, and spreads the encoded pulses in an encoder which consists of 4 stage delay lines. The decoder which is the same structure as that of encoder delays and combines the spreaded pulses, and thus recovers the original data. At first, we discuss the auto- and cross-correlations of OCDMA signals under both environments of single user and multi-users, and then verify the simulation results with experimental results. We also evaluate the effect of a number of stages of delay line and code length on the system performance through computer simulations. As experimental results we can see that if the decoder have the same configuration as that of encoder, the peak auto-correlation characteristics can be achieved, and thus we can recover the original data from received data. As simulation results we can see that although bit error rate decreases as code length decreases or the number of stage of delay line increases, it is difficult to implement the system because the pulse width becomes narrow. From the results, we can apply CDMA technologies to optical communication networks.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

Time series of conventional prediction techniques uses the model which is generated from the training step. This model is applied to new input data without any change. If this model is applied directly to stream data, the rate of prediction accuracy will be decreased. This paper proposes an stream data prediction technique using sliding window and regression. This technique considers the characteristic of time series which may be changed over time. It is composed of two steps. The first step executes a fractional process for applying input data to the regression model. The second step updates the model by using its information as new data. Additionally, the model is maintained by only recent data in a queue. This approach has the following two advantages. It maintains the minimum information of the model by using a matrix, so space complexity is reduced. Moreover, it prevents the increment of error rate by updating the model over time. Accuracy rate of the proposed method is measured by RME(Relative Mean Error) and RMSE(Root Mean Square Error). The results of stream data prediction experiment are performed by the proposed technique IMQR(Incremental Multiple Quadratic Regression) is more efficient than those of MLR(Multiple Linear Regression) and SVR(Support Vector Regression).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.59-67
• /
• 2006

OFDM (Orthogonal frequency Division Multiplexing) systems convert serial data stream to N parallel data streams and modulate them to N orthogonal subcarriers. Thus spectrum utilization efficiency of the OFDM systems are high and high-speed data transmission is possible. However, with the OFDM systems using the same modulation method at all subcarriers, the error probability is dominated by the subcarriers which experience deep fades. Therefore, in order to enhance the performance of the system adaptive modulation is required, with which the modulation methods of the subcarriers are determined according to the estimated SNRs. The IEEE 802.11a system selects various transmission speed between 6 and 54 Mbps according to the modulation mode. There are three typical methods for SNR estimation: Direct estimation method uses the frequency domain symbols to estimate SNR directly by minimizing MSE (Mean Square Error), EVM method utilizes the distance between the demodulated constellation points and received complex values, and the method utilizing the Viterbi algorithm uses the cumulative minimum distance in decoding process to estimate the SNR indirectly. Through comparison analyses of three methods we propose a new SNR estimation method, which employs both the EVM method and the Viterbi algorithm. Finally, we perform extensive computer simulations to confirm the performance improvement of the proposed adaptive OFDM systems on the basis of IEEE 802.11a.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.