• Journal of Korea Game Society
• /
• v.6 no.4
• /
• pp.63-70
• /
• 2006

This paper studied various low power structures of texture caches for mobile 3D graphics accelerator to reduce the memory latency of texture data. Also the paper designed the texture cache with the variable threshold values of power mode transition according to the filtering algorithms. In the trace driven simulation, we compared the performance of those structures using Quake game engine as the benchmark. Also the algorithm was proposed and verified by the simulation, which has variable threshold values of power mode transitions according to the selected texture filtering method.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3190-3198
• /
• 1999

Because of the rapid growth of the mobile communication, the need for the mobile internet access has grown up as well. since the current mobile communication network, however, is optimized for a voice communication system, which exclusively occupies a channel for a given time, it is not suitable for variable rate packet data. In order to support the mobile internet access, it is essential do design a reasonable packet switching network which supports the mobility. Since mobile packet network has longer latency, high speed switching and QoS are required to meet the user's requirements. In this paper, we suggest an resonable way to construct a network and its operation procedures utilizing GPRS(General Packet Radio Service) network and MPLS(Multi Protocol Label Switching) to provide a high speed switching and QoS mobile internet access. GPRS is used as a network which supports the mobility and MPLS guarantees the QoS and high speed IP protocol transmission based on the ATM switching technology.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.11
• /
• pp.265-268
• /
• 1995

Signal averaging technique to improve signal-to-noise ratio has widely been used in various fields, especially in electrophysiology. Estimation of the EP(evoked potential) signal using the conventional averaging method fails to correctly reconstruct the original signal under EEG(electroencephalogram) noise especial]y when the latency times of the evoked potential are not identical. Therefore, a technique based on the bispectrum averaging was proposed for recovering signal waveform from a set o noisy signals with variable signal dalay. In this paper an improved bispectrum estimation technique of the RP signal is proposed using a confidence thresholding of the EP signal in frequency domain in which energy distribution of the EP signal is usually not uniform. The suggested technique is coupled with the conventional bispectrum estimation technique such as least square method and recursive method. Some results with simulated data and real EP signal are shown.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.319-329
• /
• 2012

Closed-loop transmit diversity is considered an important technique for improving the link budget in the third generation and future wireless communication standards. This paper proposes several transmit diversity algorithms suitable for small wireless terminals and presents performance assessment in terms of average signal-to-noise ratio (SNR) and outage improvement, convergence, and complexity of operations. The algorithms presented herein are verified using data from measured indoor channels with variable antenna spacing and the results explained using measured radiation patterns for a two-element array. It is shown that for a two-element array, the best among the proposed techniques provides SNR improvement of about 3 dB in a tightly spaced array (inter-element spacing of 0.1 wavelength at 2 GHz) typical of small wireless devices. Additionally, these techniques are shown to perform significantly better than a single antenna device in an indoor channel considering realistic values of latency and propagation errors.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.139-144
• /
• 2004

In order to transmit various types of multimedia data (i.e. voice, video, and data) over a wireless channel, the coding and modulation scheme needs to be flexible and capable of providing a variable quality of service, data rates, and latency. In this paper, we study a mobile multimedia COMA network combined with the concatenated Reed-Solomon/Rate Compatible Punctured Convolution code (RS/RCPC). Also, this paper propose the combination of concatenated RS/RCPC coder and COMA RAKE receiver for multimedia COMA traffic which can be sent over wireless channels. From the results, using a frequency selective Rayleigh fading channel model, it is shown that concatenated RS/RCPC coder at the wireless physical layer can be effective in providing reliable wireless multimedia CDMA network. And the proposed scheme that combine concatenated RS/RCPC coder and CDMA RAKE receiver provides a significant gain in the BER performance over multi-user interference and multipath frequency selective fading channels.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.141-146
• /
• 2016

Geotechnial engineering projects that requires excavation activity can cause massive ground deformation and this can damage adjacent structures. Depending on the engineering characteristics of ground material and the excavation depth, the ground movement is various. To overcome this issue, the ground deformation is monitored by multiple sensors. Typically, an inclinometer is installed behind the support wall. In this paper, we present an adaptive duty-cycling control mechanism using wireless sensors for monitoring ground deformation in excavations. The proposed mechanism dynamically adjusts the sleep time based on the urgency degree of sensed data from inclinometer. Through analytical evaluation of expected latency time, we confirm our adaptive duty-cycling mechanism has lower latency compared with periodic duty-cycling mechanism under variable conditions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.85-94
• /
• 2005

It has been reported and verified in many design experiences that a judicious utilization of the page and burst access modes supported by DRAMs contributes a great reduction in not only the DRAM access latency but also DRAM's energy consumption. Recently, researchers showed that a careful arrangement of data variables in memory directly leads to a maximum utilization of the page and burst access modes for the variable accesses, but unfortunately, found that the problems are not tractable, consequently, resorting to simple (e.g., greedy) heuristic solutions to the problems. In this parer, to improve the quality of existing solutions, we propose 0-1 ILP-based techniques which produce optimal or near-optimal solution depending on the formulation parameters. It is shown that the proposed techniques use on average 32.2%, l5.1% and 3.5% more page accesses, and 84.0%, 113.5% and 10.1% more burst accesses compared to OFU (the order of first use) and the technique in [l, 2] and the technique in [3], respectively.