arXiv subjects

Kirill Ivanov

Publications and source records attributed to Kirill Ivanov.

14 recordsLinked to original sources

arXiv2026

AI/ML based Joint Source and Channel Coding for HARQ-ACK Payload

Channel coding from 2G to 5G has assumed the inputs bits at the physical layer to be uniformly distributed. However, hybrid automatic repeat request acknowledgement (HARQ-ACK) bits transmitted in the uplink are inherently non-uniformly distributed. For such sources, significant performance gains could be obtained by employing joint source channel coding, aided by deep learning-based techniques. In this paper, we learn a transformer-based encoder using a novel "free-lunch" training algorithm and propose per-codeword power shaping to exploit the source prior at the encoder whilst being robust to small changes in the HARQ-ACK distribution. Furthermore, any HARQ-ACK decoder has to achieve a low negative acknowledgement (NACK) error rate to avoid radio link failures resulting from multiple NACK errors. We develop an extension of the Neyman-Pearson test to a coded bit system with multiple information bits to achieve Unequal Error Protection of NACK over ACK bits at the decoder. Finally, we apply the proposed encoder and decoder designs to a 5G New Radio (NR) compliant uplink setup under a fading channel, describing the optimal receiver design and a low complexity coherent approximation to it. Our results demonstrate 3-6 dB reduction in the average transmit power required to achieve the target error rates compared to the NR baseline, while also achieving a 2-3 dB reduction in the maximum transmit power, thus providing for significant coverage gains and power savings.

eess.SP↗

arXiv2025

Probabilistic Shaping in MIMO: Going Beyond 1.53dB AWGN Gain With the Non-Linear Demapper

Constellation shaping is a well-established method to improve upon a regular quadrature amplitude modulation (QAM). It is known that the gain achieved by any shaping method for an additive white Gaussian noise (AWGN) channel is upper-bounded by 1.53dB. However, the situation becomes less clear in the multiple-input and multiple-output (MIMO) setting. In this paper, we study the application of probabilistic shaping for MIMO channels. We utilize an efficient near-optimal demapper based on sphere decoding (SD) and demonstrate that it is possible to achieve more than 2dB gains, breaking the AWGN limit. It becomes possible because both signal and interference are shaped and the non-linear methods can capture this property and leverage on it to improve the demodulation performance.

cs.IT↗

arXiv2023

EVOLIN Benchmark: Evaluation of Line Detection and Association

Lines are interesting geometrical features commonly seen in indoor and urban environments. There is missing a complete benchmark where one can evaluate lines from a sequential stream of images in all its stages: Line detection, Line Association and Pose error. To do so, we present a complete and exhaustive benchmark for visual lines in a SLAM front-end, both for RGB and RGBD, by providing a plethora of complementary metrics. We have also labelled data from well-known SLAM datasets in order to have all in one poses and accurately annotated lines. In particular, we have evaluated 17 line detection algorithms, 5 line associations methods and the resultant pose error for aligning a pair of frames with several combinations of detector-association. We have packaged all methods and evaluations metrics and made them publicly available on web-page https://prime-slam.github.io/evolin/.

cs.CV↗

arXiv2022

Polar Codes Do Not Have Many Affine Automorphisms

Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research topic. However, it imposes more constraints on the code structure. In this paper, we study the structural properties of Arikan's polar codes. It is known that they are invariant under lower-triangular affine permutations among others. However, those permutations are not useful in the context of permutation decoding. We show that, unfortunately, the group of affine automorphisms of Arikan's polar codes asymptotically cannot be much bigger than the group of lower-triangular permutations.

cs.IT↗

arXiv2021

On the efficiency of polar-like decoding for symmetric codes

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacityachieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plotkin construction. The decoding algorithm can be applied with slight modifications to Reed-Muller or eBCH codes, that both achieve the capacity of erasure channels, although the list size needed for good performance grows too fast to make the decoding practical even for moderate block lengths. The key ingredient for proving the capacity-achieving property of Reed-Muller and eBCH codes is their group of symmetries. It can be plugged into the concept of Plotkin decomposition to design various permutation decoding algorithms. Although such techniques allow to outperform the straightforward polar-like decoding, the complexity stays impractical. In this paper, we show that although invariance under a large automorphism group is valuable in a theoretical sense, it also ensures that the list size needed for good performance grows exponentially. We further establish the bounds that arise if we sacrifice some of the symmetries. Although the theoretical analysis of the list decoding algorithm remains an open problem, our result provides an insight into the factors that impact the decoding complexity.

cs.IT↗

arXiv2021

Partially symmetric monomial codes

A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes and can be considered as two extreme cases. Reed-Muller codes have a large automorphism group but their low-complexity maximum likelihood decoding still remains an open problem. On the other hand, polar codes have much less symmetries but admit the efficient near-ML decoding. We study the dependency between the code symmetries and the decoding efficiency. We introduce a new family of codes, partially symmetric monomial codes. These codes have a smaller group of symmetries than the Reed-Muller codes and are in this sense "between" RM and polar codes. A lower bound on their parameters is introduced along with the explicit construction which achieves it. Structural properties of these codes are demonstrated and it is shown that they often have a recursive structure.

cs.IT↗

arXiv2020

Capacity-achieving codes: a review on double transitivity

Recently it was proved that if a linear code is invariant under the action of a doubly transitive permutation group, it achieves the capacity of erasure channel. Therefore, it is of sufficient interest to classify all codes, invariant under such permutation groups. We take a step in this direction and give a review of all suitable groups and the known results on codes invariant under these groups. It turns out that there are capacity-achieving families of algebraic geometric codes.

cs.IT↗

arXiv2020

Fast Block Sequential Decoding of Polar Codes

A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a number of outer codes, and on-demand construction of codewords of these codes in the descending order of their probability. Construction of such codewords is implemented by fast decoding algorithms, which are available for many codes arising in the decomposition of polar codes. Further complexity reduction is achieved by taking hard decisions of the intermediate LLRs, and avoiding decoding of some outer codes. Data structures for sequential decoding of polar codes are described. The proposed algorithm can be also used for decoding of polar codes with CRC and short extended BCH\ codes. It has lower average decoding complexity compared with the existing decoding algorithms for the corresponding codes. \end{abstract}

cs.IT↗

arXiv2018

KPS-1b: the first transiting exoplanet discovered using an amateur astronomer's wide-field CCD data

We report the discovery of the transiting hot Jupiter KPS-1b. This exoplanet orbits a V=13.0 K1-type main-sequence star every 1.7 days, has a mass of $1.090_{-0.087}^{+0.086}$ $M_{\mathrm{Jup}}$ and a radius of $1.03_{-0.12}^{+0.13}$ $R_{\mathrm{Jup}}$. The discovery was made by the prototype Kourovka Planet Search (KPS) project, which used wide-field CCD data gathered by an amateur astronomer using readily available and relatively affordable equipment. Here we describe the equipment and observing technique used for the discovery of KPS-1b, its characterization with spectroscopic observations by the SOPHIE spectrograph and with high-precision photometry obtained with 1-m class telescopes. We also outline the KPS project evolution into the Galactic Plane eXoplanet survey (GPX). The discovery of KPS-1b represents a new major step of the contribution of amateur astronomers to the burgeoning field of exoplanetology.

astro-ph.EP↗

arXiv2017

Combining Thesaurus Knowledge and Probabilistic Topic Models

In this paper we present the approach of introducing thesaurus knowledge into probabilistic topic models. The main idea of the approach is based on the assumption that the frequencies of semantically related words and phrases, which are met in the same texts, should be enhanced: this action leads to their larger contribution into topics found in these texts. We have conducted experiments with several thesauri and found that for improving topic models, it is useful to utilize domain-specific knowledge. If a general thesaurus, such as WordNet, is used, the thesaurus-based improvement of topic models can be achieved with excluding hyponymy relations in combined topic models.

cs.CL↗

arXiv2011

Robotic optical telescopes global network MASTER II. Equipment, structure, algorithms

Presented paper describes the basic principles and features of the implementation of a robotic network of optical telescopes MASTER, designed to study the prompt (simultaneous with gamma radiation) optical emission of gamma-ray bursts and to perform the sky survey to detect unknown objects and transient phenomena. With joint efforts of Sternberg astronomical institute, High altitude astronomical station of the Pulkovo observatory, Ural state university, Irkutsk state university, Blagoveshchensk pedagogical university, the robotic telescopes MASTER II near Kislovodsk, Yekaterinburg, Irkutsk and Blagoveshchensk were installed and tested. The network spread over the longitudes is greater than 6 hours. A further expansion of the network is considered.

astro-ph.IM↗

arXiv2009

Transient detections and other real-time data processing from wide-field chambers MASTER-VWF

At present time Robotic observatory making is of current importance. Having a large field of view and being able to point at anywhere, Robotic astronomical systems are indispensable when they looking for transients like grb, supernovae explosions, novae etc, as it's impossible in these cases to foresee what you should point you telescope at and when. In work are described prompt GRB observations received on wide-field chambers MASTER-VWF, and also methods of the images analysis and transients classifications applied in real-time data processing in this experiment. For 7 months of operation 6 synchronous observations of gamma-ray burst had been made by MASTER VWF in Kislovodsk and Irkutsk. In all cases a high upper limits have been received (see tabl \ref {tab_grbwf} and fig. \ref {allgrb}).

astro-ph.IM↗

arXiv2009

Master Robotic Net

The main goal of the MASTER-Net project is to produce a unique fast sky survey with all sky observed over a single night down to a limiting magnitude of 19 - 20mag. Such a survey will make it possible to address a number of fundamental problems: search for dark energy via the discovery and photometry of supernovas (including SNIa), search for exoplanets, microlensing effects, discovery of minor bodies in the Solar System and space-junk monitoring. All MASTER telescopes can be guided by alerts, and we plan to observe prompt optical emission from gamma-ray bursts synchronously in several filters and in several polarization planes.

astro-ph.HE↗

arXiv2009

MASTER prompt and follow-up GRB observations

There are the results of gamma-ray bursts observations obtained using the MASTER robotic telescope in 2007 - 2009. We observed 20 error-boxes of gamma-ray bursts this period.The limits on their optical brightnesses have been derived. There are 5 prompt observations among them, obtained at our very wide field cameras. Also we present the results of the earliest observations of the optical emission of the gamma-ray bursts GRB 050824 and GRB 060926.

astro-ph.HE↗