Nele Noels, Marc Moeneclaey · Conference record/Conference record - Asilomar Conference on Signals, Systems, & Computers · 2007
This contribution briefly summarizes the authors' previous work on iterative carrier synchronization in transmission systems protected by a powerful error-correcting code. It is shown how maximum-likelihood estimation theory can be used to derive code-aided synchronization structures that are well suited for application in receivers with iterative maximum-a- posteriori bit detection. Simulation results for a turbo-coded system indicate that the proposed joint carrier synchronization and bit detection algorithms yield a lower mean square estimation error than traditional carrier synchronization techniques, and a small bit error rate degradation as compared to a perfectly synchronized receiver.
Cited by 0
이선용 · Seoul National University Open Repository (Seoul National University) · 2024
This dissertation encompasses three main research areas: i) the design methodology of codebooks for error correcting output code (ECOC) networks using low-density parity-check (LDPC) codes, ii) mitigation of class unfairness issues in ECOC networks, and iii) parameter optimization in the design of binary neural networks (BNN) using Fourier series representation.Firstly, a method for designing LDPC codes for ECOC networks through performance analysis using EXIT is proposed.Replacing the conventional use of Hadamard codes in ECOC networks, the LDPC-based ECOC networks allows for a scalable design over various numbers of binary classifiers and classes.LDPC-based ECOC networks have fast decoding performance and near-maximum likelihood decoding accuracy.For the cases of large number of class, this dissertation presents the optimization of LDPC codes for use in ECOC networks, utilizing extrinsic information transfer analysis and various version of the differential evolution method.Secondly, the issue of unfairness in adversarial classification within ECOC networks is addressed.The dissertation identifies class classification unfairness issues arising in ECOC networks and introduces cost-sensitive learning for fairness to alleviate performance disparities across classes.Thirdly, the dissertation designs a network using Fourier series representations for binary neural networks and optimizes the parameters used in the Fourier series representations.Optimizing parameters enhances the performance of the BNN networks utilizing Fourier series representations.i
Cited by 0Open access
Mark Doderer, Kihoon Yoon, John T. Salinas et al. · In Silico Biology · 2006
In silico prediction of protein subcellular localization based on amino acid sequence can reveal valuable information about the protein's innate roles in the cell. Unfortunately, such prediction is made difficult because of complex protein sorting signals. Some prediction methods are based on searching for similar proteins with known localization, assuming that known homologs exist. However, it may not perform well on proteins with no known homolog. In contrast, machine learning-based approaches attempt to infer a predictive model that describes the protein sorting signals. Alas, in doing so, it does not take advantage of known homologs (if they exist) by doing a simple "table lookup". Here, we capture the best of both worlds by combining both approaches. On a dataset with 12 locations, similarity-based and machine learning independently achieve an accuracy of 83.8% and 72.6%, respectively. Our hybrid approach yields an improved accuracy of 85.9%. We compared our method with three other methods' published results. For two of the methods, we used their published datasets for comparison. For the third we used the 12 location dataset. The Error Correcting Output Code algorithm was used to construct our predictive model. This algorithm gives attention to all the classes regardless of number of instances and led to high accuracy among each of the classes and a high prediction rate overall. We also illustrated how the machine learning classifier we use, built over a meaningful set of features can produce interpretable rules that may provide valuable insights into complex protein sorting mechanisms.
Cited by 3
Rob Good · 1993
This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are characterised by the component or system involved ceasing to transmit or receive messages; effectively removing itself from the distributed system. Byzantine failures are typically ones where the component or system fails but continues to transmit invalid or incorrect messages causing failures or incorrect behaviour elsewhere in the system. Security breaches resulting in a system transmitting incorrect messages through malice rather than failure could also be viewed as a sort of Byzantine failure. In fact, by showing that a class of Byzantine failures and certain security breaches are equivalent, a solution of one will provide a solution for the other. 2 Error Correcting Codes
Cited by 0
Dmuchalsky, Theodore John. · eScholarship@McGill (McGill) · 1971
This thesis deals with error control techniques for the compound channel, and particularly with two new burst correcting techniques called compound-concatenated systems and GSA codes.Compound-concatenated systems are constructed by concatenating a random error correcting code with a burst correcting code, thereby giving the burst correcting code a large degree of immunity from noisy guard spaces.GSA codes are modified burst-trapping codes with the unique property that their adaptive guard space requirement is consecutive and immediately adjacent to the burst.These techniques and other, well-known burst correcting codes, interleaved block codes, diffuse codes, Gallager codes, and burst-trapping codes, are described in some detail and are compared with respect to their performance and their complexity of implementation.Also, insofar as they are important to the understanding of burst correcting methods, two random error correcting codes, linear binar,y codes (parity-check codes) and majority decodable convolution al codes, are described.,
Cited by 0Open access
Xiang Xie · 2000
Based on the background of fuzzy information in real world, this paper researches into the problem of how to encode and transmit fuzzy information by means of fuzzy logical method. The concept of fuzzy error correcting codes is introduced which can encode the fuzzy information. Such ideas as weight, distance and decoding criteria of fuzzy error correcting codes are discussed and the advantages of fuzzy error correcting codes over general ones are presented with the relationship between them. Then the authors put up models of fuzzy communication system. Linear fuzzy error correcting code is discussed and such basic properties of linear fuzzy error correcting code as generator matrix, dual code and so on are studied. By means of fuzzy neural network techniques, the authors get encoding and decoding schemes of linear fuzzy error correcting code. The simulation results clearly demonstrate the improvement in bit error ratio.
Cited by 0
Xinsheng Wang, Jianjun Xu · 2016
The event upset is the main concern of reliability in space communication. Among all event upset tolerant techniques, error detecting and correcting coding technique is simple and effective to protect the communication of micro-processor between the memory and register. This paper propose a second hamming code technique which can improve the error detecting and error correcting capacity based on minimum Hamming distance. Therefore, this second hamming code technique can be used in radiation hardened communication environment. Experiment results have also proved that second hamming code is complexity and is effective to error detecting and correcting.
Cited by 1
A.A. Ali, I.A. Al-Kadi · 1987
Repetition code, diversity and single error correcting codes are examined for use with binary modulation techniques over the faded mobile channel. Both bit-error performance and bandwidth efficiency are considered for PSK, DPSK and FSK modulations. The error correction capability of repetition coding is first considered and optimum repetitions is found. M-tuple diversity with maximum-ratio-combining MRC is then compared with repetition coding both with a single error-correcting code and without coding.
Cited by 1
NASA Technical Reports Server (NASA)
Digital data processing and error correcting code techniques applied to Apollo unified S band communication system
Cited by 0Open access
Noriaki Minami, Masao Kasahara · International journal of intelligent engineering and systems · 2008
We have proposed an information embedding method of a new class of digital watermark based on error correcting codes and cryptographic techniques. This method can detect the forgery of the digital image data. In this paper, we propose a new technique which can realize an embedding of the information, detecting the falsification and decoding of the original image for digital watermark based on error correcting code and cryptographic techniques.
Cited by 0Open access
Volodymyr Riznyk, Daniel Skrybaylo-Leskiv · 2017
This paper deals with design of correcting data binary code using mathematical properties of the combinatorial configurations for optimizing of coding systems with respect to error protection, while maintaining on code length. These properties make combinatorial techniques useful to development of the info-communication systems with active redundancy and minimization of algorithmic process complexity. Combinatorial configurations such as cyclic difference sets and “Ideal Ring Bundles” are well applicable for error-correcting design.
Cited by 0
Daniel J. Costello, Robert H. Deng · NASA STI Repository (National Aeronautics and Space Administration) · 1985
A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K-bit DRAM's are organized in 32Kx8 bit-bytes. Byte oriented codes such as Reed Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this paper we present some special decoding techniques for extended single-and-double-error-correcting RS codes which are capable of high speed operation. These techniques are designed to find the error locations and the error values directly from the syndrome without having to use the iterative alorithm to find the error locator polynomial. Two codes are considered: (1) a d sub min = 4 single-byte-error-correcting (SBEC), double-byte-error-detecting (DBED) RS code; and (2) a d sub min = 6 double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS code.
Cited by 0Open access
J. C. Hancock, R. G. Marquart · Defense Technical Information Center (DTIC) · 1965
Several techniques designed to reduce the probability of error in the transmission of digital data are evaluated. Three coding techniques are investigated, and the perlimit error probability at the decoder output, as a function of that at its input, is obtained for each of the three. The three codes are the Hamming SEC code and the Wagner code (both considered as forward error correcting techniques and as error detection methods for a repeat-request system) and the Hamming DED code, which is additionally analyzed when operating in a partial error correcting, partial repeatrequest mode. Finally, the merit and, where applicable, the required feedback channel capacity are computed and presented graphically. Two reception techniques are also investigated. The first of these techniques is the null zone system; each transmission of a limit results in a simple accept-or-reject decision by the receiver and in retransmission until acceptance is obtained. The second technique, which is first postulated in this study, is essentially a timequantized version of sequential reception and is, therefore, termed a 'pseudo-sequential' system. (Author)
Cited by 0
Марковский, А. П., Саидреза Махмали, Турченко, Ю. А. et al. · Електронний архів наукових та освітніх матеріалів КПІ ім. Ігоря Сікорського (КПІ ім. Ігоря Сікорського) · 2013
Paper is dedicated to solving the problem of increasing the efficiency of detecting and correcting the data transmission burst errors brought on by external noises. For burst errors correction the utilization of special weighed check sum modification has been proposed. Algorithm for burst error detection and correction has been worked out. It has been shown that proposed techniques ensure superior data transformation error detecting and correcting effectiveness in compare to known correcting code.
Cited by 0Open access
A. A. Ovchinnikov · Scientific and technical journal of information technologies mechanics and optics · 2025
Error correction during data storage, processing, and transmission allows for ensuring data integrity. Channel coding techniques are used to counteract these errors. Noise in real systems is often correlated, whereas traditional coding and decoding approaches are based on decorrelation which in turn reduces the performance limits of channel coding. Polar codes, adopted as a coding scheme in the modern fifth-generation communication standard, demonstrate low error probabilities during decoding in memoryless channels. The current task is to investigate the suitability of polar codes for channels with memory, analyze their burst error-correcting capabilities, and compare them with known error- correcting coding methods. To evaluate burst error-correcting capability, the method of calculating the ranks of each submatrix of the parity-check matrix of a fixed-size polar code is used. The burst error-correcting capability of polar codes can be improved through a proposed interleaving procedure. The analysis of the burst error-correcting capability is carried out for short-length polar codes. An analysis of the burst error-correcting capability of polar codes has been performed. A comparison of burst error-correcting capabilities of polar codes with codes defined by random generator matrix, Gilbert codes and low-density parity-check codes was conducted. An analysis of the decoding error probability shows that standard polar code decoding algorithms do not achieve low error probabilities. The same decoding error probability 0.01 as for Gilbert channel is achieved by polar code in binary symmetric channel with an unconditional error probability two times as high. From the analysis, it can be concluded that the burst error-correcting capability of standard polar codes is low. The proposed interleaving approach improves the burst error-correcting capability and allows achieving values close to the Reiger bound. Further research directions may include developing decoding algorithms for polar codes adapted for channels with variable packet lengths
Cited by 0Open access
Fabrizio Pollara · Microelectronics · 2018
Error correction techniques based on the addition of redundancy to the original message can be used to control the error rate. The basic ideas of efficient error correction are illustrated in the following example of a Hamming code, a single-error-correcting code belonging to the first class of practical codes invented by Richard Hamming in 1948. Error correction codes can be divided into two different classes: block codes and convolutional codes. Error correcting codes have been applied to a variety of communication systems. Digital data are commonly transmitted between computer terminals, between aircraft, and from spacecraft. Block codes and convolutional codes have similar error-correcting capabilities and the same fundamental limitations. Error detection, which is generally easier to obtain than error correction, is used in applications where it is extremely important to get the correct message or otherwise flag it as unreliable and discard it or ask for retransmission, according to a prescribed protocol as used in automatic-repeat-request systems.
Cited by 0Open access
Wenlei Li · Highlights in Science Engineering and Technology · 2024
The performance analysis of Binary Phase Shift Keying (BPSK) and Quadrature Phase Shift Keying (QPSK) employing error-correcting code is highlighted in this work. Several error-correcting code types were employed via an Additive White Gaussian Noise (AWGN) channel to determine the bit error rate. Two techniques were utilized as encoders and decoders: hamming code and cyclic code. Source coding used Huffman coding. Essentially, signal energy to noise power density ratio (Eb/No) and the bit rate error (BER) were used to measure performance. Comparisons were also made between BPSK and QPSK in terms of symbol error capability. MATLAB R2022b was the program used for all the simulations. The conclusion is that different coding methods have a certain error correction range, and the signal-to-noise ratio (SNR) can only reduce the BER in the error correction range, and if it is not within the error correction range, it will increase the bit error rate.
Cited by 0Open access
Kristian Nybom, Jerker Björkqvist · 2006
Digital services are increasingly being delivered to user terminals over wireless multicast networks. When the target service requires uncorrupted data delivery, there is an increasing need for developing techniques for reliable content delivery. In multicast networks, the typical way of providing reliable content delivery is to apply forward error correcting techniques (FEC). In this paper, we introduce a modification to the Tornado code, where we combine the structures of Tornado codes and Hyper codes. Standard Tornado codes have the drawback that they are dependent on the error distribution on the data path. By combining the Tornado code with a Hyper code, we decrease the probability of the Tornado decoder failing due to inopportune error distribution in the source data. We demonstrate, based on a simulated transmission channel, that the error correcting performance is improved, at the cost of slightly longer decoding times, by using a combination of Hyper codes and Tornado codes, compared to the standard Tornado codes.
Cited by 2
Reed,I S · Defense Technical Information Center (DTIC) · 1984
During this quarter, the error trellis syndrome decoding techniques for convolutional codes was developed. This algorithm is specialized then to the entire class of systematic convolutional codes. Finally, this algorithm is applied to the high rate Wyner-Ash convolutional codes. A special example of the one-error-correcting Wyner-Ash code, a 3/4 rate code is treated in this report. (Author)
Cited by 0
Milap Sheth, Sara Zafar Jafarzadeh, Vlad Gheorghiu · Physical review. A/Physical review, A · 2020
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been proposed that achieve approximately optimal error thresholds. Due to practical constraints, it is not known if there exists an obvious choice for a decoder. In this paper, we introduce a framework which can combine arbitrary decoders for any given code to significantly reduce the logical error rates. We rely on the crucial observation that two different decoding techniques, while possibly having similar logical error rates, can perform differently on the same error syndrome. We classify each error syndrome to the decoder which is more likely to decode it correctly using machine learning techniques. We apply our framework to an ensemble of minimum-weight perfect matching (MWPM) and hard-decision re-normalization-group decoders for the surface code in the depolarizing noise model. Our simulations show an improvement of 38.4%, 14.6%, and 7.1% over the pseudothreshold of MWPM in the instance of distance 5, 7, and 9 codes, respectively. Lastly, we discuss the advantages and limitations of our framework and applicability to other error-correcting codes. Our framework can provide a significant boost to error correction by combining the strengths of various decoders. In particular, it may allow for combining very fast decoders with moderate error-correcting capability to create a very fast ensemble decoder with high error-correcting capability.
Cited by 24Open access