• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.8
• /
• pp.2468-2479
• /
• 1996

An upper bound solution is obtained to perform the process analysis of hot strip rolling process. The material flows within the roll bite at various geometries and frictional conditions are obtained from finite element analysis and the typical flow pattern which is necessary to determine the kinematically admissible velocity field is assumed. From the kinematically admissible velocity field, the upper bound energy is calculated and the rolling load, angle of neutral point and forward slip ratio at various operational conditions are obtained from upper bound energy. The process analysis of above mentioned parameters at various operational conditions have provided valuable information which is hard to obtain during rolling operation and the predicted ranges of quantitive values from these analyses lie whthin the bound of actual operational data.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

Given the frame size and constituent encoders, interleaver plays a central role in a turbo code performance. Interleaver should be designed to generate a heavy weight codeword in the second encoder if the first encoder generates a low weight codeword. In this paper we present a search procedure for high performace interleaver whose performance is measured by computing union bound using the weight spectrum of all the weight 2, 3

• Journal of Industrial Convergence
• /
• v.1 no.1
• /
• pp.25-40
• /
• 2003

A number of recent studies have contributed to an increased understanding of how and why workers feel bound to their unions. However, by now there has been limited theoretical works on the various forms that union membership can take. Thus, the goal of this study is to develop the types of union membership. To develop the types of union membership, I used the ideological and instrumentalitic concepts. The types of union membership are identified as follows: Positive free agents (${\Leftrightarrow}$ Negative free agents) have low levels of both positive (negative) instrumentality and positive (negative) ideology. If positive (negative) instrumentality is high and positive (negative) ideology low, this group may be labeled Instrumentals (${\Leftrightarrow}$Disgruntled). Expressives (${\Leftrightarrow}$Antagonizers) have low levels of positive (negative) union instrumentality and high levels of positive (negative) ideology. Those who have high levels of both positive (negative) ideology and positive (negative) instrumentality have been called Identifiers (${\Leftrightarrow}$Opponents). Variables related to union instrumentality, and union ideology were investigated: (1) the personal characteristics of individual members, (2) the employing organization, (3) the union characteristics, (4) the economic environment, (5) the labor relations climate.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.11
• /
• pp.1-8
• /
• 2008

In this paper, we analyze the symbol error rate (SER) performance of maximum likelihood (ML) joint detection in downlink multiple-input multiple-output (MIMO) multicarrier code division multiple access (MC-CDMA) systems by deriving a tight union bound on the symbol error rate (SER). The union bound for ML joint detection is utilized to demonstrate the performance of MIMO MC-CDMA systems quantitatively in multiuser and frequency selective Rayleigh fading environments. An analysis of the diversity order of the systems shows the effects of multiple users, spread subcarriers, and multiple antennas on the ML joint detection performance. Furthermore, the analysis shows that MIMO MC-CDMA systems without full loading can achieve more diversify than MIMO orthogonal frequency division multiplexing (OFDM) systems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.6 s.360
• /
• pp.18-23
• /
• 2007

In this Paper, we consider multiple input multiple output Feher-patented quadrature phase shift keying (MIMO-FQPSK) system supporting high spectral efficiency and throughput. Based on the fact that the complex baseband signal sampled at every bit duration has only eight phase values and its signal can be considered as 8-phase-shift keying signal, FQPSK demodulation with maximum likelihood sequence estimation(MLSE) is considered and it is extended to MIMO system. The performance of MIMO-FQPSK receiver is analyzed by computer simulation and by considering the union upper bounds for zrero forcing detection and minimum mean square error detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.553-558
• /
• 1998

We present in this paper the ture union bound of the performance of chip level detection for coded DS/CDMA system operating in Rician fading channels such as LEO satellite mobile radio where the maximum doppler frequency is very high. The main objective of this paper is to calculate the exact doe union bound of BER performance of different performance of different quadrature detectors and to find a optimum spreading factor as a function of fade rate. The rationale of using multiple chip detection is to reduce the effective fade rate or variation. We considered chip level differential detection, chip level maximum likelihood sequence estimation, noncoherent detection and coherent detection with perfect channel state information as a reference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.522-527
• /
• 2012

In this paper, union upper bound on convolutional coded bit error rates (BER) is derived for downlink orthogonal frequency division multiple access (OFDMA) networks. According to the numerical results, for the small network loads, the BER performance with Laplacian decoding metric outperforms the BER performance with Gaussian decoding metric under downlink OFDMA networks with Viterbi decoder.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.7
• /
• pp.1074-1084
• /
• 1999

In this paper the bit error probability of noncoherent M-ary FSK system is derived from the probability density function of the envelope of the received signal over a frequency-nonselective slowly m-distributed Nakagami fading channel. Also, the performance of coherent M-ray FSK system is theoretically analyzed, using union bound over the similar fading channel. Then we compare uncoded performance results for M-ary FSK and DPSK signals in Nakagami fading channel.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.43-49
• /
• 2014

In this paper, we consider the performance evaluation of space time block code (STBC)) with coordinate interleaved orthogonal design (CIOD) over time selective channel. In case of quasi static channel, STBC-CIOD satisfies full rate and full diversity (FRFD) property with the single symbol decoding. However in the time selective channel, the symbol interference degrades the system performance when we employ the single symbol decoding. We derive the union bound of the symbol error probability by evaluating the pairwise error probability in the first order Markov channel. We also present simulation results of STBC-CIOD with QPSK.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.