?
Generalized Minimum Distance Decoder in a DHA FH OFDMA Employing Concatenated Coding
P. 15–29.
Subbotin A., Osipov D.
In what follows a coded DHA FH OFDMA employing robust reception and concatenated coding construction is considered. The problem of employing Generalized Minimum Distance decoder as an outer code decoder is considered. The effectiveness of the proposed decision is verified by means of simulation. In particular performance of the communication system under intensive mixed interference is considered.
Kowshik S., Kirill Andreev, Frolov A. et al., IEEE Transactions on Communications 2020 Vol. 68 No. 8 P. 4694–4708
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, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding ...
Added: September 9, 2023
Ovchinnikov A., Fominykh A. A., , in: 2023 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF).: IEEE, 2023. P. 1–5.
The common technique to perform decoding in channels with memory is to use interleaving, which increases both complexity and delay at the receiver. To overcome these limitations, coding scheme adaptation approaches might be used. One of the approaches is the optimization of long error-correcting codes and the modification of the decoder, taking into account the ...
Added: July 18, 2023
Царев А. С., Хайров Э. М., Гайдамака Ю. В. et al., Системы и средства информатики 2021 Т. 31 № 2 С. 16–25
Industrial Internet of Things (IIoT) is one of the key features of Industry 4.0 that stands for a new approach to design industrial processes using the latest technological advances. However, before implementing new processes, it is necessary to understand the characteristics and limitations that arise due to technical complexity of the system. To solve this ...
Added: December 12, 2022
Korolev G., Kureev A., Khorov E. et al., , in: 2021 International Conference Engineering and Telecommunication (En&T).: IEEE, 2022. P. 1–5.
© 2021 IEEE.Non-Orthogonal Multiple Access (NOMA) is a promising technology for future Wi-Fi, In uplink NOMA, stations with different channel conditions transmit simultaneously at the same frequency by splitting the signal by power level. Since Wi-Fi uses random access, the implementation of uplink NOMA in Wi-Fi faces many challenges. The paper presents a data transmission ...
Added: October 26, 2022
A. A. Ovchinnikov, Fominykh A. A., , in: 2022 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF) 30 May - 3 June 2022, St. Petersburg, Russia.: IEEE, 2022. P. 1–5.
The paper considers approaches to multistage decoding of linear codes. Cascade and iterative decoding techniques are well-known directions in coding theory. The idea of creating long codes from a combination of numerous short codes was presented in the 1950s. The paper proposes hybrid decoding algorithm that presents an approach to combine different decoding algorithms to use ...
Added: September 27, 2022
Osipov D., , in: 2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).: IEEE, 2021. P. 11–16.
Coded DHA FH OFDMA communication systems that use order statistics-based detectors are promising candidates for applications such as IoT and M2M. For the majority of order statistics-based reception techniques the high throughput coded modulation schemes development remains an open problem. In what follows a novel order-statistics based detector that outperforms the classical Maximum Rank Sum ...
Added: February 9, 2022
Ivanov F., Alexey Kreschuk, Krouk E., , in: 21th IFAC World CongressVol. 53. Issue 2.: Elsevier, 2020. P. 11108–11113.
Secret sharing schemes have been studied intensively for the last 20 years, and these schemes have a number of real-world applications. There are a number of approaches to the construction of secret sharing schemes. One of them is based on codes of forward error correction (FEC). In fact, every linear code can be used to ...
Added: October 20, 2021
Osipov D., , in: 2020 Moscow Workshop on Electronic and Networking Technologies (MWENT).: IEEE, 2020. P. 1–5.
A DHA FH OFDMA that uses order statistics- based techniques can be a very promising technique for mMTC systems. However for any case of practical interest the transmission rate of a classical DHA FH OFDMA system is relatively low due to complexity restrictions. To solve this problem a solution using concatenated coding in multiple disjoint ...
Added: May 8, 2020
Ivanov F., Rybin P., , in: Proccedings of the International Symposium on Information Theory and Its Applications (ISITA 2018).: IEEE, 2018. Ch. 1 P. 560–564.
We consider a new signal-code construction for a special class of multiple access system over vector-disjunctive channel when users transmit some vector of bits of finite length L. We propose a special encoding and decoding algorithms for such transmission scenario. Our suggested methods of encoding and decoding on one hand have acceptable complexity for a ...
Added: October 30, 2019
Zyablov V., Rybin P., Problems of Information Transmission 2009 Vol. 45 No. 3 P. 204–220
We generalize the method for computing the number of errors correctable by a low-density parity-check (LDPC) code in a binary symmetric channel, which was proposed by V.V. Zyablov and M.S. Pinsker in 1975. This method is for the first time applied for computing the fraction of guaranteed correctable erasures for an LDPC code with a ...
Added: December 11, 2017
Zyablov V., Rybin P., Problems of Information Transmission 2012 Vol. 48 No. 4 P. 297–323
A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical ...
Added: December 11, 2017
Rybin P., Zyablov V., Problems of Information Transmission 2015 Vol. 51 No. 3 P. 205–216
Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of ...
Added: December 11, 2017
Cham: Springer, 2016.
This book constitutes the proceedings of the 9th International Workshop on Multiple Access Communications, MACOM 2016, held in Aalborg, Denmark, in November 2016. The 10 full papers presented in this volume were carefully reviewed and selected from 12 submissions. They were organized in topical sections named: physical layer aspects; MAC layer aspects; and information theory. ...
Added: January 4, 2017
Osipov D., , in: Proceedings of the 8th International Workshop, MACOM 2015, Helsinki, Finland, September 3-4, 2015,Vol. 9305.: Springer, 2015. P. 101–108.
In what follows an order-statistics based single user reception in a communication system operating under multiuser interference is considered. This paper deals with the problem of finding channel capacity of the channel corresponding to the system under consideration. ...
Added: August 28, 2015
Springer, 2015.
This book constitutes the refereed proceedings of the 8th International Workshop on Multiple Access Communications, MACOM 2015, held in Helsinki, Finland, in September 2015.
The 12 full papers presented were carefully reviewed and selected from 18 submissions. They describe the latest advancements in the field of multiple access communications with an emphasis on wireless sensor networks; ...
Added: August 28, 2015
Osipov D., , in: Proceedings of the Ninth International Workshop on Coding and Cryptography, April 13-17, 2015, Paris, France.: P.: [б.и.], 2015.
Added: July 29, 2015
Osipov D., , in: Proceedings XIV International Symposium on Problems of Redundancy in Information and Control Systems (June 1-5 2014).: IEEE, 2014. P. 74 –77.
In what follows signal-code constructions employing block and convolutional nonbinary inner codes that can perform under severe jamming are proposed. Robustness of the proposed signal-code constructions to jamming is verified by means of simulation. ...
Added: July 17, 2015
Osipov D., , in: Multiple Access CommunicationsVol. 8715: 7th International Workshop, MACOM 2014, Halmstad, Sweden, August 27-28, 2014. Proceedings.: Halmstad: Springer, 2014. P. 29–34.
Future generation communication systems will have to endure interference induced by communication systems operating within the same frequency bands. Recently several coded DHA FH OFDMA systems employing rank-based detectors able to solve this problem were proposed. Unfortunately such detectors have relatively high complexity. In what follows a reduced-complexity detector using only column sorting for a ...
Added: October 29, 2014
Osipov D., Frolov A., Zyablov V., , in: Lecture Notes in Computer ScienceVol. 8072: Wireless Access Flexibility. First International Workshop, WiFlex 2013, Kaliningrad, Russia, September 4-6, 2013. Proceedings.: Berlin, Heidelberg: Springer, 2013. P. 49–57.
We consider an uncoordinated multiple-access system that employs a modulation technique, in which the probability of suppressing the signal sent by a certain user can be considered negligible, to transmit information via a wireless channel (e.g. time hopping (TH) with pulse position modulation (PPM)).This channel can be considered as an A channel (channel without intensity ...
Added: November 17, 2013
Osipov D., Lecture Notes in Computer Science 2012 Vol. 7642 LNCS P. 37–48
In what follows an upper bound for the probability of erroneous decoding in a coded DHA FH OFDMA system with a noncoherent ML detector under multitone jamming is introduced. ...
Added: February 6, 2013