• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.18-25
• /
• 2014

In this paper, we propose a codebook-based interference alignment (IA) scheme in the constant multiple-input multiple-output (MIMO) interference channel especially for the uplink scenario. In our proposed scheme, we assume cooperation among base stations (BSs) through reliable backhaul links so that global channel knowledge is available for all BSs, which enables BS to compute he transmit precoder and inform its quantized index to the associated user via limited rate feedback link. We present an upper bound on the rate loss of the proposed scheme and derive the scaling law of the feedback load to maintain a constant rate loss relative to IA with perfect channel knowledge. Considering the impact of overhead due to training, cooperation, and feedback, we address the effective degrees of freedom (DOF) of the proposed scheme and derive the maximization of the effective DOF. From simulation results, we verify our analysis on the scaling law to preserve the multiplexing gain and confirm that the proposed scheme is more effective than the conventional IA scheme in terms of the effective DOF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1995-2003
• /
• 1999

Since the cross-correlation function which is due to communication channel distortion or interference is not orthogonal, near far problem and multi-user interference are generated in the DS-CDMA system. Those problems degrade performance of the system so that the efficient algorithm to suppress the interference in the DS-CDMA system is required. In this paper, a blind adaptive interference suppressor using constant modulus algorithm is proposed. Simulation results present that the gain of SIR for the blind adaptive receiver is about 7[dB] at steady state over Gaussian channel in forward channel. The gain of noise to interference ration is about 4[dB] over Rayleigh fading channel, is about 11[dB] over multipath channels. Thus the proposed receiver has higher performance than a conventional receiver in the DS-CDMA system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1117-1124
• /
• 2013

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 focuses on the inter-cell interference neutralization to resolve the main barrier for implementing small-cell cellular networks. Assuming that each message is delivered to the final destination by the help of base stations or relays, ergodic interference neutralization is proposed, which exploits the time-varying nature of wireless channels. The previous approach based on amplify-and-forward (AF) suffers from severe performance degradation in the low signal-to-noise (SNR) regime due to noise amplification. On the other hand, the proposed interference neutralization based on recently developed compute-and-forward (CF) fixes such a problem and improves the performance in the low SNR regime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.168-186
• /
• 2016

In this paper, we investigate the degrees of freedom (DoF) of a two-cluster multiple-input multiple-output (MIMO) multiway relay interference channel (mRIC), where there are two relays and two users per cluster. In this channel, users within the same cluster exchange messages among themselves with the help of two relays.We first obtain the DoF upper bound of the considered MIMO mRIC based on cut-set bound. Then, we propose a novel transmission strategy, blind interference neutralization (BIN), to approach the DoF upper bound. This new method utilizes the overheard information at two relays and focuses on the beamforming matrix designs at two relays so that the channel state information (CSI) at users is not required. Through theoretical analysis and numerical simulations, we show that the DoF upper bound can be obtained by using the BIN scheme. From simulation results, we show that the proposed BIN scheme can provide significant performance gain over the conventional time division multiple access (TDMA) scheme in terms of DoF. In addition, we show that the BIN scheme is a superior approach to the existing signal space alignment (SSA) schemes for the considered mRIC.

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

In this paper, we introduce three types of opportunistic interference management strategies in multi-cell uplink networks with time-invariant channel coefficients. First, we propose two types of opportunistic interference mitigation techniques, where each base station (BS) opportunistically selects a set of users who generate the minimum interference to the other BSs, and then their performance is analyzed in terms of degrees-of-freedom (DoF). Second, we propose a distributed opportunistic scheduling, where each BS opportunistically select a user using a scheduler designed based on two threshold, and then its performance is analyzed in terms of throughput scaling law. Finally, numerical evaluation is performed to verify our result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1786-1804
• /
• 2013

We consider a specific interference-limited wireless relay system that comprises several cooperation units (CUs) which are defined as a source and destination node pair with an associated relay node. In the wireless relay system, all source nodes simultaneously transmit their own signals and the relay node in each CU then forwards the received signal to the destination node, causing co-channel interference at both the relay node and the destination node in each CU. The co-channel interference at the relay node is closely related to that at the destination node in each CU. We first derive the end-to-end outage probability in a CU over Rayleigh slow-fading channels with interference for the decode-and-forward (DF) relaying strategy. Then, on the assumption that each CU is allocated with equal power we design an optimal power allocation between the source node and the relay node in each CU to minimize the outage probability of the investigated CU. At last, in the case that each CU is not allocated with equal power and the sum of their power is constrained, we present an optimal power allocation between CUs to minimize the sum of the outage probability of all CUs. The analytical results are verified by simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.291-298
• /
• 2017

In this paper, we derive the achievable degrees of freedom (DoF) for multiple-input multiple-output (MIMO) Z-interference channels (Z-IC) with reconfigurable antennas at the receivers, assuming that channel state information is not available at the transmitters. We propose a new linear scheme to align interfering signals and to decode desired signals through the designed preset mode switching pattern of reconfigurable antennas at the receivers. The key idea of our scheme is to use interfering signals as a side information at the interfered receiver by being silent at the corresponding transmitter during some time slots. Consequently, it is shown that the reconfigurable antennas at the receivers can bring a DoF gain if the number of preset modes is greater than the number of RF chains at the receivers.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.69-76
• /
• 2013

Reader-to-reader interference in RFID system is occurred due to the use of limited number of frequencies, and this is the main cause of read rate reduction in the passive RFID tags. Therefore, in order to maximize the read rate under the circumstances of limited frequency resources, it is necessary to minimize the frequency interference among RFID readers. This paper presents a hybrid FDM/TDM constraint satisfaction problem models for frequency interference minimization problems of the RFID readers, and assigns optimal channels to each readers using conventional backtracking search algorithms. A depth first search based on backtracking are accomplished to find solutions of constraint satisfaction problems. At this moment, a variable ordering algorithm is very important to find a solution quickly. Variable ordering algorithms applied in the experiment are known as efficient in the graph coloring. To justify the performance of the proposed constraint satisfaction problem model, optimal channels for each readers in the passive UHF RFID system are allocated by using computer simulation satisfying various interference constraints.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.1-9
• /
• 2012

We consider a receiving node, located at the origin, and a Poisson point process (PPP) that models the locations of the desired transmitter as well as the interferers. Interference is known to be non-Gaussian in this scenario. The capacity bounds for additive non-Gaussian channels depend not only on the power of interference (i.e., up to second order statistics) but also on its entropy power which is influenced by higher order statistics as well. Therefore, a complete statistical characterization of interference is required to obtain the capacity bounds. While the statistics of sum of signal and interference is known in closed form, the statistics of interference highly depends on the location of the desired transmitter. In this paper, we show that there is a tradeoff between entropy power of interference on the one hand and signal and interference power on the other hand which have conflicting effects on the channel capacity. We obtain closed form results for the cumulants of the interference, when the desired transmitter node is an arbitrary neighbor of the receiver. We show that to find the cumulants, joint statistics of distances in the PPP will be required which we obtain in closed form. Using the cumulants, we approximate the interference entropy power and obtain bounds on the capacity of the channel between an arbitrary transmitter and the receiver. Our results provide insight and shed light on the capacity of links in a Poisson network. In particular, we show that, in a Poisson network, the closest hop is not necessarily the highest capacity link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.933-940
• /
• 2009

This paper proposes a robust detection scheme for quasi-orthogonal space-time block code over time-selective fading channels. The proposed detector performs interference cancellation and decision feedback equalization to remove the inter-antenna interference and inter-symbol interference when the channel varies from symbol to symbol. Cholesky factorization is used on the channel Gram matrix after performing interference cancellation to obtain feed forward equalizer and feedback equalizer. It is shown by simulations that the proposed detection scheme outperforms the conventional detection schemes and the exiting detection schemes to time-selectivity.