• Journal of the Optical Society of Korea
• /
• v.12 no.4
• /
• pp.355-358
• /
• 2008

In the current GPON market and standard, the line bit rate requirement is changing from 1.25 Gbps to 2.5 Gbps. We fabricate a 2.5 Gbps burst-mode receiver with commercially available blocks and optimize it with an APD bias control. A burst-mode measurement setup is made for the full compliance test with the GPON standard. The device meets the partially defined 2.5 Gbps specs in the current ITU G.984.2 standard, also, supports 1.25 Gbps specs for the coexistence issue in an access network. The full-compliant measurement values can be used as a guideline for fixing "for further study" specs in the current GPON standard at 2.5 Gbps.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.296-300
• /
• 2000

In previous papers, it proved relevant to using together with EFCI and ER switch for effective ABR traffic managements. It also applied to EFCI and ER switch algorithm, that consider ABR traffic as poisson pattern. However, in recently network environment, it has been proved about traffic pattern, that is similar to self-similar pattern than poisson pattern. In this paper, we will compare previous poisson pattern with self-similar pattern under ATM network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.423-433
• /
• 2005

We present power(in frequency domain) and rate adaptation(in time domain) schemes in multicarrier (MC) direct-sequence code-division multiple-access(DS/CDMA) communications. Utilizing channel state information from the receiver, the adaptation schemes allocate power the user's sub-band with the largest channel gain. In the time domain, the transmission data rate is adapted for a desired transmission quality. In the case of single-user channels, a closed-form expression is derived for an optimal time domain power adaptation that minimizes the average bit error rate(BER). Channel inversion power adaptation is found to provide nearly optimal performance in this case, as the number of sub-bands or available average transmission power increase. Analysis and simulation results show the BER performance of the proposed power and rate adaptations with fixed average transmission power significantly improves the performance over the power allocation in the frequency domain only. Also, we compare the performance of the proposed power and rate adaptation schemes in MC-DS/CDMA systems with that of power and rate adapted single carrier DS/CDMA systems with RAKE receiver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.204-211
• /
• 2012

Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

• Archives of Plastic Surgery
• /
• v.39 no.3
• /
• pp.238-243
• /
• 2012

Background : The publication rate of presentations at medical international meetings has ranged from 11% to 78% with an average of 45%. To date, there are no studies about the final rate of publications at scientific meetings associated with plastic surgery from Korea. The present authors investigated the publication rate among the presentations at meetings associated with plastic surgery. Methods : The titles and authors of the abstracts from oral and poster presentations were collected from the program books of the Congress of the Korean Society of Plastic and Reconstructive Surgeons (CKSPRS) for 2005 to 2007 (58th-63rd). All of the abstracts presented were searched for using PubMed, KoreaMed, KMbase, and Google Scholar. The titles, key words from the titles, and the authors' names were then entered in database programs. The parameters reviewed included the publication rate, type of presentation including running time, affiliation, subspecialty, time to publication, and publication journal. Results : A total of 1,176 abstracts presented at the CKSPRS from 2005 to 2007 were evaluated. 38.7% of the abstracts, of which oral presentations accounted for 41.0% and poster presentations 34.8%, were published as full papers. The mean time to publication was 15.04 months. Among journals of publication, the Journal of the Korean Society of Plastic and Reconstructive Surgeons was most used. Conclusions : Brilliant ideas and innovative approaches are being discussed at CKSPRS. The 38.7% publication rate found from this research appeared a bit lower than the average rate of medical meetings. If these valuable presentations are not available as full papers, the research would be a waste of time and effort.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.805-814
• /
• 1994

In this paper, we introduce a new method which is available for analyzing the throughput of the packet radio network by using the auxiliary Markov transient matrix with a failure state and a success state. And we consider the effect of symbol error for the network state(X, R) consisted of the number of transmitting PRU X and receiving PRU R. We examine the packet radio network of a continuous time Markov chain model, and the direct sequence binary phase shift keying CDMA radio channel with hard decision Viterbi decoding and bit-by-bit changing spreading code. For the unslotted distributed multi-hop packet radio network, we assume that the packet error due to a symbol error of radio channel has Poisson process, and the time period of an error occurrence is exponentially distributed. Through the throughputs which are found as a function of radio channel parameters, such as the received signal to noise ratio and chips of spreading code per symbol, and of network parameters, such as the number of PRU and offered traffic rate, it is shown that this composite analysis enables us to combine the Markovian packet radio network model with a coded DS/BPSK CDMA radio channel.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.