• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제40권6호
• /
• pp.20-30
• /
• 2003

In a conventional method based on quadrature 2D Gator wavelets to extract iris features, the iris recognition is performed by a 256-byte iris code, which is computed by applying the Gabor wavelets to a given area of the iris. However, there is a code redundancy because the iris code is generated by basis functions without considering the characteristics of the iris texture. Therefore, the size of the iris code is increased unnecessarily. In this paper, we propose a new feature extraction algorithm based on the ICA (Independent Component Analysis) for a compact iris code. We implemented the ICA to generate optimal basis functions which could represent iris signals efficiently. In practice the coefficients of the ICA expansions are used as feature vectors. Then iris feature vectors are encoded into the iris code for storing and comparing an individual's iris patterns. Additionally, we introduce two methods to enhance the recognition performance of the ICA. The first is to reorganize the ICA bases and the second is to use a different ICA bases set. Experimental results show that our proposed method has a similar EER (Equal Error Rate) as a conventional method based on the Gator wavelets, and the iris code size of our proposed methods is four times smaller than that of the Gabor wavelets.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Publications of The Korean Astronomical Society
• /
• 제12권1호
• /
• pp.185-196
• /
• 1997

We present a code which identifies individual clouds in crowded region using IMFORT interface within Image Reduction and Analysis Facility (IRAF). We define a cloud as an object composed of all pixels in longitude, latitude, and velocity that are simply connected and that lie above some threshold temperature. The code searches the whole pixels of the data cube in efficient way to isolate individual clouds. Along with identification of clouds it is designed to estimate their mean values of longitudes, latitudes, and velocities. In addition, a function of generating individual images (or cube data) of identified clouds is added up. We also present identified individual clouds using a $^{12}CO$ survey data cube of Galactic Anticenter Region (Lee et al. 1997) as a test example. We used a threshold temperature of $5\sigma$ rms noise level of the data With a higher threshold temperature, we isolated subclouds of a huge cloud identified originally. As the most important parameter to identify clouds is the threshold value, its effect to the size and velocity dispersion is discussed rigorously.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2010년 춘계학술대회논문집
• /
• pp.5-9
• /
• 2010

A numerical wind tunnel simulation is performed in order to predict wind loads acting on a building. The aim of the present study is to suggest a guideline for the numerical wind tunnel analysis, which could provide more detail wind load distributions compared to the wind code and expensive wind tunnel experiments. To validate the present numerical simulation, wind-induced loads on a 6 m cube model is predicted. Atmospheric boundary layer is used as a inlet boundary condition. Various effect of numerical methods are investigated such as size of computational domain, grid density, turbulence model and discretization scheme. The appropriate procedure for the numerical wind tunnel analysis is suggested through the present study.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• 제26권1호
• /
• pp.38-41
• /
• 2014

Fixture units and the diversity curve are used, in order to determine the required size of water supply pipe. However, the values of the National Plumbing Code, International Plumbing Code and National Standard Plumbing Code of America are not the same. The objective of this study is to comparatively analyze the fixture units and the peak flows of a 10th story office building, at any instant of time, according to the three codes.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1915-1919
• /
• 2003

A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

• Journal of The Korea Institute of Healthcare Architecture
• /
• 제11권3호
• /
• pp.41-49
• /
• 2005

The purpose of this study is to analysis of convenience facilities for disabled in the municipal buildings. The physically disabled based on comparative analysis of disabilities code in Korea. For this objective, the code and guideline were analysed, and based on the analysis the checklist was developed for field observation. Convenience facilities ought to consider various aspects like size, and spatial composition of facilities, safety factors. and the present conveniences facility regulation. The research was conducted for municipal buildings located in Jeonbuk province. The procedures for research was made to investigate the finding of architectural related code and faculty standards. The results of investigation should be complemented and clarified guidelines in terms of accessibility and convenience which in detail. If the disabled would be convenient to use municipal buildings facilities, there should be no difficulties. As a result, convenience facilities for disabled in the municipal buildings has been improved that the design concept for the disabled person in general architectural planning.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.2269-2270
• /
• 2008

Zigbee that is the wireless personal area networks communication technology for low power consumption is low-cost, low-power consumption, and small size and program code. From the present paper symbol and chip sequence of existing Zigbee module undergarment PN code generators which are a 1:1 mapping method it uses shift register and it plans the method which it proposes. The experimental result used Xilinx ISE and it measured synthesis and timing and power.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제19권11호
• /
• pp.2637-2642
• /
• 2015

The low-density parity check(LDPC) code is being widely used due to its outperformed error-correction ability. The decoder of the quasi-cyclic LDPC(QC-LDPC) codes, a kind of LDPC codes, requires a multi-size cyclic shifter(MSCS) performing rotation of various sizes. The MSCS can be implemented with a Benes network, which requires a $3{\times}3$ switch if the number of data to be rotated is a multiple of 3. This paper proposes a control signal generation with lower complexity and a faster $3{\times}3$ switch. For the experiment, the proposed schemes are applied to the MSCS of an IEEE 802.16e WiMAX QC-LDPC code decoder. The result shows that the delay is reduced by about 8.7%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제10권5호
• /
• pp.910-920
• /
• 2006

We consider the problem of estimating a code-timing of DS-CDMA signal in antenna array systems in the presence of flat fading channels and near-far environments. We derive an approximate maximum likelihood algorithm of estimating the code-timing of a desired user for DS-CDMA systems to better utilize the time-varying characteristics of the fading process. In the development of code timing estimator, the given observation bits are divided into many sets of sub-windows with each sufficiently large. The proposed method uses sub-windows with equal size associated with the coherence time of channel fading. The alternative approach is that without the estimation of the fading rate, the sufficiently given observation bits are simply separated into two consecutive sets of sub-windows. The derivation of the proposed algorithms is based on multiple antennas partially correlated in space. The impacts of spatial fading correlation on acquisition and men acquisition time performance of the proposed algorithms are also examined.