• Journal of Satellite, Information and Communications
• /
• v.4 no.2
• /
• pp.39-45
• /
• 2009

This paper proposes the specific code synchronization technique for DS-SS(Direct Sequence-Spread Spectrum transmission in the DVB-RCS +M standard. DS-SS is better than multi-carrier transmission method under nonlinear channel but imposes a long acquisition time. To improve the synchronization aspect, the robust correlation structure is introduced for acquisition and the nonlinear delay lock loop is done for tracking. MAT(Mean Acquisition Time) performances is shown to validate its superiority. In addition, code tracking and jitter performances are done when code tracking algorithm based on 2 oversamples which is not influenced by sampling clock timing offset and carrier freq. offset is used.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.427-431
• /
• 2010

Multidimensional scaling (MDS) is a widely used method for dimensionality reduction, of which purpose is to represent high-dimensional data in a low-dimensional space while preserving distances among objects as much as possible. MDS has mainly been applied to data visualization and feature selection. Among various MDS methods, the classical MDS is not readily applicable to data which has large numbers of objects, on normal desktop computers due to its computational complexity. More precisely, it needs to solve eigenpair problems on dissimilarity matrices based on Euclidean distance. Thus, running time and required memory of the classical MDS highly increase as n (the number of objects) grows up, restricting its use in large-scale domains. In this paper, we propose an efficient approximation algorithm for the classical MDS based on divide-and-conquer and CUDA. Through a set of experiments, we show that our approach is highly efficient and effective for analysis and visualization of data consisting of several thousands of objects.

• Journal of Korea Water Resources Association
• /
• v.30 no.2
• /
• pp.143-154
• /
• 1997

A numerical model for solving advection-diffusion equation is presented by splitoperator method combining the Holly-Preissmann scheme with a fifth-degree interpolating polynomial for advection operator and the explicit scheme porposed by Hobson et al. for diffusion operator. To examine the developed model, the obtained numerical solutions are compared with both the analytic solution and those from the existing models for the instantaneous source (Gaussian hill) and the continuous source (advanced front) at upstream boundary with constant velocity and diffusivity condition. For the various cases having different Courant and Peclet numbers, it is shown that the present study provides stable solutions even for Courant numbers exceeding one. The result obtained by the present study also agree well with existing analytical solutions for both cases. The proposed explicit scheme somewhat releases the conventional restriction of explicit schemes for determining the time step size and provides satisfactory results for relatively large time step size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.50-57
• /
• 2009

Tag collection is one of the major functions in RFID systems. In this paper, we propose a multichannel slotted-aloha anticollision protocol to mitigate the tag collision problem and improve tag collection performance in active RFID systems. In the proposed anticollision protocol, while an RFID reader transmits commands to multiple RFID tags via a common channel, it receives multiple tag responses over multiple channels simultaneously. We also implemented an active RFID system supporting the proposed anticollision protocol. In experiments with the implemented reader and 60 tags, the proposed dual-channel slotted-aloha anticollision protocol showed a large improvement in tag collection performance compared with the single-channel slotted-aloha anticollision protocol. With 60 tags, the average time spent on tag collection using the dual-channel anticollision protocol was 600.543 ms, which was 46.3% of the 1289.721 ms required using the single-channel anticollision protocol.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.8
• /
• pp.348-358
• /
• 2020

The purpose of this study was to examine the effects of auricular acupressure in patients with type 2 diabetes mellitus. Data collection was conducted from March 16 to May 11, 2018. A total of 44 participants with type 2 diabetes were recruited from welfare facilities. Participants in the experimental group (n=22) and placebo control group (n=22) received auricular acupressure on diabetes-related points (shenmen, pancreas, appetite control point, thirst point, and master endocrine point) and diabetes-unrelated points. The intervention was implemented on 5 consecutive days per week for a total of 6 weeks. To examine the effects of treatment, postprandial glucose, glycated hemoglobin, and blood lipid levels were evaluated. Postprandial glucose levels in the experimental group exhibited significant reduction over time compared to those in the placebo control group (p=.030). Glycated hemoglobin levels in the experimental group decreased significantly (t=-2.44, p=.024). However, there were no significant differences in blood lipid levels between the two groups. This study demonstrates that auricular acupressure on diabetes-related points for 6 weeks was highly effective in decreasing blood glucose levels in patients with type 2 diabetes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1452-1460
• /
• 2000

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.17-28
• /
• 2009

There are many limitations in dealing with rapidly changing traffic demand in urban cities. Thus recently, traffic operation and management skills are more emphasized rather than the expansion of traffic facilities. In particular, in the interrupted flow formed by signalized intersections, it is quite important to give optimal signal timing to each intersection with consideration of progression. However, as fixed signal times per direction can affect passing capacity in signalized intersections, the present four-signal phase including a left-turn signal has many limitations, including reduction of directional road capacity when traffic demand is increases dramatically during peak hours. Because of this problem, lots of studies about internal metering techniques for oversaturated signal control skills have progressed but these techniques are not used widely due to the absence of detectors for queue sensing in real-time signal control systems. In this research, a new methodology called the "restrictive left-turn signal control", which is already used at the intersection above Samsung subway station, is suggested in order to reduce control delay of urban arterial roads. The restrictive left-turn signal control allows a driver to make a U-turn and then a right turn instead of turning left in that intersection. With this change, the restrictive left-turn signal control can contribute to increased intersection capacity by reducing the number of signal phases and maximizing the through phase time. However, road structure and traffic conditions at the target intersections should be considered before the adoption of the proposed signal control.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.9
• /
• pp.1-6
• /
• 2010

H.264 video coding standard is widely used due to the high compression rate and quality. H.264 decoders usually have pipeline architecture by a macroblock or a $4{\times}4$ sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and the requirement of high data bandwidth and high performance processing units. We propose adaptive pipeline architecture for H.264 decoders for efficient decoding and lower the requirement of the bandwidth for the memory bus. Parameters and coefficients are delivered using hand-shaking communication through dedicated interconnections and frame pixel data are transferred using AMBA AHB network. The processing time of each block is variable depending on the characteristics of images, and the processing units start to work whenever they are ready. An H.264 decoder is designed and implemented using the proposed architecture to verify the operation using an FPGA.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.3
• /
• pp.71-80
• /
• 2021

The selection of an appropriate neural network algorithm is an important step for accurate data prediction in machine learning. Many algorithms based on basic artificial neural networks have been devised to efficiently predict future data. These networks include deep neural networks (DNNs), recurrent neural networks (RNNs), long short-term memory (LSTM) networks, and gated recurrent unit (GRU) neural networks. Developers face difficulties when choosing among these networks because sufficient information on their performance is unavailable. To alleviate this difficulty, we evaluated the performance of each algorithm by comparing their errors and processing times. Each neural network model was trained using a tax dataset, and the trained model was used for data prediction to compare accuracies among the various algorithms. Furthermore, the effects of activation functions and various optimizers on the performance of the models were analyzed The experimental results show that the GRU and LSTM algorithms yields the lowest prediction error with an average RMSE of 0.12 and an average R2 score of 0.78 and 0.75 respectively, and the basic DNN model achieves the lowest processing time but highest average RMSE of 0.163. Furthermore, the Adam optimizer yields the best performance (with DNN, GRU, and LSTM) in terms of error and the worst performance in terms of processing time. The findings of this study are thus expected to be useful for scientists and developers.