• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.3
• /
• pp.621-626
• /
• 2009

This paper presents a multiple branch predictor using perceptrons. The key idea is to apply neural networks to the multiple branch predictor. We describe our design and evaluate it with the SPEC 2000 integer benchmarks. Our predictor achieves increased accuracy than the Bi-Mode and the YAGS multiple branch predictor with the same hardware cost.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.803-804
• /
• 2006

This paper presents a multiple branch predictor with perceptrons. We describe our design and evaluate it with the SPEC 2000 benchmarks. Our predictor achieves increased accuracy than the previous multiple branch predictors.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1443-1449
• /
• 2009

This paper presents a profiling model of a wide-window superscalar microprocessor using multiple branch prediction. The key idea is to apply statistical profiling technique to the superscalar microprocessor with a wide instruction window and a multiple branch predictor. The statistical profiling data are used to obtain a synthetical instruction trace, and the consecutive multiple branch prediction rates are utilized for running trace-driven simulation on the synthesized instruction trace. We describe our design and evaluate it with the SPEC 2000 integer benchmarks. Our performance model can achieve accuracy of 8.5 % on the average.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1009-1012
• /
• 1999

An analytical performance model that can predict the performance of a superscalar processor employing multiple branch prediction is introduced. The model is based on the conditional independence probability and the basic block size of instructions, with the degree of multiple branch prediction, the fetch rate, and the window size of a superscalar architecture. Trace driven simulation is performed for the subset of SPEC integer benchmarks, and the measured IPCs are compared with the results derived from the model. As the result, our analytic model could predict the performance of the superscalar processor using multiple branch prediction within 6.6 percent on the average.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.217-221
• /
• 2003

In this paper, the Viterbi decoder containing new branch metrics of the squared Euclidean distance with multiple order phase differences is introduced in order to improve the bit error rate (BER) in the differential detection of the trellis-coded MDPSK-OFDM. The proposed Viterbi decoder is conceptually same as the multiple Phase differential detection method that uses the branch metric with multiple phase differences. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency. Also, the proposed algorithm can be used in the single carrier modulation.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.145-159
• /
• 2019

To reduce the number of radio frequency (RF) chains in multiple input multiple output (MIMO) systems, generalized spatial modulation (GSM) techniques have been proposed in the literature. In this paper, we propose a zero-forcing (ZF)-based detector, which performs an initial pruning of the search tree that will be considered as the initial condition in a sphere decoding (SD) algorithm. The proposed method significantly reduces the computational complexity of GSM systems while achieving a near maximum likelihood (ML) performance. We analyze the performance of the proposed method and provide an analytic performance difference between the proposed method and the ML detector. Simulation results show that the performance of the proposed method is very close to that of the ML detector, while achieving a significant computational complexity reduction in comparison with the conventional SD method, in terms of the number of visited nodes. We also present some simulations to assess the accuracy of our theoretical results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.635-656
• /
• 2019

In this paper, we investigate the degrees of freedom (DoF) of a multi-cell multi-user multiple-input multiple-output (MIMO) interference broadcast channel (IBC) with non-cooperation distributed base stations (BS), where each BS serves users of its corresponding cell. When all BSs simultaneously transmit their own signals over the same frequency band in the MIMO IBC, the edge users in each cell will suffer the inter-cell interference (ICI) and inter-user interference (IUI) signals. In order to eliminate the ICI and IUI signals, a distributed space time interference alignment (DSTIA) approach is proposed where each BS has only limited access to distributed moderately-delay channel state information at the transmitter (CSIT). It is shown that the DSTIA scheme can obtain the appreciate DoF gains. In addition, the DoF upper bound is asymptotically achievable as the number of antenna at each BS increases. It is shown that the DSTIA method can get DoF gains over other interference alignment schemes with delayed CSIT in literature. Moreover, the DSTIA method can attain higher DoFs than the IA schemes with global CSIT for certain antenna configurations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8C
• /
• pp.830-839
• /
• 2009

In this paper, we address a near maximum likelihood (ML) scheme for the decoding of multiple input multiple output systems. Based on the metric-first search method and by employing Schnorr-Euchner enumeration and branch length thresholds, the proposed scheme provides reduced computational complexity. The proposed scheme is shown by simulation to have lower computational complexity than other near ML decoders while maintaining the bit error rate close to the ML performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.37-44
• /
• 2002

In this paper, the Viterbi decoder containing new branch metrics of the squared Euclidean distance with multiple order phase differences is introduced in order to improve the bit error rate (BER) in the differential detection of the trellis-coded MDPSK-DFDM. The proposed Viterbi decoder is conceptually same as the sliding multiple phase differential detection method that uses the branch metric with multiple phase differences. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER peformance without sacrificing bandwidth and power efficiency. Also, the proposed algorithm can be used in the single carrier modulation.

• Structural Engineering and Mechanics
• /
• v.86 no.4
• /
• pp.535-546
• /
• 2023

In the present paper, multiple interface cracks between a functionally graded orthotropic coating and an orthotropic half-plane substrate under concentrated loading are considered by means of the distribution dislocation technique (DDT). With the use of integration of Fourier transform the problem is reduced to a system of Cauchy-type singular integral equations which are solved numerically to compute the dislocation density on the surfaces of the cracks. The distribution dislocation is a powerful method to calculate accurate solutions to plane crack problems, especially this method is very good to find SIFs for multiple unequal cracks located at the interface. Hence this technique allows considering any number of interface cracks. The primary objective of this paper is to investigate the effects of the interaction of multiple interface cracks, load location, material orthotropy, nonhomogeneity parameters and geometry parameters on the modes I and II SIFs. Numerical results show that modes I/II SIFs decrease with increasing the nonhomogeneity parameter and the highest magnitude of SIF occurs where distances between the load location and crack tips are minimal.