• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1624-1641
• /
• 2015

Instantaneous relay (relay-without-delay) using interference alignment is a promising approach to neutralizing interference and improving system capacity. In Wang Chenwei's work, a 2-user scenario required both source and relay to access the global channel state information (CSI). This paper shows a new method of interference alignment improves the degrees of freedom (DoF) prominently for the 3-user MIMO interference channel with instantaneous relay. This new method is focused on the relay node that completes the alignment interference neutralization so the global CSI is obtained only once and the pressure on the base station can be mitigated. In addition, the 3-user MIMO interference channels with instantaneous relay can achieve 2M DoF when source and destination have M antennas, respectively. This method shows 33% improvement over the conventional method using interference alignment which obtains 3M/2 DoF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1926-1945
• /
• 2014

In this paper, we propose a distributed signal subspace interference alignment algorithm for single beam K-user ($3K{\geq}$) MIMO interference channel based on sum rate maximization and game theory. A framework of game theory is provided to study relationship between interference signal subspace and altruistic-egoistic bayesian game cost function. We demonstrate that the asymptotic interference alignment under proposed scheme can be realized through a numerical algorithm using local channel state information at transmitters and receivers. Simulation results show that the proposed scheme can achieve the total degrees of freedom that is equivalent to the Cadambe-Jafar interference alignment algorithms with perfect channel state information. Furthermore, proposed scheme can effectively minimize leakage interference in desired signal subspace at each receiver and obtain a moderate average sum rate performance compared with several existing interference alignment schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2859-2872
• /
• 2019

Interference alignment (IA) has been a powerful approach to achieve the maximum degree of freedom (DoF) for K users multiple-input-multiple-output (MIMO) interference channels. However, due to the feasibility constraint, aligning all the interference signals at each receiver is impractical for large K without symbol extension. In this paper, we propose two best-effort interference alignment (BEIA) schemes that the network selects the maximum number of interfering transmitters to align their signals given the feasibility conditions when each transmitter-receiver pair has a constant number of data streams. Besides, in case of not all interfering signals aligned at each receiver, an upper bound of the average throughput is derived. Simulation results show that the proposed schemes have superiority over the traditional methods, such as time division multiple access (TDMA) and cluster IA(CIA), in low and moderate signal-to-noise ratio (SNR) region in terms of average user throughput. In addition, the proposed max-min relative interference distance alignment scheme outperforms the proposed scheme of equal interfering transmitters number alignment in terms of both average user throughput and minimum user throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.947-955
• /
• 2012

In this paper, we propose iterative algorithms to obtain the transmit and the receive vectors for interference alignment in cellular network. Although the conventional interference alignment algorithms for interference channels can be applied to cellular network, the number of iterations required to achieve a high sum rate is very large. The key idea in the proposed algorithms is to ignore intra-cell interference in updating the transmit vector for uplink and the receive vector for downlink. Numerical results show that the proposed algorithms achieve higher sum rates than the conventional algorithms for given iteration numbers when multiple antennas and a single carrier are used for interference alignment. It is also shown that the proposed algorithms outperform the conventional algorithms when a single antenna and multiple subcarriers are used for interference alignment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.238-244
• /
• 2010

We propose a user selection method in multi-cell multiuser uplink system with the subspace interference alignment to maintain the high sum-rate capacity. The proposed method selects users whose interference to adjacent cells are strong and apply the subspace interference alignment to the users. The proposed method provides that the number of users performing the interference alignment reduces and the high total sum-rate is maintained. Simulation results exhibit the proposed method reduces the number of users who would decompose the channel for the subspace interference alignment by 50% when the required sum-rate is 90% of the maximal achievable sum-rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.485-494
• /
• 2011

In this paper, novel sub-space interference alignment algorithms are proposed to boost the capacity in multi-cell environment. In the case of conventional sub-space alignment, arbitrary reference vectors have been adopted as transmitting vectors at the transmitter side, and the inter-cell interference among users are eliminated by using orthogonal vectors of the chosen reference vectors at the receiver side. However, in this case, sum-rate varies using different reference vectors even though the channel values keep constant, and vice versa. Therefore, the relationship between reference vectors and channel values are analyzed in this paper, and novel interference alignment algorithms are proposed to increase multi-cell capacity. Reference vectors with similar magnitude are adopted in the proposed algorithm. Simulation results show that the proposed algorithms provide about 50 % higher sum-rate than conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.10
• /
• pp.956-964
• /
• 2012

An opportunistic interference alignment based on dynamic cell selection is proposed. Since the proposed method can switch the desired signal space and the interference space of received signals, an additional selective diversity gain increases. The performance analysis using probabilistic models provides a mathematical expression for the sum-rate capacity. Simulation examples show that the proposed method achieves the higher sum-rate capacity than that of the conventional opportunistic interference alignment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.11
• /
• pp.675-681
• /
• 2014

As the recently soaring wireless traffic, small-cell techniques have been actively studied in order to support such a wireless demand for cellular wireless networks. This paper studies interference mitigation methods for random-access small-cell networks. Although inter-cell interference between small random-access cells is one of the main factors to degrade overall performance, most of the previous works focused on interference mitigation between users in each cell. To address such limitation, dynamic opportunistic interference alignment is proposed exploiting statistical characteristics of random-access. It is demonstrated by simulation that the proposed scheme outperforms the previous approach as the number of cells or the number of users in each cell increases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.6
• /
• pp.27-38
• /
• 2012

In this paper, we introduce CoMP in 3GPP LTE-Advanced Release 11 to take care of shadowing effects appearing in cell-edge areas to meet rapidly increasing demand for high speed transmission and multi-media data. In order to mitigate interference, orthogonalizing is ideal but it is slightly difficult to be applied to real systems. Therefore, interference alignment and avoidance are used in practical applications. Interference alignment is a scheme enabling us to consider interference our friend not enemy. We show lattice codes in Gaussian channel achieve Shannon capacity where strong interference exists. In addition, we show the relationship between channel parameter a and DoF(Degree of Freedom) applying lattice codes to interference alignment for interference channel with three users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.592-600
• /
• 2011

This paper presents a selective interference alignment for cognitive radio system with spectrum leasing. The proposed method selects users who cause severe interference to other basestations that have required SINR. Since few users are selected to apply subspace interference alignment, the total complexity of the system is not high compared with that of the system who utilizes subspace interference alignment to all users. In addition, all users can transmit without considering interference. The computer simulation shows the proposed method exhibits 350% throughput enhancement at a two cell case, and 400% increase at a three cell case.