Error correction schemes for digital television broadcasting

This article studies the performance of the Sliding RS Encoding (SRSE) in the transmission of streaming services in DVB-H (Digital Video Broadcasting - Transmission System for Handheld Terminals) networks. The SRSE forms part of a set of specifications called MPE-iFEC which has been recently defined in the DVB-SH (Digital Video Broadcasting - Satellite Services to Handheld Devices) standard and is fully compatible with the link layer of DVB-H. MPE-iFEC is capable of encoding information related to different datagram bursts in a jointly manner in order to counteract the long signal blockages expected in satellite reception. This is what is usually referred to as Multi-Burst Encoding (MBE) and provides a protection that extends across several time sliced bursts. MBE can also improve the reception in terrestrial networks such as DVB-H, which relay in the use of MPE-FEC (Multi Protocol Encapsulation - Forward Error Correction) for link layer protection. The SRSE employs the same Reed Solomon (RS) algorithm used in MPE-FEC and a sliding encoding mechanism in order to perform MBE. This paper evaluates the improvements that the use of SRSE can achieve over the legacy MPE-FEC using vehicular urban field measurements in a DVB-H single frequency network. The effect of the different parameters that regulate the operation of the SRSE will be evaluated and the best configurations for its use in DVB-H will be highlighted.

Higher-order modulation schemes like 8PSK combined with powerful channel coding techniques like trellis coding and conjugateness Reed-Solomon coding, have been demonstrated in the INTELSAT study INTEL-1268 to achieve a higher bandwidth efficiency compared to QPSK with conventional coding. Almost error-free transmission (BER 5 dB with QPSK modulation, rate-3/4 convolutional code conjugateness with RS code according to IESS-308 (IDR), and for E/sub b//N/sub o/>6 dB with 8PSK modulation, rate-2/3 trellis code conjugateness with a (255,235,10) RS code. The following efficiencies are obtained: QPSK: (rate 3/4 Viterbi plus RS coding). Efficiency=1.15 bit/s/Hz and 8-PSK: (rate 2/3 trellis plus RS coding). Efficiency=1.54 bit/s/Hz. The overall transmission delay for a typical 2 Mbps carrier is: QPSK: (rate 3/4 Viterbi plus RS coding). Delay=3 ms (@ 2.048 Mbps) and 8PSK: (rate 2/3 trellis plus RS coding). Delay=10 ms (@ 2.048 Mbps). The feasibility of fully software switchable and programmable QPSK/8PSK modem/codec equipment has been demonstrated. Price estimates for this switchable QPSK/8PSK modem/codec equipment show excellent price/performance ratios for this new type of equipment.

This paper presents a comprehensive analysis and implementation of various error correction coding methods, focusing on Reed-Solomon (RS) codes and Liberation codes in RAID6 systems. RS codes are emphasized for their robust error correction capabilities, making them ideal for high-reliability environments such as enterprise data centers and mission-critical systems, where the ability to correct multiple errors or data losses is crucial. In contrast, Liberation codes are noted for their superior encoding efficiency and lower computational complexity, making them well-suited for high-performance systems with stringent speed requirements. Through experimental comparisons, this study also evaluates Cauchy Reed-Solomon (CRS) codes, EVENODD codes, and Blaum-Roth (BR) codes, identifying the strengths and weaknesses of each method in various scenarios. The findings underscore the importance of selecting the appropriate coding technique based on system-specific requirements, as different use cases benefit from different error correction schemes in terms of performance and data reliability. Additionally, this research highlights the potential of these coding methods in broader distributed storage applications and discusses the trade-offs between them. Future research directions are suggested, particularly in optimizing existing codes and expanding their application in more complex and distributed storage environments.

The aim of this project was to investigate and implement Soft In Soft Out decoder based on Reed Solomon Codes. This type of error correction is widely used in data communication applications, such as Digital Video Broadcast (DVB), optical carriers and Space Data Systems (CCSDS) primary choice is RS Codes by Consultative committee for deep space communications signal error correction.

RS (Reed - Solomon) code is used in DVB-H (digital video broadcasting - handheld) system as an addtional error correcting code to improve the performance during mobile reception. LDPC (low density parity check) code which is rediscovered recently shows the astonishing performance. Therefore LDPC code can be used to replace RS code in order to improve the performance further since both of them are block codes. So the performance of LDPC code in MPE-FEC (multi protocol encapsulation - forward error correction) frame of DVB-H system is analyzed in this paper.

In the field of military wireless communication, digital signals will generate bit errors due to various interferences in the process of channel transmission. In order to improve the communication quality and ensure the correctness and reliability of the communication, the method of error control is usually used for error correction. Error control often adopts the technology of error correction code, which improves the reliability of information transmission by adding redundant information to the effective information code stream. RS code is a typical error correction code with strong error correction ability, which can correct both random errors and burst errors. On this basis, this paper studies the basic rules of RS code construction, designs a new type of codec system circuit for RS (35,27) code, and finally uses hardware description language to design the encoder and decoder, implementation and simulation verification. It has been verified that the RS encoding, and decoding system is stable and reliable, has excellent performance, strong error correction ability, strong scalability, and has a broad application space.

In this chapter, we describe different forward error correction (FEC) schemes currently in use or suitable for use in optical communication systems. We start with the description of standard block codes. The state-of-the-art in optical communication systems standardized by the ITU employ concatenated Bose–Chaudhuri–Hocquenghem (BCH)/RS codes [1, 2]. The RS(255,239), in particular, has been used in a broad range of long-haul communication systems [1, 2], and it is commonly considered as the first-generation of FEC [3, 4]. The elementary FEC schemes (BCH, RS, or convolutional codes) may be combined to design more powerful FEC schemes, e.g., RS(255,239) + RS(255,233). Several classes of concatenation codes are listed in ITU-T G975.1. Different concatenation schemes, such as the concatenation of two RS codes or the concatenation of RS and convolutional codes, are commonly considered as second generation of FEC [3, 4].

Forward error correction (FEC) is a key capability in modern satellite communications that provide the system designer with the needed flexibility to comply with the different applications' requirements. Reed-Solomon (RS) codes are well known for their ability to optimize between the system power, bandwidth, data rate, and the quality of service. This paper introduces an efficient decoding scheme for decoding the RS codes adhering to the Consultative Committee for Space Data Systems (CCSDS) standards based on Justesen's construction of concatenation. To maintain the standard output size, the proposed scheme first encodes every m - 1 bits using the single-parity-check (SPC) code, while the RS code encodes K SPC codewords into N symbols that are of the same size as CCSDS standard. Decoding on the inner SPC code is based on maximum-likelihood decoding Kaneko algorithm, while for the proposed coding scheme, the reduced test-pattern Chase algorithm is adapted for decoding the outer RS code. The simulation results show the coding gains of 1.4 and 7 dB compared with the algebraic decoding of RS codes over the AWGN and Rayleigh fading channels, respectively. Moreover, the adopted reduced test-pattern Chase algorithm for decoding the RS code achieves an overall complexity reduction of 40% compared with the conventional Chase decoding algorithm.

In Middle school, spoken language is paid less attention to by the teacher, which causes many students cannot recognize whether they have made mistakes in pronunciation. It’s inevitable for students to have errors in speaking. However, the teacher should take proper measures to correct students’ errors and cannot ignore them based on teaching objectives and the severity of errors. This study takes the method of specific case analysis and error analysis. The paper introduces the types and source of errors, the principles of error correction and strategies for error correction in English class.

In this paper, a blind reconstruction method of Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes is proposed, which aims to reconstruct the generator polynomials of BCH and RS codes from the intercepted noisy bitstream in non-cooperative environments. The previous blind reconstruction methods try to select correct (or noiseless) codewords or extract code information from the received bitstream. However, they need to have sufficiently correct codewords for successful reconstruction. Therefore, the existing methods are highly dependent on the channel conditions because a sufficient number of correct codewords should be available for achieving good reconstruction performance. To overcome such high dependency on channel conditions, the proposed blind reconstruction method performs error correction of single-error codewords through the proposed single-error correction method (SCM). Then, both the correct codewords and the corrected single-error codewords are utilized for blind reconstruction. Specifically, the correct codewords are selected based on the algebraic property of BCH and RS codes that codeword polynomials have consecutive roots. At the same time, the codewords presumably with a single error are selected and corrected based on the fact that the most of BCH and RS codeword polynomials with either a single error or double errors do not have consecutive roots. Based on this fact, SCM is devise, which selects and corrects the codewords with a single error with high probability. Finally, it is verified that the proposed blind reconstruction method shows much better reconstruction performance by using only one-tenth of the received codewords compared to the existing best methods even under harsh channel conditions.

One of the approaches to organization of error correcting coding for multilevel flash memory is based on concatenated construction, in particular, on multidimensional lattices for inner coding. A characteristic feature of such structures is the dominance of the complexity of the outer decoder in the total decoder complexity. Therefore the concatenated construction with low-complexity outer decoder may be attractive since in practical applications the decoder complexity is the crucial limitation for the usage of the error correction coding.
 We consider a concatenated coding scheme for multilevel flash memory with the Barnes-Wall lattice based codes as an inner code and the Reed-Solomon code with correction up to 4…5 errors as an outer one.
 Performance analysis is fulfilled for a model characterizing the basic physical features of a flash memory cell with non-uniform target voltage levels and noise variance dependent on the recorded value (input-dependent additive Gaussian noise, ID-AGN). For this model we develop a modification of our approach for evaluation the error probability for the inner code. This modification uses the parallel structure of the inner code trellis which significantly reduces the computational complexity of the performance estimation. We present numerical examples of achievable recording density for the Reed-Solomon codes with correction up to four errors as the outer code for wide range of the retention time and number of write/read cycles.

In recent years, conveying information using molecules via diffusion has attracted significant interest in micro and nanoscale applications. Yet, very little research have been conducted on the performance analysis of large-scale molecular communication (MC) systems with swarm of interfering receivers. In this type of MC system, the collective signal strength at a desired receiver can be impaired by the interference caused by other MC transmitters. The paper presents the first tractable analytical framework for the collective signal strength at a partially absorbing receiver due to a desired transmitter under the impact of a swarm of interfering transmitters in a three-dimensional (3D) large-scale MC system using stochastic geometry. We propose Reed Solomon (RS) coding as an error correction technique to combat the effects of interference caused by the multiple transmitters and the delayed molecules from the previous bits. We derive analytical expressions for the bit error probability (BEP) to evaluate the level of reliability that can be achieved by the proposed scheme. The results obtained using Monte Carlo simulations, matched extactly with the anlytical results, justifying the accuracy of the derivations. Results reveal that the RS codes are capable of providing an acceptable level of improvement in terms of BEP. Furthermore, by carefully selecting the code length, n, and the message length, k, of the RS(n, k) code, we can fine tune the BEP improvement to match the system requirements.

Fading in mobile satellite communications severely degrades the performance of data transmission. The emphasis in this paper is on the performance of uncoded and coded FCMA (frequency comb multiple access) in the fading environment. The channel is modeled with nonfrequency selective Rician and Rayleigh fading using noncoherent demodulation with Reed-Solomon (RS) codes and hard decision decoding. Berlekamp-Massey decoding of RS codes is used to compensate for the fading. The bit error rate (BER) after decoding is calculated for specific codes and for different values of Rician channel parameters. The results of this paper are obtained by simulation techniques. They show that substantial coding gains are obtained compared to the uncoded reference system. They are also useful as reference for validating the results of simulation studies.

Recently DLR has developed and constructed a new experimental radar instrument [5] for various applications such as radar signature collection, synthetic aperture radar/inverse synthetic aperture radarimaging, motion detection, tracking, etc., where high performance and high flexibility have been the key drivers for system design. Consequently the multi-purpose and multi-channel radar called GigaRad is operated in X and Ku band and allows an overall bandwidth of up to 6 GHz, resulting in a theoretical range resolution of up to 2.5 cm. Hence, primary obligation is a detailed analysis of various possible error sources, being of no or less relevance for low-resolution systems. A high degree of digital technology enables advanced signal processing and error correction to be applied. The paper outlines main technical features of the radar system, the basic error correction and absolute calibration strategy, frequency limitations, and illustrates some imaging results.

Forward Error Correction code (FEC) is important for Wireless Communication and Cryptography applications to perform the Error Detection and Correction (EDC) mechanisms. FEC codes are classified into two types such as Convolutional code and Block code. Various FEC codes can be used in Wireless Communication likes Viterbi code, Reed Solomon code, Golay, BCH, Multidimensional parity, Hamming code and LDPC codes. In this paper, an analysis between Reed Solomon code, Bose, Chaudhuri, and Hocquenghem (BCH) code and LDPC codes are presented. A Low Density Parity Check (LDPC) code provides low area and high speed than all other codes. Simulation is carried out by ModelSim6.3C and Synthesis is carried out by Xilinx10.1.