Bit serial fault tolerant architectures for convolution and polynomial evaluation

The authors present three distinct serial-input serial-output architectures: two for the computation of discrete convolution (bit-sliced and polyphase convolvers) and one for polynomial evaluation (polynomiers). These devices operate in serial fixed point natural arithmetic. All architectures are characterized by a bit-sliced structure that makes possible easy design and testing. The regular, uniform bit-slices also give the possibility of introducing functional reconfigurability and fault tolerance. For all these reasons, the proposed three architectures are good candidates for VLSI and WSI (wafer scale integration) implementation. Prototypal layouts, testing procedures, and statistical analysis have been developed for the evaluation of the architecture performances, the introduction of fault tolerance, and the study of the obtained fault coverage, reliability, and fabrication yield.<<ETX>>

[1]  Vincenzo Piuri,et al.  Fast pipelined multipliers for bit-serial complex numbers , 1991, [1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications.

[2]  L. Dadda Byte-serial convolvers , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.

[3]  Luca Breveglieri,et al.  A serial-input serial-output bit-sliced convolver , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[4]  Arnold L. Rosenberg,et al.  The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.

[5]  Luca Breveglieri,et al.  Testing of serial input convolvers , 1989 .

[6]  Luigi Dadda A polyphase architecture for serial-input convolvers , 1990, J. VLSI Signal Process..

[7]  Krishan K. Sabnani,et al.  A Protocol Test Generation Procedure , 1988, Comput. Networks.

[8]  Luca Breveglieri Design and implementation of a VLSI serial multiplier for fixed point numbers with self-checking capability , 1988 .