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 :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 27, Issue 12C - Dec 2002
Volume 27, Issue 11C - Nov 2002
Volume 27, Issue 10C - Oct 2002
Volume 27, Issue 10A - Oct 2002
Volume 27, Issue 9C - Sep 2002
Volume 27, Issue 8C - Aug 2002
Volume 27, Issue 8B - Aug 2002
Volume 27, Issue 8A - Aug 2002
Volume 27, Issue 7C - Jul 2002
Volume 27, Issue 7B - Jul 2002
Volume 27, Issue 7A - Jul 2002
Volume 27, Issue 6C - Jun 2002
Volume 27, Issue 6B - Jun 2002
Volume 27, Issue 6A - Jun 2002
Volume 27, Issue 5C - May 2002
Volume 27, Issue 4C - Apr 2002
Volume 27, Issue 4B - Apr 2002
Volume 27, Issue 4A - Apr 2002
Volume 27, Issue 3C - Mar 2002
Volume 27, Issue 3B - Mar 2002
Volume 27, Issue 3A - Mar 2002
Volume 27, Issue 2B - Feb 2002
Volume 27, Issue 2A - Feb 2002
Volume 27, Issue 2C - Jan 2002
Volume 27, Issue 1C - Jan 2002
Volume 27, Issue 1B - Jan 2002
Volume 27, Issue 1A - Jan 2002
Volume 27, Issue 9 - 00 2002
Volume 27, Issue 8 - 00 2002
Volume 27, Issue 3 - 00 2002
Volume 27, Issue 12 - 00 2002
Volume 27, Issue 11 - 00 2002
Volume 27, Issue 10 - 00 2002
Selecting the target year
Design of an Area-Efficient Architecture for Block-wise MAP Turbo Decoder
Kang, Moon-Jun ; Kim, Sik ; Hwang, Sun-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 725~732
Block-wise MAP (Maximum A posteriori) decoding algorithm for turbo-codes requires less memory than Log-MAP decoding algorithm. The ER (Bit Error Rate) performance of previous block-wise MAP decoding algorithm depend on the block length and training length. To maximize hardware utilization and perform successive decoding, the block length is set to be equal to the training length in previous MAP decoding algorithms. Simulation result on the BER performance shows that the EBR performance can be maintained with shorter blocks when training length is sufficient. This paper proposes an architecture for area efficient block-wise MAP decoder. The proposed architecture employs the decoding schema for reducing memory by using the training length, which in N times larger than block length. To efficiently handle the proposed schema, a pipelined architecture is proposed. Simulation results show that memory usage can be reduced by 30%~45% in the proposed architecture without degrading the BER performance.
Analysis of Spreading code design for Zero Correlation Zone
Hou, Jia ; Park, Ju-Yong ; Hwang, Gi-Yean ; Lee, Moon-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 733~738
Zero Cross-correlation Zone (ZCZ) code has a good performance in Multi-user CDMA system to get low correlation zone and reject co-channel interference. In this paper, we do analysis of spreading code design to obtain this kind of property of correlations with a complex spreading scheme and denote their effective performance for mobile communication system. In addition, a Jacket polyphase sequence is an example to show the improved performance and regular properties effective performance for mobile communication system. In addition, a Jacket polyphase sequence is as an example to show the improved performance and regular properties.
Performance Analysis of the Channel Equalizers for Partial Response Channels
Lee, Sang-Kyung ; Lee, Jae-Chon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 739~752
Recently, to utilize the limited bandwidth effectively, the concept of partial response (PR) signaling has widely been adopted in both the high-speed data transmission and high-density digital recording/playback systems such as digital microwave, digital subscriber loops, hard disk drives, digital VCR's and digital versatile recordable disks and so on. This paper is concerned with adaptive equalization of partial response channels particularly for the magnetic recording channels. Specifically we study how the PR channel equalizers work for different choices of desired or reference signals used for adjusting the equalizer weights. In doing so, we consider three different configurations that are actually implemented in the commercial products mentioned above. First of all, we show how to compute the theoretical values of the optimum Wiener solutions derived by minimizing the mean-squared error (MSE) at the equalizer output. Noting that this equalizer MSE measure cannot be used to fairly compare the three configurations, we propose to use the data MSE that is computer just before the final detector for the underlying PR system. We also express the data MSE in terms of the channel impulse response values, source data power and additive noise power, thereby making it possible to compare the performance of the configurations under study. The results of extensive computer simulation indicate that our theoretical derivation is correct with high precision. Comparing the three configurations, it also turns out that one of the three configurations needs to be further improved in performance although it has an apparent advantage over the others in terms of memory size when implemented using RAM's for the decision feedback part.
Adaptive Blind MMSE Equalization for SIMO Channel
Ahn, Kyung-Seung ; Baik, Heung-Ki ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 753~762
Blind equalization of transmission channel is important in communication areas and signal processing applications because it does not need training sequences, nor dose it require a priori channel information. In this paper, an adaptive blind MMSE channel equalization technique based on second-order statistics in investigated. We present an adaptive blind MMSE channel equalization using multichannel linear prediction error method for estimating cross-correlation vector. They can be implemented as RLS or LMS algorithms to recursively update the cross-correlation vector. Once cross-correlation vector is available, it can be used for MMSE channel equalization. Unlike many known subspace methods, our proposed algorithms do not require channel order estimation. Therefore, our algorithms are robust to channel order mismatch. Performance of our algorithms and comparisons with existing algorithms are shown for real measured digital microwave channel.
Signal Processing Techniques for Recognition of CW Morse Signals
Son, Young-Chae ; Lim, Dong-Min ; Tae, Ki-Cheol ; Kim, Chung-Sub ; Hahm, Young-Kwon ; Kim, Chang-Joo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 763~770
Recognition of CW Morse signals can be divided into several phases such as detection of tones and spaces, signal processing for removing noise from detected signals, decision of tones/spaces, mapping a sequence of tones and spaces into characters, error correction of a character message with textual repetition. In this paper, in order to cope with signal fading effectively we propose a signal detection method of identifying peaks in the frequency domain and present techniques for combining multiple frequency peaks and for removing residual signal components and noise. LMS adaptive method is applied for decision of tones/spaces, and initial value setting and malfunctioning conditions are analyzed. In recognition experiments, we used CW Morse signals collected by radio receivers and found that the proposed method achieves good recognition performance even in severe fading conditions.
A Design of Symbol Timing Recovery for DVB-RCS
Mo, Kyoung-Ha ; Song, Hyoung-Kyu ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 771~778
We investigate the design of an interpolation filter of a MF-TDMA demodulator which is applied to DVB-RCS. If sampling is not synchronized to the data symbols, timing adjustment in digital receiver must be performed by interpolation. It is impossible that conventional sinc interpolation filter coefficients are actually extended to infinity. We propose a Kaiser window interpolation filter and a sinc interpolation filter using th Kaiser window. Simulation results show that the performance improvement is realized by employing the proposed interpolation filter.
3D Object Extraction Algorithm Based on Hierarchical Approach Using Reduced Windowed Fourier Phase
Min, Gak ; Han, Kyu-Phil ; Lee, Ky-Soo ; Ha, Yeong-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 779~785
This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the case of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational costs are very heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing the redundancy of phase calculations, is proposed in this pare. In addition, a structural matching algorithm on the phase domain is adopted to improve the matching quality. In experimental results, it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained.
Shot Boundary Detection of Video Sequence Using Hierarchical Hidden Markov Models
Park, Jong-Hyun ; Cho, Wan-Hyun ; Park, Soon-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 786~795
In this paper, we present a histogram and moment-based vidoe scencd change detection technique using hierarchical Hidden Markov Models(HMMs). The proposed method extracts histograms from a low-frequency subband and moments of edge components from high-frequency subbands of wavelet transformed images. Then each HMM is trained by using histogram difference and directional moment difference, respectively, extracted from manually labeled video. The video segmentation process consists of two steps. A histogram-based HMM is first used to segment the input video sequence into three categories: shot, cut, gradual scene changes. In the second stage, a moment-based HMM is used to further segment the gradual changes into a fade and a dissolve. The experimental results show that the proposed technique is more effective in partitioning video frames than the previous threshold-based methods.
A New Method of Fingerprint Image Processing Based on a Directional Filter Bank
Oh, Sang-Keun ; Lee, Joon-Jae ; Park, Kil-Houm ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 796~804
This paper presents a new algorithm of fingerprint image analysis and processing using directional filter bank(DFB). The directional components of ridge is very important in pre-processing steps of fingerprint image processing such as image enhancement by directional filtering followed by estimationg the directional image of ridge patterns. The DFB analyzes input image into directional subband images and synthesizes them to the perfectly reconstructed image. In this paper, a new fingerprint processing algorithm using the DFB is proposed. The algorithm decomposes the fingerprint image into directional subband images and performs directional map generation, foreground segmentation, singular points extraction and image enhancement based on local directional energy estimate.
The Geometric Layout Analysis of the Document Image Using Connected Components Method and Median Filter
Jang, Dae-Geun ; Hwang, Chan-Sik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 805~813
Document image should be classified into detailed regions as text, picture, table and etc through the geometric layout analysis if paper documents can be converted automatically into electronic documents. However, complexity of the document layout and variety of the size and density of a picture are the reason to make it difficult to analyze the geometric layout of the document images. In this paper, we propose the method which have a better performance of the region segmentation and classifications, and the line extraction in the table region than the commercial softwares and previous methods. The proposed method can segment the document into detailed regions by using connected components method even if its layout is complex. This method also classifies texts and pictures by using separable median filter even. Though their size and density are diverse, In addition, this method extracts the lines from the table adapting one dimensional median filter to the each horizontal and vertical direction, even though lines are deformed or texts attached to them.
Low Memory Zerotree Coding
Shin, Cheol ; Kim, Ho-Sik ; Yoo, Ji-Sang ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 814~821
The SPIHT(set partitioning in hierarchical tree) is efficient and well-known in the zerotree coding algorithm. However SPIHT's high memory requirement is a major difficulty for hardware implementation. In this paper we propose low-memory and fast zerotree algorithm. We present following three methods for reduced memory and fst coding speed. First, wavelet transform by lifting has a low memory requirement and reduced complexity than traditional filter bank implementation. The second method is to divide the wavelet coefficients into a block. Finally, we use NLS algorithm proposed by Wheeler and Pearlman in our codec. Performance of NLS is nearly same as SPIHT and reveals low and fixed memory and fast coding speed.
Information extraction of the moving objects based on edge detection and optical flow
Chang, Min-Hyuk ; Park, Jong-An ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 822~828
Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.
Design of Optimum Boundary Filter Bank for Sub-band Coder using M-band Orthogonal Wavelet Transform
Kwon, Sang-Keun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 829~835
When finite length image signal is decomposed into M-band synthesized using M-band orthogonal wavelet transform, the boundary signal of image are not reconstructed perfectly. for boundary signals to be reconstructed perfectly, different type filter bank or technique is applied to them when the dimension of analysed is proposed. It can be designed using the singular value decomposition of boundary perfect reconstruction matrix which is obtained from paraunitary matrix which is obtained from paraunitary matrix. And it is also discussed to design the boundary filter bank for improving the coding performance when it is applied to subband coder. The proposed boundary filter bank shows 7% gains in PSNR compared with reflected method.
Automatic Video Genre Classification Method in MPEG compressed domain
Kim, Tae-Hee ; Lee, Woong-Hee ; Jeong, Dong-Seok ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 8A, 2002, Pages 836~845
Video summary is one of the tools which can provide the fast and effective browsing for a lengthy video. Video summary consists of many key-frames that could be defined differently depending on the video genre it belongs to. Consequently, the video summary constructed by the uniform manner might lead into inadequate result. Therefore, identifying the video genre is the important first step in generating the meaningful video summary. We propose a new method that can classify the genre of the video data in MPEC compressed bit-stream domain. Since the proposed method operates directly on the compressed bit-stream without decoding the frame, it has merits such as simple calculation and short processing time. In the proposed method, only the visual information is utilized through the spatial-temporal analysis to classify the video genre. Experiments are done for 6 genres of video: Cartoon, commercial, Music Video, News, Sports, and Talk Show. Experimental result shows more than 90% of accuracy in genre classification for the well -structured video data such as Talk Show and Sports.