default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammadamin Baniasadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Yu Chen
, Mohammadamin Baniasadi, Majid Safari:
On Optimally Shaped Signals for Nonlinear Frequency Division Multiplexed Fiber Systems. IEEE Trans. Commun. 71(9): 5379-5391 (2023)- [c9]Mohammadamin Baniasadi, Yu Chen, Alex Dytso, Luca Barletta, Majid Safari:
A Lower Bound on the Capacity of $b-\text{Modulated}$ NFDM Systems. GLOBECOM 2023: 4399-4404 - 2022
- [j2]Mohammadamin Baniasadi, Erman Koken, Ertem Tuncel:
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile. IEEE Trans. Inf. Theory 68(12): 7702-7713 (2022) - [c8]Yu Chen, Mohammadamin Baniasadi, Majid Safari:
Optimal Shaping Gains for Continuous Spectrum Nonlinear Frequency Signalling over Long Fibers. ISIT 2022: 1927-1932 - [c7]Mohammadamin Baniasadi, Yu Chen, Majid Safari:
On the Capacity of b-Modulated Nonlinear Frequency Division Multiplexing. ISIT 2022: 1933-1938 - 2021
- [c6]Mohammadamin Baniasadi, Ertem Tuncel:
Robust Gaussian JSCC Under the Near-Infinity Bandwidth Regime with Side Information at the Receiver. ISIT 2021: 2423-2428 - 2020
- [j1]Ali Pourranjbar, Mohammadamin Baniasadi, Aliazam Abbasfar, Georges Kaddoum:
A Novel Distributed Algorithm for Phase Synchronization in Unmanned Aerial Vehicles. IEEE Commun. Lett. 24(10): 2260-2264 (2020) - [c5]Mohammadamin Baniasadi, Ertem Tuncel:
Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime. ISIT 2020: 2474-2479 - [c4]Mohammadamin Baniasadi, Ertem Tuncel:
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding with a Square-Law Profile. ISITA 2020: 51-55 - [i3]Mohammadamin Baniasadi, Ertem Tuncel:
Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime. CoRR abs/2001.06507 (2020) - [i2]Mohammadamin Baniasadi:
Robust Gaussian Joint Source-Channel Coding with a Staircase Distortion-Noise Profile. CoRR abs/2001.09370 (2020)
2010 – 2019
- 2019
- [i1]Mohammadamin Baniasadi, Ertem Tuncel:
Minimum Energy for Gaussian Joint source-channel Coding with a Square-law Distortion-Noise Profile. CoRR abs/1908.01463 (2019) - 2017
- [c3]Masoud Attarifar, Mohammadamin Baniasadi:
JPEG Image Security by Block Size Estimation and Quality Factor Classification. CyberC 2017: 118-121 - 2016
- [c2]Mohammadamin Baniasadi, Behrouz Maham, Harried Kebriaei:
Power control for D2D underlay cellular communication: Game theory approach. IST 2016: 314-319 - [c1]Hamed Hosseiny, Mohammadamin Baniasadi, Vahid Shah-Mansouri, Mohammad Ghanbari:
Power allocation for statistically delay constrained video streaming in femtocell networks based on Nash Bargaining game. PIMRC 2016: 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 2024-08-05 20:15 CEST 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:
