• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1638-1643
• /
• 2019

In this paper, we propose an adaptive-perturbation-aided opportunistic precoding (APOP) scheme for multiple-input multiple-output (MIMO) systems. To update a precoding matrix in MIMO systems, the proposed algorithm produces a random perturbation in each time slot. Then the additional adaptive perturbation is also applied, which depends on the reports of achievable data-rates from users. If the prior random perturbation increased the data rate, the adaptive perturbation is set to be the same as the prior random perturbation, otherwise the negative value of the prior random perturbation is applied for adaptive perturbation. Furthermore, to enhance the achievable data rates, the information on the stored precoding matrices in the memory as well as the currently generated precoding matrix is used for scheduling. Simulation results show that compared to conventional opportunistic precoding schemes, higher data rates are achieved by the proposed APOP scheme, especially when there are a relatively small number of users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1027-1037
• /
• 2010

In this paper, we propose the linear interpolation-based BD (Block Diagonalization) precoding approximation algorithm for low complexity in downlink multiuser MIMO-OFDM (Multiple-input Multiple-output Orthogonal Frequency Division Multiplexing) systems. In the case of applying the general BD precoding algorithm to multiuser MIMO-OFDM systems, the computational complexity increases in proportional to the number of subcarriers. The proposed interpolation-based BD precoding approximation algorithm can be achieved similar SER performance with general BD algorithm and can decrease the computational complexity. It is proved that proposed algorithm can achieve the significantly decreased computational complexity by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.915-921
• /
• 2009

Lenstra-Lenstra-Lovasz (LLL) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better bases of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction Algorithm (SA), instead of LLL, with the conventional linear precoding algorithms. Since SA obtains more orthogonal lattice bases compared to those obtained by LLL, lattice reduction aided (LRA) precoding based on SA algorithm outperforms the LRA precoding with LLL. Simulation results demonstrate that a gain of 0.5dB at target BER of $10^{-5}$ is achieved when SA is used instead of LLL or the LR stage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1185-1190
• /
• 2008

In this paper, we propose an simplified successive minimum mean square error ($S^{2}MMSE$) algorithm that can simplify the computational complexity for precoding matrix generation in the successive minimum mean square error (SMMSE) precoding method, which is adopted as a multiuser multiple-input multiple-output (MU-MIMO) precoding technique in the IST (information society technologies)-WINNER (wireless world initiative new radio) project. The original algorithm generates the precoding matrix by calculating all individual precoding vectors with each requiring its own MMSE nulling matrix, over all receive antennas for all users. In contrast, this proposed algorithm first calculates the MMSE nulling matrix for each user, and then calculates all precoding vectors for respective receive antennas of the corresponding user by using the identical MMSE nulling matrix, in which only a simple matrix-vector multiplication is required for each vector. Consequently, it can simplify significantly the computational complexity to generate a precoding matrix for SMMSE precoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1678-1685
• /
• 2015

We propose a linear precoding scheme combining the merits of beamforming and orthogonal space-time block coding based on the imperfect CSI without knowing the CSI reliability. We first investigate the impact of the CSI reliability on precoding performance by assuming various values of the CSI reliability. Then, we propose a method of predicting the CSI reliability based on the received SNR for the design of an efficient precoder. We show the efficiency of the proposed scheme by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2145-2147
• /
• 2015

In this letter, we investigate the performance analysis of massive MIMO systems using MRT and ZF precodings according to the number of DoF. We analyze the ergodic received SINRs with MRT and ZF precodings as closed-forms over the number of DoF normalized by the number of antennas. In simulation results, we verify the analyzed results and observe that MRT precoding is better than ZF precoding in terms of the ergodic received SINR with a small number of DoF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.58-60
• /
• 2015

In this letter, an open-loop precoding is proposed to enhance the performance of SM in transmit correlated MIMO channels. The proposed method is derived by observing the effect of feedback error on the minimum distance precoder, and can mitigate the performance degradation without any feedback information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.79-85
• /
• 2008

Dirty Paper Coding(DPC) can achieve the sum capacity of a multiuser multiple-input multiple-output(MU MIMO) broadcast channels. However, due to the high computational complexity of the successive encoding and decoding, deploying DPC in real systems is impractical. As one of practical alternatives to DPC, Block Diagonalization(BD) was researched. BD is an extension of the zero-forcing preceding technique that eliminates interuser interference(IUI) in downlink MIMO systems. Though BD has lower complexity than DPC, BD shows poor sum capacity performance. We show that sum capacity performance of BD is degraded due to no IUI constraint. Then, we modify BD to improve its sum capacity performance with relaxing the constraint and sub optimal channel set searching. With simulation results, it can be verified that our modification in BD induces some improvement in sum capacity performance.

• Journal of Advanced Navigation Technology
• /
• v.28 no.3
• /
• pp.362-368
• /
• 2024

In this paper, we investigated the performance of directional and omnidirectional precoding schemes when transmitting to improve downlink performance in massive MIMO. Omnidirectional precoding was used to broadcast a common signal, such as a synchronization or control signal, to all users. The main purpose of omnidirectional precoding is to design the precoding matrix so that the signal transmitted in the downlink is the same in all directions and emitted with maximum energy. We propose a flexible omnidirectional precoding method for full-dimensional massive MIMO that can set the spatial coverage range to less than 120 degrees. The constraints of omnidirectionality of all antennas, equal transmit power, and maximum transmit rate are used to design the encoding matrix of the proposed method. The performance was evaluated in terms of spatial coverage by considering changing the spatial coverage of the antenna array by changing the distance between neighboring antennas in the antenna array.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.3-11
• /
• 2014

Multiple antennas can provide huge capacity gains when the transmitter knows the channel state information (CSI). Precoding is a technique that exploits CSI at the transmitter side. In this paper, an adaptive precoding scheme is proposed, called a hybrid multiple-input multiple-output (MIMO) precoding (HMP). HMP is a combination of linear and nonlinear precoding. The number of transmit antennas less than or equal to four is as same as the conventional antenna selection scheme. Therefore, the HMP scheme uses more than four transmit antennas. The good channel means that the channels must be selected to maximize the channel capacity among the given channels, and the rest channels are called bad channel. In HMP scheme, we use the nonlinear precoding in the good channels and the linear precoding in the bad channels. The well-known Tomlinson-Harashima precoding (THP) is considered as nonlinear precoding. The system throughput and MSE (minimum square error) are shown for the performance of HMP scheme compared to the conventional schemes which are BD (block diagonalization), antenna selection and THP.