• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.245-252
• /
• 2016

In this paper, the design of a double-dipole quasi-Yagi antenna (DDQYA) with a gain over 7 dBi at 1.70-2.70 GHz band is studied. The proposed DDQYA consists of two strip dipoles with different lengths and a ground reflector, which are connected trough a coplanar stripline. The length of the second dipole is adjusted to increase the gain in the low frequency band, whereas a rectangular patch director is appended to the DDQYA to enhance the gain in the middle and high frequency band. The effects of the length of the second dipole, and the length and width of the director on the antenna performance are analyzed, and final design parameters to obtain a gain over 7 dBi are obtained. A prototype of the proposed DDQYA is fabricated on an FR4 substrate, and the experimental results show that the antenna has a frequency band of 1.60-2.86 GHz for a VSWR < 2, and measured gain ranges 7.2-7.6 dBi at 1.70-2.70 GHz band.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.26-34
• /
• 2002

Mobile telecommunication systems such as IS-95 and IMT-2000 employ frame based communication using frames up to 20 msec in length and the receiving end has to store the whole frome before it is being processed. The size of the frame buffer ofter dominates those of the processing unit such as soft decision Viterbi decoder. The frame buffer for IMT-2000, for example, has to be increased 80 times as large as that of IS-95. One of the parameters deciding the number of bits in a frame will be obviously the number of bits in soft quantization. Start after striking space key 2 times. This paper has studied a new aspect of offset and quantization step size on BER performance and proposes a new 3-bit soft quantization algorithm which shows similar performance as that of 4-bit soft decision Viterbi receiver. The optimal offset values and step sizes for the other practical quantization levels ---16, 8, 4, 2--- have also been found. In addition, a new optimal symbol metric table has been devised which takes the accumulation value of various repeated signals and produces a rescaled 3-bit valu.tart after striking space key 2 times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.954-961
• /
• 2010

Stream cipher was worse than block cipher in terms of security, but faster in execution speed as an advantage. However, since so far there have been many algorithm researches about the execution speed of block cipher, these days, there is almost no difference between them in the execution speed of AES. Therefore an secure and fast stream cipher development is urgently needed. In this paper, we propose a 32bit output fast stream cipher, AA32, which is composed of ASR(Arithmetic Shifter Register) and simple logical operation. Proposed algorithm is a cipher algorithm which has been designed to be implemented by software easily. AA32 supports 128bit key and executes operations by word and byte unit. As Linear Feedback Sequencer, ASR 151bit is applied to AA32 and the reduction function is a very simple structure stream cipher, which consists of two major parts, using simple logical operations, instead of S-Box for a non-linear operation. The proposed stream cipher AA32 shows the result that it is faster than SSC2 and Salsa20 and satisfied with the security required for these days. Proposed cipher algorithm is a fast stream cipher algorithm which can be used in the field which requires wireless internet environment such as mobile phone system and real-time processing such as DRM(Digital Right Management) and limited computational environments such as WSN(Wireless Sensor Network).

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.1
• /
• pp.63-71
• /
• 2013

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other member nodes do because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exist problems that the cluster header has short average lifetime, and a new cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases the problem of re-electing the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header any more because the remaining energy level goes low, it sends a beacon message to neighbor member nodes, then the second header will serve as the cluster header.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.230-238
• /
• 2014

In this paper, we propose the possible way of accurate analysis and examination of ITO sensor to discriminate whether mutual capacitance ITO sensor is defective by using mutual capacitance of data in each node which consists of electrodes inside of ITO sensor. We have analyzed the structure characteristic of mutual capacitance ITO sensor which is used as an input device for not only small size electronics like mobile phone and tablets but also big size electronics and designed the circuit to inspect ITO sensor using touch screen panel IC. Set a variable related with mutual capacitance of charge and discharge and Implement to find and analyze accurate position when defect is made through the data from each node of ITO sensor. First, we can set a yield effective range through the first experiment data of mutual capacitance ITO sensor and by using the data of each node of ITO sensor which is the result from the second experiment, we can verify accuracy and effectiveness of effective range from the first experiment as a sample which is used in this experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.649-658
• /
• 2006

Recently, Software Development was applied to new-approach methods as a various form : client-server system and web-programing, object-orient concept, distributed development with a network environments. On the other hand, it be concerned about the distributed development technology and increasing of object-oriented methodology. These technology is spread out the software quality and improve of software production, reduction of the software develop working. Futures, we considered about the distributed software development technique with a many workstation. In this paper, we discussed optimal release problem based on a stochastic differential equation model for the distributed Software development environments. In the past, the software reliability applied to quality a rough guess with a software development process and approach by the estimation of reliability for a test progress. But, in this paper, we decided to optimal release times two method: first, SRGM with an error counting model in fault detection phase by NHPP. Second, fault detection is change of continuous random variable by SDE(stochastic differential equation). Here, we decide to optimal release time as a minimum cost form the detected failure data and debugging fault data during the system test phase and operational phase. Especially, we discussed to limitation of reliability considering of total software cost probability distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.341-350
• /
• 2003

In this paper, we evaluate the performance of a moving average (MA) channel estimation filter when space-time block coding transmit diversity (STBC-TD) is applied to the wideband direct sequence code division multiple access (WCDMA) forward link. And we present the infinite impulse response (IIR) filter scheme that can reduce the required memory buffer and the channel estimation delay time. This paper also compares the performance between MA filter scheme and IIR filter scheme in various Rayleigh fading channel environments through the bit error rate (BER) and the frame error rate (FER). Extensive computer simulation results show that transmission with STBC-TD provides a significant gain in performance over no transmit diversity technique, particularly at pedestrian speeds. If STBC-TD technique is employed in the channel estimator based on MA filter, it provides considerable performance gains against Rayleigh fading and reduces the optimum filter tap number. Consequently, the channel estimation delay time and the complexity of the receiver are reduced. In addition, the channel estimator based on IIR filter has the advantages such as little memory requirement and no delay time compared to the MA scheme. However, IIR filter coefficients is very sensitive to the mobile speed change and it exerts a serious influence upon the performance. For that reason, it is important to set uP the optimum IIR filter coefficients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1387-1394
• /
• 2004

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication systems. And it is well known about the fact that turbo code has better the BER performance as the number of decoding iterations increases in the AWGN channel environment. However, as the number of decoding iterations is increased under the several channel environments, any further iteration results in very little improvement, and it requires much delay, computation and power consumption in proportion to the number of decoding iterations. In this paper, it proposes the efficient iterative decoding stop criterion algorithm which can largely reduce the average number of decoding iterations of turbo code. Through simulations, it is verifying that the proposed algorithm can efficiently stop the iterative decoding by using the variance value of error probability for the soft output value, and can largely reduce the average number of decoding iterations without BER performance degradation. As a result of simulation, the average number of decoding iterations for the proposed algorithm is reduced by about 2.25% ~14.31％ and 3.79％ ~14.38% respectively compared to conventional schemes, and power consumption is saved in proportion to the number of decoding iterations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.894-900
• /
• 2004

There are many types of circularly polarized(CP) microstrip antenna elements, which are used as a good unit radiator. Since an advantage of CP antenna is no strict alignment requirements between Rx and Tx system, the printed antennas with circular polarization are very often used in numerous satellite and mobile radio systems. In order to realize the broad bandwidth of 3 dB axial ratio and impedance of CP microstrip antenna, complex feed structure and tri-plate patch element have been researched. This paper describes a design of wideband microstrip cross slot array antennas with circular polarization. The proposed antenna is composed of an open-ended microstrip feed line as a feeder and a cross slot as a radiator for circular polarization. To realize the wide bandwidth, tri-plate structure are considered and cross slot is electromagnetically coupled with feed line. Optimum parameters of 1-element cross slot antenna are analyzed and designed by method of moments. These parameters are also applied to may antennas design considered the mutual coupling between radiating elements. Right hand circular polarization(RHCP) and left hand circular polarization(LHCP) of the proposed antenna are easily controlled by asymmetrical cross slot structure and slot position. In 1-element and 15-element cross slot array antenna, the good axial ratio of 1 dB below and the broad bandwidth characteristics of antenna are obtained.