![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Koosha Pourtahmasi Roshandeh
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Koosha Pourtahmasi Roshandeh
, Mostafa Mohammadkarimi
, Masoud Ardakani:
Joint Method of Moments (JMoM) and Successive Moment Cancellation (SMC) Multiuser Time Synchronization for ZP-OFDM-Based Waveforms Applicable to Joint Communication and Sensing. Sensors 23(7): 3660 (2023) - [c5]Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani:
A Low-Complexity Time Synchronization Algorithm for MIMO ZP-OFDM in Urban Impulsive Noise Environments. GLOBECOM 2023: 4211-4216 - [i4]Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani:
Maximum Likelihood Time Synchronization for Zero-padded OFDM. CoRR abs/2302.08711 (2023) - [i3]Koosha Pourtahmasi Roshandeh, Mostafa Mohammadkarimi, Masoud Ardakani:
Low Complexity Time Synchronization for Zero-padding based Waveforms. CoRR abs/2303.07453 (2023) - 2021
- [j3]Koosha Pourtahmasi Roshandeh
, Mostafa Mohammadkarimi
, Masoud Ardakani
:
Maximum Likelihood Time Synchronization for Zero-Padded OFDM. IEEE Trans. Signal Process. 69: 641-654 (2021) - 2020
- [c4]Melika Vahdat, Koosha Pourtahmasi Roshandeh, Masoud Ardakani, Hai Jiang
:
PAPR Reduction Scheme for Deep Learning-Based Communication Systems Using Autoencoders. VTC Spring 2020: 1-5
2010 – 2019
- 2018
- [j2]Koosha Pourtahmasi Roshandeh
, Masoud Ardakani, Chintha Tellambura
:
Exact Solutions for Certain Weighted Sum-Rate and Common-Rate Maximization Problems. IEEE Commun. Lett. 22(5): 1026-1029 (2018) - [c3]Koosha Pourtahmasi Roshandeh, Moslem Noori, Masoud Ardakani:
Wireless Distributed Computing: Processing Time Analysis and Optimization. TSP 2018: 1-5 - [c2]Koosha Pourtahmasi Roshandeh, Moslem Noori, Masoud Ardakani, Chintha Tellambura:
Data allocation for multi-class distributed storage systems. WCNC 2018: 1-6 - 2017
- [j1]Koosha Pourtahmasi Roshandeh, Ali Kuhestani, Masoud Ardakani, Chintha Tellambura:
Ergodic sum rate analysis and efficient power allocation for a massive MIMO two-way relay network. IET Commun. 11(2): 211-217 (2017) - [c1]Koosha Pourtahmasi Roshandeh, Moslem Noori, Masoud Ardakani, Chinthananda Tellambura:
Distributed storage allocation for multi-class data. ISIT 2017: 2223-2227 - [i2]Koosha Pourtahmasi Roshandeh, Moslem Noori, Masoud Ardakani, Chintha Tellambura:
Storage Allocation for Multi-Class Distributed Data Storage Systems. CoRR abs/1701.06506 (2017) - 2016
- [i1]Koosha Pourtahmasi Roshandeh, Masoud Ardakani, Chintha Tellambura:
A general framework for weighted sum-rate and common-rate optimization. CoRR abs/1607.00964 (2016)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint