Fault tolerant and fault testable hardware design
Fault tolerant and fault testable hardware design
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Expediting factor-type fast finite field transform algorithms
IEEE Transactions on Information Theory
Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Fast Transforms: Algorithms, Analyses, Applications
Fast Transforms: Algorithms, Analyses, Applications
Error-Correction Coding for Digital Communications
Error-Correction Coding for Digital Communications
Microprogrammed Control and Reliable Design of Small Computers
Microprogrammed Control and Reliable Design of Small Computers
Multibit Correcting Data Interface for Fault-Tolerant Systems
IEEE Transactions on Computers
Problems of Information Transmission
Design of parallel fault-secure encoders for systematic cyclic block transmission codes
Microelectronics Journal
| Hi-index | 14.98 |
High-speed cyclic code decoders, which are central to modern communication systems, when implemented in dense very large scale integration (VLSI), are susceptible to pernicious momentary internal soft fails presenting a demanding error-control challenge. However, special structures inherent in such decoders offer new methods for incorporating distributed error control throughout their designs. The underlying design principles and motivations are emphasized providing a variety of options to meet various requirements. Bose-Chaudhuri-Hocquenghem (BCH) codes are used to exemplify the new techniques as applied to the usual three standard subsystems present in a decoder. The first and last parts, syndrome calculations and transform inversion, both involve finite field transforms suggesting the effective application of fast transform algorithms. Error control features are based upon the chord properties of the transform coefficients including even fast algorithms. The third subsystem, the Berlekamp-Massey algorithm, can be protected through a chord recursion property affiliated with the error location connection polynomial. The propagation and spread of internal errors are studied and a special sink register compares several quantities, available in close proximity, to their easily recomputed counterparts. Most of these results are applicable to generalized to decoders for codes over higher ordered alphabets such as Reed-Solomon codes.