• Journal of information and communication convergence engineering
• /
• v.17 no.1
• /
• pp.1-7
• /
• 2019

In this paper, we present the block diagonalization (BD) algorithm for the multiple-user multiple input multiple output (MU-MIMO) $4{\times}4$ system using specific purpose processor (SPP) hardware. Our objective is to improve the single-user MIMO (SU-MIMO) system using the MU-MIMO technology, which is remarkably fast and allows more users to connect simultaneously. To that end, our MU-MIMO precoder uses the BD algorithm to ensure signal integrity when connecting multiple users; but remains accurate and stable. However, a precoder that uses the BD algorithm is computationally complex; therefore, we use an SPP with special functions designed to compute the BD algorithm. The implementation test results show that our SPP computes the BD algorithm faster than the software solution.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.3
• /
• pp.77-85
• /
• 2018

Multi-User Multiple-Input Multiple-Output (MU-MIMO) is the core technology for improving the channel capacity compared to Single-User MIMO (SU-MIMO) by using multiuser gain and spatial diversity. Key problem for the MU-MIMO is the user selection which is the grouping the users optimally. To solve this problem, we adopt Extreme Value Theory (EVT) at the beginning of the proposed algorithm, which defines a primary user set instead of a single user that has maximum channel power according to a predetermined threshold. Each user in the primary set is then paired with all of the users in the system to define user groups. By comparing these user groups, the group that produces a maximum sum rate can be determined. Through computer simulations, we have found that the proposed method outperforms the conventional technique yielding a sum rate that is 0.81 bps/Hz higher when the transmit signal to noise ratio (SNR) is 30 dB and the total number of users is 100.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.481-484
• /
• 2009

In this paper, we suggest a precoding algorithm for full-duplex relay with multiple antennas. Because full-duplex relay performs transmission and reception at the same time in the same frequency band another existing half-duplex relay differently, self interference arise between transmit and receive antennas of relay. The proposed precoding algorithm eliminates self interference by block diagonalization algorithm and makes the relay perform full-duplex operation. Also we verify that full-duplex relay have improved channel capacity than existing half-duplex relay by computer simulation.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.81-96
• /
• 2004

The level-m scaled circulant factor matrix over the complex number field is introduced. Its diagonalization and spectral decomposition and representation are discussed. An explicit formula for the entries of the inverse of a level-m scaled circulant factor matrix is presented. Finally, an algorithm for finding the inverse of such matrices over the quaternion division algebra is given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2166-2180
• /
• 2016

We investigate the opposite of artificial noise (AN)-assisted communication in multiple-input-multiple-output (MIMO) wiretap channels for the multiuser case by taking the side of the eavesdropper. We first define a framework for an AN-assisted multiuser multiple-input-multiple-output (MU-MIMO) system, for which eavesdropping methods are proposed with and without knowledge of legitimate users' channel state information (CSI). The proposed method without CSI is based on a modified joint approximate diagonalization of eigen-matrices algorithm, which eliminates permutation indetermination and phase ambiguity, as well as the minimum description length algorithm, which blindly estimates the number of secret data sources. Simulation results show that both proposed methods can intercept information effectively. In addition, the proposed method without legitimate users' CSI performs well in terms of robustness and computational complexity.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.297-307
• /
• 2012

A femtocell is a small cellular base station, typically designed for use in a home or small business. The random deployment of a femtocell has a critical effect on the performance of a macrocell network due to co-channel interference. Utilizing the advantage of a multiple-input multiple-output system, each femto base station (FBS) is able to form a cluster and generates a precoding matrix, which is a modified version of conventional single-cell block diagonalization, in a cooperative manner. Since interference from clustered-FBSs located at the nearby macro user equipment (MUE) is the dominant interference contributor to the coexisting networks, each cluster generates a precoding matrix considering the effects of interference on nearby MUEs. Through simulation, we verify that the proposed algorithm shows better performance respective to both MUE and femto user equipment, in terms of capacity.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.354-369
• /
• 2015

Recently, there has been an increasing demand of high data rates services, where several multiuser multiple-input multiple-output (MU-MIMO) techniques were introduced to meet these demands. Among these techniques, vector perturbation combined with linear precoding techniques, such as zero-forcing and minimum mean-square error, have been proven to be efficient in reducing the transmit power and hence, perform close to the optimum algorithm. In this paper, we review several fixed-complexity vector perturbation techniques and investigate their performance under both perfect and imperfect channel knowledge at the transmitter. Also, we investigate the combination of block diagonalization with vector perturbation outline its merits.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.8
• /
• pp.1097-1101
• /
• 2003

The cubic and quartic anharmonic force field of malonaldehyde is calculated using density functional theory at the B3LYP/6-31G(d,p) level, and used to simulate coherent infrared vibrational spectra. 12 normal modes are included in the simulation, and the Arnoldi method is employed for the diagonalization of the Hamiltonian. The calculated three pulse infrared signals in the k1 + k2 - k3 direction show signatures of the intramolecular hydrogen bond couplings between the C=O stretch, H-O-C bend and O-H stretch vibrations.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.175-178
• /
• 2014

We introduce the Energy-Based Blind Separating (EBS) algorithm for extremely fast separation of mixed speech signals without loss of quality, which is performed in two stages: iterative-form separation and closed-form separation. This algorithm significantly improves the separation speed simply due to incorporating only some specific frequency bins into computations. Simulation results show that, on average, the proposed algorithm is 43 times faster than the independent component analysis (ICA) for speech signals, while preserving the separation quality. Also, it outperforms the fast independent component analysis (FastICA), the joint approximate diagonalization of eigenmatrices (JADE), and the second-order blind identification (SOBI) algorithm in terms of separation quality.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.98.5-98
• /
• 2001

An efficient adaptive nonlinear compensator, based on a wavelet transform domain adaptive Volterra filter along with a modified escalator algorithm, is proposed to speed up the convergence rate of an adaptive LMS algorithm. In particular, it is well known that the e.g., slow convergence speed of an adaptive LMS algorithm depends on the statistical characteristics (e.g., large eigenvalue spread) of the corresponding auto-correlation matrix of the input vector. To solve such a convergence problem, the proposed approach utilizes a modified escalator algorithm and a wavelet transform domain adaptive LMS Volterra filtering technique, which leads to diagonalization of the auto-correlation matrix of the ...