Sharif Digital Repository

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

A signed graph Gσ is an ordered pair (V(G),E(G)), where V(G) and E(G) are the set of vertices and edges of G, respectively, along with a map σ that signs every edge of G with +1 or −1. An eigenvalue of the associated adjacency matrix of Gσ, denoted by A(Gσ), is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. We conjectured that for every graph G≠K2,K4{e}, there is a switching σ such that all eigenvalues of Gσ are main. We show that this conjecture holds for every Cayley graphs, distance-regular graphs, vertex and edge-transitive graphs as well as double stars and paths. © 2020 Elsevier Inc  

Non-orthogonal multiple access (NOMA) is a promising scheme for the fifth generation (5G) of mobile communication systems. In this scheme, transmission to multiple users is performed on the same subchannel using superposition coding and successive interference cancellation. In this paper, we focus on a multi-cell network with two users' data traffic models, namely elastic and streaming. We exploit the NOMA scheme in order to maximize the download elastic traffic rate at cells, without degrading the download streaming traffic rates. Since elastic traffic rates at different cells are interactive, we maximize the total elastic traffic rates assuming either perfect or partial channel state... 

Non-orthogonal multiple access (NOMA) is a promising scheme for the fifth generation (5G) of mobile communication systems. In this scheme, transmission to multiple users is performed on the same subchannel using superposition coding and successive interference cancellation. In this paper, we focus on a multi-cell network with two users' data traffic models, namely elastic and streaming. We exploit the NOMA scheme in order to maximize the download elastic traffic rate at cells, without degrading the download streaming traffic rates. Since elastic traffic rates at different cells are interactive, we maximize the total elastic traffic rates assuming either perfect or partial channel state... 

In non-orthogonal multiple access (NOMA) systems, serving multiple users in shared resource blocks can allow untrusted users to overhear the messages of other users. In this context, we study a network consisting of a base station (BS), a near user and a far user, where the latter attempts to overhear the message of the former. The near user is a full-duplex (FD) node that can also act as a relay. Two operating scenarios are considered: 1) friendly jammer (FJ), where the FD node broadcasts noise for degrading the channel between the BS and the far user, while receiving data from the BS; and 2) friendly jammer relay (FJR), where, in addition to degrading the channel between the BS and the far... 

Generalized Frequency Division Multiplexing (GFDM) is a cyclic filtered multicarrier modulation that may be employed for many new wireless applications. However, due to its non-orthogonal structure, a trade-off between the complexity and error performance should be considered in the design of GFDM receivers. This study proposes an orthogonal cyclic filtered multicarrier modulation called Generalized Orthogonal Frequency Division Multiplexing (GOFDM), which is based on the cyclic Perfect Reconstruction-Quadrature Mirror Filter (PR-QMF) bank. We first derive the frequency domain matrix descriptions for GOFDM linear receivers based on which, the impact of PR-QMF bank on the GOFDM error... 

In this paper, we consider a multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in the presence of an external single-antenna eavesdropper. We study secure downlink transmission strategies. The challenge is that the multiple antenna configurations make the successive interference cancellation (SIC) condition, which is necessary for applying NOMA schemes, much complex. We formulate the transmission power minimization problem under the quality of service (QoS), SIC and secrecy constraints. In particular, the transmission power minimization problems are formulated under both perfect channel state information (CSI) and the bounded CSI error models. These problems... 

In this letter, we improve the tradeoff among the downlink (DL) rates of service providers (SPs), provided by a mobile virtual network operator (MVNO) using non-orthogonal multiple access (NOMA) technique. In this respect, NOMA provides a suitable opportunity for the MVNO to share resources among SPs more efficiently. Regarding interaction among the DL rates provided for SPs we formulate our resource allocation problem as a multiobjective optimization problem (MOOP) while taking into account user fairness. By using the weighted Tchebycheff technique, we are able to solve the formulated MOOP by considering different tradeoffs among DL rates of different SPs. Our numerical results show that by... 

In this letter, we improve the tradeoff among the downlink (DL) rates of service providers (SPs), provided by a mobile virtual network operator (MVNO) using non-orthogonal multiple access (NOMA) technique. In this respect, NOMA provides a suitable opportunity for the MVNO to share resources among SPs more efficiently. Regarding interaction among the DL rates provided for SPs we formulate our resource allocation problem as a multiobjective optimization problem (MOOP) while taking into account user fairness. By using the weighted Tchebycheff technique, we are able to solve the formulated MOOP by considering different tradeoffs among DL rates of different SPs. Our numerical results show that by... 

In this letter, we study a receiver architecture technique for joint resource allocation in a downlink (DL) multi-user multi-carrier non-orthogonal multiple access (MC-NOMA) network with simultaneous wireless information and power transfer (SWIPT). In this framework, the subcarrier set is partitioned into two groups that are assigned to perform information decoding (ID) and energy harvesting (EH) at the receiver side based on the optimization problem. This letter seeks to maximize energy harvesting while meeting a minimum data-rate requirement for each user. The underlying optimization problem is mixed-integer non-linear programming (MINLP). To that end, we employ the monotonic optimization...