default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaryam Masjedi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Omid Rezaei, Maryam Masjedi, Ali Kanaani, Mohammad Mahdi Naghsh, Saeed Gazor
, Mohammad Mahdi Nayebi:
Design of a Multi-User Wireless Information and Power Transfer System Employing Either Active IRS or AF Relay. IEEE Trans. Commun. 72(4): 2370-2385 (2024)- [j8]Omid Rezaei, Maryam Masjedi, Mohammad Mahdi Naghsh, Saeed Gazor, Mohammad Mahdi Nayebi:
Cooperative Throughput Maximization in a Multi-Cluster WPCN. IEEE Trans. Green Commun. Netw. 8(4): 1505-1520 (2024) - 2023
- [i3]Omid Rezaei, Maryam Masjedi, Ali Kanaani, Mohammad Mahdi Naghsh, Saeed Gazor, Mohammad Mahdi Nayebi:
Design of a Multi-User Wireless Powered Communication System Employing Either Active IRS or AF Relay. CoRR abs/2301.00164 (2023) - 2021
- [i2]Omid Rezaei, Maryam Masjedi, Mohammad Mahdi Naghsh:
Throughput Maximization for Multi-Cluster WPCN: User Cooperation, Non-linearity, and Channel Uncertainty. CoRR abs/2112.13567 (2021)
2010 – 2019
- 2019
- [j7]Maedeh Ghorbanian, Sarineh Hacopian Dolatabadi, Maryam Masjedi, Pierluigi Siano:
Communication in Smart Grids: A Comprehensive Review on the Existing and Future Communication and Information Infrastructures. IEEE Syst. J. 13(4): 4001-4014 (2019) - [j6]Mohammad Mahdi Naghsh, Maryam Masjedi, Arman Adibi, Petre Stoica:
Max-Min Fairness Design for MIMO Interference Channels: A Minorization-Maximization Approach. IEEE Trans. Signal Process. 67(18): 4707-4719 (2019) - [i1]Mohammad Mahdi Naghsh, Maryam Masjedi, Arman Adibi, Petre Stoica:
Max-Min Fairness Design for MIMO Interference Channels: a Minorization-Maximization Approach. CoRR abs/1908.00160 (2019) - 2018
- [j5]Maryam Masjedi, Ali Mohammad Doost-Hoseini, Mohammad Mahdi Naghsh, Saeed Gazor:
Partially Blind Joint Channel Estimation and Symbol Detection in Amplify-and-Forward Two-Way Relay Systems. IEEE Trans. Commun. 66(12): 5966-5975 (2018) - 2017
- [j4]Maryam Masjedi, Ali Mohammad Doost-Hoseini, Saeed Gazor:
Optimal and simple near optimal non-coherent detection in amplify-and-forward two-way relaying over fast fading channels. IET Commun. 11(15): 2328-2335 (2017) - 2016
- [j3]Maryam Masjedi, Ali Mohammad Doost-Hoseini, Saeed Gazor:
Non-Coherent Detection and Denoise-and-Forward Two-Way Relay Networks. IEEE Trans. Commun. 64(11): 4497-4505 (2016) - [j2]Mohammad Mahdi Naghsh, Mojtaba Soltanalian, Petre Stoica, Maryam Masjedi, Björn E. Ottersten:
Efficient Sum-Rate Maximization for Medium-Scale MIMO AF-Relay Networks. IEEE Trans. Wirel. Commun. 15(9): 6400-6411 (2016) - [c1]Mohammad Mahdi Naghsh, Mojtaba Soltanalian, Petre Stoica, Maryam Masjedi, Björn E. Ottersten:
Rate optimization for massive MIMO relay networks: A minorization-maximization approach. ICASSP 2016: 3611-3615 - 2015
- [j1]Maryam Masjedi, Ali Mohammad Doost-Hoseini:
Data-assisted channel estimation and performance analysis for two-way amplify-and-forward relay networks with M-ary frequency shift keying modulation. IET Commun. 9(18): 2242-2252 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
