• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1768-1789
• /
• 2016

In contemporary video streaming systems based on HTTP protocol, video players at the client side are responsible for adjusting video quality to network conditions and user expectations. However, when multiple video clips are streamed simultaneously, an intricate application logic implemented in the video players overlays the TCP mechanism which is responsible for a balanced access to a shared network link. As a result, some video players may not obtain a fair share of network throughput and may be vulnerable to an unstable video bit-rate. Therefore, we propose to simplify the algorithms implemented in the video players, which are responsible for the adjustment of video quality and constrain their functionality only to sending feedback to a server about a state of the player buffer. The main logic of the system is shifted to the server, which is now responsible for bit-rate selection and prioritisation of the video streams transmitted to multiple clients. To verify our proposition, we performed several experiments in a laboratory environment which show that when the server cooperates with the clients, the video players experience fewer quality switches and the system achieves better fairness when allocating network throughput among the video players. However, this comes at the cost of worse utilisation of network bandwidth.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.101-112
• /
• 1999

In this paper variable bit rate VBR Moving Picture Experts Group (MPEG) coded full-motion video traffic is modeled by a nonlinear time-series process. The threshold autoregressive (TAR) process is of particular interest. The TAR model is comprised of a set of autoregressive (AR) processes that are switched between amplitude sub-regions. To model the dynamics of the switching between the sub-regions a selection of amplitude dependent thresholds and a delay value is required. To this end, an efficient and accurate TAR model construction algorithm is developed to model VBR MPEG-coded video traffic. The TAR model is shown to accurately represent statistical characteristics of the actual full-motion video trace. Furthermore. in simulations for the bit-loss rate actual and TAR traces show good agreement.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.209-216
• /
• 2006

This paper investigates a distinct set of complex unitary matrices for QPSK differential space time coding. After properly selecting the initial transmission matrix and unitary matrices we find that the different combinations of them could lead different BER performance over slow/fast Rayleigh fading channels and antennas correlated channels. The numerical results show that the proper selection of the initial transmission matrix and the set of unitary matrices can efficiently improve the bit error rate performance, especially for the antennas correlated fading channel. The computer simulations are evaluated over slow and fast Rayleigh fading channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.767-774
• /
• 2007

A new transmit antenna selection and shuffling($AS^2$) method for spatially correlated double space time transmit diversity(DSTTD) systems is proposed. The proposed method allows dumb antennas and the superposition of multiple signals at the same transmit antenna, whereas the conventional methods consider the antenna shuffling(AS) only. According to the simulation result, the proposed method provides a 1.8 dB signal-to-noise ratio(SNR) gain over the conventional methods for spatially correlated transmit antennas. Although the number of candidates for $AS^2$ is much higher than that of AS, it is found that the number of candidates for $AS^2$ can be reduced to 36 by using the characteristics and properties of preprocessing matrices, and among them, only 6 candidates are almost always chosen. Next, we empirically compare the bit-error-rate (BER) performance of the proposed method with the conventional spatial multiplexing(SM) technique with antenna selection. Simulation results show that the proposed method outperforms the SM technique.

• Tunnel and Underground Space
• /
• v.13 no.3
• /
• pp.196-206
• /
• 2003

In order to investigate the workability of Raise Boring Machine(RBM) such as utilization, penetration rate and advance rate, a vertical shaft of 98 m in length and 3.05 m in diameter was constructed in the layer of conglomerate by using the RBM in this study. In addition, field data from tow different construction sites including water-pump power plant tunnel, roadway tunnel and mining tunnel by RBM were collected and analyzed. The results show that the average weekly bored length is 19.3 m and its average utilization is between 54.3 % and 75.1 % very higher than that of the TBM(Tunnel Boring Machine). It also turns out that the bit force increases linearly with respect to the increase of the RPM(revolution per minute) of RBM. However, the net penetration rate decreases with the increase of bit force, RPM of RBM and depth of shaft. The findings of this study can be used to provide the useful information for the design of shaft and the selection of RBM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.907-914
• /
• 2004

In this paper, we propose an application of the receiver antenna switching to an conventional adaptive modulation system and derived the optimal antenna switching threshold of the system to maximize the average transmission bit rate and analyzed its performance. Also, we compare the performances of the presented scheme with those of an adaptive modulation using the antenna selection diversity and the one with a single antenna in terms of the average number of bits per symbol and the probability of no transmission. Performance comparison results show that the proposed system has an SNR gain of 1.4 dB over the adaptive modulation using a single antenna when the average number of bits per a symbol is two and yields an SNR gain of 6 dB for maintaining the probability of no transmission at the level of 0.1.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.59-66
• /
• 2015

In this paper, we propose a method of improving the light-load efficiency of DC-DC buck converter using 4bit SAR-ADC (Successive Approximation ADC) for a LDO or a power transistor size selection technique. The proposed circuit selects power transistor sizes depending on load current so that improves the light-load efficiency of the DC-DC buck converter. For this, we select the power transistor size with a cross point of the switching loss and the conduction loss. Also, when the IC operates in standby mode or sleep mode, a LDO mode is selected for improving the efficiency. The proposed circuit selects power transistor sizes(X1, X2, X4, X8) with 4 bits and its efficiency is higher about the maximum of 25% at the light-load than that of a single transistor size. Input voltage and output voltage are 5V and 3.3V for maximum load currents of 500mA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.644-649
• /
• 2013

For effective DC-free coding in the optical storage systems, the Guided Scrambling algorithm is widely used. To reduce digital discrepancy of the coded sequence, functions of digital sum value (DSV) are used as criteria to choose the best candidate. Among these criteria, the minimum digital sum value (MDSV), minium squared weight (MSW), and minimum threshold overrun (MTO) are popular methods for effective DC-suppression. In this paper, we formulate integer programming models that are equivalent to MDSV, MSW, and MTO GS coding. Incorporating the MDSV integer programming model in MaxMin setting, we develop an integer programming model that computes the worst case MDSV bound given scrambling polynomial and control bit size. In the simulation, we compared the worst case MDSV bound for different scrambling polynomial and control bit sizes. We find that careful selection of scrambling polynomial and control bit size are important factor to guarantee the worst case MDSV performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.256-270
• /
• 2014

A new morphed steganographic algorithm is proposed in this paper. Image security is a challenging problem these days. Steganography is a method of hiding secret data in cover media. The Least Significant Bit is a standard Steganographic method that has some limitations. The limitations are less capacity to hide data, poor stego image quality, and imperceptibility. The proposed algorithm focuses on these limitations. The morphing concept is being used for image steganography to overcome these limitations. The PSNR and standard deviation are considered as a measure to improve stego image quality and morphed image selection, respectively. The stego keys are generated during the morphed steganographic embedding and extracting process. Stego keys are used to embed and extract the secret image. The experimental results, which are based on hiding capacity and PSNR, are presented in this paper. Our research contributes towards creating an improved steganographic method using image morphing. The experimental result indicates that the proposed algorithm achieves an increase in hiding capacity, stego image quality, and imperceptibility. The experimental results were compared with state of the art steganographic methods.