Use Of Reed-Solomon Research Articles

Method of adaptation of cascade codes to ensure reliability of information transmission of wireless data transmission systems

The article proposes a method of structural adaptation of cascade codes, designed to ensure the specified reliability of information transmission of wireless data transmission systems in the event of interference, due to the dynamic synthesis of combined structures of cascade codes under conditions of a priori uncertainty. The essence of the method is to identify the internal structure of the code, due to which the structure of the component codes of the turbo code is determined. It was developed using the gradient method due to the implementation of a multi-step iterative procedure for finding optimal system parameters. Implementation of the method allows to ensure the reliability of information transmission of wireless data transmission systems. To check the effectiveness of the method of structural adaptation of cascade codes, a simulation model was developed in the C++ programming language in the Visual Studio 2019 software environment, and wireless data transmission systems were simulated. The simulation results show that the combined structure of building cascade codes together with OFDM technology allows you to independently adapt the coding rate of each of the coding stages depending on the results of the analysis of the reliability of information in this cascade, which leads to the provision of the specified reliability of information transmission, while the BSPD bandwidth is reduced by 4–12% against 20–35% of known results. The use of Reed-Solomon codes in a sequential cascade scheme with turbo codes due to the adaptation of the coding rate of this cascade design allows obtaining an energy gain of 0.5–0.7 dB without increasing the bandwidth of the transmission system compared to systems that use only turbo codes. The obtained results are of significant relevance and can be implemented in the development of information transmission systems to ensure the reliability of data transmission, both in peacetime and in conditions of armed aggression of the Russian Federation against Ukraine.

РОЗПОДІЛЕНЕ ЗБЕРЕЖЕННЯ ДАНИХ З ВИКОРИСТАННЯМ ЗАВАДОСТІЙКОГО КОДУВАННЯ

Проведено огляд теоретичних відомостей з теорії інформації та кодування, аналіз сучасних завадостійких кодів на предмет їх застосовності для збереження даних. Проаналізовано доцільність створення розподіленого сховища даних, основним механізмом збереження інформації якого є завадостійке кодування Ріда-Соломона.

Reed-Solomon Turbo Product Codes for Optical Communications: From Code Optimization to Decoder Design

Turbo product codes (TPCs) are an attractive solution to improve link budgets and reduce systems costs by relaxing the requirements on expensive optical devices in high capacity optical transport systems. In this paper, we investigate the use of Reed-Solomon (RS) turbo product codes for 40Gbps transmission over optical transport networks and 10Gbps transmission over passive optical networks. An algorithmic study is first performed in order to design RS TPCs that are compatible with the performance requirements imposed by the two applications. Then, a novel ultrahigh-speed parallel architecture for turbo decoding of product codes is described. A comparison with binary Bose-Chaudhuri-Hocquenghem (BCH) TPCs is performed. The results show that high-rate RS TPCs offer a better complexity/performance tradeoff than BCH TPCs for low-cost Gbps fiber optic communications.

Frequency-Hopping CDMA With Reed--Solomon Code Sequences in Wireless Communications

In this paper, we propose the use of Reed-Solomon (RS) code sequences for modulation on top of a frequency-hopping code-division multiple access (FH-CDMA). Our analysis shows that this RS/FH-CDMA scheme supports higher data rate but worse performance than the conventional -ary frequency-shift-keying FH-CDMA scheme. These two schemes provide a tradeoff between the data rate and the performance.

On the use of Reed-Solomon codes in improving digital FM transmission performance in Rayleigh fading

Reed Solomon codes with interleaving are used in a binary FM transmission affected by Rayleigh fading as encountered in land mobile radio. A new decoding algorithm is proposed which can be implemented in simple hardware. The error performance of the binary FM system with the RS code with one and two degrees of interleaving is measured. A significant reduction of error rate floor as a function of fading speed is noted and discussed. >

Performance of Reed-Solomon Coded Frequency-Hop Spread-Spectrum Communications in Partial-Band Interference

This paper is concerned with the performance of a Communications system which utilizes frequency-hop spread spectrum, diversity transmission, Reed-Solomon coding, and parallel error-correction and erasure-correction decoding. Both binary signaling and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</tex> -ary orthogonal signaling are considered. The goals are twofold. First, it is desirable to provide good performance in partial-band Gaussian noise interference by use of coding and diversity with an efficient error-correction algorithm. Second, it is necessary to totally neutralize narrow-band interference (regardless of the power level or statistical distribution of the interference) in order to have an effective spread-spectrum system. Through an analysis of the effects of partial-band interference on a frequency-hop spread-spectrum system with diversity, it is shown that the use of ReedSolomon coding with a parallel errors and erasures decoding algorithm accomplishes these goals. The paper also investigates the accuracy of the Chernoff bound as an approximation to the true performance of a frequency-hop spreadspectrum communication system with diversity; side information, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</tex> -ary orthogonal signaling, and Reed-Solomon coding. The performance results presented in the paper are based on analysis and computer evaluation. Approximate results based on the Chernoff bound are also given. It is shown that the Chernoff bound for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</tex> -ary orthogonal signaling gives a very poor approximation for many cases of interest. This is largely due to the looseness of the union bound.