ISSN 1991-2927
 

ACP № 1 (55) 2019

Author: "Georgy Mikhailovich Tamrazian"

Georgii Mikhailovich Tamrazian, Federal Research-and-Production Center Joint Stock Company ‘Research-and-Production ‘Mars’, Postgraduate Student at the Department of Telecommunications of Ulyanovsk State Technical University; Research Engineer of Federal Research-and-Production Center Joint Stock Company ‘Research-and-Production ‘Mars’; an author of articles and patents in the field of noiseless coding. [e-mail: mars@mv.ru]G. Tamrazian

State-of-the-art Methods for Adaptive Noiseless Coding 000_6.pdf

The article proposes some optimal algorithms of redundant codes decoding with configurable characteristics by the example of Reed-Solomon (RS) codes. Error locator multinomial computing is one of the main complex and resource-intensive tasks in case of RS codes decoding. Generally, it can be computed with iBM algorithm. iBM have some disadvantages such as complex and irregular structure. Realization of the algorithm with dynamically configurable characteristics for adaptive codecs leads to the significant complexity of the decoder and increasing critical path. Time costs on the errors costs multinomial search can be reduced with the use of pipeline and parallel computations. The error locator multinomial search algorithm can be also transformed to the regular form. In the context of an appropriate composition of resolvers and some modification of iBM algorithm, the critical path length can be decreased and the algorithm performance can be advanced. The regular structure makes the usage of the algorithms possible for adaptive systems. Decoder structure regularity can be achieved with the transformation of error locator multinominal computational blocks and key equation solution to the general form. The article considers the method of construction such blocks and their usage in adaptive coding systems.

Ribm, reed-solomon codes, bch codes, berlekamp-massey algorithm, plis.ribm, soft decoding.

2016_ 2

Sections: Mathematical modeling

Subjects: Mathematical modeling, Automated control systems.


Georgii Mikhailovich Tamrazian, Ulyanovsk State Technical University, ost-Graduate Student at the Department of Telecommunications of Ulyanovsk State Technical University; graduated from Ulyanovsk State Technical University; an author of articles and patents in the field of redundant code soft decoding. [e-mail: tamrazz@bk.ru]G. Tamrazian,

Anatolii Afanasievich Gladkikh, Ulyanovsk State Technical University, Candidate of Engineering; graduated from S.M. Budyonny Military Communications Academy; finished his post-graduate studies at the same academy; Professor at the Department of Telecommunications at Ulyanovsk State Technical University; an author of a monograph, textbooks, articles, and patents in the field of noiseless coding and information security. [e-mail: a.gladkikh@ulstu.ru]A. Gladkikh,

Dmitrii Vladimirovich Ganin, Nizhny Novgorod State University of Engineering and Economics, Candidate of Economics, Associate Professor; graduated from Nizhny Novgorod State Agricultural Academy; Head of the Department of Infocommunication Technologies and Telecommunications at Nizhny Novgorod State University of Engineering and Economics; an author of articles in the field of infocommunications. [e-mail: ngiei135@mail.ru]D. Ganin

Hardware Implementation of the Optimal Ldpc Decoder 000_14.pdf

Low Density Parity Check (LDPC) codes become more useful in modern infocommunication systems because of their error-correcting capability. At the present time, LDPC codes have reached Shannon’s limit. Moreover, the application of such codes unlike the turbo codes don’t have any license limitations. These factors have become the cause of growing interest to LDPC codes. Despite an easy way of the codec implementation, soft decoding of LDPC codes is a complex computational process. This article deals in more detail with the main problems concerning the hardware implementation of LDPC decoder and the ways of their solving. It also demonstrates the simulation results of different ways to decoder implementation and the comparison of these ways. Furthermore, the article presents the method of LDPC codes list decoding that reduces materially computational load on decoder and speeds up its work operation. The use of various procedures and mechanisms described in the article will help to generate the optimal LDPC code decoder designed for a certain task.

Ldpc-код, ldpc code, soft decoder, fpga, cluster, tanner graph, list decoding.

2015_ 3

Sections: Electronic and electrical engineering

Subjects: Electrical engineering and electronics, Automated control systems, Architecture of ship's system.


Anatoly Afanasievich Gladkikh, Ulyanovsk State Technical University, Candidate of Engineering, graduated from S.M. Budyonny Military Communication Academy; finished his post-graduate studies at the same academy; Professor at the Department of Telecommunication of Ulyanovsk State Technical University; author of a monograph, text-books, articles, and patents in the field of noise-immune coding and information security. [e-mail: a.gladkikh@ulstu.ru]A. Gladkikh,

Ekaterina Sergeevna Baskakova, Ulyanovsk State Technical University, Post-graduate Student at the Department of Telecommunication of Ulyanovsk State Technical University; graduated from Ulyanovsk State Technical University; author of publications and patents in the field of redundant code soft-decision decoding. [e-mail: bes_forever87@mail.ru]E. Baskakova,

Alexander Alekseevich Maslov, FRPC OJSC ‘RPA ‘MARS’, Chief Designer at FRPC OJSC ‘RPA ‘MARS’, graduated from the Moscow Institute of Engineering and Physics; author of publications and patents of Russian Federation in the field of radiolocation, signal filtering methods and redundant code soft-decision decoding. [e-mail: mars@mv.ru]A. Maslov,

Georgy Mikhailovich Tamrazian, FRPC OJSC ‘RPA ‘MARS’, Post-graduate Student at the Department of Telecommunication of Ulyanovsk State Technical University; Research Engineer at FRPC OJSC ‘RPA ‘MARS’; graduated from Ulyanovsk State Technical University; author of articles in the field of redundant code soft-decision decoding. [e-mail: tamrazz@bk.ru]G. Tamrazian

Effective Decoding of Non-binary Codes Using Erased Element Provocation Method 32_13.pdf

The findings of decoding algorithms for 2D turbo-codes using a method of inner code combinations iterative transformations are presented. It provides the use of redundancy brought into the code at the border of asymptotic code’s abilities. A method of provocation is applied for the testing of final decoding result reliability. It aims to call a predictable non-binary code decoder reaction while correcting an erased code symbol with known parameters. The receiver performance increasing is provided by a fast non-binary code decoding without a trial method application while calculating error position locators.

Soft-decision decoder, iterative process, cascade turbo-code, erasure.

2013_ 2

Sections: Software and mathematical support of computers, computer systems and networks

Subjects: Mathematical modeling, Automated control systems, Electrical engineering and electronics.


© FRPC JSC 'RPA 'Mars', 2009-2018 The web-site runs on Joomla!