• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.650-657
• /
• 2011

This paper proposes a novel bit allocation algorithm for H.264 scalable extension(SE) based on a human visual system (HVS) to improve the coding efficiency. The proposed algorithm is consist of two stages: visual weighting model and visual weighting-based bit allocation algorithm. In the first stage, the visual weighting for each macroblock (MB) is analyzed according to the region of interests. Then the adaptation of the visual weighting into the bit allocation routine for each quality layer is performed for improving the visual quality. In the simulation results, it is observed that the proposed scheme can improve the subjective and objective video quality in the same bit rate, compared to the previous scalable video coding in H.264.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.282-287
• /
• 2005

The space time block code(STBC) can not provide simultaneously both full diversity and full transmission rate in a transmit diversity system having more than two transmit antennas.. There are a quasi orthogonal STBC for four transmit antennas that provides full transmission rate and minimized interference. Recently, a simple correlation canceling algorithm is introduced to achieve full diversity from STBC considering four transmit antennas. In this paper, we propose a new decoding procedure using the power allocation at the transmitter and subtraction interference process at the receiver to achieve a better performance without noise enhancement.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2359-2362
• /
• 2003

본 논문에서는 효과적으로 블록 크기를 변화시키는 움직임 예측에 대하여 제시하고 있다 블록안의 움직임의 정도에 따라 블록 크기를 채택하는 방식으로, 임의의 프레임에서의 블록의 수는 정확한 움직임을 나타내기 위해 변화된다. 이것은 움직임과 보충적인 데이터사이의 비트할당이 가변적이 되고, 프레임에 기초한 전체적인 비트율 역시 변화하게 된다. 특히, 본 논문은 동적 블록 크기 방법의 대표적인 쿼드 트리(quad fee) 방법의 단점을 보완하는 방향에서 연구되었으며, 성능 향상을 위한 새로운 방법도 아울러 덧붙여져 있다. 즉, 보통 사용하는 쿼드 트리 방식의 분할 대신에 각각의 쿼드 부분의 프레임 차를 이용하여 가장 큰 블록의 동질성 테스트를 실시하여 분할한다. 또한, 분할과 재결합 방식을 함께 적용하여 불필요한 블록의 개수가 많아지는 것을 방지하여, 큰 계산량 감소와 높은 이미지 질을 달성하도록 하였다. 자연히, 계산량은 기존 방법보다 약 20-70％ 정도 감소했으며, 이미지 질도 크게 향상되는 결과를 가져오게 되었다

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.87-92
• /
• 2020

Although GPGPU (General-Purpose GPU) can maximize performance by parallelizing a task with tens of thousands of threads, those threads are internally grouped into a thread block, which is a base unit for processing and resource allocation. A thread block scheduler is a specialized hardware gadget whose role is to allocate thread blocks to GPGPU processing hardware in a round-robin manner. However, round-robin is a sequential allocation policy and is not optimized for GPGPU resource utilization. In this paper, we propose a thread block scheduler model which can analyze and quantify performances for various thread block scheduling policies. Experiment results from the implemented simulator of our model show that the legacy hardware thread block scheduling does not behave well when workload becomes heavy.

• Journal of KIISE:Software and Applications
• /
• v.28 no.2
• /
• pp.201-209
• /
• 2001

고성능 마이크로 프로세서들은 성능 향상을 위해 ILP를 지원한다. 병렬성을 극대화시키기 위해서는 많은 성능 저해 요인들을 제거해야 한다. 최근에는 컴파일러의 역할을 증대시켜 이러한 요인들을 줄이기 위한 노력들이 활발히 진행되고 있다. 본 논문에서는 성능 저해 요인인 조건 분기 처리를 위하여 조건 실행과 레지스터 할당을 결합함으로써 메모리로의 대피를 최소화하고 병렬성을 향상시킬 수 있는 개선된 레지스터 할당 알고리즘을 제안한다. 제안한 방법을 적용하여 실험한 결과 간섭 그래프의 에지수가 4.47% 감소되었고 그 결과 요구되는 대피 변수의 수도 21.35% 감소되었다. 그리고 기존의 방법에 비해 19.38%의 성능 향상 결과를 얻었다. 결국 본 레지스터 할당 기법은 조건 실행을 통해 조건 분기 명령을 제거하여 기본 블록 내의 명령어 수를 증가시켜 병렬처리의 기회를 증진시키고 조건 분석을 통해 간섭 그래프의 불필요한 에너지를 제거시켜 보다 효율적인 레지스터 할당을 실현함으로써 제안한 방법의 타당성을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.329-332
• /
• 2003

노드 병합을 이용한 레지스터 할당 방법은 그래프 감축 단계에서 블록 되었을 경우 효율적인 비용 계산을 이용하여 그래프 감축이 지속될 가능성을 발생시키는 방법이다. 이와 함께 지정 레지스터 수의 증가를 최소화하는 레지스터 할당 방법은 컬러링 과정에서 좀더 적은 수의 레지스퍼를 사용하도록 하기 위하여 제안된 방법이다. 이 두 가지 알고리즘을 함께 적용한 경우 기존의 레지스터 할당 알고리즘 보다 우수한 결과를 보였다. Appel 의 간섭 그래프들을 사용하여 제시된 레지스터 할당 방법과 Briggs의 알고리즘을 비교할 때 500 개 이상의 에지를 포함하는 그래프중에 5.81%의 그래프에서 레지스터 요구 수가 감소되었다. 제시된 알고리즘은 코드 길이가 길거나 사용가능한 레지스터 수가 적은 경우에 좋은 성능을 가져올 것으로 예측한다.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1
• /
• pp.88-95
• /
• 1997

PCS(Personal Communications Systems) where the cell structure is microcell can accommodate more subscribers than those of cellular systems where the cell structure is macrocell by reducing the cell radius. To cope with such differences in PCS environment, new channel allocation schemes are needed. In this paper, problems which may arise when channel allocation scheme of cellular is applied to PCS is firstly analyzed. To overcome such problems, a new scheme is proposed. Performance of proposed schemes is analyzed and compared with other channel allocation schemes. Blocking probability is used as the performance parameter.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.91-95
• /
• 2008

Flash memory is widely used in embedded systems because of its benefits such as non-volatile, shock resistant, and low power consumption. But NAND flash memory suffers from out-place-update, limited erase cycles, and page based read/write operations. To solve these problems, log-structured filesystem was proposed such as YAFFS. However, YAFFS sequentially retrieves an array of all block information to allocate free block for a write operation. Also before the write operation, YAFPS read the array of block information to find invalid block for erase. These could reduce the performance of the filesystem. This paper suggests fast operation method for NAND flash filesystem that solves the above-mentioned problems. We implemented the proposed methods in YAFFS. And we measured the performance compared with the original technique.

• Journal of Broadcast Engineering
• /
• v.20 no.3
• /
• pp.398-407
• /
• 2015

Compressive sensing (CS) has drawn much interest as a novel sampling technique that enables sparse signal to be sampled under the Nyquitst/Shannon rate. By noting that the block-based CS can still keep spatial correlation in measurement domain, this paper proposes to adapt sampling rate of each block in frame according to its characteristic defined by edge information. Specifically, those blocks containing more edges are assigned more measurements utilizing block-wise correlation in measurement domain without knowledge about full sampling frame. For natural image, the proposed adaptive rate allocation shows considerable improvement compared with fixed subrate block-based CS in both terms of objective (up to 3.29 dB gain) and subjective qualities.

• Journal of Platform Technology
• /
• v.9 no.1
• /
• pp.46-57
• /
• 2021

Recently, research has been actively conducted to utilize blockchain technology in various fields. In particular, blockchain-based smart contracts are applied to various automation systems that require reliability as they have the characteristics of recording data in a distributed ledger environment to verify the integrity and validity of data. However, blockchain does not provide data access control and information security because data is shared among network participants. In this paper, we propose a user dynamic access control mechanism utilizing smart contracts in blockchain environments. The proposed mechanism identifies the user's contextual information when accessing data, allocating the user's role and dynamically controlling the data access range. This can increase the security of the system and the efficiency of data management by granting data access dynamically at the time of user authentication, rather than providing the same services in roles assigned to each user group of the network system. The proposed mechanism is expected to provide flexible authentication capabilities through dynamic data access control by users to enhance the security of data stored within blockchain networks.