• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.56-63
• /
• 1997

Under most system assumptions, closed form solutions of performance measures for ATM switches with input queueing are not available. In this paper, we present expressions and bounds for the derivatives of cell loss probabilities with respect to the arrival rate evaluated at a zero arrival rate. These bounds are used to give an approximation by Taylor expansion, thereby providing an economical way to estimate cell loss probabilities in light traffic.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.43-48
• /
• 2003

Two-dimensional packing algorithm can be used for allocating submeshes in mesh multiprocessor systems. Previously, we developed an efficient packing algorithm called TP heuristic, and showed how the results of the packing could be used for allocating submeshes. In this paper, we present theoretical performance bounds for TP heuristic. We also present a parallel version of the algorithm that consumes reduced time when it is executed by multiple processors in mesh multiprocessors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3156-3167
• /
• 2020

One drawback of polar codes is that they are not universal, that is, to achieve optimal performance, different polar codes are required for different kinds of channel. This paper proposes a polar code construction scheme for Nakagami-m fading channel. The scheme fully considers the characteristics of Nakagami-m fading channel, and uses the optimized Bhattacharyya parameter bounds. The constructed code is applied to an orthogonal frequency division multiplexing (OFDM) system over Nakagami-m fading channel to prove the performance of polar code. Simulation result shows the proposed codes can get excellent bit error rate (BER) performance with successive cancellation list (SCL) decoding. For example, the designed polar code with cyclic redundancy check (CRC) aided SCL (L = 8) decoding achieves 1.1dB of gain over LDPC at average BER about 10^-5 under 4-quadrature amplitude modulation (4QAM) while the code length is 1024, rate is 0.5.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.102-107
• /
• 2002

The theoretical performance of MMSE linear microdiversity combining in Rayleigh fading, additive interference channels has already been derived exactly in the literature. In the macrodiversity case the fundamental difference is that any given source may well have different average received powers at the different antennas. This makes an exact analysis more difficult and hence for the macrodiversity case we derive a bound on the mean BER and a semi-analytic upper bound on outage probabilities. Hence we provide bounds on the performance of MMSE linear microdiversity combining in Rayleigh fading with additive noise and any number of interferers with arbitrary powers.

• International Journal of Concrete Structures and Materials
• /
• v.3 no.1
• /
• pp.47-56
• /
• 2009

The first diagonal cracking and ultimate shear load of reinforced girder made of ultra high performance fiber reinforced concrete (UHPFRC) were investigated in this paper. Eleven girders were tested in which eight girders failed in shear. A simplified formulation for the first diagonal cracking load was proposed. An analytical model to predict the ultimate shear load was formulated based on the two bounds theory. A fiber reinforcing parameter was constituted based on the random assumption of steel fiber uniform distribution. The predicted values were compared with the conventional predictions and the test results. The proposed equation can be used for the first cracking status analysis, while the proposed equations for computing the ultimate shear strength can be used for the ultimate failure status analysis, which can also be utilized for numerical limit analysis of reinforced UHPFRC girder. The established fiber reinforcing theoretical model can also be a reference for micro-mechanics analysis of UHPFRC.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.43-47
• /
• 2000

In regions of low signal-to-noise ratio (SNR), performance analysis uses simulations of hybrid concatenated coding systems. However, for higher SNR regions beyond simulation capabilities, average upper bounds to bit error rate (BER) and word error rate (WER) are used. In [1], all weight enumerating functions are needed to obtain average bounds. In this paper, we use RSC as constituent codes, by using effective free distances instead of WEF, we derive average BER and WER bounds of hybrid concatenated convolutional codes (HCCC) and analyze the BER and WER over AWGN and Rayleigh/Rician fading channels.

• Management Science and Financial Engineering
• /
• v.8 no.1
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.30 no.4
• /
• pp.329-340
• /
• 1994

This paper presents a dynamic compensation methodology for robust trajectory tracking control of uncertain robot manipulators. To improve tracking performance of the system, a full model-based feedforward compensation with continuous VS-type robust control is developed in this paper(i.e,. robust decentralized adaptive control scheme). Since possible bounds of uncertainties are unknown, the adaptive bounds of the robust control is used to directly estimate the uncertainty bounds(instead of estimating manipulator parameters as in centralized adaptive control0. The global stability and robustness issues of the proposed control algorithm have been investigated extensively and rigorously via a Lyapunov method. The presented control algorithm guarantees that all system responses are uniformly ultimately bounded. Thus, it is shown that the control system is evaluated to be highly robust with respect to significant uncertainties.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.311-318
• /
• 1988

An adaptive control problem for a plant with unmodelled dynamics is studied. The upper bounds of the output due to the unmodelled dynamics and measurement noise is assumed to be known. This problem was studied by Middleton et al. They used a modified form of the least square method in estimating the plant paramaters. In this paper, the bounds of the parameters are estimated by linear programming and the parameters are estimated by the projetion type algorithm incorporating the bounds of the parameters. The stability of the proposed adaptive control system can be proved in nearly the same way as the proof of Middleton. The performance of the proposed method is found to be much better than the method of Midlleton's with respect to the parameter convergence and plant output in computer simulations.