Showing papers on "BCH code published in 1981"
IBM1
TL;DR: A general algorithm is derived for the calculation of the error location polynomial in decoding a Bose-Chaudhuri-Hocquenguem (BCH) code and the application of the general algorithm to Berlekamp's algorithm is presented.
Abstract: A general algorithm is derived for the calculation of the error location polynomial in decoding a Bose-Chaudhuri-Hocquenguem (BCH) code. A shorter decoding time is required by the algorithm for low-weight errors because only a subset of the syndrome equations are to be satisfied. The application of the general algorithm to Berlekamp's algorithm is also presented.
32 citations
TL;DR: The use of BCH error-correcting codes in improving the performance of a stop-and-wait automatic repeat-request (ARQ) scheme over random error and Rayleigh fading channels is examined.
Abstract: This paper examines the use of BCH error-correcting codes in improving the performance of a stop-and-wait automatic repeat-request (ARQ) scheme over random error and Rayleigh fading channels. Two models are analyzed. The first model considers the effect of forward error correction on the mean wasted time per message. The second model assumes a Poisson arrival process for the messages and examines the effect of forward error correction on the mean time between the arrival of a message and its successful transmission. In both models, our results indicate that the performance of the ARQ scheme can be substantially improved by the use of forward error correction.
29 citations
TL;DR: A decoding algorithm for triple and quadruple error-correcting BCH codes where the fourth-or lower-order equations are reduced to the quadratic equation and the efficiency is good and is also independent of the code length.
Abstract: The error-correcting codes have been used extensively to increase the reliability of digital systems in data communication. However, with increasing error-correcting capability, the complexity of decoders also increases. At present, only one-bit and two-bit error-correcting codes are used. This paper proposes a decoding algorithm for triple and quadruple error-correcting BCH codes. In decoding the BCH codes, the error-locator polynomials must be solved by Chien's algorithm. In his method, however, with increasing code length, the decoder becomes complicated and the efficiency deteriorates. In the method proposed in this paper, the fourth-or lower-order equations are reduced to the quadratic equation and, therefore, the efficiency is good. This method is also independent of the code length. Its function and efficiency are confirmed by simulation using microcomputer. The present decoding algorithm enables one to realize an efficient decoder with hardware construction using the ROM.
2 citations
30 Sep 1981
TL;DR: Several methods for increasing bit transition densities in a data stream are summarized, discussed in detail, and compared against constraints imposed by the 2 MHz data link of the space shuttle high rate multiplexer unit.
Abstract: Several methods for increasing bit transition densities in a data stream are summarized, discussed in detail, and compared against constraints imposed by the 2 MHz data link of the space shuttle high rate multiplexer unit. These methods include use of alternate pulse code modulation waveforms, data stream modification by insertion, alternate bit inversion, differential encoding, error encoding, and use of bit scramblers. The psuedo-random cover sequence generator was chosen for application to the 2 MHz data link of the space shuttle high rate multiplexer unit. This method is fully analyzed and a design implementation proposed.