default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVolodymyr Shyianov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Mohamed Akrout
, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Super-Wideband Massive MIMO. IEEE J. Sel. Areas Commun. 41(8): 2414-2430 (2023)- [j4]Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Achievable Rate of Near-Field Communications Based on Physically Consistent Models. IEEE Trans. Wirel. Commun. 22(2): 1266-1280 (2023) - [c5]Bamelak Tadele, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani:
Channel Estimation with Tightly-Coupled Antenna Arrays. ICASSP 2023: 1-5 - [c4]Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Bandwidth Gain: The Missing Gain of Massive MIMO. ICC 2023: 5997-6003 - [i6]Bamelak Tadele, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani:
Channel Estimation for Multicarrier Systems with Tightly-Coupled Broadband Arrays. CoRR abs/2304.07440 (2023) - 2022
- [j3]Volodymyr Shyianov, Mohamed Akrout, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Achievable Rate With Antenna Size Constraint: Shannon Meets Chu and Bode. IEEE Trans. Commun. 70(3): 2010-2024 (2022) - [j2]Bamelak Tadele, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Ekram Hossain:
Age-Limited Capacity of Massive MIMO. IEEE Trans. Commun. 70(11): 7384-7399 (2022) - [c3]Ramzi Ayachi, Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani:
Massive Unsourced Random Access Based on Bilinear Vector Approximate Message Passing. ICASSP 2022: 5283-5287 - [c2]Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Achievable Rate of Near-Field Communications Based on Physically Consistent Models. ICC 2022: 938-943 - [c1]Bamelak Tadele, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Ekram Hossain:
Age of Information-Limited Capacity of Uncoordinated Massive Access Using Massive MIMO. WCNC 2022: 788-793 - [i5]Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Super-Wideband Massive MIMO. CoRR abs/2208.01556 (2022) - 2021
- [j1]Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Ekram Hossain:
Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO. IEEE J. Sel. Areas Commun. 39(3): 820-834 (2021) - [i4]Mohamed Akrout, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Achievable Rate of Near-Field Communications Based on Physically Consistent Models. CoRR abs/2111.08928 (2021) - 2020
- [i3]Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani, Ekram Hossain:
Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO. CoRR abs/2002.03044 (2020) - [i2]Bamelak Tadele, Volodymyr Shyianov, Faouzi Bellili, Amine Mezghani:
Age-Limited Capacity of Massive MIMO. CoRR abs/2007.05071 (2020) - [i1]Volodymyr Shyianov, Mohamed Akrout, Faouzi Bellili, Amine Mezghani, Robert W. Heath Jr.:
Achievable Rate with Antenna Size Constraint: Shannon meets Chu and Bode. CoRR abs/2011.05529 (2020)
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-04-25 05:54 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:
