4 citations · 5 across the 10 of their papers we have counts for
11 papers
Unsourced Random Access
Kirill Andreev, Pavel Rybin, Alexey Frolov
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transf…
On the Error-Reducing Properties of Superposition Codes
Kirill Andreev, Pavel Rybin, Alexey Frolov
Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no les…
Information Bottleneck Analysis of Deep Neural Networks via Lossy Compression
Ivan Butakov, Alexander Tolmachev, Sofia Malanchuk +3
The Information Bottleneck (IB) principle offers an information-theoretic framework for analyzing the training process of deep neural networks (DNNs). Its essence lies in tracking…
Soft-Output Deep Neural Network-Based Decoding
Dmitry Artemasov, Kirill Andreev, Pavel Rybin +1
Deep neural network (DNN)-based channel decoding is widely considered in the literature. The existing solutions are investigated for the case of hard output, i.e. when the decoder…
Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel
Anton Glebov, Pavel Rybin, Kirill Andreev +1
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to a…
Unsourced Random Access with the MIMO Receiver: Projection Decoding Analysis
Kirill Andreev, Daria Ustinova, Alexey Frolov
We consider unsourced random access with MIMO receiver - a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and der…
Coded Compressed Sensing with List Recoverable Codes for the Unsourced Random Access
Kirill Andreev, Pavel Rybin, Alexey Frolov
We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capabl…
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC
Kirill Andreev, Evgeny Marshakov, Alexey Frolov
We consider a problem of unsourced random access in the quasi-static Rayleigh fading channel. In the previous work, the authors have proposed LDPC code based solutions based on joi…
Energy efficient coded random access for the wireless uplink
Suhas S Kowshik, Kirill Andreev, Alexey Frolov +1
We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically…
Design and Decoding of Polar Codes for the Gaussian Multiple Access Channel
Evgeny Marshakov, Gleb Balitskiy, Kirill Andreev +1
Massive machine-type communications (mMTC) is one of the key application scenarios for future 5G networks. Non-orthogonal multiple access (NOMA) is a promising technique for the us…
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC
Anton Glebov, Nikolay Matveev, Kirill Andreev +2
We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted A…