default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNafiseh Shariati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j5]Mojtaba Soltanalian
, Mohammad Mahdi Naghsh, Nafiseh Shariati, Petre Stoica, Babak Hassibi:
Training Signal Design for Correlated Massive MIMO Channel Estimation. IEEE Trans. Wirel. Commun. 16(2): 1135-1143 (2017)- 2015
- [i4]Nafiseh Shariati, Dave Zachariah, Johan Karlsson, Mats Bengtsson:
Robust Optimal Power Distribution for Hyperthermia Cancer Treatment. CoRR abs/1510.05252 (2015) - 2014
- [j4]Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah:
Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO With Arbitrary Statistics. IEEE J. Sel. Top. Signal Process. 8(5): 815-830 (2014) - [j3]Nafiseh Shariati, Jiaheng Wang, Mats Bengtsson:
Robust Training Sequence Design for Correlated MIMO Channel Estimation. IEEE Trans. Signal Process. 62(1): 107-120 (2014) - [j2]Dave Zachariah, Nafiseh Shariati, Mats Bengtsson, Magnus Jansson, Saikat Chatterjee:
Estimation for the Linear Model With Uncertain Covariance Matrices. IEEE Trans. Signal Process. 62(6): 1525-1535 (2014) - [c7]Nafiseh Shariati, Dave Zachariah, Mats Bengtsson:
Minimum sidelobe beampattern design for MIMO radar systems: A robust approach. ICASSP 2014: 5312-5316 - [i3]Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah:
Low-Complexity Polynomial Channel Estimation in Large-Scale MIMO with Arbitrary Statistics. CoRR abs/1401.5703 (2014) - 2013
- [j1]Dimitrios Katselis, Cristian R. Rojas, Mats Bengtsson, Emil Björnson, Xavier Bombois, Nafiseh Shariati, Magnus Jansson, Håkan Hjalmarsson:
Training sequence design for MIMO channels: an application-oriented approach. EURASIP J. Wirel. Commun. Netw. 2013: 245 (2013) - [c6]Nafiseh Shariati, Jiaheng Wang, Mats Bengtsson:
A robust MISO training sequence design. ICASSP 2013: 4564-4568 - [c5]Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah:
Low-complexity channel estimation in large-scale MIMO using polynomial expansion. PIMRC 2013: 1157-1162 - [i2]Dimitrios Katselis, Cristian R. Rojas, Mats Bengtsson, Emil Björnson, Xavier Bombois, Nafiseh Shariati, Magnus Jansson, Håkan Hjalmarsson:
Training Sequence Design for MIMO Channels: An Application-Oriented Approach. CoRR abs/1301.3708 (2013) - [i1]Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah:
Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial Expansion. CoRR abs/1304.5940 (2013) - 2012
- [c4]Nafiseh Shariati, Jiaheng Wang, Mats Bengtsson:
On robust training sequence design for correlated MIMO channel estimation. ACSCC 2012: 504-507 - 2011
- [c3]Nafiseh Shariati, Mats Bengtsson:
How Far from Kronecker can a MIMO Channel be? Does it Matter? EW 2011 - [c2]Nafiseh Shariati, Mats Bengtsson:
Robust training sequence design for spatially correlated MIMO channels and arbitrary colored disturbance. PIMRC 2011: 1939-1943 - [c1]Nafiseh Shariati, Mats Bengtsson:
On the performance of Kronecker MIMO channel models: A semi-definite relaxation approach. WCSP 2011: 1-6
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 2025-01-07 00:55 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:
