The Throughput Optimization for Multi-hop MIMO Networks Based on Joint IA and SIC

The throughput of existing MIMO LANs is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents interference alignment and cancellation (IAC), a new approach for decoding concurrent sender-receiver pairs in MIMO networks. IAC synthesizes two signal processing techniques, interference alignment and interference cancellation, showing that the combination applies to scenarios where neither interference alignment nor cancellation applies alone. We show analytically that IAC almost doubles the throughput of MIMO LANs. We also implement IAC in GNU-Radio, and experimentally demonstrate that for 2x2 MIMO LANs, IAC increases the average throughput by 1.5x on the downlink and 2x on the uplink.

This paper considers a successive light interference cancellation and allocation algorithm (SLICA) practicing interference cancellation for an indoor visible light communication (VLC) system based on successive interference cancellation (SIC) technique. The interference among users is cancelled with the help of the proposed approach to reduce computational complexity. VLC has become the cornerstone of intelligence in the current scenario. The data services allocated to the users are demand based and rely on their channel conditions. The data is allocated to user by modulating light waves via illuminated LEDs. The receiving end has photodiode installed in it to recover back the data. Better performance rate is achieved with lesser interference with the proposed approach. To guarantee good (quality-of service) QoS, considerable simulations are carried out considering real- time scenario which further demonstrates the high level performance of the proposed approach over conventional approach. Based on the analysis, the SINR and interference level is demonstrated for the conventional and the proposed approach and there is a hike in the performance rate of SINR and interference level of about 20 – 30 % with the applied proposed approach. The prior motto of this study is to enhance the system throughput and improve per user average performance rate and reducing the complexity of the system. This contributes to the total efficiency of the optical indoor VLC network. Our proposed algorithm will provide a strong backbone for the 6G deployment.

The achievable degrees of freedom (DOF) in an interference relay channel are examined. We highlight some differences between two relaying strategies in two different setups. Namely, we study the DOF achieved using interference alignment and interference cancellation in a cognitive relay setup and in a half-duplex relay setup. The difference between the two setups is causality, which leads to a difference in the achievable DOF. We show that 3/2 DOF are achievable almost surely in a 3-user complex Gaussian interference relay channel with quasistatic channel coefficients and with one antenna at each node. This result holds for both the cognitive as well as for the more practical half-duplex non-cognitive relay. However, while this is achieved in the cognitive relay setup using one symbol duration, it needs two symbol extensions in the half-duplex case. On the other hand, we show that in the cognitive case, interference cancellation performs better than interference alignment, since it achieves 2 DOF almost surely. Moreover, interference cancellation achieves full, i.e. K DOF for a family of K-user interference channels with a cognitive relay. Interestingly, for the half-duplex setup the outcome is swapped. Here, interference alignment outperforms interference cancellation, since the latter achieves less than 3/2 DOF almost surely in the 3 user case.

For interference alignment (IA) with no channel extension, determining the existence of IA solution for general system parameters is still an open problem. This same problem also exists in interference alignment and cancellation (IAC), which combines IA with interference cancellation in the receivers, involving a new receiver architecture associated with signaling over backhaul links among them. As IAC is expected to achieve more degrees of freedom (DoF) than IA, the existence of IAC solution would be another interesting, yet challenging issue to investigate. In this paper, we have proposed a specific alignment scheme, which allows for the derivation of closed-form IAC solution. Furthermore, we establish and prove the general necessary and sufficient condition to determine the existence of closed-form IAC solution for a Gaussian interference multiple access channel (MAC) with K receivers and J users, each with M antennas.

Recently, a new MIMO degree-of-freedom (DoF) model was proposed to allocate DoF resources for spatial multiplexing (SM) and interference cancellation (IC) in a multi-hop network. Although this DoF model promises many benefits, it hinges upon a global node ordering to keep track of IC responsibilities among all the nodes. An open question about this model is whether its global ordering property can be achieved among the nodes in the network through distributed operations. In this paper, we explore this question by studying DoF scheduling in a multi-hop MIMO network, with the objective of maximizing the minimum throughput among a set of sessions. We propose an efficient DoF scheduling algorithm to solve it and show that our algorithm only requires local operations. We prove that the resulting DoF scheduling solution is globally feasible and show that there exists a corresponding feasible global node ordering for IC, albeit such global ordering is implicit. Simulation results show that the solution values obtained by our algorithm are relatively close to the upper bound values computed by CPLEX solver, thereby indicating that our algorithm is highly competitive.

In DS/CDMA systems, overcoming near/far effects and fading is imperative for satisfactory performance. One way to combat the near/far effect is to use stringent power control, as is done in most of the commercial systems. Another approach is Multi-User Detection (MUD). In addition to mitigating the near/far effect, MUD has the more fundamental potential of raising capacity by canceling Multiple Access Interference (MAI). This paper analyses the convergence behavior and performance of successive interference cancellation (SIC) for CDMA systems. This analysis will be generalized for Parallel Interference Cancellation (PIC) also. In this paper a Hybrid Interference Cancellation (HIC) receiver is designed by combining the successive and Parallel Interference Cancellation algorithms, so that the advantages of both the schemes are utilized effectively. The Hybrid Interference Cancellation scheme results in a simple, faster and reliable receiver. With the help of simulations, it is shown that this hybrid approach outperforms the other Multi-User Detection schemes.

In wireless interference networks, orthogonal medium access techniques like time division multiple access (TDMA) and frequency division multiple access (FDMA) achieve merely one degree of freedom (DoF). However, by using interference alignment (IA) the achievable DoF can be linearly scaled up with the number of users. Nevertheless, this outperformance of IA heavily depends on the availability of perfect channel state information (CSI), which is not a realistic assumption in practice. Since under imperfect CSI, the performance of IA may become severely degraded, design of enhanced IA algorithms by relying on the availability of merely imperfect CSI is of particular interest. In this paper, we propose a least squares (LS)-based IA algorithm which adaptively designs the beamformers based on the knowledge of the channel estimation error variance, which is possible to be known in advance. Then, we compare the performance of the proposed scheme with interference leakage minimization algorithms. It is shown that under both perfect and imperfect CSI, the proposed LS-based IA outperforms interference leakage minimization algorithms.

Successive Interference Cancellation (SIC) is a potentially powerful technique for improving the performance of multi-hop wireless networks, owing to its ability to enable concurrent receptions from multiple transmitters as well as interference rejection. In this paper, we address the problem of finding the route with maximal end-to-end spectral efficiency in multi-hop wireless networks, under the constraint of optimal bandwidth sharing. By taking advantage of SIC, more transmission opportunities are exploited by the nodes along the selected path. We formulate a cross-layer optimization framework to quantify the spectral efficiency improvement with SIC and then make use of several structural properties to derive exact solutions. Additionally, three SIC-based routing alternatives with low computational complexity are proposed, on the basis of the conventional shortest path algorithm, to obtain spectrum-efficient routes. Numerous simulation results verify that SIC can bring significant gains in terms of spectral efficiency.

This paper presents SECANT (Spectrum Efficient Communications and Advanced Networking Technology) as a novel multiuser communication protocol that integrates advanced physical (PHY) layer techniques for adaptive multiple access and interference management. SECANT supports concurrent multiple access (MA) transmissions to common receivers and parallel peer-to-peer (P2P) transmissions in the network. SECANT combines multiuser multiple-input multiple output (MU-MIMO), multiuser detection (MUD), and interference alignment (IA) methods at the PHY layer such that spectrum efficiency can be improved in both interference and signal spaces. An adaptive medium access control (MAC) mechanism is developed to enable spectrum efficiency gains at the PHY layer by managing concurrent transmissions and interference levels. Numerical results indicate significant spectrum efficiency gains (>14 times for fully loaded, and >56 times for 25% loading) that can be achieved over conventional single antenna systems with static MAC protocols.

We present a lattice reduction (LR) aided successive interference cancellation (SIC) scheme combined with linear pre-equalization in the correlated multi-user MIMO system. The LR-aided SIC schemes have been extensively studied to detect multiple users' symbols due to the nearly optimal performance. However, the LR algorithm and the sequential detecting method inherently incur considerable computational complexity overhead although it is of a polynomial order. To reduce their computational complexities, we decouple the entire system into multiple lower dimensional subsystems using linear pre-equalization based on the correlation among the users. We then utilize the LR-aided SIC parallel in each subsystem. Furthermore, to combine the LR-aided SIC with pre-equalization optimally, we modify the LR-aided SIC scheme, handling the residual interferences after pre-equalization.

The multiuser detection is a signal processing tech- nique which enhances the performance and capacity in DS- CDMA technology. Since its complexity issue was too expensive to handle, there was focus on the suboptimal detectors. In this paper we propose a hybrid method called adaptive differential interference cancellation method (ADIC) which is a hybrid of the differential interference cancellation method and which is then combined in a adaptive way to determine a weight matrix which will map the outcome of the differential interference cancellation method to come out with a better performance. This paper also looks into the computational cost of different methods using the floating point operation (flops) which is a good estimation of the comparative computational cost if not the exact one. I. INTRODUCTION The conventional DS-CDMA match filter detector fails to combat these issues due three prominent drawbacks: unrealis- tic ucorrelated code, near-far problem (even with strict power control (1)), and tough multiple access interference (MAI). Many advanced signal processing approaches have been made to improve the performances of these kinds of detectors. In this paper we will study the different approaches that were made in this field and implement these methods to reach a conclusion about the detection methods. As the name of the topic suggests the focus of our work will be study and propose cost effective better performing multiuser detection method. We will explore Multiuser Detection Techniques in Synchronous CDMA environment. Multi-user detection deals with the development and ap- plication of joint demodulation and interference cancellation cancellation techniques for improved detection of a desired set of digital signals in the presence of multiple access interfer- ence, intersymbol interference and noise. Since veterbi forward dynamic algorithm (2) is used in case of Optimum multiuser detection (3) the complexity grows in with the increase in the number of users. Hence the complexity is immense which increases exponentially with the increase in the number of users. Looking ahead for lower complexity hence lesser cost of implementation, the paper proposes the use of sub-optimal linear detectors (4). The sub-optimal detector the paper next focuses on is Decorrelator type of Detector (5) which is optimal in least squares. This detector out performs the optimal detector in many respects. Then the Minimum Mean Square Error (MMSE) linear detector is proposed which tries to minimize the squared error from the required transformation. It is one of the most popular detectors in use due to its easiness to implement and its lower complexity. But then in the above detection methods the decisions made were based on certain linear transformation criterion and there are missing efforts to check the performance in between the detection process to improvise the transformation method better detection. So then the paper proposes Adaptive multiuser detection. Then the paper focuses on Interference cancellation methods which utilize the feedback to reduce Multiple Access Interference (MAI) in the detected bits. Under the Interference Cancellation umbrella the Successive Interference Cancellation (SIC) (6), (7) method is explored and simulated to observe the results. Then the next method which performs better than SIC and more commonly used in real life, called Parallel Interference Cancellation (PIC) (6), (8) is also implemented. Before going ahead to implement the final proposed detection method, this paper implements Differential Interference Cancellation (DIC) (9) method. And then this paper finally proposes an Inter- ference Cancellation method called the Adaptive Differential Interference Cancellation Multiuser Detection method which is cost effective in comparison to other Interference Cancellation methods as we will require lesser hardware (multipliers as in the SIC or Parallel Interference Cancellation (PIC)) for that matter. More ever since we are using adaptive method the desired BER can be further reduced. This proposed method will be discussed in detail in the following section.

Interference Alignment in Multi-user MIMO Systems

Physical layer techniques have come a long way and can achieve very close to Shannon capacity for point-to-pint links. It is apparent that, to further improve network capacity significantly, we have to resort to concurrent transmissions. Many concurrent transmission techniques (e.g., zero forcing, interference alignment and distributed MIMO) are proposed in which multiple senders jointly encode signals to multiple receivers so that interference is aligned and each receiver is able to decode its desired information. In this paper, we investigate the constraints and challenges of using interference alignment. Our main contribution is conducting the first systematic investigation on the key issue of identifying opportunities for interference alignment. We identify diverse, novel scenarios for using interference alignment. We show that identifying opportunities for interference alignment in the general case is computational challenging. However, we also present a promising, distributed algorithm for identifying a wide range of opportunities for interference alignment using a unifying framework based on the degree of freedom. Our second contribution is evaluating key practical implementation issues.

We present a successive interference cancellation (SIC) scheme for a multicarrier (MC) DS CDMA system. In every subband, the SIC receiver successively detects the interferers' signals and substracts them from the user-of-interest. A comparison is made among SIC, matched filter detection with an equal gain combiner (MF-EGC), matched filter followed by maximal-ratio combining (MF-MRC) and minimum mean-squared error (MMSE) receivers with optimal tap coefficients. For this latter receiver, we determine the performance both when the number of taps equals the processing gain, denoted by N, and when the number of taps is roughly one-half of the processing gain. By analysis and simulation, it is shown that the SIC has better ability to suppress multiple-access interference (MAI) than do MF and [N/2]-tap MMSE in single carrier (SC) CDMA, and MF-EGC, MF-MRC and [N/2]-tap MMSE in MC CDMA, and this translates to increased capacity and better fading resistance. Further, SIC and N-tap MMSE yield approximately the same performance in SC CDMA, but SIC has a poorer performance than does an N-tap MMSE in MC CDMA. In addition, we derive results for the performance degradation that a SIC scheme experiences in MC CDMA due to both phase and timing tracking errors. It is shown that with small tracking errors, SIC can still retain a performance advantage over MF-EGC and MF-MRC, although the advantage of SIC decreases with increasing tracking errors.

Multiple-input multiple-output (MIMO) wireless communication systems can achieve higher throughput through interference alignment. For a small number of users, determining the maximum possible degrees of freedom as well as the feasibility of interference alignment in MIMO systems is well studied. However, the issues of scheduling in systems employing interference alignment and serving a large number of users have received little attention so far. In this paper, we study the problem of joint scheduling, interference alignment, and packet admission control in MIMO wireless systems with the goal of maximizing system throughput subject to stability constraints. We formulate a stochastic network optimization problem and propose a scheduling and interference alignment (SIA) algorithm. In each time slot, SIA schedules some users among many competing ones to transmit data, and determines encoding and decoding matrices for the selected users. Packet admission control is performed in each time slot. In addition, we propose a heuristic semi-distributed algorithm (SDSIA), which has a lower computational complexity than the SIA algorithm. Via simulation, we evaluate the performance of SIA and SDSIA for different algorithm parameters and different numbers of users. We also compare the performance of SDSIA with other approaches which do not simultaneously exploit interference alignment and scheduling and find that the combination of these two techniques increases the achievable data rate dramatically.