Using the formulations of digit level CRC architecture, the checksum is divided into few blocks and predicted multiple-bit parity of the blocks are compared with the actual parity bits. After analyzing the parallel implementation of CRC, we present a formulation to generate a multiple-bit parity prediction structure to incorporate the fault detection architecture. In this paper, we present a multiple-bit parity-based fault detection architecture for parallel CRC computation. Finally, based on the all-cell error model, the proposed multiplier is only with 2.088% extra time overhead and 4.978% extra area overhead, and its probability of concurrent error detection reaches 99.999999%.Īs a result of huge advancements in VLSI technology, more and more complex circuits are being implemented making not only the whole digital system more prone to faults, but also the fault detector itself susceptible to faults resulting in the requirement of concurrent fault detection architecture of the encoders and decoders. Additionally, the paper creatively builds an all-cell error model for systolic or semi-systolic multipliers more practical than the conventional single stuck-at or single-cell error model. Furthermore, our method breaks through the key technical bottleneck of unacceptable time and area overheads in the coding, decoding and checking process. Second, a semi-systolic array is compressed to realize our multiplier which is suitable for almost any finite field with low time and area complexity. Then the finite field arithmetic multiplication with error detection is simplified on a residue class ring resulting from linear coding. First, our method is created to choose an appreciate generator polynomial for a linear code and an irreducible polynomial generating the finite field. In this paper, we propose a concurrent all-cell error detection semi-systolic polynomial basis multiplier based on coding theory which can realize high-speed calculation and high efficient error detection with low resource consumption. Finite field multipliers are widely applied in many domains such as coding theory and cryptography.
0 Comments
Leave a Reply. |