• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.11
• /
• pp.1311-1317
• /
• 2010

In this paper, for a uplink space division multiple access system named cooperative spatial multiplexing(CSM), radio resource management(RRM) algorithms are proposed based on sharing uplink channel information among a serving base station(BS) and interfering BSs in a uplink coordinated wireless communication system. A constrained maximum transmit power algorithm is proposed for mobile station(MS) to limit uplink inter-cell interference(ICI). And joint scheduling algorithm among coordinated BSs is proposed to enhance uplink capacity through ICI mitigation by using channel information from interfering BSs. It is shown that the proposed RRM algorithm provides a considerable uplink capacity enhancement by effective ICI mitigation only with moderate complexity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.102-108
• /
• 2012

The paper proposes an algorithm which finds a nonlinear cut path for a printed grayscale touching character image. The conventional algorithms were observed to fail in situations of complicated touching. We analyzed those situations, and based on the analysis results we identified problematic issues of the conventional algorithms. We modified the conventional algorithms in two aspects. First we propose a new penalizing term which is probable to guide correctly the cut path for touching situations difficult to separate. Second the preposed algorithm adopts a strategy of producing both the downward and upward paths and selecting better one. The experimental results on actual touching character images showed that the proposed algorithm was superior th conventional algorithms by 3~4% in terms of success ratio of separation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.39-44
• /
• 2006

Ship's collision avoidance is a skill that masters of merchant marine vessels have acquired through years of experience and that makes them feel at ease to guide their ship out from danger quickly compared to inexperienced officers. Case based reasoning(CBR) uses the same technique in solving tasks that needs reference from variety of situations. CBR can render decision-making easier by retrieving past solutions from situations that are similar to the one at hand and make necessary adjustments in order to adapt them. In this paper, we propose to utilize the advantages of CBR in a support system for ship's collision avoidance while using fuzzy algorithm for its retrieval of similar navigational situations, stored in the casebase, thus avoiding the cumbersome tasks of creating a new solution each time a new situation is encountered. There will be two levels within the Fuzzy-CBR. The first level will identify the dangerous ships and index the new case. The second level will retrieve cases from casebase and adapt the solution to solve for the output. While CBR's accuracy depends on the efficient retrieval of possible solutions to be adapted from stored cases, fuzzy algorithm will improve the effectiveness of solving the similarity to a new case at hand.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.451-458
• /
• 2006

In this paper, we propose a novel scheduling algorithm for downlink transmission which utilizes scarce wireless resource efficiently in an Orthogonal Frequency Division Multiple Access/Time Division Duplex system. Scheduling schemes which exploit channel information between a Base Station and terminals have been proposed recently for improved performance. Time series analysis is used to estimate the channel state of mobile terminals. The predicted information is then used for prioritized scheduling of downlink transmissions for improved throughput, delay and jitter performance. Through simulation, we show that the total throughput and mean delay of the proposed scheduling algorithm are improved compared with those of the Proportional Fairness and Maximum Carrier to Interference Ratio schemes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.57-67
• /
• 2005

Fast scalar multiplication of points on elliptic curve is important for elliptic curve cryptography applications. In order to vary field sizes depending on security situations, the cryptography coprocessors should support variable length finite field arithmetic units. To determine the effective variable length finite field arithmetic architecture, two well-known curve scalar multiplication algorithms were implemented on FPGA. The affine coordinates algorithm must use a hardware division unit, but the projective coordinates algorithm only uses a fast multiplication unit. The former algorithm needs the division hardware. The latter only requires a multiplication hardware, but it need more space to store intermediate results. To make the division unit versatile, we need to add a feedback signal line at every bit position. We proposed a method to mitigate this problem. For multiplication in projective coordinates implementation, we use a widely used digit serial multiplication hardware, which is simpler to be made versatile. We experimented with our implemented ECC coprocessors using variable length finite field arithmetic unit which has the maximum field size 256. On the clock speed 40 MHz, the scalar multiplication time is 6.0 msec for affine implementation while it is 1.15 msec for projective implementation. As a result of the study, we found that the projective coordinates algorithm which does not use the division hardware was faster than the affine coordinate algorithm. In addition, the memory implementation effectiveness relative to logic implementation will have a large influence on the implementation space requirements of the two algorithms.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.89-92
• /
• 2001

This paper had been analyzed a triangle setup in 3-D graphics and the necessity of high throughput division unit. And then this paper had been designed a pipelined division unit modifying series expansion algorithm and checked the error and performance of the designed division unit.

• Proceedings of The Korean Society of Agricultural and Forest Meteorology Conference
• /
• 2019.08a
• /
• pp.289-289
• /
• 2019

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• Clinical and Experimental Pediatrics
• /
• v.64 no.2
• /
• pp.80-85
• /
• 2021

Background: Although identifying cases in large administrative databases may aid future research studies, previous reports demonstrated that the use of the International Classification of Diseases, Tenth Revision (ICD-10) code alone for diagnosis leads to disease misclassification. Purpose: We aimed to assess the value of the ICD-10 diagnostic code for identifying potential children with biliary atresia. Methods: Patients aged <18 years assigned the ICD-10 code of biliary atresia (Q44.2) between January 1996 and December 2016 at a quaternary care teaching hospital were identified. We also reviewed patients with other diagnoses of code-defined cirrhosis to identify more potential cases of biliary atresia. A proposed diagnostic algorithm was used to define ICD-10 code accuracy, sensitivity, and specificity. Results: We reviewed the medical records of 155 patients with ICD-10 code Q44.2 and 69 patients with other codes for biliary cirrhosis (K74.4, K74.5, K74.6). The accuracy for identifying definite/probable/possible biliary atresia cases was 80%, while the sensitivity was 88% (95% confidence interval [CI], 82%-93%). Three independent predictors were associated with algorithm-defined definite/probable/possible cases of biliary atresia: ICD-10 code Q44.2 (odds ratio [OR], 2.90; 95% CI, 1.09-7.71), history of pale stool (OR, 2.78; 95% CI, 1.18-6.60), and a presumed diagnosis of biliary atresia prior to referral to our hospital (OR, 17.49; 95% CI, 7.01-43.64). A significant interaction was noted between ICD-10 code Q44.2 and a history of pale stool (P<0.05). The area under the curve was 0.87 (95% CI, 0.84-0.89). Conclusion: ICD-10 code Q44.2 has an acceptable value for diagnosing biliary atresia. Incorporating clinical data improves the case identification. The use of this proposed diagnostic algorithm to examine data from administrative databases may facilitate appropriate health care allocation and aid future research investigations.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.177-184
• /
• 2020

In this paper, we studied to direction of arrival (DoA) estimation to use DoA and optimum weight algorithms in coherent interference channels. The DoA algorithm have been considerable attention in signal processing with coherent signals and a limited number of snapshots in a noise and an interference environment. This paper is a proposed method for the desired signal estimation using MUSIC algorithm and adaptive beamforming to compare classical subspace techniques. Also, the proposed method is combined the updated weight value with LCMV beamforming algorithm in adaptive antenna array system for direction of arrival estimation of desired signal. The proposed algorithm can be used with combination to MUSIC algorithm, linearly constrained minimum variance beamforming (LCMV) and the weight value method to accurately desired signal estimation. Through simulation, we compare the proposed method with classical direction of in order to desired signals estimation. We show that the propose method has achieved good resolution performance better that classical direction arrival estimation algorithm. The simulation results show the effectiveness of the proposed method.