The very large-scale integration (VLSI) architecture of a single chip (255, 223) Reed-Solomon decoder for decoding both errors and erasures is described. A decoding failure detection capability is also included in this system so that the decoder will recognize a failure to decode instead of introducing additional errors. This could happen whenever the received word contains too many errors and erasures for the code to correct. The number of transistors needed to implement this decoder is estimated at about 75,000 if the delay for received message is not included. This is in contrast to the older transform decoding algorithm which needs about 100,000 transistors. However, the transform decoder is simpler in architecture than the time decoder. It is therefore possible to implement a single chip (255, 223) Reed-Solomon decoder with today's VLSI technology. An implementation strategy for the decoder system is presented. This represents the first step in a plan to take advantage of advanced coding techniques to realize a 2.0 dB coding gain for future space missions.
[1]
W. W. Peterson,et al.
Error-Correcting Codes.
,
1962
.
[2]
H. T. Kung,et al.
Systolic VLSI Arrays for Polynomial GCD Computation
,
1984,
IEEE Transactions on Computers.
[3]
Trieu-Kien Truong,et al.
A decoding failure test for the transform decoder of Reed-Solomon code
,
1981
.
[4]
Trieu-Kien Truong,et al.
A single chip VLSI Reed-Solomon decoder
,
1986,
ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[5]
Trieu-Kien Truong,et al.
A VLSI Design of a Pipeline Reed-Solomon Decoder
,
1985,
IEEE Transactions on Computers.
[6]
Ke Wang,et al.
The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm
,
1984,
IEEE Transactions on Computers.
[7]
L. J. Deutsch,et al.
On the error statistics of Viterbi decoding and the performance of concatenated codes
,
1981
.