activity
20182022
collaborators

5 papers

cs.IT2022

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…

cs.IT2020

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…

cs.IT2019

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…

cs.IT2019

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…

cs.IT2018

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…