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 29, Issue 12C - Dec 2004
Volume 29, Issue 12B - Dec 2004
Volume 29, Issue 12A - Dec 2004
Volume 29, Issue 11C - Nov 2004
Volume 29, Issue 11B - Nov 2004
Volume 29, Issue 11A - Nov 2004
Volume 29, Issue 10C - Oct 2004
Volume 29, Issue 10B - Oct 2004
Volume 29, Issue 10A - Oct 2004
Volume 29, Issue 9C - Sep 2004
Volume 29, Issue 9B - Sep 2004
Volume 29, Issue 9A - Sep 2004
Volume 29, Issue 8C - Aug 2004
Volume 29, Issue 8B - Aug 2004
Volume 29, Issue 8A - Aug 2004
Volume 29, Issue 7C - Jul 2004
Volume 29, Issue 7B - Jul 2004
Volume 29, Issue 7A - Jul 2004
Volume 29, Issue 6C - Jun 2004
Volume 29, Issue 6B - Jun 2004
Volume 29, Issue 6A - Jun 2004
Volume 29, Issue 5C - May 2004
Volume 29, Issue 5B - May 2004
Volume 29, Issue 5A - May 2004
Volume 29, Issue 4C - Apr 2004
Volume 29, Issue 4B - Apr 2004
Volume 29, Issue 4A - Apr 2004
Volume 29, Issue 3C - Mar 2004
Volume 29, Issue 3B - Mar 2004
Volume 29, Issue 3A - Mar 2004
Volume 29, Issue 2C - Feb 2004
Volume 29, Issue 2B - Feb 2004
Volume 29, Issue 2A - Feb 2004
Volume 29, Issue 1C - Jan 2004
Volume 29, Issue 1B - Jan 2004
Volume 29, Issue 1A - Jan 2004
Selecting the target year
The Direct Sequence Spread Spectrum Signal Detection Using The Triple Correlation Estimator Value
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1025~1033
This paper covers the detection of covert direct sequence spread spectrum signal without the PN(Pseudo Noise) code information. Due to its low probability of interception, the difficulty of spectrum surveillance increases. Detection parameters are the signal existence of given bandwidth, the length of spreading sequence used by transmitter, and the identification of spreading code for detected chip length. The triple correlation function(TCF) value which is one of the higher order statistical signal processing techniques can be used to detect spread spectrum signal without a prior knowledge, but, it has weakness that TCF results depend on the spread data sequence in actual application. This paper proposes the new scheme that not only overcomes the weakness but also presents better performance than the traditional TCF scheme. The performance comparison of conventional TCF with proposed technique shows that the triple correlation estimator(TCE) has better detection capability.
Rate 13/15 MTR code with j=2 constraint for high-density magnetic recording
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1034~1039
Since the major reason of the detection failure is from the consecutive data transitions, it is desirable to limit the MTR(maximum transition run) within two. Therefore, we propose a new MTR code that limits the MTR constraint to 2 and k-constraint to 8. In addition, DC-free coding is performed to overcome the media noise that exits in low frequency of perpendicular recording system. We use a GS (Guided Scrambling) for DC-free coding, and the performance of the code is compared with that of the rate 819 code used in the conventional recording channel by a computer simulation.
An Enhanced BLAST-OFDM System With Spatial Diversity and interleaved Frequency Diversity
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1040~1046
The BLAST-OFDM system is an efficient method for high data rate multimedia transmission in futurewireless communication system. In this paper, a linear preceding mechanism and an efficient antenna-subcarrier assignment algorithm are proposed for the conventional BLAST-OFDM system, in order to utilize the full spatial diversity and the interleaved frequency diversity. By computer simulation, the proposed system has proved to achieve 4-5㏈ gain over the conventional BLAST-OFDM system.
Design of Systolic Multipliers in GF(2
) Using an Irreducible All One Polynomial
Gwon, Sun Hak ; Kim, Chang Hun ; Hong, Chun Pyo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1047~1054
In this paper, we present two systolic arrays for computing multiplications in CF(2
m/) generated by an irreducible all one polynomial (AOP). The proposed two systolic mays have parallel-in parallel-out structure. The first systolic multiplier has area complexity of O(㎡) and time complexity of O(1). In other words, the multiplier consists of m(m+1)/2 identical cells and produces multiplication results at a rate of one every 1 clock cycle, after an initial delay of m/2+1 cycles. Compared with the previously proposed related multiplier using AOP, our design has 12 percent reduced hardware complexity and 50 percent reduced computation delay time. The other systolic multiplier, designed for cryptographic applications, has area complexity of O(m) and time complexity of O(m), i.e., it is composed of m+1 identical cells and produces multiplication results at a rate of one every m/2+1 clock cycles. Compared with other linear systolic multipliers, we find that our design has at least 43 percent reduced hardware complexity, 83 percent reduced computation delay time, and has twice higher throughput rate Furthermore, since the proposed two architectures have a high regularity and modularity, they are well suited to VLSI implementations. Therefore, when the proposed architectures are used for GF(2
m/) applications, one can achieve maximum throughput performance with least hardware requirements.
An Efficient Dynamic Entropy Coding by using Multiple Codeword in H.264/AVC
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1055~1061
In this paper, we propose an efficient dynamic coding scheme by using multiple codewords in H.264/AVC entropy coding. The exponential Golomb (Exp-Golomb) codewords used in H.264/AVC do not reflect enough the symbol distributions of the combined syntax element in (7) due to their static probability distribution characteristics. However, the multiple codewords in this paper have different statistical characteristics. we propose a dynamic coding scheme by using selectively among multiple codewords to encode the combined syntax element according to given image sequences. Simulation results show that our proposed scheme outperforms the existing (7) method in compression efficiency without loss of quality.
New Gray Level Corner Point Detection Method
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1062~1068
In this paper, we introduce a new gray level comer detection method to recognize corner points accurately. The new corner detector divides the corner region into many homocentric circles according to the window size, and calculates the corner response and angle of corner area about each layer to get an accurate corner point. The new corner detector has a hierarchical structure so it can detect corner point more quickly than general gray level corner detector
A New Type of Complementary Code Keying Orthogonal frequency Division Multiplexing (CCK-OFDM) Wireless LAN Modem
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1069~1075
In this paper, we show the equivalence between complementary code keying (CCK) codeword and coset of the first order Reed-Muller (RM) code with variables of three. The CCK codewords are Golay sequences which have peak-to-average power ratio (PAPR) of two at most and can correct one error. We propose a CCK-orthogonal frequency division multiplexing (OFDM) modem to reduce PAPR. Also, we present the performance improvement techniques by increasing the variables of four to correct three errors and reduce PAPR at least 9㏈ with this system. Although, two Fast Hadamard Transform (FHT) blocks of size 8 64 are required at the receiver, we reduce the complexity by using FHT blocks of size 8 64 and 2 4 without deteriorating the performance. We generalize our results that we may increase the variables of RM code to enhance the error correcting and PAPR reduction capabilities without increasing receiver's complexity.
An Extended Role-based Access Control Model with Privacy Enforcement
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1076~1085
Privacy enforcement has been one of the most important problems in IT area. Privacy protection can be achieved by enforcing privacy policies within an organization's data processing systems. Traditional security models are more or less inappropriate for enforcing basic privacy requirements, such as privacy binding. This paper proposes an extended role-based access control (RBAC) model for enforcing privacy policies within an organization. For providing privacy protection and context based access control, this model combines RBAC, Domain-Type Enforcement, and privacy policies Privacy policies are to assign privacy levels to user roles according to their tasks and to assign data privacy levels to data according to consented consumer privacy preferences recorded as data usage policies. For application of this model, small hospital model is considered.
On the Application and Optimization of M-ary Transmission Techniques to Optical CDMA LANs
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1086~1103
Most research efforts on the OCDMA technology assume single-bit-per-symbol transmission techniques such as on-off keying. However, achieving high spectral efficiency with such transmission techniques is likely to be a challenging task due to the "unipolar" nature of optical signals. In this paper, an M-ary transmission technique using more than two equally-weighted codes is proposed for OCDMA local area networks, and ie BER performance and spectral efficiency are analyzed. Poison frame arrival and randomly generated codes are assumed for the BER analysis, and the probability of incorrect symbol detection is analytically derived. From the approximation, it is found that there exists an optimal code weight that minimizes the BER, and its physical interpretation is drawn in an intuitive and simple statement. Under the assumption of this optimized code weight and sufficiently large code dimension, it is also shown that the spectral efficiency of OCDMA networks can be significantly improved by increasing the number (M) of symbols used. Since the cost of OCDMA transceivers is expected to increase with the code dimension, we finally provide a guideline to determine the optimal number of symbols for a given code dimension and traffic load.
Vibration Measurements of Large-Scale Structure Using Laser and High-Speed CCD Camera
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1104~1112
In this paper, we establish measurement methods of vibration frequency for three-dimensional behavior measurement of large-scale structure using laser and high-speed CCD camera. We project the diode laser having a smaller fluctuation on the object plane attached to the structure and measure the displacement of the structure using a precise relative measurement algorithm. When we use high-speed(120 frames/sec) CCD camera, we can measure the vibration frequency having the uncertainty within 0.5% by taking FFT on the displacement, from 0Hz to 40Hz. And we also confirm the reliability and economical string of the suggested measurement method of vibration frequency of the structure by showing the accuracy of displacement measurement using laser is comparable to that of relative positioning methods using GPS.
FPGA-based One-Chip Architecture and Design of Real-time Video CODEC with Embedded Blind Watermarking
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1113~1124
In this paper, we proposed a hardware(H/W) structure which can compress and recontruct the input image in real time operation and implemented it into a FPGA platform using VHDL(VHSIC Hardware Description Language). All the image processing element to process both compression and reconstruction in a FPGA were considered each of them was mapped into H/W with the efficient structure for FPGA. We used the DWT(discrete wavelet transform) which transforms the data from spatial domain to the frequency domain, because use considered the motion JPEG2000 as the application. The implemented H/W is separated to both the data path part and the control part. The data path part consisted of the image processing blocks and the data processing blocks. The image processing blocks consisted of the DWT Kernel fur the filtering by DWT, Quantizer/Huffman Encoder, Inverse Adder/Buffer for adding the low frequency coefficient to the high frequency one in the inverse DWT operation, and Huffman Decoder. Also there existed the interface blocks for communicating with the external application environments and the timing blocks for buffering between the internal blocks The global operations of the designed H/W are the image compression and the reconstruction, and it is operated by the unit of a field synchronized with the A/D converter. The implemented H/W used the 69%(16980) LAB(Logic Array Block) and 9%(28352) ESB(Embedded System Block) in the APEX20KC EP20K600CB652-7 FPGA chip of ALTERA, and stably operated in the 70MHz clock frequency. So we verified the real time operation of 60 fields/sec(30 frames/sec).
Adaptive Error Detection Using Causal Block Boundary Matching in Block-Coded Video
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1125~1132
In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10
, it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.
A Semantic-based Video Retrieval System using Method of Automatic Annotation Update and Multi-Partition Color Histogram
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1133~1141
In order to process video data effectively, it is required that the content information of video data is loaded in database and semantic-based retrieval method can be available for various query of users. In this paper, we propose semantic-based video retrieval system which support semantic retrieval of various users by feature-based retrieval and annotation-based retrieval of massive video data. By user's fundamental query and selection of image for key frame that extracted from query, the agent gives the detail shape for annotation of extracted key frame. Also, key frame selected by user become query image and searches the most similar key frame through feature based retrieval method that propose. From experiment, the designed and implemented system showed high precision ratio in performance assessment more than 90 percents.
Improvement of front-back sound localization characteristics in headphone-based 3D sound generation
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1142~1148
A binaural filtering method using HRTF DB is generally used to make the headphone-based 3D sound. But it can make some confusion between front and back directions or between up and down directions due to the non-individual HRTF depending on each listener. To reduce the confusion of sound image localization, we propose a new method to boost the spectral cue by modifying HRTF spectra with spectrum difference between front and back directions. Informal listening tests show that the proposed method improves the front-back sound localization characteristics much better than the conventional methods
A Study on Fuzzy Rule Functional Verification for Threshold Value Prediction of Buffer in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1149~1158
In this thesis, we created a Fuzzy rule in a Fuzzy logic that are Fuzzy logic which is composed of linguistic rules and Fuzzy inference engine for effective traffic control in ATM networks. The parameters of the Fuzzy rules are adapted to minimize the given performance index in both cases. In other words, the difuzzification value controls the threshold in the buffer to arrival ratio to traffic priority (low or high) using fuzzy set theory for traffic connected after reasoning. Also, show experiment result about rule by MATLAB6.5 and on-line bulid-up to verify validity of created Fuzzy rule. As a result, we can verify that threshold value in buffer is efficiently controlled by the traffic arrival ratio.
Region Analysis of Business Card Images Acquired in PDA Using DCT and Information Pixel Density
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1159~1174
In this paper, we present an efficient algorithm for region analysis of business card images acquired in a PDA by using DCT and information pixel density. The proposed method consists of three parts: region segmentation, information region classification, and text region classification. In the region segmentation, an input business card image is partitioned into 8 f8 blocks and the blocks are classified into information and background blocks using the normalized DCT energy in their low frequency bands. The input image is then segmented into information and background regions by region labeling on the classified blocks. In the information region classification, each information region is classified into picture region or text region by using a ratio of the DCT energy of horizontal and vertical edge components to that in low frequency band and a density of information pixels, that are black pixels in its binarized region. In the text region classification, each text region is classified into large character region or small character region by using the density of information pixels and an averaged horizontal and vertical run-lengths of information pixels. Experimental results show that the proposed method yields good performance of region segmentation, information region classification, and text region classification for test images of several types of business cards acquired by a PDA under various surrounding conditions. In addition, the error rates of the proposed region segmentation are about 2.2-10.1% lower than those of the conventional region segmentation methods. It is also shown that the error rates of the proposed information region classification is about 1.7% lower than that of the conventional information region classification method.
Tracking of Moving Object in MPEG Compressed Domain Using Mean-Shift Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1175~1183
This paper propose a method to trace a moving object based on the information directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors involved in compressed video and then we calculate the amount of pan, tilt, zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. The moving object is designated initially by a user via bounding box. After then automatic tracking is performed based on the mean-shift algorithm of the motion flows of the object. The proposed method can improve the computation speed because the information is directly obtained from the MPEG-2 compressed video, but the object boundary is limited by blocks rather than pixels.
Real-Time Pupil Detection System Using PC Camera
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1184~1192
A real-time pupil detection system that detects the pupil movement from the real-time video data achieved by the visual light camera for general purpose personal computer is proposed. It is implemented with three steps; at first, face region is detected using the Haar-like feature detection scheme, and then eye region is detected within the face region using the template-based scheme. Finally, pupil movement is detected within the eye region by convolution of the horizontal and vertical histogram profiling and Gaussian filter. As results, we obtained more than 90% of the detection rate from 2375 simulation images and the data processing time is about 160㎳, that detects 7 times per second.
Scene change detection using visual rhythm by direction
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1193~1202
While the management of digital contents is getting more and more important, many researchers have studied about scene change detection algorithms to reduce similar scenes in the video contents and to efficiently summarize video data. The algorithms using histogram and pixel information are found out as being sensitive to light changes and motion. Therefore, visual rhythm gets used in recent work to solve this problem, which shows some characteristics of scenes and requires even less computational power. In this paper, a new scene detection algorithm using visual rhythm by direction is proposed. The proposed algorithm needs less computational power and is able to keep good performance even in the scenes with motion. Experimental results show the performance improvement of about 30% comparing with conventional methods with histogram. They also show that the proposed algorithm is able to keep the same performance even to music video contents with lots of motion.
WPKI Certificate Verification Using Observer
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1203~1209
A huge growth the wireless internet services, which are based on the wireless mobile network technology and internet technology, poses demand for the end-to-end secure connections. Restrictions of wireless mobile environment and mobile devices make difficult to adapt present secure protocols to wireless internet services. In this paper, we analyze existing certificate status verification methods in WPKI and propose a new method, adding a observer information in handshake protocol. The method with observer makes it more efficient for relying parties to verify both the current status of the X.509 certificate and the short-lived WTLS server certificate.
On a High-speed Implementation of LILI-II Stream Cipher
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 8C, 2004, Pages 1210~1217
LILI-II stream cipher is an upgraded version of the LILI-128, one of candidates in NESSIE. Since the algorithm is a clock-controlled, the speed of the keystream data is degraded structurally in a clock-synchronized hardware logic design. Accordingly, this paper proposes a 4-bit parallel LFSR, where each register bit includes four variable data routines for feedback or shifting within the LFSR. furthermore, the timing of the proposed design is simulated using a Max+plus II from the ALTERA Co., the logic circuit is implemented for an FPGA device (EPF10K20RC240-3), and apply to the Lucent ASIC device (LV160C, 0.13
CMOS ＆ 1.5v technology), and it could achieve a throughput of about 500 Mbps with a 0.13
semiconductor for the maximum path delay below 1.8㎱. Finally, we propose the m-parallel implementation of LILI-II, throughput with 4, 8 or 16 Gbps (m=8, 16 or 32).