• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1539-1547
• /
• 1999

캐리-세이브 가산기 (CSA)는 회로 설계 과정에서 빠른 연산 수행을 위해 가장 널리 이용되는 연산기 중의 하나이다. 그러나, 현재까지 산업체에서 CSA를 이용한 설계는 설계자의 경험에 따른 수작업에 의존하고 있고 그 결과 최적의 회로를 만들기 위해 매우 많은 시간과 노력이 소비되고 있다. 이에 따라 최근 CSA를 기초로 하는 회로 합성 자동화 기법에 대한 연구의 필요성이 대두되고 있는 상황에서, 본 논문은 연산 속도를 최적화하는 효율적인 CSA 할당 알고리즘을 제안한다. 우리는 CSA 할당 문제를 2단계로 접근한다: (1) 연산식의 멀티 비트 입력들만을 고려하여 최소 수행 속도 (optimal-delay)의 CSA 트리를 할당한다; (2) (1)에서 구한 CSA 트리의 수행 속도 증가가 최소화 (minimal increase of delay) 되는 방향으로 CSA들의 캐리 입력 포트들에 나머지 싱글 비트 입력들을 배정한다. 실제 실험에서 우리의 제안된 알고리즘을 적용하여 연산식들의 회로 속도를 회로 면적의 증가 없이 상당한 수준까지 줄일 수 있었다.Abstract Carry-save-adder (CSA) is one of the most widely used implementations for fast arithmetics in industry. However, optimizing arithmetic circuits using CSAs is mostly carried out by the designer manually based on his/her design experience, which is a very time-consuming and error-prone task. To overcome this limitation, in this paper we propose an effective synthesis algorithm for solving the problem of finding an allocation of CSAs with a minimal timing for an arithmetic expression. Specifically, we propose a two step approach: (1) allocating a delay-optimal CSA tree for the multi-bit inputs of the arithmetic expression and (2) determining the assignment of the single-bit inputs to carry inputs of the CSAs which leads to a minimal increase of delay of the CSA tree obtained in step (1). For a number of arithmetic expressions, we found that our approach is very effective, reducing the timing of the circuits significantly without increasing the circuit area.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.572-580
• /
• 2007

Wireless sensor networks are sensing, computing and communication infrastructures that allow us to monitor, instrument, observe, and respond to phenomena in the harsh environment. Generally, the wireless sensor networks are composed of many deployed sensor nodes that were designed to be very cost-efficient in terms of production cost. For example, UC Berkeley's MICA motes have only 8-bit CPU, 4KB RAM, and 128KB FLASH memory space. Therefore, sensor operating systems that run on the sensor nodes should be able to operate efficiently in terms of the resource management. In this paper, we present a dynamic threads stack management scheme for space-constrained and multi-threaded sensor operating systems. In this scheme, the necessary stack space of each function is measured on compile-time. Then, the information is used to dynamically allocate and release each function's stack space on run-time. It was implemented in Nano-Qplus sensor operating system. Our experimental results show that the proposed scheme outperforms the existing fixed-size stack allocation mechanism.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.289-302
• /
• 2003

In this paper, the performance of a multicarrier CDMA system applying adaptive modulation and adaptive subchannel allocation scheme is analyzed in wireless environment. In case of the proposed system, total subchannels is 4 and data is transmitted over 2 subchannels with the biggest fading, Threshold of each channels is 5.2 ㏈, 9 ㏈, 13.2 ㏈ and 8.4 ㏈, 12.2 ㏈, 16.3 ㏈. The BER of 10-3 is 8.1 ㏈. This is increased 12.9 ㏈ in comparison with the existing system. The BPS according to average channel is needed average E$_{b}$ N$_{o}$ of about 15 ㏈ in 7 bit.t.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.156-167
• /
• 2007

In this paper, we develop the model based prediction algorithm for Variable-Bit-Rate(VBR) video traffic with regular Group of Picture(GOP) pattern. We use multiplicative ARIMA process called GOP ARIMA (ARIMA for Group Of Pictures) as a base stochastic model. Kalman Filter based prediction algorithm consists of two process: GOP ARIMA modeling and prediction. In performance study, we produce three video traces (news, drama, sports) and we compare the accuracy of three different prediction schemes: Kalman Filter based prediction, linear prediction, and double exponential smoothing. The proposed prediction algorithm yields superior prediction accuracy than the other two. We also show that confidence interval analysis can effectively detect scene changes of the sample video sequence. The Kalman filter based prediction algorithm proposed in this work makes significant contributions to various aspects of network traffic engineering and resource allocation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1098-1105
• /
• 1999

The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.45-50
• /
• 2012

In the current wireless communication technology, the digital radio system replaces the analog radio broadcasting. Since the in-band digital radio systems are used in the existing analog radio frequency band, interference problems of digital radio are caused. It is important to effectively analyze the interference. In this paper, to analyze SINR and BEP (bit error probability) of digital radio system, we propose the analysis method considering angular effect. The angular effect means a method to analyze the interference when the receiver is located in different directions around the transmitter. These results are able to give basic information for the allocation of digital radio networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.420-425
• /
• 2012

A forward error correction (FEC) coding techniques is one of time diversity techniques with which the effect of channel impairments due to noise and fading are spreaded over independently, and thus the performance could be improved. Therefore, the performance of the FEC scheme can be maximized if we minimize the correlation of channel information across over a codeword. In this paper, we propose a block turbo code with the maximized time diversity effect which may be reduced due to utilization of high order modulation schemes and due to transmission over a comparatively fast fading environment. Especially, we propose a very simple formula to calculate the address of coded bit allocation, and thus we do not need any additional outer interleavers, i.e., inter-codeword interleavers. The simulation resuts investigated in this paper reveal that the proposed scheme can provide the performance gain of more than a few decibels compared to the conventional schemes.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.107-109
• /
• 2016

본 논문에서는 4K UHD 입력 영상을 실시간으로 부호화하기 위해 적용되는 GOP 단위 또는 IDR 주기 단위의 병렬 부호화 구조를 지원하도록 R-${\lambda}$ 모델 기반의 율 제어 방법을 개선하는 비트 분배(bit allocation) 방법을 제안한다. GOP 단위 또는 IDR 주기 단위의 병렬 부호화기 내에서 율 제어기를 작동시키는 경우, 계층적 B 구조에서 같은 계층에 있는 프레임 간에는 상호간에 얼마만큼의 비트를 소모 하였는지에 대한 정보를 공유 할 수 없기 때문에 기존의 비트 분배 방식으로는 비트 예산(bit budget) 관리가 불가능하다. 이를 해결하기 위해 본 논문에서는, 기존의 R-${\lambda}$ 모델 기반 율 제어 방법을 개선하여 부호화 순서에 의한 시간 순서 방향의 비트 예산 갱신 기반 비트 분배하던 방식으로부터, GOP 마다 비트를 할당한 후 계층적 B 구조에서의 계층이 깊어지는 방향으로 비트 예산을 갱신하여 비트를 분배하는 방식으로 율 배분 방식을 개선하였다. 실험 결과를 통해 R-${\lambda}$ 모델 기반 율 제어의 기존 비트 분배 방식보다 제안 방법에 의한 목표 비트 율 달성 오차가 감소함을 확인하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.137-148
• /
• 2012

In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.4
• /
• pp.64-70
• /
• 1997

This paper is aimed to propose a new wavelet audio signal coding scheme which reduces the complexity of well-known MPEG(Moving Picture Expert Group)-Audio. The filters of MPEG0audio apply subband technique on the 16-bits PCM audio to aquire bitstream of subband sample using dynamic bit allocation. If we use the wavelet coefficients instead of subband samples and 6 bands which is less than 32 bands of MPEG-audio, the complexity can be reduced. A new audio signal compression algorithm in this paper is based on wavelet transform and the proposed algorithm is compared with MPEG-audio. At the bitrate of 256kbps, the proposed algorithm maintains the CD(Compact-disc) quality. We were able to reduce the about 40% of complexity at encoder and about 70% at decoder.