Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Animesh Yadav is active.

Publication


Featured researches published by Animesh Yadav.


IEEE Journal on Selected Areas in Communications | 2017

Capacity Comparison Between MIMO-NOMA and MIMO-OMA With Multiple Users in a Cluster

Ming Zeng; Animesh Yadav; Octavia A. Dobre; Georgios I. Tsiropoulos; H. Vincent Poor

In this paper, the performance of multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) is investigated, when multiple users are grouped into a cluster. The superiority of MIMO-NOMA over MIMO-OMA in terms of both sum channel capacity and ergodic sum capacity is proved analytically. Furthermore, it is demonstrated that the more users are admitted to a cluster, the lower is the achieved sum rate, which illustrates the tradeoff between the sum rate and maximum number of admitted users. On this basis, a user admission scheme is proposed, which is optimal in terms of both sum rate and the number of admitted users when the signal-to-interference-plus-noise ratio thresholds of the users are equal. When these thresholds are different, the proposed scheme still achieves good performance in balancing both criteria. Moreover, under certain conditions, it maximizes the number of admitted users. In addition, the complexity of the proposed scheme is linear in the number of users per cluster. Simulation results verify the superiority of MIMO-NOMA over MIMO-OMA in terms of both sum rate and user fairness, as well as the effectiveness of the proposed user admission scheme.


IEEE Wireless Communications Letters | 2017

On the Sum Rate of MIMO-NOMA and MIMO-OMA Systems

Ming Zeng; Animesh Yadav; Octavia A. Dobre; Georgios I. Tsiropoulos; H. Vincent Poor

In this letter, the performance of non-orthogonal multiple access (NOMA) is compared with conventional orthogonal multiple access (OMA) over multiple-input multiple-output (MIMO) channels. It is proved analytically that for a simple scenario of two users, MIMO-NOMA dominates MIMO-OMA in terms of both sum rate and ergodic sum rate. Furthermore, for a more practical scenario of multiple users, with two users paired into a cluster and sharing a common transmit beamforming vector, the conclusion still holds. Numerical simulations are conducted, which corroborate the analytical findings.


IEEE Transactions on Wireless Communications | 2016

Resource Allocation in Two-Tier Wireless Backhaul Heterogeneous Networks

Tri Minh Nguyen; Animesh Yadav; Wessam Ajib; Chadi Assi

This paper studies two-tier heterogeneous cellular networks, with wireless backhaul communication, consisting of macrocell and small cell tiers. A joint design of transmit beamforming, power allocation, and bandwidth partitioning for both uplink and downlink transmissions is considered. By assuming the reverse time division duplexing system, we propose a strategy to partition the bandwidth for two consecutive time slots by two separate partitioning factors. Under the proposed strategy, we formulate a constrained optimization problem with the objective of maximizing the sum rate of small cell uplink and downlink. For this non-convex problem, we leverage the sequential parametric convex approximation method to find the stationary point of the problem. In this method, a convex approximation of the problem is solved at each iteration. Furthermore, with appropriate transformations, we approximate the problem as second-order cone programming (SOCP) and propose a fast converging algorithm to attain the solution. We also evaluate the impact of imperfect channel state information by reformulating the optimization problem and applying the proposed algorithm to solve it. We conduct numerical simulations to show that the joint design of transmit beamforming, power allocation, and bandwidth partitioning leads to a better resource utilization and high spectral efficiency. Moreover, our results show that the proposed SOCP-based algorithm converges fast to a solution, which is shown to be closer to the global optimal solution achieved by the branch-and-bound algorithm compared with other works.


international conference on communications | 2015

Novel retransmission scheme for energy harvesting transmitter and receiver

Animesh Yadav; Mathew Goonewardena; Wessam Ajib; Halima Elbiaze

We consider a point-to-point wireless link with automatic repeat request (ARQ) based packet transmission where both the transmitter and receiver nodes are energy harvesting (EHNs). Transmitter EHN has access to low-grade channel state information (CSI) as it is implicitly obtained from ARQ feedback. Furthermore, signal processing tasks such as sampling and decoding at the receiver EHN can be interrupted if there is insufficient energy in the battery that cause loss of packet and wastage of harvested energy both at the transmitter and receiver EHNs. We propose selective sampling (SS) scheme where only part of the transmitted packet is sampled and stored depending on the receiver nodes stored energy. SS information (SSI) is then fed back to the transmitter. Packet decoding is not performed until full packet is constructed. Hence, we modify the conventional ARQ messages, i.e., ACK/NAK by adding few more bits to carry additional SSI as well. Another objective is to find the optimal power allocation policy to adapt to the low-grade CSI and SSI available at the transmitter such that harvested energy can be utilized efficiently especially at the receiver. Furthermore, using a decision-theoretic framework, we propose greedy power allocation scheme to evaluate the performance of the proposed retransmission scheme. In numerical examples, we illustrate that our proposed scheme has lower average packet transmission time and packet drop probability (PDP) compared to the equal power allocation and greedy power allocation with conventional retransmission scheme.


IEEE Transactions on Communications | 2012

Cutoff Rate Optimized Space-Time Signal Design for Partially Coherent Channel

Animesh Yadav; Markku J. Juntti; Jorma Lilleberg

Space-time (ST) constellations for multiple-input multiple-output (MIMO) systems have usually been designed assuming either perfect or no channel state information (CSI) at the receiver. Practical systems are often partially coherent, i.e., have imperfect receiver CSI. In this paper, we consider the partially coherent ST code and constellation design for MIMO systems in Rayleigh fading channels while keeping the communication resource (i.e., power and rate) allocation to the training symbols minimum. As a result receiver acquires an imperfect CSI estimate, which is Gaussian random variable with zero mean and a non-zero variance, while the transmitter has perfect knowledge of the CSI estimation variance available via feedback. We propose to use the cutoff rate (CR) with respect to signal points as the design criterion. The CR expression is first derived. The CR maximization problem is formulated and numerical optimization algorithms are proposed. Constraints on the peak-to-average power ratio (PAPR) are also introduced. Numerical examples show that the designed constellations outperform earlier ones with respect to the PAPR, mutual information between the channel input and output as well as symbol error rate (SER) especially at low or medium signal-to-noise ratio (SNR) regime.


global communications conference | 2016

Energy Efficiency with Adaptive Decoding Power and Wireless Backhaul Small Cell Selection

Tri Minh Nguyen; Animesh Yadav; Wessam Ajib; Chadi Assi

This paper considers the problem of maximizing energy efficiency on the downlink of two-tier wireless backhaul small cell heterogeneous networks, where an interference mitigation strategy that combines reverse time division duplexing and equally orthogonal spectrum splitting is proposed. By enabling the small cell access points with the capability of switching ON/OFF, we develop a joint design of transmit beamforming, power and small cell selection that maximizes the proposed weighted access energy efficiency metric. To better convey the total power consumption model, we assume the adaptive decoding power model at each small cell access point. The formulated problem is combinatorial and non-convex, which is NP-hard in general. Hence, to find a more realistic close-to-optimal feasible solution, we iteratively approximate the non-convex constraints in the formulated problem as second order cone ones based on the first order Taylor convex approximation and error-controlled second order cone approximation. The problem arrived at each iteration is a mixed integer second order cone programming, which can be solved optimally and efficiently by available dedicated solver to achieve the final result at convergence. Numerical results are studied to show the improvement of our proposed model compared to previous works.


IEEE Transactions on Wireless Communications | 2014

Linear Precoder Design for Doubly Correlated Partially Coherent Fading MIMO Channels

Animesh Yadav; Markku J. Juntti; Jorma Lilleberg

We consider the single-user multiple-input multiple-output (MIMO) precoder design problem for the doubly spatially correlated partially coherent Rayleigh fading channels with discrete inputs. The objective is to design a linear precoder to adapt to the degradation caused by the imperfect channel estimation at the receiver and the transmit-receive antenna correlation. The system is partially coherent so that the MIMO channel coefficients are estimated at the receiver and its error covariance matrix is fed back to the transmitter. We utilized the cutoff rate (CR) expression, an alternative to the mutual information (MI), and propose to use it as a design criterion to design the linear precoders. A linear precoder is obtained by numerically maximizing the CR with respect to the precoder matrix with a given average power constraint. Furthermore, the precoder matrix is decomposed using singular value decomposition (SVD) into the input shaping matrix, power loading matrix, and beamforming matrix. The beamforming matrix is found to coincide with the eigenvectors of the transmit correlation matrix. The power loading and input shaping matrices are solved numerically using the difference of convex (d.c.) functions programming algorithm and optimization under the unitary constraint, respectively. A 2-block alternating optimization (AO) algorithm is proposed to solve the input shaping matrix and power loading matrix iteratively. Precoders are designed to be used in conjunction with two MIMO transmission schemes: the spatial multiplexing (SM) and space-time (ST) block transmission modes. The frame error rate (FER) and average MI are used as the performance metrics to validate the performance of the newly designed CR-precoders in comparison with the conventional no-precoding case and cutoff rate optimized partially coherent constellations (PCCs). Numerical examples show that the performance gains of the designed precoders are significant compared to the CR-PCCs and conventional codewords.


IEEE Transactions on Communications | 2013

Partially Coherent Constellation Design and Bit-Mapping with Coding for Correlated Fading Channels

Animesh Yadav; Markku J. Juntti; Jorma Lilleberg

The space-time (ST) constellation design problem and the related bit mapping schemes for multiple-input multipleoutput (MIMO) systems in spatially correlated Rayleigh fading channels with imperfect channel estimation at the receiver are considered. We assume that the channel estimation error covariance matrix, as well as transmit and receive correlation matrices are perfectly known both at the transmitter and at the receiver. We derive the cutoff rate (CR) and an upper bound (UB) on the average bit error probability (ABEP) expression for spatially correlated channels and propose them as the constellation design criteria subject to a given average transmit power constraint. Additionally, to use the resulting constellations together with forward error correction (FEC) codes requires efficient bit mapping schemes. Because these constellations lack geometrical symmetry in general, the Gray mapping is not always possible in the majority of the constellations obtained. Moreover, different mapping schemes may lead to highly different bit error rate (BER) performances. Thus, an efficient bit mapping scheme called the modified binary switching algorithm (MBSA) is proposed. It minimizes an upper bound on the ABEP (UB-ABEP) and is used to find the bit mapping schemes. Numerical examples show that the designed constellation and its optimized bit mapping together with turbo codes outperform the conventional constellations with respect to the frame error rate (FER).


IEEE Wireless Communications | 2017

Cooperation in 5G HetNets: Advanced Spectrum Access and D2D Assisted Communications

Georgios I. Tsiropoulos; Animesh Yadav; Ming Zeng; Octavia A. Dobre

The evolution of conventional wireless communication networks to 5G is driven by an explosive increase in the number of wireless mobile devices and services, as well as their demand for any time and everywhere connectivity, high data rates, low latency, high energy efficiency, and improved quality of service. To address these challenges, 5G relies on key technologies, such as full duplex, D2D communications, and network densification. In this article, a heterogeneous networking architecture is envisioned, where cells of different sizes and radio access technologies coexist. Specifically, collaboration for spectrum access is explored for both full-duplex and cognitive-based approaches, and cooperation among devices is discussed in the context of the state-ofthe- art D2D assisted communication paradigm. The presented cooperative framework is expected to advance the understandings of the critical technical issues toward dynamic spectrum management for 5G heterogeneous networks.


wireless communications and networking conference | 2009

Combating Timing Asynchronism in Relay Transmission for 3GPP LTE Uplink

Animesh Yadav; Markku J. Juntti; Juha Karjalainen

Relays are used between the source and the destination to improve network coverage and reliability in cooperative relay system. Imperfect time delay synchronization at the receiver arises because of time difference in propagation of the signals from the source and the relay to the receiver. The performance degrades due to interference from the previous block and the defective channel matrix. In this paper, we study the effect of time delay asynchronism and propose to use interblock interference cancelation and cyclic prefix reconstruction techniques on amplify and forward relay based distributed space-time block coding for single carrier-frequency domain equalization system, which removes the unwanted interference part and reconstructs the defective channel matrix to circulant one. The proposed method significantly reduces the effect of time delay asychronism at the receiver without disturbing the 3rd generation partnership project-long term evolution (3GPP LTE) uplink frame structure, data rate and increasing the complexity over frequency selective channels.

Collaboration


Dive into the Animesh Yadav's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Wessam Ajib

Université du Québec à Montréal

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ming Zeng

St. John's University

View shared research outputs
Top Co-Authors

Avatar

Mathew Goonewardena

École de technologie supérieure

View shared research outputs
Top Co-Authors

Avatar

Georgios I. Tsiropoulos

National Technical University of Athens

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Tri Minh Nguyen

École de technologie supérieure

View shared research outputs
Top Co-Authors

Avatar

Halima Elbiaze

Université du Québec à Montréal

View shared research outputs
Researchain Logo
Decentralizing Knowledge