• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.750-758
• /
• 2013

In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.570-573
• /
• 2011

Dalvik 가상 머신은 최적화가 쉽지 않았던 스택 기반의 가상 머신인 자바 가상 머신(JVM)과 달리 레지스터 기반의 가상 머신이므로 여러 최적화 기법을 적용할 수 있다. 따라서 Dalvik 가상 머신을 위한 새로운 레지스터 할당기법이 필요하다. 본 논문에서는 dx tool을 거친 레지스터 기반의 Dalvik byte code를 레지스터 재 할당하여 최적화하고, 이를 Dalvik JIT으로 보내어 다시 한번 레지스터 재할당 함으로써 최적화 효율을 높일 수 있는 최적화 기법을 제안하였다. 또한 제안 기법과 Dalvik JIT의 복잡도를 비교함으로써 제안기법을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.597-599
• /
• 2012

D2D(Device-to-Device) 통신은 이동통신망을 기반으로 동작할 경우 이동통신망의 자원을 재사용함으로써 자원이용의 효율성을 높일 수 있다. 그러나 동일자원을 사용하는 이동통신개체와 D2D 통신 단말(DUE) 사이에 신호 간섭이 발생할 수 있어 이를 고려한 자원할당기법에 대한 연구가 필요하다. 본 논문에서는 D2D 통신이 이동통신망의 상향링크자원을 재사용할 때 DUE로부터 기지국으로의 간섭으로 인한 CUE의 상향링크 전송률 손실 대비 DUE로 얻는 전송률 이득이 극대화하는 DUE에게 자원을 할당함으로써 동일자원을 사용하는 DUE와 이동통신개체 간 간섭을 완화하고 망의 수율 성능을 향상시킬 수 있는 자원할당기법을 제안한다.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.11-17
• /
• 2018

In this paper, we propose a novel frequency reuse method using the fractional frequency reuse (FFR) for enterprise femtocell networks (EFNs) in which a lot of femtocell base stations (fBSs) are deployed in a buinding, e.g., business companies, department stores, etc, and evaluate the system performance for the downlink of EFNs. First, we introduce the concept of the split reuse method to allocate the frequency bandwidth with considering the interference between the macrocell and femtocell. Then, we propose the resource allocation with the FFR for fBSs of EFNs to reduce the interference and increase the system capacity. Through simulations, we show that the proposed FFR method outperforms a traditional resource allocation method with frequency reuse factor 4 in terms of the mean fUE capacity, total EFN capacity, and outage probability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.81-87
• /
• 2007

While conventional frequency reuse techniques for cellular communication systems divide frequency resources into multiple regions and each mobile is statically assigned to a certain frequency region, frequency reuse techniques for cellular OFDMA communication systems can be regarded as dynamic scheduling problems of finding best-fitted subcarriers for each packet transmission. Unlike conventional frequency reuse techniques allocating mutually exclusive frequency resources to adjacent cells, this paper proposes the use of a frequency reuse technique with irregular frequency allocation patterns assigned statically based on the cell numbers. This paper shows that the use of irregular frequency patterns can allow efficient interference avoidance and high data throughputs comparable to those with carefully planned frequency patterns.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.06a
• /
• pp.237-239
• /
• 2012

이적작업은 자동화 컨테이너 터미널에서 하역작업의 생산성을 높이는 중요한 운영 전략 중의 하나이다. 이는 장치장 크레인의 이동시간과 재작업을 줄이기 위해 장치장 블록 내 컨테이너들의 재배치하는 작업을 의미한다. 이적작업은 주로 크레인의 유휴시간에 수행되며 장치장 크레인의 추가적인 하역 작업을 요구한다. 이적작업계획이 수립된 후 작업할당 문제가 다루어진다. 크레인 작업할당 문제는 작업가능시간에 대한 제약을 고려하여 이적작업의 효과를 최대화시키기 위해 장치장 크레인이 처리할 이적작업을 선정하고 이들의 작업순서를 정하는 것이다. 본 연구는 혼합정수계획법을 이용하여 장치장 크레인의 작업할당 문제를 모형화 하고 실효적인 이용을 위해 수치실험을 통해 여러 작업할당 규칙의 수행도를 비교분석하였다.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.320-332
• /
• 2000

Web consists of the grand virtual system which is made of all connected computers network. We can solve the huge problem which requires high quality in cost performance and powerful computing power to use a numerous idle state system on internet as process it parallel. However, we have to consider heterogeneous computing resources, accessibility, and reliability to carry out parallel system on global environment, not network but whole Internet. In this paper, We the WebImg system which has the power of web computing, and show the flexible task allocation strategy in heterogeneous hosts. Also, we evaluate its performance, moreover the proposed task allocation strategy supplies fault tolerance by controlling host situation at any time.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.562-571
• /
• 2007

Various researches had been devoted in purpose of improving memory management in terms of performance, efficiency, ease of use, and safety. One of these approaches is a region-based memory management. Each allocation site selects a specific region, after that allocated objects are placed in this region. Memory is reclaimed by destroying the region, freeing all the objects allocated therein. In this paper, we propose reusing of local regions to reduce heap memory usage in memory-limited environments. The basic idea of this proposal is reusing of upper local regions where objects that are allocated to these regions are not accessed until the current method is finished. We believe our method of reusing local regions is able to overcome memory constraints in memory-limited environments.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.378-383
• /
• 2001

Intranet 환경에 다수의 유휴 호스트를 이용하여 많은 계산량을 지닌 응용 문제를 분산시켜 병렬 수행함으로써 효율성의 향상이 기대된다. 하지만 유휴 호스트를 이용하는데 있어서 이질성과 가변성 및 자율성으로 인해 요청에 대한 신뢰성을 예측하기가 어렵다. 본 논문에서는 태스크 할당 및 호스트 관리에 있어서 부하 균등을 위한 동적 분산 병렬 스킴인 적응적 태스크 재할당 기법을 제시한다. 또한, 이미지 랜더링 생성과 프랙탈 이미지 처리와 같은 많은 연산량을 지닌 응용 문제를 PDSWeb 시스템에 적용하여 제안 알고리즘의 성능을 분석하고 평가한다.