default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Osinsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Alexander Osinsky
:
Low-rank Monte Carlo for Smoluchowski-class equations. J. Comput. Phys. 506: 112942 (2024)- [j11]Alexander Osinsky:
Volume-based subset selection. Numer. Linear Algebra Appl. 31(1) (2024) - [j10]Alexander Osinsky, Roman Bychkov, Mikhail Trefilov, Vladimir Lyashev, Andrey Ivanov:
Round-Off Error Analysis in mMIMO Detector Based on Cholesky Decomposition. IEEE Wirel. Commun. Lett. 13(1): 248-252 (2024) - [i8]Andrey Ivanov, Alexander Osinsky, Roman Bychkov, Vladimir Kalinin, Dmitry Lakontsev:
Trainable Least Squares to Reduce PAPR in OFDM-based Hybrid Beamforming Systems. CoRR abs/2404.02160 (2024) - [i7]Roman Bychkov, Andrey Dergachev, Alexander Osinsky, Vladimir Lyashev, Andrey Ivanov:
Virtual Sectorization to Enable Hybrid Beamforming in mm-Wave mMIMO. CoRR abs/2404.02161 (2024) - [i6]Alexander Osinsky, Roman Bychkov, Mikhail Trefilov, Vladimir Lyashev, Andrey Ivanov:
Probabilistic Examination of Least Squares Error in Low-bitwidth Cholesky Decomposition. CoRR abs/2404.05082 (2024) - [i5]Roman Bychkov, Andrey Dergachev, Alexander Osinsky, Dmitry Lakontsev, Andrey Ivanov:
Performance Analysis of Fronthaul Compression in Massive MIMO Receiver. CoRR abs/2407.16478 (2024) - [i4]Stanislav Morozov, Dmitry A. Zheltkov, Alexander Osinsky:
Accelerated alternating minimization algorithm for low-rank approximations in the Chebyshev norm. CoRR abs/2410.05247 (2024) - 2023
- [j9]Vladislav Molodtsov, Roman Bychkov, Alexander Osinsky, Dmitry Yarotsky, Andrey Ivanov:
Beamspace Selection in Multi-User Massive MIMO. IEEE Access 11: 18761-18771 (2023) - [j8]Vladislav Molodtsov, Roman Bychkov, Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Training FFT to Select Beams in Massive MIMO. IEEE Wirel. Commun. Lett. 12(6): 1017-1021 (2023) - [j7]Alexander Osinsky, Roman Bychkov, Mikhail Trefilov, Vladimir Lyashev, Andrey Ivanov:
Regularization for Cholesky Decomposition in Massive MIMO Detection. IEEE Wirel. Commun. Lett. 12(9): 1603-1607 (2023) - [i3]Alexander Osinsky:
Close to optimal column approximations with a single SVD. CoRR abs/2308.09068 (2023) - 2022
- [j6]Aleksei Kalinov, Alexander Osinsky, Sergey A. Matveev, Wendy Otieno, Nikolai V. Brilliantov:
Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics. J. Comput. Phys. 467: 111439 (2022) - 2021
- [j5]Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Efficient Performance Bound for Channel Estimation in Massive MIMO Receiver. IEEE Trans. Wirel. Commun. 20(11): 7001-7010 (2021) - [j4]Alexander Osinsky, Andrey Ivanov, Dmitry Lakontsev, Dmitry Yarotsky:
Lower Performance Bound for Beamspace Channel Estimation in Massive MIMO. IEEE Wirel. Commun. Lett. 10(2): 311-314 (2021) - [j3]Aleksei Kalinov, Roman Bychkov, Andrey Ivanov, Alexander Osinsky, Dmitry Yarotsky:
Machine Learning-Assisted PAPR Reduction in Massive MIMO. IEEE Wirel. Commun. Lett. 10(3): 537-541 (2021) - [c8]Roman Bychkov, Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Data-Driven Beams Selection for Beamspace Channel Estimation in Massive MIMO. VTC Spring 2021: 1-5 - [c7]Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Spatial Denoising for Sparse Channel Estimation in Coherent Massive MIMO. VTC Fall 2021: 1-5 - [c6]Alexander Osinsky, Roman Bychkov, Andrey Ivanov, Dmitry Yarotsky:
Adaptive Channel Interpolation in High-Speed Massive MIMO. VTC Spring 2021: 1-5 - [c5]Dmitry Yarotsky, Andrey Ivanov, Roman Bychkov, Alexander Osinsky, Andrey Savinov, Mikhail Trefilov, Vladimir Lyashev:
Machine Learning-Assisted Channel Estimation in Massive MIMO Receiver. VTC Spring 2021: 1-5 - [i2]Aleksei Kalinov, Alexander Osinsky, Sergey A. Matveev, Wendy Otieno, Nikolai V. Brilliantov:
Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics. CoRR abs/2103.09481 (2021) - 2020
- [j2]Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Bayesian Approach to Channel Interpolation in Massive MIMO Receiver. IEEE Commun. Lett. 24(12): 2751-2755 (2020) - [j1]Alexander Osinsky:
Low-rank method for fast solution of generalized Smoluchowski equations. J. Comput. Phys. 422: 109764 (2020) - [c4]Alexander Osinsky, Andrey Ivanov, Dmitry Yarotsky:
Theoretical Performance Bound of Uplink Channel Estimation Accuracy in Massive MIMO. ICASSP 2020: 4925-4929 - [c3]Andrey Ivanov, Alexander Osinsky, Dmitry Lakontsev, Dmitry Yarotsky:
High Performance Interference Suppression in Multi-User Massive MIMO Detector. VTC Spring 2020: 1-5 - [c2]Alexander Osinsky, Andrey Ivanov, Dmitry Lakontsev, Roman Bychkov, Dmitry Yarotsky:
Data-Aided LS Channel Estimation in Massive MIMO Turbo-Receiver. VTC Spring 2020: 1-5 - [i1]Andrey Ivanov, Alexander Osinsky, Dmitry Lakontsev, Dmitry Yarotsky:
High Performance Interference Suppression in Multi-User Massive MIMO Detector. CoRR abs/2005.03466 (2020)
2010 – 2019
- 2019
- [c1]Dmitry A. Zheltkov, Alexander Osinsky:
Global Optimization Algorithms Using Tensor Trains. LSSC 2019: 197-202
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-11-19 21:46 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:
