No abstract

No abstract

No abstract

No abstract

No abstract

Principal component (PC) algorithm has recently been shown as a very accurate blind detection technique in comparison with other covariance-based detection algorithms. However, it also has a higher complexity owing to the computation of the eigenvectors. We propose a low-complexity Lanczos principal component (LPC) algorithm that utilizes Lanczos iterative method to compute the eigenvectors. In comparison with the PC algorithm, the proposed LPC algorithm offers significant reduction in complexity while giving a similar detection performance. Low-complexity LPC algorithm allows for the use of larger sized covariance matrix that further improves the detection performance. Maximum-minimum eigenvalue (MME) algorithm is also included in the comparison and it gives an inferior performance as compared to both PC and LPC algorithm. All the algorithms were tested with experimental data while using universal software radio peripheral (USRP) testbed that was controlled by GNU radio software.

No abstract

Small cells deliver cost-effective capacity and coverage enhancement in a cellular network. In this work, we present the interplay of two technologies, namely Wi-Fi offloading and small-cell cooperation that help in achieving this goal. Both these technologies are also being considered for 5G and B5G (Beyond 5G). We simultaneously consider Wi-Fi offloading and small-cell cooperation to maximize average user throughput in the small-cell network. We propose two heuristic methods, namely Sequential Cooperative Rate Enhancement (SCRE) and Sequential Offloading Rate Enhancement (SORE) to demonstrate cooperation and Wi-Fi offloading, respectively. SCRE is based on cooperative communication in which a user data rate requirement is satisfied through association with multiple small-cell base stations (SBSs). However, SORE is based on Wi-Fi offloading, in which users are offloaded to the nearest Wi-Fi Access Point and use its leftover capacity when they are unable to satisfy their rate constraint from a single SBS. Moreover, we propose an algorithm to switch between the two schemes (cooperation and Wi-Fi offloading) to ensure maximum average user throughput in the network. This is called the Switching between Cooperation and Offloading (SCO) algorithm and it switches depending upon the network conditions. We analyze these algorithms under varying requirements of rate threshold, number of resource blocks and user density in the network. The results indicate that SCRE is more beneficial for a sparse network where it also delivers relatively higher average data rates to cell-edge users. On the other hand, SORE is more advantageous in a dense network provided sufficient leftover Wi-Fi capacity is available and more users are present in the Wi-Fi coverage area.