• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1253-1261
• /
• 1996

The base station (BS) of CDMA mobile system (CMS) provides mobile call services by controlling call processing functions. The call Processing part of the BS is divided into two components; the base station transceiver subsystem (BTS) and the base station controller (BSC). In this paper, we present the call capacity estimation of the BS about control signals and traffic data of calls by the simulation, and find the bottleneck points and problems which may occur in the BS. In order to estimate the call capacity, first we extract the major parameters for the modeling the BS. Second, we suggest the simulation model for the BS. Third, we estimate the simulation results by finding major objective factors such that the call blocking probability, the utilization ratio and the delay time in the traffic channel elements (TCEs), the BTS interconnection network (BIN)-COMA interconnection network (CIN) trunks, the transcoding channels and the CIN packet router.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.469-476
• /
• 2001

As the service of information through web system increases in modern society, many questions and consultations are going on through Home page and E-mail in the hospital. But there are some burdens for the management and postponements for answering the questions. In this paper, we investigate the document classification methods as a primary research of the auto-answering system. On the basis of 1200 documents which are questions of patients, 66% are used for the learning documents and 34% for test documents. All of are also used for the document classification using NBC (Naive Bayes Classifier), common words and coefficient of correlation. As the result of the experiments, the two methods proposed in this paper, that is, common words and coefficient of correlation are higher as much as 3% and 5% respectively than the basic NBC methods. This result shows that the correlation between indexes and categories is more effective than the word frequency in the document classification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.411-421
• /
• 2002

In this paper, we present a new survivor path memory management method and a dedicated hardware architecture for the design of high-speed Viterbi decoders in modern digital communication systems. In the proposed method, a novel use of k-starting node number deciding circuits enables to acheive the immediate traceback of the merged survivor path from which we can decode output bits, and results in smaller survivor path memory size and processing delay time than the previously known methods. Also, in the proposed method, the survivor path memory can be constructed with ease using a simple standard dual-ported memory since one read-pointer and one write-pointer, that are updated at the same rate, are required for managing the survivor path: the previously known algorithms require either complex k-ported memory structure or k-times faster read capability than write. With a moderate hardware cost for immediate traceback capability the proposed method is superior to the previously known methods for high-speed Viterbi decoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.411-423
• /
• 2004

This paper defines test methodologies and performance indices for SIP server system, and describes elements that can have influence on the test of SIP network equipments. Moreover, we implement a tester to evaluate the performance of SIP Servers such as Registrar and Proxy server. The performance indices for testing SIP servers are message processing rate, transaction delay, and call success probability. The parameters that can have an effect on the performance of SIP servers are user population, transport protocol, method of database access, method of DNS, call creation pattern, definition of transactions, and size of packets. We tested several SIP servers that act as Registrar, Proxy, and Redirect server using the implemented SIP tester, and, as a result, verified functions of the tester and performance indices and input parameters defined in this paper. Performance indices and methodologies presented in this paper can be used to evaluate SIP servers in NGN

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.272-278
• /
• 2004

The EPON has been actively studied as one of the access networks for the economic configuration of FTTH. The EPON must support the dynamic bandwidth allocation to the subscribers in order to support the QoS due to its base on Ethernet technology. EFM SG, which is actively working for the standardization of EPON, also recently decided to select DBA. Therefore in this paper, we designed a ONU buffer scheduling algorithm (AIWFQ) and a scheme of DBA(Class-based FCFS) for the OLT suitable for embodying MPCP of the EPON. In this paper, we proposed methods that the EPON system can make use of by measuring end to end process delay time and the buffer size in order to implement the algorithm by using the OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.14-21
• /
• 2011

Cryptographic protocols based on bilinear pairings provide excellent alternatives to conventional elliptic curve cryptosystems based on discrete logarithm problems. Through active research has been done toward fast computation of the bilinear pairings, it is still believed that the computational cost of one pairing computation is heavier than the cost of one ECC scalar multiplication. However, there have been many progresses in pairing computations over binary fields. In this paper, we compare the cost of BLS signature scheme with ECDSA with equvalent level of security parameters. Analysis shows that the cost of the pairing computation is quite comparable to the cost of ECC scalar multiplication for the case of binary fields.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.811-823
• /
• 2011

This paper proposes an efficient transmission method for the panoramic multimedia contents. The panoramic video provides wide sight and various view-point to the user. The traditional methods of the panoramic multimedia content transmission has several limitations, as follow; A client suffers a long initial delay time to play a panoramic video when it is transmitted through a limited bandwidth network, because the panoramic video has larger data size than a general video. And if a client's display device has limited resolution, such as mobile phone, laptop PC monitor, etc. it can not display the entire panoramic video that has a wide view video sequence. So, in order to overcome the obstacles, this paper proposes an efficient transmission of panoramic multimedia contents. This method will increase the transmission efficiency throughout the technique of the scene description in MPEG-4 system. Also we demonstrated the efficiency of the proposed method by comparison with existing methods.

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

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.32-39
• /
• 2009

In this thesis, design effective elimination interference algorithm of ICS repeat system for repeater that improve frequency efficiency. Gennerally, LMS Algorithm apply to ICS repeat system. Error convergence speed and accuracy of LMS Algorithm are influenced by reference signal. For improve LMS Algorithm, suggest Adaptive searching channel estimate algorithm. For using channel characteristic, adaptive searching channel estimate algorithm make reference signal similar interference signal by convolution operation and complement LMS algorithm demerit. For make channel similar pratical channel, apply Jake's Rayleigh multi-path model. LMS algorithm and suggested adaptive searching channel estimate algorithm that have 16 taps apply to ICS repeat system under Rayleigh multi-path channel, so simulate with MATLAB. According to simulate, ICS repeat system with LMS algorithm show -40 dB mean square error convergent after 110 datas iteration and ICS repeat system with adaptive searching channel estimate algorithm show -80 dB mean square en-or convergent after 120 datas iteration. Analyze simulation result, suggested adaptive searching channel estimate algorithm show 40 dB accuracy than LMS algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.430-435
• /
• 2018

In this paper, an improved decoding scheme for low-complexity parity-check(LCPC) code with small code length is proposed. The LCPC code is less complex than the turbo code or low density parity check(LDPC) code and requires less memory, making it suitable for communication between internet-of-things(IoT) devices. The IoT devices are required to have low complexity due to limited energy and have a low end-to-end delay time. In addition, since the packet length to be transmitted is small and the signal processing capability of the IoT terminal is small, the LCPC coding system should be as simple as possible. The LCPC code can correct all single errors and correct some of the two errors. In this paper, the proposed decoding scheme improves the bit error rate(BER) performance without increasing the complexity by correcting both errors using the soft value of the modulator output stage. As a result of the simulation using the proposed decoding scheme, the code gain of about 1.1 [dB] was obtained at the bit error rate of $10^{-5}$ compared with the existing decoding method.