• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1131-1138
• /
• 2004

In Hierarchical Mobile Ipv6 (HMIPv6) networks, the mobility anchor point (MAP) handles binding update (BU) procedures locally to reduce signaling overhead for mobility. However, as the number of mobile nodes (MNs) handled by the MAP increases, the MAP suffers from the overhead not only to handle signaling traffic but also to Process data tunneling traffic. Therefore, it is important to control the number of MNs serviced by the MAP, in order to mitigate the burden of the MAP. We propose an adaptive load control scheme, which consists of two sub-algorithms: threshold-based admission control algorithm and session-to-mobility ratio (SMR) based replacement algorithm. When the number of MNs at a MAP reaches to the full capacity, the MAP replaces an existing MN at the MAP, whose SMR is high, with an MN that just requests binding update. The replaced MN is redirected to its home agent. We analyze the proposed load control scheme using the .Markov chain model in terms of the new MN and the ongoing MN blocking probabilities. Numerical results indicate that the above probabilities are lowered significantly compared to the threshold-based admission control alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.33-43
• /
• 2010

Recently, users want to use real-time multimedia services, such as internet, VoIP, etc., using their IEEE 802.11 wireless lan mobile stations. In order to provide such services, a handoff among access points is essential to support the mobility of a node, in such an wide area. However, the legacy handoff methods of IEEE 802.11 technology are easy to lose connections. Also, the recognition of a disconnection and channel re-searching time make the major delay of the next AP to connect. In addition, because IEEE 802.11 decides the selection of an AP depending only on received signal strength, regardless of a node direction, position, etc., it cannot guarantee a stable bandwidth for communication. Therefore, in order to provide a real-time multimedia service, a node must reduce the disconnection time and needs an appropriate algorithm to support a sufficient communication bandwidth. In this paper, we suggest an algorithm which predicts a handoff point of a moving node by using GPS location information, and guarantees a high transmission bandwidth according to the signal strength and the distance. We implemented the suggested algorithm, and confirmed the superiority of our algorithm by reducing around 3.7ms of the layer-2 disconnection time, and guaranteed 24.8% of the communication bandwidth.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.143-149
• /
• 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 increased 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 sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.11
• /
• pp.14-23
• /
• 2002

Two implementation methods for SOVA (Soft Output Viterbi Algorithm)of Turbo decoder are applied and verfied. The first method is the combination of a trace back (TB) logic for the survivor state and a double trace back logic for the weight value in two-step SOVA. This architecure of two-setp SOVA decoder allows important savings in area and high-speed processing compared with that of one-step SOVA decoding using register exchange (RE) or trace-back (TB) method. Second method is adjusting the reliability value with a scaling factor between 0.25 and 0.33 in order to compensate for the distortion for a rate 1/3 and 8-state SOVA decoder with a 256-bit frame size. The proposed schemes contributed to higher SNR performance by 2dB at the BER 10E-4 than that of SOVA decoder without a scaling factor. In order to verify the suggested schemes, the SOVA decoder is testd using Xillinx XCV 1000E FPGA, which runs at 33.6MHz of the maximum speed with 845 latencies and it features 175K gates in the case of 256-bit frame size.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.1-9
• /
• 2007

For an efficient implementation of cryptosystems based on arithmetic in a finite field $GF(2^n)$, their hardware implementation is an important research topic. To construct a multiplier with low area complexity, the divide-and-conquer technique such as the original Karatsuba-Ofman method and multi-segment Karatsuba methods is a useful method. Leone proposed an efficient parallel multiplier with low area complexity, and Ernst at al. proposed a multiplier of a multi-segment Karatsuba method. In [1], the authors proposed new $MSK_5$ and $MSK_7$ methods with low area complexity to improve Ernst's method. In [3], the authors proposed a method which combines $MSK_2$ and $MSK_3$. In this paper we propose an efficient multiplication method by combining $MSK_2,\;MSK_3\;and\;MSK_5$ together. The proposed method reduces $116{\cdot}3^l$ gates and $2T_X$ time delay compared with Gather's method at the degree $25{\cdot}2^l-2^l with l>0.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.619-630
• /
• 2003

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short, HFSM-SDF model. In reconfigurable SoC design with HFSM-SDF model, the problem of configuration scheduling becomes challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex control flow (HFSM), and complex schedules of SDF actor firing. This makes it hard to hide configuration latency efficiently with compile-time static configuration scheduling. To resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configurations, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before executing the state transition of top FSM. After obtaining the order information and storing it in the ready configuration queue (ready CQ), we execute the state transition. During the execution, whenever there is FPGA resource available, a new configuration is selected from the ready CQ and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder and IS95 design and obtained up to 21.8% improvement in system runtime with a negligible overhead of memory usage.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.4
• /
• pp.289-296
• /
• 2014

The rebar detailing is an important work influencing the final performance and quality of RC structures. But it is one of the most irrational and illogical activity in construction site. Many groups of workers, including main contractors, structural engineers, shop drawers, rebar fabricators, and etc., participate in this activity. A loosely-organized process for this activity is apt to produce a big amount of rebar loss or even degraded structures. A 3-dimensional rebar auto-placing system, called as Rebar Hub, has been designed and implemented in this research. Rebar Hub provides a totally integrated service from 3D structural modeling of buildings to rebar auto-placing considering anchorage, splice, and the length of ordered rebar. In addition, Rebar Hub can recognize the 2D drawing CAD files and then build 3D structural models which are used for the start point of 3D rebar auto-placing. After rebar auto-placing, each members of the 3D structural model have rebar information belonging to them. It means that the rebar information can be used for the afterward works such as quantity-survey, manufacturing and fabrication of rebars. Rebar Hub is showing outstanding performance while applying to practical projects. It has almost five times productivity and reduces the rebar loss up to 3~8% of the initially-surveyed amount of rebar.

• Proceedings of the Korean Society of Postharvest Science and Technology of Agricultural Products Conference
• /
• 2002.08a
• /
• pp.13-31
• /
• 2002

쌀은 중국에서 중요한 식량작물로 제9차 5개년 계획(1966-2000년) 동안 재배면적 31.4백만 ha이며 생산량은 단위 ha당 6,303kg으로 198백만톤에 이르며 이는 재배면적으로는 식량작물의 27.7%, 그리고 생산량으로는 전체식량작물의 40%를 각각 점하고 있다. 이러한 재배면적과 생산량은 각각 세계전체면적과 생산량의 20.7%와 33.7%를 차지하는 많은 량이다. 중국의 남부지역은 전지역의 73.5%가 이모작으로 재배되며 주품종은 Indica이다. 중국의 중부지역은 이모작과 일모작의 재배형태가 2:3으로 공존하고 있으며 양쯔강 이북은 주로 일모작의 형태이다. 중국의 쌀 재배면적은 1960년대 이후 점차 증가하다가 1980년대 후반으로 정체되었다가 최근 90년대 말에 이르러서는 재배면적의 감소가 가속화되고 있으나 단보당 생산량은 꾸준히 증가하고 있다. 2001년 중국의 쌀소비량은 138백만톤으로 이의 85.2%는 식량용으로, 5.8%는 사료용으로, 1.3%는 가공용, 1.5-2.0%는 수출용으로 그리고 1.2%는 종자용으로 소비되었다. WTO체제에 들어서도 중국의 쌀 생산에는 크게 영향을 받지않을 것으로 여겨지는데 그 이유로는 충분한 생산능려과 자급률, 쌀의 낮은(4%) 국제교역비율, 총생산량에 대한 낮은 쿼터비율 등을 들 수 있다. 그러나 WTO체제 가입에 따른 압력 또한 존재하는 것이 사실인데 그것은 낮은 품질, 국제가격보다 높은 국내가격 등을 들 수 있다. 향후 중국 쌀의 발전적 전략들로는 쌀의 안정적 발전을 지속하는 일, 쌀 재배구조 조정과 함께 높은 미질을 가지는 품종육종, 기계화를 비롯한 경작기술의 발달, 쌀과 부산물 가공기술의 개발연구, 특징 기능을 함유하는 유전공학적 기술의 적용, 토지와 도시화 그리고 식량순환에 시스템의 개혁 등 과학기술을 고양하는 일 등을 들 수 있다.TEX>$\times$10cm의 소식일수록 짧아서 재식주수와 경장은 정의상관이 인정되었다. 9 경직경은 30$\times$10cm, 40$\times$10cm의 소식일수록 크고 20$\times$10cm의 밀식일수록 작았다 10. 수량구성요소인 주근장과 수량인 건근중은 30$\times$10cm, 40$\times$10cm의 재식주수가 적을수록 높아서 재식주수와는 부의 상관이 인정되었다. 11 이상과 같은 결과로 보아 경직경이 크고 주근장이 길어서 10a당 건근중이 많은 30$\times$10cm(33주/$m^2$)가 알맞은 재식거리였다.에 대한 인식을 새롭게 하고 농약취급시의 건강장해예방행동을 촉구하는 등의 효과도 높은 것으로 예방의학적인 유용성이 크다고 볼 수 있다. 미침을 알 수 있었다. 대두 단백질로 코팅된 golden delicious는 상온에서60일 동안 보관하였을 경우, 사과표피의 색도 변화를 현저히 지연시킴을 확인하였다. 또한 control과 비교하여 성공적으로 사과에 코팅하였으며, 상온에서 보관하여을 때 사과의 품질을 30일 이상 연장하는 효과를 관찰하였다. 이들 결과로부터 대두단백질 필름이 과일 등의 포장제로서 이용할 가능성을 확인하였다.로 [-wh] 겹의문사는 복수 의미를 지닐 수 없 다. 그러면 단수 의미는 어떻게 생성되는가\ulcorner 본 논문에서는 표면적 형태에도 불구하고 [-wh]의미의 겹의문사는 병렬적 관계의 합성어가 아니라 내부구조를 지니지 않은 단순한 단어(minimal $X^{0}$ elements)로 가정한다. 즉, [+wh] 의미의 겹의문사는 동일한 구성요 소를 지닌 병렬적 합성어([$