A NEW CLASS OF FORWARD ERROR CORRECTING CODES FOR BURST AND RANDOM ERRORS.
Item
-
Title
-
A NEW CLASS OF FORWARD ERROR CORRECTING CODES FOR BURST AND RANDOM ERRORS.
-
Identifier
-
AAI8801733
-
identifier
-
8801733
-
Creator
-
MANELA, DAVID.
-
Contributor
-
D. L. Schilling
-
Date
-
1987
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical
-
Abstract
-
A new class of error-correcting codes, with random and burst error correcting capability is described, (we will refer to it as the SM codes). A SM encoding method is provided comprising the steps of storing a block of data-bit in a memory, calculating parity-check symbols from parity-line symbols having p-bits per symbol along parity lines, and setting the parity-check symbols equal to the modulo p sum of the parity-line symbols. A SM decoding method is provided comprising the steps of storing an encoded data-bit sequence in memory. The encoded data-bit sequence includes a parity-check-symbol sequence which is stored in parity-memory cells, and data-bit sequence which is blocked and stored in information-memory cells. The parity-check symbols and the parity-line symbols along the parity lines in the information-memory cells are found. The count of each composite cell on a composite-error graph traversed by the path of each of the parity lines having an error is incremented and the largest-number cell in the composite-error graph having the largest number is determined. The largest number is compared to a threshold, and a new data symbol is chosen to minimize the count in the largest-number cell and substituted into the stored data-bit sequence.;The main features of this code are: (1) Extreme simplicity of design of the decoder as well as the encoder. For example, the decoding algorithm is of significantly less complexity than that of the Viterbi algorithm for the same error rate performance. (2) The codec is less complex and provides a higher throughput for the same error rate than other codes, such as Chase's Code Combiner. (3) The codec can be used for burst error correction and in this operation operates at the theoretical maximum efficiency as defined by the Rieger Bound.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
-
Program
-
Engineering
